* from in picking among those.
*/
+static bool debug = false;
+
class schedule_node : public exec_node
{
public:
*/
time = MAX2(time + 1, chosen_time);
+ if (debug) {
+ printf("clock %4d, scheduled: ", time);
+ v->dump_instruction(chosen->inst);
+ }
+
/* Now that we've scheduled a new instruction, some of its
* children can be promoted to the list of instructions ready to
* be scheduled. Update the children's unblocked time for this
child->parent_count--;
if (child->parent_count == 0) {
+ if (debug) {
+ printf("now available: ");
+ v->dump_instruction(child->inst);
+ }
instructions.push_tail(child);
}
}
else
grf_count = virtual_grf_count;
+ if (debug) {
+ printf("\nInstructions before scheduling (reg_alloc %d)\n", post_reg_alloc);
+ dump_instructions();
+ }
+
instruction_scheduler sched(this, mem_ctx, grf_count, post_reg_alloc);
while (!next_block_header->is_tail_sentinel()) {
sched.schedule_instructions(next_block_header);
}
+ if (debug) {
+ printf("\nInstructions after scheduling (reg_alloc %d)\n", post_reg_alloc);
+ dump_instructions();
+ }
+
this->live_intervals_valid = false;
}