Home
last modified time | relevance | path

Searched refs:cost (Results 1 – 25 of 382) sorted by relevance

12345678910>>...16

/openbsd/games/phantasia/
H A Dmisc.c257 cost = Menu[loop].cost; in tradingpost()
296 Menu[0].cost, floor(Player.p_gold / Menu[0].cost)); in tradingpost()
297 cost = (numitems = floor(infloat())) * Menu[0].cost; in tradingpost()
313 Menu[1].cost, floor(Player.p_gold / Menu[1].cost)); in tradingpost()
314 cost = (numitems = floor(infloat())) * Menu[1].cost; in tradingpost()
334 Menu[2].cost, floor(Player.p_gold / Menu[2].cost)); in tradingpost()
335 cost = (numitems = floor(infloat())) * Menu[2].cost; in tradingpost()
356 Menu[3].cost, floor(Player.p_gold / Menu[3].cost)); in tradingpost()
357 cost = (numitems = floor(infloat())) * Menu[3].cost; in tradingpost()
378 cost = (numitems = floor(infloat())) * Menu[4].cost; in tradingpost()
[all …]
/openbsd/usr.sbin/ospfd/
H A Drde_spf.c250 v->cost = w->cost + in rt_calc()
314 v->cost = r->cost; in asext_calc()
464 if (c->cost > v->cost) { in cand_list_add()
838 rtctl.cost = r->cost; in rt_dump()
877 rte->cost = cost; in rt_update()
903 if (cost < rte->cost) in rt_update()
911 if (cost < rte->cost) in rt_update()
913 else if (cost == rte->cost) in rt_update()
921 cost < rte->cost) in rt_update()
924 cost == rte->cost) in rt_update()
[all …]
/openbsd/usr.sbin/ospf6d/
H A Drde_spf.c412 v->cost = r->cost; in asext_calc()
584 if (c->cost > v->cost) { in cand_list_add()
959 rtctl.cost = r->cost; in rt_dump()
1002 rte->cost = cost; in rt_update()
1028 if (cost < rte->cost) in rt_update()
1030 else if (cost == rte->cost && in rt_update()
1035 if (cost < rte->cost) in rt_update()
1037 else if (cost == rte->cost) in rt_update()
1044 cost < rte->cost) in rt_update()
1047 cost == rte->cost) in rt_update()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dhaifa-sched.c573 return cost;
646 cost = MAX (cost, best_cost);
651 cost = actual_hazard (i, insn, clock, cost);
653 return cost;
701 cost = potential_hazard (i, insn, cost);
703 return cost;
736 cost = 0;
750 cost = 0;
759 cost = 0;
776 cost = 0;
[all …]
H A Dexpmed.c2067 short cost; member
2100 int cost; local
2151 cost += alg_in->cost;
2186 cost += alg_in->cost;
2203 cost += alg_in->cost;
2235 cost += alg_in->cost;
2254 cost += alg_in->cost;
2279 cost += alg_in->cost;
2298 cost += alg_in->cost;
2401 if (alg2.cost + negate_cost < alg.cost)
[all …]
H A Dregclass.c498 int cost; in init_reg_sets_1() local
515 cost = MAX (cost, move_cost [m][i][*p2]); in init_reg_sets_1()
521 cost = MAX (cost, move_cost [m][*p1][j]); in init_reg_sets_1()
523 move_cost[m][i][j] = cost; in init_reg_sets_1()
822 int cost[N_REG_CLASSES]; member
909 init_cost.cost[i] = 10000; in regclass_init()
1146 p->cost[j] += q->cost[j] * frequency;
1318 best_cost = p->cost[class];
1514 pp->cost[class]
1739 pp->cost[class]
[all …]
H A Dra-debug.c859 unsigned HOST_WIDE_INT cost; local
863 cost = 0;
868 cost += web->orig_spill_cost;
871 ra_debug_msg (level, HOST_WIDE_INT_PRINT_UNSIGNED, cost);
918 struct cost struct
920 unsigned HOST_WIDE_INT cost; member
924 struct cost load, store, regcopy, selfcopy, overall;
947 struct cost *pcost = NULL;
948 overall.cost += block_cost;
973 pcost->cost += block_cost;
[all …]
/openbsd/games/trek/
H A Dcomputer.c110 int cost; in computer() local
228 cost = pow(0.90, dist) * 98.0 + 0.5; in computer()
229 printf("Phasers are %d%% effective at that range\n", cost); in computer()
239 cost = (dist + 0.05) * warpfact * warpfact * warpfact; in computer()
242 warpfact, dist, time, cost, cost + cost); in computer()
249 cost = 20 + 100 * dist; in computer()
252 dist, time, cost); in computer()
/openbsd/gnu/gcc/gcc/
H A Drtl-factoring.c177 int cost; member
201 int cost; member
318 int cost = -1; in compute_rtx_cost() local
335 cost = elem->length; in compute_rtx_cost()
339 if (cost == -1) in compute_rtx_cost()
345 elem->length = cost; in compute_rtx_cost()
350 return cost != 0 ? cost : COSTS_N_INSNS (1); in compute_rtx_cost()
366 *cost = 0; in matching_length()
384 int cost; in match_seqs() local
404 pseq->cost = 0; in match_seqs()
[all …]
H A Dtree-ssa-loop-ivopts.c2351 use->cost_map[cand->id].cost = cost; in set_use_iv_cost()
2370 use->cost_map[i].cost = cost; in set_use_iv_cost()
2423 cost++; in seq_cost()
3240 if (!cost) in add_cost()
3241 cost = 1; in add_cost()
3316 (*cached)->cost = cost; in multiply_by_cost()
3543 cost = 0; in get_address_cost()
4494 if (a->cost < b->cost) in cheaper_cost_pair()
4497 if (a->cost > b->cost) in cheaper_cost_pair()
4501 if (a->cand->cost < b->cand->cost) in cheaper_cost_pair()
[all …]
H A Dexpmed.c2472 alg_out->cost.cost = cost_limit->cost + 1; in synth_mult()
2486 alg_out->cost.cost = 0; in synth_mult()
2596 alg_in->cost.cost += op_cost; in synth_mult()
2637 alg_in->cost.cost += op_cost; in synth_mult()
2657 alg_in->cost.cost += op_cost; in synth_mult()
2710 alg_in->cost.cost += op_cost; in synth_mult()
2749 alg_in->cost.cost += op_cost; in synth_mult()
2844 alg_hash[hash_index].cost.cost = best_cost.cost; in synth_mult()
2906 limit.cost = alg->cost.cost - op_cost; in choose_mult_variant()
2926 limit.cost = alg->cost.cost - op_cost; in choose_mult_variant()
[all …]
H A Dcfgloopanal.c487 unsigned cost = 0; in seq_cost() local
494 cost += rtx_cost (set, SET); in seq_cost()
496 cost++; in seq_cost()
499 return cost; in seq_cost()
555 unsigned cost = 0; in global_cost_for_size() local
558 cost += target_small_cost * size; in global_cost_for_size()
560 cost += target_pres_cost * size; in global_cost_for_size()
563 cost += target_pres_cost * size; in global_cost_for_size()
564 cost += target_spill_cost * n_uses * (regs_needed - target_avail_regs) / regs_needed; in global_cost_for_size()
567 return cost; in global_cost_for_size()
H A Dregclass.c499 int cost; in init_reg_sets_1() local
516 cost = MAX (cost, move_cost [m][i][*p2]); in init_reg_sets_1()
522 cost = MAX (cost, move_cost [m][*p1][j]); in init_reg_sets_1()
524 move_cost[m][i][j] = cost; in init_reg_sets_1()
807 int cost[N_REG_CLASSES]; member
917 init_cost.cost[i] = 10000; in regclass_init()
1148 p->cost[j] += q->cost[j] * frequency; in scan_one_insn()
1311 best_cost = p->cost[class]; in regclass()
1507 pp->cost[class] in record_reg_classes()
1733 pp->cost[class] in record_reg_classes()
[all …]
H A Dtree-ssa-loop-im.c402 data->cost += LIM_DATA (def_stmt)->cost; in add_dependency()
420 unsigned cost = 1; in stmt_cost() local
430 cost += 20; in stmt_cost()
444 cost += 20; in stmt_cost()
459 cost += 20; in stmt_cost()
466 return cost; in stmt_cost()
503 lim_data->cost += stmt_cost (stmt); in determine_max_movement()
667 LIM_DATA (stmt)->cost); in determine_invariantness_stmt()
723 unsigned cost = 0; in move_computations_stmt() local
738 cost = LIM_DATA (stmt)->cost; in move_computations_stmt()
[all …]
H A Dhaifa-sched.c663 cost = 0; in insn_cost1()
677 cost = 0; in insn_cost1()
691 cost = 1; in insn_cost1()
707 cost = 0; in insn_cost1()
1803 int cost; in early_queue_to_ready() local
1844 cost = 0; in early_queue_to_ready()
2421 int cost; in schedule_block() local
2489 cost = 1; in schedule_block()
2495 cost = 0; in schedule_block()
2501 cost = 0; in schedule_block()
[all …]
/openbsd/usr.sbin/dvmrpd/
H A Drde_srt.c79 rn->old_cost = rn->cost; in rt_expire_timer()
80 rn->cost = INFINITY_METRIC; in rt_expire_timer()
179 rn->cost = adj_metric; in rr_new_rt()
272 rr.metric = r->cost; in rt_snap()
295 rtctl.cost = r->cost; in rt_dump()
384 if (adj_metric > rn->cost) { in srt_check_route()
386 rn->cost = adj_metric; in srt_check_route()
390 rn->cost = adj_metric; in srt_check_route()
448 if (metric > rn->cost || (metric == rn->cost && in srt_current_forwarder()
607 rr.metric = rn->cost; in flash_update()
[all …]
/openbsd/sys/kern/
H A Dkern_sched.c471 int cost = sched_proc_to_cpu_cost(ci, p); in sched_choosecpu() local
473 if (choice == NULL || cost < last_cost) { in sched_choosecpu()
475 last_cost = cost; in sched_choosecpu()
515 int cost; in sched_steal_proc() local
526 cost = sched_proc_to_cpu_cost(self, p); in sched_steal_proc()
528 if (best == NULL || cost < bestcost) { in sched_steal_proc()
530 bestcost = cost; in sched_steal_proc()
582 int cost = 0; in sched_proc_to_cpu_cost() local
597 cost += sched_cost_runnable; in sched_proc_to_cpu_cost()
609 cost += sched_cost_runnable; in sched_proc_to_cpu_cost()
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Compress-Raw-Bzip2/bzip2-src/
H A Dcompress.c263 UInt16 cost[BZ_N_GROUPS] = {0, 0, 0, 0, 0, 0}; in sendMTFValues() local
364 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
391 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
392 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
393 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
399 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
409 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
/openbsd/gnu/usr.bin/perl/cpan/podlators/t/data/snippets/man/
H A Dnon-ascii10 It cost me E<165>12345! That should be an X.
15 It cost me X12345! That should be an X.
/openbsd/usr.sbin/tcpdump/
H A Dprint-stp.c158 u_int32_t cost; in stp_print_cbpdu() local
214 cost = EXTRACT_32BITS(p); in stp_print_cbpdu()
215 printf(" rootcost=%u", cost); in stp_print_cbpdu()
/openbsd/gnu/gcc/gcc/config/m32r/
H A Dm32r.opt38 mbranch-cost=1
42 mbranch-cost=2
44 Give branches their default cost
/openbsd/gnu/llvm/llvm/docs/Proposals/
H A DVectorizationPlan.rst13 both positive and negative. A cost model is therefore employed to identify the
19 cost reliably, and for performing their final translation into IR. This
35 Legal Step 1, and compute their cost.
37 Prune sub-optimal VPlans having relatively high cost.
55 2. Align Cost & Execute: each VPlan must support both estimating the cost and
56 generating the output IR code, such that the cost estimation evaluates the
77 a "Recipe", which is responsible for computing its cost and generating its
105 the cost and driving the generation of the output IR code it represents.
128 sequence of zero or more VPRecipes that model the cost and generation of the
185 itself including cost-based analyses for making these decisions, to fully
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/config/sh/
H A Dsh.c1751 cost
2096 int cost; local
2102 return cost;
7190 return cost;
7194 cost--;
7198 cost--;
7236 cost++;
7244 cost = 3;
7252 cost -= 1;
7256 cost -= 1;
[all …]
/openbsd/lib/libcurses/tty/
H A Dhashmap.c143 int cost = 0; in update_cost() local
149 cost++; in update_cost()
151 return cost; in update_cost()
157 int cost = 0; in update_cost_from_blank() local
167 cost++; in update_cost_from_blank()
169 return cost; in update_cost_from_blank()
/openbsd/games/monop/
H A Dmorg.c131 price = board[prop].cost/2; in m()
189 price = board[prop].cost/2; in unm()

12345678910>>...16