| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | expmed.h | 59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
98 struct mult_cost cost; member
123 struct mult_cost cost; member
144 int cost[2][NUM_MODE_IPV_INT]; member
263 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
331 set_zero_cost (bool speed, int cost) in set_zero_cost() argument
[all …]
|
| H A D | tree-ssa-loop-ivopts.cc | 208 comp_cost (): cost (0), complexity (0), scratch (0) in comp_cost()
211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0) in comp_cost() argument
212 : cost (cost), complexity (complexity), scratch (scratch) in comp_cost()
222 comp_cost operator+= (comp_cost cost);
240 comp_cost operator-= (comp_cost cost);
251 int64_t cost; /* The runtime cost. */ member in comp_cost
265 return cost == INFTY; in infinite_cost_p()
274 gcc_assert (cost1.cost + cost2.cost < infinite_cost.cost); in operator +()
275 cost1.cost += cost2.cost; in operator +()
288 gcc_assert (cost1.cost - cost2.cost < infinite_cost.cost); in operator -()
[all …]
|
| H A D | ira-color.cc | 58 int64_t cost; member
265 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost) in add_allocno_hard_regs() argument
273 hv->cost += cost; in add_allocno_hard_regs()
279 hv->cost = cost; in add_allocno_hard_regs()
309 if (hv2->cost > hv1->cost) in allocno_hard_regs_compare()
311 else if (hv2->cost < hv1->cost) in allocno_hard_regs_compare()
393 hv2 = add_allocno_hard_regs (temp_set, hv->cost); in add_allocno_hard_regs_to_forest()
409 hv = add_allocno_hard_regs (temp_set, hv->cost); in add_allocno_hard_regs_to_forest()
531 fprintf (f, ")@%" PRId64"\n", node->hard_regs->cost); in print_hard_regs_subforest()
1409 int cost, update_cost, update_conflict_cost; in update_costs_from_allocno() local
[all …]
|
| H A D | tree-ssa-coalesce.cc | 54 int cost; member
151 int cost = frequency; in coalesce_cost() local
153 if (!cost) in coalesce_cost()
154 cost = 1; in coalesce_cost()
157 cost = 1; in coalesce_cost()
159 return cost; in coalesce_cost()
252 ret = node->cost; in pop_best_coalesce()
335 pair->cost = 0; in find_coalesce_pair()
371 if (node->cost < MUST_COALESCE_COST - 1) in add_coalesce()
374 node->cost += value; in add_coalesce()
[all …]
|
| H A D | expmed.cc | 201 int cost = add_cost (speed, mode); in init_expmed_one_mode() local
202 set_shiftadd_cost (speed, mode, 0, cost); in init_expmed_one_mode()
203 set_shiftsub0_cost (speed, mode, 0, cost); in init_expmed_one_mode()
204 set_shiftsub1_cost (speed, mode, 0, cost); in init_expmed_one_mode()
2761 alg_out->cost.cost = cost_limit->cost + 1; in synth_mult()
2762 alg_out->cost.latency = cost_limit->latency + 1; in synth_mult()
2764 if (cost_limit->cost < 0 in synth_mult()
2765 || (cost_limit->cost == 0 && cost_limit->latency <= 0)) in synth_mult()
2780 alg_out->cost.cost = 0; in synth_mult()
2781 alg_out->cost.latency = 0; in synth_mult()
[all …]
|
| H A D | ira-costs.cc | 57 int cost[1]; member
642 int *pp_costs = pp->cost; in record_reg_classes()
879 int *pp_costs = pp->cost; in record_reg_classes()
1059 int *pp_costs = pp->cost, *qq_costs = qq->cost; in record_reg_classes()
1306 pp_costs = pp->cost; in record_address_regs()
1377 int cost_factor = 1, cost, k; in record_operand_costs() local
1415 cost = (i == 0 in record_operand_costs()
1418 cost *= cost_factor; in record_operand_costs()
1419 op_costs[i]->cost[k] = cost * frequency; in record_operand_costs()
1437 op_costs[i]->cost[k] = -frequency; in record_operand_costs()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | expmed.h | 59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
73 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
74 || ((X)->cost == (Y)->cost \
98 struct mult_cost cost; member
123 struct mult_cost cost; member
153 int cost[2][NUM_MODE_IPV_INT]; member
272 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
340 set_zero_cost (bool speed, int cost) in set_zero_cost() argument
[all …]
|
| H A D | tree-ssa-loop-ivopts.c | 208 comp_cost (): cost (0), complexity (0), scratch (0) in comp_cost()
211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0)
212 : cost (cost), complexity (complexity), scratch (scratch) in cost() function
222 comp_cost operator+= (comp_cost cost);
240 comp_cost operator-= (comp_cost cost);
251 int64_t cost; /* The runtime cost. */ variable
265 return cost == INFTY; in infinite_cost_p()
274 gcc_assert (cost1.cost + cost2.cost < infinite_cost.cost);
275 cost1.cost += cost2.cost;
288 gcc_assert (cost1.cost - cost2.cost < infinite_cost.cost);
[all …]
|
| H A D | tree-ssa-coalesce.c | 54 int cost; member
151 int cost = frequency; in coalesce_cost() local
153 if (!cost) in coalesce_cost()
154 cost = 1; in coalesce_cost()
157 cost = 1; in coalesce_cost()
159 return cost; in coalesce_cost()
252 ret = node->cost; in pop_best_coalesce()
335 pair->cost = 0; in find_coalesce_pair()
371 if (node->cost < MUST_COALESCE_COST - 1) in add_coalesce()
374 node->cost += value; in add_coalesce()
[all …]
|
| H A D | ira-color.c | 53 int64_t cost; member
260 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost) in add_allocno_hard_regs() argument
268 hv->cost += cost; in add_allocno_hard_regs()
274 hv->cost = cost; in add_allocno_hard_regs()
304 if (hv2->cost > hv1->cost) in allocno_hard_regs_compare()
306 else if (hv2->cost < hv1->cost) in allocno_hard_regs_compare()
388 hv2 = add_allocno_hard_regs (temp_set, hv->cost); in add_allocno_hard_regs_to_forest()
404 hv = add_allocno_hard_regs (temp_set, hv->cost); in add_allocno_hard_regs_to_forest()
526 fprintf (f, ")@%" PRId64"\n", node->hard_regs->cost); in print_hard_regs_subforest()
1367 int cost, update_cost, update_conflict_cost; in update_costs_from_allocno() local
[all …]
|
| H A D | expmed.c | 199 int cost = add_cost (speed, mode); in init_expmed_one_mode() local
200 set_shiftadd_cost (speed, mode, 0, cost); in init_expmed_one_mode()
201 set_shiftsub0_cost (speed, mode, 0, cost); in init_expmed_one_mode()
202 set_shiftsub1_cost (speed, mode, 0, cost); in init_expmed_one_mode()
2745 alg_out->cost.cost = cost_limit->cost + 1; in synth_mult()
2746 alg_out->cost.latency = cost_limit->latency + 1; in synth_mult()
2748 if (cost_limit->cost < 0 in synth_mult()
2749 || (cost_limit->cost == 0 && cost_limit->latency <= 0)) in synth_mult()
2764 alg_out->cost.cost = 0; in synth_mult()
2765 alg_out->cost.latency = 0; in synth_mult()
[all …]
|
| H A D | ira-costs.c | 56 int cost[1]; member
610 int *pp_costs = pp->cost; in record_reg_classes()
845 int *pp_costs = pp->cost; in record_reg_classes()
1023 int *pp_costs = pp->cost, *qq_costs = qq->cost; in record_reg_classes()
1246 pp_costs = pp->cost; in record_address_regs()
1313 int cost, k; in record_operand_costs() local
1333 cost = (i == 0 in record_operand_costs()
1337 op_costs[i]->cost[k] = cost * frequency; in record_operand_costs()
1345 op_costs[i]->cost[k] in record_operand_costs()
1351 op_costs[i]->cost[k] in record_operand_costs()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/i386/ |
| H A D | x86-tune-sched.cc | 242 ix86_adjust_cost (rtx_insn *insn, int dep_type, rtx_insn *dep_insn, int cost, in ix86_adjust_cost() argument
258 return cost; in ix86_adjust_cost()
279 cost += 1; in ix86_adjust_cost()
282 cost += 1; in ix86_adjust_cost()
286 cost = 0; in ix86_adjust_cost()
292 cost += 1; in ix86_adjust_cost()
298 cost += 5; in ix86_adjust_cost()
306 cost += 1; in ix86_adjust_cost()
320 cost = 1; in ix86_adjust_cost()
321 else if (cost > 1) in ix86_adjust_cost()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/i386/ |
| H A D | x86-tune-sched.c | 240 ix86_adjust_cost (rtx_insn *insn, int dep_type, rtx_insn *dep_insn, int cost, in ix86_adjust_cost() argument
256 return cost; in ix86_adjust_cost()
277 cost += 1; in ix86_adjust_cost()
280 cost += 1; in ix86_adjust_cost()
284 cost = 0; in ix86_adjust_cost()
290 cost += 1; in ix86_adjust_cost()
296 cost += 5; in ix86_adjust_cost()
304 cost += 1; in ix86_adjust_cost()
318 cost = 1; in ix86_adjust_cost()
319 else if (cost > 1) in ix86_adjust_cost()
[all …]
|
| /netbsd-src/games/phantasia/ |
| H A D | misc.c | 165 double cost; /* cost of purchase */ in tradingpost() local
191 cost = blessingcost; in tradingpost()
193 cost = Menu[loop].cost; in tradingpost()
194 printw("(%d) %-12s: %6.0f\n", loop + 1, Menu[loop].item, cost); in tradingpost()
232 Menu[0].cost, floor(Player.p_gold / Menu[0].cost)); in tradingpost()
233 cost = (numitems = floor(infloat())) * Menu[0].cost; in tradingpost()
235 if (cost > Player.p_gold || numitems < 0) in tradingpost()
239 Player.p_gold -= cost; in tradingpost()
249 Menu[1].cost, floor(Player.p_gold / Menu[1].cost)); in tradingpost()
250 cost = (numitems = floor(infloat())) * Menu[1].cost; in tradingpost()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/d/dmd/root/ |
| H A D | speller.d | 70 int cost = int.max; in spellerX() local
81 if (combineSpellerResult(p, cost, np, ncost)) in spellerX()
98 if (combineSpellerResult(p, cost, np, ncost)) in spellerX()
115 if (combineSpellerResult(p, cost, np, ncost)) in spellerX()
132 if (combineSpellerResult(p, cost, np, ncost)) in spellerX()
152 auto spellerY(alias dg)(const(char)[] seed, size_t index, out int cost) in spellerY()
165 cost = int.max; // start with worst possible match in spellerY()
174 if (combineSpellerResult(p, cost, np, ncost)) // compare with prev match in spellerY()
188 if (combineSpellerResult(p, cost, np, ncost)) in spellerY()
201 if (combineSpellerResult(p, cost, np, ncost)) in spellerY()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/ |
| H A D | speller.c | 28 bool combineSpellerResult(void*& p, int& cost, void* np, int ncost) in combineSpellerResult() argument
30 if (np && ncost < cost) in combineSpellerResult()
33 cost = ncost; in combineSpellerResult()
34 if (cost <= 0) in combineSpellerResult()
41 const char *charset, size_t index, int* cost) in spellerY() argument
59 *cost = INT_MAX; in spellerY()
69 if (combineSpellerResult(p, *cost, np, ncost)) in spellerY()
85 if (combineSpellerResult(p, *cost, np, ncost)) in spellerY()
100 if (combineSpellerResult(p, *cost, np, ncost)) in spellerY()
125 int cost = INT_MAX, ncost = 0; in spellerX() local
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/nds32/ |
| H A D | nds32-cost.c | 64 int cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); in nds32_rtx_costs_speed_prefer() local
110 cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); in nds32_rtx_costs_speed_prefer()
121 *total = cost; in nds32_rtx_costs_speed_prefer()
129 *total = cost; in nds32_rtx_costs_speed_prefer()
142 *total = cost; in nds32_rtx_costs_speed_prefer()
152 *total = cost; in nds32_rtx_costs_speed_prefer()
155 *total = cost; in nds32_rtx_costs_speed_prefer()
159 *total = cost; in nds32_rtx_costs_speed_prefer()
168 *total = cost; in nds32_rtx_costs_speed_prefer()
189 *total = cost; in nds32_rtx_costs_speed_prefer()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/nds32/ |
| H A D | nds32-cost.cc | 64 int cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); in nds32_rtx_costs_speed_prefer() local
110 cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); in nds32_rtx_costs_speed_prefer()
121 *total = cost; in nds32_rtx_costs_speed_prefer()
129 *total = cost; in nds32_rtx_costs_speed_prefer()
142 *total = cost; in nds32_rtx_costs_speed_prefer()
152 *total = cost; in nds32_rtx_costs_speed_prefer()
155 *total = cost; in nds32_rtx_costs_speed_prefer()
159 *total = cost; in nds32_rtx_costs_speed_prefer()
168 *total = cost; in nds32_rtx_costs_speed_prefer()
189 *total = cost; in nds32_rtx_costs_speed_prefer()
[all …]
|
| /netbsd-src/games/trek/ |
| H A D | computer.c | 117 int cost; in computer() local
228 cost = pow(0.90, dist) * 98.0 + 0.5; in computer()
230 cost); in computer()
240 cost = (dist + 0.05) * warpfact * warpfact * warpfact; in computer()
244 warpfact, dist, time, cost, cost + cost); in computer()
251 cost = 20 + 100 * dist; in computer()
254 dist, time, cost); in computer()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| H A D | fusion.md | 39 (set_attr "cost" "8")
60 (set_attr "cost" "8")
81 (set_attr "cost" "8")
102 (set_attr "cost" "8")
123 (set_attr "cost" "8")
144 (set_attr "cost" "8")
165 (set_attr "cost" "8")
186 (set_attr "cost" "8")
207 (set_attr "cost" "8")
229 (set_attr "cost" "8")
[all …]
|
| /netbsd-src/external/bsd/tre/dist/lib/ |
| H A D | tre-match-approx.c | 391 int cost, cost0; in tre_tnfa_run_approx() local
402 cost = reach[id].costs[depth][TRE_M_COST]; in tre_tnfa_run_approx()
404 cost += reach[id].params.cost_ins; in tre_tnfa_run_approx()
405 if (cost > reach[id].params.max_cost) in tre_tnfa_run_approx()
419 cost0 = cost; in tre_tnfa_run_approx()
451 reach_next[id].costs[depth][TRE_M_COST] = cost; in tre_tnfa_run_approx()
489 int cost, cost0; in tre_tnfa_run_approx() local
498 cost = reach_p->costs[depth][TRE_M_COST]; in tre_tnfa_run_approx()
500 cost += reach_p->params.cost_del; in tre_tnfa_run_approx()
504 if (cost > reach_p->params.max_cost in tre_tnfa_run_approx()
[all …]
|
| /netbsd-src/external/zlib/pigz/dist/zopfli/ |
| H A D | squeeze.c | 129 double cost = 0; in GetCostFixed() local
130 if (lsym <= 279) cost += 7; in GetCostFixed()
131 else cost += 8; in GetCostFixed()
132 cost += 5; /* Every dist symbol has length 5. */ in GetCostFixed()
133 return cost + dbits + lbits; in GetCostFixed()
436 double cost = GetBestLengths( in LZ77OptimalRun() local
443 assert(cost < ZOPFLI_LARGE_FLOAT); in LZ77OptimalRun()
444 return cost; in LZ77OptimalRun()
459 double cost; in ZopfliLZ77Optimal() local
487 cost = ZopfliCalculateBlockSize(currentstore.litlens, currentstore.dists, in ZopfliLZ77Optimal()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/lto/ |
| H A D | lto-partition.c | 484 int64_t cost = 0, internal = 0; in lto_balanced_map() local
614 cost -= edge_cost, internal += edge_cost; in lto_balanced_map()
616 cost += edge_cost; in lto_balanced_map()
633 cost -= edge_cost, internal += edge_cost; in lto_balanced_map()
635 cost += edge_cost; in lto_balanced_map()
659 cost--, internal++; in lto_balanced_map()
661 cost++; in lto_balanced_map()
672 cost--, internal++; in lto_balanced_map()
674 cost++; in lto_balanced_map()
698 cost--, internal++; in lto_balanced_map()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/lto/ |
| H A D | lto-partition.cc | 484 int64_t cost = 0, internal = 0; in lto_balanced_map() local
615 cost -= edge_cost, internal += edge_cost; in lto_balanced_map()
617 cost += edge_cost; in lto_balanced_map()
634 cost -= edge_cost, internal += edge_cost; in lto_balanced_map()
636 cost += edge_cost; in lto_balanced_map()
660 cost--, internal++; in lto_balanced_map()
662 cost++; in lto_balanced_map()
673 cost--, internal++; in lto_balanced_map()
675 cost++; in lto_balanced_map()
699 cost--, internal++; in lto_balanced_map()
[all …]
|