Home
last modified time | relevance | path

Searched refs:cost (Results 1 – 25 of 153) sorted by relevance

1234567

/Linux-v5.10/net/netfilter/
Dxt_limit.c76 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()
Dnft_limit.c28 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 …]
Dxt_hashlimit.c103 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 …]
/Linux-v5.10/net/bridge/netfilter/
Debt_limit.c46 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.10/block/
Dblk-iocost.c716 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()
1379 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1381 ctx->vbudget -= cost; in iocg_wake_fn()
1386 iocg_commit_bio(ctx->iocg, wait->bio, wait->abs_cost, cost); in iocg_wake_fn()
2391 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2395 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
/Linux-v5.10/include/linux/
Denergy_model.h25 unsigned long cost; member
168 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
/Linux-v5.10/kernel/bpf/
Dqueue_stack_maps.c72 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()
Dringbuf.c153 u64 cost; in ringbuf_map_alloc() local
176 cost = sizeof(struct bpf_ringbuf_map) + in ringbuf_map_alloc()
179 err = bpf_map_charge_init(&rb_map->map.memory, cost); in ringbuf_map_alloc()
Dstackmap.c94 u64 cost, n_buckets; in stack_map_alloc() local
120 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
121 cost += n_buckets * (value_size + sizeof(struct stack_map_bucket)); in stack_map_alloc()
122 err = bpf_map_charge_init(&mem, cost); in stack_map_alloc()
126 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
Dbpf_local_storage.c546 u64 cost; in bpf_local_storage_map_alloc() local
558 cost = sizeof(*smap->buckets) * nbuckets + sizeof(*smap); in bpf_local_storage_map_alloc()
560 ret = bpf_map_charge_init(&smap->map.memory, cost); in bpf_local_storage_map_alloc()
/Linux-v5.10/drivers/iio/health/
DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/Linux-v5.10/include/uapi/linux/netfilter_bridge/
Debt_limit.h22 __u32 credit_cap, cost; member
/Linux-v5.10/include/uapi/linux/netfilter/
Dxt_limit.h21 __u32 credit_cap, cost; member
/Linux-v5.10/fs/f2fs/
Dgc.c453 unsigned int cost; in atgc_lookup_victim() local
490 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
493 if (cost < p->min_cost || in atgc_lookup_victim()
494 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
495 p->min_cost = cost; in atgc_lookup_victim()
526 unsigned int cost; in atssr_lookup_victim() local
560 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
562 if (cost < p->min_cost || in atssr_lookup_victim()
563 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()
564 p->min_cost = cost; in atssr_lookup_victim()
[all …]
/Linux-v5.10/Documentation/virt/
Dguest-halt-polling.rst13 cost of handling the IPI) when performing a wakeup.
15 2) The VM-exit cost can be avoided.
/Linux-v5.10/fs/cramfs/
DREADME147 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.10/Documentation/power/
Denergy-model.rst20 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. */
/Linux-v5.10/Documentation/vm/
Dovercommit-accounting.rst59 | 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.10/kernel/power/
Denergy_model.c44 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
160 table[i].cost = div64_u64(fmax * table[i].power, in em_create_perf_table()
/Linux-v5.10/Documentation/devicetree/bindings/arm/omap/
Domap.txt119 - 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.10/Documentation/i2c/busses/
Di2c-diolan-u2c.rst18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
/Linux-v5.10/Documentation/scheduler/
Dsched-energy.rst83 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.
/Linux-v5.10/Documentation/block/
Ddeadline-iosched.rst43 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.10/kernel/
DKconfig.preempt28 at the cost of slightly lower throughput.
51 system is under load, at the cost of slightly lower throughput
/Linux-v5.10/Documentation/fb/
Ddeferred_io.rst17 - 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

1234567