r 19 apps/bilateral_grid/bilateral_grid_generator.cpp RDom r(0, s_sigma, 0, s_sigma); r 20 apps/bilateral_grid/bilateral_grid_generator.cpp Expr val = clamped(x * s_sigma + r.x - s_sigma/2, y * s_sigma + r.y - s_sigma/2); r 82 apps/bilateral_grid/bilateral_grid_generator.cpp histogram.update().reorder(c, r.x, r.y, x, y).gpu_threads(x, y).unroll(c); r 96 apps/bilateral_grid/bilateral_grid_generator.cpp histogram.update().reorder(c, r.x, r.y, x, y).unroll(c); r 166 apps/camera_pipe/camera_pipe_generator.cpp Func r = interleave_y(interleave_x(r_gr, r_r), r 174 apps/camera_pipe/camera_pipe_generator.cpp output(x, y, c) = select(c == 0, r(x, y), r 227 apps/camera_pipe/camera_pipe_generator.cpp Expr r = matrix(3, 0) + matrix(0, 0) * ir + matrix(1, 0) * ig + matrix(2, 0) * ib; r 231 apps/camera_pipe/camera_pipe_generator.cpp r = cast<int16_t>(r/256); r 234 apps/camera_pipe/camera_pipe_generator.cpp corrected(x, y, c) = select(c == 0, r, r 302 apps/camera_pipe/fcam/Demosaic.cpp float r, g, b; r 308 apps/camera_pipe/fcam/Demosaic.cpp r = colorMatrix[0]*linear[R][GR][y][x] + r 324 apps/camera_pipe/fcam/Demosaic.cpp ri = r < 0 ? 0 : (r > whiteLevel ? whiteLevel : (unsigned short)(r+0.5f)); r 334 apps/camera_pipe/fcam/Demosaic.cpp r = colorMatrix[0]*linear[R][R][y][x] + r 350 apps/camera_pipe/fcam/Demosaic.cpp ri = r < 0 ? 0 : (r > whiteLevel ? whiteLevel : (unsigned short)(r+0.5f)); r 360 apps/camera_pipe/fcam/Demosaic.cpp r = colorMatrix[0]*linear[R][B][y][x] + r 376 apps/camera_pipe/fcam/Demosaic.cpp ri = r < 0 ? 0 : (r > whiteLevel ? whiteLevel : (unsigned short)(r+0.5f)); r 386 apps/camera_pipe/fcam/Demosaic.cpp r = colorMatrix[0]*linear[R][GB][y][x] + r 402 apps/camera_pipe/fcam/Demosaic.cpp ri = r < 0 ? 0 : (r > whiteLevel ? whiteLevel : (unsigned short)(r+0.5f)); r 18 apps/cuda_mat_mul/mat_mul_generator.cpp RDom r(0, size); r 19 apps/cuda_mat_mul/mat_mul_generator.cpp prod(x, y) += A(x, r) * B(r, y); r 35 apps/cuda_mat_mul/mat_mul_generator.cpp .unroll(r.x, 2) r 36 apps/cuda_mat_mul/mat_mul_generator.cpp .reorder(y, x, r.x) r 29 apps/fft/complex.h ComplexExpr &operator+=(ComplexExpr r) { r 30 apps/fft/complex.h x += r.x; r 31 apps/fft/complex.h y += r.y; r 45 apps/fft/fft.cpp int r = x % y; r 47 apps/fft/fft.cpp y = r; r 69 apps/fft/fft.cpp vector<Var> A(vector<Var> l, const vector<Var> &r) { r 70 apps/fft/fft.cpp for (const Var& i : r) { r 77 apps/fft/fft.cpp vector<Expr> A(vector<Expr> l, const vector<T> &r) { r 78 apps/fft/fft.cpp for (const Var& i : r) { r 325 apps/fft/fft.cpp Var r("r"), s("s"); r 330 apps/fft/fft.cpp ComplexExpr x_rs = x(A({n0, s + r * (N / R)}, args)); r 334 apps/fft/fft.cpp v(A({r, s, n0}, args)) = select(r > 0, likely(x_rs * W(r * (s % S))), x_rs * gain); r 339 apps/fft/fft.cpp v(A({r, s, n0}, args)) = x_rs; r 369 apps/fft/fft.cpp v.compute_at(exchange, s_).unroll(r); r 370 apps/fft/fft.cpp v.reorder_storage(n0, r, s); r 662 apps/fft/fft.cpp ComplexFunc fft2d_r2c(Func r, r 669 apps/fft/fft.cpp vector<Var> args(r.args()); r 704 apps/fft/fft.cpp zip_width = target.natural_vector_size(r.output_types()[0]); r 710 apps/fft/fft.cpp ComplexExpr(r(A({zip_n0, n1}, args)), r 711 apps/fft/fft.cpp r(A({zip_n0 + zip_width, n1}, args))); r 811 apps/fft/fft.cpp r.compute_at(dft1, group); r 1022 apps/fft/fft.cpp for (int r : radices) { r 1023 apps/fft/fft.cpp while (N % r == 0) { r 1024 apps/fft/fft.cpp R.push_back(r); r 1025 apps/fft/fft.cpp N /= r; r 1047 apps/fft/fft.cpp ComplexFunc fft2d_r2c(Func r, r 1051 apps/fft/fft.cpp return fft2d_r2c(r, radix_factor(N0), radix_factor(N1), target, desc); r 58 apps/fft/fft.h ComplexFunc fft2d_r2c(Halide::Func r, int N0, int N1, r 23 python_bindings/numpy/ndarray.cpp ndarray::bitflag r = ndarray::NONE; r 24 python_bindings/numpy/ndarray.cpp if (f & NPY_C_CONTIGUOUS) r = (r | ndarray::C_CONTIGUOUS); r 25 python_bindings/numpy/ndarray.cpp if (f & NPY_F_CONTIGUOUS) r = (r | ndarray::F_CONTIGUOUS); r 26 python_bindings/numpy/ndarray.cpp if (f & NPY_ALIGNED) r = (r | ndarray::ALIGNED); r 27 python_bindings/numpy/ndarray.cpp if (f & NPY_WRITEABLE) r = (r | ndarray::WRITEABLE); r 28 python_bindings/numpy/ndarray.cpp return r; r 32 python_bindings/numpy/ndarray.cpp int r = 0; r 33 python_bindings/numpy/ndarray.cpp if (f & ndarray::C_CONTIGUOUS) r |= NPY_C_CONTIGUOUS; r 34 python_bindings/numpy/ndarray.cpp if (f & ndarray::F_CONTIGUOUS) r |= NPY_F_CONTIGUOUS; r 35 python_bindings/numpy/ndarray.cpp if (f & ndarray::ALIGNED) r |= NPY_ALIGNED; r 36 python_bindings/numpy/ndarray.cpp if (f & ndarray::WRITEABLE) r |= NPY_WRITEABLE; r 37 python_bindings/numpy/ndarray.cpp return r; r 112 python_bindings/numpy/ndarray.cpp ndarray r(python::detail::new_reference(PyArray_NewFromDescr(&PyArray_Type, r 120 python_bindings/numpy/ndarray.cpp r.set_base(owner); r 121 python_bindings/numpy/ndarray.cpp return r; r 24 python_bindings/python/Func.cpp p::object realization_to_python_object(const h::Realization &r) { r 25 python_bindings/python/Func.cpp if (r.size() == 1) { r 26 python_bindings/python/Func.cpp return buffer_to_python_object(r[0]); r 29 python_bindings/python/Func.cpp for (size_t i = 0; i < r.size(); i++) { r 30 python_bindings/python/Func.cpp elts.append(buffer_to_python_object(r[i])); r 591 python_bindings/python/Image.cpp static p::object create_buffer_from_realization(h::Type type, h::Realization &r) { r 592 python_bindings/python/Image.cpp return create_buffer_impl(type, r); r 19 python_bindings/python/InlineReductions.cpp h::Expr sum1(h::RDom r, h::Expr e, const std::string name) { r 20 python_bindings/python/InlineReductions.cpp return h::sum(r, e, name); r 27 python_bindings/python/InlineReductions.cpp h::Expr product1(h::RDom r, h::Expr e, const std::string name) { r 28 python_bindings/python/InlineReductions.cpp return h::product(r, e, name); r 35 python_bindings/python/InlineReductions.cpp h::Expr maximum1(h::RDom r, h::Expr e, const std::string name) { r 36 python_bindings/python/InlineReductions.cpp return h::maximum(r, e, name); r 43 python_bindings/python/InlineReductions.cpp h::Expr minimum1(h::RDom r, h::Expr e, const std::string name) { r 44 python_bindings/python/InlineReductions.cpp return h::minimum(r, e, name); r 51 python_bindings/python/InlineReductions.cpp p::object argmin1(h::RDom r, h::Expr e, const std::string name) { r 52 python_bindings/python/InlineReductions.cpp return expr_vector_to_python_tuple(h::argmin(r, e, name).as_vector()); r 59 python_bindings/python/InlineReductions.cpp p::object argmax1(h::RDom r, h::Expr e, const std::string name) { r 60 python_bindings/python/InlineReductions.cpp return expr_vector_to_python_tuple(h::argmax(r, e, name).as_vector()); r 34 src/AddImageChecks.cpp Result r; r 35 src/AddImageChecks.cpp r.image = op->image; r 36 src/AddImageChecks.cpp r.type = op->type.element_of(); r 37 src/AddImageChecks.cpp r.dimensions = (int)op->args.size(); r 38 src/AddImageChecks.cpp buffers[op->name] = r; r 40 src/AddImageChecks.cpp Result r; r 41 src/AddImageChecks.cpp r.param = op->param; r 42 src/AddImageChecks.cpp r.type = op->type.element_of(); r 43 src/AddImageChecks.cpp r.dimensions = (int)op->args.size(); r 44 src/AddImageChecks.cpp buffers[op->name] = r; r 52 src/AddImageChecks.cpp Result r; r 53 src/AddImageChecks.cpp r.param = op->param; r 54 src/AddImageChecks.cpp r.type = op->param.type(); r 55 src/AddImageChecks.cpp r.dimensions = op->param.dimensions(); r 56 src/AddImageChecks.cpp buffers[op->param.name()] = r; r 85 src/AssociativeOpsTable.cpp TableKey(ValType t, RootExpr r, size_t d) : type(t), root(r), dim(d) {} r 1556 src/Bounds.cpp map<string, Box> r; r 1557 src/Bounds.cpp r = boxes_required(loop); r 1558 src/Bounds.cpp internal_assert(r.find("output") == r.end()); r 1559 src/Bounds.cpp internal_assert(r.find("input") != r.end()); r 1560 src/Bounds.cpp internal_assert(equal(simplify(r["input"][0].min), 6)); r 1561 src/Bounds.cpp internal_assert(equal(simplify(r["input"][0].max), 25)); r 1562 src/Bounds.cpp r = boxes_provided(loop); r 1563 src/Bounds.cpp internal_assert(r.find("output") != r.end()); r 1564 src/Bounds.cpp internal_assert(equal(simplify(r["output"][0].min), 4)); r 1565 src/Bounds.cpp internal_assert(equal(simplify(r["output"][0].max), 13)); r 1568 src/Bounds.cpp merge_boxes(r2, r["output"]); r 235 src/CSE.cpp Replacer(const map<Expr, Expr, ExprCompare> &r) : replacements(r) {} r 141 src/CodeGen_Hexagon.cpp const Ramp *r = x.as<Ramp>(); r 142 src/CodeGen_Hexagon.cpp if (!r) return false; r 144 src/CodeGen_Hexagon.cpp return is_one(r->stride); r 238 src/CodeGen_Internal.cpp Expr r = a - q*b; r 240 src/CodeGen_Internal.cpp Expr rs = r >> (a.type().bits() - 1); r 252 src/CodeGen_Internal.cpp Expr r = Call::make(a.type(), Call::mod_round_to_zero, {a, b}, Call::PureIntrinsic); r 261 src/CodeGen_Internal.cpp Expr sign_mask = r >> (a.type().bits()-1); r 262 src/CodeGen_Internal.cpp r += sign_mask & abs(b); r 263 src/CodeGen_Internal.cpp return common_subexpression_elimination(r); r 265 src/CodeGen_Internal.cpp return r; r 200 src/CodeGen_Metal_Dev.cpp const Ramp *r = e.as<Ramp>(); r 201 src/CodeGen_Metal_Dev.cpp if (r == nullptr) { r 205 src/CodeGen_Metal_Dev.cpp if (is_one(r->stride)) { r 206 src/CodeGen_Metal_Dev.cpp return r->base; r 428 src/CodeGen_Metal_Dev.cpp bool operator < (const BufferSize &r) const { r 429 src/CodeGen_Metal_Dev.cpp return size < r.size; r 156 src/CodeGen_OpenCL_Dev.cpp const Ramp *r = e.as<Ramp>(); r 157 src/CodeGen_OpenCL_Dev.cpp if (r == nullptr) { r 161 src/CodeGen_OpenCL_Dev.cpp const IntImm *i = r->stride.as<IntImm>(); r 163 src/CodeGen_OpenCL_Dev.cpp return r->base; r 519 src/CodeGen_OpenCL_Dev.cpp bool operator < (const BufferSize &r) const { r 520 src/CodeGen_OpenCL_Dev.cpp return size < r.size; r 483 src/CodeGen_OpenGL_Dev.cpp const Ramp *r = e.as<Ramp>(); r 484 src/CodeGen_OpenGL_Dev.cpp if (r && is_zero(r->base) && is_one(r->stride) && r->lanes == 4) { r 487 src/CodeGen_OpenGL_Dev.cpp } else if (r && is_zero(r->base) && is_one(r->stride) && r->lanes == 3) { r 489 src/CodeGen_OpenGL_Dev.cpp } else if (r && is_zero(r->base) && is_one(r->stride) && r->lanes == 2) { r 511 src/CodeGen_OpenGL_Dev.cpp } else if (const Ramp *r = e.as<Ramp>()) { r 513 src/CodeGen_OpenGL_Dev.cpp result[i] = print_expr(simplify(r->base + i * r->stride)); r 89 src/Deinterleave.cpp const Ramp *r = op->index.as<Ramp>(); r 90 src/Deinterleave.cpp if (!r || !is_const(r->stride, store_stride)) { r 460 src/Deinterleave.cpp const Ramp *r = op->a.as<Ramp>(); r 462 src/Deinterleave.cpp if (r && r 464 src/Deinterleave.cpp (r->type.lanes() % i) == 0) { r 474 src/Deinterleave.cpp const Ramp *r = op->a.as<Ramp>(); r 476 src/Deinterleave.cpp if (r && r 478 src/Deinterleave.cpp (r->type.lanes() % i) == 0) { r 633 src/Elf.cpp auto get_symbol = [&](const Relocation &r) { r 634 src/Elf.cpp const Symbol *sym = r.get_symbol(); r 647 src/Elf.cpp auto needs_plt_entry = [&](const Relocation &r) { r 648 src/Elf.cpp const Symbol *s = get_symbol(r); r 657 src/Elf.cpp return linker->needs_plt_entry(r); r 670 src/Elf.cpp for (const Relocation &r : s.relocations()) { r 671 src/Elf.cpp if (!needs_plt_entry(r)) { r 675 src/Elf.cpp const Symbol *sym = get_symbol(r); r 793 src/Elf.cpp for (const Relocation &r : s.relocations()) { r 794 src/Elf.cpp const Symbol *sym = get_symbol(r); r 795 src/Elf.cpp if (needs_plt_entry(r)) { r 803 src/Elf.cpp uint64_t fixup_offset = get_section_offset(s) + r.get_offset(); r 810 src/Elf.cpp Relocation new_reloc = linker->relocate(fixup_offset, fixup_addr, r.get_type(), sym, sym_offset, r.get_addend(), got); r 836 src/Elf.cpp for (const Relocation &r : s.relocations()) { r 837 src/Elf.cpp uint64_t i_offset = get_section_offset(s) + r.get_offset(); r 838 src/Elf.cpp Rela<T> rela(i_offset, r.get_type(), symbol_idxs[get_symbol(r)], r.get_addend()); r 583 src/Func.cpp Func Stage::rfactor(RVar r, Var v) { r 584 src/Func.cpp return rfactor({{r, v}}); r 2772 src/Func.cpp Realization r(outputs); r 2773 src/Func.cpp infer_input_bounds(r); r 29 src/Func.h VarOrRVar(const std::string &n, bool r) : var(n), rvar(n), is_rvar(r) {} r 31 src/Func.h VarOrRVar(const RVar &r) : rvar(r), is_rvar(true) {} r 32 src/Func.h VarOrRVar(const RDom &r) : rvar(RVar(r)), is_rvar(true) {} r 168 src/Func.h EXPORT Func rfactor(RVar r, Var v); r 1990 src/Func.h inline void assign_results(Realization &r, int idx, Last last) { r 1992 src/Func.h *last = Buffer<T>(r[idx])(); r 1996 src/Func.h inline void assign_results(Realization &r, int idx, First first, Second second, Rest&&... rest) { r 1997 src/Func.h assign_results<First>(r, idx, first); r 1998 src/Func.h assign_results<Second, Rest...>(r, idx+1, second, rest...); r 2025 src/Func.h Realization r = f.realize(); r 2026 src/Func.h Internal::assign_results(r, 0, first, rest...); r 2072 src/Func.h Realization r = f.realize(); r 2073 src/Func.h Internal::assign_results(r, 0, first, rest...); r 628 src/Function.cpp Definition r(args, values, check.reduction_domain, false); r 629 src/Function.cpp internal_assert(!r.is_init()) << "Should have been an update definition\n"; r 641 src/Function.cpp bool pure = can_parallelize_rvar(v, name(), r); r 645 src/Function.cpp r.schedule().dims().push_back(d); r 653 src/Function.cpp r.schedule().dims().push_back(d); r 660 src/Function.cpp r.schedule().dims().push_back(d); r 677 src/Function.cpp contents->updates.push_back(r); r 118 src/Generator.cpp const auto r = rational_approximation_helper(1.0/float_part, max_depth - 1); r 119 src/Generator.cpp const int64_t num = r.second; r 120 src/Generator.cpp const int64_t den = r.first; r 2314 src/Generator.h void realize(Realization r) { r 2316 src/Generator.h get_pipeline().realize(r, get_target()); r 2842 src/Generator.h void realize(Realization r) { r 2843 src/Generator.h generator->realize(r); r 2899 src/Generator.h std::vector<StubInput> r; r 2900 src/Generator.h std::copy(v.begin(), v.end(), std::back_inserter(r)); r 2901 src/Generator.h return r; r 323 src/HexagonOffload.cpp for (const Relocation &r : got.relocations()) { r 324 src/HexagonOffload.cpp if (r.get_symbol() == sym) { r 325 src/HexagonOffload.cpp G = r.get_offset(); r 495 src/HexagonOffload.cpp for (const Relocation &r : got.relocations()) { r 496 src/HexagonOffload.cpp if (r.get_symbol() == &sym && r.get_type() == R_HEX_GLOB_DAT) { r 497 src/HexagonOffload.cpp internal_assert(r.get_addend() == 0); r 498 src/HexagonOffload.cpp return r.get_offset(); r 508 src/HexagonOffload.cpp bool needs_plt_entry(const Relocation &r) override { r 509 src/HexagonOffload.cpp return maybe_branch_inst(r.get_type()); r 508 src/IREquality.cpp IRComparer::CmpResult flip_result(IRComparer::CmpResult r) { r 509 src/IREquality.cpp switch(r) { r 520 src/IREquality.cpp IRComparer::CmpResult r = IRComparer(&cache).compare_expr(a, b); r 521 src/IREquality.cpp internal_assert(r == IRComparer::Equal) r 522 src/IREquality.cpp << "Error in ir_equality_test: " << r r 61 src/IROperator.cpp } else if (const Ramp *r = e.as<Ramp>()) { r 62 src/IROperator.cpp return is_const(r->base) && is_const(r->stride); r 164 src/IROperator.cpp if (const Ramp *r = e.as<Ramp>()) { r 166 src/IROperator.cpp return is_positive_const(r->base) && is_positive_const(r->stride); r 180 src/IROperator.cpp if (const Ramp *r = e.as<Ramp>()) { r 182 src/IROperator.cpp return is_negative_const(r->base) && is_negative_const(r->stride); r 198 src/IROperator.cpp if (const Ramp *r = e.as<Ramp>()) { r 200 src/IROperator.cpp return is_negative_negatable_const(r->base) && is_negative_const(r->stride); r 23 src/InlineReductions.cpp FindFreeVars(RDom r, const string &n) : r 24 src/InlineReductions.cpp rdom(r), explicit_rdom(r.defined()), name(n) { r 108 src/InlineReductions.cpp Expr sum(RDom r, Expr e, const std::string &name) { r 109 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 123 src/InlineReductions.cpp Expr product(RDom r, Expr e, const std::string &name) { r 124 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 138 src/InlineReductions.cpp Expr maximum(RDom r, Expr e, const std::string &name) { r 139 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 154 src/InlineReductions.cpp Expr minimum(RDom r, Expr e, const std::string &name) { r 155 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 170 src/InlineReductions.cpp Tuple argmax(RDom r, Expr e, const std::string &name) { r 171 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 199 src/InlineReductions.cpp Tuple argmin(RDom r, Expr e, const std::string &name) { r 200 src/InlineReductions.cpp Internal::FindFreeVars v(r, name); r 1509 src/Introspection.cpp LiveRange r = {val, val}; r 1510 src/Introspection.cpp live_ranges.push_back(r); r 1525 src/Introspection.cpp LiveRange r = {(uint64_t)ptr[0], (uint64_t)ptr[1]}; r 1526 src/Introspection.cpp r.pc_begin += compile_unit_base_pc; r 1527 src/Introspection.cpp r.pc_end += compile_unit_base_pc; r 1528 src/Introspection.cpp live_ranges.push_back(r); r 467 src/LLVM_Runtime_Linker.cpp for (const string &r : retain) { r 468 src/LLVM_Runtime_Linker.cpp if (f.getName() == r) { r 72 src/LoopCarry.cpp } else if (const Ramp *r = e.as<Ramp>()) { r 73 src/LoopCarry.cpp Expr la = is_linear(r->base, linear); r 74 src/LoopCarry.cpp Expr lb = is_linear(r->stride, linear); r 112 src/ModulusRemainder.cpp void check(Expr e, int m, int r) { r 114 src/ModulusRemainder.cpp if (result.modulus != m || result.remainder != r) { r 117 src/ModulusRemainder.cpp std::cerr << "Correct modulus, remainder = " << m << ", " << r << "\n"; r 306 src/ModulusRemainder.cpp ModulusRemainder r = unify_alternatives(analyze(op->a), analyze(op->b)); r 307 src/ModulusRemainder.cpp modulus = r.modulus; r 308 src/ModulusRemainder.cpp remainder = r.remainder; r 312 src/ModulusRemainder.cpp ModulusRemainder r = unify_alternatives(analyze(op->a), analyze(op->b)); r 313 src/ModulusRemainder.cpp modulus = r.modulus; r 314 src/ModulusRemainder.cpp remainder = r.remainder; r 354 src/ModulusRemainder.cpp ModulusRemainder r = unify_alternatives(analyze(op->true_value), r 356 src/ModulusRemainder.cpp modulus = r.modulus; r 357 src/ModulusRemainder.cpp remainder = r.remainder; r 16 src/ModulusRemainder.h ModulusRemainder(int m, int r) : modulus(m), remainder(r) {} r 64 src/Monotonic.cpp Monotonic flip(Monotonic r) { r 65 src/Monotonic.cpp switch (r) { r 68 src/Monotonic.cpp default: return r; r 94 src/ParallelRVar.cpp const Definition &r) { r 95 src/ParallelRVar.cpp const vector<Expr> &values = r.values(); r 96 src/ParallelRVar.cpp const vector<Expr> &args = r.args(); r 97 src/ParallelRVar.cpp const vector<ReductionVariable> &rvars = r.schedule().rvars(); r 144 src/ParallelRVar.cpp Expr pred = simplify(r.predicate()); r 22 src/ParallelRVar.h const Definition &r); r 27 src/Parameter.cpp ParameterContents(Type t, bool b, int d, const std::string &n, bool e, bool r, bool is_bound_before_lowering) r 29 src/Parameter.cpp host_alignment(t.bytes()), is_buffer(b), is_explicit_name(e), is_registered(r), r 515 src/Pipeline.cpp Realization r(bufs); r 516 src/Pipeline.cpp realize(r, target); r 517 src/Pipeline.cpp for (size_t i = 0; i < r.size(); i++) { r 518 src/Pipeline.cpp r[i].copy_to_host(); r 520 src/Pipeline.cpp return r; r 999 src/Pipeline.cpp Realization r(bufs); r 1000 src/Pipeline.cpp infer_input_bounds(r); r 97 src/Prefetch.cpp for (const auto &r : op->bounds) { r 98 src/Prefetch.cpp b.push_back(Interval(r.min, r.min + r.extent - 1)); r 129 src/Random.cpp LowerRandom r(free_vars, tag); r 130 src/Random.cpp return r.mutate(e); r 496 src/RemoveUndef.cpp RemoveUndef r; r 497 src/RemoveUndef.cpp s = r.mutate(s); r 498 src/RemoveUndef.cpp internal_assert(!r.predicate.defined()) r 500 src/RemoveUndef.cpp << r.predicate << "\n"; r 144 src/Schedule.cpp for (ReductionVariable &r : rvars) { r 145 src/Schedule.cpp if (r.min.defined()) { r 146 src/Schedule.cpp r.min = mutator->mutate(r.min); r 148 src/Schedule.cpp if (r.extent.defined()) { r 149 src/Schedule.cpp r.extent = mutator->mutate(r.extent); r 335 src/Schedule.cpp for (const ReductionVariable &r : rvars()) { r 336 src/Schedule.cpp if (r.min.defined()) { r 337 src/Schedule.cpp r.min.accept(visitor); r 339 src/Schedule.cpp if (r.extent.defined()) { r 340 src/Schedule.cpp r.extent.accept(visitor); r 996 src/ScheduleFunctions.cpp for (const Definition &r : f.updates()) { r 997 src/ScheduleFunctions.cpp any_scheduled = any_scheduled || r.schedule().touched(); r 1001 src/ScheduleFunctions.cpp const Definition &r = f.update(i); r 1002 src/ScheduleFunctions.cpp if (!r.schedule().touched()) { r 56 src/Simplify.cpp if (const RelOp *r = e.as<RelOp>()) { r 57 src/Simplify.cpp if (is_simple_const(r->b)) { r 58 src/Simplify.cpp const Variable *v = r->a.template as<Variable>(); r 64 src/Simplify.cpp else if (is_simple_const(r->a)) { r 65 src/Simplify.cpp const Variable *v = r->b.template as<Variable>(); r 178 src/Simplify.cpp Simplify(bool r, const Scope<Interval> *bi, const Scope<ModulusRemainder> *ai) : r 179 src/Simplify.cpp simplify_lets(r) { r 428 src/Simplify.cpp } else if (const Ramp *r = e.as<Ramp>()) { r 430 src/Simplify.cpp if (const_int_bounds(r->base, &min_base, &max_base) && r 431 src/Simplify.cpp const_int_bounds(r->stride, &min_stride, &max_stride)) { r 432 src/Simplify.cpp int64_t min_last_lane = min_base + min_stride * (r->lanes - 1); r 433 src/Simplify.cpp int64_t max_last_lane = max_base + max_stride * (r->lanes - 1); r 4306 src/Simplify.cpp if (const Ramp *r = op->vectors[0].as<Ramp>()) { r 4307 src/Simplify.cpp expr = mutate(r->base + op->indices[0]*r->stride); r 4393 src/Simplify.cpp const Ramp *r = new_vectors[0].as<Ramp>(); r 4394 src/Simplify.cpp if (r) { r 4406 src/Simplify.cpp Expr check = mutate(b->value * terms - r->stride); r 4413 src/Simplify.cpp expr = Ramp::make(r->base, mutate(r->stride / terms), r->lanes * terms); r 4461 src/Simplify.cpp const Ramp *r = new_vectors[0].as<Ramp>(); r 4462 src/Simplify.cpp if (r) { r 4472 src/Simplify.cpp Expr check = mutate(b->value - r->stride * new_vectors[i-1].type().lanes()); r 4479 src/Simplify.cpp expr = Ramp::make(r->base, r->stride, op->indices.size()); r 6197 src/Simplify.cpp Expr r = (e1 / e2); r 6200 src/Simplify.cpp check_indeterminate_ops(r, r_is_zero, r_is_ind); r 6214 src/Simplify.cpp Expr r = (e1 / e2); r 6217 src/Simplify.cpp check_indeterminate_ops(r, r_is_zero, r_is_ind); r 57 src/Simplify.h T r = a % b; r 58 src/Simplify.h r = r + (r < 0 ? (T)std::abs((int64_t)b) : 0); r 59 src/Simplify.h return r; r 70 src/Simplify.h int64_t r = a - q * b; r 72 src/Simplify.h int64_t rs = r >> (t.bits() - 1); r 1355 src/Solve.cpp AndConditionOverDomain r(varying); r 1356 src/Solve.cpp return simplify(r.mutate(e)); r 120 src/StmtToHtml.cpp void print_list(const string &l, const std::vector<Expr> &args, const string &r) { r 123 src/StmtToHtml.cpp stream << matched(r); r 31 src/Substitute.cpp Expr r = find_replacement(v->name); r 32 src/Substitute.cpp if (r.defined()) { r 33 src/Substitute.cpp expr = r; r 141 src/ThreadPool.h T r = func(); r 143 src/ThreadPool.h result.set_value(std::move(r)); r 261 src/Util.cpp BOOL r = RemoveDirectoryA(name.c_str()); r 262 src/Util.cpp internal_assert(r != 0) << "Unable to remove dir: " << name << ":" << GetLastError() << "\n"; r 264 src/Util.cpp int r = ::rmdir(name.c_str()); r 265 src/Util.cpp internal_assert(r == 0) << "Unable to remove dir: " << name << "\n"; r 134 src/VectorizeLoops.cpp } else if (const Ramp *r = e.as<Ramp>()) { r 135 src/VectorizeLoops.cpp Expr last_lane_idx = make_const(r->base.type(), r->lanes-1); r 136 src/VectorizeLoops.cpp if (is_positive_const(r->stride)) { r 137 src/VectorizeLoops.cpp return {r->base, r->base + last_lane_idx * r->stride}; r 138 src/VectorizeLoops.cpp } else if (is_negative_const(r->stride)) { r 139 src/VectorizeLoops.cpp return {r->base + last_lane_idx * r->stride, r->base}; r 869 src/VectorizeLoops.cpp const Ramp *r = replacement.as<Ramp>(); r 870 src/VectorizeLoops.cpp internal_assert(r) << "Expected replacement in VectorSubs to be a ramp\n"; r 871 src/VectorizeLoops.cpp s = For::make(var, r->base, r->lanes, ForType::Serial, DeviceAPI::None, s); r 910 src/VectorizeLoops.cpp VectorSubs(string v, Expr r, bool in_hexagon, const Target &t) : r 911 src/VectorizeLoops.cpp var(v), replacement(r), target(t), in_hexagon(in_hexagon) { r 195 src/runtime/hexagon_remote/dlib.cpp const Rela &r = relocs[i]; r 196 src/runtime/hexagon_remote/dlib.cpp uint32_t *fixup_addr = (uint32_t *)(base_vaddr + r.r_offset); r 200 src/runtime/hexagon_remote/dlib.cpp int32_t A = r.r_addend; r 201 src/runtime/hexagon_remote/dlib.cpp if (r.r_sym() != 0) { r 202 src/runtime/hexagon_remote/dlib.cpp const Sym *sym = &symtab[r.r_sym()]; r 223 src/runtime/hexagon_remote/dlib.cpp switch (r.r_type()) { r 229 src/runtime/hexagon_remote/dlib.cpp log_printf("Unsupported relocation type %d\n", r.r_type()); r 14 test/correctness/argmax.cpp RDom r(0, 100); r 20 test/correctness/argmax.cpp arg_max_f() = select(f(r) > best_so_far, r, arg_max_f()); r 32 test/correctness/argmax.cpp r = RDom(0, 100, 0, 100); r 37 test/correctness/argmax.cpp arg_max_g() = tuple_select(g(r.x, r.y) > arg_max_g()[2], r 38 test/correctness/argmax.cpp Tuple(r.x, r.y, g(r.x, r.y)), r 56 test/correctness/argmax.cpp evaluate_may_gpu(argmax(g(r.x, r.y)), &best_x, &best_y, &best_val); r 64 test/correctness/argmax.cpp evaluate_may_gpu(argmin(g(r.x, r.y)), &best_x, &best_y, &best_val); r 88 test/correctness/argmax.cpp r = RDom(0, 100); r 90 test/correctness/argmax.cpp h(init) = tuple_select(h(init)[0] >= h(r)[0], Tuple(h(init)), Tuple(h(r))); r 22 test/correctness/autotune_bug_2.cpp RDom r(17, 1); r 23 test/correctness/autotune_bug_2.cpp f(x) = r; r 13 test/correctness/circular_reference_leak.cpp RDom r(0, 10); r 15 test/correctness/circular_reference_leak.cpp f(r) = f(r-1) + f(r+1); r 24 test/correctness/compute_at_split_rvar.cpp RDom r(0, 10); r 28 test/correctness/compute_at_split_rvar.cpp g(r) = f(r); r 30 test/correctness/compute_at_split_rvar.cpp g.update().split(r, ro, ri, 2); r 48 test/correctness/compute_at_split_rvar.cpp RDom r(0, 10); r 52 test/correctness/compute_at_split_rvar.cpp g(r) = f(r); r 54 test/correctness/compute_at_split_rvar.cpp g.update().split(r, ro, ri, 2); r 72 test/correctness/compute_at_split_rvar.cpp RDom r(0, 10); r 76 test/correctness/compute_at_split_rvar.cpp g(r) = f(r); r 78 test/correctness/compute_at_split_rvar.cpp g.update().split(r, ro, ri, 2).unroll(ri); r 98 test/correctness/compute_at_split_rvar.cpp RDom r(0, 10); r 102 test/correctness/compute_at_split_rvar.cpp g(r) = f(r); r 104 test/correctness/compute_at_split_rvar.cpp g.update().split(r, ro, ri, 2).reorder(ro, ri); r 123 test/correctness/compute_at_split_rvar.cpp RDom r(0, 20); r 127 test/correctness/compute_at_split_rvar.cpp g(r) = f(r); r 129 test/correctness/compute_at_split_rvar.cpp g.update().split(r, ro, ri, 4).split(ri, rio, rii, 2).fuse(rio, ro, fused); r 36 test/correctness/convolution.cpp RDom r(tent); r 51 test/correctness/convolution.cpp blur1(x, y) += tent(r.x, r.y) * input(x + r.x - 1, y + r.y - 1); r 67 test/correctness/convolution.cpp blur2(x, y) = sum(tent(r.x, r.y) * input(x + r.x - 1, y + r.y - 1)); r 77 test/correctness/convolution.cpp blur1.update().reorder(x, y, r.x, r.y).gpu_tile(x, y, xi, yi, 16, 16); r 38 test/correctness/convolution_multiple_kernels.cpp RDom r(-1, 3, -1, 3); r 39 test/correctness/convolution_multiple_kernels.cpp blur(x, y) = sum(box1(r.x, r.y) * input(x + r.x, y + r.y)) r 40 test/correctness/convolution_multiple_kernels.cpp + sum(cast<uint16_t>(box2(r.x, r.y)) * input(x + r.x, y + r.y)); r 35 test/correctness/debug_to_file_multiple_outputs.cpp Realization r(f_im, g_im, h_im); r 36 test/correctness/debug_to_file_multiple_outputs.cpp p.realize(r); r 74 test/correctness/exception.cpp RDom r(0, 10); r 76 test/correctness/exception.cpp f1(r) = e; r 108 test/correctness/extern_producer.cpp RDom r(output); r 109 test/correctness/extern_producer.cpp float error = evaluate_may_gpu<float>(sum(abs(output(r.x, r.y)))); r 134 test/correctness/extern_producer.cpp float error_multi = evaluate<float>(sum(abs(output_multi(r.x, r.y)))); r 45 test/correctness/extern_sort.cpp RDom r(reference); r 46 test/correctness/extern_sort.cpp float error = evaluate_may_gpu<float>(sum(abs(reference(r) - output(r)))); r 10 test/correctness/fibonacci.cpp RDom r(2, 18); r 13 test/correctness/fibonacci.cpp fib(r) = fib(r-2) + fib(r-1); r 29 test/correctness/fuse.cpp RDom r(-16, 32, -16, 32); r 31 test/correctness/fuse.cpp error() = maximum(abs(f(r.x, r.y) - g(r.x, r.y))); r 11 test/correctness/fused_where_inner_extent_is_zero.cpp RDom r(0, inner_extent, 0, outer_extent); r 15 test/correctness/fused_where_inner_extent_is_zero.cpp g(r.x, r.y) = f(r.x, r.y); r 11 test/correctness/gpu_free_sync.cpp RDom r(0, 100); r 12 test/correctness/gpu_free_sync.cpp f(x, y) = sum(sqrt(sqrt(sqrt(sqrt(x+y+r))))); r 15 test/correctness/gpu_vectorized_shared_memory.cpp RDom r(0, 10); r 16 test/correctness/gpu_vectorized_shared_memory.cpp g(x) += sum(r); r 27 test/correctness/histogram.cpp RDom r(in); r 29 test/correctness/histogram.cpp hist(clamp(cast<int>(in(r.x, r.y)), 0, 255)) += 1; r 22 test/correctness/histogram_equalize.cpp RDom r(in), ri(0, 255); r 26 test/correctness/histogram_equalize.cpp hist(in(r.x, r.y)) += 1; r 26 test/correctness/image_io.cpp RDom r(reloaded); r 29 test/correctness/image_io.cpp args = {r.x, r.y}; r 31 test/correctness/image_io.cpp args = {r.x, r.y, r.z}; r 39 test/correctness/image_of_lists.cpp RDom r(1, 99); r 46 test/correctness/image_of_lists.cpp factors(x) = list_maybe_insert(factors(x), x%r == 0, r); r 252 test/correctness/image_wrap.cpp RDom r(0, 100, 0, 100); r 253 test/correctness/image_wrap.cpp r.where(r.x < r.y); r 254 test/correctness/image_wrap.cpp g(r.x, r.y) += 2*img(r.x, r.y); r 261 test/correctness/image_wrap.cpp g.update(0).split(r.x, rxo, rxi, 2).unroll(rxi); r 522 test/correctness/image_wrap.cpp RDom r(0, 100, 0, 100); r 523 test/correctness/image_wrap.cpp r.where(img(r.x, r.y) + h(r.x, r.y) < 50); r 524 test/correctness/image_wrap.cpp g(r.x, r.y) += h(r.x, r.y); r 526 test/correctness/image_wrap.cpp Func h_wrapper = h.in().store_root().compute_at(g, r.y); r 527 test/correctness/image_wrap.cpp Func img_in_g = img.in(g).compute_at(g, r.x); r 10 test/correctness/implicit_args_tests.cpp int check_image(const Realization &r, const std::vector<FuncChecker> &funcs) { r 12 test/correctness/implicit_args_tests.cpp const Buffer<int> &im = r[idx]; r 58 test/correctness/implicit_args_tests.cpp RDom r(0, 2); r 60 test/correctness/implicit_args_tests.cpp g(clamp(f(r.x, _), 0, 50), _) += 2; // This means g(f(r.x, _0, _1), _0, _1) += 2 r 170 test/correctness/implicit_args_tests.cpp RDom r(0, 2); r 174 test/correctness/implicit_args_tests.cpp g(clamp(f(r.x, _), 0, 50), _) += Tuple(2); r 16 test/correctness/in_place.cpp RDom r(1, 99); r 17 test/correctness/in_place.cpp f(r) += f(r-1); r 28 test/correctness/in_place.cpp g(r) += g(r-1); r 31 test/correctness/in_place.cpp float err = evaluate_may_gpu<float>(sum(abs(data(r) - reference_out(r)))); r 9 test/correctness/inline_reduction.cpp RDom r(-1, 3, -1, 3); r 17 test/correctness/inline_reduction.cpp Expr input_val = input(x+r.x, y+r.y); r 36 test/correctness/inline_reduction.cpp float r = result(x, y); r 37 test/correctness/inline_reduction.cpp float delta = correct - r; r 39 test/correctness/inline_reduction.cpp printf("result(%d, %d) was %f instead of %f\n", x, y, r, correct); r 56 test/correctness/integer_powers.cpp RDom r(exact_result); r 57 test/correctness/integer_powers.cpp rms_1() = sqrt(sum(pow(approx_result_1(r) - exact_result(r), 2), "rms_1_sum")); r 58 test/correctness/integer_powers.cpp rms_2() = sqrt(sum(pow(approx_result_2(r) - exact_result(r), 2), "rms_2_sum")); r 98 test/correctness/integer_powers.cpp RDom r(exact_result); r 99 test/correctness/integer_powers.cpp rms_1() = sqrt(sum(pow(approx_result_1(r) - exact_result(r), 2), "rms_1_neg_sum")); r 100 test/correctness/integer_powers.cpp rms_2() = sqrt(sum(pow(approx_result_2(r) - exact_result(r), 2), "rms_2_neg_sum")); r 284 test/correctness/interleave.cpp RDom r(0, 16); r 287 test/correctness/interleave.cpp define(output6(2*r, 0), cast<uint8_t>(3), elements); r 288 test/correctness/interleave.cpp define(output6(2*r+1, 0), cast<uint8_t>(4), elements); r 291 test/correctness/interleave.cpp define(output6(2*r, 1), cast<uint8_t>(3), elements); r 292 test/correctness/interleave.cpp define(output6(2*r+1, 1), cast<uint8_t>(4), elements); r 295 test/correctness/interleave.cpp define(output6(3*r, 3), cast<uint8_t>(3), elements); r 296 test/correctness/interleave.cpp define(output6(3*r+1, 3), cast<uint8_t>(4), elements); r 302 test/correctness/interleave.cpp rdef0.push_back(element(output6(2*r, 2), i) + 1); r 303 test/correctness/interleave.cpp rdef1.push_back(element(output6(2*r+1, 2), i) + 1); r 305 test/correctness/interleave.cpp define(output6(2*r, 2), rdef0); r 306 test/correctness/interleave.cpp define(output6(2*r+1, 2), rdef1); r 309 test/correctness/interleave.cpp define(output6(3*r, 3), cast<uint8_t>(7), elements); r 310 test/correctness/interleave.cpp define(output6(3*r+2, 3), cast<uint8_t>(9), elements); r 311 test/correctness/interleave.cpp define(output6(3*r+1, 3), cast<uint8_t>(8), elements); r 319 test/correctness/interleave.cpp output6.update(j).vectorize(r); r 30 test/correctness/lazy_convolution.cpp RDom r(-10, 20, -10, 20); r 31 test/correctness/lazy_convolution.cpp blur(x, y) = select(f(x, y) > 0, sum(f(x+r.x, y+r.y)), 0); r 13 test/correctness/legal_race_condition.cpp RDom r(0, 100); r 16 test/correctness/legal_race_condition.cpp f(r/2) = r/2; r 23 test/correctness/legal_race_condition.cpp f.update().allow_race_conditions().parallel(r); r 43 test/correctness/legal_race_condition.cpp RDom r(0, 256); r 44 test/correctness/legal_race_condition.cpp Expr permuted = (38*r*r + 193*r + 32) % 256; r 53 test/correctness/legal_race_condition.cpp f(permuted) = r; r 54 test/correctness/legal_race_condition.cpp f.update().allow_race_conditions().vectorize(r, 4).parallel(r); r 187 test/correctness/likely.cpp RDom r(0, 5); r 195 test/correctness/likely.cpp e[i] = e[i-1] * e[i-1] + y + r; r 205 test/correctness/likely.cpp g(c, x, y) = sum(select(nasty, likely(10), c + r)); r 186 test/correctness/logical.cpp Realization r = out.realize(input.width(), input.height(), target); r 187 test/correctness/logical.cpp Buffer<uint32_t> cpu_output = r[0]; r 188 test/correctness/logical.cpp Buffer<uint32_t> gpu_output = r[1]; r 60 test/correctness/many_small_extern_stages.cpp RDom r(0, 100); r 61 test/correctness/many_small_extern_stages.cpp h(x, y) += r * (g(x, y) - f(x, y)); r 383 test/correctness/memoize.cpp int r = rand() % 256; r 384 test/correctness/memoize.cpp val.set((float)r); r 389 test/correctness/memoize.cpp assert(out1(i, j) == (uint8_t)(3 * r + i + (i - 1) + (i + 1))); r 418 test/correctness/memoize.cpp int r = rand() % 256; r 419 test/correctness/memoize.cpp val.set((float)r); r 424 test/correctness/memoize.cpp assert(out1(i, j) == (uint8_t)(3 * r + i + (i - 1) + (i + 1))); r 441 test/correctness/memoize.cpp int r = rand() % 256; r 442 test/correctness/memoize.cpp val.set((float)r); r 447 test/correctness/memoize.cpp assert(out1(i, j) == (uint8_t)(3 * r + i + (i - 1) + (i + 1))); r 310 test/correctness/mul_div_mod.cpp Buffer<RT> r = f.realize(WIDTH, HEIGHT, target); r 317 test/correctness/mul_div_mod.cpp RT ri = r(i, j); r 397 test/correctness/mul_div_mod.cpp Buffer<T> r(R[1]); r 405 test/correctness/mul_div_mod.cpp T ri = r(i, j); r 24 test/correctness/multi_output_pipeline_with_bad_sizes.cpp Realization r(x_out, sin_x_out); r 25 test/correctness/multi_output_pipeline_with_bad_sizes.cpp f.realize(r); r 53 test/correctness/multi_pass_reduction.cpp RDom r(1, 10); r 54 test/correctness/multi_pass_reduction.cpp f(r) = f(r) + f(r-1); r 118 test/correctness/multi_pass_reduction.cpp RDom r(1, 99); r 119 test/correctness/multi_pass_reduction.cpp f(x, r) += f(x, r - 1); r 120 test/correctness/multi_pass_reduction.cpp f(r, y) += f(r - 1, y); r 128 test/correctness/multi_pass_reduction.cpp f.update(1).reorder(Var(r.x.name()), y).parallel(y); r 27 test/correctness/multi_way_select.cpp RDom r(0, 8); r 28 test/correctness/multi_way_select.cpp uint32_t err = evaluate_may_gpu<uint32_t>(sum(abs(g(r) - f(r)))); r 35 test/correctness/multiple_outputs.cpp RDom r(0, 100, 0, 100); r 40 test/correctness/multiple_outputs.cpp Expr next_value = f(r.x, r.y); r 42 test/correctness/multiple_outputs.cpp {r.x, r.y, next_value}, r 108 test/correctness/multiple_outputs.cpp Realization r = Pipeline({f, g}).realize(100); r 109 test/correctness/multiple_outputs.cpp Buffer<float> f_im = r[0]; r 110 test/correctness/multiple_outputs.cpp Buffer<uint8_t> g0_im = r[1]; r 111 test/correctness/multiple_outputs.cpp Buffer<int16_t> g1_im = r[2]; r 12 test/correctness/named_updates.cpp RDom r(0, 16); r 27 test/correctness/named_updates.cpp f(r*2) = 13, r 28 test/correctness/named_updates.cpp f(r*4) = 14 r 34 test/correctness/named_updates.cpp f(3*r) = 4, r 35 test/correctness/named_updates.cpp f(2*r) = 8, r 36 test/correctness/named_updates.cpp f(5*r) = 2 r 42 test/correctness/named_updates.cpp rewrites[0].parallel(r); r 43 test/correctness/named_updates.cpp rewrites[1].vectorize(r, 4); r 44 test/correctness/named_updates.cpp more_updates.a.vectorize(r, 4); r 45 test/correctness/named_updates.cpp more_updates.b.vectorize(r, 4); r 46 test/correctness/named_updates.cpp more_updates.c.vectorize(r, 4); r 54 test/correctness/named_updates.cpp ref(r*2) = 13; r 55 test/correctness/named_updates.cpp ref(r*4) = 14; r 56 test/correctness/named_updates.cpp ref(3*r) = 4; r 57 test/correctness/named_updates.cpp ref(2*r) = 8; r 58 test/correctness/named_updates.cpp ref(5*r) = 2; r 28 test/correctness/newtons_method.cpp RDom r(0, 10); r 30 test/correctness/newtons_method.cpp f() -= value/deriv + (r*0); r 50 test/correctness/newtons_method.cpp x0 += r*0; r 18 test/correctness/obscure_image_references.cpp RDom r(0, clamp(im2(j), 0, 99)); r 19 test/correctness/obscure_image_references.cpp f(r) = 37; r 10 test/correctness/parallel_rvar.cpp RDom r(0, 12, 0, 10); r 20 test/correctness/parallel_rvar.cpp f[i](r.x, r.y) += 1; r 21 test/correctness/parallel_rvar.cpp f[i](r.x, r.y) += f[i](r.x + 20, r.y); r 29 test/correctness/parallel_rvar.cpp f[0].update(0).tile(r.x, r.y, rxo, ryo, rxi, ryi, 4, 2).fuse(rxo, ryo, rt).parallel(rt); r 30 test/correctness/parallel_rvar.cpp f[0].update(1).parallel(r.x).parallel(r.y).unroll(r.y, 2); r 90 test/correctness/predicated_store_load.cpp RDom r(0, 100, 0, 100); r 91 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < r.x*r.y); r 94 test/correctness/predicated_store_load.cpp ref(r.x, r.y) += g(2*r.x, r.y) + g(2*r.x + 1, r.y); r 98 test/correctness/predicated_store_load.cpp f(r.x, r.y) += g(2*r.x, r.y) + g(2*r.x + 1, r.y); r 102 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 104 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 156 test/correctness/predicated_store_load.cpp RDom r(0, size, 0, size); r 157 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < 57); r 158 test/correctness/predicated_store_load.cpp r.where(r.x*r.y + r.x*r.x < 490); r 161 test/correctness/predicated_store_load.cpp ref(r.x, r.y) = g(size-r.x, r.y) * 2 + g(67-r.x, r.y); r 165 test/correctness/predicated_store_load.cpp f(r.x, r.y) = g(size-r.x, r.y) * 2 + g(67-r.x, r.y); r 169 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 171 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 190 test/correctness/predicated_store_load.cpp RDom r(0, 80, 0, 80); r 191 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < 48); r 194 test/correctness/predicated_store_load.cpp ref(r.x, r.y) += 1 + max(g(0, 1), g(2*r.x + 1, r.y)); r 198 test/correctness/predicated_store_load.cpp f(r.x, r.y) += 1 + max(g(0, 1), g(2*r.x + 1, r.y)); r 202 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 204 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 223 test/correctness/predicated_store_load.cpp RDom r(0, 80, 0, 80); r 224 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < 48); r 227 test/correctness/predicated_store_load.cpp ref(13, 13) = max(g(0, 1), g(2*r.x + 1, r.y)); r 231 test/correctness/predicated_store_load.cpp f(13, 13) = max(g(0, 1), g(2*r.x + 1, r.y)); r 237 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 239 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 258 test/correctness/predicated_store_load.cpp RDom r(0, 80, 0, 80, 0, 80); r 259 test/correctness/predicated_store_load.cpp r.where(r.z*r.z < 47); r 262 test/correctness/predicated_store_load.cpp ref(r.x, r.y, 1) = max(g(0, 1, 2), g(r.x + 1, r.y, 2)); r 266 test/correctness/predicated_store_load.cpp f(r.x, r.y, 1) = max(g(0, 1, 2), g(r.x + 1, r.y, 2)); r 272 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.z, 32); r 274 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.z, 32); r 290 test/correctness/predicated_store_load.cpp RDom r(0, 80, 0, 80); r 291 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < 47); r 294 test/correctness/predicated_store_load.cpp ref(2*r.x + 1, r.y) = ref(2*r.x + 1, r.y); r 295 test/correctness/predicated_store_load.cpp ref(2*r.x, 3*r.y) = ref(2*r.x, 3*r.y); r 299 test/correctness/predicated_store_load.cpp f(2*r.x + 1, r.y) = f(2*r.x + 1, r.y); r 300 test/correctness/predicated_store_load.cpp f(2*r.x, 3*r.y) = f(2*r.x, 3*r.y); r 304 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 305 test/correctness/predicated_store_load.cpp f.update(1).hexagon().vectorize(r.y, 32); r 307 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 308 test/correctness/predicated_store_load.cpp f.update(1).vectorize(r.y, 32); r 327 test/correctness/predicated_store_load.cpp RDom r(0, 100, 0, 100); r 328 test/correctness/predicated_store_load.cpp r.where(r.x + r.y < r.x*r.y); r 331 test/correctness/predicated_store_load.cpp ref(r.x, r.y) += abs(r.x*r.y) + g(2*r.x + 1, r.y); r 335 test/correctness/predicated_store_load.cpp f(r.x, r.y) += abs(r.x*r.y) + g(2*r.x + 1, r.y); r 339 test/correctness/predicated_store_load.cpp f.update(0).hexagon().vectorize(r.x, 32); r 341 test/correctness/predicated_store_load.cpp f.update(0).vectorize(r.x, 32); r 25 test/correctness/random.cpp RDom r(rand_image); r 26 test/correctness/random.cpp Expr val = g(r.x, r.y); r 33 test/correctness/random.cpp Expr dx = g(r.x, r.y) - g((r.x + 1) % 1024, r.y); r 34 test/correctness/random.cpp Expr dy = g(r.x, r.y) - g(r.x, (r.y + 1) % 1024); r 94 test/correctness/random.cpp RDom r(im1); r 95 test/correctness/random.cpp Expr v1 = im1(r.x, r.y); r 96 test/correctness/random.cpp Expr v2 = im2(r.x, r.y); r 97 test/correctness/random.cpp Expr v3 = im3(r.x, r.y); r 122 test/correctness/random.cpp RDom r(im); r 123 test/correctness/random.cpp Expr val = f(r.x, r.y); r 160 test/correctness/random.cpp RDom r(0, S, 0, S); r 161 test/correctness/random.cpp Expr f_val = f(r.x, r.y); r 162 test/correctness/random.cpp Expr g_val = g(r.x, r.y); r 16 test/correctness/realize_larger_than_two_gigs.cpp RDom r(0, extent, 0, extent, 0, extent, 0, extent/2 + 1); r 22 test/correctness/realize_larger_than_two_gigs.cpp grand_total() = cast<uint8_t>(sum(big(r.x, r.y, r.z, r.w))); r 85 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 86 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 87 test/correctness/reduction_non_rectangular.cpp r.where(!(r.x != 10)); r 88 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 1; r 114 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 115 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 116 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 1; r 119 test/correctness/reduction_non_rectangular.cpp f.update().reorder(r.y, r.x); r 120 test/correctness/reduction_non_rectangular.cpp f.update().split(r.x, rx_outer, rx_inner, 4); r 121 test/correctness/reduction_non_rectangular.cpp f.update().fuse(rx_inner, r.y, r_fused); r 147 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100, "r"); r 148 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y + z); r 149 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y, z) += 1; r 180 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100, "r"); r 181 test/correctness/reduction_non_rectangular.cpp r.where(r.x < g(r.y+10)); r 182 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 1; r 229 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100, "r"); r 230 test/correctness/reduction_non_rectangular.cpp r.where(r.x < g(r.y) + h(r.x)); r 231 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 1; r 260 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 261 test/correctness/reduction_non_rectangular.cpp r.where(2*r.x + 30 < r.y); r 262 test/correctness/reduction_non_rectangular.cpp r.where(r.y >= 100 - r.x); r 263 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 2*g(r.x, r.y); r 306 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 307 test/correctness/reduction_non_rectangular.cpp r.where(r.x*r.x + r.y*r.y <= 100); r 308 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += g(r.x, r.y); r 313 test/correctness/reduction_non_rectangular.cpp g.compute_at(f, r.y); r 349 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 350 test/correctness/reduction_non_rectangular.cpp r.where(p > 3); r 351 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 2*g(r.x, r.y); r 423 test/correctness/reduction_non_rectangular.cpp RDom r(0, 200, 0, 200); r 424 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 425 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) = g(r.x, r.y); r 429 test/correctness/reduction_non_rectangular.cpp g.compute_at(f, r.y); r 473 test/correctness/reduction_non_rectangular.cpp RDom r(0, 200, 0, 200, "r"); r 474 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 475 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += g(r.x, r.y); r 478 test/correctness/reduction_non_rectangular.cpp f.update(0).tile(r.x, r.y, rxi, ryi, 8, 8); r 479 test/correctness/reduction_non_rectangular.cpp f.update(0).reorder(rxi, ryi, r.x, r.y); r 575 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 576 test/correctness/reduction_non_rectangular.cpp r.where(f(r.x, r.y)[0]); r 577 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) = Tuple(f(r.x, r.y)[0], f(r.x, r.y)[1] + 10); r 612 test/correctness/reduction_non_rectangular.cpp RDom r(0, max_iters); r 614 test/correctness/reduction_non_rectangular.cpp r.where(not_converged); r 619 test/correctness/reduction_non_rectangular.cpp r+1}; r 621 test/correctness/reduction_non_rectangular.cpp Realization r = inverse.realize(128); r 622 test/correctness/reduction_non_rectangular.cpp Buffer<float> r0 = r[0]; r 623 test/correctness/reduction_non_rectangular.cpp Buffer<int> r1 = r[1]; r 650 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 651 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 652 test/correctness/reduction_non_rectangular.cpp r.where(!(r.x != 10)); r 653 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 3; r 682 test/correctness/reduction_non_rectangular.cpp RDom r(0, 100, 0, 100); r 683 test/correctness/reduction_non_rectangular.cpp r.where(!(r.x != 10)); r 684 test/correctness/reduction_non_rectangular.cpp r.where(r.x < r.y); r 685 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 3; r 688 test/correctness/reduction_non_rectangular.cpp f.update(0).gpu_tile(r.x, r.y, r.x, r.y, rxi, ryi, 4, 4); r 787 test/correctness/reduction_non_rectangular.cpp RDom r(1, w - 2, 1, h - 2); r 788 test/correctness/reduction_non_rectangular.cpp r.where((r.x + r.y) % 2 == 0); r 790 test/correctness/reduction_non_rectangular.cpp f(r.x, r.y) += 10; r 792 test/correctness/reduction_non_rectangular.cpp f.update(0).unroll(r.x, 2) r 793 test/correctness/reduction_non_rectangular.cpp .allow_race_conditions().vectorize(r.x, 8); r 25 test/correctness/reduction_schedule.cpp RDom r(0, noise.width(), 1, noise.height()-1); r 26 test/correctness/reduction_schedule.cpp Expr xm = max(r.x - 1, 0), xp = min(r.x + 1, noise.width() - 1); r 29 test/correctness/reduction_schedule.cpp energy(r.x, r.y) = noise(r.x, r.y) + min(energy(xm, r.y - 1), r 30 test/correctness/reduction_schedule.cpp energy(r.x, r.y - 1), r 31 test/correctness/reduction_schedule.cpp energy(xp, r.y - 1)); r 21 test/correctness/reduction_subregion.cpp RDom r(0, 20); r 23 test/correctness/reduction_subregion.cpp f(r) = f(r-1) + f(r+1); r 52 test/correctness/reorder_rvars.cpp RDom r(1, 99); r 53 test/correctness/reorder_rvars.cpp sat(x, r) += sat(x, r-1); r 54 test/correctness/reorder_rvars.cpp sat(r, y) += sat(r-1, y); r 58 test/correctness/reorder_rvars.cpp sat.update().split(x, xo, xi, 4).reorder(xi, r, xo).vectorize(xi).parallel(xo); r 21 test/correctness/rfactor.cpp RDom r(10, 20, 30, 40); r 22 test/correctness/rfactor.cpp g(r.x, r.y) = max(g(r.x, r.y) + f(r.x, r.y), g(r.x, r.y)); r 26 test/correctness/rfactor.cpp Func intm = g.update(0).rfactor(r.y, u); r 29 test/correctness/rfactor.cpp intm.update(0).vectorize(r.x, 2); r 61 test/correctness/rfactor.cpp RDom r(10, 20, 20, 30); r 67 test/correctness/rfactor.cpp g(r.x, r.y) += f(r.x, r.y); r 68 test/correctness/rfactor.cpp g.update(0).reorder({r.y, r.x}); r 71 test/correctness/rfactor.cpp g.update(0).split(r.x, rxo, rxi, 2); r 74 test/correctness/rfactor.cpp Func intm1 = g.update(0).rfactor({{rxo, u}, {r.y, v}}); r 75 test/correctness/rfactor.cpp Func intm2 = g.update(0).rfactor(r.y, v); r 110 test/correctness/rfactor.cpp RDom r(10, 20, 20, 30); r 116 test/correctness/rfactor.cpp g(r.x, r.y) += f(r.x, r.y); r 117 test/correctness/rfactor.cpp g.update(0).reorder({r.y, r.x}); r 122 test/correctness/rfactor.cpp g.update(0).split(r.x, rxo, rxi, 2); r 123 test/correctness/rfactor.cpp Func intm1 = g.update(0).rfactor({{rxo, u}, {r.y, v}}); r 125 test/correctness/rfactor.cpp g.update(0).split(r.y, ryo, ryi, 2, TailStrategy::GuardWithIf); r 163 test/correctness/rfactor.cpp RDom r(5, 10, 5, 10, 5, 10); r 167 test/correctness/rfactor.cpp g(r.x, r.y, r.z) += f(r.x, r.y, r.z); r 168 test/correctness/rfactor.cpp g.update(0).reorder({r.y, r.x}); r 171 test/correctness/rfactor.cpp g.update(0).fuse(r.x, r.y, rf); r 172 test/correctness/rfactor.cpp g.update(0).reorder({r.z, rf}); r 175 test/correctness/rfactor.cpp Func intm = g.update(0).rfactor(r.z, u); r 178 test/correctness/rfactor.cpp intm.compute_at(g, r.z); r 215 test/correctness/rfactor.cpp RDom r(5, 10, 5, 10, 5, 10); r 230 test/correctness/rfactor.cpp Expr x_clamped = clamp(a(r.x, r.y, r.z), 0, 19); r 231 test/correctness/rfactor.cpp Expr y_clamped = clamp(b(r.x, r.y, r.z), 0, 29); r 232 test/correctness/rfactor.cpp f(x_clamped, y_clamped) += c(r.x, r.y, r.z); r 242 test/correctness/rfactor.cpp Expr x_clamped = clamp(a(r.x, r.y, r.z), 0, 19); r 243 test/correctness/rfactor.cpp Expr y_clamped = clamp(b(r.x, r.y, r.z), 0, 29); r 244 test/correctness/rfactor.cpp f(x_clamped, y_clamped) += c(r.x, r.y, r.z); r 251 test/correctness/rfactor.cpp Func intm = f.update(0).rfactor({{r.x, u}, {r.y, v}}); r 252 test/correctness/rfactor.cpp intm.update(0).split(r.z, rzo, rzi, 2); r 293 test/correctness/rfactor.cpp RDom r(10, 20, 30, 40); r 294 test/correctness/rfactor.cpp g(r.x, r.y) = min(f(r.x, r.y) + 2, g(r.x, r.y)); r 298 test/correctness/rfactor.cpp Func intm = g.update(0).specialize(p >= 10).rfactor(r.y, u); r 301 test/correctness/rfactor.cpp intm.update(0).vectorize(r.x, 2); r 351 test/correctness/rfactor.cpp RDom r(5, 10, 5, 10, 0, 20); r 352 test/correctness/rfactor.cpp r.where(r.x < r.y); r 353 test/correctness/rfactor.cpp r.where(r.x + 2*r.y <= r.z); r 354 test/correctness/rfactor.cpp g(r.x, r.y, r.z) += f(r.x, r.y, r.z); r 357 test/correctness/rfactor.cpp Func intm = g.update(0).rfactor({{r.y, u}, {r.x, v}}); r 361 test/correctness/rfactor.cpp intm.update(0).vectorize(r.z, 2); r 411 test/correctness/rfactor.cpp RDom r(in); r 413 test/correctness/rfactor.cpp hist(clamp(cast<int>(in(r.x, r.y)), 0, 255)) += 1; r 417 test/correctness/rfactor.cpp Func intm = hist.update(0).rfactor(r.y, u); r 462 test/correctness/rfactor.cpp RDom r(0, size); r 466 test/correctness/rfactor.cpp dot_ref() += a(r.x)*b(r.x); r 471 test/correctness/rfactor.cpp dot() += a(r.x)*b(r.x); r 473 test/correctness/rfactor.cpp dot.update(0).split(r.x, rxo, rxi, 128); r 523 test/correctness/rfactor.cpp RDom r(10, 20, 30, 40); r 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])); r 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])); r 538 test/correctness/rfactor.cpp Func intm1 = g.update(0).rfactor(r.y, u); r 541 test/correctness/rfactor.cpp intm1.update(0).split(r.x, rxo, rxi, 2); r 600 test/correctness/rfactor.cpp RDom r(5, 20, 5, 20, 5, 20); r 601 test/correctness/rfactor.cpp r.where(r.x*r.x + r.z*r.z <= 200); r 602 test/correctness/rfactor.cpp r.where(r.y*r.z + r.z*r.z > 100); r 606 test/correctness/rfactor.cpp ref(x, y) = Tuple(ref(x, y)[0]*f(r.x, r.y, r.z)[0], ref(x, y)[1] + 2*f(r.x, r.y, r.z)[1]); r 611 test/correctness/rfactor.cpp g(x, y) = Tuple(g(x, y)[0]*f(r.x, r.y, r.z)[0], g(x, y)[1] + 2*f(r.x, r.y, r.z)[1]); r 617 test/correctness/rfactor.cpp Func intm1 = g.update(0).specialize(p >= 5).rfactor({{r.y, v}, {r.z, w}}); r 622 test/correctness/rfactor.cpp intm1.update(0).split(r.x, rxo, rxi, 2); r 626 test/correctness/rfactor.cpp Func intm4 = g.update(0).rfactor({{r.x, u}, {r.z, w}}).compute_root(); r 758 test/correctness/rfactor.cpp RDom r(10, inner_extent, 30, outer_extent); r 763 test/correctness/rfactor.cpp ref(x, y) = Tuple(ref(x, y)[0]*f(r.x, r.y)[0] - ref(x, y)[1]*f(r.x, r.y)[1], r 764 test/correctness/rfactor.cpp ref(x, y)[0]*f(r.x, r.y)[1] + ref(x, y)[1]*f(r.x, r.y)[0]); r 767 test/correctness/rfactor.cpp g(x, y) = Tuple(g(x, y)[0]*f(r.x, r.y)[0] - g(x, y)[1]*f(r.x, r.y)[1], r 768 test/correctness/rfactor.cpp g(x, y)[0]*f(r.x, r.y)[1] + g(x, y)[1]*f(r.x, r.y)[0]); r 771 test/correctness/rfactor.cpp g.update(0).split(r.x, rxo, rxi, 2); r 810 test/correctness/rfactor.cpp RDom r(10, inner_extent, 30, outer_extent); r 815 test/correctness/rfactor.cpp ref() = Tuple(min(ref()[0], f(r.x, r.y)), r 816 test/correctness/rfactor.cpp select(ref()[0] < f(r.x, r.y), ref()[1], r.x), r 817 test/correctness/rfactor.cpp select(ref()[0] < f(r.x, r.y), ref()[2], r.y)); r 820 test/correctness/rfactor.cpp g() = Tuple(min(g()[0], f(r.x, r.y)), r 821 test/correctness/rfactor.cpp select(g()[0] < f(r.x, r.y), g()[1], r.x), r 822 test/correctness/rfactor.cpp select(g()[0] < f(r.x, r.y), g()[2], r.y)); r 825 test/correctness/rfactor.cpp g.update(0).split(r.x, rxo, rxi, 2); r 881 test/correctness/rfactor.cpp RDom r(0, 31); r 884 test/correctness/rfactor.cpp g(r.x) += f(r.x); r 887 test/correctness/rfactor.cpp g.update(0).split(r.x, rxo, rxi, 2); r 901 test/correctness/rfactor.cpp RDom r(0, 8, 0, 8); r 912 test/correctness/rfactor.cpp ref(input(r.x, r.y) % 8) += 1; r 915 test/correctness/rfactor.cpp f(input(r.x, r.y) % 8) += 1; r 919 test/correctness/rfactor.cpp .rfactor({{r.x, u}, {r.y, v}}) r 11 test/correctness/scatter.cpp RDom r(-10, 20); r 13 test/correctness/scatter.cpp f(r, y) = f(r-1, y) + 100; r 100 test/correctness/side_effects.cpp RDom r(-45, 71, -10, 21); r 102 test/correctness/side_effects.cpp render() += draw_pixel(r.x, r.y, count(r.x, r.y)); r 104 test/correctness/side_effects.cpp mandelbrot.compute_at(render, r.x); r 113 test/correctness/simd_op_check.cpp Expr r; r 115 test/correctness/simd_op_check.cpp r = cast(p.type(), random_float() * 1024 - 512); r 120 test/correctness/simd_op_check.cpp r = cast(p.type(), random_int() / 4); r 122 test/correctness/simd_op_check.cpp lambda(x, y, r).realize(b); r 205 test/correctness/simd_op_check.cpp RDom r(0, W, 0, H); r 207 test/correctness/simd_op_check.cpp error() = cast<double>(maximum(absd(f(r.x, r.y), f_scalar(r.x, r.y)))); r 243 test/correctness/simd_op_check.cpp Realization r = error.realize(target.without_feature(Target::NoRuntime)); r 244 test/correctness/simd_op_check.cpp double e = Buffer<double>(r[0])(); r 95 test/correctness/sliding_window.cpp RDom r(0, 100); r 99 test/correctness/sliding_window.cpp f(r, y) = call_counter(r, y); r 289 test/correctness/specialize.cpp RDom r(start, size); r 292 test/correctness/specialize.cpp f(r) = 10 - r; r 44 test/correctness/specialize_to_gpu.cpp RDom r(out); r 45 test/correctness/specialize_to_gpu.cpp uint32_t err = evaluate<uint32_t>(sum(abs(out(r) - reference(r)))); r 33 test/correctness/split_by_non_factor.cpp RDom r(0, sum_size); r 34 test/correctness/split_by_non_factor.cpp f(0) += f(r); r 37 test/correctness/split_by_non_factor.cpp f.update(1).unroll(r, 4); r 16 test/correctness/split_fuse_rvar.cpp RDom r(0, 4, 0, 4); r 17 test/correctness/split_fuse_rvar.cpp g(r.x, r.y) = f(r.y*4 + r.x); r 20 test/correctness/split_fuse_rvar.cpp g.update(0).fuse(r.x, r.y, rxy).split(rxy, rxyo, rxyi, 2); r 43 test/correctness/split_fuse_rvar.cpp RDom r(0, 16); r 44 test/correctness/split_fuse_rvar.cpp g(r) = f(r); r 47 test/correctness/split_fuse_rvar.cpp g.update(0).split(r, ro, ri, 2).fuse(ro, ri, roi); r 17 test/correctness/stream_compaction.cpp RDom r(0, 1000); r 18 test/correctness/stream_compaction.cpp cum_sum(r+1) = f(r) + cum_sum(r); r 27 test/correctness/stream_compaction.cpp Expr bin = clamp(cum_sum(r), 0, 1000); r 30 test/correctness/stream_compaction.cpp ones(bin) = select(f(r) == 1, r, undef<int>()); r 35 test/correctness/stream_compaction.cpp ones.update().allow_race_conditions().parallel(r, 50); r 122 test/correctness/trim_no_ops.cpp RDom r(0, 10, 0, 10, 0, 10, 0, 10); r 123 test/correctness/trim_no_ops.cpp Expr xi = r[0] + r[2]*10, yi = r[1] + r[3]*10; r 141 test/correctness/trim_no_ops.cpp RDom r(0, 74, 0, 74); r 143 test/correctness/trim_no_ops.cpp true_hist(f(r.x, r.y)) += 1; r 191 test/correctness/trim_no_ops.cpp RDom r(0, 100, 0, 100); r 192 test/correctness/trim_no_ops.cpp f(r.x, r.y) += select((r.x < r.y) && (r.x == 10), 3, undef<int>()); r 195 test/correctness/trim_no_ops.cpp f.update(0).gpu_tile(r.x, r.y, rxi, ryi, 4, 4); r 108 test/correctness/tuple_undef.cpp RDom r(0, 10); r 109 test/correctness/tuple_undef.cpp Expr arg_0 = clamp(select(r.x < 2, 13, undef<int>()), 0, 100); r 110 test/correctness/tuple_undef.cpp Expr arg_1 = clamp(select(r.x < 2, 23, undef<int>()), 0, 100); r 11 test/correctness/undef.cpp RDom r(2, 100); r 16 test/correctness/undef.cpp f1(r) = f1(r-1) + f1(r-2); r 41 test/correctness/undef.cpp f2(r) = f2(r-1) + f2(r-2); r 45 test/correctness/undef.cpp int err = evaluate_may_gpu<int>(maximum(fib1(r) - fib2(r))); r 16 test/correctness/unrolled_reduction.cpp RDom r(0, 32); r 19 test/correctness/unrolled_reduction.cpp g(r.x, y) += noise(r.x); r 24 test/correctness/unrolled_reduction.cpp g.compute_at(f, y).update().split(r.x, rxo, rxi, 2).unroll(rxi); r 19 test/correctness/unsafe_dedup_lets.cpp RDom r(0, a); r 25 test/correctness/unsafe_dedup_lets.cpp r.where(b != 0); r 26 test/correctness/unsafe_dedup_lets.cpp f() = {b, a % b, r}; r 37 test/correctness/unsafe_dedup_lets.cpp f.update().unroll(r, 4); r 11 test/correctness/update_chunk.cpp RDom r(0, 10); r 15 test/correctness/update_chunk.cpp g(x, r) = f(r, x)+1; r 17 test/correctness/update_chunk.cpp f.compute_at(g, r); r 18 test/correctness/vectorize_mixed_widths.cpp Buffer<int> r = g.realize(16); r 20 test/correctness/vectorize_mixed_widths.cpp if (r(i) != i) { r 21 test/correctness/vectorize_mixed_widths.cpp std::cout << "Error at " << i << ": " << r(i) << std::endl; r 17 test/correctness/vectorized_initialization.cpp RDom r(0, 4); r 20 test/correctness/vectorized_initialization.cpp f(r) = f(r-1) + f(r+1); r 16 test/correctness/vectorized_load_from_vectorized_allocation.cpp RDom r(0, size, 0, size, 0, size); r 17 test/correctness/vectorized_load_from_vectorized_allocation.cpp f(r.x, r.y, r.z) += 2*g(r.x*r.z, r.y, r.z); r 19 test/correctness/vectorized_load_from_vectorized_allocation.cpp f.update(0).vectorize(r.z, 8); r 21 test/correctness/vectorized_load_from_vectorized_allocation.cpp g.compute_at(f, r.y); r 11 test/correctness/vectorized_reduction_bug.cpp RDom r(1, 2, "r"); r 14 test/correctness/vectorized_reduction_bug.cpp sum(x, y) += r.x; r 28 test/correctness/widening_reduction.cpp RDom r(-1, 3, -1, 3); r 37 test/correctness/widening_reduction.cpp f(x, y) = u8_sat(sum(i16(input(x + r.x, y + r.y)) * kernel(r.x, r.y)) / 16); r 74 test/correctness/widening_reduction.cpp f(x, y)[0] + i16(input(x + r.x, y + r.y)) * kernel(r.x, r.y), r 75 test/correctness/widening_reduction.cpp f(x, y)[1] + kernel(r.x, r.y), r 233 test/correctness/wrap.cpp RDom r(0, 100, 0, 100); r 234 test/correctness/wrap.cpp r.where(r.x < r.y); r 235 test/correctness/wrap.cpp g(r.x, r.y) += 2*f(r.x, r.y); r 242 test/correctness/wrap.cpp g.update(0).split(r.x, rxo, rxi, 2).unroll(rxi); r 481 test/correctness/wrap.cpp RDom r(0, 100, 0, 100); r 482 test/correctness/wrap.cpp r.where(f(r.x, r.y) + h(r.x, r.y) < 50); r 483 test/correctness/wrap.cpp g(r.x, r.y) += h(r.x, r.y); r 485 test/correctness/wrap.cpp Func h_wrapper = h.in().store_root().compute_at(g, r.y); r 486 test/correctness/wrap.cpp Func f_in_g = f.in(g).compute_at(g, r.x); r 9 test/error/expanding_reduction.cpp RDom r(0, 100); r 20 test/error/expanding_reduction.cpp f(r, y) = f(r, y-1) + f(r, y+1); r 10 test/error/init_def_should_be_all_vars.cpp RDom r(0, in.width(), 0, in.height()); r 11 test/error/init_def_should_be_all_vars.cpp f(r.x, r.y) = in(r.x, r.y) + 2; r 13 test/error/race_condition.cpp RDom r(0, 10, 0, 10); r 14 test/error/race_condition.cpp f(r.x, r.y) += f(r.y, r.x); r 17 test/error/race_condition.cpp f.update().parallel(r.y); r 15 test/error/realize_constantly_larger_than_two_gigs.cpp RDom r(0, 4096, 0, 4096, 0, 256); r 22 test/error/realize_constantly_larger_than_two_gigs.cpp grand_total() = cast<uint8_t>(sum(big(r.x, r.y, r.z))); r 9 test/error/reduction_bounds.cpp RDom r(0, 100, "r"); r 14 test/error/reduction_bounds.cpp g(x) = f(g(x-1)) + r; r 16 test/error/reduction_bounds.cpp f.compute_at(g, r.x); r 14 test/error/rfactor_inner_dim_non_commutative.cpp RDom r(10, inner_extent, 30, outer_extent); r 19 test/error/rfactor_inner_dim_non_commutative.cpp g(x, y) -= f(r.x, r.y); r 25 test/error/rfactor_inner_dim_non_commutative.cpp g.update(0).rfactor(r.x, u); r 13 test/error/tuple_arg_select_undef.cpp RDom r(0, 10); r 14 test/error/tuple_arg_select_undef.cpp Expr arg_0 = clamp(select(r.x < 2, 13, undef<int>()), 0, 20); r 15 test/error/tuple_arg_select_undef.cpp Expr arg_1 = clamp(select(r.x < 5, 23, undef<int>()), 0, 20); r 15 test/error/unbounded_output.cpp RDom r(0, 100, 0, 100); r 16 test/error/unbounded_output.cpp f(x_coord(r.x, r.y), y_coord(r.x, r.y)) += in(r.x, r.y); r 17 test/error/undefined_rdom_dimension.cpp RDom r(1, 99, "r"); r 21 test/error/undefined_rdom_dimension.cpp f(r.x, r.y, c) = f(r.x-1, r.y, c) + h(r.x, r.y, c); r 82 test/generator/cxx_mangling_aottest.cpp int r = HalideTest::cxx_mangling(input, -1, 0xff, -1, 0xffff, -1, 0xffffffff, r 87 test/generator/cxx_mangling_aottest.cpp if (r != 0) { r 59 test/generator/cxx_mangling_define_extern_aottest.cpp int r = HalideTest::cxx_mangling_define_extern(user_context, input, int_ptr, const_int_ptr, r 62 test/generator/cxx_mangling_define_extern_aottest.cpp if (r != 0) { r 16 test/generator/msan_generator.cpp RDom r(0, 4); r 17 test/generator/msan_generator.cpp msan_output(x, y, c) = sum(msan_extern_stage(r, y, c)); r 20 test/generator/msan_generator.cpp msan_output(r, y, c) += 1; r 21 test/generator/msan_generator.cpp msan_output(x, r, c) += 2; r 23 test/opengl/conv_select.cpp RDom r(0, 2, "r"); r 26 test/opengl/conv_select.cpp Expr coordx = clamp(x + r, 0, input.width() - 1); r 14 test/opengl/inline_reduction.cpp RDom r(0, 10); r 15 test/opengl/inline_reduction.cpp f(x, y, c) = sum(cast<float>(r)); r 32 test/opengl/special_funcs.cpp bool test_exact(Expr r, Expr g, Expr b) { r 33 test/opengl/special_funcs.cpp Expr e = cast<T>(select(c == T(0), r, r 63 test/opengl/special_funcs.cpp bool test_approx(Expr r, Expr g, Expr b, double rms_error) { r 64 test/opengl/special_funcs.cpp Expr e = cast<T>(select(c == 0, r, c == 1, g, b)); r 118 test/opengl/special_funcs.cpp Expr r = (256 * x + y) / ceilf(65536.f / (2 * 3.1415926536f)); r 119 test/opengl/special_funcs.cpp if (!test_approx<float>(sin(r), cos(r), 0, 5e-2)) { r 21 test/opengl/sum_reduction.cpp RDom r(0, 5, "r"); r 23 test/opengl/sum_reduction.cpp Expr coordx = clamp(x + r, 0, input.width() - 1); r 24 test/opengl/sum_reduction.cpp g(x, y, c) = cast<float>(sum(input(coordx, y, c)) / sum(r) * 255.0f); r 36 test/opengl/sum_reduction.cpp for (int r = 0; r < 5; r++) { r 37 test/opengl/sum_reduction.cpp temp += input(std::min(x + r, input.width() - 1), y, c); r 21 test/opengl/sumcolor_reduction.cpp RDom r(0, 3, "r"); r 24 test/opengl/sumcolor_reduction.cpp g(x, y, c) = sum(input(x, y, r)); r 48 test/performance/boundary_conditions.cpp RDom r(-blur_radius, 2*blur_radius+1, -blur_radius, 2*blur_radius+1); r 49 test/performance/boundary_conditions.cpp g(x, y) = sum(f(x + r.x, y + r.y)); r 16 test/performance/fast_inverse.cpp RDom r(0, N); r 19 test/performance/fast_inverse.cpp slow(x) = p / (slow(x) + 1) + 0*r; r 20 test/performance/fast_inverse.cpp fast(x) = fast_inverse((fast(x) + 1) + 0*r); r 57 test/performance/fast_pow.cpp RDom r(correct_result); r 59 test/performance/fast_pow.cpp Expr fast_delta = correct_result(r.x, r.y) - fast_result(r.x, r.y); r 60 test/performance/fast_pow.cpp Expr faster_delta = correct_result(r.x, r.y) - faster_result(r.x, r.y); r 40 test/performance/profiler.cpp RDom r(0, iters); r 41 test/performance/profiler.cpp out(c, x) += r*f[29](c, x); r 45 test/performance/profiler.cpp out.update().reorder(c, x, r); r 18 test/performance/rfactor.cpp RDom r(0, size); r 22 test/performance/rfactor.cpp max_ref() = max(max_ref(), abs(A(r))); r 27 test/performance/rfactor.cpp maxf() = max(maxf(), abs(A(r))); r 28 test/performance/rfactor.cpp maxf.update().split(r.x, rxo, rxi, 4*8192); r 86 test/performance/rfactor.cpp RDom r(0, W, 0, H); r 89 test/performance/rfactor.cpp ref(in(r.x, r.y)) += 1; r 92 test/performance/rfactor.cpp hist(in(r.x, r.y)) += 1; r 98 test/performance/rfactor.cpp .split(r.y, ryo, ryi, 16) r 136 test/performance/rfactor.cpp RDom r(0, size, 0, size, 0, size, 0, size); r 139 test/performance/rfactor.cpp ref() = Tuple(min(ref()[0], input(r.x, r.y, r.y, r.z)), r 140 test/performance/rfactor.cpp select(ref()[0] < input(r.x, r.y, r.y, r.z), ref()[1], r.x), r 141 test/performance/rfactor.cpp select(ref()[0] < input(r.x, r.y, r.y, r.z), ref()[2], r.y), r 142 test/performance/rfactor.cpp select(ref()[0] < input(r.x, r.y, r.z, r.w), ref()[3], r.z), r 143 test/performance/rfactor.cpp select(ref()[0] < input(r.x, r.y, r.z, r.w), ref()[4], r.w)); r 146 test/performance/rfactor.cpp amin() = Tuple(min(amin()[0], input(r.x, r.y, r.z, r.w)), r 147 test/performance/rfactor.cpp select(amin()[0] < input(r.x, r.y, r.z, r.w), amin()[1], r.x), r 148 test/performance/rfactor.cpp select(amin()[0] < input(r.x, r.y, r.z, r.w), amin()[2], r.y), r 149 test/performance/rfactor.cpp select(amin()[0] < input(r.x, r.y, r.z, r.w), amin()[3], r.z), r 150 test/performance/rfactor.cpp select(amin()[0] < input(r.x, r.y, r.z, r.w), amin()[4], r.w)); r 153 test/performance/rfactor.cpp Func intm1 = amin.update(0).rfactor(r.w, u); r 159 test/performance/rfactor.cpp Func intm2 = intm1.update(0).split(r.x, rxo, rxi, 16).rfactor(rxi, v); r 210 test/performance/rfactor.cpp RDom r(0, size); r 213 test/performance/rfactor.cpp ref() = Tuple(ref()[0]*input0(r.x) - ref()[1]*input1(r.x), r 214 test/performance/rfactor.cpp ref()[0]*input1(r.x) + ref()[1]*input0(r.x)); r 217 test/performance/rfactor.cpp mult() = Tuple(mult()[0]*input0(r.x) - mult()[1]*input1(r.x), r 218 test/performance/rfactor.cpp mult()[0]*input1(r.x) + mult()[1]*input0(r.x)); r 221 test/performance/rfactor.cpp mult.update(0).split(r.x, rxo, rxi, 2*8192); r 278 test/performance/rfactor.cpp RDom r(0, size); r 283 test/performance/rfactor.cpp dot_ref() += (A(r.x))*B(r.x); r 287 test/performance/rfactor.cpp dot() += (A(r.x))*B(r.x); r 289 test/performance/rfactor.cpp dot.update().split(r.x, rxo, rxi, 4*8192); r 343 test/performance/rfactor.cpp RDom r(0, size); r 347 test/performance/rfactor.cpp sink_ref() = {sink_ref()[0] * A(r), // Product r 348 test/performance/rfactor.cpp sink_ref()[1] + A(r), // Sum r 349 test/performance/rfactor.cpp max(sink_ref()[2], A(r)), // Max r 350 test/performance/rfactor.cpp select(sink_ref()[2] > A(r), sink_ref()[3], r), // Argmax r 351 test/performance/rfactor.cpp min(sink_ref()[4], A(r)), // Min r 352 test/performance/rfactor.cpp select(sink_ref()[4] < A(r), sink_ref()[5], r), // Argmin r 353 test/performance/rfactor.cpp sink_ref()[6] + A(r)*A(r), // Sum of squares r 354 test/performance/rfactor.cpp sink_ref()[7] + select(A(r) % 2 == 0, 1, 0) // Number of even items r 359 test/performance/rfactor.cpp sink() = {sink()[0] * A(r), // Product r 360 test/performance/rfactor.cpp sink()[1] + A(r), // Sum r 361 test/performance/rfactor.cpp max(sink()[2], A(r)), // Max r 362 test/performance/rfactor.cpp select(sink()[2] > A(r), sink()[3], r), // Argmax r 363 test/performance/rfactor.cpp min(sink()[4], A(r)), // Min r 364 test/performance/rfactor.cpp select(sink()[4] < A(r), sink()[5], r), // Argmin r 365 test/performance/rfactor.cpp sink()[6] + A(r)*A(r), // Sum of squares r 366 test/performance/rfactor.cpp sink()[7] + select(A(r) % 2 == 0, 1, 0) // Number of even items r 370 test/performance/rfactor.cpp sink.update().split(r.x, rxo, rxi, 8192); r 106 test/performance/sort.cpp RDom r(0, chunk_size*2); r 113 test/performance/sort.cpp Expr candidate_a = merge_rows(r-1, y)[0]; r 114 test/performance/sort.cpp Expr candidate_b = merge_rows(r-1, y)[1]; r 119 test/performance/sort.cpp merge_rows(r, y) = tuple_select(valid_a && ((value_a < value_b) || !valid_b), r 33 test/performance/vectorize_pred.cpp RDom r(0, W, 0, H); r 34 test/performance/vectorize_pred.cpp r.where((r.x*r.y) % 8 < 7); r 36 test/performance/vectorize_pred.cpp Expr e = input(r.x, r.y); r 38 test/performance/vectorize_pred.cpp e = e + input(r.x, r.y+i); r 42 test/performance/vectorize_pred.cpp e = e + input(r.x, r.y+i); r 46 test/performance/vectorize_pred.cpp f(r.x, r.y) = e; r 48 test/performance/vectorize_pred.cpp g(r.x, r.y) = e; r 49 test/performance/vectorize_pred.cpp f.update(0).vectorize(r.x); r 25 tools/find_inverse.cpp uint64_t num = r(0, max); r 40 tools/find_inverse.cpp uint64_t num = r(0, max); r 58 tools/find_inverse.cpp uint64_t num = r(0, max); r 78 tools/find_inverse.cpp int64_t num = r(min, max); r 94 tools/find_inverse.cpp int64_t num = r(min, max); r 152 tutorial/lesson_09_update_definitions.cpp RDom r(0, 50); r 153 tutorial/lesson_09_update_definitions.cpp f(x, r) = f(x, r) * f(x, r); r 166 tutorial/lesson_09_update_definitions.cpp for (int r = 0; r < 50; r++) { r 170 tutorial/lesson_09_update_definitions.cpp c_result[r][x] = c_result[r][x] * c_result[r][x]; r 201 tutorial/lesson_09_update_definitions.cpp RDom r(0, input.width(), 0, input.height()); r 206 tutorial/lesson_09_update_definitions.cpp histogram(input(r.x, r.y)) += 1; r 598 tutorial/lesson_09_update_definitions.cpp RDom r(0, 5); r 601 tutorial/lesson_09_update_definitions.cpp consumer(x) += r + producer(x + r); r 603 tutorial/lesson_09_update_definitions.cpp producer.compute_at(consumer, r); r 618 tutorial/lesson_09_update_definitions.cpp for (int r = 0; r < 5; r++) { r 623 tutorial/lesson_09_update_definitions.cpp producer_storage[0] = (x + r) % 8; r 626 tutorial/lesson_09_update_definitions.cpp c_result[x] += r + producer_storage[0]; r 654 tutorial/lesson_09_update_definitions.cpp RDom r(-2, 5, -2, 5); r 659 tutorial/lesson_09_update_definitions.cpp local_sum(x, y) += clamped(x + r.x, y + r.y); r 713 tutorial/lesson_09_update_definitions.cpp RDom r(0, 100); r 714 tutorial/lesson_09_update_definitions.cpp f1(x) = sum(r + x) * 7; r 720 tutorial/lesson_09_update_definitions.cpp anon(x) += r + x; r 735 tutorial/lesson_09_update_definitions.cpp for (int r = 0; r < 100; r++) { r 736 tutorial/lesson_09_update_definitions.cpp anon[0] += r + x; r 89 tutorial/lesson_13_tuples.cpp Realization r = multi_valued.realize(80, 60); r 90 tutorial/lesson_13_tuples.cpp assert(r.size() == 2); r 91 tutorial/lesson_13_tuples.cpp Buffer<int> im0 = r[0]; r 92 tutorial/lesson_13_tuples.cpp Buffer<float> im1 = r[1]; r 155 tutorial/lesson_13_tuples.cpp RDom r(1, 99); r 158 tutorial/lesson_13_tuples.cpp Expr new_index = select(old_max < input(r), r, old_index); r 159 tutorial/lesson_13_tuples.cpp Expr new_max = max(input(r), old_max); r 165 tutorial/lesson_13_tuples.cpp for (int r = 1; r < 100; r++) { r 168 tutorial/lesson_13_tuples.cpp int new_index = old_max < input(r) ? r : old_index; r 169 tutorial/lesson_13_tuples.cpp float new_max = std::max(input(r), old_max); r 181 tutorial/lesson_13_tuples.cpp Realization r = arg_max.realize(); r 182 tutorial/lesson_13_tuples.cpp Buffer<int> r0 = r[0]; r 183 tutorial/lesson_13_tuples.cpp Buffer<float> r1 = r[1]; r 209 tutorial/lesson_13_tuples.cpp Complex(Expr r, Expr i) : real(r), imag(i) {} r 251 tutorial/lesson_13_tuples.cpp RDom r(1, 12); r 252 tutorial/lesson_13_tuples.cpp Complex current = mandelbrot(x, y, r-1); r 256 tutorial/lesson_13_tuples.cpp mandelbrot(x, y, r) = current*current + initial; r 266 tutorial/lesson_13_tuples.cpp Expr escape_condition = Complex(mandelbrot(x, y, r)).magnitude() < 16.0f; r 45 tutorial/lesson_17_predicated_rdom.cpp RDom r(0, 7, 0, 7); r 58 tutorial/lesson_17_predicated_rdom.cpp r.where((r.x - 3)*(r.x - 3) + (r.y - 3)*(r.y - 3) <= 10); r 61 tutorial/lesson_17_predicated_rdom.cpp circle(r.x, r.y) *= 2; r 106 tutorial/lesson_17_predicated_rdom.cpp RDom r(0, 8, 0, 10); r 109 tutorial/lesson_17_predicated_rdom.cpp r.where(r.x + r.y > 5); r 110 tutorial/lesson_17_predicated_rdom.cpp r.where(3*r.y - 2*r.x < 15); r 111 tutorial/lesson_17_predicated_rdom.cpp r.where(4*r.x - r.y < 20); r 117 tutorial/lesson_17_predicated_rdom.cpp triangle(r.x, r.y) *= 2; r 45 tutorial/lesson_18_parallel_associative_reductions.cpp RDom r(0, input.width(), 0, input.height()); r 46 tutorial/lesson_18_parallel_associative_reductions.cpp histogram(input(r.x, r.y) / 32) += 1; r 119 tutorial/lesson_18_parallel_associative_reductions.cpp RDom r(0, input.width(), 0, input.height()); r 120 tutorial/lesson_18_parallel_associative_reductions.cpp histogram(input(r.x, r.y) / 32) += 1; r 136 tutorial/lesson_18_parallel_associative_reductions.cpp Func intermediate = histogram.update().rfactor({{r.y, y}}); r 204 tutorial/lesson_18_parallel_associative_reductions.cpp RDom r(0, input.width(), 0, input.height()); r 205 tutorial/lesson_18_parallel_associative_reductions.cpp histogram(input(r.x, r.y) / 32) += 1; r 209 tutorial/lesson_18_parallel_associative_reductions.cpp Func intermediate = histogram.update().rfactor(r.x, u); r 272 tutorial/lesson_18_parallel_associative_reductions.cpp RDom r(0, input.width(), 0, input.height()); r 273 tutorial/lesson_18_parallel_associative_reductions.cpp histogram(input(r.x, r.y) / 32) += 1; r 279 tutorial/lesson_18_parallel_associative_reductions.cpp .split(r.x, rx_outer, rx_inner, 4) r 280 tutorial/lesson_18_parallel_associative_reductions.cpp .split(r.y, ry_outer, ry_inner, 4); r 593 util/HalideTraceViz.cpp int r = atoi(argv[++i]); r 596 util/HalideTraceViz.cpp config.uninitialized_memory_color = (255 << 24) | ((b & 255) << 16) | ((g & 255) << 8) | (r & 255);