Home
last modified time | relevance | path

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

1234567

/linux/net/netfilter/
A Dxt_limit.c72 if ((READ_ONCE(priv->credit) < r->cost) && (READ_ONCE(priv->prev) == jiffies)) in limit_mt()
83 if (new_credit >= r->cost) { in limit_mt()
85 new_credit -= r->cost; in limit_mt()
128 if (r->cost == 0) { in limit_mt_check()
130 r->cost = user2credits(r->avg); in limit_mt_check()
150 u_int32_t credit_cap, cost; member
166 .cost = cm->cost, in limit_mt_compat_from_user()
180 .cost = m->cost, in limit_mt_compat_to_user()
A 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 …]
A Dxt_hashlimit.c103 u_int64_t cost; member
596 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
712 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
733 u64 cost; in hashlimit_mt_common() local
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()
780 dh->rateinfo.credit -= cost; in hashlimit_mt_common()
1106 ent->rateinfo.cost); in dl_seq_print()
[all …]
/linux/net/bridge/netfilter/
A 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/lib/zstd/compress/
A Dzstd_compress_sequences.c86 unsigned cost = 0; in ZSTD_entropyCost() local
93 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
95 return cost >> 8; in ZSTD_entropyCost()
108 size_t cost = 0; in ZSTD_fseBitCost() local
127 cost += (size_t)count[s] * bitCost; in ZSTD_fseBitCost()
129 return cost >> kAccuracyLog; in ZSTD_fseBitCost()
141 size_t cost = 0; in ZSTD_crossEntropyCost() local
149 cost += count[s] * kInverseProbabilityLog256[norm256]; in ZSTD_crossEntropyCost()
151 return cost >> 8; in ZSTD_crossEntropyCost()
/linux/block/
A Dblk-iocost.c2431 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2440 return cost; in adjust_inuse_and_calc_cost()
2448 return cost; in adjust_inuse_and_calc_cost()
2455 return cost; in adjust_inuse_and_calc_cost()
2480 return cost; in adjust_inuse_and_calc_cost()
2490 u64 cost = 0; in calc_vtime_cost_builtin() local
2521 *costp = cost; in calc_vtime_cost_builtin()
2526 u64 cost; in calc_vtime_cost() local
2529 return cost; in calc_vtime_cost()
2551 u64 cost; in calc_size_vtime_cost() local
[all …]
/linux/kernel/power/
A Denergy_model.c45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
178 table[i].cost = div64_u64(fmax * power_res, in em_create_perf_table()
180 if (table[i].cost >= prev_cost) { in em_create_perf_table()
185 prev_cost = table[i].cost; in em_create_perf_table()
/linux/include/linux/
A Denergy_model.h25 unsigned long cost; member
249 return ps->cost * sum_util / scale_cpu; in em_cpu_energy()
/linux/drivers/iio/health/
A DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/linux/fs/f2fs/
A Dgc.c473 unsigned int cost; in atgc_lookup_victim() local
510 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
513 if (cost < p->min_cost || in atgc_lookup_victim()
515 p->min_cost = cost; in atgc_lookup_victim()
546 unsigned int cost; in atssr_lookup_victim() local
580 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
582 if (cost < p->min_cost || in atssr_lookup_victim()
584 p->min_cost = cost; in atssr_lookup_victim()
715 unsigned long cost, *dirty_bitmap; in get_victim_by_default() local
782 if (p.min_cost > cost) { in get_victim_by_default()
[all …]
/linux/fs/cramfs/
A 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/Documentation/virt/
A Dguest-halt-polling.rst13 cost of handling the IPI) when performing a wakeup.
15 2) The VM-exit cost can be avoided.
/linux/include/uapi/linux/netfilter_bridge/
A Debt_limit.h22 __u32 credit_cap, cost; member
/linux/include/uapi/linux/netfilter/
A Dxt_limit.h21 __u32 credit_cap, cost; member
/linux/Documentation/devicetree/bindings/arm/omap/
A 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/Documentation/scheduler/
A 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
364 states, ...), the cost of using it in the wake-up path can become prohibitive.
/linux/Documentation/vm/
A 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/Documentation/block/
A 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/scripts/gcc-plugins/
A DKconfig38 there is little 'natural' source of entropy normally. The cost
85 at the cost of weakened randomization.
/linux/net/openvswitch/
A Dmeter.c602 u32 cost; in ovs_meter_execute() local
644 cost = (meter->kbps) ? skb->len * 8 : 1000; in ovs_meter_execute()
657 if (band->bucket >= cost) { in ovs_meter_execute()
658 band->bucket -= cost; in ovs_meter_execute()
/linux/kernel/bpf/
A Dstackmap.c93 u64 cost, n_buckets; in stack_map_alloc() local
121 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
122 cost += n_buckets * (value_size + sizeof(struct stack_map_bucket)); in stack_map_alloc()
123 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
/linux/Documentation/i2c/busses/
A Di2c-diolan-u2c.rst18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
/linux/Documentation/fb/
A 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
/linux/lib/
A DKconfig.kfence14 to have negligible cost to permit enabling it in production
24 enable KASAN due to its cost, consider using KFENCE.
/linux/Documentation/devicetree/bindings/iio/humidity/
A Ddht11.yaml13 A simple and low cost module providing a non standard single GPIO based

Completed in 41 milliseconds

1234567