Searched refs:PrevIDom (Results 1 – 2 of 2) sorted by relevance
892 BasicBlock *PrevIDom = *BBSet.begin(); in applyInsertUpdates() 894 PrevIDom = DT.findNearestCommonDominator(PrevIDom, BB); in applyInsertUpdates() 895 return PrevIDom; in applyInsertUpdates() 898 // Get all blocks that dominate PrevIDom, stop when reaching CurrIDom. Do not in applyInsertUpdates() 901 [&](BasicBlock *PrevIDom, BasicBlock *CurrIDom, in applyInsertUpdates() 903 if (PrevIDom == CurrIDom) in applyInsertUpdates() 905 BlocksPrevDom.push_back(PrevIDom); in applyInsertUpdates() 906 BasicBlock *NextIDom = PrevIDom; in applyInsertUpdates() 1056 BasicBlock *PrevIDom in applyInsertUpdates() 917 BasicBlock *PrevIDom = *BBSet.begin(); applyInsertUpdates() local 927 __anona8fdc1f80802(BasicBlock *PrevIDom, BasicBlock *CurrIDom, SmallVectorImpl<BasicBlock *> &BlocksPrevDom) applyInsertUpdates() argument 1081 BasicBlock *PrevIDom = FindNearestCommonDominator(PrevBlockSet); applyInsertUpdates() local [all...]
1093 const TreeNodePtr PrevIDom = MinNode->getIDom(); in DeleteUnreachable() local1094 assert(PrevIDom); in DeleteUnreachable()1105 << BlockNamePrinter(PrevIDom) << "\nRunning Semi-NCA\n"); in DeleteUnreachable()1109 SNCA.reattachExistingSubtree(DT, PrevIDom); in DeleteUnreachable()