Lines Matching refs:DT
139 DominatorTree *DT;
299 // Compute block ordering for a typical DT-based traversal of the flow
304 DomTreeNode *DTN = DT->getNode(Root);
394 // The creation of gep nodes requires DT-traversal. When processing a GEP
653 BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) {
673 Dom = B ? DT->findNearestCommonDominator(Dom, B) : 0;
682 BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) {
690 return DT->getRoot();
696 if (DT->dominates(B, DomB))
698 if (!DT->dominates(DomB, B))
784 BasicBlock *DomB = nearest_common_dominator(DT, Bs);
789 if (IdxI && !DT->dominates(IdxI->getParent(), DomB))
794 DomTreeNode *N = (*DT)[DomB]->getIDom();
830 return DT->properlyDominates(DefB, HdrB);
848 if (LB && DT->dominates(B, LB))
855 BasicBlock *preheader(DominatorTree *DT, Loop *L) {
860 DomTreeNode *DN = DT->getNode(L->getHeader());
882 BasicBlock *TopB = nearest_common_dominatee(DT, Bs);
898 BasicBlock *NewLoc = preheader(DT, Lp);
899 if (!NewLoc || !DT->dominates(TopB, NewLoc))
1247 DomTreeNode *N = DT->getNode(B);
1278 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
