Searched refs:PrevIDom (Results 1 – 2 of 2) sorted by relevance
870 BasicBlock *PrevIDom = *BBSet.begin(); in applyInsertUpdates() local872 PrevIDom = DT.findNearestCommonDominator(PrevIDom, BB); in applyInsertUpdates()873 return PrevIDom; in applyInsertUpdates()879 [&](BasicBlock *PrevIDom, BasicBlock *CurrIDom, in applyInsertUpdates()881 if (PrevIDom == CurrIDom) in applyInsertUpdates()883 BlocksPrevDom.push_back(PrevIDom); in applyInsertUpdates()884 BasicBlock *NextIDom = PrevIDom; in applyInsertUpdates()1035 BasicBlock *PrevIDom = FindNearestCommonDominator(PrevBlockSet); in applyInsertUpdates() local1036 assert(PrevIDom && "Previous IDom should exists"); in applyInsertUpdates()1039 assert(DT.dominates(NewIDom, PrevIDom) && in applyInsertUpdates()[all …]
1116 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable() local1117 assert(PrevIDom); in DeleteUnreachable()1128 << BlockNamePrinter(PrevIDom) << "\nRunning Semi-NCA\n"); in DeleteUnreachable()1132 SNCA.reattachExistingSubtree(DT, PrevIDom); in DeleteUnreachable()