1f22ef01cSRoman Divacky //===- Interval.cpp - Interval class code ---------------------------------===// 2f22ef01cSRoman Divacky // 3f22ef01cSRoman Divacky // The LLVM Compiler Infrastructure 4f22ef01cSRoman Divacky // 5f22ef01cSRoman Divacky // This file is distributed under the University of Illinois Open Source 6f22ef01cSRoman Divacky // License. See LICENSE.TXT for details. 7f22ef01cSRoman Divacky // 8f22ef01cSRoman Divacky //===----------------------------------------------------------------------===// 9f22ef01cSRoman Divacky // 10f22ef01cSRoman Divacky // This file contains the definition of the Interval class, which represents a 11f22ef01cSRoman Divacky // partition of a control flow graph of some kind. 12f22ef01cSRoman Divacky // 13f22ef01cSRoman Divacky //===----------------------------------------------------------------------===// 14f22ef01cSRoman Divacky 15f22ef01cSRoman Divacky #include "llvm/Analysis/Interval.h" 16139f7f9bSDimitry Andric #include "llvm/IR/BasicBlock.h" 1791bc56edSDimitry Andric #include "llvm/IR/CFG.h" 18f22ef01cSRoman Divacky #include "llvm/Support/raw_ostream.h" 19f22ef01cSRoman Divacky 20f22ef01cSRoman Divacky using namespace llvm; 21f22ef01cSRoman Divacky 22f22ef01cSRoman Divacky //===----------------------------------------------------------------------===// 23f22ef01cSRoman Divacky // Interval Implementation 24f22ef01cSRoman Divacky //===----------------------------------------------------------------------===// 25f22ef01cSRoman Divacky 26f22ef01cSRoman Divacky // isLoop - Find out if there is a back edge in this interval... isLoop() const27f22ef01cSRoman Divackybool Interval::isLoop() const { 28f22ef01cSRoman Divacky // There is a loop in this interval iff one of the predecessors of the header 29f22ef01cSRoman Divacky // node lives in the interval. 30f22ef01cSRoman Divacky for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); 31f22ef01cSRoman Divacky I != E; ++I) 32f22ef01cSRoman Divacky if (contains(*I)) 33f22ef01cSRoman Divacky return true; 34f22ef01cSRoman Divacky return false; 35f22ef01cSRoman Divacky } 36f22ef01cSRoman Divacky print(raw_ostream & OS) const37f22ef01cSRoman Divackyvoid Interval::print(raw_ostream &OS) const { 38f22ef01cSRoman Divacky OS << "-------------------------------------------------------------\n" 39f22ef01cSRoman Divacky << "Interval Contents:\n"; 40f22ef01cSRoman Divacky 41f22ef01cSRoman Divacky // Print out all of the basic blocks in the interval... 42*3ca95b02SDimitry Andric for (const BasicBlock *Node : Nodes) 43*3ca95b02SDimitry Andric OS << *Node << "\n"; 44f22ef01cSRoman Divacky 45f22ef01cSRoman Divacky OS << "Interval Predecessors:\n"; 46*3ca95b02SDimitry Andric for (const BasicBlock *Predecessor : Predecessors) 47*3ca95b02SDimitry Andric OS << *Predecessor << "\n"; 48f22ef01cSRoman Divacky 49f22ef01cSRoman Divacky OS << "Interval Successors:\n"; 50*3ca95b02SDimitry Andric for (const BasicBlock *Successor : Successors) 51*3ca95b02SDimitry Andric OS << *Successor << "\n"; 52f22ef01cSRoman Divacky } 53