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()
234 std::vector<typename GraphT::NodeType*> PredBlocks; in Split() local239 PredBlocks.push_back(*PI); in Split()241 assert(!PredBlocks.empty() && "No predblocks?"); in Split()259 for (i = 0; i < PredBlocks.size(); ++i) in Split()260 if (DT.isReachableFromEntry(PredBlocks[i])) { in Split()261 NewBBIDom = PredBlocks[i]; in Split()271 for (i = i + 1; i < PredBlocks.size(); ++i) { in Split()272 if (DT.isReachableFromEntry(PredBlocks[i])) in Split()273 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); in Split()
803 std::vector<NodeRef> PredBlocks;805 PredBlocks.push_back(Pred);807 assert(!PredBlocks.empty() && "No predblocks?");822 for (i = 0; i < PredBlocks.size(); ++i)823 if (isReachableFromEntry(PredBlocks[i])) {824 NewBBIDom = PredBlocks[i];833 for (i = i + 1; i < PredBlocks.size(); ++i) {834 if (isReachableFromEntry(PredBlocks[i]))835 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);