235   std::map<Instruction *, NodePtr> RootToNode;  member in __anon87c1be940111::ComplexDeinterleavingGraph
1427   auto It = RootToNode.find(RootI);  in identifyNodes()
1428   if (It != RootToNode.end()) {  in identifyNodes()
1455   RootToNode[RootI] = RootNode;  in identifyNodes()
1554         RootToNode[Real] = RootNode;  in identifyReductionNodes()
1555         RootToNode[Imag] = RootNode;  in identifyReductionNodes()
1570   for (auto &Pair : RootToNode)  in checkNodes()
1594     if (RootToNode.count(I))  in checkNodes()
1618     if (RootToNode.count(I)) {  in checkNodes()
1622       RootToNode.erase(I);  in checkNodes()
1636   return !RootToNode.empty();  in checkNodes()
2050     if (!RootToNode.count(RootInstruction))  in replaceNodes()
2054     auto RootNode = RootToNode[RootInstruction];  in replaceNodes()