CACAO
|
Public Types | |
typedef BeginInst | NodeTy |
typedef alloc::map< NodeTy *, NodeTy * >::type | EdgeMapTy |
Public Member Functions | |
bool | dominates (NodeTy *a, NodeTy *b) const |
True if a dominates b. More... | |
bool | is_dominated_by (NodeTy *b, NodeTy *a) const |
True if b is dominated by b. More... | |
NodeTy * | get_idominator (NodeTy *a) const |
Get the immediate dominator. More... | |
NodeTy * | find_nearest_common_dom (NodeTy *a, NodeTy *b) const |
Find the nearest common dominator. More... | |
int | depth (NodeTy *node) const |
Depth of a tree node. More... | |
Protected Attributes | |
EdgeMapTy | dom |
Definition at line 41 of file DominatorPass.hpp.
typedef alloc::map<NodeTy*, NodeTy*>::type cacao::jit::compiler2::DominatorTree::EdgeMapTy |
Definition at line 44 of file DominatorPass.hpp.
Definition at line 43 of file DominatorPass.hpp.
|
inline |
Depth of a tree node.
The depth is defined as the length of the path from the node to the root. The depth of the root is 0.
Definition at line 83 of file DominatorPass.hpp.
True if a dominates b.
Definition at line 42 of file DominatorPass.cpp.
DominatorTree::NodeTy * cacao::jit::compiler2::DominatorTree::find_nearest_common_dom | ( | NodeTy * | a, |
NodeTy * | b | ||
) | const |
Find the nearest common dominator.
Definition at line 50 of file DominatorPass.cpp.
Get the immediate dominator.
Definition at line 65 of file DominatorPass.hpp.
True if b is dominated by b.
Definition at line 55 of file DominatorPass.hpp.
|
protected |
Definition at line 46 of file DominatorPass.hpp.