Lines Matching refs:N2
235 ForeachNumInConstantRange(CR2, [&](const APInt &N2) { in TestBinaryOpExhaustive() argument
236 if (Optional<APInt> ResultN = IntFn(N1, N2)) in TestBinaryOpExhaustive()
718 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
719 return N1 + N2; in TEST_F()
776 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
778 APInt Res = N1.sadd_ov(N2, IsOverflow); in TEST_F()
830 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
832 APInt Res = N1.uadd_ov(N2, IsOverflow); in TEST_F()
870 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
872 APInt Res1 = N1.uadd_ov(N2, IsOverflow1); in TEST_F()
873 APInt Res2 = N1.sadd_ov(N2, IsOverflow2); in TEST_F()
908 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
909 return N1 - N2; in TEST_F()
919 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
921 APInt Res = N1.ssub_ov(N2, IsOverflow); in TEST_F()
932 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
934 APInt Res = N1.usub_ov(N2, IsOverflow); in TEST_F()
945 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
947 APInt Res1 = N1.usub_ov(N2, IsOverflow1); in TEST_F()
948 APInt Res2 = N1.ssub_ov(N2, IsOverflow2); in TEST_F()
1008 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
1009 return N1 * N2; in TEST_F()
1038 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
1039 return APIntOps::umax(N1, N2); in TEST_F()
1068 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
1069 return APIntOps::smax(N1, N2); in TEST_F()
1094 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
1095 return APIntOps::umin(N1, N2); in TEST_F()
1123 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
1124 return APIntOps::smin(N1, N2); in TEST_F()
1171 ForeachNumInConstantRange(CR2, [&](const APInt &N2) { in TEST_F() argument
1173 if (N2 == 0) in TEST_F()
1177 if (N1.isMinSignedValue() && N2.isAllOnes()) in TEST_F()
1180 APInt N = N1.sdiv(N2); in TEST_F()
1249 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
1250 if (N2.isZero()) in TEST_F()
1252 return N1.urem(N2); in TEST_F()
1325 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
1326 if (N2.isZero()) in TEST_F()
1328 return N1.srem(N2); in TEST_F()
1363 [](const APInt &N1, const APInt &N2) -> Optional<APInt> { in TEST_F() argument
1364 if (N2.uge(N2.getBitWidth())) in TEST_F()
1366 return N1.shl(N2); in TEST_F()
1488 ForeachNumInConstantRange(CR2, [&](const APInt &N2) { in ICmpTestImpl() argument
1489 Exhaustive &= ICmpInst::compare(N1, N2, Pred); in ICmpTestImpl()
1739 ForeachNumInConstantRange(CR, [&](const APInt &N2) { in TestNoWrapRegionExhaustive() argument
1740 if (OverflowFn(N1, N2)) in TestNoWrapRegionExhaustive()
1760 [](const APInt &N1, const APInt &N2) { in TEST() argument
1762 (void) N1.uadd_ov(N2, Overflow); in TEST()
1767 [](const APInt &N1, const APInt &N2) { in TEST() argument
1769 (void) N1.sadd_ov(N2, Overflow); in TEST()
1774 [](const APInt &N1, const APInt &N2) { in TEST() argument
1776 (void) N1.usub_ov(N2, Overflow); in TEST()
1781 [](const APInt &N1, const APInt &N2) { in TEST() argument
1783 (void) N1.ssub_ov(N2, Overflow); in TEST()
1788 [](const APInt &N1, const APInt &N2) { in TEST() argument
1790 (void) N1.umul_ov(N2, Overflow); in TEST()
1795 [](const APInt &N1, const APInt &N2) { in TEST() argument
1797 (void) N1.smul_ov(N2, Overflow); in TEST()
1802 [](const APInt &N1, const APInt &N2) { in TEST() argument
1804 (void)N1.ushl_ov(N2, Overflow); in TEST()
1809 [](const APInt &N1, const APInt &N2) { in TEST() argument
1811 (void)N1.sshl_ov(N2, Overflow); in TEST()
2100 ForeachNumInConstantRange(CR2, [&](const APInt &N2) { in TestOverflowExhaustive() argument
2102 if (!OverflowFn(IsOverflowHigh, N1, N2)) { in TestOverflowExhaustive()
2147 [](bool &IsOverflowHigh, const APInt &N1, const APInt &N2) { in TEST_F() argument
2149 (void) N1.uadd_ov(N2, Overflow); in TEST_F()
2160 [](bool &IsOverflowHigh, const APInt &N1, const APInt &N2) { in TEST_F() argument
2162 (void) N1.usub_ov(N2, Overflow); in TEST_F()
2173 [](bool &IsOverflowHigh, const APInt &N1, const APInt &N2) { in TEST_F() argument
2175 (void) N1.umul_ov(N2, Overflow); in TEST_F()
2186 [](bool &IsOverflowHigh, const APInt &N1, const APInt &N2) { in TEST_F() argument
2188 (void) N1.sadd_ov(N2, Overflow); in TEST_F()
2199 [](bool &IsOverflowHigh, const APInt &N1, const APInt &N2) { in TEST_F() argument
2201 (void) N1.ssub_ov(N2, Overflow); in TEST_F()
2317 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
2318 return N1.uadd_sat(N2); in TEST_F()
2328 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
2329 return N1.usub_sat(N2); in TEST_F()
2339 [](const APInt &N1, const APInt &N2) { return N1.umul_sat(N2); }, in TEST_F() argument
2348 [](const APInt &N1, const APInt &N2) { return N1.ushl_sat(N2); }, in TEST_F() argument
2357 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
2358 return N1.sadd_sat(N2); in TEST_F()
2368 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
2369 return N1.ssub_sat(N2); in TEST_F()
2379 [](const APInt &N1, const APInt &N2) { return N1.smul_sat(N2); }, in TEST_F() argument
2388 [](const APInt &N1, const APInt &N2) { return N1.sshl_sat(N2); }, in TEST_F() argument
2457 [](const APInt &N1, const APInt &N2) { return N1 & N2; }, PreferSmallest, in TEST_F() argument
2495 [](const APInt &N1, const APInt &N2) { return N1 | N2; }, PreferSmallest, in TEST_F() argument
2517 [](const APInt &N1, const APInt &N2) { in TEST_F() argument
2518 return N1 ^ N2; in TEST_F()
2555 ForeachNumInConstantRange(CR2, [&](const APInt &N2) { in testConstantRangeICmpPredEquivalence() argument
2558 TrulyEquivalent &= ICmpInst::compare(N1, N2, SrcPred) == in testConstantRangeICmpPredEquivalence()
2559 ICmpInst::compare(N1, N2, TgtPred); in testConstantRangeICmpPredEquivalence()