Lines Matching refs:AC
52 AssumptionCache *AC; member
58 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {} in Query()
587 const DominatorTree *DT, AssumptionCache *AC, in SimplifyAddInst() argument
589 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), in SimplifyAddInst()
780 const DominatorTree *DT, AssumptionCache *AC, in SimplifySubInst() argument
782 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), in SimplifySubInst()
960 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFAddInst() argument
962 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFAddInst()
969 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFSubInst() argument
971 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFSubInst()
978 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFMulInst() argument
980 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFMulInst()
986 const DominatorTree *DT, AssumptionCache *AC, in SimplifyMulInst() argument
988 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyMulInst()
1090 const DominatorTree *DT, AssumptionCache *AC, in SimplifySDivInst() argument
1092 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifySDivInst()
1108 const DominatorTree *DT, AssumptionCache *AC, in SimplifyUDivInst() argument
1110 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyUDivInst()
1151 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFDivInst() argument
1153 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFDivInst()
1230 const DominatorTree *DT, AssumptionCache *AC, in SimplifySRemInst() argument
1232 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifySRemInst()
1248 const DominatorTree *DT, AssumptionCache *AC, in SimplifyURemInst() argument
1250 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyURemInst()
1276 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFRemInst() argument
1278 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFRemInst()
1369 computeKnownBits(Op0, Op0KnownZero, Op0KnownOne, Q.DL, /*Depth=*/0, Q.AC, in SimplifyRightShift()
1399 const DominatorTree *DT, AssumptionCache *AC, in SimplifyShlInst() argument
1401 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), in SimplifyShlInst()
1424 const DominatorTree *DT, AssumptionCache *AC, in SimplifyLShrInst() argument
1426 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI), in SimplifyLShrInst()
1448 unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT); in SimplifyAShrInst()
1458 const DominatorTree *DT, AssumptionCache *AC, in SimplifyAShrInst() argument
1460 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI), in SimplifyAShrInst()
1607 if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI, in SimplifyAndInst()
1610 if (isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI, in SimplifyAndInst()
1658 const DominatorTree *DT, AssumptionCache *AC, in SimplifyAndInst() argument
1660 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyAndInst()
1815 MaskedValueIsZero(V2, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyOrInst()
1818 MaskedValueIsZero(V1, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyOrInst()
1826 MaskedValueIsZero(V2, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyOrInst()
1829 MaskedValueIsZero(V1, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyOrInst()
1846 const DominatorTree *DT, AssumptionCache *AC, in SimplifyOrInst() argument
1848 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyOrInst()
1903 const DominatorTree *DT, AssumptionCache *AC, in SimplifyXorInst() argument
1905 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI), in SimplifyXorInst()
2204 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyICmpInst()
2209 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyICmpInst()
2213 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2221 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2226 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyICmpInst()
2230 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2238 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2243 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT)) in SimplifyICmpInst()
2659 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2670 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2690 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
2701 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC, in SimplifyICmpInst()
3013 computeKnownBits(LHS, LHSKnownZero, LHSKnownOne, Q.DL, /*Depth=*/0, Q.AC, in SimplifyICmpInst()
3041 const DominatorTree *DT, AssumptionCache *AC, in SimplifyICmpInst() argument
3043 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI), in SimplifyICmpInst()
3166 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFCmpInst() argument
3169 Query(DL, TLI, DT, AC, CxtI), RecursionLimit); in SimplifyFCmpInst()
3388 const DominatorTree *DT, AssumptionCache *AC, in SimplifySelectInst() argument
3391 Query(DL, TLI, DT, AC, CxtI), RecursionLimit); in SimplifySelectInst()
3480 const DominatorTree *DT, AssumptionCache *AC, in SimplifyGEPInst() argument
3484 Ops, Query(DL, TLI, DT, AC, CxtI), RecursionLimit); in SimplifyGEPInst()
3518 const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, in SimplifyInsertValueInst() argument
3520 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI), in SimplifyInsertValueInst()
3553 AssumptionCache *AC, in SimplifyExtractValueInst() argument
3555 return ::SimplifyExtractValueInst(Agg, Idxs, Query(DL, TLI, DT, AC, CxtI), in SimplifyExtractValueInst()
3586 const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) { in SimplifyExtractElementInst() argument
3587 return ::SimplifyExtractElementInst(Vec, Idx, Query(DL, TLI, DT, AC, CxtI), in SimplifyExtractElementInst()
3633 const DominatorTree *DT, AssumptionCache *AC, in SimplifyTruncInst() argument
3635 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI), in SimplifyTruncInst()
3729 const DominatorTree *DT, AssumptionCache *AC, in SimplifyBinOp() argument
3731 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI), in SimplifyBinOp()
3738 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFPBinOp() argument
3740 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI), in SimplifyFPBinOp()
3755 const DominatorTree *DT, AssumptionCache *AC, in SimplifyCmpInst() argument
3757 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI), in SimplifyCmpInst()
3870 AssumptionCache *AC, const Instruction *CxtI) { in SimplifyCall() argument
3871 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI), in SimplifyCall()
3877 const DominatorTree *DT, AssumptionCache *AC, in SimplifyCall() argument
3880 Query(DL, TLI, DT, AC, CxtI), RecursionLimit); in SimplifyCall()
3887 const DominatorTree *DT, AssumptionCache *AC) { in SimplifyInstruction() argument
3896 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3902 TLI, DT, AC, I); in SimplifyInstruction()
3906 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3912 TLI, DT, AC, I); in SimplifyInstruction()
3916 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3920 SimplifyMulInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I); in SimplifyInstruction()
3924 AC, I); in SimplifyInstruction()
3928 AC, I); in SimplifyInstruction()
3932 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3936 AC, I); in SimplifyInstruction()
3940 AC, I); in SimplifyInstruction()
3944 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3950 TLI, DT, AC, I); in SimplifyInstruction()
3955 AC, I); in SimplifyInstruction()
3960 AC, I); in SimplifyInstruction()
3964 SimplifyAndInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I); in SimplifyInstruction()
3968 SimplifyOrInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I); in SimplifyInstruction()
3972 SimplifyXorInst(I->getOperand(0), I->getOperand(1), DL, TLI, DT, AC, I); in SimplifyInstruction()
3977 I->getOperand(1), DL, TLI, DT, AC, I); in SimplifyInstruction()
3982 I->getFastMathFlags(), DL, TLI, DT, AC, I); in SimplifyInstruction()
3986 I->getOperand(2), DL, TLI, DT, AC, I); in SimplifyInstruction()
3990 Result = SimplifyGEPInst(Ops, DL, TLI, DT, AC, I); in SimplifyInstruction()
3997 IV->getIndices(), DL, TLI, DT, AC, I); in SimplifyInstruction()
4003 EVI->getIndices(), DL, TLI, DT, AC, I); in SimplifyInstruction()
4009 EEI->getVectorOperand(), EEI->getIndexOperand(), DL, TLI, DT, AC, I); in SimplifyInstruction()
4013 Result = SimplifyPHINode(cast<PHINode>(I), Query(DL, TLI, DT, AC, I)); in SimplifyInstruction()
4018 TLI, DT, AC, I); in SimplifyInstruction()
4023 SimplifyTruncInst(I->getOperand(0), I->getType(), DL, TLI, DT, AC, I); in SimplifyInstruction()
4047 AssumptionCache *AC) { in replaceAndRecursivelySimplifyImpl() argument
4075 SimpleV = SimplifyInstruction(I, DL, TLI, DT, AC); in replaceAndRecursivelySimplifyImpl()
4101 AssumptionCache *AC) { in recursivelySimplifyInstruction() argument
4102 return replaceAndRecursivelySimplifyImpl(I, nullptr, TLI, DT, AC); in recursivelySimplifyInstruction()
4108 AssumptionCache *AC) { in replaceAndRecursivelySimplify() argument
4111 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TLI, DT, AC); in replaceAndRecursivelySimplify()