X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FAnalysis%2FPostDominators.cpp;h=4f9d1d160696f336866748311c1cdbf7642ad835;hb=1c51c6ac13b5e68b099605021784c7f552dcce3c;hp=ff202f0151ddaa34cdbf2e5ed8d8fd01a89dedb0;hpb=47b14a4a6a455c7be169cfd312fcbe796f0ad426;p=oota-llvm.git diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp index ff202f0151d..4f9d1d16069 100644 --- a/lib/Analysis/PostDominators.cpp +++ b/lib/Analysis/PostDominators.cpp @@ -14,8 +14,8 @@ #include "llvm/Analysis/PostDominators.h" #include "llvm/Instructions.h" #include "llvm/Support/CFG.h" -#include "Support/DepthFirstIterator.h" -#include "Support/SetOperations.h" +#include "llvm/ADT/DepthFirstIterator.h" +#include "llvm/ADT/SetOperations.h" using namespace llvm; //===----------------------------------------------------------------------===// @@ -40,8 +40,7 @@ bool PostDominatorSet::runOnFunction(Function &F) { for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) { Doms[I]; // Initialize to empty - if (isa(I->getTerminator()) || - isa(I->getTerminator())) + if (succ_begin(I) == succ_end(I)) Roots.push_back(I); } @@ -182,9 +181,8 @@ void PostDominatorTree::calculate(const PostDominatorSet &DS) { // be a predecessor in the depth first order that we are iterating through // the function. // - DominatorSet::DomSetType::const_iterator I = Dominators.begin(); - DominatorSet::DomSetType::const_iterator End = Dominators.end(); - for (; I != End; ++I) { // Iterate over dominators... + for (DominatorSet::DomSetType::const_iterator I = Dominators.begin(), + E = Dominators.end(); I != E; ++I) { // Iterate over dominators. // All of our dominators should form a chain, where the number // of elements in the dominator set indicates what level the // node is at in the chain. We want the node immediately