| /kernel/linux/linux-4.19/net/netfilter/ |
| D | xt_limit.c | 39 `credit_cap'. The `peak rate' becomes the cost of passing the
40 test, `cost'.
44 discarded. Every time the match passes, you lose `cost' credits;
79 if (priv->credit >= r->cost) { in limit_mt()
81 priv->credit -= r->cost; in limit_mt()
124 if (r->cost == 0) { in limit_mt_check()
126 r->cost = user2credits(r->avg); in limit_mt_check()
147 u_int32_t credit_cap, cost; member
163 .cost = cm->cost, in limit_mt_compat_from_user()
177 .cost = m->cost, in limit_mt_compat_to_user()
|
| D | nft_limit.c | 31 static inline bool nft_limit_eval(struct nft_limit *limit, u64 cost) in nft_limit_eval() argument
43 delta = tokens - cost; in nft_limit_eval()
129 u64 cost; member
138 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
161 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
186 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
188 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
248 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
263 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
290 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local
[all …]
|
| D | xt_hashlimit.c | 96 u_int64_t cost; member
455 `credit_cap'. The `peak rate' becomes the cost of passing the
456 test, `cost'.
460 discarded. Every time the match passes, you lose `cost' credits;
608 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
613 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
724 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
745 u64 cost; in hashlimit_mt_common() local
772 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
773 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
[all …]
|
| /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-4.19/kernel/bpf/ |
| D | reuseport_array.c | 154 u64 cost, array_size; in reuseport_array_alloc() local
163 cost = array_size; in reuseport_array_alloc()
164 if (cost >= U32_MAX - PAGE_SIZE) in reuseport_array_alloc()
166 cost = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in reuseport_array_alloc()
168 err = bpf_map_precharge_memlock(cost); in reuseport_array_alloc()
179 array->map.pages = cost; in reuseport_array_alloc()
|
| D | xskmap.c | 22 u64 cost; in xsk_map_alloc() local
38 cost = (u64)m->map.max_entries * sizeof(struct xdp_sock *); in xsk_map_alloc()
39 cost += sizeof(struct list_head) * num_possible_cpus(); in xsk_map_alloc()
40 if (cost >= U32_MAX - PAGE_SIZE) in xsk_map_alloc()
43 m->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in xsk_map_alloc()
|
| D | arraymap.c | 84 u64 cost, array_size, mask64; in array_map_alloc() local
117 cost = array_size; in array_map_alloc()
118 if (cost >= U32_MAX - PAGE_SIZE) in array_map_alloc()
121 cost += (u64)attr->max_entries * elem_size * num_possible_cpus(); in array_map_alloc()
122 if (cost >= U32_MAX - PAGE_SIZE) in array_map_alloc()
125 cost = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in array_map_alloc()
127 ret = bpf_map_precharge_memlock(cost); in array_map_alloc()
140 array->map.pages = cost; in array_map_alloc()
|
| D | stackmap.c | 93 u64 cost, n_buckets; in stack_map_alloc() local
119 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
120 if (cost >= U32_MAX - PAGE_SIZE) in stack_map_alloc()
123 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
128 cost += n_buckets * (value_size + sizeof(struct stack_map_bucket)); in stack_map_alloc()
129 if (cost >= U32_MAX - PAGE_SIZE) in stack_map_alloc()
135 smap->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in stack_map_alloc()
|
| /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-4.19/net/bridge/netfilter/ |
| D | ebt_limit.c | 45 if (info->credit >= info->cost) { in ebt_limit_mt()
47 info->credit -= info->cost; in ebt_limit_mt()
84 info->cost = user2credits(info->avg); in ebt_limit_mt_check()
97 compat_uint_t credit, credit_cap, cost; member
|
| /kernel/linux/linux-4.19/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/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-4.19/drivers/iio/health/ |
| D | Kconfig | 18 heart rate monitor and low-cost pulse oximeter.
31 heart rate monitor and low-cost pulse oximeter.
|
| /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-4.19/Documentation/devicetree/bindings/arm/omap/ |
| D | omap.txt | 112 - OMAP3 BeagleBoard : Low cost community board
121 - OMAP4 PandaBoard : Low cost community board
139 - AM335X Bone : Low cost community board
142 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
|
| /kernel/linux/linux-4.19/kernel/ |
| D | Kconfig.preempt | 27 at the cost of slightly lower throughput.
50 system is under load, at the cost of slightly lower throughput
|
| /kernel/linux/linux-5.10/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.
|
| /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
|