Home
last modified time | relevance | path

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

123456

/linux/net/netfilter/
H 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()
H A Dnft_limit.c32 static inline bool nft_limit_eval(struct nft_limit_priv *priv, u64 cost) in nft_limit_eval() argument
44 delta = tokens - cost; in nft_limit_eval()
174 u64 cost; member
183 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
206 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
232 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone()
254 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
256 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
336 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
351 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
[all …]
H A Dxt_hashlimit.c102 u_int64_t cost; member
598 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
603 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
714 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
735 u64 cost; in hashlimit_mt_common() local
762 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
763 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
776 cost = hashlimit_byte_cost(skb->len, dh); in hashlimit_mt_common()
778 cost = dh->rateinfo.cost; in hashlimit_mt_common()
780 if (dh->rateinfo.credit >= cost) { in hashlimit_mt_common()
[all …]
/linux/net/bridge/netfilter/
H 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/
H A Dzstd_compress_sequences.c87 unsigned cost = 0; in ZSTD_entropyCost() local
96 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
98 return cost >> 8; in ZSTD_entropyCost()
111 size_t cost = 0; in ZSTD_fseBitCost() local
130 cost += (size_t)count[s] * bitCost; in ZSTD_fseBitCost()
132 return cost >> kAccuracyLog; in ZSTD_fseBitCost()
144 size_t cost = 0; in ZSTD_crossEntropyCost() local
152 cost += count[s] * kInverseProbabilityLog256[norm256]; in ZSTD_crossEntropyCost()
154 return cost >> 8; in ZSTD_crossEntropyCost()
/linux/drivers/iio/health/
H A DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/linux/Documentation/power/
H A Denergy-model.rst20 abstraction layer which standardizes the format of power cost tables in the
67 In case of CPU devices the EM framework manages power cost tables per
156 .get_cost() is optional and provides the 'cost' values used by the EAS.
161 The .get_cost() allows to provide the 'cost' values which reflect the
164 formulas calculating 'cost' values. To register an EM for such platform, the
259 There is dedicated API for device drivers to calculate em_perf_state::cost
265 These 'cost' values from EM are used in EAS. The new EM table should be passed
267 of the cost values is done properly the return value from the function is 0.
314 11 /* Estimate the power cost for the dev at the relevant freq. */
383 28 /* Calculate 'cost' values for EAS */
/linux/mm/
H A Dswap.c244 unsigned long cost; in lru_note_cost_unlock_irq() local
253 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; in lru_note_cost_unlock_irq()
254 if (!cost) { in lru_note_cost_unlock_irq()
264 lruvec->file_cost += cost; in lru_note_cost_unlock_irq()
266 lruvec->anon_cost += cost; in lru_note_cost_unlock_irq()
/linux/include/uapi/linux/netfilter_bridge/
H A Debt_limit.h22 __u32 credit_cap, cost; member
/linux/include/uapi/linux/netfilter/
H A Dxt_limit.h21 __u32 credit_cap, cost; member
/linux/Documentation/virt/
H A Dguest-halt-polling.rst13 cost of handling the IPI) when performing a wakeup.
15 2) The VM-exit cost can be avoided.
/linux/fs/cramfs/
H 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/fs/f2fs/
H A Dgc.c566 unsigned int cost; in atgc_lookup_victim() local
601 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
604 if (cost < p->min_cost || in atgc_lookup_victim()
605 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
606 p->min_cost = cost; in atgc_lookup_victim()
634 unsigned int cost, iter; in atssr_lookup_victim() local
665 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
667 if (cost < p->min_cost || in atssr_lookup_victim()
668 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()
669 p->min_cost = cost; in atssr_lookup_victim()
[all …]
/linux/Documentation/mm/
H A Dovercommit-accounting.rst57 | SHARED or READ-only - 0 cost (the file is the map not swap)
62 | PRIVATE READ-only - 0 cost (but of little use)
H A Dmultigen_lru.rst62 2. The cost of evicting the former channel is higher due to the TLB
103 ``folio->flags`` and therefore has a negligible cost. A feedback loop
187 can incur the highest CPU cost in the reclaim path.
207 is false positive, the cost is an additional scan of a range of PTEs,
/linux/Documentation/scheduler/
H 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
/linux/Documentation/block/
H 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/Documentation/i2c/busses/
H A Di2c-diolan-u2c.rst18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
/linux/net/openvswitch/
H 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/Documentation/ABI/testing/
H A Dsysfs-bus-iio-ina2xx-adc9 in-driver readout rate at the cost of an additional register read.
/linux/Documentation/fb/
H 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/
H 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/arch/x86/
H A Dtlb.rst13 destroyed and must be refilled later, at some cost.
15 time. This could potentially cost many more instructions, but
/linux/scripts/gcc-plugins/
H A DKconfig28 there is little 'natural' source of entropy normally. The cost
/linux/arch/sparc/lib/
H A DM7memset.S183 blu,pn %xcc, .short_set ! to justify cost of membar
253 ! to pay %asi + membar cost

123456