Searched refs:unblocked_time (Results 1 – 3 of 3) sorted by relevance
60 uint32_t unblocked_time; member497 if (chosen->unblocked_time > state->time && in choose_instruction()498 n->unblocked_time < chosen->unblocked_time) { in choose_instruction()501 } else if (n->unblocked_time > state->time && in choose_instruction()502 n->unblocked_time > chosen->unblocked_time) { in choose_instruction()653 state->time = MAX2(state->time, chosen->unblocked_time); in schedule_instructions()667 child->unblocked_time = MAX2(child->unblocked_time, in schedule_instructions()
54 uint32_t unblocked_time; member709 fprintf(stderr, " t=%4d: ", n->unblocked_time); in dump_state()834 child->unblocked_time = MAX2(child->unblocked_time, in mark_instruction_scheduled()937 time = MAX2(chosen->unblocked_time, time); in schedule_instructions()953 time = MAX2(merge->unblocked_time, time); in schedule_instructions()
75 int unblocked_time; member in schedule_node116 return n->exit ? n->exit->unblocked_time : INT_MAX; in exit_unblocked_time()799 this->unblocked_time = 0; in schedule_node()853 n->children[i]->unblocked_time = in compute_exits()854 MAX2(n->children[i]->unblocked_time, in compute_exits()855 n->unblocked_time + issue_time(n->inst) + n->child_latency[i]); in compute_exits()1429 n->unblocked_time < chosen_time)) { in choose_instruction_to_schedule()1431 chosen_time = n->unblocked_time; in choose_instruction_to_schedule()1546 if (!chosen || n->unblocked_time < chosen_time) { in choose_instruction_to_schedule()1548 chosen_time = n->unblocked_time; in choose_instruction_to_schedule()[all …]