Lines Matching defs:cfg
35 DominatorTree(Graph *cfg);
52 Graph *cfg;
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
77 count(cfg->getSize())
84 for (IteratorRef it = cfg->iteratorDFS(true); !it->end(); it->next(), ++i) {
140 buildDFS(cfg->getRoot());
168 insert(&BasicBlock::get(cfg->getRoot())->dom);
200 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
234 if (out->cfg.visit(seq))
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
274 if (in->cfg.visit(seq))
328 domTree = new DominatorTree(&cfg);
389 for (int s = 0; s < dfBB->cfg.incidentCount(); ++s)
432 BasicBlock::get(func->cfg.getRoot())->insertHead(nop);
460 if (bb == BasicBlock::get(func->cfg.getRoot())) {
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) {
510 if (ei.getNode() == &bb->cfg)
514 assert(p < sb->cfg.incidentCount());