bounds 39 src/AllocationBoundsInference.cpp Box required(op->bounds.size()); bounds 51 src/AllocationBoundsInference.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, new_body); bounds 53 src/AllocationBoundsInference.cpp internal_assert(b.size() == op->bounds.size()); bounds 58 src/AllocationBoundsInference.cpp for (size_t j = 0; j < f.schedule().bounds().size(); j++) { bounds 59 src/AllocationBoundsInference.cpp Bound b = f.schedule().bounds()[j]; bounds 8 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 10 src/BoundaryConditions.cpp user_assert(args.size() >= bounds.size()) << bounds 11 src/BoundaryConditions.cpp "repeat_edge called with more bounds (" << bounds.size() << bounds 16 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 18 src/BoundaryConditions.cpp Expr min = bounds[i].first; bounds 19 src/BoundaryConditions.cpp Expr extent = bounds[i].second; bounds 41 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 44 src/BoundaryConditions.cpp user_assert(args.size() >= bounds.size()) << bounds 45 src/BoundaryConditions.cpp "constant_exterior called with more bounds (" << bounds.size() << bounds 50 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 52 src/BoundaryConditions.cpp Expr min = bounds[i].first; bounds 53 src/BoundaryConditions.cpp Expr extent = bounds[i].second; bounds 69 src/BoundaryConditions.cpp def.push_back(select(out_of_bounds, value[i], repeat_edge(source, bounds)(args)[i])); bounds 73 src/BoundaryConditions.cpp bounded(args) = select(out_of_bounds, value[0], repeat_edge(source, bounds)(args)); bounds 80 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 81 src/BoundaryConditions.cpp return constant_exterior(source, Tuple(value), bounds); bounds 86 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 88 src/BoundaryConditions.cpp user_assert(args.size() >= bounds.size()) << bounds 89 src/BoundaryConditions.cpp "repeat_image called with more bounds (" << bounds.size() << bounds 94 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 96 src/BoundaryConditions.cpp Expr min = bounds[i].first; bounds 97 src/BoundaryConditions.cpp Expr extent = bounds[i].second; bounds 127 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 129 src/BoundaryConditions.cpp user_assert(args.size() >= bounds.size()) << bounds 130 src/BoundaryConditions.cpp "mirror_image called with more bounds (" << bounds.size() << bounds 135 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 138 src/BoundaryConditions.cpp Expr min = bounds[i].first; bounds 139 src/BoundaryConditions.cpp Expr extent = bounds[i].second; bounds 168 src/BoundaryConditions.cpp const std::vector<std::pair<Expr, Expr>> &bounds) { bounds 170 src/BoundaryConditions.cpp user_assert(args.size() >= bounds.size()) << bounds 171 src/BoundaryConditions.cpp "mirror_interior called with more bounds (" << bounds.size() << bounds 176 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 179 src/BoundaryConditions.cpp Expr min = bounds[i].first; bounds 180 src/BoundaryConditions.cpp Expr extent = bounds[i].second; bounds 85 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 87 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 106 src/BoundaryConditions.h Bounds&&... bounds) { bounds 108 src/BoundaryConditions.h ::Halide::Internal::collect_paired_args(collected_bounds, std::forward<Bounds>(bounds)...); bounds 114 src/BoundaryConditions.h Bounds&&... bounds) { bounds 115 src/BoundaryConditions.h return constant_exterior(func_like, Tuple(value), std::forward<Bounds>(bounds)...); bounds 133 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 148 src/BoundaryConditions.h inline NO_INLINE Func repeat_edge(const T &func_like, Bounds&&... bounds) { bounds 150 src/BoundaryConditions.h ::Halide::Internal::collect_paired_args(collected_bounds, std::forward<Bounds>(bounds)...); bounds 169 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 183 src/BoundaryConditions.h inline NO_INLINE Func repeat_image(const T &func_like, Bounds&&... bounds) { bounds 185 src/BoundaryConditions.h ::Halide::Internal::collect_paired_args(collected_bounds, std::forward<Bounds>(bounds)...); bounds 204 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 218 src/BoundaryConditions.h inline NO_INLINE Func mirror_image(const T &func_like, Bounds&&... bounds) { bounds 220 src/BoundaryConditions.h ::Halide::Internal::collect_paired_args(collected_bounds, std::forward<Bounds>(bounds)...); bounds 242 src/BoundaryConditions.h const std::vector<std::pair<Expr, Expr>> &bounds); bounds 256 src/BoundaryConditions.h inline NO_INLINE Func mirror_interior(const T &func_like, Bounds&&... bounds) { bounds 258 src/BoundaryConditions.h ::Halide::Internal::collect_paired_args(collected_bounds, std::forward<Bounds>(bounds)...); bounds 48 src/Bounds.h std::vector<Interval> bounds; bounds 51 src/Bounds.h Box(size_t sz) : bounds(sz) {} bounds 52 src/Bounds.h Box(const std::vector<Interval> &b) : bounds(b) {} bounds 54 src/Bounds.h size_t size() const {return bounds.size();} bounds 55 src/Bounds.h bool empty() const {return bounds.empty();} bounds 56 src/Bounds.h Interval &operator[](int i) {return bounds[i];} bounds 57 src/Bounds.h const Interval &operator[](int i) const {return bounds[i];} bounds 58 src/Bounds.h void resize(size_t sz) {bounds.resize(sz);} bounds 59 src/Bounds.h void push_back(const Interval &i) {bounds.push_back(i);} bounds 127 src/BoundsInference.cpp map<pair<string, int>, Box> bounds; bounds 276 src/BoundsInference.cpp for (const pair<pair<string, int>, Box> &i : bounds) { bounds 406 src/BoundsInference.cpp for (size_t i = 0; i < func.schedule().bounds().size(); i++) { bounds 407 src/BoundsInference.cpp Bound bound = func.schedule().bounds()[i]; bounds 800 src/BoundsInference.cpp producer.bounds[{ consumer.name, consumer.stage }] = b; bounds 835 src/BoundsInference.cpp s.bounds[{ s.name, s.stage }] = output_box; bounds 226 src/CodeGen_GPU_Host.cpp ExtractBounds bounds; bounds 227 src/CodeGen_GPU_Host.cpp loop->accept(&bounds); bounds 230 src/CodeGen_GPU_Host.cpp << bounds.num_threads[0] << ", " bounds 231 src/CodeGen_GPU_Host.cpp << bounds.num_threads[1] << ", " bounds 232 src/CodeGen_GPU_Host.cpp << bounds.num_threads[2] << ", " bounds 233 src/CodeGen_GPU_Host.cpp << bounds.num_threads[3] << ") threads, (" bounds 234 src/CodeGen_GPU_Host.cpp << bounds.num_blocks[0] << ", " bounds 235 src/CodeGen_GPU_Host.cpp << bounds.num_blocks[1] << ", " bounds 236 src/CodeGen_GPU_Host.cpp << bounds.num_blocks[2] << ", " bounds 237 src/CodeGen_GPU_Host.cpp << bounds.num_blocks[3] << ") blocks\n"; bounds 432 src/CodeGen_GPU_Host.cpp internal_assert(is_one(bounds.num_threads[3]) && is_one(bounds.num_blocks[3])) bounds 433 src/CodeGen_GPU_Host.cpp << bounds.num_threads[3] << ", " << bounds.num_blocks[3] << "\n"; bounds 435 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_blocks[0] = " << bounds.num_blocks[0] << "\n"; bounds 436 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_blocks[1] = " << bounds.num_blocks[1] << "\n"; bounds 437 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_blocks[2] = " << bounds.num_blocks[2] << "\n"; bounds 438 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_threads[0] = " << bounds.num_threads[0] << "\n"; bounds 439 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_threads[1] = " << bounds.num_threads[1] << "\n"; bounds 440 src/CodeGen_GPU_Host.cpp debug(3) << "bounds.num_threads[2] = " << bounds.num_threads[2] << "\n"; bounds 445 src/CodeGen_GPU_Host.cpp codegen(bounds.num_blocks[0]), codegen(bounds.num_blocks[1]), codegen(bounds.num_blocks[2]), bounds 446 src/CodeGen_GPU_Host.cpp codegen(bounds.num_threads[0]), codegen(bounds.num_threads[1]), codegen(bounds.num_threads[2]), bounds 447 src/CodeGen_GPU_Host.cpp codegen(bounds.shared_mem_size), bounds 39 src/DebugToFile.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 40 src/DebugToFile.cpp num_elements *= op->bounds[i].extent; bounds 83 src/DebugToFile.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, body); bounds 198 src/Definition.cpp s.definition.contents->schedule.bounds() = contents->schedule.bounds(); bounds 1960 src/Func.cpp func.schedule().bounds().push_back(b); bounds 1995 src/Func.cpp func.schedule().bounds().push_back(b); bounds 2196 src/Func.cpp for (size_t i = 0; i < sched.bounds().size(); i++) { bounds 2197 src/Func.cpp if (c.name() == sched.bounds()[i].var) { bounds 2198 src/Func.cpp constant_bounds = is_const(sched.bounds()[i].min) && bounds 2199 src/Func.cpp is_const(sched.bounds()[i].extent); bounds 1492 src/HexagonOptimize.cpp Expr span_of_bounds(Interval bounds) { bounds 1493 src/HexagonOptimize.cpp internal_assert(bounds.is_bounded()); bounds 1495 src/HexagonOptimize.cpp const Min *min_min = bounds.min.as<Min>(); bounds 1496 src/HexagonOptimize.cpp const Max *min_max = bounds.min.as<Max>(); bounds 1497 src/HexagonOptimize.cpp const Min *max_min = bounds.max.as<Min>(); bounds 1498 src/HexagonOptimize.cpp const Max *max_max = bounds.max.as<Max>(); bounds 1499 src/HexagonOptimize.cpp const Add *min_add = bounds.min.as<Add>(); bounds 1500 src/HexagonOptimize.cpp const Add *max_add = bounds.max.as<Add>(); bounds 1501 src/HexagonOptimize.cpp const Sub *min_sub = bounds.min.as<Sub>(); bounds 1502 src/HexagonOptimize.cpp const Sub *max_sub = bounds.max.as<Sub>(); bounds 1513 src/HexagonOptimize.cpp return bounds.max - bounds.min; bounds 1521 src/HexagonOptimize.cpp Scope<Interval> bounds; bounds 1530 src/HexagonOptimize.cpp bounds.push(op->name, bounds_of_expr_in_scope(op->value, bounds)); bounds 1534 src/HexagonOptimize.cpp bounds.pop(op->name); bounds 1558 src/HexagonOptimize.cpp Interval unaligned_index_bounds = bounds_of_expr_in_scope(index, bounds); bounds 441 src/IR.cpp Stmt Realize::make(const std::string &name, const std::vector<Type> &types, const Region &bounds, const Expr &condition, const Stmt &body) { bounds 442 src/IR.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 443 src/IR.cpp internal_assert(bounds[i].min.defined()) << "Realize of undefined\n"; bounds 444 src/IR.cpp internal_assert(bounds[i].extent.defined()) << "Realize of undefined\n"; bounds 445 src/IR.cpp internal_assert(bounds[i].min.type().is_scalar()) << "Realize of vector size\n"; bounds 446 src/IR.cpp internal_assert(bounds[i].extent.type().is_scalar()) << "Realize of vector size\n"; bounds 456 src/IR.cpp node->bounds = bounds; bounds 462 src/IR.cpp Stmt Prefetch::make(const std::string &name, const std::vector<Type> &types, const Region &bounds, Parameter param) { bounds 463 src/IR.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 464 src/IR.cpp internal_assert(bounds[i].min.defined()) << "Prefetch of undefined\n"; bounds 465 src/IR.cpp internal_assert(bounds[i].extent.defined()) << "Prefetch of undefined\n"; bounds 466 src/IR.cpp internal_assert(bounds[i].min.type().is_scalar()) << "Prefetch of vector size\n"; bounds 467 src/IR.cpp internal_assert(bounds[i].extent.type().is_scalar()) << "Prefetch of vector size\n"; bounds 474 src/IR.cpp node->bounds = bounds; bounds 405 src/IR.h Region bounds; bounds 409 src/IR.h EXPORT static Stmt make(const std::string &name, const std::vector<Type> &types, const Region &bounds, const Expr &condition, const Stmt &body); bounds 724 src/IR.h Region bounds; bounds 730 src/IR.h const Region &bounds, Parameter param = Parameter()); bounds 404 src/IREquality.cpp compare_scalar(s->bounds.size(), op->bounds.size()); bounds 408 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { bounds 409 src/IREquality.cpp compare_expr(s->bounds[i].min, op->bounds[i].min); bounds 410 src/IREquality.cpp compare_expr(s->bounds[i].extent, op->bounds[i].extent); bounds 458 src/IREquality.cpp compare_scalar(s->bounds.size(), op->bounds.size()); bounds 459 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { bounds 460 src/IREquality.cpp compare_expr(s->bounds[i].min, op->bounds[i].min); bounds 461 src/IREquality.cpp compare_expr(s->bounds[i].extent, op->bounds[i].extent); bounds 43 src/IRMutator.cpp pair<Region, bool> mutate_region(IRMutator *mutator, const Region &bounds) { bounds 44 src/IRMutator.cpp Region new_bounds(bounds.size()); bounds 47 src/IRMutator.cpp for (size_t i = 0; i < bounds.size(); i++) { bounds 48 src/IRMutator.cpp Expr old_min = bounds[i].min; bounds 49 src/IRMutator.cpp Expr old_extent = bounds[i].extent; bounds 287 src/IRMutator.cpp std::tie(new_bounds, bounds_changed) = mutate_region(this, op->bounds); bounds 306 src/IRMutator.cpp std::tie(new_bounds, bounds_changed) = mutate_region(this, op->bounds); bounds 638 src/IRPrinter.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 640 src/IRPrinter.cpp print(op->bounds[i].min); bounds 642 src/IRPrinter.cpp print(op->bounds[i].extent); bounds 644 src/IRPrinter.cpp if (i < op->bounds.size() - 1) stream << ", "; bounds 664 src/IRPrinter.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 666 src/IRPrinter.cpp print(op->bounds[i].min); bounds 668 src/IRPrinter.cpp print(op->bounds[i].extent); bounds 670 src/IRPrinter.cpp if (i < op->bounds.size() - 1) stream << ", "; bounds 201 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 202 src/IRVisitor.cpp op->bounds[i].min.accept(this); bounds 203 src/IRVisitor.cpp op->bounds[i].extent.accept(this); bounds 210 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 211 src/IRVisitor.cpp op->bounds[i].min.accept(this); bounds 212 src/IRVisitor.cpp op->bounds[i].extent.accept(this); bounds 440 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 441 src/IRVisitor.cpp include(op->bounds[i].min); bounds 442 src/IRVisitor.cpp include(op->bounds[i].extent); bounds 449 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 450 src/IRVisitor.cpp include(op->bounds[i].min); bounds 451 src/IRVisitor.cpp include(op->bounds[i].extent); bounds 76 src/Inline.cpp for (size_t i = 0; i < s.bounds().size(); i++) { bounds 77 src/Inline.cpp if (s.bounds()[i].min.defined()) { bounds 79 src/Inline.cpp << s.bounds()[i].var << " of function " bounds 81 src/Inline.cpp << s.bounds()[i].min << ", " bounds 82 src/Inline.cpp << s.bounds()[i].extent << "] because the function is scheduled inline.\n"; bounds 83 src/Inline.cpp } else if (s.bounds()[i].modulus.defined()) { bounds 85 src/Inline.cpp << s.bounds()[i].var << " of function " bounds 87 src/Inline.cpp << s.bounds()[i].modulus << ", " bounds 88 src/Inline.cpp << s.bounds()[i].remainder << "] because the function is scheduled inline.\n"; bounds 386 src/Memoization.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, cache_key_alloc); bounds 136 src/ParallelRVar.cpp Scope<Interval> bounds; bounds 139 src/ParallelRVar.cpp bounds.push(rv.var, in); bounds 140 src/ParallelRVar.cpp bounds.push(renamer.get_new_name(rv.var), in); bounds 157 src/ParallelRVar.cpp hazard = simplify(hazard, false, bounds); bounds 97 src/Prefetch.cpp for (const auto &r : op->bounds) { bounds 168 src/Prefetch.cpp Region bounds; bounds 171 src/Prefetch.cpp bounds.push_back(Range(box[i].min, extent)); bounds 176 src/Prefetch.cpp prefetch = Prefetch::make(buf_name, {param.type()}, bounds, param); bounds 180 src/Prefetch.cpp prefetch = Prefetch::make(buf_name, it->second.output_types(), bounds); bounds 229 src/Prefetch.cpp Box bounds = get_buffer_bounds(b->first, b->second.size()); bounds 230 src/Prefetch.cpp internal_assert(prefetch_box.size() == bounds.size()); bounds 233 src/Prefetch.cpp prefetch_box = box_intersection(prefetch_box, bounds); bounds 236 src/Prefetch.cpp for (size_t i = 0; i < bounds.size(); ++i) { bounds 237 src/Prefetch.cpp predicate = predicate && (prefetch_box[i].min >= bounds[i].min) && bounds 238 src/Prefetch.cpp (prefetch_box[i].max <= bounds[i].max); bounds 402 src/RemoveUndef.cpp Region new_bounds(op->bounds.size()); bounds 406 src/RemoveUndef.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 407 src/RemoveUndef.cpp Expr old_min = op->bounds[i].min; bounds 408 src/RemoveUndef.cpp Expr old_extent = op->bounds[i].extent; bounds 132 src/Schedule.cpp std::vector<Bound> bounds; bounds 157 src/Schedule.cpp for (Bound &b : bounds) { bounds 203 src/Schedule.cpp copy.contents->bounds = contents->bounds; bounds 266 src/Schedule.cpp return contents->bounds; bounds 270 src/Schedule.cpp return contents->bounds; bounds 348 src/Schedule.cpp for (const Bound &b : bounds()) { bounds 316 src/Schedule.h const std::vector<Bound> &bounds() const; bounds 317 src/Schedule.h std::vector<Bound> &bounds(); bounds 85 src/ScheduleFunctions.cpp for (const Bound &i : s.bounds()) { bounds 546 src/ScheduleFunctions.cpp for (size_t i = 0; i < s.bounds().size(); i++) { bounds 547 src/ScheduleFunctions.cpp Bound b = s.bounds()[i]; bounds 654 src/ScheduleFunctions.cpp Region bounds; bounds 661 src/ScheduleFunctions.cpp bounds.push_back(Range(min, extent)); bounds 664 src/ScheduleFunctions.cpp s = Realize::make(name, func.output_types(), bounds, const_true(), s); bounds 4986 src/Simplify.cpp const Scope<Interval> &bounds, bounds 4988 src/Simplify.cpp return Simplify(simplify_lets, &bounds, &alignment).mutate(e); bounds 4992 src/Simplify.cpp const Scope<Interval> &bounds, bounds 4994 src/Simplify.cpp return Simplify(simplify_lets, &bounds, &alignment).mutate(s); bounds 25 src/Simplify.h const Scope<Interval> &bounds = Scope<Interval>::empty_scope(), bounds 28 src/Simplify.h const Scope<Interval> &bounds = Scope<Interval>::empty_scope(), bounds 382 src/SkipStages.cpp stmt = Realize::make(op->name, op->types, op->bounds, bounds 392 src/SlidingWindow.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, new_body); bounds 1088 src/Solve.cpp Interval bounds = bounds_of_expr_in_scope(a, scope); bounds 1089 src/Solve.cpp if (!bounds.is_single_point() || bounds 1090 src/Solve.cpp !bounds.has_lower_bound() || bounds 1091 src/Solve.cpp !bounds.has_upper_bound()) { bounds 1094 src/Solve.cpp return bounds; bounds 65 src/SplitTuples.cpp body = Realize::make(op->name + "." + std::to_string(i), {op->types[i]}, op->bounds, op->condition, body); bounds 95 src/SplitTuples.cpp stmt = Prefetch::make(op->name + "." + std::to_string(*it), {op->types[(*it)]}, op->bounds); bounds 98 src/SplitTuples.cpp stmt = Block::make(stmt, Prefetch::make(op->name + "." + std::to_string(*it), {op->types[(*it)]}, op->bounds)); bounds 466 src/StmtToHtml.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 467 src/StmtToHtml.cpp print_list("[", {op->bounds[i].min, op->bounds[i].extent}, "]"); bounds 468 src/StmtToHtml.cpp if (i < op->bounds.size() - 1) stream << ", "; bounds 491 src/StmtToHtml.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 492 src/StmtToHtml.cpp print_list("[", {op->bounds[i].min, op->bounds[i].extent}, "]"); bounds 493 src/StmtToHtml.cpp if (i < op->bounds.size() - 1) stream << ", "; bounds 104 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 105 src/StorageFlattening.cpp extents.push_back(op->bounds[i].extent); bounds 133 src/StorageFlattening.cpp internal_assert(storage_permutation.size() == op->bounds.size()); bounds 139 src/StorageFlattening.cpp int dims = op->bounds.size(); bounds 170 src/StorageFlattening.cpp for (int i = (int)op->bounds.size()-1; i > 0; i--) { bounds 184 src/StorageFlattening.cpp for (size_t i = op->bounds.size(); i > 0; i--) { bounds 185 src/StorageFlattening.cpp stmt = LetStmt::make(min_name[i-1], op->bounds[i-1].min, stmt); bounds 230 src/StorageFlattening.cpp vector<Expr> prefetch_min(op->bounds.size()); bounds 231 src/StorageFlattening.cpp vector<Expr> prefetch_extent(op->bounds.size()); bounds 232 src/StorageFlattening.cpp vector<Expr> prefetch_stride(op->bounds.size()); bounds 233 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 234 src/StorageFlattening.cpp prefetch_min[i] = mutate(op->bounds[i].min); bounds 235 src/StorageFlattening.cpp prefetch_extent[i] = mutate(op->bounds[i].extent); bounds 261 src/StorageFlattening.cpp internal_assert(storage_permutation.size() == op->bounds.size()); bounds 263 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 264 src/StorageFlattening.cpp internal_assert(storage_permutation[i] < (int)op->bounds.size()); bounds 269 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 314 src/StorageFolding.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, body); bounds 327 src/StorageFolding.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, body); bounds 329 src/StorageFolding.cpp Region bounds = op->bounds; bounds 335 src/StorageFolding.cpp d < (int)bounds.size()); bounds 337 src/StorageFolding.cpp bounds[d] = Range(0, f); bounds 340 src/StorageFolding.cpp stmt = Realize::make(op->name, op->types, bounds, op->condition, body); bounds 177 src/Tracing.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 178 src/Tracing.cpp builder.coordinates.push_back(op->bounds[i].min); bounds 179 src/Tracing.cpp builder.coordinates.push_back(op->bounds[i].extent); bounds 190 src/Tracing.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, new_body); bounds 195 src/Tracing.cpp stmt = Realize::make(op->name, op->types, op->bounds, op->condition, new_body); bounds 894 src/VaryingAttributes.cpp for (size_t i = 0; i < op->bounds.size(); i++) { bounds 895 src/VaryingAttributes.cpp Expr old_min = op->bounds[i].min; bounds 896 src/VaryingAttributes.cpp Expr old_extent = op->bounds[i].extent;