| /kernel/linux/linux-5.10/net/netfilter/ |
| D | xt_limit.c | 36 `credit_cap'. The `peak rate' becomes the cost of passing the
37 test, `cost'.
41 discarded. Every time the match passes, you lose `cost' credits;
76 if (priv->credit >= r->cost) { in limit_mt()
78 priv->credit -= r->cost; in limit_mt()
121 if (r->cost == 0) { in limit_mt_check()
123 r->cost = user2credits(r->avg); in limit_mt_check()
144 u_int32_t credit_cap, cost; member
160 .cost = cm->cost, in limit_mt_compat_from_user()
174 .cost = m->cost, in limit_mt_compat_to_user()
|
| 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 …]
|
| /kernel/linux/linux-5.10/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 | 148 bool "Enable support for cost model based cgroup IO controller"
153 Enabling this option enables the .weight interface for cost
171 is mostly useful for kernel developers, but it doesn't incur any cost
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | energy_model.h | 19 * @cost: The cost coefficient associated with this level, used during
25 unsigned long cost; member
173 * as 'ps->cost'. in em_cpu_energy()
176 * share the same 'ps->cost', and the same CPU capacity. Hence, the in em_cpu_energy()
180 * ps->cost * \Sum cpu_util in em_cpu_energy()
184 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/kernel/power/ |
| D | energy_model.c | 44 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
144 /* Compute the cost of each performance state. */ in em_create_perf_table()
149 table[i].cost = div64_u64(fmax * power_res, in em_create_perf_table()
151 if (table[i].cost >= prev_cost) { in em_create_perf_table()
155 prev_cost = table[i].cost; in em_create_perf_table()
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
359 states, ...), the cost of using it in the wake-up path can become prohibitive.
|
| /kernel/linux/linux-5.10/drivers/iio/health/ |
| D | Kconfig | 19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/arm/omap/ |
| D | omap.txt | 119 - OMAP3 BeagleBoard : Low cost community board
131 - OMAP4 PandaBoard : Low cost community board
149 - AM335X Bone : Low cost community board
152 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-5.10/kernel/ |
| D | Kconfig.preempt | 28 at the cost of slightly lower throughput.
51 system is under load, at the cost of slightly lower throughput
|
| /kernel/linux/linux-5.10/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)
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/scripts/gcc-plugins/ |
| D | Kconfig | 52 there is little 'natural' source of entropy normally. The cost
101 at the cost of weakened randomization.
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-5.10/Documentation/power/ |
| D | energy-model.rst | 20 abstraction layer which standardizes the format of power cost tables in the
52 In case of CPU devices the EM framework manages power cost tables per
130 11 /* Estimate the power cost for the dev at the relevant freq. */
|
| /kernel/linux/linux-5.10/kernel/bpf/ |
| D | queue_stack_maps.c | 72 u64 size, queue_size, cost; in queue_stack_map_alloc() local
75 cost = queue_size = sizeof(*qs) + size * attr->value_size; in queue_stack_map_alloc()
77 ret = bpf_map_charge_init(&mem, cost); in queue_stack_map_alloc()
|
| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/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
|
| /kernel/linux/linux-5.10/arch/arm/nwfpe/ |
| D | entry.S | 41 so that the emulator startup cost can be avoided for tasks that don't
61 instructions to allow the emulator to spread the cost of the trap over
|