Searched refs:PredBlocks (Results 1 – 3 of 3) sorted by relevance
261 std::vector<typename GraphT::NodeType *> PredBlocks; in Split() local267 PredBlocks.push_back(*PI); in Split()269 assert(!PredBlocks.empty() && "No predblocks?"); in Split()288 for (i = 0; i < PredBlocks.size(); ++i) in Split()289 if (DT.isReachableFromEntry(PredBlocks[i])) { in Split()290 NewBBIDom = PredBlocks[i]; in Split()300 for (i = i + 1; i < PredBlocks.size(); ++i) { in Split()301 if (DT.isReachableFromEntry(PredBlocks[i])) in Split()302 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); in Split()
780 std::vector<NodeRef> PredBlocks;782 PredBlocks.push_back(Pred);784 assert(!PredBlocks.empty() && "No predblocks?");799 for (i = 0; i < PredBlocks.size(); ++i)800 if (isReachableFromEntry(PredBlocks[i])) {801 NewBBIDom = PredBlocks[i];810 for (i = i + 1; i < PredBlocks.size(); ++i) {811 if (isReachableFromEntry(PredBlocks[i]))812 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
839 SmallVector<NodeRef, 4> PredBlocks;841 PredBlocks.push_back(Pred);843 assert(!PredBlocks.empty() && "No predblocks?");858 for (i = 0; i < PredBlocks.size(); ++i)859 if (isReachableFromEntry(PredBlocks[i])) {860 NewBBIDom = PredBlocks[i];869 for (i = i + 1; i < PredBlocks.size(); ++i) {870 if (isReachableFromEntry(PredBlocks[i]))871 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);