Searched refs:PredBlocks (Results 1 – 1 of 1) sorted by relevance
259 std::vector<typename GraphT::NodeType *> PredBlocks; in Split() local265 PredBlocks.push_back(*PI); in Split()267 assert(!PredBlocks.empty() && "No predblocks?"); in Split()286 for (i = 0; i < PredBlocks.size(); ++i) in Split()287 if (DT.isReachableFromEntry(PredBlocks[i])) { in Split()288 NewBBIDom = PredBlocks[i]; in Split()298 for (i = i + 1; i < PredBlocks.size(); ++i) { in Split()299 if (DT.isReachableFromEntry(PredBlocks[i])) in Split()300 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]); in Split()