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) More...
#include "llvm/Analysis/Interval.h"
Public Types | |
| using | succ_iterator = std::vector< BasicBlock * >::iterator |
| using | pred_iterator = std::vector< BasicBlock * >::iterator |
| using | node_iterator = std::vector< BasicBlock * >::iterator |
Public Member Functions | |
| Interval (BasicBlock *Header) | |
| 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 |
| Equality operator. | |
| void | print (raw_ostream &O) const |
| print - Show contents in human readable format... | |
Public Attributes | |
| std::vector< BasicBlock * > | Nodes |
| Nodes - The basic blocks in this interval. | |
| std::vector< BasicBlock * > | Successors |
| Successors - List of BasicBlocks that are reachable directly from nodes in this interval, but are not in the interval themselves. | |
| std::vector< BasicBlock * > | Predecessors |
| Predecessors - List of BasicBlocks that have this Interval's header block as one of their successors. | |
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)
Definition at line 36 of file Interval.h.
Member Typedef Documentation
◆ node_iterator
| using llvm::Interval::node_iterator = std::vector<BasicBlock*>::iterator |
Definition at line 45 of file Interval.h.
◆ pred_iterator
| using llvm::Interval::pred_iterator = std::vector<BasicBlock*>::iterator |
Definition at line 44 of file Interval.h.
◆ succ_iterator
| using llvm::Interval::succ_iterator = std::vector<BasicBlock*>::iterator |
Definition at line 43 of file Interval.h.
Constructor & Destructor Documentation
◆ Interval()
|
inline |
Definition at line 47 of file Interval.h.
References Nodes.
Member Function Documentation
◆ contains()
|
inline |
contains - Find out if a basic block is in this interval
Definition at line 66 of file Interval.h.
References Nodes.
◆ getHeaderNode()
|
inline |
Definition at line 51 of file Interval.h.
◆ isSuccessor()
|
inline |
isSuccessor - find out if a basic block is a successor of this Interval
Definition at line 76 of file Interval.h.
References llvm::Successor, and Successors.
◆ operator==()
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.
Definition at line 88 of file Interval.h.
References I.
◆ print()
| void Interval::print | ( | raw_ostream & | O | ) | const |
print - Show contents in human readable format...
Definition at line 24 of file Interval.cpp.
References Nodes, OS, Predecessors, llvm::Successor, and Successors.
Member Data Documentation
◆ Nodes
| std::vector<BasicBlock*> llvm::Interval::Nodes |
Nodes - The basic blocks in this interval.
Definition at line 54 of file Interval.h.
Referenced by contains(), Interval(), and print().
◆ Predecessors
| std::vector<BasicBlock*> llvm::Interval::Predecessors |
Predecessors - List of BasicBlocks that have this Interval's header block as one of their successors.
Definition at line 63 of file Interval.h.
Referenced by print().
◆ 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.
Definition at line 59 of file Interval.h.
Referenced by isSuccessor(), and print().
The documentation for this class was generated from the following files:
- include/llvm/Analysis/Interval.h
- lib/Analysis/Interval.cpp
