| /src/games/trek/ |
| computer.c | 79 ** warpcost -- Gives you the cost in time and units to move for
117 int cost; local in function:computer
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/games/phantasia/ |
| misc.c | 165 double cost; /* cost of purchase */ local in function:tradingpost
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/games/monop/ |
| monop.h | 77 int cost; /* cost */ member in struct:sqr_st
|
| /src/libexec/lfs_cleanerd/ |
| lfs_cleanerd.c | 746 int64_t age, benefit, cost; local in function:calc_cb
784 * The non-degenerate case. Use Rosenblum's cost-benefit algorithm.
787 * and weigh that against the cost (bytes read plus bytes written).
800 cost = lfs_sb_getssize(fs) + t->nbytes;
801 t->priority = (256 * benefit * age) / cost;
850 * Comparator for sort_segments: cost-benefit equation.
1024 * a hidden cleaning cost, since we are unaware of it until we
1025 * have already read the segments. Return the total cost, and fill
1026 * in *ifc with the part of that cost due to rewriting the Ifile.
1110 /* Compute cost-benefit coefficient *
[all...] |
| /src/sys/kern/ |
| kern_entropy.c | 41 * floor, at the cost of sometimes having to do cryptography.
837 * negligible performance cost.
1608 unsigned cost = MIN(len, ENTROPY_CAPACITY)*NBBY; local in function:entropy_extract
1612 bitsneeded += MIN(MINENTROPYBITS - bitsneeded, cost);
1613 samplesneeded += MIN(MINSAMPLES - samplesneeded, cost);
|
