1
//===- Interval.cpp - Interval class code ---------------------------------===//
3
// The LLVM Compiler Infrastructure
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
8
//===----------------------------------------------------------------------===//
10
// This file contains the definition of the Interval class, which represents a
11
// partition of a control flow graph of some kind.
13
//===----------------------------------------------------------------------===//
15
#include "llvm/Analysis/Interval.h"
16
#include "llvm/BasicBlock.h"
17
#include "llvm/Support/CFG.h"
18
#include "llvm/Support/raw_ostream.h"
23
//===----------------------------------------------------------------------===//
24
// Interval Implementation
25
//===----------------------------------------------------------------------===//
27
// isLoop - Find out if there is a back edge in this interval...
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);
40
void Interval::print(raw_ostream &OS) const {
41
OS << "-------------------------------------------------------------\n"
42
<< "Interval Contents:\n";
44
// Print out all of the basic blocks in the interval...
45
for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46
E = Nodes.end(); I != E; ++I)
49
OS << "Interval Predecessors:\n";
50
for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(),
51
E = Predecessors.end(); I != E; ++I)
54
OS << "Interval Successors:\n";
55
for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
56
E = Successors.end(); I != E; ++I)