| /linux/net/netfilter/ |
| H A D | xt_limit.c | 72 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 D | nft_limit.c | 32 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 …]
|
| /linux/net/bridge/netfilter/ |
| H A D | ebt_limit.c | 46 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 D | zstd_compress_sequences.c | 86 unsigned cost = 0; in ZSTD_entropyCost() local
95 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
97 return cost >> 8; in ZSTD_entropyCost()
110 size_t cost = 0; in ZSTD_fseBitCost() local
129 cost += (size_t)count[s] * bitCost; in ZSTD_fseBitCost()
131 return cost >> kAccuracyLog; in ZSTD_fseBitCost()
143 size_t cost = 0; in ZSTD_crossEntropyCost() local
151 cost += count[s] * kInverseProbabilityLog256[norm256]; in ZSTD_crossEntropyCost()
153 return cost >> 8; in ZSTD_crossEntropyCost()
|
| /linux/block/ |
| H A D | blk-iocost.c | 712 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()
2477 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local
2482 cost = abs_cost_to_cost(abs_cost, hwi); in adjust_inuse_and_calc_cost()
[all …]
|
| H A D | Kconfig | 155 bool "Enable support for cost model based cgroup IO controller"
159 Enabling this option enables the .weight interface for cost
179 is mostly useful for kernel developers, but it doesn't incur any cost
|
| /linux/drivers/iio/health/ |
| H A D | Kconfig | 19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
|
| /linux/Documentation/power/ |
| H A D | energy-model.rst | 20 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/include/uapi/linux/netfilter_bridge/ |
| H A D | ebt_limit.h | 22 __u32 credit_cap, cost; member
|
| /linux/include/uapi/linux/netfilter/ |
| H A D | xt_limit.h | 21 __u32 credit_cap, cost; member
|
| /linux/fs/cramfs/ |
| H A D | README | 147 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 D | guest-halt-polling.rst | 13 cost of handling the IPI) when performing a wakeup.
15 2) The VM-exit cost can be avoided.
|
| /linux/Documentation/mm/ |
| H A D | overcommit-accounting.rst | 57 | 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 D | multigen_lru.rst | 62 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 D | sched-energy.rst | 83 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 D | deadline-iosched.rst | 43 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 D | i2c-diolan-u2c.rst | 18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
|
| /linux/net/openvswitch/ |
| H A D | meter.c | 602 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 D | deferred_io.rst | 17 - 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 D | sysfs-bus-iio-ina2xx-adc | 9 in-driver readout rate at the cost of an additional register read.
|
| /linux/lib/ |
| H A D | Kconfig.kfence | 14 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 D | tlb.rst | 13 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 D | Kconfig | 38 there is little 'natural' source of entropy normally. The cost
|
| /linux/kernel/bpf/ |
| H A D | stackmap.c | 74 u64 cost, n_buckets; in stack_map_alloc() local
102 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
103 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
|
| /linux/arch/sparc/lib/ |
| H A D | M7memset.S | 183 blu,pn %xcc, .short_set ! to justify cost of membar
253 ! to pay %asi + membar cost
|