| /linux-6.15/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 | 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() 387 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local [all …]
|
| H A D | xt_hashlimit.c | 102 u_int64_t cost; member 598 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init() 714 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost() 735 u64 cost; in hashlimit_mt_common() local 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() 782 dh->rateinfo.credit -= cost; in hashlimit_mt_common() 1108 ent->rateinfo.cost); in dl_seq_print() [all …]
|
| /linux-6.15/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-6.15/kernel/power/ |
| H A D | energy_model.c | 64 DEFINE_EM_DBG_SHOW(cost, cost); 238 unsigned long power_res, cost; in em_compute_costs() local 241 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_compute_costs() 242 if (ret || !cost || cost > EM_MAX_POWER) { in em_compute_costs() 244 cost, ret); in em_compute_costs() 250 cost = power_res / table[i].performance; in em_compute_costs() 253 table[i].cost = cost; in em_compute_costs() 255 if (table[i].cost >= prev_cost) { in em_compute_costs() 260 prev_cost = table[i].cost; in em_compute_costs()
|
| /linux-6.15/lib/zstd/compress/ |
| H A D | zstd_compress_sequences.c | 87 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-6.15/block/ |
| H A D | blk-iocost.c | 2477 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local 2487 return cost; in adjust_inuse_and_calc_cost() 2495 return cost; in adjust_inuse_and_calc_cost() 2502 return cost; in adjust_inuse_and_calc_cost() 2527 return cost; in adjust_inuse_and_calc_cost() 2537 u64 cost = 0; in calc_vtime_cost_builtin() local 2572 *costp = cost; in calc_vtime_cost_builtin() 2577 u64 cost; in calc_vtime_cost() local 2580 return cost; in calc_vtime_cost() 2602 u64 cost; in calc_size_vtime_cost() local [all …]
|
| /linux-6.15/Documentation/translations/zh_CN/mm/ |
| H A D | overcommit-accounting.rst | 57 | SHARED or READ-only - 0 cost (该文件是映射而不是交换) 62 | PRIVATE READ-only - 0 cost (但作用不大)
|
| /linux-6.15/include/linux/ |
| H A D | energy_model.h | 28 unsigned long cost; member 158 unsigned long *cost); 307 return ps->cost * sum_util; in em_cpu_energy()
|
| /linux-6.15/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-6.15/include/uapi/linux/netfilter_bridge/ |
| H A D | ebt_limit.h | 22 __u32 credit_cap, cost; member
|
| /linux-6.15/include/uapi/linux/netfilter/ |
| H A D | xt_limit.h | 21 __u32 credit_cap, cost; member
|
| /linux-6.15/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-6.15/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-6.15/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-6.15/fs/f2fs/ |
| H A D | gc.c | 565 unsigned int cost; in atgc_lookup_victim() local 600 cost = UINT_MAX - (age + u); in atgc_lookup_victim() 603 if (cost < p->min_cost || in atgc_lookup_victim() 605 p->min_cost = cost; in atgc_lookup_victim() 633 unsigned int cost, iter; in atssr_lookup_victim() local 664 cost = UINT_MAX - vblocks; in atssr_lookup_victim() 666 if (cost < p->min_cost || in atssr_lookup_victim() 668 p->min_cost = cost; in atssr_lookup_victim() 847 unsigned long cost, *dirty_bitmap; in f2fs_get_victim() local 917 if (p.min_cost > cost) { in f2fs_get_victim() [all …]
|
| /linux-6.15/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)
|
| /linux-6.15/drivers/net/ethernet/microchip/sparx5/ |
| H A D | sparx5_qos.h | 59 u8 cost[SPX5_PRIOS]; member
|
| /linux-6.15/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-6.15/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-6.15/mm/ |
| H A D | swap.c | 243 unsigned long cost; in lru_note_cost() local 252 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; in lru_note_cost() 267 lruvec->file_cost += cost; in lru_note_cost() 269 lruvec->anon_cost += cost; in lru_note_cost()
|
| /linux-6.15/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-6.15/Documentation/devicetree/bindings/iio/humidity/ |
| H A D | dht11.yaml | 13 A simple and low cost module providing a non standard single GPIO based
|
| /linux-6.15/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-6.15/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
|