Home
last modified time | relevance | path

Searched full:cost (Results 1 – 25 of 676) sorted by relevance

12345678910>>...28

/openbmc/linux/include/linux/
H A Denergy_model.h18 * @cost: The cost coefficient associated with this level, used during
25 unsigned long cost; member
34 * but a lower or equal power cost. Such inefficient states are ignored when
104 * which would reduce big value stored in the 'cost' field, then multiply by
106 * e.g. power ~1.3 Watt at max freq, so the 'cost' value > 1mln micro-Watts.
108 * could be 4096, then multiplication: 'cost' * 'sum_util' would overflow.
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))
[all …]
/openbmc/linux/net/netfilter/
H A Dxt_limit.c34 `credit_cap'. The `peak rate' becomes the cost of passing the
35 test, `cost'.
39 discarded. Every time the match passes, you lose `cost' credits;
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()
[all …]
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
443 `credit_cap'. The `peak rate' becomes the cost of passing the
444 test, `cost'.
448 discarded. Every time the match passes, you lose `cost' credits;
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()
[all …]
/openbmc/linux/kernel/power/
H A Denergy_model.c45 debugfs_create_ulong("cost", 0444, d, &ps->cost); in em_debug_create_ps()
157 /* Compute the cost of each performance state. */ in em_create_perf_table()
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()
165 dev_err(dev, "EM: invalid cost %lu %d\n", 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()
[all …]
/openbmc/linux/block/
H A Dblk-iocost.c3 * IO cost model based controller.
10 * observable cost metric. This is distinguished from CPU and memory where
22 * While there is no cost metric we can trivially observe, it isn't a
23 * complete mystery. For example, on a rotational device, seek cost
30 * 1. IO Cost Model
32 * IO cost model estimates the cost of an IO given its basic parameters and
33 * history (e.g. the end sector of the last IO). The cost is measured in
34 * device time. If a given IO is estimated to cost 10ms, the device should
37 * Currently, there's only one builtin cost model - linear. Each IO is
38 * classified as sequential or random and given a base cost accordingly.
[all …]
H A DKconfig151 bool "Enable support for cost model based cgroup IO controller"
155 Enabling this option enables the .weight interface for cost
175 is mostly useful for kernel developers, but it doesn't incur any cost
/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.
8 Cost=85
/openbmc/linux/lib/zstd/compress/
H A Dzstd_compress_sequences.c67 * Returns the cost in bytes of encoding the normalized count header.
81 * Returns the cost in bits of encoding the distribution described by count
86 unsigned cost = 0; in ZSTD_entropyCost() local
95 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
97 return cost >> 8; in ZSTD_entropyCost()
101 * Returns the cost in bits of encoding the distribution in count using ctable.
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()
135 * Returns the cost in bits of encoding the distribution in count using the
[all …]
/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/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 DSMPPL5cost 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…
H A DSendmail11 (a) Redistributions are made at no charge beyond the reasonable cost of materials and delivery.
13 …e offer to provide a copy of the Source Code for up to three years at the cost of materials and de…
H A DSendmail-8.2311 (a) Redistributions are made at no charge beyond the reasonable cost of materials and delivery.
13 …e offer to provide a copy of the Source Code for up to three years at the cost of materials and de…
H A DiMatix21 You may freely and at no cost use the Product in any project, commercial, academic, military, or pr…
39 … of the Product is with you. Should the Product prove defective, the full cost of repair, servicin…
/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/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/translations/zh_CN/mm/
H A Dovercommit-accounting.rst58 | SHARED or READ-only - 0 cost (该文件是映射而不是交换)
63 | PRIVATE READ-only - 0 cost (但作用不大)
/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/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/u-boot/lib/bzip2/
H A Dbzlib_compress.c297 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local
394 Calculate the cost of this group as coded in sendMTFValues()
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/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/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/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.

12345678910>>...28