Build the correct range for loops with unusual bounds. Fix from Jay Foad.
[oota-llvm.git] / lib / Analysis / Interval.cpp
index 1f91fdef544a7f79ba78ce2bf7f3f3e9c63275a2..404d2c2f4a88c423c316c79ad190f169c976314f 100644 (file)
@@ -1,5 +1,12 @@
 //===- Interval.cpp - Interval class code ---------------------------------===//
 //
+//                     The LLVM Compiler Infrastructure
+//
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
 // This file contains the definition of the Interval class, which represents a
 // partition of a control flow graph of some kind.
 //
@@ -10,6 +17,8 @@
 #include "llvm/Support/CFG.h"
 #include <algorithm>
 
+using namespace llvm;
+
 //===----------------------------------------------------------------------===//
 // Interval Implementation
 //===----------------------------------------------------------------------===//
@@ -30,16 +39,19 @@ bool Interval::isLoop() const {
 void Interval::print(std::ostream &o) const {
   o << "-------------------------------------------------------------\n"
        << "Interval Contents:\n";
-  
+
   // Print out all of the basic blocks in the interval...
-  std::copy(Nodes.begin(), Nodes.end(), 
-            std::ostream_iterator<BasicBlock*>(o, "\n"));
+  for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
+         E = Nodes.end(); I != E; ++I)
+    o << **I << "\n";
 
   o << "Interval Predecessors:\n";
-  std::copy(Predecessors.begin(), Predecessors.end(), 
-            std::ostream_iterator<BasicBlock*>(o, "\n"));
-  
+  for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(),
+         E = Predecessors.end(); I != E; ++I)
+    o << **I << "\n";
+
   o << "Interval Successors:\n";
-  std::copy(Successors.begin(), Successors.end(), 
-            std::ostream_iterator<BasicBlock*>(o, "\n"));
+  for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
+         E = Successors.end(); I != E; ++I)
+    o << **I << "\n";
 }