mul 216 apps/fft/fft.cpp T[5] = mul(X[5] + X[7], sqrt2_2, sign * sqrt2_2); mul 217 apps/fft/fft.cpp T[7] = mul(X[5] - X[7], -sqrt2_2, sign * sqrt2_2); mul 133 src/FastIntegerDivide.cpp Expr mul, shift; mul 138 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 145 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 152 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 159 src/FastIntegerDivide.cpp result = (cast(wide, mul) * numerator); mul 175 src/FastIntegerDivide.cpp Expr mul, shift; mul 180 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 187 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 194 src/FastIntegerDivide.cpp mul = table(denominator, 0); mul 210 src/FastIntegerDivide.cpp result = (cast(wide, mul) * numerator); mul 409 src/HexagonOptimize.cpp if (const Mul *mul = maybe_mul.as<Mul>()) { mul 410 src/HexagonOptimize.cpp Expr a = unbroadcast_lossless_cast(a_ty, mul->a); mul 411 src/HexagonOptimize.cpp Expr b = unbroadcast_lossless_cast(b_ty, mul->b); mul 417 src/HexagonOptimize.cpp a = unbroadcast_lossless_cast(a_ty, mul->b); mul 418 src/HexagonOptimize.cpp b = unbroadcast_lossless_cast(b_ty, mul->a); mul 60 src/LoopCarry.cpp } else if (const Mul *mul = e.as<Mul>()) { mul 61 src/LoopCarry.cpp Expr la = is_linear(mul->a, linear); mul 62 src/LoopCarry.cpp Expr lb = is_linear(mul->b, linear); mul 66 src/LoopCarry.cpp return mul->a * lb; mul 68 src/LoopCarry.cpp return la * mul->b; mul 390 src/Simplify.cpp } else if (const Mul *mul = e.as<Mul>()) { mul 392 src/Simplify.cpp if (const_int_bounds(mul->a, &min_a, &max_a) && mul 393 src/Simplify.cpp const_int_bounds(mul->b, &min_b, &max_b)) { mul 461 src/Simplify.cpp const Mul *mul = e.as<Mul>(); mul 462 src/Simplify.cpp if (!mul) return Expr(); mul 463 src/Simplify.cpp if (!const_int(mul->b, factor)) return Expr(); mul 464 src/Simplify.cpp return is_round_up_div(mul->a, *factor); mul 2871 src/Simplify.cpp const Mul *mul = delta.as<Mul>(); mul 2932 src/Simplify.cpp } else if (mul && mul 2933 src/Simplify.cpp no_overflow(mul->type)) { mul 2935 src/Simplify.cpp expr = mutate(mul->a == zero || mul->b == zero); mul 4572 src/Simplify.cpp const Mul *mul = new_value.as<Mul>(); mul 4587 src/Simplify.cpp } else if (mul) { mul 4588 src/Simplify.cpp var_b = mul->b.as<Variable>(); mul 4605 src/Simplify.cpp } else if (mul && (is_const(mul->b) || var_b)) { mul 4606 src/Simplify.cpp replacement = substitute(new_name, Mul::make(new_var, mul->b), replacement); mul 4607 src/Simplify.cpp new_value = mul->a; mul 86 src/Solve.cpp const Mul *mul = e.as<Mul>(); mul 87 src/Solve.cpp if (mul && is_const(mul->b)) { mul 88 src/Solve.cpp return mul->a * simplify(-1*mul->b); mul 71 src/VectorizeLoops.cpp } else if (const Mul *mul = e.as<Mul>()) { mul 72 src/VectorizeLoops.cpp if (const Broadcast *b = mul->b.as<Broadcast>()) { mul 74 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(mul->a); mul 77 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(mul->a); mul 80 src/VectorizeLoops.cpp } else if (const Broadcast *b = mul->a.as<Broadcast>()) { mul 82 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(mul->b); mul 85 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(mul->b); mul 508 test/correctness/mul_div_mod.cpp success &= mul<uint8_t, uint8_t, uint8_t, uint64_t>(vector_width, scheduling, target); mul 509 test/correctness/mul_div_mod.cpp success &= mul<uint16_t, uint16_t, uint16_t, uint64_t>(vector_width, scheduling, target); mul 510 test/correctness/mul_div_mod.cpp success &= mul<uint32_t, uint32_t, uint32_t, uint64_t>(vector_width, scheduling, target); mul 511 test/correctness/mul_div_mod.cpp success &= mul<int8_t, int8_t, int8_t, int64_t>(vector_width, scheduling, target); mul 512 test/correctness/mul_div_mod.cpp success &= mul<int16_t, int16_t, int16_t, int64_t>(vector_width, scheduling, target); mul 513 test/correctness/mul_div_mod.cpp success &= mul<int32_t, int32_t, int32_t, int64_t>(vector_width, scheduling, target); mul 516 test/correctness/mul_div_mod.cpp success &= mul<uint8_t, uint8_t, uint16_t, uint64_t>(vector_width, scheduling, target); mul 517 test/correctness/mul_div_mod.cpp success &= mul<uint16_t, uint16_t, uint32_t, uint64_t>(vector_width, scheduling, target); mul 518 test/correctness/mul_div_mod.cpp success &= mul<int8_t, int8_t, int16_t, int64_t>(vector_width, scheduling, target); mul 519 test/correctness/mul_div_mod.cpp success &= mul<int16_t, int16_t, int32_t, int64_t>(vector_width, scheduling, target); mul 524 test/correctness/mul_div_mod.cpp success &= mul<uint16_t, uint32_t, uint32_t, uint64_t>(vector_width, scheduling, target); mul 525 test/correctness/mul_div_mod.cpp success &= mul<int16_t, int32_t, int32_t, uint64_t>(vector_width, scheduling, target); mul 526 test/correctness/mul_div_mod.cpp success &= mul<uint16_t, int32_t, int32_t, uint64_t>(vector_width, scheduling, target); mul 36 tools/find_inverse.cpp bool u_method_1(int den, int64_t mul, int sh_post, int bits) { mul 45 tools/find_inverse.cpp result *= mul; mul 54 tools/find_inverse.cpp bool u_method_2(int den, int64_t mul, int sh_post, int bits) { mul 63 tools/find_inverse.cpp result *= mul; mul 89 tools/find_inverse.cpp bool s_method_1(int den, int64_t mul, int sh_post, int bits) { mul 100 tools/find_inverse.cpp uint64_t q0 = (mul * (xsign ^ result)) >> bits; mul 173 tools/find_inverse.cpp int64_t mul = (1L << (bits+shift)) / den + 1; mul 174 tools/find_inverse.cpp if (u_method_1(den, mul, shift, bits)) { mul 175 tools/find_inverse.cpp fprintf(c_out, " {%d, 1, %lldULL, %d},\n", den, (long long) mul, shift); mul 182 tools/find_inverse.cpp int64_t mul = (1L << (bits+shift+1)) / den - (1L << bits) + 1; mul 183 tools/find_inverse.cpp if (u_method_2(den, mul, shift, bits)) { mul 184 tools/find_inverse.cpp fprintf(c_out, " {%d, 2, %lldULL, %d},\n", den, (long long) mul, shift); mul 213 tools/find_inverse.cpp int64_t mul = (1L << (shift + bits)) / den + 1; mul 214 tools/find_inverse.cpp if (s_method_1(den, mul, shift, bits)) { mul 215 tools/find_inverse.cpp fprintf(c_out, " {%d, 1, %lldLL, %d},\n", den, (long long) mul, shift);