Lines Matching refs:DT
52 const DominatorTree *DT;
57 const DominatorTree *dt, AssumptionCache *ac = nullptr,
59 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {}
105 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
118 if (DT) {
119 if (!DT->isReachableFromEntry(P->getParent()))
121 if (!DT->isReachableFromEntry(I->getParent()))
123 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))
584 const DominatorTree *DT, AssumptionCache *AC,
586 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
779 const DominatorTree *DT, AssumptionCache *AC,
781 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
948 const DominatorTree *DT, AssumptionCache *AC,
950 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
957 const DominatorTree *DT, AssumptionCache *AC,
959 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
966 const DominatorTree *DT, AssumptionCache *AC,
968 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
974 const DominatorTree *DT, AssumptionCache *AC,
976 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1075 const DominatorTree *DT, AssumptionCache *AC,
1077 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1093 const DominatorTree *DT, AssumptionCache *AC,
1095 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1136 const DominatorTree *DT, AssumptionCache *AC,
1138 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1212 const DominatorTree *DT, AssumptionCache *AC,
1214 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1230 const DominatorTree *DT, AssumptionCache *AC,
1232 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1258 const DominatorTree *DT, AssumptionCache *AC,
1260 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1328 computeKnownBits(Op1, KnownZero, KnownOne, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1365 Q.CxtI, Q.DT);
1394 const DominatorTree *DT, AssumptionCache *AC,
1396 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
1419 const DominatorTree *DT, AssumptionCache *AC,
1421 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1443 unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1453 const DominatorTree *DT, AssumptionCache *AC,
1455 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1609 Q.DT))
1612 Q.DT))
1677 const DominatorTree *DT, AssumptionCache *AC,
1679 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1831 MaskedValueIsZero(V2, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1834 MaskedValueIsZero(V1, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1842 MaskedValueIsZero(V2, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1845 MaskedValueIsZero(V1, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1862 const DominatorTree *DT, AssumptionCache *AC,
1864 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1916 const DominatorTree *DT, AssumptionCache *AC,
1918 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1976 const DominatorTree *DT, CmpInst::Predicate Pred,
2138 if (isAllocLikeFn(LHS, TLI) && llvm::isKnownNonNullAt(RHS, CxtI, DT))
2140 else if (isAllocLikeFn(RHS, TLI) && llvm::isKnownNonNullAt(LHS, CxtI, DT))
2246 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2251 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2256 Q.CxtI, Q.DT);
2264 Q.CxtI, Q.DT);
2268 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2273 Q.CxtI, Q.DT);
2281 Q.CxtI, Q.DT);
2285 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2610 isKnownNonEqual(LHS, RHS, Q.DL, Q.AC, Q.CxtI, Q.DT)) {
2692 Q.AC, Q.CxtI, Q.DT);
2694 Q.CxtI, Q.DT);
2712 Q.AC, Q.CxtI, Q.DT);
2714 Q.CxtI, Q.DT);
2771 Q.CxtI, Q.DT);
2782 Q.CxtI, Q.DT);
2802 Q.CxtI, Q.DT);
2813 Q.CxtI, Q.DT);
3093 if (auto *C = computePointerICmp(Q.DL, Q.TLI, Q.DT, Pred, Q.CxtI, LHS, RHS))
3127 Q.CxtI, Q.DT);
3154 const DominatorTree *DT, AssumptionCache *AC,
3156 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3286 const DominatorTree *DT, AssumptionCache *AC,
3289 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3506 const DominatorTree *DT, AssumptionCache *AC,
3509 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3599 const DominatorTree *DT, AssumptionCache *AC,
3602 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3636 const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC,
3638 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI),
3670 const DominatorTree *DT,
3673 return ::SimplifyExtractValueInst(Agg, Idxs, Query(DL, TLI, DT, AC, CxtI),
3704 const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) {
3705 return ::SimplifyExtractElementInst(Vec, Idx, Query(DL, TLI, DT, AC, CxtI),
3737 return ValueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : nullptr;
3751 const DominatorTree *DT, AssumptionCache *AC,
3753 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI),
3844 const DominatorTree *DT, AssumptionCache *AC,
3846 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3853 const DominatorTree *DT, AssumptionCache *AC,
3855 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI),
3869 const DominatorTree *DT, AssumptionCache *AC,
3871 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
4070 const TargetLibraryInfo *TLI, const DominatorTree *DT,
4072 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI),
4078 const DominatorTree *DT, AssumptionCache *AC,
4081 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
4088 const DominatorTree *DT, AssumptionCache *AC) {
4097 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4103 TLI, DT, AC, I);
4107 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4113 TLI, DT, AC, I);
4117 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4121 SimplifyMulInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4124 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
4128 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
4133 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4136 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
4140 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT,
4145 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4151 TLI, DT, AC, I);
4155 cast<BinaryOperator>(I)->isExact(), DL, TLI, DT,
4160 cast<BinaryOperator>(I)->isExact(), DL, TLI, DT,
4165 SimplifyAndInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4169 SimplifyOrInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4173 SimplifyXorInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I);
4178 I->getOperand(1), DL, TLI, DT, AC, I);
4183 I->getFastMathFlags(), DL, TLI, DT, AC, I);
4187 I->getOperand(2), DL, TLI, DT, AC, I);
4192 Ops, DL, TLI, DT, AC, I);
4199 IV->getIndices(), DL, TLI, DT, AC, I);
4205 EVI->getIndices(), DL, TLI, DT, AC, I);
4211 EEI->getVectorOperand(), EEI->getIndexOperand(), DL, TLI, DT, AC, I);
4215 Result = SimplifyPHINode(cast<PHINode>(I), Query(DL, TLI, DT, AC, I));
4220 TLI, DT, AC, I);
4225 SimplifyTruncInst(I->getOperand(0), I->getType(), DL, TLI, DT, AC, I);
4235 computeKnownBits(I, KnownZero, KnownOne, DL, /*Depth*/0, AC, I, DT);
4259 const DominatorTree *DT,
4288 SimpleV = SimplifyInstruction(I, DL, TLI, DT, AC);
4313 const DominatorTree *DT,
4315 return replaceAndRecursivelySimplifyImpl(I, nullptr, TLI, DT, AC);
4320 const DominatorTree *DT,
4324 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TLI, DT, AC);
