24   SmallVector<const HashNode *> Stack;  in walkGraph()
32     auto HandleNext = [&](const HashNode *Next) {  in walkGraph()
38       SmallVector<std::pair<stable_hash, const HashNode *>> SortedSuccessors;  in walkGraph()
53   walkGraph([&Size, GetTerminalCountOnly](const HashNode *N) {  in size()
61   DenseMap<const HashNode *, size_t> DepthMap;  in depth()
63                 const HashNode *N) { Size = std::max(Size, DepthMap[N]); },  in depth()
64             [&DepthMap](const HashNode *Src, const HashNode *Dst) {  in depth()
73   HashNode *Current = getRoot();  in insert()
78       std::unique_ptr<HashNode> Next = std::make_unique<HashNode>();  in insert()
79       HashNode *NextPtr = Next.get();  in insert()
91   HashNode *Dst = getRoot();  in merge()
92   const HashNode *Src = Tree->getRoot();  in merge()
93   SmallVector<std::pair<HashNode *, const HashNode *>> Stack;  in merge()
104       HashNode *NextDstNode;  in merge()
107         auto NextDst = std::make_unique<HashNode>();  in merge()
121   const HashNode *Current = getRoot();  in find()