54 struct TrieNode; // Forward declaration.
57   TrieEdge(StringRef s, TrieNode *node) : _subString(s), _child(node) {}  in TrieEdge()
60   struct TrieNode   *_child;
79 struct TrieNode {  struct
82   TrieNode(StringRef s)  in TrieNode()  argument
85   ~TrieNode() = default;
88                  std::vector<TrieNode *> &allNodes);
91                        std::vector<TrieNode *> &allNodes);
1251 void TrieNode::addSymbol(const Export& entry,  in addSymbol()
1253                          std::vector<TrieNode*> &allNodes) {  in addSymbol()
1268         auto *bNode = new (allocator) TrieNode(bNodeStr);  in addSymbol()
1270         TrieNode* cNode = edge._child;  in addSymbol()
1295   auto *newNode = new (allocator) TrieNode(entry.name.copy(allocator));  in addSymbol()
1311 void TrieNode::addOrderedNodes(const Export& entry,  in addOrderedNodes()
1312                                std::vector<TrieNode*> &orderedNodes) {  in addOrderedNodes()
1329 bool TrieNode::updateOffset(uint32_t& offset) {  in updateOffset()
1361 void TrieNode::appendToByteBuffer(ByteBuffer &out) {  in appendToByteBuffer()
1426   auto *rootNode = new (allocator) TrieNode(StringRef());  in buildExportTrie()
1427   std::vector<TrieNode*> allNodes;  in buildExportTrie()
1434   std::vector<TrieNode*> orderedNodes;  in buildExportTrie()
1446     for (TrieNode* node : orderedNodes) {  in buildExportTrie()
1453   for (TrieNode* node : orderedNodes) {  in buildExportTrie()