Home
last modified time | relevance | path

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

12345678910>>...12

/openbmc/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()
231 priv_dst->cost = priv_src->cost; in nft_limit_pkts_clone()
253 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
255 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
334 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
349 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
[all …]
H A 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 …]
/openbmc/linux/include/linux/
H A 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()
/openbmc/linux/kernel/power/
H A Denergy_model.c45 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()
/openbmc/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
/openbmc/linux/lib/zstd/compress/
H A Dzstd_compress_sequences.c86 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()
/openbmc/u-boot/lib/bzip2/
H A Dbzlib_compress.c297 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
397 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
424 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; in sendMTFValues()
425 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; in sendMTFValues()
426 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; in sendMTFValues()
432 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
442 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
/openbmc/openbmc/meta-google/recipes-google/networking/gbmc-bridge/
H A D+-bmc-gbmcbrusb.network6 # USB speeds tend to be better than 100mbit (100 cost) but worse
7 # than 1gbit (10 cost). Generally around 200mbit.
/openbmc/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()
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 …]
/openbmc/linux/Documentation/translations/zh_CN/mm/
H A Dovercommit-accounting.rst58 | SHARED or READ-only - 0 cost (该文件是映射而不是交换)
63 | PRIVATE READ-only - 0 cost (但作用不大)
/openbmc/openbmc/poky/meta/files/common-licenses/
H A DNICTA-1.055 iii. the payment of the cost of replacing the goods or of acquiring
57 iv. the payment of the cost of having the goods repaired; or
60 ii. the payment of the cost of having the services supplied
H A DSMPPL5 …cost and with no financial limitations regarding its use and distribution. Organizations can use t…
15 …oped by you and/or by others, at no charge or at a charge that covers the cost of reproducing such…
/openbmc/linux/drivers/iio/health/
H A DKconfig19 heart rate monitor and low-cost pulse oximeter.
32 heart rate monitor and low-cost pulse oximeter.
/openbmc/openbmc/meta-openembedded/meta-perl/recipes-perl/libstrictures/
H A Dlibstrictures-perl_2.000006.bb16 as such) get caught, but not at the cost of an XS dependency and not at the \
17 cost of blowing things up on another machine. \
/openbmc/linux/include/uapi/linux/netfilter_bridge/
H A Debt_limit.h22 __u32 credit_cap, cost; member
/openbmc/linux/include/uapi/linux/netfilter/
H A Dxt_limit.h21 __u32 credit_cap, cost; member
/openbmc/linux/Documentation/power/
H A 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. */
/openbmc/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.
/openbmc/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
/openbmc/linux/fs/f2fs/
H A Dgc.c540 unsigned int cost; in atgc_lookup_victim() local
575 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
578 if (cost < p->min_cost || in atgc_lookup_victim()
579 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
580 p->min_cost = cost; in atgc_lookup_victim()
608 unsigned int cost, iter; in atssr_lookup_victim() local
639 cost = UINT_MAX - vblocks; in atssr_lookup_victim()
641 if (cost < p->min_cost || in atssr_lookup_victim()
642 (cost == p->min_cost && age > p->oldest_age)) { in atssr_lookup_victim()
643 p->min_cost = cost; in atssr_lookup_victim()
[all …]
/openbmc/linux/Documentation/mm/
H A 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)
/openbmc/linux/Documentation/scheduler/
H A 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.
/openbmc/linux/drivers/net/ethernet/microchip/sparx5/
H A Dsparx5_qos.h59 u8 cost[SPX5_PRIOS]; member
/openbmc/linux/mm/
H A Dswap.c264 unsigned long cost; in lru_note_cost() local
273 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; in lru_note_cost()
288 lruvec->file_cost += cost; in lru_note_cost()
290 lruvec->anon_cost += cost; in lru_note_cost()

12345678910>>...12