Lines Matching refs:DT
47 const DominatorTree *DT; member
50 const DominatorTree *dt) : TD(td), TLI(tli), DT(dt) {} in Query()
93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { in ValueDominatesPHI() argument
106 if (DT) { in ValueDominatesPHI()
107 if (!DT->isReachableFromEntry(P->getParent())) in ValueDominatesPHI()
109 if (!DT->isReachableFromEntry(I->getParent())) in ValueDominatesPHI()
111 return DT->dominates(I, P); in ValueDominatesPHI()
522 if (!ValueDominatesPHI(RHS, PI, Q.DT)) in ThreadBinOpOverPHI()
528 if (!ValueDominatesPHI(LHS, PI, Q.DT)) in ThreadBinOpOverPHI()
570 if (!ValueDominatesPHI(RHS, PI, Q.DT)) in ThreadCmpOverPHI()
655 const DominatorTree *DT) { in SimplifyAddInst() argument
656 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifyAddInst()
860 const DominatorTree *DT) { in SimplifySubInst() argument
861 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifySubInst()
1038 const DominatorTree *DT) { in SimplifyFAddInst() argument
1039 return ::SimplifyFAddInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFAddInst()
1044 const DominatorTree *DT) { in SimplifyFSubInst() argument
1045 return ::SimplifyFSubInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFSubInst()
1052 const DominatorTree *DT) { in SimplifyFMulInst() argument
1053 return ::SimplifyFMulInst(Op0, Op1, FMF, Query (TD, TLI, DT), RecursionLimit); in SimplifyFMulInst()
1058 const DominatorTree *DT) { in SimplifyMulInst() argument
1059 return ::SimplifyMulInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyMulInst()
1146 const DominatorTree *DT) { in SimplifySDivInst() argument
1147 return ::SimplifySDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifySDivInst()
1162 const DominatorTree *DT) { in SimplifyUDivInst() argument
1163 return ::SimplifyUDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyUDivInst()
1181 const DominatorTree *DT) { in SimplifyFDivInst() argument
1182 return ::SimplifyFDivInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyFDivInst()
1251 const DominatorTree *DT) { in SimplifySRemInst() argument
1252 return ::SimplifySRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifySRemInst()
1267 const DominatorTree *DT) { in SimplifyURemInst() argument
1268 return ::SimplifyURemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyURemInst()
1286 const DominatorTree *DT) { in SimplifyFRemInst() argument
1287 return ::SimplifyFRemInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyFRemInst()
1354 const DominatorTree *DT) { in SimplifyShlInst() argument
1355 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query (TD, TLI, DT), in SimplifyShlInst()
1382 const DominatorTree *DT) { in SimplifyLShrInst() argument
1383 return ::SimplifyLShrInst(Op0, Op1, isExact, Query (TD, TLI, DT), in SimplifyLShrInst()
1414 const DominatorTree *DT) { in SimplifyAShrInst() argument
1415 return ::SimplifyAShrInst(Op0, Op1, isExact, Query (TD, TLI, DT), in SimplifyAShrInst()
1514 const DominatorTree *DT) { in SimplifyAndInst() argument
1515 return ::SimplifyAndInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyAndInst()
1608 const DominatorTree *DT) { in SimplifyOrInst() argument
1609 return ::SimplifyOrInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyOrInst()
1668 const DominatorTree *DT) { in SimplifyXorInst() argument
1669 return ::SimplifyXorInst(Op0, Op1, Query (TD, TLI, DT), RecursionLimit); in SimplifyXorInst()
2570 const DominatorTree *DT) { in SimplifyICmpInst() argument
2571 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyICmpInst()
2667 const DominatorTree *DT) { in SimplifyFCmpInst() argument
2668 return ::SimplifyFCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyFCmpInst()
2702 const DominatorTree *DT) { in SimplifySelectInst() argument
2703 return ::SimplifySelectInst(Cond, TrueVal, FalseVal, Query (TD, TLI, DT), in SimplifySelectInst()
2750 const DominatorTree *DT) { in SimplifyGEPInst() argument
2751 return ::SimplifyGEPInst(Ops, Query (TD, TLI, DT), RecursionLimit); in SimplifyGEPInst()
2787 const DominatorTree *DT) { in SimplifyInsertValueInst() argument
2788 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query (TD, TLI, DT), in SimplifyInsertValueInst()
2821 return ValueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : 0; in SimplifyPHINode()
2835 const DominatorTree *DT) { in SimplifyTruncInst() argument
2836 return ::SimplifyTruncInst(Op, Ty, Query (TD, TLI, DT), RecursionLimit); in SimplifyTruncInst()
2908 const DominatorTree *DT) { in SimplifyBinOp() argument
2909 return ::SimplifyBinOp(Opcode, LHS, RHS, Query (TD, TLI, DT), RecursionLimit); in SimplifyBinOp()
2923 const DominatorTree *DT) { in SimplifyCmpInst() argument
2924 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query (TD, TLI, DT), in SimplifyCmpInst()
2998 const DominatorTree *DT) { in SimplifyCall() argument
2999 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(TD, TLI, DT), in SimplifyCall()
3005 const DominatorTree *DT) { in SimplifyCall() argument
3006 return ::SimplifyCall(V, Args.begin(), Args.end(), Query(TD, TLI, DT), in SimplifyCall()
3014 const DominatorTree *DT) { in SimplifyInstruction() argument
3023 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3029 TD, TLI, DT); in SimplifyInstruction()
3033 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3039 TD, TLI, DT); in SimplifyInstruction()
3043 I->getFastMathFlags(), TD, TLI, DT); in SimplifyInstruction()
3046 Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3049 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3052 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3055 Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3058 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3061 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3064 Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3070 TD, TLI, DT); in SimplifyInstruction()
3075 TD, TLI, DT); in SimplifyInstruction()
3080 TD, TLI, DT); in SimplifyInstruction()
3083 Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3086 Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3089 Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3093 I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3097 I->getOperand(0), I->getOperand(1), TD, TLI, DT); in SimplifyInstruction()
3101 I->getOperand(2), TD, TLI, DT); in SimplifyInstruction()
3105 Result = SimplifyGEPInst(Ops, TD, TLI, DT); in SimplifyInstruction()
3112 IV->getIndices(), TD, TLI, DT); in SimplifyInstruction()
3116 Result = SimplifyPHINode(cast<PHINode>(I), Query (TD, TLI, DT)); in SimplifyInstruction()
3121 TD, TLI, DT); in SimplifyInstruction()
3125 Result = SimplifyTruncInst(I->getOperand(0), I->getType(), TD, TLI, DT); in SimplifyInstruction()
3149 const DominatorTree *DT) { in replaceAndRecursivelySimplifyImpl() argument
3177 SimpleV = SimplifyInstruction(I, TD, TLI, DT); in replaceAndRecursivelySimplifyImpl()
3204 const DominatorTree *DT) { in recursivelySimplifyInstruction() argument
3205 return replaceAndRecursivelySimplifyImpl(I, 0, TD, TLI, DT); in recursivelySimplifyInstruction()
3211 const DominatorTree *DT) { in replaceAndRecursivelySimplify() argument
3214 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TD, TLI, DT); in replaceAndRecursivelySimplify()