Lines Matching defs:idx
145 move_element(T begin_it, size_t idx, size_t before)
147 if (idx < before) {
148 auto begin = std::next(begin_it, idx);
151 } else if (idx > before) {
153 auto end = std::next(begin_it, idx + 1);
645 Instruction* current, int idx)
647 assert(idx != 0);
661 DownwardsCursor cursor = ctx.mv.downwards_init(idx, false, false);
663 for (int candidate_idx = idx - 1; k < max_moves && candidate_idx > (int)idx - window_size;
671 idx <= ctx.last_SMEM_dep_idx && candidate_idx < ctx.last_SMEM_dep_idx;
722 UpwardsCursor up_cursor = ctx.mv.upwards_init(idx + 1, false);
726 for (int candidate_idx = idx + 1; k < max_moves && candidate_idx < (int)idx + window_size;
788 Instruction* current, int idx)
790 assert(idx != 0);
804 DownwardsCursor cursor = ctx.mv.downwards_init(idx, true, true);
806 for (int candidate_idx = idx - 1; k < max_moves && candidate_idx > (int)idx - window_size;
819 idx <= ctx.last_SMEM_dep_idx && candidate_idx < ctx.last_SMEM_dep_idx;
896 UpwardsCursor up_cursor = ctx.mv.upwards_init(idx + 1, true);
900 for (int candidate_idx = idx + 1; k < max_moves && candidate_idx < (int)idx + window_size;
960 Instruction* current, int idx)
962 assert(idx != 0);
967 DownwardsCursor cursor = ctx.mv.downwards_init(idx, true, false);
973 for (int candidate_idx = idx - 1; k < max_moves && candidate_idx > (int)idx - window_size;
1014 for (unsigned idx = 0; idx < block->instructions.size(); idx++) {
1015 Instruction* current = block->instructions[idx].get();
1022 idx);
1031 schedule_VMEM(ctx, block, live_vars.register_demand[block->index], current, idx);
1036 schedule_SMEM(ctx, block, live_vars.register_demand[block->index], current, idx);
1042 for (unsigned idx = 0; idx < block->instructions.size(); idx++) {
1043 block->register_demand.update(live_vars.register_demand[block->index][idx]);