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"
22 //===----------------------------------------------------------------------===//
23 // Interval Implementation
24 //===----------------------------------------------------------------------===//
26 // isLoop - Find out if there is a back edge in this interval...
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
);
33 if (contains(*I
)) return true;
39 void Interval::print(std::ostream
&o
) const {
40 o
<< "-------------------------------------------------------------\n"
41 << "Interval Contents:\n";
43 // Print out all of the basic blocks in the interval...
44 for (std::vector
<BasicBlock
*>::const_iterator I
= Nodes
.begin(),
45 E
= Nodes
.end(); I
!= E
; ++I
)
48 o
<< "Interval Predecessors:\n";
49 for (std::vector
<BasicBlock
*>::const_iterator I
= Predecessors
.begin(),
50 E
= Predecessors
.end(); I
!= E
; ++I
)
53 o
<< "Interval Successors:\n";
54 for (std::vector
<BasicBlock
*>::const_iterator I
= Successors
.begin(),
55 E
= Successors
.end(); I
!= E
; ++I
)