remainder 89 src/AllocationBoundsInference.cpp internal_assert(bound.remainder.defined()); remainder 90 src/AllocationBoundsInference.cpp min -= bound.remainder; remainder 92 src/AllocationBoundsInference.cpp min += bound.remainder; remainder 94 src/AllocationBoundsInference.cpp max_plus_one -= bound.remainder; remainder 96 src/AllocationBoundsInference.cpp max_plus_one += bound.remainder; remainder 437 src/BoundsInference.cpp min_required -= bound.remainder; remainder 439 src/BoundsInference.cpp min_required += bound.remainder; remainder 441 src/BoundsInference.cpp max_plus_one -= bound.remainder; remainder 443 src/BoundsInference.cpp max_plus_one += bound.remainder; remainder 853 src/CodeGen_ARM.cpp offset = mod_rem.remainder % stride->value; remainder 863 src/CodeGen_ARM.cpp mod_rem.remainder -= offset; remainder 865 src/CodeGen_ARM.cpp mod_rem.remainder = mod_imp(mod_rem.remainder, mod_rem.modulus); remainder 870 src/CodeGen_ARM.cpp alignment *= gcd(mod_rem.modulus, mod_rem.remainder); remainder 1901 src/CodeGen_LLVM.cpp while ((mod_rem.remainder & 1) == 0 && remainder 1905 src/CodeGen_LLVM.cpp mod_rem.remainder /= 2; remainder 1988 src/CodeGen_LLVM.cpp while ((mod_rem.remainder & 1) == 0 && remainder 1992 src/CodeGen_LLVM.cpp mod_rem.remainder /= 2; remainder 3111 src/CodeGen_LLVM.cpp while ((mod_rem.remainder & 1) == 0 && remainder 3115 src/CodeGen_LLVM.cpp mod_rem.remainder /= 2; remainder 263 src/Float16.cpp result.remainder(rhsAPF); remainder 123 src/Float16.h EXPORT float16_t remainder(float16_t denominator) const; remainder 1968 src/Func.cpp Func &Func::align_bounds(Var var, Expr modulus, Expr remainder) { remainder 1970 src/Func.cpp user_assert(remainder.defined()) << "remainder is undefined\n"; remainder 1972 src/Func.cpp user_assert(Int(32).can_represent(remainder.type())) << "Can't represent remainder as int32\n"; remainder 1975 src/Func.cpp remainder = cast<int32_t>(remainder); remainder 1978 src/Func.cpp remainder = remainder % modulus; remainder 1994 src/Func.cpp Bound b = {var.name(), Expr(), Expr(), modulus, remainder}; remainder 1175 src/Func.h EXPORT Func &align_bounds(Var var, Expr modulus, Expr remainder = 0); remainder 88 src/Inline.cpp << s.bounds()[i].remainder << "] because the function is scheduled inline.\n"; remainder 15 src/ModulusRemainder.cpp int modulus, remainder; remainder 78 src/ModulusRemainder.cpp bool reduce_expr_modulo(Expr expr, int modulus, int *remainder) { remainder 89 src/ModulusRemainder.cpp *remainder = result.remainder % modulus; remainder 95 src/ModulusRemainder.cpp bool reduce_expr_modulo(Expr expr, int modulus, int *remainder, const Scope<ModulusRemainder> &scope) { remainder 99 src/ModulusRemainder.cpp *remainder = result.remainder % modulus; remainder 108 src/ModulusRemainder.cpp return ModulusRemainder(modulus, remainder); remainder 114 src/ModulusRemainder.cpp if (result.modulus != m || result.remainder != r) { remainder 120 src/ModulusRemainder.cpp << result.remainder << "\n"; remainder 146 src/ModulusRemainder.cpp remainder = op->value; remainder 164 src/ModulusRemainder.cpp remainder = 0; remainder 171 src/ModulusRemainder.cpp remainder = mod_rem.remainder; remainder 174 src/ModulusRemainder.cpp remainder = 0; remainder 201 src/ModulusRemainder.cpp remainder = mod(a.remainder + b.remainder, modulus); remainder 208 src/ModulusRemainder.cpp remainder = mod(a.remainder - b.remainder, modulus); remainder 217 src/ModulusRemainder.cpp modulus = a.remainder * b.modulus; remainder 218 src/ModulusRemainder.cpp remainder = a.remainder * b.remainder; remainder 221 src/ModulusRemainder.cpp modulus = b.remainder * a.modulus; remainder 222 src/ModulusRemainder.cpp remainder = a.remainder * b.remainder; remainder 223 src/ModulusRemainder.cpp } else if (a.remainder == 0 && b.remainder == 0) { remainder 226 src/ModulusRemainder.cpp remainder = 0; remainder 227 src/ModulusRemainder.cpp } else if (a.remainder == 0) { remainder 228 src/ModulusRemainder.cpp modulus = a.modulus * gcd(b.modulus, b.remainder); remainder 229 src/ModulusRemainder.cpp remainder = 0; remainder 230 src/ModulusRemainder.cpp } else if (b.remainder == 0) { remainder 231 src/ModulusRemainder.cpp modulus = b.modulus * gcd(a.modulus, a.remainder); remainder 232 src/ModulusRemainder.cpp remainder = 0; remainder 236 src/ModulusRemainder.cpp a.remainder = mod(a.remainder * b.remainder, modulus); remainder 244 src/ModulusRemainder.cpp remainder = 0; remainder 261 src/ModulusRemainder.cpp int64_t diff = (int64_t)a.remainder - (int64_t)b.remainder; remainder 269 src/ModulusRemainder.cpp int ra = mod(a.remainder, modulus); remainder 271 src/ModulusRemainder.cpp internal_assert(ra == mod(b.remainder, modulus)) remainder 274 src/ModulusRemainder.cpp << "a.remainder = " << a.remainder << "\n" remainder 276 src/ModulusRemainder.cpp << "b.remainder = " << b.remainder << "\n" remainder 301 src/ModulusRemainder.cpp modulus = gcd(modulus, b.remainder); remainder 302 src/ModulusRemainder.cpp remainder = mod(a.remainder, modulus); remainder 308 src/ModulusRemainder.cpp remainder = r.remainder; remainder 314 src/ModulusRemainder.cpp remainder = r.remainder; remainder 357 src/ModulusRemainder.cpp remainder = r.remainder; remainder 362 src/ModulusRemainder.cpp remainder = 0; remainder 375 src/ModulusRemainder.cpp remainder = 0; remainder 390 src/ModulusRemainder.cpp remainder = val.remainder; remainder 397 src/ModulusRemainder.cpp remainder = 0; remainder 15 src/ModulusRemainder.h ModulusRemainder() : modulus(0), remainder(0) {} remainder 16 src/ModulusRemainder.h ModulusRemainder(int m, int r) : modulus(m), remainder(r) {} remainder 17 src/ModulusRemainder.h int modulus, remainder; remainder 42 src/ModulusRemainder.h EXPORT bool reduce_expr_modulo(Expr e, int modulus, int *remainder); remainder 43 src/ModulusRemainder.h EXPORT bool reduce_expr_modulo(Expr e, int modulus, int *remainder, const Scope<ModulusRemainder> &scope); remainder 167 src/Schedule.cpp if (b.remainder.defined()) { remainder 168 src/Schedule.cpp b.remainder = mutator->mutate(b.remainder); remainder 358 src/Schedule.cpp if (b.remainder.defined()) { remainder 359 src/Schedule.cpp b.remainder.accept(visitor); remainder 217 src/Schedule.h Expr min, extent, modulus, remainder; remainder 1675 src/Simplify.cpp div_imp((int64_t)mod_rem.remainder, ib) == div_imp(mod_rem.remainder + (ramp_a->lanes-1)*ia, ib)) { remainder 2069 src/Simplify.cpp expr = make_const(op->type, mod_imp((int64_t)mod_rem.remainder, ib)); remainder 2086 src/Simplify.cpp div_imp((int64_t)mod_rem.remainder, ib) == div_imp(mod_rem.remainder + (ramp_a->lanes-1)*ia, ib)) { remainder 2088 src/Simplify.cpp Expr new_base = make_const(ramp_a->base.type(), mod_imp((int64_t)mod_rem.remainder, ib)); remainder 2100 src/Simplify.cpp Expr new_base = make_const(t, mod_imp((int64_t)mod_rem.remainder, ib)); remainder 2900 src/Simplify.cpp if (mod_rem.remainder) { remainder 3267 src/Simplify.cpp 0 <= ia * (delta_ramp->lanes - 1) + mod_rem.remainder && remainder 3268 src/Simplify.cpp ia * (delta_ramp->lanes - 1) + mod_rem.remainder < mod_rem.modulus) {