Home
last modified time | relevance | path

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

12345678

/NextBSD/contrib/gcc/
HDrtl-factoring.c151 SEQ->cost = 0; \
154 SEQ->cost += compute_rtx_cost (x); \
177 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()
341 cost = get_attr_length (insn); 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()
[all …]
HDtree-ssa-loop-ivopts.c136 unsigned cost; /* The cost. */ member
186 unsigned cost; /* Cost of the candidate. */ member
273 unsigned cost; member
2337 struct iv_use *use, struct iv_cand *cand, unsigned cost, in set_use_iv_cost() argument
2342 if (cost == INFTY) in set_use_iv_cost()
2351 use->cost_map[cand->id].cost = cost; in set_use_iv_cost()
2370 use->cost_map[i].cost = cost; in set_use_iv_cost()
2414 unsigned cost = 0; in seq_cost() local
2421 cost += rtx_cost (set, SET); in seq_cost()
2423 cost++; in seq_cost()
[all …]
HDexpmed.c2351 short cost; /* Total rtx_cost of the multiplication sequence. */ member
2358 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
2359 || ((X)->cost == (Y) && (X)->latency < (Y)))
2365 #define CHEAPER_MULT_COST(X,Y) ((X)->cost < (Y)->cost \
2366 || ((X)->cost == (Y)->cost \
2390 struct mult_cost cost; member
2415 struct mult_cost cost; member
2472 alg_out->cost.cost = cost_limit->cost + 1; in synth_mult()
2473 alg_out->cost.latency = cost_limit->latency + 1; in synth_mult()
2475 if (cost_limit->cost < 0 in synth_mult()
[all …]
HDcfgloopanal.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()
HDregclass.c499 int cost; in init_reg_sets_1() local
510 cost = REGISTER_MOVE_COST (m, i, j); in init_reg_sets_1()
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()
529 may_move_in_cost[m][i][j] = cost; in init_reg_sets_1()
534 may_move_out_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()
950 costs[i].cost[(enum reg_class) class]); in dump_regclass()
[all …]
HDtree-ssa-loop-im.c93 unsigned cost; /* Cost of the computation performed by the member
402 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()
670 if (LIM_DATA (stmt)->cost >= LIM_EXPENSIVE) in determine_invariantness_stmt()
[all …]
HDhaifa-sched.c646 int cost = INSN_COST (insn); in insn_cost1() local
648 if (cost < 0) in insn_cost1()
661 cost = insn_default_latency (insn); in insn_cost1()
662 if (cost < 0) in insn_cost1()
663 cost = 0; in insn_cost1()
665 INSN_COST (insn) = cost; in insn_cost1()
671 return cost; in insn_cost1()
677 cost = 0; in insn_cost1()
685 cost = 0; in insn_cost1()
688 cost = (insn_default_latency (insn) in insn_cost1()
[all …]
HDtree-ssa-live.c1204 node->cost = 0; in find_partition_pair()
1227 int cost = frequency; in coalesce_cost() local
1229 if (!cost) in coalesce_cost()
1230 cost = 1; in coalesce_cost()
1232 cost = 1; in coalesce_cost()
1236 cost *= 2; in coalesce_cost()
1237 return cost; in coalesce_cost()
1255 node->cost += value; in add_coalesce()
1264 return (*(partition_pair_p *)p2)->cost - (*(partition_pair_p *)p1)->cost; in compare_pairs()
1325 if (chain->cost < chain->next->cost) in sort_coalesce_list()
[all …]
HDbt-load.c83 int cost; member
313 this->cost = basic_block_freq (bb); in add_btr_def()
323 fibheap_insert (all_btr_defs, -this->cost, this); in add_btr_def()
329 this->cost); in add_btr_def()
1176 def->cost = basic_block_freq (new_def_bb); in move_btr_def()
1290 INSN_UID (def->insn), def->cost, min_cost); in migrate_btr_def()
1336 !give_up && try && try != ENTRY_BLOCK_PTR && def->cost >= min_cost; in migrate_btr_def()
1444 fibheap_insert (all_btr_defs, -def->cost, (void *) def); in migrate_btr_defs()
1449 INSN_UID (def->insn), def->cost); in migrate_btr_defs()
/NextBSD/contrib/llvm/patches/
HDpatch-06-llvm-r248439-fdiv-hoisting.diff4 cost model
6 ...because that's what the cost model was intended to do.
14 for this cost model change and preserve the righteousness for the bug
32 // Otherwise, the default basic cost is used.
58 +; calculations that use the TTI cost model or use a different cost
60 +; We should also be using the TTI cost model later - for example in
/NextBSD/contrib/bzip2/
HDcompress.c256 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
356 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
391 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
401 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
/NextBSD/contrib/libxo/tests/core/saved/
HDtest_01.XP.out94 <cost>425</cost>
95 <cost>455</cost>
HDtest_01.X.out1 …"value4">bolt</item><item test4="value4">water</item></data4><cost>425</cost><cost>455</cost></top>
HDtest_10.XP.out98 <cost>425</cost>
99 <cost>455</cost>
HDtest_10.X.out1 …="value4">bolt</item><item test4="value4">water</item></data><cost>425</cost><cost>455</cost></top>
HDtest_01.J.out1 …5,"on-order":1}]}, "data4": {"item": ["gum","rope","ladder","bolt","water"]},"cost":425,"cost":455}
HDtest_01.JP.out103 "cost": 425,
104 "cost": 455
HDtest_10.JP.out110 "cost": 425,
111 "cost": 455
HDtest_10.J.out1 …45,"on-order":1}]}, "data": {"item": ["gum","rope","ladder","bolt","water"]},"cost":425,"cost":455}
HDtest_01.E.out115 op content: [cost] [425]
116 op content: [cost] [455]
HDtest_10.E.out122 op content: [cost] [425]
123 op content: [cost] [455]
/NextBSD/sys/dev/isp/
HDHardware.txt27 Approx cost: 1K$ for a 2200
33 Approx cost: ??????
42 Approx cost: 850$ for a P-0036
57 Approx cost: 1.5K$ for Vixel 1000, 2.5K$ for 2000
64 (cost: I have no idea... certainly less than a switch)
84 Approx cost of a Brocade 2400 with no GBICs is about 8K$ when
97 (cost: no idea)
104 (cost: very very expensive, 40K$ plus)
120 Approx cost: I don't know what optical is- you can expect to pay maybe
203 Approx Cost: You'll find that FC drives are the same cost if not
/NextBSD/contrib/ncurses/ncurses/tty/
HDhashmap.c134 int cost = 0; in update_cost() local
139 cost++; in update_cost()
141 return cost; in update_cost()
147 int cost = 0; in update_cost_from_blank() local
156 cost++; in update_cost_from_blank()
158 return cost; in update_cost_from_blank()
/NextBSD/contrib/ntp/util/
HDntptime.c104 int cost = 0; in main() local
130 cost++; in main()
241 if (cost) { in main()
/NextBSD/crypto/openssh/
HDkrl.c443 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; in choose_next_state() local
489 cost = cost_bitmap; in choose_next_state()
490 if (cost_range < cost) { in choose_next_state()
492 cost = cost_range; in choose_next_state()
494 if (cost_list < cost) { in choose_next_state()
496 cost = cost_list; in choose_next_state()
498 if (cost_bitmap_restart < cost) { in choose_next_state()
501 cost = cost_bitmap_restart; in choose_next_state()

12345678