Searched refs:best_cost (Results 1 - 15 of 15) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dexpmed.c2423 struct mult_cost best_cost;
2484 best_cost = *cost_limit;
2567 new_limit.cost = best_cost.cost - op_cost;
2568 new_limit.latency = best_cost.latency - op_cost;
2573 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
2575 best_cost = alg_in->cost;
2597 new_limit.cost = best_cost.cost - op_cost;
2598 new_limit.latency = best_cost.latency - op_cost;
2603 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
2605 best_cost
2413 struct mult_cost best_cost; local
[all...]
H A Dlra-assigns.c503 int best_cost = INT_MAX, best_priority = INT_MIN, best_usage = INT_MAX; local
671 if (best_hard_regno < 0 || hard_regno_costs[hard_regno] < best_cost
672 || (hard_regno_costs[hard_regno] == best_cost
679 best_cost = hard_regno_costs[hard_regno];
688 *cost = best_cost - lra_reg_info[regno].freq;
907 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; local
930 best_cost = INT_MAX;
1045 && best_cost > cost))))
1049 best_cost = cost;
H A Dtree-ssa-loop-ivopts.c5795 comp_cost cost, best_cost, acost; local
5806 best_cost = iv_ca_cost (ivs);
5826 if (compare_costs (acost, best_cost) < 0)
5828 best_cost = acost;
5849 if (compare_costs (acost, best_cost) < 0)
5851 best_cost = acost;
5886 comp_cost best_cost, acost; local
5890 best_cost = iv_ca_cost (ivs);
5901 if (compare_costs (acost, best_cost) < 0)
5903 best_cost
6036 comp_cost best_cost, act_cost; local
6169 comp_cost acost, best_cost = iv_ca_cost (ivs); local
[all...]
H A Dira-costs.c1744 int best_cost, allocno_cost;
1836 best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1;
1844 if (i_costs[k] < best_cost)
1846 best_cost = i_costs[k];
1849 else if (i_costs[k] == best_cost)
1865 if (best_cost > i_mem_cost)
1892 if (best_cost > i_mem_cost)
1907 pref[i] = best_cost > i_mem_cost ? NO_REGS : best;
1925 best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1;
1926 allocno_cost = best_cost;
1737 int best_cost, allocno_cost; local
[all...]
H A Dreload.c688 int best_cost = -1;
717 && (best_cost < 0 || best_cost >= cost))
718 || best_cost > cost)
722 best_cost = register_move_cost (outer, (enum reg_class) rclass,
742 int best_cost = -1;
765 && (best_cost < 0 || best_cost >= cost))
766 || best_cost > cost)
770 best_cost
684 int best_cost = -1; local
738 int best_cost = -1; local
[all...]
H A Dira-color.c4464 int cost, best_cost;
4486 best_cost = best_slot_num = -1;
4531 if (cost > best_cost)
4533 best_cost = cost;
4539 if (best_cost >= 0)
4452 int cost, best_cost; local
H A Dira.c1122 int i, cost, min_cost, best_cost;
1145 best_cost = INT_MAX;
1163 if (best_class == NO_REGS || best_cost > min_cost)
1166 best_cost = min_cost;
1115 int i, cost, min_cost, best_cost; local
H A Dreload1.c1889 int best_cost = INT_MAX;
1974 if (this_cost < best_cost
1977 || (this_cost == best_cost
1988 best_cost = this_cost;
1879 int best_cost = INT_MAX; local
/haiku-buildtools/legacy/gcc/gcc/config/sh/
H A Dsh.c1269 int cost, best_cost = 10000;
1287 best_cost = shift_insns[right] + shift_insns[right + left];
1292 best_cost = shift_insns[left + late_right] + shift_insns[late_right];
1306 if (cost < best_cost)
1309 best_cost = cost;
1326 if (cost < best_cost)
1329 best_cost = cost;
1346 if (cost < best_cost)
1349 best_cost = cost;
1362 if (cost < best_cost)
1264 int cost, best_cost = 10000; local
1549 int cost, best_cost; local
[all...]
/haiku-buildtools/gcc/gcc/lto/
H A Dlto-partition.c471 int best_n_nodes = 0, best_i = 0, best_cost = local
705 || best_cost == INT_MAX
708 > (internal * (HOST_WIDE_INT)best_cost)))
711 best_cost = cost;
723 best_cost, best_internal, best_i);
750 best_cost = INT_MAX;
/haiku-buildtools/gcc/gcc/config/sh/
H A Dsh.c4158 int cost, best_cost = 10000;
4176 best_cost = ashl_lshr_seq[right].insn_count
4182 best_cost = ashl_lshr_seq[left + late_right].insn_count
4197 if (cost < best_cost)
4200 best_cost = cost;
4219 if (cost < best_cost)
4222 best_cost = cost;
4239 if (cost < best_cost)
4242 best_cost = cost;
4257 if (cost < best_cost)
4149 int cost, best_cost = 10000; local
4428 int cost = 0, best_cost; local
[all...]
/haiku-buildtools/legacy/gcc/gcc/
H A Dregclass.c1058 register int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1;
1076 else if (p->cost[class] < best_cost)
1078 best_cost = p->cost[class];
1081 else if (p->cost[class] == best_cost)
1055 register int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; local
H A Dsched.c750 int best_cost = actual_hazard_this_instance (unit, instance, insn,
755 if (best_cost > cost)
762 if (this_cost < best_cost)
764 best_cost = this_cost;
771 cost = MAX (cost, best_cost);
2084 int i, j, k, q, cost, best_cost, best_insn = 0, new_ready = n_ready;
2122 best_cost = -1;
2128 > best_cost)
2130 best_cost = cost;
746 int best_cost = actual_hazard_this_instance (unit, instance, insn, local
2076 int i, j, k, q, cost, best_cost, best_insn = 0, new_ready = n_ready; local
H A Dhaifa-sched.c3024 int best_cost = actual_hazard_this_instance (unit, instance, insn,
3029 if (best_cost > cost)
3036 if (this_cost < best_cost)
3038 best_cost = this_cost;
3045 cost = MAX (cost, best_cost);
3020 int best_cost = actual_hazard_this_instance (unit, instance, insn, local
/haiku-buildtools/gcc/gcc/config/c6x/
H A Dc6x.c3228 int best = -1, best_cost = INT_MAX;
3232 && rsrv_count[side][j] < best_cost)
3234 best_cost = rsrv_count[side][j];
3211 int best = -1, best_cost = INT_MAX; local

Completed in 564 milliseconds