/linux-6.3-rc2/net/netfilter/ |
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()
|
A D | nft_limit.c | 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() 217 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone() 239 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local 241 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval() 320 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval() 335 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init() 371 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local [all …]
|
A D | xt_hashlimit.c | 103 u_int64_t cost; member 596 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init() 712 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost() 733 u64 cost; in hashlimit_mt_common() local 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() 780 dh->rateinfo.credit -= cost; in hashlimit_mt_common() 1106 ent->rateinfo.cost); in dl_seq_print() [all …]
|
/linux-6.3-rc2/include/linux/ |
A D | energy_model.h | 25 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.3-rc2/kernel/power/ |
A D | energy_model.c | 45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps() 160 unsigned long power_res, cost; in em_create_perf_table() local 163 ret = cb->get_cost(dev, table[i].frequency, &cost); in em_create_perf_table() 164 if (ret || !cost || cost > EM_MAX_POWER) { in em_create_perf_table() 166 cost, ret); in em_create_perf_table() 171 cost = div64_u64(fmax * power_res, table[i].frequency); in em_create_perf_table() 174 table[i].cost = cost; in em_create_perf_table() 176 if (table[i].cost >= prev_cost) { in em_create_perf_table() 181 prev_cost = table[i].cost; in em_create_perf_table()
|
/linux-6.3-rc2/net/bridge/netfilter/ |
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.3-rc2/lib/zstd/compress/ |
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-6.3-rc2/block/ |
A D | blk-iocost.c | 2457 u64 cost, new_inuse; in adjust_inuse_and_calc_cost() local 2466 return cost; in adjust_inuse_and_calc_cost() 2474 return cost; in adjust_inuse_and_calc_cost() 2481 return cost; in adjust_inuse_and_calc_cost() 2506 return cost; in adjust_inuse_and_calc_cost() 2516 u64 cost = 0; in calc_vtime_cost_builtin() local 2547 *costp = cost; in calc_vtime_cost_builtin() 2552 u64 cost; in calc_vtime_cost() local 2555 return cost; in calc_vtime_cost() 2577 u64 cost; in calc_size_vtime_cost() local [all …]
|
/linux-6.3-rc2/Documentation/translations/zh_CN/mm/ |
A D | overcommit-accounting.rst | 58 | SHARED or READ-only - 0 cost (该文件是映射而不是交换) 63 | PRIVATE READ-only - 0 cost (但作用不大)
|
/linux-6.3-rc2/drivers/iio/health/ |
A D | Kconfig | 19 heart rate monitor and low-cost pulse oximeter. 32 heart rate monitor and low-cost pulse oximeter.
|
/linux-6.3-rc2/include/uapi/linux/netfilter_bridge/ |
A D | ebt_limit.h | 22 __u32 credit_cap, cost; member
|
/linux-6.3-rc2/include/uapi/linux/netfilter/ |
A D | xt_limit.h | 21 __u32 credit_cap, cost; member
|
/linux-6.3-rc2/Documentation/power/ |
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 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.3-rc2/Documentation/virt/ |
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.3-rc2/fs/f2fs/ |
A D | gc.c | 496 unsigned int cost; in atgc_lookup_victim() local 533 cost = UINT_MAX - (age + u); in atgc_lookup_victim() 536 if (cost < p->min_cost || in atgc_lookup_victim() 538 p->min_cost = cost; in atgc_lookup_victim() 569 unsigned int cost; in atssr_lookup_victim() local 603 cost = UINT_MAX - vblocks; in atssr_lookup_victim() 605 if (cost < p->min_cost || in atssr_lookup_victim() 607 p->min_cost = cost; in atssr_lookup_victim() 786 unsigned long cost, *dirty_bitmap; in get_victim_by_default() local 856 if (p.min_cost > cost) { in get_victim_by_default() [all …]
|
/linux-6.3-rc2/fs/cramfs/ |
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.3-rc2/Documentation/mm/ |
A D | overcommit-accounting.rst | 58 | 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.3-rc2/Documentation/devicetree/bindings/arm/omap/ |
A D | omap.txt | 119 - 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.3-rc2/drivers/net/ethernet/microchip/sparx5/ |
A D | sparx5_qos.h | 59 u8 cost[SPX5_PRIOS]; member
|
/linux-6.3-rc2/Documentation/scheduler/ |
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 364 states, ...), the cost of using it in the wake-up path can become prohibitive.
|
/linux-6.3-rc2/Documentation/i2c/busses/ |
A D | i2c-diolan-u2c.rst | 18 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
|
/linux-6.3-rc2/Documentation/block/ |
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.3-rc2/mm/ |
A D | swap.c | 272 unsigned long cost; in lru_note_cost() local 281 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; in lru_note_cost() 296 lruvec->file_cost += cost; in lru_note_cost() 298 lruvec->anon_cost += cost; in lru_note_cost()
|
/linux-6.3-rc2/Documentation/devicetree/bindings/iio/humidity/ |
A D | dht11.yaml | 13 A simple and low cost module providing a non standard single GPIO based
|
/linux-6.3-rc2/Documentation/fb/ |
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
|