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

/freebsd-9.3-release/contrib/gcc/
H A Dexpmed.c2471 struct mult_cost best_cost;
2522 best_cost = *cost_limit;
2602 new_limit.cost = best_cost.cost - op_cost;
2603 new_limit.latency = best_cost.latency - op_cost;
2608 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
2611 best_cost = alg_in->cost;
2643 new_limit.cost = best_cost.cost - op_cost;
2644 new_limit.latency = best_cost.latency - op_cost;
2649 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
2652 best_cost
2461 struct mult_cost best_cost; local
[all...]
H A Dtree-ssa-loop-ivopts.c5011 unsigned i, best_cost, acost; local
5015 best_cost = iv_ca_cost (ivs);
5026 if (acost < best_cost)
5028 best_cost = acost;
5039 return best_cost;
5044 best_cost = iv_ca_prune (data, ivs, except_cand, delta);
5047 return best_cost;
5057 unsigned best_cost, act_cost; local
5065 best_cost = iv_ca_cost (ivs);
5098 if (act_cost < best_cost)
5174 unsigned i, acost, best_cost = iv_ca_cost (ivs), n_ivs; local
[all...]
H A Dregclass.c1288 int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1;
1314 else if (p->cost[class] < best_cost)
1316 best_cost = p->cost[class];
1319 else if (p->cost[class] == best_cost)
1324 if (p->mem_cost < best_cost)
1283 int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; local
H A Dreload.c661 int best_cost = -1;
690 && (best_cost < 0 || best_cost >= cost))
691 || best_cost > cost)
695 best_cost = REGISTER_MOVE_COST (outer, class, dest_class);
657 int best_cost = -1; local
H A Dreload1.c1722 int best_cost = INT_MAX;
1769 if (this_cost < best_cost
1772 || (this_cost == best_cost
1783 best_cost = this_cost;
1713 int best_cost = INT_MAX; local

Completed in 143 milliseconds