1 //===- Interval.cpp - Interval class code ---------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // 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/IR/BasicBlock.h" 17 #include "llvm/IR/CFG.h" 18 #include "llvm/Support/raw_ostream.h" 19 #include <algorithm> 20 21 using namespace llvm; 22 23 //===----------------------------------------------------------------------===// 24 // Interval Implementation 25 //===----------------------------------------------------------------------===// 26 27 // isLoop - Find out if there is a back edge in this interval... 28 // 29 bool Interval::isLoop() const { 30 // There is a loop in this interval iff one of the predecessors of the header 31 // node lives in the interval. 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); 33 I != E; ++I) 34 if (contains(*I)) 35 return true; 36 return false; 37 } 38 39 40 void Interval::print(raw_ostream &OS) const { 41 OS << "-------------------------------------------------------------\n" 42 << "Interval Contents:\n"; 43 44 // Print out all of the basic blocks in the interval... 45 for (const BasicBlock *Node : Nodes) 46 OS << *Node << "\n"; 47 48 OS << "Interval Predecessors:\n"; 49 for (const BasicBlock *Predecessor : Predecessors) 50 OS << *Predecessor << "\n"; 51 52 OS << "Interval Successors:\n"; 53 for (const BasicBlock *Successor : Successors) 54 OS << *Successor << "\n"; 55 } 56
