/linux-master/include/uapi/linux/netfilter_bridge/ |
H A D | ebt_limit.h | 22 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
/linux-master/include/uapi/linux/netfilter/ |
H A D | xt_limit.h | 21 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
/linux-master/net/netfilter/ |
H A D | xt_limit.c | 34 `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)) 83 if (new_credit >= r->cost) { 85 new_credit -= r->cost; 128 if (r->cost == 0) { 130 r->cost = user2credits(r->avg); 150 u_int32_t credit_cap, cost; member in struct:compat_xt_rateinfo 166 .cost [all...] |
H A D | nft_limit.c | 32 static inline bool nft_limit_eval(struct nft_limit_priv *priv, u64 cost) argument 44 delta = tokens - cost; 174 u64 cost; member in struct:nft_limit_priv_pkts 183 if (nft_limit_eval(&priv->limit, priv->cost)) 206 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); 231 priv_dst->cost = priv_src->cost; 253 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); local 255 if (nft_limit_eval(priv, cost)) 334 if (nft_limit_eval(&priv->limit, priv->cost)) 385 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); local [all...] |
H A D | xt_hashlimit.c | 103 u_int64_t cost; member in struct:dsthash_ent::__anon236::__anon237::__anon238 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); 601 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); 712 tmp = tmp * dh->rateinfo.cost; 733 u64 cost; local 760 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; 761 dh->rateinfo.current_rate += cost; [all...] |
/linux-master/net/bridge/netfilter/ |
H A D | ebt_limit.c | 46 if (info->credit >= info->cost) { 48 info->credit -= info->cost; 85 info->cost = user2credits(info->avg); 98 compat_uint_t credit, credit_cap, cost; member in struct:ebt_compat_limit_info
|
/linux-master/lib/zstd/compress/ |
H A D | zstd_compress_sequences.c | 67 * 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; local 95 cost += count[s] * kInverseProbabilityLog256[norm]; 97 return cost >> 8; 101 * Returns the cost in bits of encoding the distribution in count using ctable. 110 size_t cost = 0; local 129 cost += (size_t)count[s] * bitCost; 131 return cost >> kAccuracyLog; 135 * Returns the cost i 143 size_t cost = 0; local [all...] |
/linux-master/kernel/power/ |
H A D | energy_model.c | 64 DEFINE_EM_DBG_SHOW(cost, cost); 93 debugfs_create_file("cost", 0444, d, &em_dbg[i], 248 /* Compute the cost of each performance state. */ 250 unsigned long power_res, cost; local 253 ret = cb->get_cost(dev, table[i].frequency, &cost); 254 if (ret || !cost || cost > EM_MAX_POWER) { 255 dev_err(dev, "EM: invalid cost %lu %d\n", 256 cost, re [all...] |
/linux-master/include/linux/ |
H A D | energy_model.h | 20 * @cost: The cost coefficient associated with this level, used during 28 unsigned long cost; member in struct:em_perf_state 37 * but a lower or equal power cost. Such inefficient states are ignored when 140 * get_cost() - Provide the cost at the given performance state of 144 * @cost : The cost value for the performance state 147 * In case of CPUs, the cost is the one of a single CPU in the domain. 154 unsigned long *cost); 291 * as 'ps->cost' [all...] |
/linux-master/drivers/net/ethernet/microchip/sparx5/ |
H A D | sparx5_qos.h | 59 u8 cost[SPX5_PRIOS]; member in struct:sparx5_dwrr
|
H A D | sparx5_qos.c | 378 spx5_rmw(HSCH_DWRR_ENTRY_DWRR_COST_SET(dwrr->cost[i]), 564 dwrr.cost[SPX5_PRIOS - i - 1] =
|
/linux-master/block/ |
H A D | blk-iocost.c | 3 * 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 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 accordingl 712 cost_to_abs_cost(u64 cost, u32 hw_inuse) argument 717 iocg_commit_bio(struct ioc_gq *iocg, struct bio *bio, u64 abs_cost, u64 cost) argument 1466 u64 cost = abs_cost_to_cost(wait->abs_cost, ctx->hw_inuse); local 2468 u64 cost, new_inuse; local 2528 u64 cost = 0; local 2568 u64 cost; local 2593 u64 cost; local 2606 u64 abs_cost, cost, vtime; local 2741 u64 vtime, abs_cost, cost; local [all...] |
/linux-master/net/openvswitch/ |
H A D | meter.c | 602 u32 cost; local 642 * 'cost' is the number of bucket units in this packet. 644 cost = (meter->kbps) ? skb->len * 8 : 1000; 657 if (band->bucket >= cost) { 658 band->bucket -= cost;
|
/linux-master/mm/ |
H A D | swap.c | 287 unsigned long cost; local 290 * Reflect the relative cost of incurring IO and spending CPU 296 cost = nr_io * SWAP_CLUSTER_MAX + nr_rotated; 309 /* Record cost event */ 311 lruvec->file_cost += cost; 313 lruvec->anon_cost += cost;
|
/linux-master/fs/f2fs/ |
H A D | gc.c | 538 unsigned int cost; local 573 cost = UINT_MAX - (age + u); 576 if (cost < p->min_cost || 577 (cost == p->min_cost && age > p->oldest_age)) { 578 p->min_cost = cost; 606 unsigned int cost, iter; local 637 cost = UINT_MAX - vblocks; 639 if (cost < p->min_cost || 640 (cost == p->min_cost && age > p->oldest_age)) { 641 p->min_cost = cost; 816 unsigned long cost, *dirty_bitmap; local [all...] |
/linux-master/kernel/bpf/ |
H A D | stackmap.c | 74 u64 cost, n_buckets; local 102 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); 103 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr));
|
/linux-master/arch/sparc/lib/ |
H A D | M7memset.S | 72 * the BIS store must be balanced against the cost of the membar operation. 183 blu,pn %xcc, .short_set ! to justify cost of membar 253 ! to pay %asi + membar cost
|
/linux-master/drivers/cpufreq/ |
H A D | cppc_cpufreq.c | 382 /* Increase the cost value by CPPC_EM_COST_STEP every performance state. */ 384 /* Add a cost gap correspnding to the energy of 4 CPUs. */ 406 * The cost is defined as: 407 * cost = power * max_frequency / frequency 475 * With an artificial EM, only the cost value is used. Still the power 485 unsigned long *cost) 503 *cost = compute_cost(cpu_dev->id, step); 484 cppc_get_cpu_cost(struct device *cpu_dev, unsigned long KHz, unsigned long *cost) argument
|
/linux-master/tools/perf/util/ |
H A D | hist.c | 835 u64 cost; local 844 cost = sample->weight; 845 if (!cost) 846 cost = 1; 855 sample->period = cost;
|
/linux-master/include/trace/events/ |
H A D | f2fs.h | 793 __field(unsigned int, cost) 807 __entry->cost = p->min_cost; 815 "victim = %u, cost = %u, ofs_unit = %u, " 823 __entry->cost,
|
/linux-master/arch/m68k/fpsp040/ |
H A D | setox.S | 169 | raised, to simulate that exception cost to much than the
|
/linux-master/kernel/sched/ |
H A D | fair.c | 2230 * the cost of punishing another. 3401 * cost of scanning a potentially uninteresting VMA. 4498 * The lag estimation comes with a cost we don't want to pay all the 7365 * comparing the average scan cost (tracked in sd->avg_scan_cost) against the 7812 * energy cost is removed (by cpu_util()) and must be calculated 8580 * and double the fastpath cost. 11653 static inline bool update_newidle_cost(struct sched_domain *sd, u64 cost) argument 11655 if (cost > sd->max_newidle_lb_cost) { 11657 * Track max cost of a domain to make sure to not delay the 11660 sd->max_newidle_lb_cost = cost; [all...] |
/linux-master/arch/m68k/ifpsp060/src/ |
H A D | fplsp.S | 6829 # cost to much than the flag is worth in practical uses. #
|