stage 409 apps/fft/fft.cpp Func stage = stages[i].first; stage 410 apps/fft/fft.cpp stage.compute_at(x, group).update().vectorize(n0); stage 124 src/BoundsInference.cpp size_t stage; // 0 is the pure definition, 1 is the first update stage 232 src/BoundsInference.cpp bool is_update = (stage != 0); stage 237 src/BoundsInference.cpp const Definition &def = func.update(stage - 1); stage 303 src/BoundsInference.cpp if (stage < func.updates().size()) { stage 401 src/BoundsInference.cpp string prefix = name + ".s" + std::to_string(stage) + "."; stage 452 src/BoundsInference.cpp string arg = name + ".s" + std::to_string(stage) + "." + func_args[d]; stage 462 src/BoundsInference.cpp if (stage > 0) { stage 464 src/BoundsInference.cpp string arg = name + ".s" + std::to_string(stage) + "." + rvar.var; stage 544 src/BoundsInference.cpp string prefix = func.name() + ".s" + std::to_string(stage) + "." + arg; stage 612 src/BoundsInference.cpp string arg = name + ".s" + std::to_string(stage) + "." + farg; stage 617 src/BoundsInference.cpp if (stage > 0) { stage 619 src/BoundsInference.cpp string arg = name + ".s" + std::to_string(stage) + "." + rv.var; stage 666 src/BoundsInference.cpp s.stage = 0; stage 673 src/BoundsInference.cpp s.stage = (int)(j+1); stage 674 src/BoundsInference.cpp s.stage_prefix = s.name + ".s" + std::to_string(s.stage) + "."; stage 775 src/BoundsInference.cpp if (consumer.stage == 0) { stage 778 src/BoundsInference.cpp err << "Update definition number " << (consumer.stage-1); stage 800 src/BoundsInference.cpp producer.bounds[{ consumer.name, consumer.stage }] = b; stage 835 src/BoundsInference.cpp s.bounds[{ s.name, s.stage }] = output_box; stage 872 src/BoundsInference.cpp stage_name = stages[i].name + ".s" + std::to_string(stages[i].stage); stage 948 src/BoundsInference.cpp if (producing >= 0 && stages[producing].stage > 0) { stage 1464 src/Func.cpp void reorder_vars(vector<Dim> &dims_old, const VarOrRVar *vars, size_t size, const Stage &stage) { stage 1478 src/Func.cpp << "In schedule for " << stage.name() stage 1481 src/Func.cpp << stage.dump_argument_list(); stage 1492 src/Func.cpp << "In schedule for " << stage.name() stage 255 src/FuseGPUThreadLoops.cpp bool is_free(int stage) const { stage 256 src/FuseGPUThreadLoops.cpp return group.back().liveness.max < stage; stage 418 src/FuseGPUThreadLoops.cpp const SharedAllocation& alloc, int stage) { stage 436 src/FuseGPUThreadLoops.cpp internal_assert(mem_allocs[free_spaces[i]].is_free(stage)); stage 448 src/FuseGPUThreadLoops.cpp internal_assert(mem_allocs[free_spaces[i]].is_free(stage)); stage 490 src/FuseGPUThreadLoops.cpp for (int stage = 0; stage < barrier_stage; ++stage) { stage 492 src/FuseGPUThreadLoops.cpp if (allocations[i].liveness.min > stage) { stage 494 src/FuseGPUThreadLoops.cpp } else if (allocations[i].liveness.min == stage) { // Allocate stage 495 src/FuseGPUThreadLoops.cpp int free_idx = find_best_fit(mem_allocs, free_spaces, allocations[i], stage); stage 502 src/FuseGPUThreadLoops.cpp } else if (allocations[i].liveness.max == stage - 1) { // Free stage 38 src/Prefetch.cpp int stage; stage 46 src/Prefetch.cpp if (!current_func || !starts_with(loop_name, current_func->name() + ".s" + std::to_string(stage))) { stage 52 src/Prefetch.cpp stage = -1; stage 58 src/Prefetch.cpp stage = atoi(str.c_str()); stage 60 src/Prefetch.cpp internal_assert(stage >= 0); stage 66 src/Prefetch.cpp internal_assert(stage <= (int)current_func->updates().size()); stage 69 src/Prefetch.cpp const Definition &def = get_stage_definition(*current_func, stage); stage 191 src/Prefetch.cpp int old_stage = stage; stage 258 src/Prefetch.cpp stage = old_stage; stage 545 src/ScheduleFunctions.cpp for (size_t stage = 0; stage <= func.updates().size(); stage++) { stage 548 src/ScheduleFunctions.cpp string prefix = func.name() + ".s" + std::to_string(stage) + "." + b.var; stage 8 test/correctness/gpu_multi_device.cpp Func stage[5]; stage 14 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = input(x, y, c); stage 19 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = stage[current_stage - 1](x, y, c) + 69; stage 20 test/correctness/gpu_multi_device.cpp stage[current_stage].compute_root().reorder(c, x, y) stage 25 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = stage[current_stage - 1](x, y, c) + 69; stage 26 test/correctness/gpu_multi_device.cpp stage[current_stage].compute_root().reorder(c, x, y) stage 31 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = stage[current_stage - 1](x, y, c) + 69; stage 32 test/correctness/gpu_multi_device.cpp stage[current_stage].compute_root().reorder(c, x, y) stage 37 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = stage[current_stage - 1](x, y, c) + 69; stage 38 test/correctness/gpu_multi_device.cpp stage[current_stage].compute_root() stage 43 test/correctness/gpu_multi_device.cpp stage[current_stage](x, y, c) = stage[current_stage - 1](x, y, c) + 69; stage 44 test/correctness/gpu_multi_device.cpp stage[current_stage].compute_root().reorder(c, x, y) stage 51 test/correctness/gpu_multi_device.cpp stage[current_stage - 1].realize(result); stage 49 test/correctness/memoize.cpp extern "C" DLLEXPORT int count_calls_staged(int32_t stage, uint8_t val, halide_buffer_t *in, halide_buffer_t *out) { stage 55 test/correctness/memoize.cpp assert(stage < static_cast<int32_t>(sizeof(call_count_staged)/sizeof(call_count_staged[0]))); stage 56 test/correctness/memoize.cpp call_count_staged[stage]++; stage 505 test/correctness/memoize.cpp Func stage[4]; stage 511 test/correctness/memoize.cpp stage[i].define_extern("count_calls_staged", stage 514 test/correctness/memoize.cpp prev_func = stage[i]; stage 519 test/correctness/memoize.cpp stage[i].compute_root(); stage 521 test/correctness/memoize.cpp stage[3].compute_root().memoize(); stage 523 test/correctness/memoize.cpp output(_) = stage[3](_);