Lines Matching refs:DT
157 DominatorTree *DT;
325 // Compute block ordering for a typical DT-based traversal of the flow
330 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root)))
415 // The creation of gep nodes requires DT-traversal. When processing a GEP
670 static BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) {
690 Dom = B ? DT->findNearestCommonDominator(Dom, B) : nullptr;
699 static BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) {
707 return DT->getRoot();
713 if (DT->dominates(B, DomB))
715 if (!DT->dominates(DomB, B))
801 BasicBlock *DomB = nearest_common_dominator(DT, Bs);
806 if (IdxI && !DT->dominates(IdxI->getParent(), DomB))
811 DomTreeNode *N = (*DT)[DomB]->getIDom();
845 return DT->properlyDominates(DefB, HdrB);
861 if (LB && DT->dominates(B, LB))
866 static BasicBlock *preheader(DominatorTree *DT, Loop *L) {
871 DomTreeNode *DN = DT->getNode(L->getHeader());
891 BasicBlock *TopB = nearest_common_dominatee(DT, Bs);
907 BasicBlock *NewLoc = preheader(DT, Lp);
908 if (!NewLoc || !DT->dominates(TopB, NewLoc))
1251 for (auto DTN : children<DomTreeNode*>(DT->getNode(B)))
1283 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();