Searched refs:cost (Results 1 - 25 of 37) sorted by relevance

12

/freebsd-11-stable/contrib/gcc/
H A Drtl-factoring.c140 /* Multiplier for cost of sequence call to avoid abstracting short
146 /* Recomputes the cost of MSEQ pattern/matching sequence. */
151 SEQ->cost = 0; \
154 SEQ->cost += compute_rtx_cost (x); \
176 /* The cost of the sequence. */
177 int cost; member in struct:matching_seq_def
200 /* The cost of the sequence. */
201 int cost; member in struct:pattern_seq_def
309 /* Compute the cost of INSN rtx for abstraction. */
318 int cost local
358 matching_length(rtx insn1, rtx insn2, int* len, int* cost) argument
384 int cost; local
[all...]
H A Dcfgloopanal.c482 /* Returns estimate on cost of computing SEQ. */
487 unsigned cost = 0; local
494 cost += rtx_cost (set, SET);
496 cost++;
499 return cost;
506 unsigned target_small_cost; /* The cost for register when there is a free one. */
507 unsigned target_pres_cost; /* The cost for register when there are not too many
509 unsigned target_spill_cost; /* The cost for register when we need to spill. */
547 /* Calculates cost for having SIZE new loop global variables. REGS_USED is the
555 unsigned cost local
[all...]
H A Dtree-ssa-loop-ivopts.c40 3) The optimal (w.r. to a cost function) set of variables is chosen. The
41 cost function assigns a cost to sets of induction variables and consists
45 variable in the set and adds its cost to the sum. The cost reflects
48 -- The variable costs. Each of the variables has a cost assigned that
51 -- The set cost. Depending on the size of the set, extra cost may be
93 /* The infinite cost. */
132 /* The candidate - cost pai
136 unsigned cost; /* The cost. */ member in struct:cost_pair
186 unsigned cost; /* Cost of the candidate. */ member in struct:iv_cand
273 unsigned cost; member in struct:iv_ca
2336 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, unsigned cost, bitmap depends_on, tree value) argument
2414 unsigned cost = 0; local
2512 unsigned cost; local
3226 unsigned cost; local
3256 unsigned cost; /* The cost. */ member in struct:mbc_entry
3289 unsigned cost; local
3376 unsigned cost, acost; local
3572 unsigned cost0, cost1, cost; local
3762 unsigned cost; local
3799 unsigned cost; local
3856 unsigned cost = 0, n_sums; local
4027 unsigned cost; local
4053 unsigned cost = get_computation_cost (data, use, cand, true, &depends_on); local
4196 unsigned cost; local
4512 unsigned cost = 0; local
4881 unsigned i, cost; local
4929 unsigned cost; local
[all...]
H A Dexpmed.c1087 If a TARGET is specified and we can store in it at no extra cost,
2349 /* This structure holds the "cost" of a multiply sequence. The
2350 "cost" field holds the total rtx_cost of every operator in the
2351 synthetic multiplication sequence, hence cost(a op b) is defined member in struct:mult_cost
2352 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
2361 short cost; /* Total rtx_cost of the multiplication sequence. */
2368 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
2369 || ((X)->cost
2390 struct mult_cost cost; member in struct:algorithm
2415 struct mult_cost cost; member in struct:alg_hash_entry
[all...]
H A Dregclass.c212 /* Maximum cost of moving from a register in one class to a register in
218 of the second so in that case the cost is zero. */
223 of the second so in that case the cost is zero. */
490 /* Initialize the move cost table. Find every subset of each class
491 and take the maximum cost of moving any subset to any other. */
500 int cost;
511 cost = REGISTER_MOVE_COST (m, i, j);
517 cost = MAX (cost, move_cost [m][i][*p2]);
523 cost
499 int cost; local
807 int cost[N_REG_CLASSES]; member in struct:costs
[all...]
H A Dtree-ssa-loop-im.c93 unsigned cost; /* Cost of the computation performed by the member in struct:lim_aux_data
136 /* Minimum cost of an expensive expression. */
370 add the cost of the computation of DEF to the DATA->cost.
397 /* Only add the cost if the statement defining DEF is inside LOOP,
402 data->cost += LIM_DATA (def_stmt)->cost;
412 /* Returns an estimate for a cost of statement STMT. TODO -- the values here
420 unsigned cost = 1; local
430 cost
723 unsigned cost = 0; local
[all...]
H A Dhaifa-sched.c627 /* Compute cost of executing INSN given the dependence LINK on the insn USED.
638 /* Compute cost of executing INSN given the dependence on the insn USED.
649 int cost = INSN_COST (insn);
651 if (cost < 0)
664 cost = insn_default_latency (insn);
665 if (cost < 0)
666 cost = 0;
668 INSN_COST (insn) = cost;
672 /* In this case estimate cost without caring how insn is used. */
674 return cost;
646 int cost = INSN_COST (insn); local
1803 int cost; local
2421 int cost; local
[all...]
H A Dtree-ssa-live.c1204 node->cost = 0;
1221 /* Return cost of execution of copy instruction with FREQUENCY
1227 int cost = frequency; local
1229 if (!cost)
1230 cost = 1;
1232 cost = 1;
1236 cost *= 2;
1237 return cost;
1240 /* Add a potential coalesce between P1 and P2 in CL with a cost of VALUE. */
1255 node->cost
[all...]
H A Dsched-int.h303 short cost; member in struct:haifa_insn_data
353 #define INSN_COST(INSN) (h_i_d[INSN_UID (INSN)].cost)
H A Dbt-load.c83 int cost; member in struct:btr_def_s
314 this->cost = basic_block_freq (bb);
324 fibheap_insert (all_btr_defs, -this->cost, this);
330 this->cost);
1177 def->cost = basic_block_freq (new_def_bb);
1262 Only migrations that reduce the cost of DEF will be made.
1263 MIN_COST is the lower bound on the cost of the DEF after migration.
1264 If we migrate DEF so that its cost falls below MIN_COST,
1266 we migrate definitions in a priority order based on their cost,
1267 when the cost o
[all...]
H A Dtarget.h220 /* Given the current cost, COST, of an insn, INSN, calculate and
221 return a new cost based on its relationship to DEP_INSN through
223 int (* adjust_cost) (rtx insn, rtx link, rtx def_insn, int cost);
235 can emit this cycle. Default is they all cost the same. */
312 fourth argument is the cost of the dependence as estimated by
318 /* Given the current cost, COST, of an insn, INSN, calculate and
319 return a new cost based on its relationship to DEP_INSN through the
321 int (* adjust_cost_2) (rtx insn, int, rtx def_insn, int cost);
553 /* Compute a (partial) cost for rtx X. Return true if the complete
554 cost ha
[all...]
H A Dloop-invariant.c114 unsigned cost; member in struct:invariant
641 the loop. Otherwise we save only cost of the computation. */
643 inv->cost = rtx_cost (set, SET);
645 inv->cost = rtx_cost (SET_SRC (set), SET);
661 "Set in insn %d is invariant (%d), cost %d, depends on ",
662 INSN_UID (insn), inv->invno, inv->cost);
910 /* Calculates cost and number of registers needed for moving invariant INV
933 (*comp_cost) += inv->cost;
937 /* Hoisting constant pool constants into stack regs may cost more than
H A Dcse.c413 that chain. The chain is in order of increasing cost.
414 Each element's cost value is in its `cost' field.
429 The `cost' field stores the cost of this element's expression.
453 int cost; member in struct:table_elt
493 /* Compute cost of X, as stored in the `cost' field of a table_elt. Fixed
494 hard registers and pointers into the frame are the cheapest with a cost
495 of 0. Next come pseudos with a cost o
731 int cost = 0; local
4061 int cost; local
[all...]
H A Dstmt.c2205 int cost = rtx_cost (gen_rtx_ASHIFT (word_mode, const1_rtx, reg), SET);
2206 cheap = cost < COSTS_N_INSNS (3);
2654 Return 1 if these nodes are suitable for cost estimation, otherwise
2665 /* If we haven't already made the cost table, make it now. Note that the
2731 int cost = 0;
2745 cost += COST_TABLE (TREE_INT_CST_LOW (np->high));
2749 cost += COST_TABLE (TREE_INT_CST_LOW (np->low));
2762 /* Find the place in the list that bisects the list's total cost,
2763 Here I gets half the total cost. */
2765 i = (cost
2190 int cost = rtx_cost (gen_rtx_ASHIFT (word_mode, const1_rtx, reg), SET); local
2715 int cost = 0; local
[all...]
H A Dtree-ssa-live.h680 int cost; member in struct:partition_pair_d
/freebsd-11-stable/contrib/bzip2/
H A Dcompress.c256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[
[all...]
/freebsd-11-stable/contrib/ncurses/ncurses/tty/
H A Dhashmap.c130 /* approximate update cost */
134 int cost = 0; local
139 cost++;
141 return cost;
147 int cost = 0; local
156 cost++;
158 return cost;
162 * Returns true when moving line 'from' to line 'to' seems to be cost
178 * On the left side of >= is the cost before moving;
179 * on the right side -- cost afte
[all...]
H A Dlib_mvcur.c55 ** old ncurses optimizer: less accurate cost computations (in fact,
71 ** cost swamps the computation overhead (and as machines get faster, this
127 * int _char_padding; // cost of character put
128 * int _cr_cost; // cost of (carriage_return)
129 * int _cup_cost; // cost of (cursor_address)
130 * int _home_cost; // cost of (cursor_home)
131 * int _ll_cost; // cost of (cursor_to_ll)
133 * int _ht_cost; // cost of (tab)
134 * int _cbt_cost; // cost of (back_tab)
136 * int _cub1_cost; // cost o
269 int cost = NCURSES_SP_NAME(_nc_msec_cost) (NCURSES_SP_ARGx cap, affcnt); local
[all...]
/freebsd-11-stable/contrib/ntp/util/
H A Dntptime.c110 int cost = 0; local
134 cost++;
244 if (cost) {
/freebsd-11-stable/sbin/ifconfig/
H A Difbridge.c187 printf(" path cost %u", req->ifbr_path_cost);
636 setbridge_ifpathcost(const char *ifn, const char *cost, int s, argument
644 if (get_val(cost, &val) < 0)
645 errx(1, "invalid value: %s", cost);
651 err(1, "BRDGSIFCOST %s", cost);
/freebsd-11-stable/crypto/openssh/
H A Dkrl.c446 * Applies a mostly-accurate bit cost model to select the section type
454 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; local
465 * Calculate the cost to switch from the current state to candidates.
467 * switching cost is independent of the current_state.
485 /* Estimate base cost in bits of each section type */
500 cost = cost_bitmap;
501 if (cost_range < cost) {
503 cost = cost_range;
505 if (cost_list < cost) {
507 cost
[all...]
/freebsd-11-stable/contrib/gcc/config/sparc/
H A Dsparc.c7258 /* Adjust the cost of a scheduling dependency. Return the new cost of
7259 a dependency LINK or INSN on DEP_INSN. COST is the current cost. */
7262 supersparc_adjust_cost (rtx insn, rtx link, rtx dep_insn, int cost)
7277 add an extra "cycle". Note that the cost could be two cycles
7281 return cost + 3;
7290 return cost; /* This should not happen! */
7296 return cost;
7298 return cost + 3; /* An approximation. */
7304 return cost
7241 supersparc_adjust_cost(rtx insn, rtx link, rtx dep_insn, int cost) argument
7302 hypersparc_adjust_cost(rtx insn, rtx link, rtx dep_insn, int cost) argument
7379 sparc_adjust_cost(rtx insn, rtx link, rtx dep, int cost) argument
[all...]
/freebsd-11-stable/contrib/gcc/config/ia64/
H A Dia64.c4748 /* Compute a (partial) cost for rtx X. Return true if the complete
4749 cost has been computed, and false if subexpressions should be
4750 scanned. In either case, *TOTAL contains the cost result. */
4824 /* Calculate the cost of moving data from a register in class FROM to
6252 /* Adjust the cost of a scheduling dependency.
6253 Return the new cost of a dependency of type DEP_TYPE or INSN on DEP_INSN.
6254 COST is the current cost. */
6257 ia64_adjust_cost_2 (rtx insn, int dep_type1, rtx dep_insn, int cost)
6264 return cost;
6272 return cost;
6243 ia64_adjust_cost_2(rtx insn, int dep_type1, rtx dep_insn, int cost) argument
7214 int cost; /* cost of the state in cycles */ member in struct:bundle_state
[all...]
/freebsd-11-stable/contrib/gcc/config/i386/
H A Di386.c60 /* Return index of given mode in mult and division cost tables. */
74 COSTS_N_BYTES (2), /* cost of an add instruction */
75 COSTS_N_BYTES (3), /* cost of a lea instruction */
78 {COSTS_N_BYTES (3), /* cost of starting multiply for QI */
83 0, /* cost of multiply per each bit set */
84 {COSTS_N_BYTES (3), /* cost of a divide/mod for QI */
89 COSTS_N_BYTES (3), /* cost of movsx */
90 COSTS_N_BYTES (3), /* cost of movzx */
93 2, /* cost for loading QImode using movzbl */
94 {2, 2, 2}, /* cost o
1722 const struct processor_costs *cost; /* Processor costs */ member in struct:ptt
6269 int cost = 1; local
10512 int cost = ix86_fp_comparison_cost (code); local
14147 ix86_adjust_cost(rtx insn, rtx link, rtx dep_insn, int cost) argument
17540 int cost = 1; local
[all...]
/freebsd-11-stable/sys/net/
H A Dbridgestp.c1690 * Calculate the path cost according to the link speed.
1815 /* Calc the cost if the link was down previously */
1817 uint32_t cost; local
1819 cost = bstp_calc_path_cost(bp);
1820 if (bp->bp_path_cost != cost) {
1821 bp->bp_path_cost = cost;

Completed in 526 milliseconds

12