| /Linux-v5.15/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 | 28 static inline bool nft_limit_eval(struct nft_limit *limit, u64 cost) in nft_limit_eval() argument
40 delta = tokens - cost; in nft_limit_eval()
126 u64 cost; member
135 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
158 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
183 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
185 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
245 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
260 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
287 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local
[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-v5.15/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 | 134 bool "Enable support for cost model based cgroup IO controller"
139 Enabling this option enables the .weight interface for cost
159 is mostly useful for kernel developers, but it doesn't incur any cost
|
| /Linux-v5.15/include/linux/ |
| D | energy_model.h | 18 * @cost: The cost coefficient associated with this level, used during
24 unsigned long cost; member
188 * as 'ps->cost'. in em_cpu_energy()
191 * share the same 'ps->cost', and the same CPU capacity. Hence, the in em_cpu_energy()
195 * ps->cost * \Sum cpu_util in em_cpu_energy()
199 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
|
| /Linux-v5.15/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-v5.15/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-v5.15/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-v5.15/drivers/iio/health/ |
| D | Kconfig | 19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
|
| /Linux-v5.15/Documentation/devicetree/bindings/arm/omap/ |
| D | omap.txt | 119 - OMAP3 BeagleBoard : Low cost community board
128 - OMAP4 PandaBoard : Low cost community board
146 - AM335X Bone : Low cost community board
149 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
|
| /Linux-v5.15/drivers/gpu/drm/i915/gt/ |
| D | intel_lrc.h | 75 * switch (and so excludes the cost of context switches) or use the in lrc_get_runtime()
77 * and so includes the cost of the save. in lrc_get_runtime()
|
| /Linux-v5.15/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-v5.15/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-v5.15/Documentation/vm/ |
| D | overcommit-accounting.rst | 59 | SHARED or READ-only - 0 cost (the file is the map not swap)
64 | PRIVATE READ-only - 0 cost (but of little use)
|
| /Linux-v5.15/kernel/power/ |
| D | energy_model.c | 44 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
170 /* Compute the cost of each performance state. */ in em_create_perf_table()
175 table[i].cost = div64_u64(fmax * power_res, in em_create_perf_table()
|
| /Linux-v5.15/kernel/ |
| D | Kconfig.preempt | 28 at the cost of slightly lower throughput.
52 system is under load, at the cost of slightly lower throughput
|
| /Linux-v5.15/scripts/gcc-plugins/ |
| D | Kconfig | 52 there is little 'natural' source of entropy normally. The cost
101 at the cost of weakened randomization.
|
| /Linux-v5.15/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-v5.15/Documentation/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-v5.15/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-v5.15/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-v5.15/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-v5.15/arch/ia64/lib/ |
| D | clear_user.S | 77 // M slot for 2 stores/iteration but the cost the initialization
145 // extra cycle cost (use a nop slot anyway). It also simplifies the
161 // The addition of len2/len3 does not cost anything more compared to
|
| /Linux-v5.15/Documentation/userspace-api/ |
| D | unshare.rst | 17 3) Cost
92 3) Cost
99 There is a cost associated with altering existing, well tested and
103 the benefits of this new feature can exceed its cost.
|
