Thorin 1.9.0
The Higher ORder INtermediate representation
|
A Dominance Tree. More...
#include <thorin/analyses/domtree.h>
Public Member Functions | |
DomTreeBase (const DomTreeBase &)=delete | |
DomTreeBase & | operator= (DomTreeBase)=delete |
DomTreeBase (const CFG< forward > &cfg) | |
const CFG< forward > & | cfg () const |
size_t | index (const CFNode *n) const |
const std::vector< const CFNode * > & | children (const CFNode *n) const |
const CFNode * | root () const |
const CFNode * | idom (const CFNode *n) const |
int | depth (const CFNode *n) const |
const CFNode * | least_common_ancestor (const CFNode *i, const CFNode *j) const |
Returns the least common ancestor of i and j . | |
A Dominance Tree.
The template parameter forward
determines whether a regular dominance tree (true
) or a post-dominance tree (false
) should be constructed. This template parameter is associated with CFG's
forward
parameter.
|
delete |
|
inlineexplicit |
Definition at line 16 of file domtree.h.
References thorin::DomTreeBase< forward >::depth(), and thorin::DomTreeBase< forward >::root().
|
inline |
Definition at line 25 of file domtree.h.
Referenced by thorin::DomTreeBase< forward >::index().
|
inline |
|
inline |
Definition at line 30 of file domtree.h.
Referenced by thorin::DomTreeBase< forward >::DomTreeBase().
|
inline |
Definition at line 29 of file domtree.h.
Referenced by thorin::Scheduler::smart().
|
inline |
Definition at line 26 of file domtree.h.
References thorin::DomTreeBase< forward >::cfg().
const CFNode * thorin::DomTreeBase< forward >::least_common_ancestor | ( | const CFNode * | i, |
const CFNode * | j | ||
) | const |
Returns the least common ancestor of i
and j
.
Definition at line 45 of file domtree.cpp.
Referenced by thorin::Scheduler::late().
|
delete |
|
inline |
Definition at line 28 of file domtree.h.
Referenced by thorin::DomTreeBase< forward >::DomTreeBase().