min 83 apps/HelloAndroid/jni/hello_wrapper.cpp srcBuf.dim[0].min = 0; min 86 apps/HelloAndroid/jni/hello_wrapper.cpp srcBuf.dim[1].min = 0; min 100 apps/HelloAndroid/jni/hello_wrapper.cpp dstBuf.dim[0].min = 0; min 103 apps/HelloAndroid/jni/hello_wrapper.cpp dstBuf.dim[1].min = 0; min 122 apps/HelloAndroid/jni/hello_wrapper.cpp unsigned min = times[0]; min 124 apps/HelloAndroid/jni/hello_wrapper.cpp if (times[i] < min) min = times[i]; min 126 apps/HelloAndroid/jni/hello_wrapper.cpp LOGD("Time taken: %d (%d)", elapsed_us, min); min 157 apps/HelloAndroidCamera2/jni/HalideFilters.cpp unsigned min = times[0]; min 159 apps/HelloAndroidCamera2/jni/HalideFilters.cpp if (times[i] < min) { min 160 apps/HelloAndroidCamera2/jni/HalideFilters.cpp min = times[i]; min 163 apps/HelloAndroidCamera2/jni/HalideFilters.cpp LOGD("Time taken: %d us (minimum: %d us)", elapsed_us, min); min 28 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp dstBuf.min[0] = 0; min 29 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp dstBuf.min[1] = 0; min 30 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp dstBuf.min[2] = 0; min 16 apps/HelloHexagon/process.cpp T clamp(T x, T min, T max) { min 17 apps/HelloHexagon/process.cpp if (x < min) x = min; min 90 apps/HelloiOS/HelloiOS/reaction_diffusion_2_generator.cpp new_state(x, state.dim(1).min(), c) = random_float(frame)*0.2f; min 92 apps/HelloiOS/HelloiOS/reaction_diffusion_2_generator.cpp new_state(state.dim(0).min(), y, c) = random_float(frame)*0.2f; min 188 apps/HelloiOS/HelloiOS/reaction_diffusion_2_generator.cpp Expr R = min(c0, max(c1, c2)); min 20 apps/c_backend/run.cpp in->dim[0].min = 0; min 21 apps/c_backend/run.cpp in->dim[1].min = 0; min 26 apps/c_backend/run.cpp origin -= in->dim[0].min * in->dim[0].stride; min 27 apps/c_backend/run.cpp origin -= in->dim[1].min * in->dim[1].stride; min 84 apps/camera_pipe/fcam/Demosaic.cpp outWidth = min(outWidth, out.width()); min 85 apps/camera_pipe/fcam/Demosaic.cpp outHeight = min(outHeight, out.height()); min 134 apps/camera_pipe/fcam/Demosaic.cpp linear[G][GR][y][x] = min(inBlock[GR][y][x], min 139 apps/camera_pipe/fcam/Demosaic.cpp linear[R][R][y][x] = min(inBlock[R][y][x], min 144 apps/camera_pipe/fcam/Demosaic.cpp linear[B][B][y][x] = min(inBlock[B][y][x], min 149 apps/camera_pipe/fcam/Demosaic.cpp linear[G][GB][y][x] = min(inBlock[GB][y][x], min 58 apps/camera_pipe/fcam/Demosaic_ARM.cpp outWidth = min(outWidth, out.width()); min 59 apps/camera_pipe/fcam/Demosaic_ARM.cpp outHeight = min(outHeight, out.height()); min 53 apps/fft/fft.cpp return std::min(x, y) * (std::max(x, y) / gcd(x, y)); min 397 apps/fft/fft.cpp vector_width = std::min(vector_width, extent_0); min 440 apps/fft/fft.cpp std::min(max_tile_size, target.natural_vector_size(f.output_types()[0])); min 717 apps/fft/fft.cpp std::min(zip_width, N0 / 2), // extent of dim 0 min 750 apps/fft/fft.cpp int zipped_extent0 = std::min((N1 + 1) / 2, zip_width); min 921 apps/fft/fft.cpp likely(dft0(A({n0, min(n1, (N1 / 2) - 1)}, args)))); min 956 apps/fft/fft.cpp std::min(zip_width, N0 / 2), // extent of dim 0 min 8 apps/hexagon_benchmarks/median3x3_generator.cpp return max(min(max(a, b), c), min(a, b)); min 20 apps/hexagon_benchmarks/median3x3_generator.cpp min_y(x,y) = min(bounded_input(x, y-1), bounded_input(x, y), bounded_input(x, y+1)); min 23 apps/hexagon_benchmarks/median3x3_generator.cpp minmax_x(x,y) = min(max_y(x-1, y), max_y(x, y), max_y(x+1, y)); min 50 apps/hexagon_benchmarks/process.h T clamp(T val, T min, T max) { min 51 apps/hexagon_benchmarks/process.h if (val < min) min 52 apps/hexagon_benchmarks/process.h return min; min 17 apps/hexagon_matmul/process.cpp T clamp(T x, T min, T max) { min 18 apps/hexagon_matmul/process.cpp if (x < min) x = min; min 152 apps/linear_algebra/tests/test_halide_blas.cpp const Scalar min_normal = std::numeric_limits<Scalar>::min(); min 109 apps/openglcompute/jni/oglc_run.cpp for (int j = 0; j < std::min(buf.height(), 10); j++) { min 111 apps/openglcompute/jni/oglc_run.cpp for (int i = 0; i < std::min(buf.width(), 10); i++) { min 21 apps/openglcompute/jni/oglc_two_kernels_run.cpp for (int j = 0; j < std::min(buf.height(), 10); j++) { min 23 apps/openglcompute/jni/oglc_two_kernels_run.cpp for (int i = 0; i < std::min(buf.width(), 10); i++) { min 121 apps/resize/resize.cpp float kernelScaling = std::min(scaleFactor, 1.0f); min 191 apps/resize/resize.cpp double min = Tools::benchmark(10, 1, [&]() { final.realize(out); }); min 192 apps/resize/resize.cpp std::cout << " took min=" << min * 1000 << " msec." << std::endl; min 59 apps/simd_op_check/driver.cpp buf.dim[0].min = 0; min 60 apps/simd_op_check/driver.cpp buf.dim[1].min = 0; min 118 apps/templates/SimpleAppAPI.h bool halide_randomize_buffer_host(void *user_context, int seed, T min, T max, buffer_t* buf) { min 136 apps/templates/SimpleAppAPI.h *p3 = min + (T) (((double) rnd() / (double) 0xffffffff) * (max - min)); min 28 apps/wavelet/wavelet.cpp T clamp(T x, T min, T max) { min 29 apps/wavelet/wavelet.cpp if (x < min) return min; min 72 python_bindings/python/Argument.cpp .def_readonly("min", &Argument::min) min 207 python_bindings/python/IROperator.cpp h::Expr (*min_exprs)(h::Expr, h::Expr) = &h::min; min 208 python_bindings/python/IROperator.cpp h::Expr (*min_expr_int)(const h::Expr &, int) = &h::min; min 209 python_bindings/python/IROperator.cpp h::Expr (*min_int_expr)(int, const h::Expr &) = &h::min; min 161 python_bindings/python/Image.cpp repr = boost::str(f % suffix % t.bits() % t.bytes() % buffer.extent(0) % buffer.extent(1) % buffer.extent(2) % buffer.extent(3) % buffer.min(0) % buffer.min(1) % buffer.min(2) % buffer.min(3) % buffer.stride(0) % buffer.stride(1) % buffer.stride(2) % buffer.stride(3)); min 232 python_bindings/python/Image.cpp return im.min(d); min 515 python_bindings/python/Image.cpp shape[i].min = 0; min 535 python_bindings/python/Param.cpp p::object call_create_param_object(T true_val, std::string name, h::Expr min, h::Expr max) { min 536 python_bindings/python/Param.cpp return create_param_object<T>(name, true_val, min, max); min 540 python_bindings/python/Param.cpp p::object call_create_param_object(T true_val, h::Expr min, h::Expr max) { min 541 python_bindings/python/Param.cpp return create_param_object<T>(true_val, min, max); min 585 python_bindings/python/Param.cpp static p::object create_param4(h::Type type, p::object val, h::Expr min, h::Expr max) { min 586 python_bindings/python/Param.cpp return create_param1_impl_t<pixel_types_t, h::Expr, h::Expr>()(type, val, min, max); min 589 python_bindings/python/Param.cpp static p::object create_param5(h::Type type, std::string name, p::object val, h::Expr min, h::Expr max) { min 590 python_bindings/python/Param.cpp return create_param1_impl_t<pixel_types_t, std::string, h::Expr, h::Expr>()(type, val, name, min, max); min 31 python_bindings/python/RDom.cpp .def("min", &RVar::min, p::arg("self"), min 95 python_bindings/python/Type.cpp .def("min", &Type::min, p::arg("self"), min 41 python_bindings/tests/the_sort_function.c int32_t min[4]; min 197 src/AddImageChecks.cpp Expr min = Call::make(Int(32), Call::buffer_get_min, min 201 src/AddImageChecks.cpp query_box.push_back(Interval(min, max)); min 262 src/AddImageChecks.cpp Expr min_required = touched.empty() ? actual_min : touched[j].min; min 263 src/AddImageChecks.cpp Expr extent_required = touched.empty() ? actual_extent : (touched[j].max + 1 - touched[j].min); min 425 src/AddImageChecks.cpp min_constrained = image.dim(i).min(); min 78 src/AddParameterChecks.cpp constrained_value = min(constrained_value, param.get_max_value()); min 134 src/AlignLoads.cpp int slice_lanes = std::min(native_lanes, lanes - i); min 73 src/AllocationBoundsInference.cpp Expr min, max, extent; min 74 src/AllocationBoundsInference.cpp b[i].min = simplify(b[i].min); min 76 src/AllocationBoundsInference.cpp if (bound.min.defined()) { min 77 src/AllocationBoundsInference.cpp min = bound.min; min 79 src/AllocationBoundsInference.cpp min = b[i].min; min 83 src/AllocationBoundsInference.cpp max = simplify(min + extent - 1); min 86 src/AllocationBoundsInference.cpp extent = simplify((max - min) + 1); min 90 src/AllocationBoundsInference.cpp min -= bound.remainder; min 91 src/AllocationBoundsInference.cpp min = (min / bound.modulus) * bound.modulus; min 92 src/AllocationBoundsInference.cpp min += bound.remainder; min 97 src/AllocationBoundsInference.cpp extent = simplify(max_plus_one - min); min 104 src/AllocationBoundsInference.cpp internal_assert(min_var.type() == min.type()); min 108 src/AllocationBoundsInference.cpp {f_args[i], f.name(), min_var, max_var, b[i].min, b[i].max}, min 111 src/AllocationBoundsInference.cpp if (bound.min.defined()) { min 112 src/AllocationBoundsInference.cpp stmt = Block::make(AssertStmt::make(min_var <= b[i].min, error_msg), stmt); min 119 src/AllocationBoundsInference.cpp stmt = LetStmt::make(min_name, min, stmt); min 58 src/Argument.h Expr def, min, max; min 65 src/Argument.h name(_name), kind(_kind), dimensions((uint8_t) _dimensions), type(_type), def(_def), min(_min), max(_max) { min 71 src/Argument.h user_assert(!(is_buffer() && min.defined())) min 96 src/Argument.h min.same_as(rhs.min) && min 117 src/AssociativeOpsTable.cpp Expr tmin = t.min(); \ min 143 src/AssociativeOpsTable.cpp {min(x0, y0), tmax, true}, min 182 src/AssociativeOpsTable.cpp {{min(x0, y0), select(x0 < y0, x1, y1)}, {tmax, zero}, true}, min 219 src/AssociativeOpsTable.cpp {cast<uint8_t>(min(cast<uint16_t>(x0 + y0), k0_uint16)), zero, true}, min 220 src/AssociativeOpsTable.cpp {cast<uint8_t>(min(cast<uint32_t>(x0 + y0), k0_uint32)), zero, true}, min 221 src/AssociativeOpsTable.cpp {cast<uint8_t>(min(cast<uint64_t>(x0 + y0), k0_uint64)), zero, true}, min 238 src/AssociativeOpsTable.cpp {cast<uint16_t>(min(cast<uint32_t>(x0 + y0), k0_uint32)), zero, true}, min 239 src/AssociativeOpsTable.cpp {cast<uint16_t>(min(cast<uint64_t>(x0 + y0), k0_uint64)), zero, true}, min 255 src/AssociativeOpsTable.cpp {cast<uint32_t>(min(cast<uint64_t>(x0 + y0), k0_uint64)), zero, true}, min 536 src/Associativity.cpp check_associativity("f", {x_idx}, {Cast::make(UInt(8), min(Cast::make(UInt(16), y + f_call_0), make_const(t, 255)))}, min 538 src/Associativity.cpp AssociativePattern(Cast::make(UInt(8), min(Cast::make(UInt(16), x + y), make_const(t, 255))), make_const(t, 0), true), min 545 src/Associativity.cpp check_associativity("f", {x_idx}, {Cast::make(UInt(8), min(Cast::make(UInt(16), y + f_call_0), Cast::make(UInt(16), make_const(t, 255))))}, min 547 src/Associativity.cpp AssociativePattern(Cast::make(UInt(8), min(Cast::make(UInt(16), x + y), make_const(t, 255))), make_const(t, 0), true), min 619 src/Associativity.cpp check_associativity("f", {x}, {min(f_call_0, y + Cast::make(Int(16), z))}, min 621 src/Associativity.cpp AssociativePattern(min(x, y), t.max(), true), min 639 src/Associativity.cpp AssociativePattern(max(x, y), t.min(), true), min 655 src/Associativity.cpp check_associativity("f", {x}, {min(f_call_0, g_call_0), f_call_1*g_call_0*2, f_call_2 + z}, min 658 src/Associativity.cpp {min(xs[0], ys[0]), xs[1] * ys[1], xs[2] + ys[2]}, min 679 src/Associativity.cpp check_associativity("f", {x}, {min(4, g_call_0)}, min 683 src/Associativity.cpp {Replacement("y", min(g_call_0, 4))}, min 691 src/Associativity.cpp check_associativity("f", {x}, {max(max(min(f_call_0, g_call_0 + 2), f_call_0), g_call_0 + 2)}, min 693 src/Associativity.cpp AssociativePattern(max(x, y), t.min(), true), min 712 src/Associativity.cpp check_associativity("f", {x}, {min(f_call_0, g_call_0), select(f_call_0 < g_call_0, f_call_1, rx)}, min 715 src/Associativity.cpp {min(xs[0], ys[0]), select(xs[0] < ys[0], xs[1], ys[1])}, min 726 src/Associativity.cpp AssociativePattern(max(x, y), t.min(), true), min 746 src/Associativity.cpp {min(f_xy_call_0, g_xy_call_0), min 752 src/Associativity.cpp {min(xs[0], ys[0]), ys[1] , select(xs[0] < ys[0], xs[2], ys[2]), select(xs[0] < ys[0], xs[3], ys[3])}, min 18 src/BoundaryConditions.cpp Expr min = bounds[i].first; min 21 src/BoundaryConditions.cpp if (min.defined() && extent.defined()) { min 22 src/BoundaryConditions.cpp actuals.push_back(clamp(likely(arg_var), min, min + extent - 1)); min 23 src/BoundaryConditions.cpp } else if (!min.defined() && !extent.defined()) { min 52 src/BoundaryConditions.cpp Expr min = bounds[i].first; min 55 src/BoundaryConditions.cpp if (min.defined() && extent.defined()) { min 57 src/BoundaryConditions.cpp arg_var < min || min 58 src/BoundaryConditions.cpp arg_var >= min + extent); min 59 src/BoundaryConditions.cpp } else if (min.defined() || extent.defined()) { min 96 src/BoundaryConditions.cpp Expr min = bounds[i].first; min 99 src/BoundaryConditions.cpp if (min.defined() && extent.defined()) { min 100 src/BoundaryConditions.cpp Expr coord = arg_var - min; // Enforce zero origin. min 102 src/BoundaryConditions.cpp coord = coord + min; // Restore correct min min 105 src/BoundaryConditions.cpp coord = select(arg_var < min || arg_var >= min + extent, coord, min 106 src/BoundaryConditions.cpp clamp(likely(arg_var), min, min + extent - 1)); min 109 src/BoundaryConditions.cpp } else if (!min.defined() && !extent.defined()) { min 138 src/BoundaryConditions.cpp Expr min = bounds[i].first; min 141 src/BoundaryConditions.cpp if (min.defined() && extent.defined()) { min 142 src/BoundaryConditions.cpp Expr coord = arg_var - min; // Enforce zero origin. min 145 src/BoundaryConditions.cpp coord = coord + min; // Restore correct min min 146 src/BoundaryConditions.cpp coord = clamp(coord, min, min + extent - 1); min 147 src/BoundaryConditions.cpp coord = select(arg_var < min || arg_var >= min + extent, coord, min 148 src/BoundaryConditions.cpp clamp(likely(arg_var), min, min + extent-1)); min 150 src/BoundaryConditions.cpp } else if (!min.defined() && !extent.defined()) { min 179 src/BoundaryConditions.cpp Expr min = bounds[i].first; min 182 src/BoundaryConditions.cpp if (min.defined() && extent.defined()) { min 184 src/BoundaryConditions.cpp Expr coord = arg_var - min; // Enforce zero origin. min 189 src/BoundaryConditions.cpp coord = coord + min; // Restore correct min min 192 src/BoundaryConditions.cpp coord = select(arg_var < min || arg_var >= min + extent, coord, min 193 src/BoundaryConditions.cpp clamp(likely(arg_var), min, min + extent - 1)); min 196 src/BoundaryConditions.cpp } else if (!min.defined() && !extent.defined()) { min 93 src/BoundaryConditions.h object_bounds.push_back({ Expr(func_like.dim(i).min()), Expr(func_like.dim(i).extent()) }); min 139 src/BoundaryConditions.h object_bounds.push_back({ Expr(func_like.dim(i).min()), Expr(func_like.dim(i).extent()) }); min 175 src/BoundaryConditions.h object_bounds.push_back({ Expr(func_like.dim(i).min()), Expr(func_like.dim(i).extent()) }); min 210 src/BoundaryConditions.h object_bounds.push_back({ Expr(func_like.dim(i).min()), Expr(func_like.dim(i).extent()) }); min 248 src/BoundaryConditions.h object_bounds.push_back({ Expr(func_like.dim(i).min()), Expr(func_like.dim(i).extent()) }); min 49 src/Bounds.cpp } else if (const Min *min = e.as<Min>()) { min 50 src/Bounds.cpp Expr a = find_constant_bound(min->a, d); min 51 src/Bounds.cpp Expr b = find_constant_bound(min->b, d); min 102 src/Bounds.cpp interval.min = iter->second.min; min 113 src/Bounds.cpp interval = Interval(t.min(), t.max()); min 147 src/Bounds.cpp interval = Interval::single_point(Cast::make(to, a.min)); min 167 src/Bounds.cpp a.min = simplify(a.min); min 171 src/Bounds.cpp Expr lower_bound = find_constant_bound(a.min, Direction::Lower); min 194 src/Bounds.cpp if (a.has_lower_bound()) interval.min = a.min; min 197 src/Bounds.cpp if (interval.has_lower_bound()) interval.min = Cast::make(to, interval.min); min 225 src/Bounds.cpp interval = Interval::single_point(a.min + b.min); min 229 src/Bounds.cpp interval.min = a.min + b.min; min 245 src/Bounds.cpp Expr no_overflow = (cast<int>(a.min) + cast<int>(b.min) == cast<int>(interval.min)); min 264 src/Bounds.cpp interval = Interval::single_point(a.min - b.min); min 268 src/Bounds.cpp interval.min = a.min - b.max; min 271 src/Bounds.cpp interval.max = a.max - b.min; min 277 src/Bounds.cpp Expr no_overflow = (cast<int>(a.max) - cast<int>(b.min) == cast<int>(interval.max)); min 284 src/Bounds.cpp Expr no_overflow = (cast<int>(a.min) - cast<int>(b.max) == cast<int>(interval.min)); min 295 src/Bounds.cpp !can_prove(b.max <= a.min)) { min 317 src/Bounds.cpp interval = Interval::single_point(a.min * b.min); min 319 src/Bounds.cpp Expr e1 = a.has_lower_bound() ? a.min * b.min : a.min; min 320 src/Bounds.cpp Expr e2 = a.has_upper_bound() ? a.max * b.min : a.max; min 321 src/Bounds.cpp if (is_zero(b.min)) { min 323 src/Bounds.cpp } else if (is_positive_const(b.min) || op->type.is_uint()) { min 325 src/Bounds.cpp } else if (is_negative_const(b.min)) { min 329 src/Bounds.cpp Expr cmp = b.min >= make_zero(b.min.type().element_of()); min 336 src/Bounds.cpp interval.include(a.min * b.min); min 337 src/Bounds.cpp interval.include(a.min * b.max); min 338 src/Bounds.cpp interval.include(a.max * b.min); min 347 src/Bounds.cpp Expr test1 = (cast<int>(a.min) * cast<int>(b.min) == cast<int>(a.min * b.min)); min 348 src/Bounds.cpp Expr test2 = (cast<int>(a.min) * cast<int>(b.max) == cast<int>(a.min * b.max)); min 349 src/Bounds.cpp Expr test3 = (cast<int>(a.max) * cast<int>(b.min) == cast<int>(a.max * b.min)); min 372 src/Bounds.cpp } else if (can_prove(b.min == b.max)) { min 373 src/Bounds.cpp Expr e1 = a.has_lower_bound() ? a.min / b.min : a.min; min 375 src/Bounds.cpp if (is_positive_const(b.min) || op->type.is_uint()) { min 377 src/Bounds.cpp } else if (is_negative_const(b.min)) { min 383 src/Bounds.cpp Expr cmp = b.min > make_zero(b.min.type().element_of()); min 390 src/Bounds.cpp int min_sign = static_sign(b.min); min 398 src/Bounds.cpp interval.include(a.min / b.min); min 399 src/Bounds.cpp interval.include(a.max / b.min); min 400 src/Bounds.cpp interval.include(a.min / b.max); min 426 src/Bounds.cpp interval = Interval::single_point(a.min % b.min); min 429 src/Bounds.cpp if (b.max.type().is_uint() || (b.max.type().is_int() && is_positive_const(b.min))) { min 437 src/Bounds.cpp interval = Interval(make_zero(t), Max::make(abs(b.min), abs(b.max)) - make_one(t)); min 442 src/Bounds.cpp interval = Interval(make_zero(t), Max::make(abs(b.min), abs(b.max))); min 457 src/Bounds.cpp interval = Interval(Interval::make_min(a.min, b.min), min 473 src/Bounds.cpp interval = Interval(Interval::make_max(a.min, b.min), min 531 src/Bounds.cpp if (a.min.same_as(b.min)) { min 532 src/Bounds.cpp interval.min = a.min; min 534 src/Bounds.cpp interval.min = select(op->condition, a.min, b.min); min 536 src/Bounds.cpp interval.min = Interval::make_min(a.min, b.min); min 553 src/Bounds.cpp Load::make(op->type.element_of(), op->name, interval.min, min 588 src/Bounds.cpp new_args[i] = interval.min; min 609 src/Bounds.cpp interval.min = make_zero(t); min 611 src/Bounds.cpp if (equal(a.min, a.max)) { min 614 src/Bounds.cpp interval.max = Max::make(Cast::make(t, -a.min), Cast::make(t, a.max)); min 616 src/Bounds.cpp a.min = Call::make(t, Call::abs, {a.min}, Call::PureIntrinsic); min 618 src/Bounds.cpp interval.max = Max::make(a.min, a.max); min 655 src/Bounds.cpp Call::make(t, op->name, {interval.min}, op->call_type, min 695 src/Bounds.cpp if (is_const(val.min)) { min 697 src/Bounds.cpp var.min = val.min; min 698 src/Bounds.cpp val.min = Expr(); min 700 src/Bounds.cpp var.min = Variable::make(op->value.type().element_of(), min_name); min 719 src/Bounds.cpp if (val.min.defined() && expr_uses_var(interval.min, min_name)) { min 720 src/Bounds.cpp interval.min = Let::make(min_name, val.min, interval.min); min 722 src/Bounds.cpp if (val.max.defined() && expr_uses_var(interval.min, max_name)) { min 723 src/Bounds.cpp interval.min = Let::make(max_name, val.max, interval.min); min 728 src/Bounds.cpp if (val.min.defined() && expr_uses_var(interval.max, min_name)) { min 729 src/Bounds.cpp interval.max = Let::make(min_name, val.min, interval.max); min 789 src/Bounds.cpp internal_assert(b.interval.min.type().is_scalar()) min 791 src/Bounds.cpp << " should have been a scalar: " << b.interval.min << "\n"; min 805 src/Bounds.cpp Expr min = Min::make(a[i].min, b[i].min); min 806 src/Bounds.cpp Expr max_a = a[i].min + a[i].extent; min 807 src/Bounds.cpp Expr max_b = b[i].min + b[i].extent; min 809 src/Bounds.cpp Expr extent = max_plus_one - min; min 810 src/Bounds.cpp result.push_back(Range(simplify(min), simplify(extent))); min 835 src/Bounds.cpp if (!a[i].min.same_as(b[i].min)) { min 839 src/Bounds.cpp a[i].min = select(a.used, a[i].min, b[i].min); min 841 src/Bounds.cpp a[i].min = select(a.used && b.used, Interval::make_min(a[i].min, b[i].min), min 842 src/Bounds.cpp a.used, a[i].min, min 843 src/Bounds.cpp b[i].min); min 846 src/Bounds.cpp a[i].min = select(a.used, Interval::make_min(a[i].min, b[i].min), b[i].min); min 848 src/Bounds.cpp a[i].min = select(b.used, Interval::make_min(a[i].min, b[i].min), a[i].min); min 850 src/Bounds.cpp a[i].min = Interval::make_min(a[i].min, b[i].min); min 852 src/Bounds.cpp a[i].min = simplify(a[i].min); min 854 src/Bounds.cpp a[i].min = Interval::neg_inf; min 909 src/Bounds.cpp result[i].min = simplify(max(a[i].min, b[i].min)); min 910 src/Bounds.cpp result[i].max = simplify(min(a[i].max, b[i].max)); min 943 src/Bounds.cpp overlap = overlap && b[i].max >= a[i].min; min 946 src/Bounds.cpp overlap = overlap && a[i].max >= b[i].min; min 963 src/Bounds.cpp (outer[i].min <= inner[i].min) && min 1059 src/Bounds.cpp bool fixed = value_bounds.min.same_as(value_bounds.max); min 1060 src/Bounds.cpp value_bounds.min = simplify(value_bounds.min); min 1061 src/Bounds.cpp value_bounds.max = fixed ? value_bounds.min : simplify(value_bounds.max); min 1063 src/Bounds.cpp if (is_small_enough_to_substitute(value_bounds.min) && min 1081 src/Bounds.cpp if (expr_uses_var(box[i].min, max_name)) { min 1082 src/Bounds.cpp box[i].min = Let::make(max_name, value_bounds.max, box[i].min); min 1084 src/Bounds.cpp if (expr_uses_var(box[i].min, min_name)) { min 1085 src/Bounds.cpp box[i].min = Let::make(min_name, value_bounds.min, box[i].min); min 1093 src/Bounds.cpp box[i].max = Let::make(min_name, value_bounds.min, box[i].max); min 1149 src/Bounds.cpp likely_i.min = likely(i.min); min 1152 src/Bounds.cpp likely_i.min = likely_if_innermost(i.min); min 1159 src/Bounds.cpp i.max = min(likely_i.max, bi.max - 1); min 1162 src/Bounds.cpp i.max = min(likely_i.max, bi.max); min 1167 src/Bounds.cpp i.min = max(likely_i.min, bi.min + 1); min 1170 src/Bounds.cpp i.min = max(likely_i.min, bi.min); min 1180 src/Bounds.cpp likely_i.min = likely(i.min); min 1183 src/Bounds.cpp likely_i.min = likely_if_innermost(i.min); min 1190 src/Bounds.cpp i.max = min(likely_i.max, ai.max - 1); min 1193 src/Bounds.cpp i.max = min(likely_i.max, ai.max); min 1198 src/Bounds.cpp i.min = max(likely_i.min, ai.min + 1); min 1201 src/Bounds.cpp i.min = max(likely_i.min, ai.min); min 1266 src/Bounds.cpp op->min.accept(this); min 1272 src/Bounds.cpp min_val = scope.get(op->name + ".loop_min").min; min 1274 src/Bounds.cpp min_val = bounds_of_expr_in_scope(op->min, scope, func_bounds).min; min 1281 src/Bounds.cpp max_val += bounds_of_expr_in_scope(op->min, scope, func_bounds).max; min 1442 src/Bounds.cpp result.min = simplify(common_subexpression_elimination(result.min)); min 1454 src/Bounds.cpp << " are: " << result.min << ", " << result.max << "\n"; min 1464 src/Bounds.cpp result.min = simplify(result.min); min 1466 src/Bounds.cpp if (!equal(result.min, correct_min)) { min 1468 src/Bounds.cpp << "Incorrect min: " << result.min << '\n' min 1560 src/Bounds.cpp internal_assert(equal(simplify(r["input"][0].min), 6)); min 1564 src/Bounds.cpp internal_assert(equal(simplify(r["output"][0].min), 4)); min 1569 src/Bounds.cpp internal_assert(equal(simplify(r2[0].min), 4)); min 309 src/BoundsInference.cpp Expr min = Variable::make(Int(32), last_stage + dim + ".min"); min 311 src/BoundsInference.cpp b[i] = Interval(min, max); min 420 src/BoundsInference.cpp if (bound.min.defined() || min 424 src/BoundsInference.cpp if (!bound.min.defined()) { min 425 src/BoundsInference.cpp bound.min = min_required; min 427 src/BoundsInference.cpp s = LetStmt::make(min_var, bound.min, s); min 428 src/BoundsInference.cpp s = LetStmt::make(max_var, bound.min + bound.extent - 1, s); min 457 src/BoundsInference.cpp s = LetStmt::make(arg + ".min", b[d].min, s); min 465 src/BoundsInference.cpp s = LetStmt::make(arg + ".min", rvar.min, s); min 466 src/BoundsInference.cpp s = LetStmt::make(arg + ".max", rvar.extent + rvar.min - 1, s); min 545 src/BoundsInference.cpp Expr min = Variable::make(Int(32), prefix + ".min"); min 547 src/BoundsInference.cpp builder.mins.push_back(min); min 548 src/BoundsInference.cpp builder.extents.push_back(max + 1 - min); min 741 src/BoundsInference.cpp Expr min = Call::make(Int(32), Call::buffer_get_min, min 745 src/BoundsInference.cpp b[d] = Interval(min, max); min 816 src/BoundsInference.cpp Expr min = Variable::make(Int(32), buffer_name + ".min." + std::to_string(d), buf); min 824 src/BoundsInference.cpp min = min_constraint; min 830 src/BoundsInference.cpp output_box.push_back(Interval(min, (min + extent) - 1)); min 928 src/BoundsInference.cpp body = LetStmt::make(var + ".min", box[i].min, body); min 954 src/BoundsInference.cpp body = LetStmt::make(var + ".min", in.min, body); min 978 src/BoundsInference.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 328 src/Buffer.h HALIDE_BUFFER_FORWARD_CONST(min) min 113 src/CanonicalizeGPUVars.cpp Expr min = mutate(op->min); min 142 src/CanonicalizeGPUVars.cpp min = substitute(op->name, new_var, min); min 149 src/CanonicalizeGPUVars.cpp min.same_as(op->min) && min 154 src/CanonicalizeGPUVars.cpp stmt = For::make(name, min, extent, op->for_type, op->device_api, body); min 35 src/Closure.cpp op->min.accept(this); min 68 src/CodeGen_ARM.cpp Expr tmin = simplify(cast(w, t.min())); min 70 src/CodeGen_ARM.cpp Expr tsmin = simplify(cast(ws, t.min())); min 126 src/CodeGen_ARM.cpp p.pattern = cast(t, min(w_vector + w_vector, tmax)); min 652 src/CodeGen_C.cpp stream << "{" << buffer.dim(i).min() min 1270 src/CodeGen_C.cpp string id_min = print_expr(op->min); min 52 src/CodeGen_GPU_Host.cpp internal_assert(is_zero(op->min)); min 851 src/CodeGen_Hexagon.cpp int min = indices[0]; min 853 src/CodeGen_Hexagon.cpp if (indices[i] != -1 && indices[i] < min) { min 854 src/CodeGen_Hexagon.cpp min = indices[i]; min 857 src/CodeGen_Hexagon.cpp if (min >= a_elements) { min 1040 src/CodeGen_Hexagon.cpp max_index = std::min(max_index, static_cast<int>(lut_ty->getVectorNumElements()) - 1); min 1125 src/CodeGen_Hexagon.cpp min_index = std::min(min_index, i); min 1172 src/CodeGen_Hexagon.cpp int range_extent_i = std::min(max_index - min_index_i, 255); min 232 src/CodeGen_LLVM.cpp min_i8(Int(8).min()), min 236 src/CodeGen_LLVM.cpp min_i16(Int(16).min()), min 240 src/CodeGen_LLVM.cpp min_i32(Int(32).min()), min 244 src/CodeGen_LLVM.cpp min_i64(Int(64).min()), min 248 src/CodeGen_LLVM.cpp min_f32(Float(32).min()), min 251 src/CodeGen_LLVM.cpp min_f64(Float(64).min()), min 922 src/CodeGen_LLVM.cpp Expr min = args[arg].min; min 927 src/CodeGen_LLVM.cpp def = min = max = Expr(); min 935 src/CodeGen_LLVM.cpp embed_constant_expr(min), min 1923 src/CodeGen_LLVM.cpp int slice_lanes = std::min(native_lanes, store_lanes - i); min 2010 src/CodeGen_LLVM.cpp int slice_lanes = std::min(native_lanes, load_lanes - i); min 2735 src/CodeGen_LLVM.cpp i < std::min(args.size(), (size_t)(func_t->getNumParams())); min 2936 src/CodeGen_LLVM.cpp Value *min = codegen(op->min); min 2940 src/CodeGen_LLVM.cpp Value *max = builder->CreateNSWAdd(min, extent); min 2950 src/CodeGen_LLVM.cpp Value *enter_condition = builder->CreateICmpSLT(min, max); min 2956 src/CodeGen_LLVM.cpp phi->addIncoming(min, preheader_bb); min 3053 src/CodeGen_LLVM.cpp Value *args[] = {user_context, function, min, extent, ptr}; min 3133 src/CodeGen_LLVM.cpp int slice_lanes = std::min(native_lanes, store_lanes - i); min 158 src/CodeGen_Metal_Dev.cpp internal_assert(is_zero(loop->min)); min 115 src/CodeGen_OpenCL_Dev.cpp internal_assert(is_zero(loop->min)); min 128 src/CodeGen_OpenGLCompute_Dev.cpp internal_assert(is_zero(loop->min)); min 394 src/CodeGen_OpenGL_Dev.cpp debug(1) << "Dropping loop " << loop->name << " (" << loop->min << ", " << loop->extent << ")\n"; min 173 src/CodeGen_PTX_Dev.cpp internal_assert(is_zero(loop->min)); min 119 src/DebugToFile.cpp Expr min = Variable::make(Int(32), out.name() + ".min." + dim); min 121 src/DebugToFile.cpp output_bounds.push_back(Range(min, extent)); min 31 src/EarlyFree.cpp loop->min.accept(this); min 295 src/Elf.cpp internal_assert(std::numeric_limits<T>::min() <= x && x <= std::numeric_limits<T>::max()); min 38 src/Func.cpp using std::min; min 445 src/Func.cpp old_max = simplify(it->min + it->extent - 1); min 446 src/Func.cpp old_min = it->min; min 450 src/Func.cpp it->min = 0; min 479 src/Func.cpp inner_min = iter_inner->min; min 481 src/Func.cpp outer_min = iter_outer->min; min 486 src/Func.cpp iter_outer->min = 0; min 555 src/Func.cpp rvar_bounds.push_back({ rv.var + ".loop_min", rv.min }); min 556 src/Func.cpp rvar_bounds.push_back({ rv.var + ".loop_max", simplify(rv.min + rv.extent - 1) }); min 1936 src/Func.cpp Func &Func::bound(Var var, Expr min, Expr extent) { min 1937 src/Func.cpp user_assert(!min.defined() || Int(32).can_represent(min.type())) << "Can't represent min bound in int32\n"; min 1941 src/Func.cpp if (min.defined()) { min 1942 src/Func.cpp min = cast<int32_t>(min); min 1959 src/Func.cpp Bound b = {var.name(), min, extent, Expr(), Expr()}; min 2198 src/Func.cpp constant_bounds = is_const(sched.bounds()[i].min) && min 1165 src/Func.h EXPORT Func &bound(Var var, Expr min, Expr extent); min 206 src/FuseGPUThreadLoops.cpp body = substitute(op->name, var + op->min, body); min 228 src/FuseGPUThreadLoops.cpp IntInterval(int min, int max) : min(min), max(max) {} min 229 src/FuseGPUThreadLoops.cpp int min; min 306 src/FuseGPUThreadLoops.cpp stmt = For::make(op->name, mutate(op->min), mutate(op->extent), op->for_type, op->device_api, body); min 477 src/FuseGPUThreadLoops.cpp if (lhs.liveness.min < rhs.liveness.min) { min 479 src/FuseGPUThreadLoops.cpp } else if (lhs.liveness.min == rhs.liveness.min) { min 492 src/FuseGPUThreadLoops.cpp if (allocations[i].liveness.min > stage) { min 494 src/FuseGPUThreadLoops.cpp } else if (allocations[i].liveness.min == stage) { // Allocate min 630 src/FuseGPUThreadLoops.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 693 src/FuseGPUThreadLoops.cpp if (CodeGen_GPU_Dev::is_gpu_var(op->name) && !is_zero(op->min)) { min 696 src/FuseGPUThreadLoops.cpp Expr adjusted = Variable::make(Int(32), op->name) + op->min; min 100 src/Generator.cpp Expr def, min, max; min 103 src/Generator.cpp min = param.get_min_value(); min 108 src/Generator.cpp param.type(), param.dimensions(), def, min, max); min 504 src/Generator.h const T &min = std::numeric_limits<T>::lowest(), min 506 src/Generator.h : GeneratorParamImpl<T>(name, value), min(min), max(max) { min 512 src/Generator.h user_assert(new_value >= min && new_value <= max) << "Value out of range: " << new_value; min 561 src/Generator.h const T min, max; min 727 src/Generator.h GeneratorParam(const std::string &name, const T &value, const T &min, const T &max) min 728 src/Generator.h : Internal::GeneratorParamImplBase<T>(name, value, min, max) {} min 862 src/Generator.h using std::min; min 865 src/Generator.h decltype(min((Other)0, (T)1)) min_forward(const Other &a, const GeneratorParam<T> &b) { return min(a, (T)b); } min 867 src/Generator.h decltype(min((T)0, (Other)1)) min_forward(const GeneratorParam<T> &a, const Other &b) { return min((T)a, b); } min 880 src/Generator.h auto min(const Other &a, const GeneratorParam<T> &b) -> decltype(Internal::GeneratorMinMax::min_forward(a, b)) { min 884 src/Generator.h auto min(const GeneratorParam<T> &a, const Other &b) -> decltype(Internal::GeneratorMinMax::min_forward(a, b)) { min 1482 src/Generator.h const TBase &min, min 1484 src/Generator.h : Super(name, def), min_(min), max_(max) { min 1490 src/Generator.h const TBase &min, min 1492 src/Generator.h : Super(array_size, name, def), min_(min), max_(max) { min 1548 src/Generator.h const TBase &def, const TBase &min, const TBase &max) min 1549 src/Generator.h : Super(name, def, min, max) { min 1553 src/Generator.h const TBase &def, const TBase &min, const TBase &max) min 1554 src/Generator.h : Super(array_size, name, def, min, max) { min 665 src/HexagonOffload.cpp Stmt body = For::make(loop->name, loop->min, loop->extent, loop->for_type, min 1495 src/HexagonOptimize.cpp const Min *min_min = bounds.min.as<Min>(); min 1496 src/HexagonOptimize.cpp const Max *min_max = bounds.min.as<Max>(); min 1499 src/HexagonOptimize.cpp const Add *min_add = bounds.min.as<Add>(); min 1501 src/HexagonOptimize.cpp const Sub *min_sub = bounds.min.as<Sub>(); min 1513 src/HexagonOptimize.cpp return bounds.max - bounds.min; min 1565 src/HexagonOptimize.cpp (unaligned_index_bounds.min / align) * align, min 1578 src/HexagonOptimize.cpp Expr base = simplify(index_bounds.min); min 328 src/IR.cpp Stmt For::make(const std::string &name, const Expr &min, const Expr &extent, ForType for_type, DeviceAPI device_api, const Stmt &body) { min 329 src/IR.cpp internal_assert(min.defined()) << "For of undefined\n"; min 331 src/IR.cpp internal_assert(min.type().is_scalar()) << "For with vector min\n"; min 337 src/IR.cpp node->min = min; min 443 src/IR.cpp internal_assert(bounds[i].min.defined()) << "Realize of undefined\n"; min 445 src/IR.cpp internal_assert(bounds[i].min.type().is_scalar()) << "Realize of vector size\n"; min 464 src/IR.cpp internal_assert(bounds[i].min.defined()) << "Prefetch of undefined\n"; min 466 src/IR.cpp internal_assert(bounds[i].min.type().is_scalar()) << "Prefetch of vector size\n"; min 386 src/IR.h Expr min, extent; min 388 src/IR.h Range(const Expr &min, const Expr &extent) : min(min), extent(extent) { min 389 src/IR.h internal_assert(min.type() == extent.type()) << "Region min and extent must have same type\n"; min 650 src/IR.h Expr min, extent; min 655 src/IR.h EXPORT static Stmt make(const std::string &name, const Expr &min, const Expr &extent, ForType for_type, DeviceAPI device_api, const Stmt &body); min 365 src/IREquality.cpp compare_expr(s->min, op->min); min 409 src/IREquality.cpp compare_expr(s->bounds[i].min, op->bounds[i].min); min 460 src/IREquality.cpp compare_expr(s->bounds[i].min, op->bounds[i].min); min 48 src/IRMutator.cpp Expr old_min = bounds[i].min; min 205 src/IRMutator.cpp Expr min = mutate(op->min); min 208 src/IRMutator.cpp if (min.same_as(op->min) && min 213 src/IRMutator.cpp stmt = For::make(op->name, min, extent, op->for_type, op->device_api, body); min 847 src/IROperator.cpp e = cast(t, clamp(e, t.min(), t.max())); min 849 src/IROperator.cpp e = clamp(cast(t, e), t.min(), t.max()); min 854 src/IROperator.cpp e = max(e, t.min()); // min values turn out to be always representable min 863 src/IROperator.cpp min_bound = lossless_cast(e.type(), t.min()); min 872 src/IROperator.cpp e = min(e, max_bound); min 700 src/IROperator.h inline Expr min(Expr a, Expr b) { min 712 src/IROperator.h inline Expr min(const Expr &a, int b) { min 723 src/IROperator.h inline Expr min(int a, const Expr &b) { min 729 src/IROperator.h inline Expr min(float a, const Expr &b) {return min(Expr(a), b);} min 730 src/IROperator.h inline Expr min(const Expr &a, float b) {return min(a, Expr(b));} min 740 src/IROperator.h inline Expr min(const A &a, const B &b, const C &c, Rest&&... rest) { min 741 src/IROperator.h return min(a, min(b, c, std::forward<Rest>(rest)...)); min 565 src/IRPrinter.cpp print(op->min); min 640 src/IRPrinter.cpp print(op->bounds[i].min); min 666 src/IRPrinter.cpp print(op->bounds[i].min); min 166 src/IRVisitor.cpp op->min.accept(this); min 202 src/IRVisitor.cpp op->bounds[i].min.accept(this); min 211 src/IRVisitor.cpp op->bounds[i].min.accept(this); min 405 src/IRVisitor.cpp include(op->min); min 441 src/IRVisitor.cpp include(op->bounds[i].min); min 450 src/IRVisitor.cpp include(op->bounds[i].min); min 91 src/InferArguments.cpp Expr def, min, max; min 94 src/InferArguments.cpp min = p.get_min_value(); min 101 src/InferArguments.cpp p.type(), p.dimensions(), def, min, max), min 109 src/InferArguments.cpp visit_expr(min); min 105 src/InjectImageIntrinsics.cpp Expr min = Variable::make(Int(32), min_name); min 106 src/InjectImageIntrinsics.cpp args.push_back(mutate(padded_call_args[i]) - min); min 77 src/Inline.cpp if (s.bounds()[i].min.defined()) { min 81 src/Inline.cpp << s.bounds()[i].min << ", " min 145 src/InlineReductions.cpp f(v.free_vars) = e.type().min(); min 162 src/InlineReductions.cpp f(v.free_vars) = min(f(v.free_vars), e); min 185 src/InlineReductions.cpp initial_tup[value_index] = e.type().min(); min 95 src/Interval.cpp min = Interval::make_min(min, i.min); min 100 src/Interval.cpp min = Interval::make_min(min, e); min 110 src/Interval.cpp return Interval(Interval::make_max(a.min, b.min), min 122 src/Interval.cpp internal_assert(equal(result.min, expected.min) && min 125 src/Interval.cpp << " Expected [" << expected.min << ", " << expected.max << "]\n" min 126 src/Interval.cpp << " Got [" << result.min << ", " << result.max << "]\n"; min 21 src/Interval.h Expr min, max; min 24 src/Interval.h Interval() : min(neg_inf), max(pos_inf) {} min 27 src/Interval.h Interval(Expr min, Expr max) : min(min), max(max) { min 28 src/Interval.h internal_assert(min.defined() && max.defined()); min 41 src/Interval.h bool is_empty() const {return min.same_as(pos_inf) || max.same_as(neg_inf);} min 44 src/Interval.h bool is_everything() const {return min.same_as(neg_inf) && max.same_as(pos_inf);} min 47 src/Interval.h bool is_single_point() const {return min.same_as(max);} min 50 src/Interval.h bool is_single_point(Expr e) const {return min.same_as(e) && max.same_as(e);} min 56 src/Interval.h bool has_lower_bound() const {return !min.same_as(neg_inf) && !is_empty();} min 62 src/Interval.h bool same_as(const Interval &other) {return min.same_as(other.min) && max.same_as(other.max);} min 542 src/JITModule.cpp int min, int size, uint8_t *closure) { min 545 src/JITModule.cpp return (*jit_user_context->handlers.custom_do_par_for)(context, f, min, size, closure); min 547 src/JITModule.cpp return (*active_handlers.custom_do_par_for)(context, f, min, size, closure); min 28 src/Lerp.cpp bias_value = cast(computation_type, result_type.min()); min 107 src/Lerp.cpp int shift_amount = std::min(computation_type.bits(), weight.type().bits()); min 523 src/LoopCarry.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 528 src/LoopCarry.cpp stmt = Block::make(substitute(op->name, op->min, alloc.initial_stores), stmt); min 372 src/Memoization.cpp Expr min = Variable::make(Int(32), prefix + ".min"); min 374 src/Memoization.cpp builder.mins.push_back(min); min 375 src/Memoization.cpp builder.extents.push_back(max + 1 - min); min 429 src/Monotonic.cpp check_increasing(min(x+4, y+4)); min 47 src/OutputImageParam.cpp return dim(0).min(); min 57 src/OutputImageParam.cpp return dim(1).min(); min 66 src/OutputImageParam.h Expr min(int i) const {return dim(i).min();} min 138 src/ParallelRVar.cpp Interval in = Interval(rv.min, simplify(rv.min + rv.extent - 1)); min 68 src/Param.h Param(T val, Expr min, Expr max) : min 70 src/Param.h set_range(min, max); min 76 src/Param.h Param(const std::string &n, T val, Expr min, Expr max) : min 79 src/Param.h set_range(min, max); min 117 src/Param.h void set_range(Expr min, Expr max) { min 118 src/Param.h set_min_value(min); min 122 src/Param.h void set_min_value(Expr min) { min 123 src/Param.h if (min.defined() && min.type() != type_of<T>()) { min 124 src/Param.h min = Internal::Cast::make(type_of<T>(), min); min 126 src/Param.h param.set_min_value(min); min 315 src/Parameter.cpp return min() + extent() - 1; min 329 src/Parameter.cpp Dimension Dimension::set_min(Expr min) { min 330 src/Parameter.cpp param.set_min_constraint(d, min); min 340 src/Parameter.cpp Dimension Dimension::set_bounds(Expr min, Expr extent) { min 341 src/Parameter.cpp return set_min(min).set_extent(extent); min 152 src/Parameter.h EXPORT Expr min() const; min 201 src/Parameter.h EXPORT Dimension set_bounds(Expr min, Expr extent); min 37 src/PartitionLoops.cpp expr = min(likely(op->a), mutate(op->b)); min 39 src/PartitionLoops.cpp expr = min(mutate(op->a), likely(op->b)); min 339 src/PartitionLoops.cpp varying.push(op->name, Interval(op->min, op->min + op->extent - 1)); min 480 src/PartitionLoops.cpp s.tight &= equal(outer.min, s.interval.min) && equal(outer.max, s.interval.max); min 487 src/PartitionLoops.cpp << " min: " << s.interval.min << "\n" min 494 src/PartitionLoops.cpp Expr m = s.interval.min; min 596 src/PartitionLoops.cpp Expr min_steady = op->min, max_steady = op->extent + op->min; min 607 src/PartitionLoops.cpp min_vals.push_back(op->min); min 610 src/PartitionLoops.cpp prologue_val = min(prologue_val, op->extent + op->min); min 618 src/PartitionLoops.cpp max_vals.push_back(op->min + op->extent - 1); min 624 src/PartitionLoops.cpp epilogue_val = max(op->min, epilogue_val); min 638 src/PartitionLoops.cpp prologue = For::make(op->name, op->min, min_steady - op->min, min 643 src/PartitionLoops.cpp epilogue = For::make(op->name, max_steady, op->min + op->extent - max_steady, min 663 src/PartitionLoops.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, stmt); min 671 src/PartitionLoops.cpp epilogue_val = op->min + op->extent; min 678 src/PartitionLoops.cpp prologue_val = op->min; min 791 src/PartitionLoops.cpp internal_assert(!expr_uses_var(f->min, op->name) && min 794 src/PartitionLoops.cpp inner = For::make(f->name, f->min, f->extent, f->for_type, f->device_api, inner); min 869 src/PartitionLoops.cpp for_a->min.same_as(for_b->min) && min 872 src/PartitionLoops.cpp inner = For::make(for_a->name, for_a->min, for_a->extent, for_a->for_type, for_a->device_api, inner); min 951 src/Pipeline.cpp if (tb.query.dim(i).min() != tb.orig.dim(i).min() || min 98 src/Prefetch.cpp b.push_back(Interval(r.min, r.min + r.extent - 1)); min 117 src/Prefetch.cpp value_bounds.min = simplify(value_bounds.min); min 118 src/Prefetch.cpp value_bounds.max = fixed ? value_bounds.min : simplify(value_bounds.max); min 120 src/Prefetch.cpp if (should_substitute_let(value_bounds.min) && min 143 src/Prefetch.cpp body = LetOrLetStmt::make(min_name, value_bounds.min, body); min 170 src/Prefetch.cpp Expr extent = box[i].max - box[i].min + 1; min 171 src/Prefetch.cpp bounds.push_back(Range(box[i].min, extent)); min 237 src/Prefetch.cpp predicate = predicate && (prefetch_box[i].min >= bounds[i].min) && min 252 src/Prefetch.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 85 src/PrintLoopNest.cpp Expr min_val = op->min, extent_val = op->extent; min 257 src/Profiling.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 17 src/RDom.cpp if (!min().defined() || !extent().defined()) { min 26 src/RDom.cpp return _var().min; min 136 src/RDom.cpp rv.min = cast<int32_t>(ranges[i].first); min 151 src/RDom.cpp b.dim(i).min(), min 167 src/RDom.cpp p.dim(i).min(), min 222 src/RDom.cpp stream << v.name() << "(" << v.min() << ", " << v.extent() << ")"; min 46 src/RDom.h EXPORT Expr min() const; min 187 src/RDom.h NO_INLINE void initialize_from_ranges(std::vector<std::pair<Expr, Expr>> &ranges, Expr min, Expr extent, Args&&... args) { min 188 src/RDom.h ranges.push_back({ min, extent }); min 204 src/RDom.h NO_INLINE RDom(Expr min, Expr extent, Args&&... args) { min 208 src/RDom.h initialize_from_ranges(ranges, min, extent, std::forward<Args>(args)...); min 104 src/Reduction.cpp if (rvar.min.defined()) { min 105 src/Reduction.cpp rvar.min.accept(visitor); min 119 src/Reduction.cpp if (rvar.min.defined()) { min 120 src/Reduction.cpp rvar.min = mutator->mutate(rvar.min); min 18 src/Reduction.h Expr min, extent; min 34 src/RemoveTrivialForLoops.cpp stmt = LetStmt::make(for_loop->name, for_loop->min, body); min 39 src/RemoveTrivialForLoops.cpp stmt = LetStmt::make(for_loop->name, for_loop->min, body); min 44 src/RemoveTrivialForLoops.cpp stmt = For::make(for_loop->name, for_loop->min, for_loop->extent, for_loop->for_type, for_loop->device_api, body); min 248 src/RemoveUndef.cpp Expr min = mutate(op->min); min 260 src/RemoveUndef.cpp if (min.same_as(op->min) && min 265 src/RemoveUndef.cpp stmt = For::make(op->name, min, extent, op->for_type, op->device_api, body); min 407 src/RemoveUndef.cpp Expr old_min = op->bounds[i].min; min 145 src/Schedule.cpp if (r.min.defined()) { min 146 src/Schedule.cpp r.min = mutator->mutate(r.min); min 158 src/Schedule.cpp if (b.min.defined()) { min 159 src/Schedule.cpp b.min = mutator->mutate(b.min); min 336 src/Schedule.cpp if (r.min.defined()) { min 337 src/Schedule.cpp r.min.accept(visitor); min 349 src/Schedule.cpp if (b.min.defined()) { min 350 src/Schedule.cpp b.min.accept(visitor); min 217 src/Schedule.h Expr min, extent, modulus, remainder; min 211 src/ScheduleFunctions.cpp Expr min = Variable::make(Int(32), nest[i].name + ".loop_min"); min 213 src/ScheduleFunctions.cpp stmt = For::make(nest[i].name, min, extent, dim.for_type, dim.device_api, stmt); min 241 src/ScheduleFunctions.cpp Expr min = Variable::make(Int(32), var + ".min"); // Inject instance name here? (compute instance names during lowering) min 243 src/ScheduleFunctions.cpp (max + 1) - min, min 245 src/ScheduleFunctions.cpp stmt = LetStmt::make(var + ".loop_min", min, stmt); min 431 src/ScheduleFunctions.cpp Expr min = Variable::make(Int(32), var + ".min"); min 433 src/ScheduleFunctions.cpp mins.push_back(min); min 434 src/ScheduleFunctions.cpp extents.push_back(max - min + 1); min 553 src/ScheduleFunctions.cpp if (!b.min.defined()) { min 554 src/ScheduleFunctions.cpp b.min = min_var; min 561 src/ScheduleFunctions.cpp Expr max_val = (b.extent + b.min) - 1; min 562 src/ScheduleFunctions.cpp Expr min_val = b.min; min 659 src/ScheduleFunctions.cpp Expr min = Variable::make(Int(32), name + "." + arg + ".min_realized"); min 661 src/ScheduleFunctions.cpp bounds.push_back(Range(min, extent)); min 753 src/ScheduleFunctions.cpp for_loop->min, min 798 src/ScheduleFunctions.cpp f->min.accept(this); min 1128 src/ScheduleFunctions.cpp stmt = mutate(substitute(op->name, op->min, op->body)); min 30 src/SelectGPUAPI.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, selected_api, op->body); min 185 src/Simplify.cpp if (const_int(iter.value().min, &i_min) && min 249 src/Simplify.cpp string min = name + ".min." + std::to_string(i); min 250 src/Simplify.cpp if (var_info.contains(min)) { min 251 src/Simplify.cpp var_info.ref(min).old_uses++; min 324 src/Simplify.cpp if (const Min *min = max->a.as<Min>()) { min 330 src/Simplify.cpp (const_int_bounds(min->b, &min_a, &max_a) || min 331 src/Simplify.cpp const_int_bounds(min->a, &min_a, &max_a))) { min 342 src/Simplify.cpp } else if (const Min *min = e.as<Min>()) { min 346 src/Simplify.cpp if (const Max *max = min->a.as<Max>()) { min 351 src/Simplify.cpp if (const_int_bounds(min->b, &min_b, &max_b) && min 354 src/Simplify.cpp *min_val = std::min(min_a, min_b); min 358 src/Simplify.cpp } else if (const_int_bounds(min->a, &min_a, &max_a) && min 359 src/Simplify.cpp const_int_bounds(min->b, &min_b, &max_b)) { min 360 src/Simplify.cpp *min_val = std::min(min_a, min_b); min 361 src/Simplify.cpp *max_val = std::min(max_a, max_b); min 368 src/Simplify.cpp *min_val = std::min(min_a, min_b); min 399 src/Simplify.cpp *min_val = std::min(std::min(t0, t1), std::min(t2, t3)); min 423 src/Simplify.cpp *min_val = std::min(std::min(t0, t1), std::min(t2, t3)); min 434 src/Simplify.cpp *min_val = std::min(min_base, min_last_lane); min 1271 src/Simplify.cpp expr = mutate(min(add_a_a->b, min_a->b - b)); min 1277 src/Simplify.cpp expr = mutate(min(add_a_a->a, min_a->b - b)); min 1283 src/Simplify.cpp expr = mutate(min(add_a_b->b, min_a->a - b)); min 1289 src/Simplify.cpp expr = mutate(min(add_a_b->a, min_a->a - b)); min 2169 src/Simplify.cpp expr = IntImm::make(op->type, std::min(ia, ib)); min 2173 src/Simplify.cpp expr = UIntImm::make(op->type, std::min(ua, ub)); min 2177 src/Simplify.cpp expr = FloatImm::make(op->type, std::min(fa, fb)); min 2298 src/Simplify.cpp expr = mutate(min(max_a->a, max_a->b)); min 2304 src/Simplify.cpp expr = mutate(min(max_a->a, max_a->b)); min 2383 src/Simplify.cpp expr = mutate(min(max(min_a_a->a, max_a->b), b)); min 2388 src/Simplify.cpp expr = mutate(min(max(min_a_a->b, max_a->b), b)); min 2395 src/Simplify.cpp expr = mutate(min(add_a->a, add_b->a)) + add_a->b; min 2401 src/Simplify.cpp expr = mutate(min(add_a->b, add_b->b)) + add_a->a; min 2407 src/Simplify.cpp expr = mutate(min(add_a->b, add_b->a)) + add_a->a; min 2413 src/Simplify.cpp expr = mutate(min(add_a->a, add_b->b)) + add_a->b; min 2433 src/Simplify.cpp expr = mutate(min(div_a->a, div_b->a) / factor); min 2445 src/Simplify.cpp expr = mutate(min(mul_a->a, mul_b->a) * factor); min 2459 src/Simplify.cpp expr = mutate(min(mul_a->a, ratio) * factor); min 2479 src/Simplify.cpp expr = hoist_slice_vector<Min>(min(a, b)); min 2491 src/Simplify.cpp min(select_a->true_value, select_b->true_value), min 2492 src/Simplify.cpp min(select_a->false_value, select_b->false_value))); min 2746 src/Simplify.cpp expr = mutate(max(min(max_a_a->a, min_a->b), b)); min 2751 src/Simplify.cpp expr = mutate(max(min(max_a_a->b, min_a->b), b)); min 2797 src/Simplify.cpp expr = mutate(min(div_a->a, div_b->a) / factor); min 2809 src/Simplify.cpp expr = mutate(min(mul_a->a, mul_b->a) * factor); min 2823 src/Simplify.cpp expr = mutate(min(mul_a->a, ratio) * factor); min 2848 src/Simplify.cpp expr = mutate(sub_a->a - min(sub_a->b, sub_a->a - b)); min 3333 src/Simplify.cpp expr = mutate(le_a->a <= min(le_a->b, le_b->b)); min 3343 src/Simplify.cpp expr = mutate(lt_a->a < min(lt_a->b, lt_b->b)); min 4020 src/Simplify.cpp if (ib >= 0 && ib < std::min(t.bits(), 64) - 1) { min 4575 src/Simplify.cpp const Min *min = new_value.as<Min>(); min 4617 src/Simplify.cpp } else if (min && is_const(min->b)) { min 4618 src/Simplify.cpp replacement = substitute(new_name, Min::make(new_var, min->b), replacement); min 4619 src/Simplify.cpp new_value = min->a; min 4785 src/Simplify.cpp Expr new_min = mutate(op->min); min 4805 src/Simplify.cpp } else if (op->min.same_as(new_min) && min 5098 src/Simplify.cpp check(min(cast(Int(16), 30000), cast(Int(16), -123)), make_const(Int(16), -123)); min 5113 src/Simplify.cpp check(min(cast(UInt(32), (int) 4000000023UL) , cast(UInt(32), 1000)), make_const(UInt(32), (int) 1000)); min 5392 src/Simplify.cpp check(min(Expr(7), 3), 3); min 5393 src/Simplify.cpp check(min(Expr(4.25f), 1.25f), 1.25f); min 5394 src/Simplify.cpp check(min(broadcast(x, 4), broadcast(y, 4)), min 5395 src/Simplify.cpp broadcast(min(x, y), 4)); min 5396 src/Simplify.cpp check(min(x, x+3), x); min 5397 src/Simplify.cpp check(min(x+4, x), x); min 5398 src/Simplify.cpp check(min(x-1, x+2), x+(-1)); min 5399 src/Simplify.cpp check(min(7, min(x, 3)), min(x, 3)); min 5400 src/Simplify.cpp check(min(min(x, y), x), min(x, y)); min 5401 src/Simplify.cpp check(min(min(x, y), y), min(x, y)); min 5402 src/Simplify.cpp check(min(x, min(x, y)), min(x, y)); min 5403 src/Simplify.cpp check(min(y, min(x, y)), min(x, y)); min 5423 src/Simplify.cpp check(cast(Int(16), x) >= Int(16).min(), const_true()); min 5424 src/Simplify.cpp check(x < Int(32).min(), const_false()); min 5425 src/Simplify.cpp check(min(cast(UInt(16), x), cast(UInt(16), 65535)), cast(UInt(16), x)); min 5426 src/Simplify.cpp check(min(x, Int(32).max()), x); min 5427 src/Simplify.cpp check(min(Int(32).min(), x), Int(32).min()); min 5429 src/Simplify.cpp check(max(x, Int(32).min()), x); min 5445 src/Simplify.cpp check(x - min(x + y, z), max(-y, x-z)); min 5446 src/Simplify.cpp check(x - min(y + x, z), max(-y, x-z)); min 5447 src/Simplify.cpp check(x - min(z, x + y), max(-y, x-z)); min 5448 src/Simplify.cpp check(x - min(z, y + x), max(-y, x-z)); min 5450 src/Simplify.cpp check(min(x + y, z) - x, min(y, z-x)); min 5451 src/Simplify.cpp check(min(y + x, z) - x, min(y, z-x)); min 5452 src/Simplify.cpp check(min(z, x + y) - x, min(y, z-x)); min 5453 src/Simplify.cpp check(min(z, y + x) - x, min(y, z-x)); min 5455 src/Simplify.cpp check(min(x + y, z + y), min(x, z) + y); min 5456 src/Simplify.cpp check(min(y + x, z + y), min(x, z) + y); min 5457 src/Simplify.cpp check(min(x + y, y + z), min(x, z) + y); min 5458 src/Simplify.cpp check(min(y + x, y + z), min(x, z) + y); min 5460 src/Simplify.cpp check(min(x, y) - min(y, x), 0); min 5463 src/Simplify.cpp check(min(123 - x, 1 - x), 1 - x); min 5466 src/Simplify.cpp check(min(x*43, y*43), min(x, y)*43); min 5468 src/Simplify.cpp check(min(x*-43, y*-43), max(x, y)*-43); min 5469 src/Simplify.cpp check(max(x*-43, y*-43), min(x, y)*-43); min 5471 src/Simplify.cpp check(min(min(x, 4), y), min(min(x, y), 4)); min 5474 src/Simplify.cpp check(min(x*8, 24), min(x, 3)*8); min 5476 src/Simplify.cpp check(min(x*-8, 24), max(x, -3)*-8); min 5477 src/Simplify.cpp check(max(x*-8, 24), min(x, -3)*-8); min 5479 src/Simplify.cpp check(min(clamp(x, -10, 14), clamp(y, -10, 14)), clamp(min(x, y), -10, 14)); min 5481 src/Simplify.cpp check(min(x/4, y/4), min(x, y)/4); min 5484 src/Simplify.cpp check(min(x/(-4), y/(-4)), max(x, y)/(-4)); min 5485 src/Simplify.cpp check(max(x/(-4), y/(-4)), min(x, y)/(-4)); min 5488 src/Simplify.cpp check(min(clamp(x+1, y, z), clamp(x-1, y, z)), clamp(x+(-1), y, z)); min 5492 src/Simplify.cpp check(x + min(y - x, z), min(y, z + x)); min 5494 src/Simplify.cpp check(min(y + (-2), z) + 2, min(y, z + 2)); min 5497 src/Simplify.cpp check(x + min(y - x, z), min(y, z + x)); min 5499 src/Simplify.cpp check(min(y + (-2), z) + 2, min(y, z + 2)); min 5504 src/Simplify.cpp check(min(max(x, y), max(x, z)), max(min(y, z), x)); min 5505 src/Simplify.cpp check(min(min(x, y), min(x, z)), min(min(y, z), x)); min 5506 src/Simplify.cpp check(max(min(x, y), min(x, z)), min(max(y, z), x)); min 5509 src/Simplify.cpp check(min(((x+7)/8)*8, x), x); min 5510 src/Simplify.cpp check(min(x, ((x+7)/8)*8), x); min 5512 src/Simplify.cpp check(min(((x+7)/8)*8, max(x, 8)), max(x, 8)); min 5513 src/Simplify.cpp check(min(max(x, 8), ((x+7)/8)*8), max(x, 8)); min 5515 src/Simplify.cpp check(min(x, likely(x)), likely(x)); min 5516 src/Simplify.cpp check(min(likely(x), x), likely(x)); min 5522 src/Simplify.cpp check(min(x + 1, y) - min(x, y - 1), 1); min 5524 src/Simplify.cpp check(min(x + 1, y) - min(y - 1, x), 1); min 5529 src/Simplify.cpp check(min(ramp(0, 1, 8), 7), ramp(0, 1, 8)); min 5531 src/Simplify.cpp check(min(ramp(0, 1, 8), 0), broadcast(0, 8)); min 5532 src/Simplify.cpp check(min(ramp(0, 1, 8), 4), min(ramp(0, 1, 8), 4)); min 5535 src/Simplify.cpp check(min(ramp(7, -1, 8), 7), ramp(7, -1, 8)); min 5537 src/Simplify.cpp check(min(ramp(7, -1, 8), 0), broadcast(0, 8)); min 5538 src/Simplify.cpp check(min(ramp(7, -1, 8), 4), min(ramp(7, -1, 8), 4)); min 5541 src/Simplify.cpp check(min(7, ramp(0, 1, 8)), ramp(0, 1, 8)); min 5543 src/Simplify.cpp check(min(8 - x, 2), 8 - max(x, 6)); min 5544 src/Simplify.cpp check(max(3, 77 - x), 77 - min(x, 74)); min 5545 src/Simplify.cpp check(min(max(8-x, 0), 8), 8 - max(min(x, 8), 0)); min 5547 src/Simplify.cpp check(x - min(x, 2), max(x + -2, 0)); min 5548 src/Simplify.cpp check(x - max(x, 2), min(x + -2, 0)); min 5549 src/Simplify.cpp check(min(x, 2) - x, 2 - max(x, 2)); min 5550 src/Simplify.cpp check(max(x, 2) - x, 2 - min(x, 2)); min 5551 src/Simplify.cpp check(x - min(2, x), max(x + -2, 0)); min 5552 src/Simplify.cpp check(x - max(2, x), min(x + -2, 0)); min 5553 src/Simplify.cpp check(min(2, x) - x, 2 - max(x, 2)); min 5554 src/Simplify.cpp check(max(2, x) - x, 2 - min(x, 2)); min 5556 src/Simplify.cpp check(max(min(x, y), x), x); min 5557 src/Simplify.cpp check(max(min(x, y), y), y); min 5558 src/Simplify.cpp check(min(max(x, y), x), x); min 5559 src/Simplify.cpp check(min(max(x, y), y), y); min 5560 src/Simplify.cpp check(max(min(x, y), x) + y, x + y); min 5562 src/Simplify.cpp check(max(min(max(x, y), z), y), max(min(x, z), y)); min 5563 src/Simplify.cpp check(max(min(z, max(x, y)), y), max(min(x, z), y)); min 5564 src/Simplify.cpp check(max(y, min(max(x, y), z)), max(min(x, z), y)); min 5565 src/Simplify.cpp check(max(y, min(z, max(x, y))), max(min(x, z), y)); min 5567 src/Simplify.cpp check(max(min(max(y, x), z), y), max(min(x, z), y)); min 5568 src/Simplify.cpp check(max(min(z, max(y, x)), y), max(min(x, z), y)); min 5569 src/Simplify.cpp check(max(y, min(max(y, x), z)), max(min(x, z), y)); min 5570 src/Simplify.cpp check(max(y, min(z, max(y, x))), max(min(x, z), y)); min 5572 src/Simplify.cpp check(min(max(min(x, y), z), y), min(max(x, z), y)); min 5573 src/Simplify.cpp check(min(max(z, min(x, y)), y), min(max(x, z), y)); min 5574 src/Simplify.cpp check(min(y, max(min(x, y), z)), min(max(x, z), y)); min 5575 src/Simplify.cpp check(min(y, max(z, min(x, y))), min(max(x, z), y)); min 5577 src/Simplify.cpp check(min(max(min(y, x), z), y), min(max(x, z), y)); min 5578 src/Simplify.cpp check(min(max(z, min(y, x)), y), min(max(x, z), y)); min 5579 src/Simplify.cpp check(min(y, max(min(y, x), z)), min(max(x, z), y)); min 5580 src/Simplify.cpp check(min(y, max(z, min(y, x))), min(max(x, z), y)); min 5592 src/Simplify.cpp max(min(v1, four), -four), min 5593 src/Simplify.cpp max(-four, min(v1, four)), min 5594 src/Simplify.cpp min(max(v1, -four), four), min 5595 src/Simplify.cpp min(four, max(v1, -four)), min 5601 src/Simplify.cpp check(min(clamped[i], four), simplify(clamped[i])); min 5603 src/Simplify.cpp check(min(clamped[i], five), simplify(clamped[i])); min 5605 src/Simplify.cpp check(min(clamped[i], three), simplify(min(clamped[i], three))); min 5607 src/Simplify.cpp check(min(clamped[i], -five), simplify(-five)); min 5623 src/Simplify.cpp check(max(min(clamped[i], five), -five), simplify(clamped[i])); min 5625 src/Simplify.cpp check(max(min(clamped[i], five), five), simplify(five)); min 5628 src/Simplify.cpp check(max(min(clamped[i], -five), -five), simplify(-five)); min 5630 src/Simplify.cpp check(max(min(clamped[i], -five), five), simplify(five)); min 5632 src/Simplify.cpp check(max(min(clamped[2], -five), three), simplify(three)); min 5636 src/Simplify.cpp check(max(min(clamped[2], five), three), simplify(max(clamped[2], three))); min 5641 src/Simplify.cpp check(max(min(clamped[0], five), three), simplify(max(min(v1, four), three))); min 5645 src/Simplify.cpp check(min(clamped[i] + one, four), simplify(min(clamped[i] + one, four))); min 5647 src/Simplify.cpp check(min(clamped[i] + one, five), simplify(clamped[i] + one)); min 5649 src/Simplify.cpp check(min(clamped[i] + one, -four), simplify(-four)); min 5651 src/Simplify.cpp check(max(min(clamped[i] + one, four), -four), simplify(min(clamped[i] + one, four))); min 5661 src/Simplify.cpp check(min(max(clamped[i] + one, -four), four), simplify(min(clamped[i] + one, four))); min 5666 src/Simplify.cpp check(min(max(min(v2, t1), t2), five), simplify(max(min(t1, v2), t2))); min 5675 src/Simplify.cpp check(min(min(xv, broadcast(y, 64)), broadcast(z, 64)), min(xv, broadcast(min(y, z), 64))); min 5677 src/Simplify.cpp check(min(min(broadcast(x, 64), yv), broadcast(z, 64)), min(yv, broadcast(min(x, z), 64))); min 5679 src/Simplify.cpp check(min(broadcast(x, 64), min(yv, broadcast(z, 64))), min(yv, broadcast(min(z, x), 64))); min 5681 src/Simplify.cpp check(min(broadcast(x, 64), min(broadcast(y, 64), zv)), min(zv, broadcast(min(y, x), 64))); min 5837 src/Simplify.cpp check(x < min(x, y), f); min 5838 src/Simplify.cpp check(min(x, y) <= x, t); min 5841 src/Simplify.cpp check(min(x, y) >= y, y <= x); min 5982 src/Simplify.cpp check(min(select(x == 2, y*3, 8), select(x == 2, y+8, y*7)), min 5983 src/Simplify.cpp select(x == 2, min(y*3, y+8), min(y*7, 8))); min 6132 src/Simplify.cpp check_ind_expr(min(e, one), e_is_indeterminate); min 6299 src/Simplify.cpp check(Call::make(Int(32), Call::prefetch, {base, x, 4, 1, 64, 4, min(x + y, 128), 256}, Call::Intrinsic), min 6300 src/Simplify.cpp Call::make(Int(32), Call::prefetch, {base, x, min(x + y, 128) * 256, 1}, Call::Intrinsic)); min 6304 src/Simplify.cpp check(min(x, y)*max(x, y), x*y); min 6305 src/Simplify.cpp check(min(x, y)*max(y, x), x*y); min 6306 src/Simplify.cpp check(max(x, y)*min(x, y), x*y); min 6307 src/Simplify.cpp check(max(y, x)*min(x, y), x*y); min 6310 src/Simplify.cpp check(min(x, y) + max(x, y), x + y); min 6311 src/Simplify.cpp check(min(x, y) + max(y, x), x + y); min 6312 src/Simplify.cpp check(max(x, y) + min(x, y), x + y); min 6313 src/Simplify.cpp check(max(y, x) + min(x, y), x + y); min 6316 src/Simplify.cpp check(max(min(x, y), max(x, y)), max(x, y)); min 6317 src/Simplify.cpp check(max(min(x, y), max(y, x)), max(x, y)); min 6318 src/Simplify.cpp check(max(max(x, y), min(x, y)), max(x, y)); min 6319 src/Simplify.cpp check(max(max(y, x), min(x, y)), max(x, y)); min 6322 src/Simplify.cpp check(min(max(x, y), min(x, y)), min(x, y)); min 6323 src/Simplify.cpp check(min(max(x, y), min(y, x)), min(x, y)); min 6324 src/Simplify.cpp check(min(min(x, y), max(x, y)), min(x, y)); min 6325 src/Simplify.cpp check(min(min(y, x), max(x, y)), min(x, y)); min 6334 src/Simplify.cpp check_in_bounds(min(ramp(x, 1, 4), broadcast( 0, 4)), broadcast(0, 4), bounds_info); min 6335 src/Simplify.cpp check_in_bounds(min(ramp(x, 1, 4), broadcast( 8, 4)), ramp(x, 1, 4), bounds_info); min 6336 src/Simplify.cpp check_in_bounds(min(ramp(x, -1, 4), broadcast(-4, 4)), broadcast(-4, 4), bounds_info); min 6337 src/Simplify.cpp check_in_bounds(min(ramp(x, -1, 4), broadcast( 5, 4)), ramp(x, -1, 4), bounds_info); min 6440 src/Simplify.cpp r1 = min(one, two); min 6442 src/Simplify.cpp r2 = min(one, two, one); min 6445 src/Simplify.cpp r3 = min(one, Expr(two), one); min 67 src/SkipStages.cpp op->min.accept(this); min 80 src/SkipStages.cpp predicate = Let::make(op->name, op->min, predicate); min 267 src/SlidingWindow.cpp stmt = LetStmt::make(n, min(var, b[dim_idx].min), stmt); min 280 src/SlidingWindow.cpp Expr min = expand_expr(op->min, scope); min 284 src/SlidingWindow.cpp Stmt s = LetStmt::make(op->name, min, op->body); min 289 src/SlidingWindow.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, l->body); min 290 src/SlidingWindow.cpp } else if (is_monotonic(min, loop_var) != Monotonic::Constant || min 294 src/SlidingWindow.cpp << min << ", " << extent << "\n"; min 342 src/SlidingWindow.cpp new_body = SlidingWindowOnFunctionAndLoop(func, op->name, op->min).mutate(new_body); min 348 src/SlidingWindow.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, new_body); min 785 src/Solve.cpp can_prove(intersection.min <= intersection.max))) { min 805 src/Solve.cpp << " " << ia.min << " " << ia.max << "\n" min 806 src/Solve.cpp << " " << ib.min << " " << ib.max << "\n"; min 810 src/Solve.cpp << " " << ia.min << " " << ia.max << "\n" min 811 src/Solve.cpp << " " << ib.min << " " << ib.max << "\n"; min 823 src/Solve.cpp << " " << ia.min << " " << ia.max << "\n" min 824 src/Solve.cpp << " " << ib.min << " " << ib.max << "\n"; min 828 src/Solve.cpp << " " << ia.min << " " << ia.max << "\n" min 829 src/Solve.cpp << " " << ib.min << " " << ib.max << "\n"; min 853 src/Solve.cpp if (result.has_lower_bound() && expr_uses_var(result.min, op->name)) { min 854 src/Solve.cpp result.min = Let::make(op->name, op->value, result.min); min 945 src/Solve.cpp result.min = Let::make(b_name, b, result.min); min 946 src/Solve.cpp result.min = Let::make(c_name, c, result.min); min 959 src/Solve.cpp result.min = Let::make(b_name, b, result.min); min 960 src/Solve.cpp result.min = Let::make(c_name, c, result.min); min 999 src/Solve.cpp result.min = Let::make(b_name, b, result.min); min 1000 src/Solve.cpp result.min = Let::make(c_name, c, result.min); min 1013 src/Solve.cpp result.min = Let::make(b_name, b, result.min); min 1014 src/Solve.cpp result.min = Let::make(c_name, c, result.min); min 1102 src/Solve.cpp return get_bounds(a).min; min 1170 src/Solve.cpp if (can_prove(i.min == i.max)) { min 1172 src/Solve.cpp expr = (i.min == 0); min 1176 src/Solve.cpp expr = (i.min <= 0) && (i.max >= 0); min 1179 src/Solve.cpp expr = (i.min == 0) && (i.max == 0); min 1202 src/Solve.cpp expr = i.min; min 1245 src/Solve.cpp if (!value_bounds.max.same_as(op->value) || !value_bounds.min.same_as(op->value)) { min 1250 src/Solve.cpp (is_const(value_bounds.min) && value_bounds.min.as<Variable>())) { min 1251 src/Solve.cpp min_var = value_bounds.min; min 1252 src/Solve.cpp value_bounds.min = Interval::neg_inf; min 1254 src/Solve.cpp min_var = Variable::make(value_bounds.min.type(), min_name); min 1272 src/Solve.cpp expr = Let::make(min_name, value_bounds.min, expr); min 1329 src/Solve.cpp internal_assert(s.result.min.defined() && s.result.max.defined()) min 1331 src/Solve.cpp s.result.min = simplify(common_subexpression_elimination(s.result.min)); min 1334 src/Solve.cpp can_prove(s.result.min > s.result.max)) { min 1343 src/Solve.cpp internal_assert(s.result.min.defined() && s.result.max.defined()) min 1345 src/Solve.cpp s.result.min = simplify(common_subexpression_elimination(s.result.min)); min 1348 src/Solve.cpp can_prove(s.result.min > s.result.max)) { min 1376 src/Solve.cpp result.min = simplify(result.min); min 1378 src/Solve.cpp internal_assert(equal(result.min, i.min) && equal(result.max, i.max)) min 1380 src/Solve.cpp << " min: " << result.min << "\n" min 1383 src/Solve.cpp << " min: " << i.min << "\n" min 1388 src/Solve.cpp void check_outer_interval(Expr a, Expr min, Expr max) { min 1389 src/Solve.cpp check_interval(a, Interval(min, max), true); min 1392 src/Solve.cpp void check_inner_interval(Expr a, Expr min, Expr max) { min 1393 src/Solve.cpp check_interval(a, Interval(min, max), false); min 1414 src/Solve.cpp check_solve(min(5, x), min(x, 5)); min 1417 src/Solve.cpp check_solve(min(min(z, x), min(x, y)), min(x, min(y, z))); min 1418 src/Solve.cpp check_solve(min(x + y, x + 5), x + min(y, 5)); min 1506 src/Solve.cpp check_inner_interval(min(x, y) > 17, 18, y); min 1507 src/Solve.cpp check_outer_interval(min(x, y) > 17, 18, Interval::pos_inf); min 1553 src/Solve.cpp Expr test = (x <= min(max((y - min(((z*x) + t), t)), 1), 0)); min 1561 src/Solve.cpp t = min(t, Variable::make(Int(32), unique_name('v'))); min 1569 src/Solve.cpp check_solve(max(min(y, x), x), max(min(x, y), x)); min 1570 src/Solve.cpp check_solve(min(y, x) + max(y, 2*x), min(x, y) + max(x*2, y)); min 1571 src/Solve.cpp check_solve((min(x, y) + min(y, x))*max(y, x), (min(x, y)*2)*max(x, y)); min 1572 src/Solve.cpp check_solve(max((min((y*x), x) + min((1 + y), x)), (y + 2*x)), min 1573 src/Solve.cpp max((min((x*y), x) + min(x, (1 + y))), (x*2 + y))); min 368 src/StmtToHtml.cpp print_list({Variable::make(Int(32), op->name), op->min, op->extent}); min 467 src/StmtToHtml.cpp print_list("[", {op->bounds[i].min, op->bounds[i].extent}, "]"); min 492 src/StmtToHtml.cpp print_list("[", {op->bounds[i].min, op->bounds[i].extent}, "]"); min 185 src/StorageFlattening.cpp stmt = LetStmt::make(min_name[i-1], op->bounds[i-1].min, stmt); min 234 src/StorageFlattening.cpp prefetch_min[i] = mutate(op->bounds[i].min); min 125 src/StorageFolding.cpp Expr min = simplify(box[i-1].min); min 130 src/StorageFolding.cpp if (expr_uses_var(min, op->name) || expr_uses_var(max, op->name)) { min 139 src/StorageFolding.cpp << "Min: " << min << '\n' min 145 src/StorageFolding.cpp (is_monotonic(min, op->name) == Monotonic::Increasing); min 157 src/StorageFolding.cpp Expr min_next = substitute(op->name, loop_var + 1, min); min 158 src/StorageFolding.cpp condition = min_next >= min; min 181 src/StorageFolding.cpp Expr extent = simplify(max - min + 1); min 219 src/StorageFolding.cpp Expr next_min = substitute(op->name, next_var, min); min 226 src/StorageFolding.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 235 src/StorageFolding.cpp << "min = " << min << "\n" min 250 src/StorageFolding.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 69 src/Substitute.cpp Expr new_min = mutate(op->min); min 75 src/Substitute.cpp if (new_min.same_as(op->min) && min 178 src/Tracing.cpp builder.coordinates.push_back(op->bounds[i].min); min 216 src/Tracing.cpp Expr min = Variable::make(Int(32), f.name() + ".s0." + f_args[i] + ".min"); min 218 src/Tracing.cpp Expr extent = (max + 1) - min; min 219 src/Tracing.cpp builder.coordinates.push_back(min); min 273 src/Tracing.cpp Expr min = Variable::make(Int(32), output_buf.name() + ".min." + d); min 275 src/Tracing.cpp output_region.push_back(Range(min, extent)); min 121 src/TrimNoOps.cpp varying.push(op->name, Interval(op->min, op->min + op->extent - 1)); min 200 src/TrimNoOps.cpp can_prove(loop.i.min == loop.i.max) && min 206 src/TrimNoOps.cpp test = common_subexpression_elimination(Let::make(loop.var, loop.i.min, test)); min 208 src/TrimNoOps.cpp can_prove(loop.i.min >= loop.i.max) && min 215 src/TrimNoOps.cpp test = common_subexpression_elimination(Let::make(loop.var, loop.i.min, test) || min 320 src/TrimNoOps.cpp Expr min = mutate(op->min); min 322 src/TrimNoOps.cpp containing_loops.push_back({op->name, {min, min + extent - 1}}); min 325 src/TrimNoOps.cpp stmt = For::make(op->name, min, extent, op->for_type, op->device_api, body); min 363 src/TrimNoOps.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 372 src/TrimNoOps.cpp debug(3) << "Interval is: " << i.min << ", " << i.max << "\n"; min 376 src/TrimNoOps.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, body); min 404 src/TrimNoOps.cpp Expr old_max = op->min + op->extent; min 407 src/TrimNoOps.cpp new_min = clamp(i.min, op->min, old_max_var); min 409 src/TrimNoOps.cpp new_min = op->min; min 53 src/Type.cpp return Internal::Broadcast::make(element_of().min(), lanes()); min 423 src/Type.h EXPORT Expr min() const; min 76 src/UniquifyVariableNames.cpp Expr min = mutate(op->min); min 85 src/UniquifyVariableNames.cpp min.same_as(op->min) && min 89 src/UniquifyVariableNames.cpp stmt = For::make(new_name, min, extent, op->for_type, op->device_api, body); min 32 src/UnrollLoops.cpp iters.push_back(substitute(for_loop->name, for_loop->min + i, body)); min 139 src/VaryingAttributes.cpp stmt = For::make(op->name, op->min, op->extent, op->for_type, op->device_api, mutated_body); min 848 src/VaryingAttributes.cpp mutate_operator(this, op, op->min, op->extent, op->body, &stmt); min 895 src/VaryingAttributes.cpp Expr old_min = op->bounds[i].min; min 1175 src/VaryingAttributes.cpp Expr loop0_max = Add::make(loop0->min, loop0->extent); min 1176 src/VaryingAttributes.cpp Expr loop1_max = Add::make(loop1->min, loop1->extent); min 1180 src/VaryingAttributes.cpp coords[0].push_back(loop0->min); min 1183 src/VaryingAttributes.cpp coords[1].push_back(loop1->min); min 58 src/VectorizeLoops.cpp return {ia.min + b->value, ia.max + b->value}; min 61 src/VectorizeLoops.cpp return {b->value + ia.min, b->value + ia.max}; min 66 src/VectorizeLoops.cpp return {ia.min - b->value, ia.max - b->value}; min 75 src/VectorizeLoops.cpp return {ia.min * b->value, ia.max * b->value}; min 78 src/VectorizeLoops.cpp return {ia.max * b->value, ia.min * b->value}; min 83 src/VectorizeLoops.cpp return {b->value * ia.min, b->value * ia.max}; min 86 src/VectorizeLoops.cpp return {b->value * ia.max, b->value * ia.min}; min 93 src/VectorizeLoops.cpp return {ia.min / b->value, ia.max / b->value}; min 96 src/VectorizeLoops.cpp return {ia.max / b->value, ia.min / b->value}; min 102 src/VectorizeLoops.cpp return {ia.min && b->value, ia.max && b->value}; min 105 src/VectorizeLoops.cpp return {ia.min && b->value, ia.max && b->value}; min 110 src/VectorizeLoops.cpp return {ia.min && b->value, ia.max && b->value}; min 113 src/VectorizeLoops.cpp return {ia.min && b->value, ia.max && b->value}; min 115 src/VectorizeLoops.cpp } else if (const Min *min = e.as<Min>()) { min 116 src/VectorizeLoops.cpp if (const Broadcast *b = min->b.as<Broadcast>()) { min 117 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(min->a); min 118 src/VectorizeLoops.cpp return {Min::make(ia.min, b->value), Min::make(ia.max, b->value)}; min 119 src/VectorizeLoops.cpp } else if (const Broadcast *b = min->a.as<Broadcast>()) { min 120 src/VectorizeLoops.cpp Interval ia = bounds_of_lanes(min->b); min 121 src/VectorizeLoops.cpp return {Min::make(ia.min, b->value), Min::make(ia.max, b->value)}; min 126 src/VectorizeLoops.cpp return {Max::make(ia.min, b->value), Max::make(ia.max, b->value)}; min 129 src/VectorizeLoops.cpp return {Max::make(ia.min, b->value), Max::make(ia.max, b->value)}; min 133 src/VectorizeLoops.cpp return {!ia.max, !ia.min}; min 149 src/VectorizeLoops.cpp if (expr_uses_var(ib.min, let->name + ".min_lane")) { min 150 src/VectorizeLoops.cpp ib.min = Let::make(let->name + ".min_lane", ia.min, ib.min); min 153 src/VectorizeLoops.cpp ib.max = Let::make(let->name + ".min_lane", ia.min, ib.max); min 155 src/VectorizeLoops.cpp if (expr_uses_var(ib.min, let->name + ".max_lane")) { min 156 src/VectorizeLoops.cpp ib.min = Let::make(let->name + ".max_lane", ia.max, ib.min); min 599 src/VectorizeLoops.cpp LetStmt::make(mutated_name + ".min_lane", i.min, mutated_body); min 717 src/VectorizeLoops.cpp Expr all_true = bounds_of_lanes(c->args[0]).min; min 774 src/VectorizeLoops.cpp Expr min = mutate(op->min); min 779 src/VectorizeLoops.cpp if (min.type().is_vector()) { min 782 src/VectorizeLoops.cpp Stmt body = substitute(op->name, var + op->min, op->body); min 795 src/VectorizeLoops.cpp body = IfThenElse::make(likely(var < op->min + op->extent), body); min 800 src/VectorizeLoops.cpp if (min.same_as(op->min) && min 806 src/VectorizeLoops.cpp stmt = For::make(op->name, min, extent, for_type, op->device_api, body); min 940 src/VectorizeLoops.cpp Expr replacement = Ramp::make(for_loop->min, 1, extent->value); min 248 src/runtime/HalideBuffer.h buf.dim[next].min = 0; min 265 src/runtime/HalideBuffer.h buf.dim[i].min = 0; min 278 src/runtime/HalideBuffer.h buf.dim[next].min = 0; min 342 src/runtime/HalideBuffer.h HALIDE_ALWAYS_INLINE int min() const { min 343 src/runtime/HalideBuffer.h return d.min; min 359 src/runtime/HalideBuffer.h return min() + extent() - 1; min 373 src/runtime/HalideBuffer.h return {min()}; min 378 src/runtime/HalideBuffer.h return {min() + extent()}; min 391 src/runtime/HalideBuffer.h int min(int i) const { return dim(i).min(); } min 467 src/runtime/HalideBuffer.h buf.dim[i].min = old_buf.min[i]; min 484 src/runtime/HalideBuffer.h old_buf.min[i] = dim(i).min(); min 935 src/runtime/HalideBuffer.h return dim(0).min(); min 943 src/runtime/HalideBuffer.h return dim(1).min(); min 980 src/runtime/HalideBuffer.h int min_coord = std::max(dst.dim(i).min(), src.dim(i).min()); min 981 src/runtime/HalideBuffer.h int max_coord = std::min(dst.dim(i).max(), src.dim(i).max()); min 1023 src/runtime/HalideBuffer.h Buffer<T, D> cropped(int d, int min, int extent) const { min 1027 src/runtime/HalideBuffer.h im.crop(d, min, extent); min 1032 src/runtime/HalideBuffer.h void crop(int d, int min, int extent) { min 1035 src/runtime/HalideBuffer.h int shift = min - dim(d).min(); min 1040 src/runtime/HalideBuffer.h buf.dim[d].min = min; min 1075 src/runtime/HalideBuffer.h buf.dim[d].min += delta; min 1101 src/runtime/HalideBuffer.h buf.dim[i].min = x[i]; min 1111 src/runtime/HalideBuffer.h if (x[i] < dim(i).min() || x[i] > dim(i).max()) { min 1144 src/runtime/HalideBuffer.h int shift = pos - dim(d).min(); min 1390 src/runtime/HalideBuffer.h return offset_of(d+1, rest...) + this->buf.dim[d].stride * (first - this->buf.dim[d].min); min 1412 src/runtime/HalideBuffer.h offset += this->buf.dim[i].stride * (pos[i] - this->buf.dim[i].min); min 1540 src/runtime/HalideBuffer.h assert(first->dim(d).min() == dim(d).min() && min 1654 src/runtime/HalideBuffer.h int min, max; min 1674 src/runtime/HalideBuffer.h for (int i = t[d].min; i <= t[d].max; i++) { min 1712 src/runtime/HalideBuffer.h for (pos[d] = t[d].min; pos[d] <= t[d].max; pos[d]++) { min 1747 src/runtime/HalideBuffer.h for (pos[d] = t[d].min; pos[d] <= t[d].max; pos[d]++) { min 1835 src/runtime/HalideBuffer.h t[i].min = dim(i).min(); min 125 src/runtime/HalideRuntime.h int min, int size, uint8_t *closure); min 962 src/runtime/HalideRuntime.h int32_t min, extent, stride; min 968 src/runtime/HalideRuntime.h HALIDE_ALWAYS_INLINE halide_dimension_t() : min(0), extent(0), stride(0), flags(0) {} min 970 src/runtime/HalideRuntime.h min(m), extent(e), stride(s), flags(f) {} min 973 src/runtime/HalideRuntime.h return (min == other.min) && min 1100 src/runtime/HalideRuntime.h index += dim[i].stride * (pos[i] - dim[i].min); min 1133 src/runtime/HalideRuntime.h int32_t min[4]; min 1215 src/runtime/HalideRuntime.h const struct halide_scalar_value_t *min; min 34 src/runtime/buffer_t.cpp return buf->dim[d].min; min 39 src/runtime/buffer_t.cpp return buf->dim[d].min + buf->dim[d].extent - 1; min 146 src/runtime/buffer_t.cpp const int *min, const int *extent) { min 152 src/runtime/buffer_t.cpp dst->dim[i].min = min[i]; min 154 src/runtime/buffer_t.cpp offset += (min[i] - src->dim[i].min) * src->dim[i].stride; min 21 src/runtime/cache.cpp debug(user_context) << "(" << buf.dim[i].min min 16 src/runtime/fake_thread_pool.cpp int min, int size, uint8_t *closure) { min 17 src/runtime/fake_thread_pool.cpp for (int x = min; x < min + size; x++) { min 76 src/runtime/fake_thread_pool.cpp int min, int size, uint8_t *closure) { min 77 src/runtime/fake_thread_pool.cpp return (*custom_do_par_for)(user_context, f, min, size, closure); min 89 src/runtime/gcd_thread_pool.cpp int min; min 97 src/runtime/gcd_thread_pool.cpp j->exit_status = halide_do_task(j->user_context, j->f, j->min + (int)idx, min 102 src/runtime/gcd_thread_pool.cpp int min, int size, uint8_t *closure) { min 106 src/runtime/gcd_thread_pool.cpp for (int x = min; x < min + size; x++) { min 119 src/runtime/gcd_thread_pool.cpp job.min = min; min 182 src/runtime/gcd_thread_pool.cpp int min, int size, uint8_t *closure) { min 183 src/runtime/gcd_thread_pool.cpp return (*custom_do_par_for)(user_context, f, min, size, closure); min 132 src/runtime/hexagon_remote/sim_remote.cpp int min, int size, uint8_t *closure) { min 133 src/runtime/hexagon_remote/sim_remote.cpp for (int x = min; x < min + size; x++) { min 107 src/runtime/hexagon_remote/thread_pool.cpp int min, int size, uint8_t *closure) { min 146 src/runtime/hexagon_remote/thread_pool.cpp int ret = Halide::Runtime::Internal::default_do_par_for(user_context, task, min, size, (uint8_t *)&c); min 93 src/runtime/noos.cpp int min, int size, uint8_t *closure) { min 94 src/runtime/noos.cpp return (*custom_do_par_for)(user_context, f, min, size, closure); min 56 src/runtime/old_buffer_t.cpp new_buf->dim[i].min = old_buf->min[i]; min 75 src/runtime/old_buffer_t.cpp old_buf->min[i] = new_buf->dim[i].min; min 171 src/runtime/opengl.cpp GLint min[4]; min 922 src/runtime/opengl.cpp texinfo->min[i] = (buf->dimensions > i) ? buf->dim[i].min : 0; min 1694 src/runtime/opengl.cpp output_min[0] = texinfo->min[0]; min 1695 src/runtime/opengl.cpp output_min[1] = texinfo->min[1]; min 137 src/runtime/openglcompute.cpp << " min: " << buf->dim[0].min << " " << buf->dim[1].min min 138 src/runtime/openglcompute.cpp << " " << buf->dim[2].min << " " << buf->dim[3].min << "\n" min 209 src/runtime/runtime_internal.h __attribute__((always_inline)) T min(const T &a, const T &b) { min 216 src/runtime/runtime_internal.h memcpy(&ret, &x, min(sizeof(T), sizeof(U))); min 36 src/runtime/thread_pool.cpp int min, int size, uint8_t *closure) { min 37 src/runtime/thread_pool.cpp return (*custom_do_par_for)(user_context, f, min, size, closure); min 165 src/runtime/thread_pool_common.h int min, int size, uint8_t *closure) { min 203 src/runtime/thread_pool_common.h job.next = min; // Start at this index. min 204 src/runtime/thread_pool_common.h job.max = min + size; // Keep going until one less than this index. min 290 src/runtime/to_string.cpp dst = halide_int64_to_string(dst, end, buf->dim[i].min, 1); min 122 src/runtime/write_debug_image.cpp shape[i].min = 0; min 224 src/runtime/write_debug_image.cpp for (int32_t dim3 = shape[3].min; dim3 < shape[3].extent + shape[3].min; ++dim3) { min 225 src/runtime/write_debug_image.cpp for (int32_t dim2 = shape[2].min; dim2 < shape[2].extent + shape[2].min; ++dim2) { min 226 src/runtime/write_debug_image.cpp for (int32_t dim1 = shape[1].min; dim1 < shape[1].extent + shape[1].min; ++dim1) { min 227 src/runtime/write_debug_image.cpp for (int32_t dim0 = shape[0].min; dim0 < shape[0].extent + shape[0].min; ++dim0) { min 124 test/correctness/bitwise_ops.cpp Expr b8 = min(31, cast<uint8_t>(input(x+1))); min 130 test/correctness/bitwise_ops.cpp shift_amount = std::min(31, shift_amount); min 75 test/correctness/boundary_conditions.cpp int32_t clamped_y = std::min(input.height() - 1, std::max(0, y)); min 76 test/correctness/boundary_conditions.cpp int32_t clamped_x = std::min(input.width() - 1, std::max(0, x)); min 15 test/correctness/bounds.cpp g(x, y) = min(x, y); min 6 test/correctness/bounds_of_abs.cpp void check(Func f, ImageParam in, int min, int extent) { min 14 test/correctness/bounds_of_abs.cpp if (im.extent(0) != extent || im.min(0) != min) { min 16 test/correctness/bounds_of_abs.cpp im.min(0), im.extent(0), min, extent); min 6 test/correctness/bounds_of_cast.cpp void check(Func f, ImageParam in, int min, int extent) { min 14 test/correctness/bounds_of_cast.cpp if (im.extent(0) != extent || im.min(0) != min) { min 16 test/correctness/bounds_of_cast.cpp im.min(0), im.extent(0), min, extent); min 26 test/correctness/bounds_of_func.cpp assert(in_buf.min(0) == 10 && in_buf.extent(0) == 11); min 47 test/correctness/bounds_of_func.cpp assert(in_buf.min(0) == 10 && in_buf.extent(0) == 11); min 55 test/correctness/bounds_of_func.cpp f(x) = min(x, 100); min 67 test/correctness/bounds_of_func.cpp assert(in_buf.min(0) == 0 && in_buf.extent(0) == 91); min 95 test/correctness/bounds_of_func.cpp assert(in_buf.min(0) == -1049600 && in_buf.extent(0) == 2097153); min 62 test/correctness/constant_expr.cpp const T min = std::numeric_limits<T>::min(); min 69 test/correctness/constant_expr.cpp test_expr<T>(min); min 14 test/correctness/extern_bounds_inference.cpp in->dim[0].min = out->dim[0].min + dx; min 15 test/correctness/extern_bounds_inference.cpp in->dim[1].min = out->dim[1].min + dy; min 35 test/correctness/extern_bounds_inference.cpp if (buf.min(0) != x || buf.extent(0) != w || min 36 test/correctness/extern_bounds_inference.cpp buf.min(1) != y || buf.extent(1) != h) { min 40 test/correctness/extern_bounds_inference.cpp buf.min(0), buf.extent(0), buf.min(1), buf.extent(1), min 21 test/correctness/extern_consumer.cpp input->dim[0].min = desired_min; min 28 test/correctness/extern_consumer.cpp int *base = ((int *)input->host) - input->dim[0].min; min 75 test/correctness/extern_consumer.cpp Param<int> min, extent; min 82 test/correctness/extern_consumer.cpp args.push_back(min); min 95 test/correctness/extern_consumer.cpp min.set(0); min 111 test/correctness/extern_consumer.cpp args2.push_back(min); min 23 test/correctness/extern_output_expansion.cpp in->dim[0].min = out->dim[0].min; min 29 test/correctness/extern_output_expansion.cpp in->dim[0].min, in->dim[0].extent, min 30 test/correctness/extern_output_expansion.cpp out->dim[0].min, out->dim[0].extent); min 31 test/correctness/extern_output_expansion.cpp int32_t *in_origin = (int32_t *)in->host - in->dim[0].min; min 32 test/correctness/extern_output_expansion.cpp int32_t *out_origin = (int32_t *)out->host - out->dim[0].min; min 33 test/correctness/extern_output_expansion.cpp for (int i = out->dim[0].min; i < out->dim[0].min + out->dim[0].extent; i++) { min 32 test/correctness/extern_producer.cpp int max_plus_one = out->dim[0].min + out->dim[0].extent; min 34 test/correctness/extern_producer.cpp out->dim[0].min = round_down(out->dim[0].min, 10); min 35 test/correctness/extern_producer.cpp out->dim[0].extent = max_plus_one - out->dim[0].min; min 48 test/correctness/extern_producer.cpp out->dim[0].min, out->dim[0].min + out->dim[0].extent, min 49 test/correctness/extern_producer.cpp out->dim[1].min, out->dim[1].min + out->dim[1].extent); min 53 test/correctness/extern_producer.cpp int x_coord = x + out->dim[0].min; min 54 test/correctness/extern_producer.cpp int y_coord = y + out->dim[1].min; min 70 test/correctness/extern_producer.cpp assert(out1->dim[0].min == out2->dim[0].min && min 71 test/correctness/extern_producer.cpp out1->dim[1].min == out2->dim[1].min && min 75 test/correctness/extern_producer.cpp out1->dim[0].min, out1->dim[0].min + out1->dim[0].extent, min 76 test/correctness/extern_producer.cpp out1->dim[1].min, out1->dim[1].min + out1->dim[1].extent); min 81 test/correctness/extern_producer.cpp int x_coord = x + out1->dim[0].min; min 82 test/correctness/extern_producer.cpp int y_coord = y + out1->dim[1].min; min 16 test/correctness/extern_sort.cpp in->dim[0].min = out->dim[0].min; min 11 test/correctness/extern_stage.cpp int min = out->dim[0].min; min 12 test/correctness/extern_stage.cpp int max = out->dim[0].min + out->dim[0].extent - 1; min 16 test/correctness/extern_stage.cpp int flipped_max = -min; min 22 test/correctness/extern_stage.cpp printf("Doing flip_x bounds inference over [%d %d]\n", min, max); min 24 test/correctness/extern_stage.cpp in1->dim[0].min = flipped_min; min 28 test/correctness/extern_stage.cpp in2->dim[0].min = flipped_min; min 40 test/correctness/extern_stage.cpp printf("Computing flip_x over [%d %d]\n", min, max); min 44 test/correctness/extern_stage.cpp assert(in1->dim[0].min <= flipped_min && min 45 test/correctness/extern_stage.cpp in1->dim[0].min + in1->dim[0].extent > flipped_max); min 46 test/correctness/extern_stage.cpp assert(in2->dim[0].min <= flipped_min && min 47 test/correctness/extern_stage.cpp in2->dim[0].min + in2->dim[0].extent > flipped_max); min 54 test/correctness/extern_stage.cpp uint8_t *dst = (uint8_t *)(out->host) - out->dim[0].min; min 55 test/correctness/extern_stage.cpp uint8_t *src1 = (uint8_t *)(in1->host) - in1->dim[0].min; min 56 test/correctness/extern_stage.cpp int *src2 = (int *)(in2->host) - in2->dim[0].min; min 59 test/correctness/extern_stage.cpp for (int i = min; i <= max; i++) { min 23 test/correctness/float16_t_image_type.cpp h_assert(simple.min(0) == 0, "unexpected non zero min in x"); min 24 test/correctness/float16_t_image_type.cpp h_assert(simple.min(1) == 0, "unexpected non zero min in y"); min 31 test/correctness/float16_t_image_type.cpp for (int x=simple.min(0); x < simple.extent(0); ++x) { min 32 test/correctness/float16_t_image_type.cpp for (int y = simple.min(1); y < simple.extent(1); ++y) { min 37 test/correctness/float16_t_image_type.cpp for (int x = simple.min(0); x < simple.extent(0); ++x) { min 38 test/correctness/float16_t_image_type.cpp for (int y = simple.min(1); y < simple.extent(1); ++y) { min 29 test/correctness/float16_t_implicit_upcast.cpp h_assert(simple.min(0) == 0, "unexpected non zero min in x"); min 30 test/correctness/float16_t_implicit_upcast.cpp h_assert(simple.min(1) == 0, "unexpected non zero min in y"); min 35 test/correctness/float16_t_implicit_upcast.cpp for (int x = simple.min(0); x < simple.extent(0); ++x) { min 36 test/correctness/float16_t_implicit_upcast.cpp for (int y = simple.min(1); y < simple.extent(1); ++y) { min 40 test/correctness/for_each_element.cpp for (int c = im.dim(2).min(); c < im.dim(2).min() + im.dim(2).extent(); c++) { min 41 test/correctness/for_each_element.cpp for (int y = im.dim(1).min(); y < im.dim(1).min() + im.dim(1).extent(); y++) { min 42 test/correctness/for_each_element.cpp for (int x = im.dim(0).min(); x < im.dim(0).min() + im.dim(0).extent(); x++) { min 10 test/correctness/halide_buffer.cpp if (a.dim(i).min() != b.dim(i).min() || min 33 test/correctness/infer_arguments.cpp min(thresh, input2(x, y))) + (0 * z_unsigned); min 74 test/correctness/infer_arguments.cpp EXPECT(false, input1_arg.min.defined()); min 75 test/correctness/infer_arguments.cpp EXPECT(false, input2_arg.min.defined()); min 76 test/correctness/infer_arguments.cpp EXPECT(true, frac_arg.min.defined()); min 77 test/correctness/infer_arguments.cpp EXPECT(true, constant_expr_equals<float>(frac_arg.min, 11.25f)); min 78 test/correctness/infer_arguments.cpp EXPECT(false, height_arg.min.defined()); min 79 test/correctness/infer_arguments.cpp EXPECT(false, thresh_arg.min.defined()); min 80 test/correctness/infer_arguments.cpp EXPECT(false, width_arg.min.defined()); min 81 test/correctness/infer_arguments.cpp EXPECT(true, z_unsigned_arg.min.defined()); min 82 test/correctness/infer_arguments.cpp EXPECT(true, constant_expr_equals<uint64_t>(z_unsigned_arg.min, 0x1)); min 79 test/correctness/inline_reduction.cpp correct_min = std::min(correct_min, val); min 113 test/correctness/inline_reduction.cpp RDom all_z(input_3d.min(2), input_3d.extent(2)); min 167 test/correctness/lerp.cpp std::numeric_limits<int32_t>::min(), 257, 255 * 65535, 1, min 191 test/correctness/lerp.cpp check_range<int32_t, uint32_t>(std::numeric_limits<int32_t>::min(), std::numeric_limits<int32_t>::max(), 0, 1, min 218 test/correctness/lerp.cpp std::numeric_limits<int32_t>::min(), 257, 255 * 65535, 1, min 23 test/correctness/loop_invariant_extern_calls.cpp int not_really_parallel_for(void *ctx, int (*f)(void *, int, uint8_t *), int min, int extent, uint8_t *closure) { min 24 test/correctness/loop_invariant_extern_calls.cpp for (int i = min; i < min + extent; i++) { min 28 test/correctness/lots_of_dimensions.cpp for (int i0 = in.dim(0).min(); i0 <= in.dim(0).max(); i0++) { min 29 test/correctness/lots_of_dimensions.cpp for (int i1 = in.dim(1).min(); i1 <= in.dim(1).max(); i1++) { min 30 test/correctness/lots_of_dimensions.cpp for (int i2 = in.dim(2).min(); i2 <= in.dim(2).max(); i2++) { min 31 test/correctness/lots_of_dimensions.cpp for (int i3 = in.dim(3).min(); i3 <= in.dim(3).max(); i3++) { min 32 test/correctness/lots_of_dimensions.cpp for (int i4 = in.dim(4).min(); i4 <= in.dim(4).max(); i4++) { min 33 test/correctness/lots_of_dimensions.cpp for (int i5 = in.dim(5).min(); i5 <= in.dim(5).max(); i5++) { min 34 test/correctness/lots_of_dimensions.cpp for (int i6 = in.dim(6).min(); i6 <= in.dim(6).max(); i6++) { min 35 test/correctness/lots_of_dimensions.cpp for (int i7 = in.dim(7).min(); i7 <= in.dim(7).max(); i7++) { min 78 test/correctness/lots_of_dimensions.cpp for (int i0 = in.dim(0).min(); i0 <= in.dim(0).max(); i0++) { min 79 test/correctness/lots_of_dimensions.cpp for (int i1 = in.dim(1).min(); i1 <= in.dim(1).max(); i1++) { min 80 test/correctness/lots_of_dimensions.cpp for (int i2 = in.dim(2).min(); i2 <= in.dim(2).max(); i2++) { min 81 test/correctness/lots_of_dimensions.cpp for (int i3 = in.dim(3).min(); i3 <= in.dim(3).max(); i3++) { min 82 test/correctness/lots_of_dimensions.cpp for (int i4 = in.dim(4).min(); i4 <= in.dim(4).max(); i4++) { min 83 test/correctness/lots_of_dimensions.cpp for (int i5 = in.dim(5).min(); i5 <= in.dim(5).max(); i5++) { min 84 test/correctness/lots_of_dimensions.cpp for (int i6 = in.dim(6).min(); i6 <= in.dim(6).max(); i6++) { min 85 test/correctness/lots_of_dimensions.cpp for (int i7 = in.dim(7).min(); i7 <= in.dim(7).max(); i7++) { min 12 test/correctness/many_small_extern_stages.cpp printf(" %d %d %d\n", b->dim[i].min, b->dim[i].extent, b->dim[i].stride); min 241 test/correctness/math.cpp const int8_t int8_min = std::numeric_limits<int8_t>::min(); min 242 test/correctness/math.cpp const int16_t int16_min = std::numeric_limits<int16_t>::min(); min 243 test/correctness/math.cpp const int32_t int32_min = std::numeric_limits<int32_t>::min(); min 248 test/correctness/math.cpp const uint8_t uint8_min = std::numeric_limits<uint8_t>::min(); min 249 test/correctness/math.cpp const uint16_t uint16_min = std::numeric_limits<uint16_t>::min(); min 250 test/correctness/math.cpp const uint32_t uint32_min = std::numeric_limits<uint32_t>::min(); min 12 test/correctness/median3x3.cpp return max(min(max(a, b), c), min(a, b)); min 34 test/correctness/median3x3.cpp min_x(x, y) = min(input(x - 1, y), input(x, y), input(x + 1, y)); min 38 test/correctness/median3x3.cpp min_max(x, y) = min(max_x(x, y - 1), max_x(x, y), max_x(x, y + 1)); min 41 test/correctness/memoize.cpp call_count_with_arg_parallel[out->dim[2].min]++; min 159 test/correctness/mul_div_mod.cpp BIG min; min 161 test/correctness/mul_div_mod.cpp min = umax; min 162 test/correctness/mul_div_mod.cpp min = -min - 1; min 163 test/correctness/mul_div_mod.cpp return min; min 185 test/correctness/mul_div_mod.cpp int64_t max, min, neg, v, vsalt; min 187 test/correctness/mul_div_mod.cpp min = minimum<T, int64_t>(); min 202 test/correctness/mul_div_mod.cpp v = min; min 208 test/correctness/mul_div_mod.cpp result(0,0) = (T)min; min 210 test/correctness/mul_div_mod.cpp result(0,1) = (T)((unique & 1) ? min : max); min 211 test/correctness/mul_div_mod.cpp result(1,1) = (T)((unique & 1) ? max : min); min 481 test/correctness/mul_div_mod.cpp for (i = 0; i < std::min(SWIDTH,WIDTH); i++) { min 482 test/correctness/mul_div_mod.cpp for (j = 0; j < std::min(SHEIGHT, HEIGHT); j++) { min 19 test/correctness/multipass_constraints.cpp in.dim(0).set_bounds(in.dim(1).min() - 5, in.dim(1).extent() + o.dim(0).extent()); min 29 test/correctness/multipass_constraints.cpp if (in.get().dim(0).min() != -4 || min 31 test/correctness/multipass_constraints.cpp in.get().dim(1).min() != 1 || min 33 test/correctness/multipass_constraints.cpp out_buf.dim(0).min() != 0 || min 35 test/correctness/multipass_constraints.cpp out_buf.dim(1).min() != 2 || min 41 test/correctness/multipass_constraints.cpp in.get().dim(0).min(), in.get().dim(0).extent(), min 42 test/correctness/multipass_constraints.cpp in.get().dim(1).min(), in.get().dim(1).extent(), min 43 test/correctness/multipass_constraints.cpp out_buf.dim(0).min(), out_buf.dim(0).extent(), min 44 test/correctness/multipass_constraints.cpp out_buf.dim(1).min(), out_buf.dim(1).extent()); min 144 test/correctness/print.cpp x == 7, std::numeric_limits<float>::min(), min 145 test/correctness/print.cpp x == 8, -std::numeric_limits<float>::min(), min 26 test/correctness/reduction_schedule.cpp Expr xm = max(r.x - 1, 0), xp = min(r.x + 1, noise.width() - 1); min 29 test/correctness/reduction_schedule.cpp energy(r.x, r.y) = noise(r.x, r.y) + min(energy(xm, r.y - 1), min 38 test/correctness/reduction_schedule.cpp int xp = std::min(x + 1, size - 1); min 42 test/correctness/reduction_schedule.cpp incr = std::min(ref_energy(xm, y-1), std::min(ref_energy(x, y-1), ref_energy(xp, y-1))); min 294 test/correctness/rfactor.cpp g(r.x, r.y) = min(f(r.x, r.y) + 2, g(r.x, r.y)); min 323 test/correctness/rfactor.cpp return (10 <= x && x <= 29) && (30 <= y && y <= 69) ? std::min(x + y + 2, 40) : 40; min 333 test/correctness/rfactor.cpp return (10 <= x && x <= 29) && (30 <= y && y <= 69) ? std::min(x + y + 2, 40) : 40; min 527 test/correctness/rfactor.cpp ref(x, y) = Tuple(ref(x , y)[0] + f(r.x, r.y)[0] + 3, min(ref(x , y)[1], f(r.x, r.y)[1])); min 531 test/correctness/rfactor.cpp g(x , y) = Tuple(g(x , y)[0] + f(r.x, r.y)[0] + 3, min(g(x , y)[1], f(r.x, r.y)[1])); min 815 test/correctness/rfactor.cpp ref() = Tuple(min(ref()[0], f(r.x, r.y)), min 820 test/correctness/rfactor.cpp g() = Tuple(min(g()[0], f(r.x, r.y)), min 52 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min((double)in(i), (double)target_max); min 55 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(std::max(in(i), min 65 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(val, (source_t)target_max); min 71 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(in(i), (source_t)target_max); min 73 test/correctness/saturating_casts.cpp correct_result = std::min((target_t)in(i), target_max); min 83 test/correctness/saturating_casts.cpp simpler_correct_result = std::min(std::max((int64_t)in(i), min 112 test/correctness/saturating_casts.cpp source_t source_min = std::numeric_limits<source_t>::min(); min 115 test/correctness/saturating_casts.cpp target_t target_min = std::numeric_limits<target_t>::min(); min 152 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(std::max(in(i), min 162 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(val, (source_t)target_max); min 168 test/correctness/saturating_casts.cpp correct_result = (target_t)std::min(in(i), (source_t)target_max); min 170 test/correctness/saturating_casts.cpp correct_result = std::min((target_t)in(i), target_max); min 188 test/correctness/saturating_casts.cpp simpler_correct_result = std::min(std::max((int64_t)in(i), min 313 test/correctness/simd_op_check.cpp check("paddusb", 8*w, u8(min(u16(u8_1) + u16(u8_2), max_u8))); min 318 test/correctness/simd_op_check.cpp check("paddusw", 4*w, u16(min(u32(u16_1) + u32(u16_2), max_u16))); min 361 test/correctness/simd_op_check.cpp check("minps", 2*w, min(f32_1, f32_2)); min 367 test/correctness/simd_op_check.cpp check("pminsw", 4*w, min(i16_1, i16_2)); min 369 test/correctness/simd_op_check.cpp check("pminub", 8*w, min(u8_1, u8_2)); min 411 test/correctness/simd_op_check.cpp check("minpd", w, min(f64_1, f64_2)); min 482 test/correctness/simd_op_check.cpp check("pminsb", 8*w, min(i8_1, i8_2)); min 484 test/correctness/simd_op_check.cpp check("pminuw", 4*w, min(u16_1, u16_2)); min 486 test/correctness/simd_op_check.cpp check("pminud", 2*w, min(u32_1, u32_2)); min 488 test/correctness/simd_op_check.cpp check("pminsd", 2*w, min(i32_1, i32_2)); min 531 test/correctness/simd_op_check.cpp check("vminps" YMM, 8, min(f32_1, f32_2)); min 532 test/correctness/simd_op_check.cpp check("vminpd" YMM, 4, min(f64_1, f64_2)); min 569 test/correctness/simd_op_check.cpp check("vpaddusb", 32, u8(min(u16(u8_1) + u16(u8_2), max_u8))); min 575 test/correctness/simd_op_check.cpp check("vpaddusw", 16, u16(min(u32(u16_1) + u32(u16_2), max_u16))); min 593 test/correctness/simd_op_check.cpp check("vpminsw" YMM, 16, min(i16_1, i16_2)); min 595 test/correctness/simd_op_check.cpp check("vpminub" YMM, 32, min(u8_1, u8_2)); min 622 test/correctness/simd_op_check.cpp check("vpminsb" YMM, 32, min(i8_1, i8_2)); min 624 test/correctness/simd_op_check.cpp check("vpminuw" YMM, 16, min(u16_1, u16_2)); min 626 test/correctness/simd_op_check.cpp check("vpminud" YMM, 16, min(u32_1, u32_2)); min 628 test/correctness/simd_op_check.cpp check("vpminsd" YMM, 8, min(i32_1, i32_2)); min 654 test/correctness/simd_op_check.cpp check("vpminuq", 8, min(u64_1, u64_2)); min 656 test/correctness/simd_op_check.cpp check("vpminsq", 8, min(i64_1, i64_2)); min 944 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.s8" : "smin", 8*w, min(i8_1, i8_2)); min 945 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.u8" : "umin", 8*w, min(u8_1, u8_2)); min 946 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.s16" : "smin", 4*w, min(i16_1, i16_2)); min 947 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.u16" : "umin", 4*w, min(u16_1, u16_2)); min 948 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.s32" : "smin", 2*w, min(i32_1, i32_2)); min 949 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.u32" : "umin", 2*w, min(u32_1, u32_2)); min 950 test/correctness/simd_op_check.cpp check(arm32 ? "vmin.f32" : "fmin", 2*w, min(f32_1, f32_2)); min 1104 test/correctness/simd_op_check.cpp check(arm32 ? "vqadd.u8" : "uqadd", 8*w, u8(min(u16(u8_1) + u16(u8_2), max_u8))); min 1105 test/correctness/simd_op_check.cpp check(arm32 ? "vqadd.u16" : "uqadd", 4*w, u16(min(u32(u16_1) + u32(u16_2), max_u16))); min 1108 test/correctness/simd_op_check.cpp check(arm32 ? "vqadd.u8" : "uqadd", 8*w, u8(min(u16(u8_1) + 17, max_u8))); min 1109 test/correctness/simd_op_check.cpp check(arm32 ? "vqadd.u16" : "uqadd", 4*w, u16(min(u32(u16_1) + 17, max_u16))); min 1123 test/correctness/simd_op_check.cpp check(arm32 ? "vqmovn.u16" : "uqxtn", 8*w, u8(min(u16_1, max_u8))); min 1124 test/correctness/simd_op_check.cpp check(arm32 ? "vqmovn.u32" : "uqxtn", 4*w, u16(min(u32_1, max_u16))); min 1125 test/correctness/simd_op_check.cpp check(arm32 ? "vqmovn.u64" : "uqxtn", 2*w, u32(min(u64_1, max_u32))); min 1153 test/correctness/simd_op_check.cpp check(arm32 ? "vqshl.u8" : "uqshl", 8*w, u8(min(u16(u8_1 )*16, max_u8))); min 1154 test/correctness/simd_op_check.cpp check(arm32 ? "vqshl.u16" : "uqshl", 4*w, u16(min(u32(u16_1)*16, max_u16))); min 1155 test/correctness/simd_op_check.cpp check(arm32 ? "vqshl.u32" : "uqshl", 2*w, u32(min(u64(u32_1)*16, max_u32))); min 1171 test/correctness/simd_op_check.cpp check(arm32 ? "vqshrn.u16" : "uqshrn", 8*w, u8(min(u16_1/16, max_u8))); min 1172 test/correctness/simd_op_check.cpp check(arm32 ? "vqshrn.u32" : "uqshrn", 4*w, u16(min(u32_1/16, max_u16))); min 1173 test/correctness/simd_op_check.cpp check(arm32 ? "vqshrn.u64" : "uqshrn", 2*w, u32(min(u64_1/16, max_u32))); min 1705 test/correctness/simd_op_check.cpp check("vmin(v*.ub,v*.ub)", hvx_width/1, min(u8_1, u8_2)); min 1706 test/correctness/simd_op_check.cpp check("vmin(v*.uh,v*.uh)", hvx_width/2, min(u16_1, u16_2)); min 1707 test/correctness/simd_op_check.cpp check("vmin(v*.h,v*.h)", hvx_width/2, min(i16_1, i16_2)); min 1708 test/correctness/simd_op_check.cpp check("vmin(v*.w,v*.w)", hvx_width/4, min(i32_1, i32_2)); min 1962 test/correctness/simd_op_check.cpp check("vaddubs", 16*w, u8(min(u16( u8_1) + u16( u8_2), max_u8))); min 1963 test/correctness/simd_op_check.cpp check("vadduhs", 8*w, u16(min(u32(u16_1) + u32(u16_2), max_u16))); min 1964 test/correctness/simd_op_check.cpp check("vadduws", 4*w, u32(min(u64(u32_1) + u64(u32_2), max_u32))); min 1992 test/correctness/simd_op_check.cpp check("vminsb", 16*w, min( i8_1, i8_2)); min 1993 test/correctness/simd_op_check.cpp check("vminub", 16*w, min( u8_1, u8_2)); min 1994 test/correctness/simd_op_check.cpp check("vminsh", 8*w, min(i16_1, i16_2)); min 1995 test/correctness/simd_op_check.cpp check("vminuh", 8*w, min(u16_1, u16_2)); min 1996 test/correctness/simd_op_check.cpp check("vminsw", 4*w, min(i32_1, i32_2)); min 1997 test/correctness/simd_op_check.cpp check("vminuw", 4*w, min(u32_1, u32_2)); min 2007 test/correctness/simd_op_check.cpp check("vminfp", 4*w, min(f32_1, f32_2)); min 2021 test/correctness/simd_op_check.cpp check("xvmindp", 2*w, min(f64_1, f64_2)); min 2034 test/correctness/simd_op_check.cpp check("vminsd", 2*w, min(i64_1, i64_2)); min 2035 test/correctness/simd_op_check.cpp check("vminud", 2*w, min(u64_1, u64_2)); min 11 test/correctness/sort_exprs.cpp Expr tmp = min(a, b); min 229 test/correctness/specialize.cpp int m = im.get().min(0), e = im.get().extent(0); min 268 test/correctness/specialize.cpp int m = im.get().min(0); min 276 test/correctness/specialize.cpp m = im.get().min(0); min 56 test/correctness/undef.cpp Expr right = min(rx+1, 99); min 13 test/correctness/unsafe_dedup_lets.cpp Expr a = max(pa, pb), b = min(pa, pb); min 589 test/correctness/vector_math.cpp w = std::min(std::max(w, 0.0), 1.0); min 60 test/correctness/widening_reduction.cpp correct = std::min(std::max(correct / 16, 0), 255); min 103 test/correctness/widening_reduction.cpp correct = std::min(std::max(correct / 16, 0), 255); min 29 test/error/float16_t_implicit_downcast.cpp h_assert(simple.min(0) == 0, "unexpected non zero min in x"); min 30 test/error/float16_t_implicit_downcast.cpp h_assert(simple.min(1) == 0, "unexpected non zero min in y"); min 111 test/generator/metadata_tester_aottest.cpp EXPECT_SCALAR_UNION_EQ(e.type.code, e.type.bits, e.min, a.min); min 751 test/generator/metadata_tester_aottest.cpp delete kExpectedArguments[i].min; min 28 test/generator/msan_aottest.cpp in->dim[0].min = 0; min 29 test/generator/msan_aottest.cpp in->dim[1].min = 0; min 30 test/generator/msan_aottest.cpp in->dim[2].min = 0; min 13 test/generator/old_buffer_t_aottest.cpp (x - buf->min[0]) * buf->stride[0] + min 14 test/generator/old_buffer_t_aottest.cpp (y - buf->min[1]) * buf->stride[1]); min 21 test/generator/old_buffer_t_aottest.cpp in2->min[0] = out->min[0]; min 23 test/generator/old_buffer_t_aottest.cpp in2->min[1] = out->min[1] + 7; min 28 test/generator/old_buffer_t_aottest.cpp f->min[0] = out->min[0]; min 30 test/generator/old_buffer_t_aottest.cpp f->min[1] = out->min[1]; min 31 test/generator/stubtest_aottest.cpp int channels = std::max(1, std::min(input.channels(), output.channels())); min 38 test/generator/stubtest_jittest.cpp int channels = std::max(1, std::min(input.channels(), output.channels())); min 34 test/generator/stubuser_aottest.cpp int channels = std::max(1, std::min(input.channels(), output.channels())); min 37 test/generator/variable_num_threads_aottest.cpp max_threads = 1 + std::min(i, 1000-i) / 50; min 103 test/opengl/special_funcs.cpp cast<int>(min(cast<float>(x), cast<float>(y))), min 37 test/opengl/sum_reduction.cpp temp += input(std::min(x + r, input.width() - 1), y, c); min 25 test/opengl/tuples.cpp h(x, y, c) = min(g(x, y, c)[0], g(x, y, c)[1]); min 23 test/performance/clamped_vector_load.cpp int ix1 = std::max(std::min(x, MAX), MIN); min 24 test/performance/clamped_vector_load.cpp int ix2 = std::max(std::min(x+1, MAX), MIN); min 20 test/performance/packed_planar_fusion.cpp .set_min(dst.dim(i).min()); min 139 test/performance/rfactor.cpp ref() = Tuple(min(ref()[0], input(r.x, r.y, r.y, r.z)), min 146 test/performance/rfactor.cpp amin() = Tuple(min(amin()[0], input(r.x, r.y, r.z, r.w)), min 351 test/performance/rfactor.cpp min(sink_ref()[4], A(r)), // Min min 363 test/performance/rfactor.cpp min(sink()[4], A(r)), // Min min 29 test/performance/sort.cpp min(prev(x), prev(partner)), min 37 test/performance/sort.cpp min(prev(x), prev(partner)), min 75 test/performance/sort.cpp Expr b0 = min(a0, a1); min 77 test/performance/sort.cpp Expr b2 = min(a2, a3); min 80 test/performance/sort.cpp a0 = min(b0, b2); min 82 test/performance/sort.cpp a2 = min(b1, b3); min 86 test/performance/sort.cpp b1 = min(a1, a2); min 7 tools/find_inverse.cpp int64_t r(int64_t min, int64_t max) { min 12 tools/find_inverse.cpp n1 = n1 % (max - min); min 13 tools/find_inverse.cpp n1 = n1 + min; min 75 tools/find_inverse.cpp int64_t min = -(1L << (bits-1)), max = (1L << (bits-1))-1; min 78 tools/find_inverse.cpp int64_t num = r(min, max); min 80 tools/find_inverse.cpp if (iter == 0) num = min; min 90 tools/find_inverse.cpp int64_t min = -(1 << (bits-1)), max = (1 << (bits-1))-1; min 94 tools/find_inverse.cpp int64_t num = r(min, max); min 96 tools/find_inverse.cpp if (iter == 0) num = min; min 40 tools/halide_image_info.h static inline void print_loc(const std::vector<int32_t> &loc, int dim, const int32_t *min) { min 45 tools/halide_image_info.h std::cout << loc[d] + min[d]; min 75 tools/halide_image_info.h int32_t *min = buf->min; min 130 tools/halide_image_info.h std::cout << min[d] << " "; min 172 tools/halide_image_info.h int32_t *min = buf->min; min 205 tools/halide_image_info.h print_dimid(d, curloc[d]+min[d]); min 216 tools/halide_image_info.h idx << "(" << curloc[0]+min[0] << "," << curloc[1]+min[1] << ")"; min 219 tools/halide_image_info.h idx << curloc[0]+min[0]; min 236 tools/halide_image_info.h int32_t *min = buf->min; min 303 tools/halide_image_info.h print_loc(minloc, dim, min); min 306 tools/halide_image_info.h print_loc(maxloc, dim, min); min 63 tutorial/lesson_02_input_image.cpp value = Halide::min(value, 255.0f); min 524 tutorial/lesson_05_scheduling_1.cpp int x = std::min(x_outer * 64, 350-64) + x_inner_outer*4; min 531 tutorial/lesson_05_scheduling_1.cpp int y_base = std::min(y_outer * 64, 250-64) + y_inner_outer*2; min 684 tutorial/lesson_09_update_definitions.cpp int clamped_x = std::min(std::max(x + r_x, 0), input.width()-1); min 685 tutorial/lesson_09_update_definitions.cpp int clamped_y = std::min(std::max(y + r_y, 0), input.height()-1); min 812 tutorial/lesson_09_update_definitions.cpp int y_base = std::min(yo * 32, input.height() - 32); min 838 tutorial/lesson_09_update_definitions.cpp int clamped_y = std::min(std::max(cy, 0), input.height()-1); min 843 tutorial/lesson_09_update_definitions.cpp int clamped_x = std::min(std::max(x, 0), input.width()-1); min 850 tutorial/lesson_09_update_definitions.cpp int x_base = std::min(x_vec * 16, input.width() - 16); min 159 util/HalideTraceViz.cpp float min = 0.0f, max = 0.0f; min 178 util/HalideTraceViz.cpp min, max, min 219 util/HalideTraceViz.cpp for (int i = 0; i < std::min(16, p.dimensions / p.type.lanes); i++) { min 226 util/HalideTraceViz.cpp min_coord[i] = std::min(min_coord[i], coord); min 238 util/HalideTraceViz.cpp min_value = std::min(min_value, value); min 454 util/HalideTraceViz.cpp int min = p.get_coord(current_dimension * 2 + 0); min 456 util/HalideTraceViz.cpp x_off += fi.config.x_stride[current_dimension] * min; min 457 util/HalideTraceViz.cpp y_off += fi.config.y_stride[current_dimension] * min; min 458 util/HalideTraceViz.cpp for (int i = min; i < min + extent; i++) { min 484 util/HalideTraceViz.cpp config.min = 0; min 516 util/HalideTraceViz.cpp config.min = atof(argv[++i]); min 815 util/HalideTraceViz.cpp value = 255 * (value - fi.config.min) / (fi.config.max - fi.config.min);