55 struct TrieEdge : public llvm::ilist_node<TrieEdge> {  struct
56   TrieEdge(StringRef s, TrieNode *node) : _subString(s), _child(node) {}  in TrieEdge()  function
68 using lld::mach_o::normalized::TrieEdge;  argument
70 struct ilist_alloc_traits<TrieEdge> : ilist_noalloc_traits<TrieEdge> {};
79   typedef llvm::ilist<TrieEdge> TrieEdgeList;
1263   for (TrieEdge &edge : _children) {  in addSymbol()
1286         TrieEdge& abEdge = edge;  in addSymbol()
1289         auto *bcEdge = new (allocator) TrieEdge(bcEdgeStr, cNode);  in addSymbol()
1304   auto *newEdge = new (allocator) TrieEdge(partialStr, newNode);  in addSymbol()
1327   for (TrieEdge &edge : _children) {  in addOrderedNodes()
1355   for (TrieEdge &edge : _children) {  in updateOffset()
1420   for (TrieEdge &edge : _children) {  in appendToByteBuffer()