Lines Matching refs:chosen
1585 schedule_node *chosen = NULL;
1595 if (!chosen ||
1596 exit_unblocked_time(n) < exit_unblocked_time(chosen) ||
1597 (exit_unblocked_time(n) == exit_unblocked_time(chosen) &&
1599 chosen = n;
1615 if (!chosen) {
1616 chosen = n;
1618 get_register_pressure_benefit(chosen->inst);
1629 chosen = n;
1646 if (n->cand_generation > chosen->cand_generation) {
1647 chosen = n;
1650 } else if (n->cand_generation < chosen->cand_generation) {
1661 fs_inst *chosen_inst = (fs_inst *)chosen->inst;
1670 chosen = n;
1685 if (n->delay > chosen->delay) {
1686 chosen = n;
1689 } else if (n->delay < chosen->delay) {
1695 if (exit_unblocked_time(n) < exit_unblocked_time(chosen)) {
1696 chosen = n;
1699 } else if (exit_unblocked_time(n) > exit_unblocked_time(chosen)) {
1709 return chosen;
1715 schedule_node *chosen = NULL;
1722 if (!chosen || n->unblocked_time < chosen_time) {
1723 chosen = n;
1728 return chosen;
1770 schedule_node *chosen = choose_instruction_to_schedule();
1773 assert(chosen);
1774 chosen->remove();
1775 chosen->inst->exec_node::remove();
1776 block->instructions.push_tail(chosen->inst);
1780 reg_pressure -= get_register_pressure_benefit(chosen->inst);
1781 update_register_pressure(chosen->inst);
1787 * we're unblocked. After this, we have the time when the chosen
1790 time = MAX2(time, chosen->unblocked_time);
1793 * chosen one.
1795 time += issue_time(chosen->inst);
1799 bs->dump_instruction(chosen->inst);
1809 for (int i = chosen->child_count - 1; i >= 0; i--) {
1810 schedule_node *child = chosen->children[i];
1813 time + chosen->child_latency[i]);
1836 if (devinfo->ver < 6 && chosen->inst->is_math()) {
1840 time + chosen->latency);