Searched refs:min_cost (Results 1 - 5 of 5) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-loop-im.c728 unsigned min_cost = UINT_MAX; local
743 min_cost = MIN (min_cost, 1);
757 min_cost = MIN (min_cost, def_data->cost);
763 min_cost = MIN (min_cost, total_cost);
764 lim_data->cost += min_cost;
796 if (total_cost - min_cost >= 2 * LIM_EXPENSIVE
797 && !(min_cost !
[all...]
H A Dbt-load.c1286 migrate_btr_def (btr_def def, int min_cost)
1300 "Attempting to migrate pt from insn %d (cost = %d, min_cost = %d) ... ",
1301 INSN_UID (def->insn), def->cost, min_cost);
1348 && def->cost >= min_cost;
1453 int min_cost = -all_btr_defs.min_key ();
1455 if (migrate_btr_def (def, min_cost))
1285 migrate_btr_def(btr_def def, int min_cost) argument
1452 int min_cost = -all_btr_defs.min_key (); local
H A Dira-color.c1132 int min_cost = INT_MAX;
1154 else if (min_cost > costs[j])
1155 min_cost = costs[j];
1161 if (ALLOCNO_UPDATED_CLASS_COST (a) > min_cost)
1162 ALLOCNO_UPDATED_CLASS_COST (a) = min_cost;
1680 int cost, mem_cost, min_cost, full_cost, min_full_cost, nwords, word;
1840 min_cost = min_full_cost = INT_MAX;
1873 if (min_cost > cost)
1874 min_cost = cost;
2753 int check, spill_cost, min_cost, nreg
1130 int min_cost = INT_MAX; local
1677 int cost, mem_cost, min_cost, full_cost, min_full_cost, nwords, word; local
2747 int check, spill_cost, min_cost, nregs, conflict_nregs, r, best; local
[all...]
H A Dira-costs.c2274 int cost, min_cost, *reg_costs;
2291 min_cost = INT_MAX;
2337 if (min_cost > reg_costs[j])
2338 min_cost = reg_costs[j];
2341 if (min_cost != INT_MAX)
2342 ALLOCNO_CLASS_COST (a) = min_cost;
2263 int cost, min_cost, *reg_costs; local
H A Dira.c1122 int i, cost, min_cost, best_cost;
1155 min_cost = INT_MAX;
1160 if (min_cost > cost)
1161 min_cost = cost;
1163 if (best_class == NO_REGS || best_cost > min_cost)
1166 best_cost = min_cost;
1115 int i, cost, min_cost, best_cost; local

Completed in 132 milliseconds