| /src/external/apache2/llvm/dist/clang/utils/ |
| CmpDriver | 41 def cost(a, b): function in function:insertMinimumPadding
52 current = cost(a, b)
56 candidate = cost(a_0, b)
|
| /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/bsd/tre/dist/lib/ |
| tre.h | 207 int cost_ins; /* Default cost of an inserted character. */
208 int cost_del; /* Default cost of a deleted character. */
209 int cost_subst; /* Default cost of a substituted character. */
210 int max_cost; /* Maximum allowed cost of a match. */
222 int cost; /* Cost of the match. */ member in struct:__anon8203
|
| 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/ |
| spellcheck.cc | 28 /* Cost of a case transformation. */
31 /* Cost of another kind of edit. */
100 edit_distance_t cost; local
103 cost = 0;
105 cost = CASE_COST;
107 cost = BASE_COST;
110 edit_distance_t substitution = v_one_ago[j] + cost;
|
| cfgloopanal.cc | 488 /* Estimates cost of increased register pressure caused by making N_NEW new
498 unsigned cost; local
515 cost = target_reg_cost [speed] * n_new;
519 cost = target_spill_cost [speed] * n_new;
525 better. So decrease the cost (to do more accurate the cost
528 cost /= 2;
530 return cost;
|
| cse.cc | 363 that chain. The chain is in order of increasing cost.
364 Each element's cost value is in its `cost' field.
379 The `cost' field stores the cost of this element's expression.
403 int cost; member in struct:table_elt
427 /* Compute cost of X, as stored in the `cost' field of a table_elt. Fixed
428 hard registers and pointers into the frame are the cheapest with a cost
429 of 0. Next come pseudos with a cost of one and other hard registers wit
642 int cost = 0; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| spellcheck.cc | 28 /* Cost of a case transformation. */
31 /* Cost of another kind of edit. */
100 edit_distance_t cost; local
103 cost = 0;
105 cost = CASE_COST;
107 cost = BASE_COST;
110 edit_distance_t substitution = v_one_ago[j] + cost;
|
| cfgloopanal.cc | 397 /* Estimates cost of increased register pressure caused by making N_NEW new
407 unsigned cost; local
424 cost = target_reg_cost [speed] * n_new;
428 cost = target_spill_cost [speed] * n_new;
434 better. So decrease the cost (to do more accurate the cost
437 cost /= 2;
439 return cost;
|
| /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...] |
| phantstruct.h | 129 double cost; /* cost of item */ member in struct:menuitem
|
| /src/crypto/external/bsd/heimdal/dist/lib/sl/ |
| sl.c | 408 int *row0, *row1, *row2, *tmp, cost; local
439 cost = row1[l2];
445 return cost;
|
| /src/external/bsd/bzip2/dist/ |
| compress.c | 258 UInt16 cost[BZ_N_GROUPS]; local
355 Calculate the cost of this group as coded
358 for (t = 0; t < nGroups; t++) cost[t] = 0;
385 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
386 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
387 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
393 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]
[all...] |
| /src/external/bsd/ntp/dist/util/ |
| ntptime.c | 112 int cost = 0; local
136 cost++;
246 if (cost) {
|
| /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/gpl3/gcc/dist/gcc/config/i386/ |
| i386-features.cc | 517 /* Return a cost of building a vector costant
540 int cost = 0; local
663 /* We do not have any conditional move cost, estimate it as a
769 /* Cost the integer to sse and sse to integer moves. */
772 cost += n_sse_to_integer * ix86_cost->sse_to_integer;
773 /* ??? integer_to_sse but we only have that in the RA cost table.
776 cost += n_integer_to_sse * ix86_cost->sse_to_integer;
780 cost += n_sse_to_integer * COSTS_N_BYTES (4);
781 cost += n_integer_to_sse * COSTS_N_BYTES (4);
786 cost += n_sse_to_integer * COSTS_N_BYTES (10)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/i386/ |
| i386-features.cc | 497 /* Return a cost of building a vector costant
520 int cost = 0; local
600 /* We do not have any conditional move cost, estimate it as a
608 /* Assume comparison cost is the same. */
664 /* Cost the integer to sse and sse to integer moves. */
665 cost += n_sse_to_integer * ix86_cost->sse_to_integer;
666 /* ??? integer_to_sse but we only have that in the RA cost table.
669 cost += n_integer_to_sse * ix86_cost->sse_to_integer;
672 fprintf (dump_file, " Registers conversion cost: %d\n", cost);
[all...] |
| /src/games/monop/ |
| monop.h | 77 int cost; /* cost */ member in struct:sqr_st
|
| /src/sys/ufs/lfs/ |
| lfs_kclean.c | 745 long benefit, cost; local
757 cost = lfs_sb_getssize(fs) + sup->su_nbytes;
758 return (256 * benefit * age) / cost;
908 * What is an appropriate threshold for the cost-benefit
|
| /src/external/bsd/tre/dist/include/tre/ |
| tre.h | 181 int cost_ins; /* Default cost of an inserted character. */
182 int cost_del; /* Default cost of a deleted character. */
183 int cost_subst; /* Default cost of a substituted character. */
184 int max_cost; /* Maximum allowed cost of a match. */
196 int cost; /* Cost of the match. */ member in struct:__anon8173
|
| /src/external/gpl3/gcc.old/dist/gcc/config/tilepro/ |
| gen-mul-tables.cc | 110 int cost)
112 m_unary_func (0), m_binary_func (func), m_cost (cost),
119 int rhs_if_unary, int cost)
121 m_unary_func (func), m_binary_func (0), m_cost (cost),
430 cost. We update this ExpressionTree object because some int is
437 int cost () const function in class:ExpressionTree
439 int cost = 0; local
441 cost += m_exprs[j].m_op->m_cost;
442 return cost + m_exprs[m_num_vals - 1].m_critical_path_length * 1000000;
540 || (*best).second->cost () > s.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/crypto/external/bsd/openssh/dist/ |
| krl.c | 483 * Applies a mostly-accurate bit cost model to select the section type
491 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; local
502 * Calculate the cost to switch from the current state to candidates.
504 * switching cost is independent of the current_state.
522 /* Estimate base cost in bits of each section type */
537 cost = cost_bitmap;
538 if (cost_range < cost) {
540 cost = cost_range;
542 if (cost_list < cost) {
544 cost = cost_list
[all...] |
