/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/src/ |
H A D | agrep.c | 191 static int best_cost; /* Best match cost found so far. */ variable 368 match_params.max_cost = best_cost; 376 if (best_match == 1 && best_cost == 0) 394 if (match.cost < best_cost) 395 best_cost = match.cost; 399 if (match.cost > best_cost) 795 best_cost = INT_MAX; 803 if (best_cost == INT_MAX) 809 match_params.max_cost = best_cost;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | ira-costs.c | 1259 int best_cost, allocno_cost; 1312 best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; 1332 if (temp_costs->cost[k] < best_cost) 1334 best_cost = temp_costs->cost[k]; 1337 else if (temp_costs->cost[k] == best_cost) 1346 if (best_cost > temp_costs->mem_cost) 1359 if (best_cost > temp_costs->mem_cost) 1373 pref[i] = best_cost > temp_costs->mem_cost ? NO_REGS : best; 1387 best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; 1388 allocno_cost = best_cost; 1253 int best_cost, allocno_cost; local [all...] |
H A D | expmed.c | 2427 struct mult_cost best_cost; 2480 best_cost = *cost_limit; 2562 new_limit.cost = best_cost.cost - op_cost; 2563 new_limit.latency = best_cost.latency - op_cost; 2568 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) 2571 best_cost = alg_in->cost; 2593 new_limit.cost = best_cost.cost - op_cost; 2594 new_limit.latency = best_cost.latency - op_cost; 2599 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) 2602 best_cost 2416 struct mult_cost best_cost; local [all...] |
H A D | tree-ssa-loop-ivopts.c | 5028 comp_cost best_cost, acost; local 5032 best_cost = iv_ca_cost (ivs); 5043 if (compare_costs (acost, best_cost) < 0) 5045 best_cost = acost; 5056 return best_cost; 5061 best_cost = iv_ca_prune (data, ivs, except_cand, delta); 5064 return best_cost; 5074 comp_cost best_cost, act_cost; local 5082 best_cost = iv_ca_cost (ivs); 5118 if (compare_costs (act_cost, best_cost) < 5195 comp_cost acost, best_cost = iv_ca_cost (ivs); local [all...] |
H A D | ira-color.c | 2978 int cost, best_cost; 2998 best_cost = best_slot_num = -1; 3043 if (cost > best_cost) 3045 best_cost = cost; 3051 if (best_cost >= 0) 2970 int cost, best_cost; local
|
H A D | ira.c | 849 int i, cost, min_cost, best_cost; 901 best_cost = INT_MAX; 919 if (best_class == NO_REGS || best_cost > min_cost) 922 best_cost = min_cost; 842 int i, cost, min_cost, best_cost; local
|
H A D | reload.c | 669 int best_cost = -1; 698 && (best_cost < 0 || best_cost >= cost)) 699 || best_cost > cost) 703 best_cost = REGISTER_MOVE_COST (outer, (enum reg_class) rclass, 665 int best_cost = -1; local
|
H A D | reload1.c | 1902 int best_cost = INT_MAX; 1987 if (this_cost < best_cost 1990 || (this_cost == best_cost 2001 best_cost = this_cost; 1893 int best_cost = INT_MAX; local
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | expmed.c | 2462 struct mult_cost best_cost; 2513 best_cost = *cost_limit; 2593 new_limit.cost = best_cost.cost - op_cost; 2594 new_limit.latency = best_cost.latency - op_cost; 2599 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) 2602 best_cost = alg_in->cost; 2634 new_limit.cost = best_cost.cost - op_cost; 2635 new_limit.latency = best_cost.latency - op_cost; 2640 if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) 2643 best_cost 2452 struct mult_cost best_cost; local [all...] |
H A D | tree-ssa-loop-ivopts.c | 4975 unsigned i, best_cost, acost; local 4979 best_cost = iv_ca_cost (ivs); 4990 if (acost < best_cost) 4992 best_cost = acost; 5003 return best_cost; 5008 best_cost = iv_ca_prune (data, ivs, except_cand, delta); 5011 return best_cost; 5021 unsigned best_cost, act_cost; local 5029 best_cost = iv_ca_cost (ivs); 5062 if (act_cost < best_cost) 5138 unsigned i, acost, best_cost = iv_ca_cost (ivs), n_ivs; local [all...] |
H A D | regclass.c | 1294 int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; 1320 else if (p->cost[class] < best_cost) 1322 best_cost = p->cost[class]; 1325 else if (p->cost[class] == best_cost) 1289 int best_cost = (1 << (HOST_BITS_PER_INT - 2)) - 1; local
|
H A D | reload.c | 685 int best_cost = -1; 714 && (best_cost < 0 || best_cost >= cost)) 715 || best_cost > cost) 719 best_cost = REGISTER_MOVE_COST (outer, class, dest_class); 681 int best_cost = -1; local
|
H A D | reload1.c | 1696 int best_cost = INT_MAX; 1743 if (this_cost < best_cost 1746 || (this_cost == best_cost 1757 best_cost = this_cost; 1687 int best_cost = INT_MAX; local
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/sh/ |
H A D | sh.c | 3343 int cost, best_cost = 10000; 3361 best_cost = shift_insns[right] + shift_insns[right + left]; 3366 best_cost = shift_insns[left + late_right] + shift_insns[late_right]; 3380 if (cost < best_cost) 3383 best_cost = cost; 3400 if (cost < best_cost) 3403 best_cost = cost; 3420 if (cost < best_cost) 3423 best_cost = cost; 3436 if (cost < best_cost) 3333 int cost, best_cost = 10000; local 3609 int cost = 0, best_cost; local [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/config/sh/ |
H A D | sh.c | 2445 int cost, best_cost = 10000; 2463 best_cost = shift_insns[right] + shift_insns[right + left]; 2468 best_cost = shift_insns[left + late_right] + shift_insns[late_right]; 2482 if (cost < best_cost) 2485 best_cost = cost; 2502 if (cost < best_cost) 2505 best_cost = cost; 2522 if (cost < best_cost) 2525 best_cost = cost; 2538 if (cost < best_cost) 2437 int cost, best_cost = 10000; local 2713 int cost = 0, best_cost; local 10200 int base_cost, best_cost, cost; local [all...] |