| /Linux-v6.6/include/linux/ |
| D | energy_model.h | 18 * @cost: The cost coefficient associated with this level, used during
25 unsigned long cost; member
34 * but a lower or equal power cost. Such inefficient states are ignored when
104 * which would reduce big value stored in the 'cost' field, then multiply by
106 * e.g. power ~1.3 Watt at max freq, so the 'cost' value > 1mln micro-Watts.
108 * could be 4096, then multiplication: 'cost' * 'sum_util' would overflow.
115 #define em_estimate_energy(cost, sum_util, scale_cpu) \ argument
116 (((cost) * (sum_util)) / (scale_cpu))
118 #define em_estimate_energy(cost, sum_util, scale_cpu) \ argument
119 (((cost) / (scale_cpu)) * (sum_util))
[all …]
|
| /Linux-v6.6/net/netfilter/ |
| D | xt_limit.c | 34 `credit_cap'. The `peak rate' becomes the cost of passing the
35 test, `cost'.
39 discarded. Every time the match passes, you lose `cost' credits;
72 if ((READ_ONCE(priv->credit) < r->cost) && (READ_ONCE(priv->prev) == jiffies)) in limit_mt()
83 if (new_credit >= r->cost) { in limit_mt()
85 new_credit -= r->cost; in limit_mt()
128 if (r->cost == 0) { in limit_mt_check()
130 r->cost = user2credits(r->avg); in limit_mt_check()
150 u_int32_t credit_cap, cost; member
166 .cost = cm->cost, in limit_mt_compat_from_user()
[all …]
|
| D | nft_limit.c | 32 static inline bool nft_limit_eval(struct nft_limit_priv *priv, u64 cost) in nft_limit_eval() argument
44 delta = tokens - cost; in nft_limit_eval()
160 u64 cost; member
169 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
192 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
217 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone()
239 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
241 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
320 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
335 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
[all …]
|
| D | xt_hashlimit.c | 103 u_int64_t cost; member
443 `credit_cap'. The `peak rate' becomes the cost of passing the
444 test, `cost'.
448 discarded. Every time the match passes, you lose `cost' credits;
596 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
601 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
712 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
733 u64 cost; in hashlimit_mt_common() local
760 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
761 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
[all …]
|
| /Linux-v6.6/kernel/power/ |
| D | energy_model.c | 45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
157 /* Compute the cost of each performance state. */ in em_create_perf_table()
160 unsigned long power_res, cost; in em_create_perf_table() local
163 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_create_perf_table()
164 if (ret || !cost || cost > EM_MAX_POWER) { in em_create_perf_table()
165 dev_err(dev, "EM: invalid cost %lu %d\n", in em_create_perf_table()
166 cost, ret); in em_create_perf_table()
171 cost = div64_u64(fmax * power_res, table[i].frequency); in em_create_perf_table()
174 table[i].cost = cost; in em_create_perf_table()
176 if (table[i].cost >= prev_cost) { in em_create_perf_table()
[all …]
|
| /Linux-v6.6/block/ |
| D | blk-iocost.c | 3 * IO cost model based controller.
10 * observable cost metric. This is distinguished from CPU and memory where
22 * While there is no cost metric we can trivially observe, it isn't a
23 * complete mystery. For example, on a rotational device, seek cost
30 * 1. IO Cost Model
32 * IO cost model estimates the cost of an IO given its basic parameters and
33 * history (e.g. the end sector of the last IO). The cost is measured in
34 * device time. If a given IO is estimated to cost 10ms, the device should
37 * Currently, there's only one builtin cost model - linear. Each IO is
38 * classified as sequential or random and given a base cost accordingly.
[all …]
|
| D | Kconfig | 151 bool "Enable support for cost model based cgroup IO controller"
155 Enabling this option enables the .weight interface for cost
175 is mostly useful for kernel developers, but it doesn't incur any cost
|
| /Linux-v6.6/lib/zstd/compress/ |
| 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; in ZSTD_entropyCost() local
95 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
97 return cost >> 8; in ZSTD_entropyCost()
101 * Returns the cost in bits of encoding the distribution in count using ctable.
110 size_t cost = 0; in ZSTD_fseBitCost() local
129 cost += (size_t)count[s] * bitCost; in ZSTD_fseBitCost()
131 return cost >> kAccuracyLog; in ZSTD_fseBitCost()
135 * Returns the cost in bits of encoding the distribution in count using the
[all …]
|
| /Linux-v6.6/net/bridge/netfilter/ |
| D | ebt_limit.c | 46 if (info->credit >= info->cost) { in ebt_limit_mt()
48 info->credit -= info->cost; in ebt_limit_mt()
85 info->cost = user2credits(info->avg); in ebt_limit_mt_check()
98 compat_uint_t credit, credit_cap, cost; member
|
| /Linux-v6.6/fs/cramfs/ |
| D | README | 147 The cost of swabbing is changing the code to use the le32_to_cpu
166 The cost of option 1 is that kernels with a larger PAGE_SIZE
169 The cost of option 2 relative to option 1 is that the code uses
181 cost is greater complexity. Probably not worth it, but I hope someone
186 Another cost of 2 and 3 over 1 is making mkcramfs use a different
|
| /Linux-v6.6/Documentation/power/ |
| D | energy-model.rst | 20 abstraction layer which standardizes the format of power cost tables in the
67 In case of CPU devices the EM framework manages power cost tables per
131 .get_cost() is optional and provides the 'cost' values used by the EAS.
136 The .get_cost() allows to provide the 'cost' values which reflect the
139 formulas calculating 'cost' values. To register an EM for such platform, the
214 11 /* Estimate the power cost for the dev at the relevant freq. */
|
| /Linux-v6.6/Documentation/scheduler/ |
| D | sched-energy.rst | 83 Model (EM) framework. The EM of a platform is composed of a power cost table
161 The CPU capacity and power cost associated with each OPP is listed in
262 increase the cost of the tasks already running there. If the waking task is
263 placed on a big CPU, its own execution cost might be higher than if it was
266 consumed by CPUs, the extra cost of running that one task on a big core can be
267 smaller than the cost of raising the OPP on the little CPUs for all the other
271 for all platforms, without knowing the cost of running at different OPPs on all
346 energy. So, your platform must provide power cost tables to the EM framework in
364 states, ...), the cost of using it in the wake-up path can become prohibitive.
|
| /Linux-v6.6/Documentation/translations/zh_CN/mm/ |
| D | overcommit-accounting.rst | 58 | SHARED or READ-only - 0 cost (该文件是映射而不是交换)
63 | PRIVATE READ-only - 0 cost (但作用不大)
|
| /Linux-v6.6/drivers/iio/health/ |
| D | Kconfig | 19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
|
| /Linux-v6.6/Documentation/virt/ |
| D | guest-halt-polling.rst | 13 cost of handling the IPI) when performing a wakeup.
15 2) The VM-exit cost can be avoided.
|
| /Linux-v6.6/Documentation/mm/ |
| D | overcommit-accounting.rst | 58 | SHARED or READ-only - 0 cost (the file is the map not swap)
63 | PRIVATE READ-only - 0 cost (but of little use)
|
| D | multigen_lru.rst | 62 2. The cost of evicting the former channel is higher due to the TLB
103 ``folio->flags`` and therefore has a negligible cost. A feedback loop
187 can incur the highest CPU cost in the reclaim path.
207 is false positive, the cost is an additional scan of a range of PTEs,
|
| /Linux-v6.6/lib/ |
| D | Kconfig.kfence | 14 to have negligible cost to permit enabling it in production
24 enable KASAN due to its cost, consider using KFENCE.
|
| /Linux-v6.6/Documentation/fb/ |
| D | deferred_io.rst | 17 - app continues writing to that page with no additional cost. this is
26 writes to occur at minimum cost. Then after some time when hopefully things
|
| /Linux-v6.6/Documentation/arch/x86/ |
| D | tlb.rst | 13 destroyed and must be refilled later, at some cost.
15 time. This could potentially cost many more instructions, but
|
| /Linux-v6.6/tools/perf/util/ |
| D | levenshtein.c | 16 * are kept in memory (if swaps had the same or higher cost as one deletion
29 * All the big loop does is determine the partial minimum-cost paths.
|
| /Linux-v6.6/kernel/ |
| D | Kconfig.preempt | 41 at the cost of slightly lower throughput.
63 system is under load, at the cost of slightly lower throughput
|
| /Linux-v6.6/Documentation/block/ |
| D | deadline-iosched.rst | 43 generally improves throughput, at the cost of latency variation.
68 that comes at basically 0 cost we leave that on. We simply disable the
|
| /Linux-v6.6/net/netfilter/ipvs/ |
| D | ip_vs_sed.c | 27 * job in the cost function (the increment of 1). SED may outperform
46 * We only use the active connection number in the cost in ip_vs_sed_dest_overhead()
|
| /Linux-v6.6/drivers/cpufreq/ |
| D | cppc_cpufreq.c | 477 /* Increase the cost value by CPPC_EM_COST_STEP every performance state. */
479 /* Add a cost gap correspnding to the energy of 4 CPUs. */
501 * The cost is defined as:
502 * cost = power * max_frequency / frequency
570 * With an artificial EM, only the cost value is used. Still the power in cppc_get_cpu_power()
580 unsigned long *cost) in cppc_get_cpu_cost() argument
598 *cost = compute_cost(cpu_dev->id, step); in cppc_get_cpu_cost()
|
