/haiku-buildtools/gcc/gcc/lto/ |
H A D | lto-partition.c | 471 int best_n_nodes = 0, best_i = 0, best_cost = local
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | regclass.c | 1055 register int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; local
|
H A D | sched.c | 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 D | haifa-sched.c | 3020 int best_cost = actual_hazard_this_instance (unit, instance, insn, local
|
/haiku-buildtools/gcc/gcc/ |
H A D | lra-assigns.c | 503 int best_cost = INT_MAX, best_priority = INT_MIN, best_usage = INT_MAX; local 907 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; local
|
H A D | ira-costs.c | 1737 int best_cost, allocno_cost; local [all...] |
H A D | expmed.c | 2413 struct mult_cost best_cost; local [all...] |
H A D | ira-color.c | 4452 int cost, best_cost; local
|
H A D | reload.c | 684 int best_cost = -1; local 738 int best_cost = -1; local [all...] |
H A D | ira.c | 1115 int i, cost, min_cost, best_cost; local
|
H A D | reload1.c | 1879 int best_cost = INT_MAX; local
|
H A D | tree-ssa-loop-ivopts.c | 5795 comp_cost cost, best_cost, acost; local 5886 comp_cost best_cost, acost; local 6036 comp_cost best_cost, act_cost; local 6169 comp_cost acost, best_cost = iv_ca_cost (ivs); local [all...] |
/haiku-buildtools/legacy/gcc/gcc/config/sh/ |
H A D | sh.c | 1264 int cost, best_cost = 10000; local 1549 int cost, best_cost; local [all...] |
/haiku-buildtools/gcc/gcc/config/c6x/ |
H A D | c6x.c | 3211 int best = -1, best_cost = INT_MAX; local
|
/haiku-buildtools/gcc/gcc/config/sh/ |
H A D | sh.c | 4149 int cost, best_cost = 10000; local 4428 int cost = 0, best_cost; local [all...] |