| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| 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 …]
|
| 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 …]
|
| 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 …]
|
| 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 …]
|
| 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 …]
|
| 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 …]
|
| D | mcf.cc | 90 gcov_type cost; member
221 fprintf (file, " cost=%" PRId64 ".", fedge->cost); in dump_fixup_edge()
364 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) in add_edge() argument
370 curr_edge->cost = cost; in add_edge()
384 edge_type type, gcov_type weight, gcov_type cost, in add_fixup_edge() argument
387 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_fixup_edge()
399 gcov_type rflow, gcov_type cost) in add_rfixup_edge() argument
401 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_rfixup_edge()
673 pfedge->cost /= 2; in create_fixup_graph()
683 REVERSE_NORMALIZED_EDGE, 0, r_pfedge->cost, in create_fixup_graph()
[all …]
|
| D | lra-assigns.cc | 478 find_hard_regno_for_1 (int regno, int *cost, int try_only_hard_regno, in find_hard_regno_for_1() argument
682 *cost = best_cost - lra_reg_info[regno].freq; in find_hard_regno_for_1()
690 find_hard_regno_for (int regno, int *cost, int try_only_hard_regno, bool first_p) in find_hard_regno_for() argument
702 hard_regno = find_hard_regno_for_1 (regno, cost, -1, first_p, in find_hard_regno_for()
709 return find_hard_regno_for_1 (regno, cost, try_only_hard_regno, first_p, in find_hard_regno_for()
730 int another_regno, cost; in update_hard_regno_preference() local
756 cost = cp->freq < div ? 1 : cp->freq / div; in update_hard_regno_preference()
758 (another_regno, hard_regno, cost); in update_hard_regno_preference()
926 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; in spill_for() local
1019 && find_hard_regno_for (reload_regno, &cost, -1, first_p) < 0) in spill_for()
[all …]
|
| D | haifa-sched.cc | 230 #define INSN_COST(INSN) (HID (INSN)->cost)
1389 int cost; in insn_sched_cost() local
1399 cost = insn_default_latency (insn); in insn_sched_cost()
1400 if (cost < 0) in insn_sched_cost()
1401 cost = 0; in insn_sched_cost()
1403 return cost; in insn_sched_cost()
1406 cost = INSN_COST (insn); in insn_sched_cost()
1408 if (cost < 0) in insn_sched_cost()
1421 cost = insn_default_latency (insn); in insn_sched_cost()
1422 if (cost < 0) in insn_sched_cost()
[all …]
|
| D | gimple-ssa-strength-reduction.cc | 343 int cost; member in incr_info_d
1958 fprintf (dump_file, "\n cost: %d", incr_vec[i].cost); in dump_incr_vec()
2540 int cost = 0; in phi_add_costs_1() local
2571 cost += phi_add_costs_1 (arg_def, c, one_add_cost, spread); in phi_add_costs_1()
2573 if (cost >= COST_INFINITE || *spread > MAX_SPREAD) in phi_add_costs_1()
2581 cost += one_add_cost; in phi_add_costs_1()
2586 return cost; in phi_add_costs_1()
2630 int cost = add_costs - mult_savings - c->dead_savings; in replace_uncond_cands_and_profitable_phis() local
2638 fprintf (dump_file, " cost = %d\n", cost); in replace_uncond_cands_and_profitable_phis()
2639 if (cost <= COST_NEUTRAL) in replace_uncond_cands_and_profitable_phis()
[all …]
|
| D | spellcheck.cc | 100 edit_distance_t cost; in get_edit_distance() local
103 cost = 0; in get_edit_distance()
105 cost = CASE_COST; in get_edit_distance()
107 cost = BASE_COST; in get_edit_distance()
110 edit_distance_t substitution = v_one_ago[j] + cost; in get_edit_distance()
|
| D | ira.cc | 569 int cl, cl2, mode, cost; in setup_class_subset_and_memory_move_costs() local
615 cost = ira_memory_move_cost[mode][cl2][0]; in setup_class_subset_and_memory_move_costs()
616 if (cost > ira_max_memory_move_cost[mode][cl][0]) in setup_class_subset_and_memory_move_costs()
617 ira_max_memory_move_cost[mode][cl][0] = cost; in setup_class_subset_and_memory_move_costs()
618 cost = ira_memory_move_cost[mode][cl2][1]; in setup_class_subset_and_memory_move_costs()
619 if (cost > ira_max_memory_move_cost[mode][cl][1]) in setup_class_subset_and_memory_move_costs()
620 ira_max_memory_move_cost[mode][cl][1] = cost; in setup_class_subset_and_memory_move_costs()
784 int cost, i, n, curr; in setup_pressure_classes() local
821 cost = ira_register_move_cost[m][cl][cl]; in setup_pressure_classes()
822 if (cost <= ira_max_memory_move_cost[m][cl][1] in setup_pressure_classes()
[all …]
|
| D | cfgloopanal.cc | 407 unsigned cost; in estimate_reg_pressure_cost() local
424 cost = target_reg_cost [speed] * n_new; in estimate_reg_pressure_cost()
428 cost = target_spill_cost [speed] * n_new; in estimate_reg_pressure_cost()
437 cost /= 2; in estimate_reg_pressure_cost()
439 return cost; in estimate_reg_pressure_cost()
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/i386/ |
| 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/games/phantasia/ |
| 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/games/trek/ |
| 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/ |
| 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/ |
| 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/gpl3/gcc/dist/gcc/lto/ |
| 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 …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/config/arm/ |
| D | arm.cc | 9848 int words, cost; in thumb1_size_rtx_costs() local
9894 cost = COSTS_N_INSNS (words); in thumb1_size_rtx_costs()
9904 cost += COSTS_N_INSNS (1); in thumb1_size_rtx_costs()
9905 return cost; in thumb1_size_rtx_costs()
10042 arm_unspec_cost (rtx x, enum rtx_code /* outer_code */, bool speed_p, int *cost) in arm_unspec_cost() argument
10053 *cost = COSTS_N_INSNS (ARM_NUM_REGS (GET_MODE (x))); in arm_unspec_cost()
10055 *cost += (ARM_NUM_REGS (GET_MODE (x)) * extra_cost->ldst.load in arm_unspec_cost()
10059 *cost += arm_address_cost (XEXP (XVECEXP (x, 0, 0), 0), GET_MODE (x), in arm_unspec_cost()
10065 *cost = COSTS_N_INSNS (ARM_NUM_REGS (GET_MODE (x))); in arm_unspec_cost()
10067 *cost += (ARM_NUM_REGS (GET_MODE (x)) * extra_cost->ldst.store in arm_unspec_cost()
[all …]
|
| /netbsd/src/external/bsd/tre/dist/po/ |
| D | sv.po | 114 " -D, --delete-cost=NUM\t set cost of missing characters\n"
115 " -I, --insert-cost=NUM\t set cost of extra characters\n"
116 " -S, --substitute-cost=NUM set cost of wrong characters\n"
140 " -s, --show-cost\t print match cost with output\n"
152 " -D, --delete-cost=ANTAL ställ in kostnad för saknade tecken\n"
153 " -I, --insert-cost=ANTAL ställ in kostnad för extra tecken\n"
154 " -S, --substitute-cost=ANTAL ställ in kostnad för felaktiga tecken\n"
178 " -s, --show-cost\t skriv ut kostnad för matchning med utdata\n"
|
| D | fi.po | 114 " -D, --delete-cost=NUM\t set cost of missing characters\n"
115 " -I, --insert-cost=NUM\t set cost of extra characters\n"
116 " -S, --substitute-cost=NUM set cost of wrong characters\n"
140 " -s, --show-cost\t print match cost with output\n"
153 " -D, --delete-cost=N aseta puuttuvien merkkien hinnaksi N\n"
154 " -I, --insert-cost=N aseta ylim��r�isten merkkien hinnaksi N\n"
155 " -S, --substitute-cost=N aseta v��rien merkkien hinnaksi N\n"
184 " -s, --show-cost tulosta virheiden m��r�\n"
|
| /netbsd/src/external/bsd/bzip2/dist/ |
| D | compress.c | 258 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
358 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
385 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
386 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
387 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
393 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
403 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
|
| /netbsd/src/sys/arch/mvme68k/stand/sboot/ |
| D | oc_cksum.s | 72 | loop branch cost and unroll-16 doesn't. But the tests also showed
84 | The cost of calling this routine was typically 10% of the per-
85 | kilobyte cost. E.g., checksumming zero bytes on a 3/60 cost 9us
86 | and each additional byte cost 125ns. With the high fixed cost,
|
| /netbsd/src/sys/arch/m68k/m68k/ |
| D | oc_cksum.s | 68 | loop branch cost and unroll-16 doesn't. But the tests also showed
80 | The cost of calling this routine was typically 10% of the per-
81 | kilobyte cost. E.g., checksumming zero bytes on a 3/60 cost 9us
82 | and each additional byte cost 125ns. With the high fixed cost,
|