Home | History | Annotate | Download | only in Analysis

Lines Matching refs:CxtI

52   const Instruction *CxtI;
56 const Instruction *cxti = nullptr)
57 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {}
589 const Instruction *CxtI) {
590 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
782 const Instruction *CxtI) {
783 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
962 const Instruction *CxtI) {
963 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
971 const Instruction *CxtI) {
972 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
980 const Instruction *CxtI) {
981 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
988 const Instruction *CxtI) {
989 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1092 const Instruction *CxtI) {
1093 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1110 const Instruction *CxtI) {
1111 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1138 const Instruction *CxtI) {
1139 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1217 const Instruction *CxtI) {
1218 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1235 const Instruction *CxtI) {
1236 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1263 const Instruction *CxtI) {
1264 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1356 Q.CxtI, Q.DT);
1386 const Instruction *CxtI) {
1387 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
1411 const Instruction *CxtI) {
1412 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1434 unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1445 const Instruction *CxtI) {
1446 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1593 if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
1596 if (isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
1645 const Instruction *CxtI) {
1646 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1801 MaskedValueIsZero(V2, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1804 MaskedValueIsZero(V1, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1812 MaskedValueIsZero(V2, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1815 MaskedValueIsZero(V1, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1833 const Instruction *CxtI) {
1834 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1890 const Instruction *CxtI) {
1891 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
2190 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2195 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2200 Q.CxtI, Q.DT);
2208 Q.CxtI, Q.DT);
2212 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2217 Q.CxtI, Q.DT);
2225 Q.CxtI, Q.DT);
2229 isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2646 Q.CxtI, Q.DT);
2657 Q.CxtI, Q.DT);
2677 Q.CxtI, Q.DT);
2688 Q.CxtI, Q.DT);
3000 Q.CxtI, Q.DT);
3028 Instruction *CxtI) {
3029 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3144 const Instruction *CxtI) {
3145 return ::SimplifyFCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3239 const Instruction *CxtI) {
3241 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3331 const Instruction *CxtI) {
3334 Ops, Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3369 const Instruction *CxtI) {
3370 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI),
3418 const Instruction *CxtI) {
3419 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI),
3514 const Instruction *CxtI) {
3515 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3523 const Instruction *CxtI) {
3524 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI),
3540 const Instruction *CxtI) {
3541 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3616 AssumptionCache *AC, const Instruction *CxtI) {
3617 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI),
3624 const Instruction *CxtI) {
3626 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);