Home
last modified time | relevance | path

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

12345

/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/kernel/power/
H A Denergy_model.c76 DEFINE_EM_DBG_SHOW(cost, cost);
266 unsigned long power_res, cost; in em_compute_costs() local
269 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_compute_costs()
270 if (ret || !cost || cost > EM_MAX_POWER) { in em_compute_costs()
272 cost, ret); in em_compute_costs()
278 cost = power_res / table[i].performance; in em_compute_costs()
281 table[i].cost = cost; in em_compute_costs()
283 if (table[i].cost >= prev_cost) { in em_compute_costs()
288 prev_cost = table[i].cost; in em_compute_costs()
/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/block/
H A Dblk-iocost.c712 static u64 cost_to_abs_cost(u64 cost, u32 hw_inuse) in cost_to_abs_cost() argument
714 return DIV64_U64_ROUND_UP(cost * hw_inuse, WEIGHT_ONE); in cost_to_abs_cost()
718 u64 abs_cost, u64 cost) in iocg_commit_bio() argument
722 bio->bi_iocost_cost = cost; in iocg_commit_bio()
723 atomic64_add(cost, &iocg->vtime); in iocg_commit_bio()
1473 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); in iocg_wake_fn() local
1475 ctx->vbudget -= cost; in iocg_wake_fn()
1480 iocg_commit_bio(ctx->iocg, wait->bio, wait->abs_cost, cost); in iocg_wake_fn()
2475 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2480 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
/linux/include/linux/
H A Denergy_model.h28 unsigned long cost; member
162 unsigned long *cost);
315 return ps->cost * sum_util; in em_cpu_energy()
/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/mm/
H A Dswap.c244 unsigned long cost; in lru_note_cost_unlock_irq() local
247 * Reflect the relative cost of incurring IO and spending CPU in lru_note_cost_unlock_irq()
253 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; in lru_note_cost_unlock_irq()
254 if (!cost) { in lru_note_cost_unlock_irq()
262 /* Record cost event */ 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/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/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/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/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/drivers/net/ethernet/microchip/sparx5/
H A Dsparx5_qos.h59 u8 cost[SPX5_PRIOS]; member
/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/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/Documentation/ABI/testing/
H A Dsysfs-bus-iio-ina2xx-adc9 in-driver readout rate at the cost of an additional register read.
/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

12345