Lines Matching refs:insert_idx
60 int insert_idx; /* First instruction *after* the clause */
63 * i.e. from insert_idx_clause (inclusive) to insert_idx (exclusive) */
69 : source_idx(current_idx - 1), insert_idx_clause(current_idx), insert_idx(current_idx + 1),
82 int insert_idx; /* Instruction to move in front of */
84 /* Maximum demand of instructions from insert_idx (inclusive) to source_idx (exclusive) */
89 insert_idx = -1; /* to be initialized later */
92 bool has_insert_idx() const { return insert_idx != -1; }
162 assert(insert_idx_clause < insert_idx);
172 for (int i = insert_idx_clause; i < insert_idx; ++i) {
236 const int dest_insert_idx = add_to_clause ? cursor.insert_idx_clause : cursor.insert_idx;
273 cursor.insert_idx--;
308 assert(insert_idx < source_idx);
311 for (int i = insert_idx; i < source_idx; ++i) {
348 cursor.insert_idx = cursor.source_idx;
349 cursor.total_demand = register_demand[cursor.insert_idx];
375 const RegisterDemand temp2 = get_temp_registers(block->instructions[cursor.insert_idx - 1]);
377 register_demand[cursor.insert_idx - 1] - temp2 + candidate_diff + temp;
381 /* move the candidate above the insert_idx */
382 move_element(block->instructions.begin(), cursor.source_idx, cursor.insert_idx);
385 move_element(register_demand, cursor.source_idx, cursor.insert_idx);
386 register_demand[cursor.insert_idx] = new_demand;
387 for (int i = cursor.insert_idx + 1; i <= cursor.source_idx; i++)
393 cursor.insert_idx++;
681 (cursor.insert_idx - cursor.source_idx > (ctx.num_waves * 4) ||
782 ctx.last_SMEM_dep_idx = found_dependency ? up_cursor.insert_idx : 0;
840 int clause_size = cursor.insert_idx - cursor.insert_idx_clause;