Home
last modified time | relevance | path

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

1234567

/Linux-v5.4/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.c102 u_int64_t cost; member
614 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
619 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
730 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
751 u64 cost; in hashlimit_mt_common() local
778 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
779 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
792 cost = hashlimit_byte_cost(skb->len, dh); in hashlimit_mt_common()
794 cost = dh->rateinfo.cost; in hashlimit_mt_common()
796 if (dh->rateinfo.credit >= cost) { in hashlimit_mt_common()
[all …]
/Linux-v5.4/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.4/block/
Dblk-iocost.c667 static u64 cost_to_abs_cost(u64 cost, u32 hw_inuse) in cost_to_abs_cost() argument
669 return DIV64_U64_ROUND_UP(cost * hw_inuse, HWEIGHT_WHOLE); in cost_to_abs_cost()
672 static void iocg_commit_bio(struct ioc_gq *iocg, struct bio *bio, u64 cost) in iocg_commit_bio() argument
674 bio->bi_iocost_cost = cost; in iocg_commit_bio()
675 atomic64_add(cost, &iocg->vtime); in iocg_commit_bio()
1121 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1123 ctx->vbudget -= cost; in iocg_wake_fn()
1128 iocg_commit_bio(ctx->iocg, wait->bio, cost); in iocg_wake_fn()
1215 static void iocg_kick_delay(struct ioc_gq *iocg, struct ioc_now *now, u64 cost) in iocg_kick_delay() argument
1239 if (cost) { in iocg_kick_delay()
[all …]
/Linux-v5.4/include/linux/
Denergy_model.h23 unsigned long cost; member
148 return cs->cost * sum_util / scale_cpu; in em_pd_energy()
/Linux-v5.4/kernel/bpf/
Dxskmap.c85 u64 cost; in xsk_map_alloc() local
102 cost = (u64)m->map.max_entries * sizeof(struct xdp_sock *); in xsk_map_alloc()
103 cost += sizeof(struct list_head) * num_possible_cpus(); in xsk_map_alloc()
106 err = bpf_map_charge_init(&m->map.memory, cost); in xsk_map_alloc()
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()
Dstackmap.c90 u64 cost, n_buckets; in stack_map_alloc() local
116 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
117 cost += n_buckets * (value_size + sizeof(struct stack_map_bucket)); in stack_map_alloc()
118 err = bpf_map_charge_init(&mem, cost); in stack_map_alloc()
122 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
Dcpumap.c85 u64 cost; in cpu_map_alloc() local
108 cost = (u64) cmap->map.max_entries * sizeof(struct bpf_cpu_map_entry *); in cpu_map_alloc()
109 cost += sizeof(struct list_head) * num_possible_cpus(); in cpu_map_alloc()
112 ret = bpf_map_charge_init(&cmap->map.memory, cost); in cpu_map_alloc()
Ddevmap.c107 u64 cost; in dev_map_init_map() local
123 cost = (u64) dtab->map.max_entries * sizeof(struct bpf_dtab_netdev *); in dev_map_init_map()
124 cost += sizeof(struct list_head) * num_possible_cpus(); in dev_map_init_map()
131 cost += (u64) sizeof(struct hlist_head) * dtab->n_buckets; in dev_map_init_map()
135 err = bpf_map_charge_init(&dtab->map.memory, cost); in dev_map_init_map()
/Linux-v5.4/drivers/iio/health/
DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/Linux-v5.4/include/uapi/linux/netfilter_bridge/
Debt_limit.h22 __u32 credit_cap, cost; member
/Linux-v5.4/include/uapi/linux/netfilter/
Dxt_limit.h21 __u32 credit_cap, cost; member
/Linux-v5.4/kernel/power/
Denergy_model.c41 debugfs_create_ulong("cost", 0444, d, &cs->cost); in em_debug_create_cs()
152 table[i].cost = div64_u64(fmax * table[i].power, in em_create_pd()
/Linux-v5.4/Documentation/power/
Denergy-model.rst18 abstraction layer which standardizes the format of power cost tables in the
50 The EM framework manages power cost tables per 'performance domain' in the
118 10 /* Estimate the power cost for the CPU at the relevant freq. */
/Linux-v5.4/Documentation/virtual/
Dguest-halt-polling.txt11 cost of handling the IPI) when performing a wakeup.
13 2) The VM-exit cost can be avoided.
/Linux-v5.4/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.4/net/openvswitch/
Dmeter.c450 u32 cost; in ovs_meter_execute() local
486 cost = (meter->kbps) ? skb->len * 8 : 1000; in ovs_meter_execute()
499 if (band->bucket >= cost) { in ovs_meter_execute()
500 band->bucket -= cost; in ovs_meter_execute()
/Linux-v5.4/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.4/Documentation/devicetree/bindings/arm/omap/
Domap.txt115 - OMAP3 BeagleBoard : Low cost community board
124 - OMAP4 PandaBoard : Low cost community board
142 - AM335X Bone : Low cost community board
145 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
/Linux-v5.4/Documentation/i2c/busses/
Di2c-diolan-u2c.rst18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
/Linux-v5.4/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.4/kernel/
DKconfig.preempt28 at the cost of slightly lower throughput.
51 system is under load, at the cost of slightly lower throughput
/Linux-v5.4/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
354 energy. So, your platform must provide power cost tables to the EM framework in
367 states, ...), the cost of using it in the wake-up path can become prohibitive.

1234567