Searched refs:nodeVisitNumbers (Results 1 – 2 of 2) sorted by relevance
70 DenseMap<NodeType *, unsigned> nodeVisitNumbers; variable135 assert(nodeVisitNumbers.count(Old) && "Old not in scc_iterator?"); in ReplaceNode()136 nodeVisitNumbers[New] = nodeVisitNumbers[Old]; in ReplaceNode()137 nodeVisitNumbers.erase(Old); in ReplaceNode()144 nodeVisitNumbers[N] = visitNum; in DFSVisitOne()160 nodeVisitNumbers.find(childN); in DFSVisitChildren()161 if (Visited == nodeVisitNumbers.end()) { in DFSVisitChildren()191 nodeVisitNumbers[visitingN] << "\n"; in GetNextSCC()194 if (minVisitNum != nodeVisitNumbers[visitingN]) in GetNextSCC()204 nodeVisitNumbers[CurrentSCC.back()] = ~0U; in GetNextSCC()
51 DenseMap<NodeType *, unsigned> nodeVisitNumbers; variable71 nodeVisitNumbers[N] = visitNum; in DFSVisitOne()85 if (!nodeVisitNumbers.count(childN)) { in DFSVisitChildren()91 unsigned childNum = nodeVisitNumbers[childN]; in DFSVisitChildren()115 if (minVisitNum != nodeVisitNumbers[visitingN]) in GetNextSCC()125 nodeVisitNumbers[CurrentSCC.back()] = ~0U; in GetNextSCC()190 assert(nodeVisitNumbers.count(Old) && "Old not in scc_iterator?"); in ReplaceNode()191 nodeVisitNumbers[New] = nodeVisitNumbers[Old]; in ReplaceNode()192 nodeVisitNumbers.erase(Old); in ReplaceNode()