X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FIR%2FDominators.cpp;h=d6649d6c7064bcc862abb2878b26ca524585da30;hb=540b4f6c08a089f487edad2befb7caf98c127ac5;hp=f45543a4e71f3569c7da713eeddfdc04aa3b589d;hpb=a4697dad1926a8c91c12cd6663f5ddc7c4cd16c7;p=oota-llvm.git

diff --git a/lib/IR/Dominators.cpp b/lib/IR/Dominators.cpp
index f45543a4e71..d6649d6c706 100644
--- a/lib/IR/Dominators.cpp
+++ b/lib/IR/Dominators.cpp
@@ -179,7 +179,9 @@ bool DominatorTree::dominates(const BasicBlockEdge &BBE,
   // trivially dominates itself, so we only have to find if it dominates the
   // other predecessors. Since the only way out of X is via NormalDest, X can
   // only properly dominate a node if NormalDest dominates that node too.
-  for (const BasicBlock *BB : predecessors(End)) {
+  for (const_pred_iterator PI = pred_begin(End), E = pred_end(End);
+       PI != E; ++PI) {
+    const BasicBlock *BB = *PI;
     if (BB == Start)
       continue;