llvm::Interval Class Reference

#include <Interval.h>

List of all members.

Public Types
typedef std::vector < BasicBlock * >::iterator	succ_iterator
typedef std::vector < BasicBlock * >::iterator	pred_iterator
typedef std::vector < BasicBlock * >::iterator	node_iterator
Public Member Functions
	Interval (BasicBlock *Header)
	Interval (const Interval &I)
BasicBlock *	getHeaderNode () const
bool	contains (BasicBlock *BB) const
	contains - Find out if a basic block is in this interval
bool	isSuccessor (BasicBlock *BB) const
	isSuccessor - find out if a basic block is a successor of this Interval
bool	operator== (const Interval &I) const
bool	isLoop () const
	isLoop - Find out if there is a back edge in this interval...
void	print (raw_ostream &O) const
	print - Show contents in human readable format...
Public Attributes
std::vector< BasicBlock * >	Nodes
std::vector< BasicBlock * >	Successors
std::vector< BasicBlock * >	Predecessors

---

Detailed Description

Interval Class - An Interval is a set of nodes defined such that every node in the interval has all of its predecessors in the interval (except for the header)

---

Member Function Documentation

bool llvm::Interval::operator==

(

const Interval &

I

)

const [inline]

Equality operator. It is only valid to compare two intervals from the same partition, because of this, all we have to check is the header node for equality.

---

Member Data Documentation

std::vector<BasicBlock*> llvm::Interval::Nodes

Nodes - The basic blocks in this interval.

std::vector<BasicBlock*> llvm::Interval::Predecessors

Predecessors - List of BasicBlocks that have this Interval's header block as one of their successors.

std::vector<BasicBlock*> llvm::Interval::Successors

Successors - List of BasicBlocks that are reachable directly from nodes in this interval, but are not in the interval themselves. These nodes necessarily must be header nodes for other intervals.

---

The documentation for this class was generated from the following file:

• Interval.h