1 //===- Interval.cpp - Interval class code ---------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file was developed by the LLVM research group and is distributed under 6 // the University of Illinois Open Source License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This file contains the definition of the Interval class, which represents a 11 // partition of a control flow graph of some kind. 12 // 13 //===----------------------------------------------------------------------===// 14 15 #include "llvm/Analysis/Interval.h" 16 #include "llvm/BasicBlock.h" 17 #include "llvm/Support/CFG.h" 18 #include <algorithm> 19 20 using namespace llvm; 21 22 //===----------------------------------------------------------------------===// 23 // Interval Implementation 24 //===----------------------------------------------------------------------===// 25 26 // isLoop - Find out if there is a back edge in this interval... 27 // 28 bool Interval::isLoop() const { 29 // There is a loop in this interval iff one of the predecessors of the header 30 // node lives in the interval. 31 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); 32 I != E; ++I) { 33 if (contains(*I)) return true; 34 } 35 return false; 36 } 37 38 39 void Interval::print(std::ostream &o) const { 40 o << "-------------------------------------------------------------\n" 41 << "Interval Contents:\n"; 42 43 // Print out all of the basic blocks in the interval... 44 std::copy(Nodes.begin(), Nodes.end(), 45 std::ostream_iterator<BasicBlock*>(o, "\n")); 46 47 o << "Interval Predecessors:\n"; 48 std::copy(Predecessors.begin(), Predecessors.end(), 49 std::ostream_iterator<BasicBlock*>(o, "\n")); 50 51 o << "Interval Successors:\n"; 52 std::copy(Successors.begin(), Successors.end(), 53 std::ostream_iterator<BasicBlock*>(o, "\n")); 54 } 55