Lines Matching defs:DominatorTree
30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree::eval(int v)
128 void DominatorTree::link(int v, int w)
133 void DominatorTree::build()
189 void DominatorTree::findDominanceFrontiers()
327 domTree = new DominatorTree(&cfg);
328 reinterpret_cast<DominatorTree *>(domTree)->findDominanceFrontiers();