27 const std::vector<const CFNode*>&
children(
const CFNode* n)
const {
return children_[n]; }
const std::vector< const CFNode * > & children(const CFNode *n) const
const CFNode * idom(const CFNode *n) const
DomTreeBase & operator=(DomTreeBase)=delete
const CFNode * least_common_ancestor(const CFNode *i, const CFNode *j) const
Returns the least common ancestor of i and j.
int depth(const CFNode *n) const
size_t index(const CFNode *n) const
DomTreeBase(const CFG< forward > &cfg)
const CFG< forward > & cfg() const
DomTreeBase(const DomTreeBase &)=delete
const CFNode * root() const