Searched refs:PredBlocks (Results 1 - 1 of 1) sorted by relevance

/external/llvm/include/llvm/Support/
H A DGenericDomTree.h260 std::vector<typename GraphT::NodeType *> PredBlocks; local
266 PredBlocks.push_back(*PI);
268 assert(!PredBlocks.empty() && "No predblocks?");
287 for (i = 0; i < PredBlocks.size(); ++i)
288 if (DT.isReachableFromEntry(PredBlocks[i])) {
289 NewBBIDom = PredBlocks[i];
299 for (i = i + 1; i < PredBlocks.size(); ++i) {
300 if (DT.isReachableFromEntry(PredBlocks[i]))
301 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);

Completed in 47 milliseconds