| /freebsd-13-stable/contrib/cortex-strings/scripts/ |
| H A D | libplot.py | 61 # Fix up all of the records for cost
68 cost = costs.get((record.bytes, record.loops), None)
70 if not cost:
75 values[-2] -= cost
|
| /freebsd-13-stable/sys/contrib/zstd/lib/compress/ |
| H A D | 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
93 cost += count[s] * kInverseProbabilityLog256[norm];
95 return cost >> 8;
99 * Returns the cost in bits of encoding the distribution in count using ctable.
108 size_t cost = 0; local
127 cost += (size_t)count[s] * bitCost;
129 return cost >> kAccuracyLog;
133 * Returns the cost i
141 size_t cost = 0; local
[all...] |
| /freebsd-13-stable/contrib/bzip2/ |
| H A D | compress.c | 256 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-13-stable/contrib/ncurses/ncurses/tty/ |
| H A D | hashmap.c | 137 /* approximate update cost */
141 int cost = 0; local
147 cost++;
149 return cost;
155 int cost = 0; local
165 cost++;
167 return cost;
171 * Returns true when moving line 'from' to line 'to' seems to be cost
187 * On the left side of >= is the cost before moving;
188 * on the right side -- cost afte
[all...] |
| H A D | lib_mvcur.c | 56 ** old ncurses optimizer: less accurate cost computations (in fact,
72 ** cost swamps the computation overhead (and as machines get faster, this
128 * int _char_padding; // cost of character put
129 * int _cr_cost; // cost of (carriage_return)
130 * int _cup_cost; // cost of (cursor_address)
131 * int _home_cost; // cost of (cursor_home)
132 * int _ll_cost; // cost of (cursor_to_ll)
134 * int _ht_cost; // cost of (tab)
135 * int _cbt_cost; // cost of (back_tab)
137 * int _cub1_cost; // cost o
270 int cost = NCURSES_SP_NAME(_nc_msec_cost) (NCURSES_SP_ARGx cap, affcnt); local
[all...] |
| /freebsd-13-stable/contrib/ntp/util/ |
| H A D | ntptime.c | 110 int cost = 0; local
134 cost++;
244 if (cost) {
|
| /freebsd-13-stable/sbin/ifconfig/ |
| H A D | ifbridge.c | 197 printf("ifmaxaddr %u port %u priority %u path cost %u",
571 setbridge_ifpathcost(const char *ifn, const char *cost, int s, argument
579 if (get_val(cost, &val) < 0)
580 errx(1, "invalid value: %s", cost);
586 err(1, "BRDGSIFCOST %s", cost);
|
| /freebsd-13-stable/crypto/openssh/ |
| H A D | krl.c | 475 * Applies a mostly-accurate bit cost model to select the section type
483 u_int64_t cost, cost_list, cost_range, cost_bitmap, cost_bitmap_restart; local
494 * Calculate the cost to switch from the current state to candidates.
496 * switching cost is independent of the current_state.
514 /* Estimate base cost in bits of each section type */
529 cost = cost_bitmap;
530 if (cost_range < cost) {
532 cost = cost_range;
534 if (cost_list < cost) {
536 cost
[all...] |
| /freebsd-13-stable/contrib/less/ |
| H A D | screen.c | 1389 * Return the cost of displaying a termcap string.
1407 cost(t) function
1418 * cost (see cost() function).
1434 if (cost(t1) < cost(t2))
|
| /freebsd-13-stable/sys/net/ |
| H A D | bridgestp.c | 1713 * Calculate the path cost according to the link speed.
1838 /* Calc the cost if the link was down previously */
1840 uint32_t cost; local
1842 cost = bstp_calc_path_cost(bp);
1843 if (bp->bp_path_cost != cost) {
1844 bp->bp_path_cost = cost;
|
| /freebsd-13-stable/share/mk/ |
| H A D | bsd.cpu.mk | 374 # cost outweighs the advantages of SIMD instructions.
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 144 // The flag adds instruction count to solutions cost comparision.
146 "lsr-insns-cost", cl::Hidden, cl::init(true),
147 cl::desc("Add instruction count to a LSR cost model"));
173 cl::desc("The limit on recursion depth for LSRs setup cost"));
912 /// Check if expanding this expression is likely to incur significant cost. This
978 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
996 /// accurate cost model.
1000 // Get the cost of the scaling factor used in F for LU.
1043 assert(isValid() && "invalid cost");
1372 // If we don't count instruction cost exi
2844 int cost = 1; local
[all...] |
| /freebsd-13-stable/sys/contrib/openzfs/module/zstd/lib/ |
| H A D | zstd.c | 1970 * uses the smallest state value possible, saving the cost of this symbol */
1999 * Approximate maximum cost of a symbol, in bits.
2002 * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
2010 * Approximate symbol cost, as fractional value, using fixed-point format (accuracyLog fractional bits)
2012 * note 2 : if freq[symbolValue]==0, @return a fake cost of tableLog+1 bits */
3136 The lower the level, the faster the speed (at the cost of compression).
3904 * The resulting state can be used for future compression operations with very limited startup cost.
4052 * It's recommended to "load once, use many times", to amortize the cost
4084 * Note 4 : Referencing a raw content prefix has almost no cpu nor memory cost.
4256 * the CDict's tables incurs a fixed cost a
11327 unsigned cost = 0; local
11349 size_t cost = 0; local
11382 size_t cost = 0; local
[all...] |
| /freebsd-13-stable/contrib/bsnmp/tests/ |
| H A D | catch.hpp | 7106 auto cost = Detail::estimate_clock_cost<Clock>(resolution.mean);
7108 env = new Environment<FloatDuration<Clock>>{ resolution, cost };
|