Searched refs:PrevIDom (Results 1 – 2 of 2) sorted by relevance
917 BasicBlock *PrevIDom = *BBSet.begin(); in applyInsertUpdates() local919 PrevIDom = DT.findNearestCommonDominator(PrevIDom, BB); in applyInsertUpdates()920 return PrevIDom; in applyInsertUpdates()926 [&](BasicBlock *PrevIDom, BasicBlock *CurrIDom, in applyInsertUpdates()928 if (PrevIDom == CurrIDom) in applyInsertUpdates()930 BlocksPrevDom.push_back(PrevIDom); in applyInsertUpdates()931 BasicBlock *NextIDom = PrevIDom; in applyInsertUpdates()1081 BasicBlock *PrevIDom = FindNearestCommonDominator(PrevBlockSet); in applyInsertUpdates() local1082 assert(PrevIDom && "Previous IDom should exists"); in applyInsertUpdates()1085 assert(DT.dominates(NewIDom, PrevIDom) && in applyInsertUpdates()[all …]
1110 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable() local1111 assert(PrevIDom); in DeleteUnreachable()1122 << BlockNamePrinter(PrevIDom) << "\nRunning Semi-NCA\n"); in DeleteUnreachable()1126 SNCA.reattachExistingSubtree(DT, PrevIDom); in DeleteUnreachable()