28     const auto *Current = Stack.pop_back_val();  in walkGraph()  local
30       CallbackNode(Current);  in walkGraph()
34         CallbackEdge(Current, Next);  in walkGraph()
39       for (const auto &[Hash, Successor] : Current->Successors)  in walkGraph()
45       for (const auto &P : Current->Successors)  in walkGraph()
73   HashNode *Current = getRoot();  in insert()  local
76     auto I = Current->Successors.find(StableHash);  in insert()
77     if (I == Current->Successors.end()) {  in insert()
81       Current->Successors.emplace(StableHash, std::move(Next));  in insert()
82       Current = NextPtr;  in insert()
84       Current = I->second.get();  in insert()
87     Current->Terminals = (Current->Terminals ? *Current->Terminals : 0) + Count;  in insert()
121   const HashNode *Current = getRoot();  in find()  local
123     const auto I = Current->Successors.find(StableHash);  in find()
124     if (I == Current->Successors.end())  in find()
126     Current = I->second.get();  in find()
128   return Current->Terminals;  in find()