| /kernel/linux/linux-5.10/net/netfilter/ |
| D | xt_limit.c | 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
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()
774 cost = hashlimit_byte_cost(skb->len, dh); in hashlimit_mt_common()
776 cost = dh->rateinfo.cost; in hashlimit_mt_common()
778 if (dh->rateinfo.credit >= cost) { in hashlimit_mt_common()
[all …]
|
| /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/block/ |
| D | blk-iocost.c | 716 static u64 cost_to_abs_cost(u64 cost, u32 hw_inuse) in cost_to_abs_cost() argument
718 return DIV64_U64_ROUND_UP(cost * hw_inuse, WEIGHT_ONE); in cost_to_abs_cost()
722 u64 abs_cost, u64 cost) in iocg_commit_bio() argument
726 bio->bi_iocost_cost = cost; in iocg_commit_bio()
727 atomic64_add(cost, &iocg->vtime); in iocg_commit_bio()
1389 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1391 ctx->vbudget -= cost; in iocg_wake_fn()
1396 iocg_commit_bio(ctx->iocg, wait->bio, wait->abs_cost, cost); in iocg_wake_fn()
2409 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2413 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
|
| /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()
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/include/linux/ |
| D | energy_model.h | 25 unsigned long cost; member
184 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
|
| /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/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/include/uapi/linux/netfilter_bridge/ |
| D | ebt_limit.h | 22 __u32 credit_cap, cost; member
|
| /kernel/linux/patches/linux-5.10/prebuilts/usr/include/linux/netfilter_bridge/ |
| D | ebt_limit.h | 29 __u32 credit_cap, cost; member
|
| /kernel/linux/patches/linux-4.19/prebuilts/usr/include/linux/netfilter_bridge/ |
| D | ebt_limit.h | 17 __u32 credit_cap, cost; member
|
| /kernel/linux/patches/linux-5.10/prebuilts/usr/include/linux/netfilter/ |
| D | xt_limit.h | 29 __u32 credit_cap, cost; member
|
| /kernel/linux/patches/linux-4.19/prebuilts/usr/include/linux/netfilter/ |
| D | xt_limit.h | 17 __u32 credit_cap, cost; member
|
| /kernel/linux/linux-5.10/include/uapi/linux/netfilter/ |
| D | xt_limit.h | 21 __u32 credit_cap, cost; member
|
| /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/fs/f2fs/ |
| D | gc.c | 467 unsigned int cost; in atgc_lookup_victim() local
504 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
507 if (cost < p->min_cost || in atgc_lookup_victim()
508 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
509 p->min_cost = cost; in atgc_lookup_victim()
540 unsigned int cost; in atssr_lookup_victim() local
574 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
576 if (cost < p->min_cost || in atssr_lookup_victim()
577 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()
578 p->min_cost = cost; in atssr_lookup_victim()
[all …]
|
| /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/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/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/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/i2c/busses/ |
| D | i2c-diolan-u2c.rst | 18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
|
| /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/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/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.
|