Lines Matching defs:DT

64                            const DominatorTree &DT,
95 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA,
102   DomTreeNode *DA = DT->getNode(InstA->getParent());
103   DomTreeNode *DB = DT->getNode(InstB->getParent());
110                                             const DominatorTree &DT,
113   assert(DT.dominates(&Dominator, &BB) && "Expecting Dominator to dominate BB");
123   // Walk up the dominator tree from the associated DT node for BB to the
124   // associated DT node for Dominator.
126     assert(DT.getNode(CurBlock) && "Expecting a valid DT node for CurBlock");
127     BasicBlock *IDom = DT.getNode(CurBlock)->getIDom()->getBlock();
128     assert(DT.dominates(&Dominator, IDom) &&
232                                    const DominatorTree &DT,
234   return isControlFlowEquivalent(*I0.getParent(), *I1.getParent(), DT, PDT);
238                                    const DominatorTree &DT,
243   if ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) ||
244       (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0)))
249   const BasicBlock *CommonDominator = DT.findNearestCommonDominator(&BB0, &BB1);
255       ControlConditions::collectControlConditions(BB0, *CommonDominator, DT,
261       ControlConditions::collectControlConditions(BB1, *CommonDominator, DT,
313                               DominatorTree &DT, const PostDominatorTree *PDT,
334   if (!isControlFlowEquivalent(I, InsertPoint, DT, *PDT))
337   if (isReachedBefore(&I, &InsertPoint, &DT, PDT))
345         if (UserInst != &InsertPoint && !DT.dominates(&InsertPoint, U)) {
350               DT.dominates(&I, UserInst))
355   if (isReachedBefore(&InsertPoint, &I, &DT, PDT))
363             DT.dominates(OpInst, &I))
365         if (!DT.dominates(OpInst, &InsertPoint))
369   DT.updateDFSNumbers();
370   const bool MoveForward = domTreeLevelBefore(&DT, &I, &InsertPoint);
413                               DominatorTree &DT, const PostDominatorTree *PDT,
419     return isSafeToMoveBefore(I, InsertPoint, DT, PDT, DI,
425                                           DominatorTree &DT,
432     if (isSafeToMoveBefore(I, *MovePos, DT, &PDT, &DI))
438                                     DominatorTree &DT,
444     if (isSafeToMoveBefore(I, *MovePos, DT, &PDT, &DI))
451                                    const DominatorTree *DT,
453   assert(isControlFlowEquivalent(*ThisBlock, *OtherBlock, *DT, *PDT) &&
456       DT->findNearestCommonDominator(ThisBlock, OtherBlock);
483                            const DominatorTree *DT,
488     return DT->dominates(I0, I1);
490   return nonStrictlyPostDominate(BB1, BB0, DT, PDT);