| /src/external/gpl3/gcc/dist/gcc/ |
| expmed.h | 47 /* This structure holds the "cost" of a multiply sequence. The
48 "cost" field holds the total rtx_cost of every operator in the
49 synthetic multiplication sequence, hence cost(a op b) is defined
50 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
59 short cost; /* Total rtx_cost of the multiplication sequence. */ member in struct:mult_cost
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
72 lower "cost". If "cost"s are tied, the lower latency is cheaper. *
98 struct mult_cost cost; member in struct:algorithm
123 struct mult_cost cost; member in struct:alg_hash_entry
144 int cost[2][NUM_MODE_IPV_INT]; member in struct:expmed_op_costs
[all...] |
| tree-ssa-loop-ivopts.cc | 43 3) The optimal (w.r. to a cost function) set of variables is chosen. The
44 cost function assigns a cost to sets of induction variables and consists
48 the best induction variable in the set and adds its cost to the sum.
49 The cost reflects the time spent on modifying the induction variables
52 -- The variable costs. Each of the variables has a cost assigned that
55 -- The set cost. Depending on the size of the set, extra cost may be
81 set flag doloop_p of iv_cand, step cost is set as zero and no extra cost
251 int64_t cost; \/* The runtime cost. *\/ member in class:comp_cost
390 comp_cost cost; \/* The cost. *\/ member in class:cost_pair
466 unsigned cost; \/* Cost of the candidate. *\/ member in struct:iv_cand
700 comp_cost cost; member in class:iv_ca
3953 unsigned cost; local
4350 comp_cost cost0, cost1, cost; local
4728 comp_cost var_cost = no_cost, cost = no_cost; local
4920 comp_cost cost; local
5032 comp_cost cost; local
5073 comp_cost sum_cost = no_cost, cost; local
5576 comp_cost elim_cost = infinite_cost, express_cost, cost, bound_cost; local
6052 int64_t cost, cost_step; local
6130 unsigned cost; local
6278 comp_cost cost = ivs->cand_use_cost; local
6627 comp_cost cost = iv_ca_cost (ivs); local
6682 comp_cost cost; local
6739 comp_cost cost, best_cost, acost; local
7226 comp_cost cost, origcost; local
[all...] |
| ira-color.cc | 56 /* Overall (spilling) cost of all allocnos with given register
58 int64_t cost; member in struct:allocno_hard_regs
96 /* Hard regno for which we changed the cost. */
98 /* Divisor used when we changed the cost of HARD_REGNO. */
264 COST. */
266 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost)
274 hv->cost += cost;
280 hv->cost = cost;
[all...] |
| mcf.cc | 1 /* Routines to implement minimum-cost maximal flow algorithm used to smooth
26 [2] "Complementing Missing and Inaccurate Profiling Using a Minimum Cost
36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
39 5. Form the minimal cost flow
55 /* COST FUNCTION. */
58 #define COST(k, w) ((k) / mcf_ln ((w) + 2))
90 gcov_type cost; member in struct:fixup_edge_type
221 fprintf (file, " cost=%" PRId64 ".", fedge->cost);
360 (SRC->DEST) to the edge_list maintained in FIXUP_GRAPH with cost of the edg
[all...] |
| tree-ssa-coalesce.cc | 55 int cost; member in struct:coalesce_pair
63 the same primary cost.
138 cost_one_pair *cost_one_list;/* Single use coalesces with cost 1. */
146 /* Return cost of execution of copy instruction with FREQUENCY. */
152 int cost = frequency; local
154 if (!cost)
155 cost = 1;
158 cost = 1;
160 return cost;
164 /* Return the cost of executing a copy instruction in basic block BB. *
1052 int v1, v2, cost; local
1091 int cost = coalesce_cost_edge (e); local
1253 int v1, v2, cost; local
1321 const int cost local
1411 int cost; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| expmed.h | 47 /* This structure holds the "cost" of a multiply sequence. The
48 "cost" field holds the total rtx_cost of every operator in the
49 synthetic multiplication sequence, hence cost(a op b) is defined
50 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
59 short cost; /* Total rtx_cost of the multiplication sequence. */ member in struct:mult_cost
66 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
67 || ((X)->cost == (Y) && (X)->latency < (Y)))
72 lower "cost". If "cost"s are tied, the lower latency is cheaper. *
98 struct mult_cost cost; member in struct:algorithm
123 struct mult_cost cost; member in struct:alg_hash_entry
144 int cost[2][NUM_MODE_IPV_INT]; member in struct:expmed_op_costs
[all...] |
| tree-ssa-loop-ivopts.cc | 43 3) The optimal (w.r. to a cost function) set of variables is chosen. The
44 cost function assigns a cost to sets of induction variables and consists
48 the best induction variable in the set and adds its cost to the sum.
49 The cost reflects the time spent on modifying the induction variables
52 -- The variable costs. Each of the variables has a cost assigned that
55 -- The set cost. Depending on the size of the set, extra cost may be
81 set flag doloop_p of iv_cand, step cost is set as zero and no extra cost
251 int64_t cost; \/* The runtime cost. *\/ member in class:comp_cost
390 comp_cost cost; \/* The cost. *\/ member in class:cost_pair
466 unsigned cost; \/* Cost of the candidate. *\/ member in struct:iv_cand
700 comp_cost cost; member in class:iv_ca
3912 unsigned cost; local
4309 comp_cost cost0, cost1, cost; local
4687 comp_cost var_cost = no_cost, cost = no_cost; local
4871 comp_cost cost; local
4983 comp_cost cost; local
5024 comp_cost sum_cost = no_cost, cost; local
5526 comp_cost elim_cost = infinite_cost, express_cost, cost, bound_cost; local
6002 int64_t cost, cost_step; local
6080 unsigned cost; local
6228 comp_cost cost = ivs->cand_use_cost; local
6577 comp_cost cost = iv_ca_cost (ivs); local
6632 comp_cost cost; local
6689 comp_cost cost, best_cost, acost; local
7176 comp_cost cost, origcost; local
[all...] |
| ira-color.cc | 56 /* Overall (spilling) cost of all allocnos with given register
58 int64_t cost; member in struct:allocno_hard_regs
96 /* Hard regno for which we changed the cost. */
98 /* Divisor used when we changed the cost of HARD_REGNO. */
264 COST. */
266 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost)
274 hv->cost += cost;
280 hv->cost = cost;
[all...] |
| tree-ssa-coalesce.cc | 54 int cost; member in struct:coalesce_pair
62 the same primary cost.
137 cost_one_pair *cost_one_list;/* Single use coalesces with cost 1. */
145 /* Return cost of execution of copy instruction with FREQUENCY. */
151 int cost = frequency; local
153 if (!cost)
154 cost = 1;
157 cost = 1;
159 return cost;
163 /* Return the cost of executing a copy instruction in basic block BB. *
1041 int v1, v2, cost; local
1078 int cost = coalesce_cost_edge (e); local
1232 int v1, v2, cost; local
1300 const int cost local
1390 int cost; local
[all...] |
| mcf.cc | 1 /* Routines to implement minimum-cost maximal flow algorithm used to smooth
26 [2] "Complementing Missing and Inaccurate Profiling Using a Minimum Cost
36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
39 5. Form the minimal cost flow
55 /* COST FUNCTION. */
58 #define COST(k, w) ((k) / mcf_ln ((w) + 2))
90 gcov_type cost; member in struct:fixup_edge_type
221 fprintf (file, " cost=%" PRId64 ".", fedge->cost);
360 (SRC->DEST) to the edge_list maintained in FIXUP_GRAPH with cost of the edg
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/i386/ |
| x86-tune-sched.cc | 256 /* This function corrects the value of COST (latency) based on the relationship
265 ix86_adjust_cost (rtx_insn *insn, int dep_type, rtx_insn *dep_insn, int cost,
273 /* Anti and output dependencies have zero cost on all CPUs. */
281 return cost;
302 cost += 1;
305 cost += 1;
309 cost = 0;
315 cost += 1;
321 cost += 5;
329 cost += 1
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/ |
| speller.d | 22 * dg = search delegate of the form `T delegate(const(char)[] p, out int cost)`
70 int cost = int.max;
81 if (combineSpellerResult(p, cost, np, ncost))
98 if (combineSpellerResult(p, cost, np, ncost))
115 if (combineSpellerResult(p, cost, np, ncost))
132 if (combineSpellerResult(p, cost, np, ncost))
148 * cost = set to cost of match
152 auto spellerY(alias dg)(const(char)[] seed, size_t index, out int cost)
165 cost = int.max; // start with worst possible matc
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/i386/ |
| x86-tune-sched.cc | 234 /* This function corrects the value of COST (latency) based on the relationship
243 ix86_adjust_cost (rtx_insn *insn, int dep_type, rtx_insn *dep_insn, int cost,
251 /* Anti and output dependencies have zero cost on all CPUs. */
259 return cost;
280 cost += 1;
283 cost += 1;
287 cost = 0;
293 cost += 1;
299 cost += 5;
307 cost += 1
[all...] |
| /src/games/phantasia/ |
| misc.c | 165 double cost; /* cost of purchase */ local
166 double blessingcost; /* cost of blessing */
182 /* set up cost of blessing */
191 cost = blessingcost;
193 cost = Menu[loop].cost;
194 printw("(%d) %-12s: %6.0f\n", loop + 1, Menu[loop].item, cost);
232 Menu[0].cost, floor(Player.p_gold / Menu[0].cost));
[all...] |
| /src/games/trek/ |
| computer.c | 79 ** warpcost -- Gives you the cost in time and units to move for
117 int cost; local
228 cost = pow(0.90, dist) * 98.0 + 0.5;
230 cost);
233 case 6: /* warp cost (time/energy) */
240 cost = (dist + 0.05) * warpfact * warpfact * warpfact;
242 printf("Warp %.2f distance %.2f cost %.2f "
244 warpfact, dist, time, cost, cost + cost);
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/nds32/ |
| nds32-cost.cc | 63 /* Scale cost by mode size. */
64 int cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); local
74 /* When not optimizing for size, we care more about the cost
78 should not contribute to the cost. */
109 /* Scale cost by mode size. */
110 cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode));
121 *total = cost;
129 *total = cost;
142 *total = cost;
152 *total = cost;
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/nds32/ |
| nds32-cost.cc | 63 /* Scale cost by mode size. */
64 int cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); local
74 /* When not optimizing for size, we care more about the cost
78 should not contribute to the cost. */
109 /* Scale cost by mode size. */
110 cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode));
121 *total = cost;
129 *total = cost;
142 *total = cost;
152 *total = cost;
[all...] |
| /src/external/zlib/pigz/dist/zopfli/ |
| squeeze.c | 111 Function that calculates a cost based on a model for the given LZ77 symbol.
117 Cost model which should exactly match fixed tree.
129 double cost = 0; local
130 if (lsym <= 279) cost += 7;
131 else cost += 8;
132 cost += 5; /* Every dist symbol has length 5. */
133 return cost + dbits + lbits;
138 Cost model based on symbol statistics.
155 Finds the minimum possible cost this cost model can return for valid length an
436 double cost = GetBestLengths( local
459 double cost; local
[all...] |
| /src/external/bsd/zstd/dist/lib/compress/ |
| zstd_compress_sequences.c | 67 * Returns the cost in bytes of encoding the normalized count header.
81 * Returns the cost in bits of encoding the distribution described by count
86 unsigned cost = 0; local
95 cost += count[s] * kInverseProbabilityLog256[norm];
97 return cost >> 8;
101 * Returns the cost in bits of encoding the distribution in count using ctable.
110 size_t cost = 0; local
129 cost += (size_t)count[s] * bitCost;
131 return cost >> kAccuracyLog;
135 * Returns the cost in bits of encoding the distribution in count using th
143 size_t cost = 0; local
[all...] |
| /src/external/bsd/tre/dist/lib/ |
| tre-match-approx.c | 131 /* Set insert cost. */
138 /* Set delete cost. */
145 /* Set substitute cost. */
152 /* Set maximum cost. */
244 DPRINT(("max cost %d, ins %d, del %d, subst %d\n",
391 int cost, cost0; local
401 /* Compute and check cost at current depth. */
402 cost = reach[id].costs[depth][TRE_M_COST];
404 cost += reach[id].params.cost_ins;
405 if (cost > reach[id].params.max_cost
489 int cost, cost0; local
665 int cost, cost0, err; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/lto/ |
| lto-partition.cc | 398 /* Return true if we should account reference from N1 to N2 in cost
419 cost. Those are added into units only to enable possible constant
484 int64_t cost = 0, internal = 0; local
578 At the same time we compute size of the boundary into COST. Every
580 COST. Every edge inside partition was earlier computed as one leaving
581 it and thus we need to subtract it from COST. */
599 /* Compute boundary cost of callgraph edges. */
615 cost -= edge_cost, internal += edge_cost;
617 cost += edge_cost;
634 cost -= edge_cost, internal += edge_cost
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/lto/ |
| lto-partition.cc | 398 /* Return true if we should account reference from N1 to N2 in cost
419 cost. Those are added into units only to enable possible constant
484 int64_t cost = 0, internal = 0; local
578 At the same time we compute size of the boundary into COST. Every
580 COST. Every edge inside partition was earlier computed as one leaving
581 it and thus we need to subtract it from COST. */
599 /* Compute boundary cost of callgraph edges. */
615 cost -= edge_cost, internal += edge_cost;
617 cost += edge_cost;
634 cost -= edge_cost, internal += edge_cost
[all...] |
| /src/sys/arch/mvme68k/stand/sboot/ |
| oc_cksum.s | 59 | bad alignment adds ~10% to the per-call cost. Since, by the nature
61 | always longword aligned, there is no benefit to this added cost
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,
|
| /src/games/monop/ |
| morg.c | 144 price = board[propnum].cost/2;
207 price = board[propnum].cost/2;
210 printf("That cost you $%d\n",price);
|
| print.c | 107 printf(" - %-8.8s %3d", pp->mon_desc->name, sqp->cost);
113 sqp->cost);
|
