X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FAnalysis%2FInterval.cpp;h=16b19472307149afcb7546cc0cabb6da211afa56;hb=5aa4977fba97e816b5735f0bc53f16a46b24de63;hp=1f91fdef544a7f79ba78ce2bf7f3f3e9c63275a2;hpb=cf3056db0fee1db7921214b1f25cea04e959e105;p=oota-llvm.git diff --git a/lib/Analysis/Interval.cpp b/lib/Analysis/Interval.cpp index 1f91fdef544..16b19472307 100644 --- a/lib/Analysis/Interval.cpp +++ b/lib/Analysis/Interval.cpp @@ -1,5 +1,12 @@ //===- Interval.cpp - Interval class code ---------------------------------===// // +// The LLVM Compiler Infrastructure +// +// This file 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 +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(o, "\n")); + for (std::vector::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(o, "\n")); - + for (std::vector::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(o, "\n")); + for (std::vector::const_iterator I = Successors.begin(), + E = Successors.end(); I != E; ++I) + o << **I << "\n"; }