Lines Matching defs:DT
47 const DominatorTree *DT;
50 const DominatorTree *dt) : TD(td), TLI(tli), DT(dt) {}
93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
106 if (DT) {
107 if (!DT->isReachableFromEntry(P->getParent()))
109 if (!DT->isReachableFromEntry(I->getParent()))
111 return DT->dominates(I, P);
522 if (!ValueDominatesPHI(RHS, PI, Q.DT))
528 if (!ValueDominatesPHI(LHS, PI, Q.DT))
570 if (!ValueDominatesPHI(RHS, PI, Q.DT))
655 const DominatorTree *DT) {
656 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT),
859 const DominatorTree *DT) {
860 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT),
1037 const DominatorTree *DT) {
1038 return ::SimplifyFAddInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit);
1043 const DominatorTree *DT) {
1044 return ::SimplifyFSubInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit);
1051 const DominatorTree *DT) {
1052 return ::SimplifyFMulInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit);
1057 const DominatorTree *DT) {
1058 return ::SimplifyMulInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1145 const DominatorTree *DT) {
1146 return ::SimplifySDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1161 const DominatorTree *DT) {
1162 return ::SimplifyUDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1180 const DominatorTree *DT) {
1181 return ::SimplifyFDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1250 const DominatorTree *DT) {
1251 return ::SimplifySRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1266 const DominatorTree *DT) {
1267 return ::SimplifyURemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1285 const DominatorTree *DT) {
1286 return ::SimplifyFRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1353 const DominatorTree *DT) {
1354 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT),
1385 const DominatorTree *DT) {
1386 return ::SimplifyLShrInst(Op0, Op1, isExact, Query (TD, TLI, DT),
1421 const DominatorTree *DT) {
1422 return ::SimplifyAShrInst(Op0, Op1, isExact, Query (TD, TLI, DT),
1521 const DominatorTree *DT) {
1522 return ::SimplifyAndInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1615 const DominatorTree *DT) {
1616 return ::SimplifyOrInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
1675 const DominatorTree *DT) {
1676 return ::SimplifyXorInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit);
2580 const DominatorTree *DT) {
2581 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT),
2677 const DominatorTree *DT) {
2678 return ::SimplifyFCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT),
2712 const DominatorTree *DT) {
2713 return ::SimplifySelectInst(Cond, TrueVal, FalseVal, Query (TD, TLI, DT),
2760 const DominatorTree *DT) {
2761 return ::SimplifyGEPInst(Ops, Query (TD, TLI, DT), RecursionLimit);
2797 const DominatorTree *DT) {
2798 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query (TD, TLI, DT),
2831 return ValueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : 0;
2845 const DominatorTree *DT) {
2846 return ::SimplifyTruncInst(Op, Ty, Query (TD, TLI, DT), RecursionLimit);
2918 const DominatorTree *DT) {
2919 return ::SimplifyBinOp(Opcode, LHS, RHS, Query (TD, TLI, DT), RecursionLimit);
2933 const DominatorTree *DT) {
2934 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT),
3008 const DominatorTree *DT) {
3009 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(TD, TLI, DT),
3015 const DominatorTree *DT) {
3016 return ::SimplifyCall(V, Args.begin(), Args.end(), Query(TD, TLI, DT),
3024 const DominatorTree *DT) {
3033 I->getFastMathFlags(), TD, TLI, DT);
3039 TD, TLI, DT);
3043 I->getFastMathFlags(), TD, TLI, DT);
3049 TD, TLI, DT);
3053 I->getFastMathFlags(), TD, TLI, DT);
3056 Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3059 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3062 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3065 Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3068 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3071 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3074 Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3080 TD, TLI, DT);
3085 TD, TLI, DT);
3090 TD, TLI, DT);
3093 Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3096 Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3099 Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3103 I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3107 I->getOperand(0), I->getOperand(1), TD, TLI, DT);
3111 I->getOperand(2), TD, TLI, DT);
3115 Result = SimplifyGEPInst(Ops, TD, TLI, DT);
3122 IV->getIndices(), TD, TLI, DT);
3126 Result = SimplifyPHINode(cast<PHINode>(I), Query (TD, TLI, DT));
3131 TD, TLI, DT);
3135 Result = SimplifyTruncInst(I->getOperand(0), I->getType(), TD, TLI, DT);
3159 const DominatorTree *DT) {
3187 SimpleV = SimplifyInstruction(I, TD, TLI, DT);
3214 const DominatorTree *DT) {
3215 return replaceAndRecursivelySimplifyImpl(I, 0, TD, TLI, DT);
3221 const DominatorTree *DT) {
3224 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TD, TLI, DT);
