| /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)
|
| 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...] |
| 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...] |
| 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...] |
| 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.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;
|
| 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;
|
| /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;
|
| 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...] |
| 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/crypto/external/bsd/heimdal/dist/lib/sl/ |
| sl.c | 408 int *row0, *row1, *row2, *tmp, cost; local
439 cost = row1[l2];
445 return cost;
|
| 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/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/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...] |
