Lines Matching refs:dt
51 const DominatorTree *DT;
56 const DominatorTree *dt, AssumptionCache *ac = nullptr,
58 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {}
104 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
117 if (DT) {
118 if (!DT->isReachableFromEntry(P->getParent()))
120 if (!DT->isReachableFromEntry(I->getParent()))
122 return DT->dominates(I, P);
461 if (!ValueDominatesPHI(RHS, PI, Q.DT))
467 if (!ValueDominatesPHI(LHS, PI, Q.DT))
508 if (!ValueDominatesPHI(RHS, PI, Q.DT))
587 const DominatorTree *DT, AssumptionCache *AC,
589 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
780 const DominatorTree *DT, AssumptionCache *AC,
782 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
960 const DominatorTree *DT, AssumptionCache *AC,
962 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
969 const DominatorTree *DT, AssumptionCache *AC,
971 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
978 const DominatorTree *DT, AssumptionCache *AC,
980 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
986 const DominatorTree *DT, AssumptionCache *AC,
988 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1090 const DominatorTree *DT, AssumptionCache *AC,
1092 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1108 const DominatorTree *DT, AssumptionCache *AC,
1110 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1151 const DominatorTree *DT, AssumptionCache *AC,
1153 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1230 const DominatorTree *DT, AssumptionCache *AC,
1232 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1248 const DominatorTree *DT, AssumptionCache *AC,
1250 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1276 const DominatorTree *DT, AssumptionCache *AC,
1278 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1370 Q.CxtI, Q.DT);
1399 const DominatorTree *DT, AssumptionCache *AC,
1401 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
1424 const DominatorTree *DT, AssumptionCache *AC,
1426 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1448 unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1458 const DominatorTree *DT, AssumptionCache *AC,
1460 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1608 Q.DT))
1611 Q.DT))
1658 const DominatorTree *DT, AssumptionCache *AC,
1660 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1815 MaskedValueIsZero(V2, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1818 MaskedValueIsZero(V1, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1826 MaskedValueIsZero(V2, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1829 MaskedValueIsZero(V1, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1846 const DominatorTree *DT, AssumptionCache *AC,
1848 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1903 const DominatorTree *DT, AssumptionCache *AC,
1905 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
2220 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2225 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2230 Q.CxtI, Q.DT);
2238 Q.CxtI, Q.DT);
2242 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2247 Q.CxtI, Q.DT);
2255 Q.CxtI, Q.DT);
2259 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2584 isKnownNonEqual(LHS, RHS, Q.DL, Q.AC, Q.CxtI, Q.DT)) {
2718 Q.CxtI, Q.DT);
2729 Q.CxtI, Q.DT);
2749 Q.CxtI, Q.DT);
2760 Q.CxtI, Q.DT);
3072 Q.CxtI, Q.DT);
3099 const DominatorTree *DT, AssumptionCache *AC,
3101 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3224 const DominatorTree *DT, AssumptionCache *AC,
3227 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3446 const DominatorTree *DT, AssumptionCache *AC,
3449 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3538 const DominatorTree *DT, AssumptionCache *AC,
3542 Ops, Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3576 const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC,
3578 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI),
3610 const DominatorTree *DT,
3613 return ::SimplifyExtractValueInst(Agg, Idxs, Query(DL, TLI, DT, AC, CxtI),
3644 const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) {
3645 return ::SimplifyExtractElementInst(Vec, Idx, Query(DL, TLI, DT, AC, CxtI),
3677 return ValueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : nullptr;
3691 const DominatorTree *DT, AssumptionCache *AC,
3693 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI),
3787 const DominatorTree *DT, AssumptionCache *AC,
3789 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3796 const DominatorTree *DT, AssumptionCache *AC,
3798 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI),
3813 const DominatorTree *DT, AssumptionCache *AC,
3815 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3927 const TargetLibraryInfo *TLI, const DominatorTree *DT,
3929 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI),
3935 const DominatorTree *DT, AssumptionCache *AC,
3938 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3945 const DominatorTree *DT, AssumptionCache *AC) {
3954 I->getFastMathFlags(), DL, TLI, DT, AC, I);
3960 TLI, DT, AC, I);
3964 I->getFastMathFlags(), DL, TLI, DT, AC, I);
3970 TLI, DT, AC, I);
3974 I->getFastMathFlags(), DL, TLI, DT, AC, I);
3978 SimplifyMulInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
3981 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
3985 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
3990 I->getFastMathFlags(), DL, TLI, DT, AC, I);
3993 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
3997 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
4002 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4008 TLI, DT, AC, I);
4012 cast<BinaryOperator>(I)->isExact(), DL, TLI, DT,
4017 cast<BinaryOperator>(I)->isExact(), DL, TLI, DT,
4022 SimplifyAndInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4026 SimplifyOrInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4030 SimplifyXorInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4035 I->getOperand(1), DL, TLI, DT, AC, I);
4040 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4044 I->getOperand(2), DL, TLI, DT, AC, I);
4048 Result = SimplifyGEPInst(Ops, DL, TLI, DT, AC, I);
4055 IV->getIndices(), DL, TLI, DT, AC, I);
4061 EVI->getIndices(), DL, TLI, DT, AC, I);
4067 EEI->getVectorOperand(), EEI->getIndexOperand(), DL, TLI, DT, AC, I);
4071 Result = SimplifyPHINode(cast<PHINode>(I), Query(DL, TLI, DT, AC, I));
4076 TLI, DT, AC, I);
4081 SimplifyTruncInst(I->getOperand(0), I->getType(), DL, TLI, DT, AC, I);
4091 computeKnownBits(I, KnownZero, KnownOne, DL, /*Depth*/0, AC, I, DT);
4115 const DominatorTree *DT,
4144 SimpleV = SimplifyInstruction(I, DL, TLI, DT, AC);
4169 const DominatorTree *DT,
4171 return replaceAndRecursivelySimplifyImpl(I, nullptr, TLI, DT, AC);
4176 const DominatorTree *DT,
4180 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TLI, DT, AC);
