Home
last modified time | relevance | path

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

1234567

/linux-6.1.9/net/netfilter/
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()
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()
160 u64 cost; member
169 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
192 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
216 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone()
238 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
240 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
319 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
334 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
[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-6.1.9/include/linux/
Denergy_model.h25 unsigned long cost; member
115 #define em_estimate_energy(cost, sum_util, scale_cpu) \ argument
116 (((cost) * (sum_util)) / (scale_cpu))
118 #define em_estimate_energy(cost, sum_util, scale_cpu) \ argument
119 (((cost) / (scale_cpu)) * (sum_util))
160 unsigned long *cost);
298 return em_estimate_energy(ps->cost, sum_util, scale_cpu); in em_cpu_energy()
/linux-6.1.9/kernel/power/
Denergy_model.c45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
163 unsigned long power_res, cost; in em_create_perf_table() local
166 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_create_perf_table()
167 if (ret || !cost || cost > EM_MAX_POWER) { in em_create_perf_table()
169 cost, ret); in em_create_perf_table()
174 cost = div64_u64(fmax * power_res, table[i].frequency); in em_create_perf_table()
177 table[i].cost = cost; in em_create_perf_table()
179 if (table[i].cost >= prev_cost) { in em_create_perf_table()
184 prev_cost = table[i].cost; in em_create_perf_table()
/linux-6.1.9/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-6.1.9/lib/zstd/compress/
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-6.1.9/block/
Dblk-iocost.c709 static u64 cost_to_abs_cost(u64 cost, u32 hw_inuse) in cost_to_abs_cost() argument
711 return DIV64_U64_ROUND_UP(cost * hw_inuse, WEIGHT_ONE); in cost_to_abs_cost()
715 u64 abs_cost, u64 cost) in iocg_commit_bio() argument
719 bio->bi_iocost_cost = cost; in iocg_commit_bio()
720 atomic64_add(cost, &iocg->vtime); in iocg_commit_bio()
1430 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1432 ctx->vbudget -= cost; in iocg_wake_fn()
1437 iocg_commit_bio(ctx->iocg, wait->bio, wait->abs_cost, cost); in iocg_wake_fn()
2430 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2434 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
/linux-6.1.9/Documentation/translations/zh_CN/mm/
Dovercommit-accounting.rst58 | SHARED or READ-only - 0 cost (该文件是映射而不是交换)
63 | PRIVATE READ-only - 0 cost (但作用不大)
/linux-6.1.9/drivers/iio/health/
DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/linux-6.1.9/include/uapi/linux/netfilter_bridge/
Debt_limit.h22 __u32 credit_cap, cost; member
/linux-6.1.9/include/uapi/linux/netfilter/
Dxt_limit.h21 __u32 credit_cap, cost; member
/linux-6.1.9/Documentation/power/
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
131 .get_cost() is optional and provides the 'cost' values used by the EAS.
136 The .get_cost() allows to provide the 'cost' values which reflect the
139 formulas calculating 'cost' values. To register an EM for such platform, the
214 11 /* Estimate the power cost for the dev at the relevant freq. */
/linux-6.1.9/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-6.1.9/fs/f2fs/
Dgc.c495 unsigned int cost; in atgc_lookup_victim() local
532 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
535 if (cost < p->min_cost || in atgc_lookup_victim()
536 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
537 p->min_cost = cost; in atgc_lookup_victim()
568 unsigned int cost; in atssr_lookup_victim() local
602 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
604 if (cost < p->min_cost || in atssr_lookup_victim()
605 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()
606 p->min_cost = cost; in atssr_lookup_victim()
[all …]
/linux-6.1.9/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-6.1.9/Documentation/mm/
Dovercommit-accounting.rst58 | SHARED or READ-only - 0 cost (the file is the map not swap)
63 | PRIVATE READ-only - 0 cost (but of little use)
/linux-6.1.9/Documentation/devicetree/bindings/arm/omap/
Domap.txt119 - OMAP3 BeagleBoard : Low cost community board
131 - OMAP4 PandaBoard : Low cost community board
149 - AM335X Bone : Low cost community board
152 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
/linux-6.1.9/drivers/net/ethernet/microchip/sparx5/
Dsparx5_qos.h59 u8 cost[SPX5_PRIOS]; member
/linux-6.1.9/Documentation/i2c/busses/
Di2c-diolan-u2c.rst18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
/linux-6.1.9/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
364 states, ...), the cost of using it in the wake-up path can become prohibitive.
/linux-6.1.9/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-6.1.9/Documentation/devicetree/bindings/iio/humidity/
Ddht11.yaml13 A simple and low cost module providing a non standard single GPIO based
/linux-6.1.9/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
/linux-6.1.9/net/openvswitch/
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()

1234567