reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
102 NumToNode = {nullptr}; // Restore to initial state with a dummy start node. 233 NumToNode.push_back(BB); 283 VInfo = &NodeToInfo[NumToNode[VInfo->Parent]]; 305 const unsigned NextDFSNum(NumToNode.size()); 308 const NodePtr V = NumToNode[i]; 310 VInfo.IDom = NumToNode[VInfo.Parent]; 316 NodePtr W = NumToNode[i]; 340 const NodePtr W = NumToNode[i]; 342 const unsigned SDomNum = NodeToInfo[NumToNode[WInfo.Semi]].DFSNum; 358 assert(NumToNode.size() == 1 && "SNCAInfo must be freshly constructed"); 364 NumToNode.push_back(nullptr); // NumToNode[1] = nullptr; 419 << BlockNamePrinter(SNCA.NumToNode[Num]) << "\n"); 458 const NodePtr FurthestAway = SNCA.NumToNode[NewNum]; 467 const NodePtr N = SNCA.NumToNode[i]; 471 SNCA.NumToNode.pop_back(); 478 << BlockNamePrinter(SNCA.NumToNode[i]) << "\n"); 486 << i << ": " << BlockNamePrinter(SNCA.NumToNode[i]) << "\n"); 529 const NodePtr N = SNCA.NumToNode[x]; 596 NodeToInfo[NumToNode[1]].IDom = AttachTo->getBlock(); 598 for (size_t i = 1, e = NumToNode.size(); i != e; ++i) { 599 NodePtr W = NumToNode[i]; 619 NodeToInfo[NumToNode[1]].IDom = AttachTo->getBlock(); 620 for (size_t i = 1, e = NumToNode.size(); i != e; ++i) { 621 const NodePtr N = NumToNode[i]; 1103 const NodePtr N = SNCA.NumToNode[i]; 1323 for (const NodePtr N : NumToNode) {