398     TreeNode *Child;  in addChildren()  local
405         Child = &Node.addNameChild(NameString, StringTable);  in addChildren()
408         Child = &Node.addIDChild(Entry.Identifier.ID);  in addChildren()
414           addChildren(*Child, RSR, NextTable, Origin, Context, Duplicates);  in addChildren()
428       TreeNode *Child;  in addChildren()  local
432                                      Origin, Data.size(), Child);  in addChildren()
441               Context, InputFilenames[Child->Origin], InputFilenames.back()));  in addChildren()
523   auto Child = IDChildren.find(ID);  in addIDChild()  local
524   if (Child == IDChildren.end()) {  in addIDChild()
530     return *(Child->second);  in addIDChild()
538   auto Child = StringChildren.find(NameString);  in addNameChild()  local
539   if (Child == StringChildren.end()) {  in addNameChild()
546     return *(Child->second);  in addNameChild()
552   for (auto const &Child : StringChildren) {  in print()  local
553     Child.second->print(Writer, Child.first);  in print()
555   for (auto const &Child : IDChildren) {  in print()  local
556     Child.second->print(Writer, to_string(Child.first));  in print()
577   for (auto const &Child : StringChildren) {  in getTreeSize()  local
578     Size += Child.second->getTreeSize();  in getTreeSize()
580   for (auto const &Child : IDChildren) {  in getTreeSize()  local
581     Size += Child.second->getTreeSize();  in getTreeSize()
592     for (auto &Child : IDChildren)  in shiftDataIndexDown()  local
593       Child.second->shiftDataIndexDown(Index);  in shiftDataIndexDown()
594     for (auto &Child : StringChildren)  in shiftDataIndexDown()  local
595       Child.second->shiftDataIndexDown(Index);  in shiftDataIndexDown()
898     for (auto const &Child : StringChildren) {  in writeDirectoryTree()  local
902           StringTableOffsets[Child.second->getStringIndex()]);  in writeDirectoryTree()
903       if (Child.second->checkIsDataNode()) {  in writeDirectoryTree()
906         DataEntriesTreeOrder.push_back(Child.second.get());  in writeDirectoryTree()
910                            (Child.second->getStringChildren().size() +  in writeDirectoryTree()
911                             Child.second->getIDChildren().size()) *  in writeDirectoryTree()
913         Queue.push(Child.second.get());  in writeDirectoryTree()
918     for (auto const &Child : IDChildren) {  in writeDirectoryTree()  local
921       Entry->Identifier.ID = Child.first;  in writeDirectoryTree()
922       if (Child.second->checkIsDataNode()) {  in writeDirectoryTree()
925         DataEntriesTreeOrder.push_back(Child.second.get());  in writeDirectoryTree()
929                            (Child.second->getStringChildren().size() +  in writeDirectoryTree()
930                             Child.second->getIDChildren().size()) *  in writeDirectoryTree()
932         Queue.push(Child.second.get());  in writeDirectoryTree()