| /Linux-v4.19/net/netfilter/ |
| D | xt_limit.c | 79 if (priv->credit >= r->cost) { in limit_mt()
81 priv->credit -= r->cost; in limit_mt()
124 if (r->cost == 0) { in limit_mt_check()
126 r->cost = user2credits(r->avg); in limit_mt_check()
147 u_int32_t credit_cap, cost; member
163 .cost = cm->cost, in limit_mt_compat_from_user()
177 .cost = m->cost, in limit_mt_compat_to_user()
|
| D | nft_limit.c | 31 static inline bool nft_limit_eval(struct nft_limit *limit, u64 cost) in nft_limit_eval() argument
43 delta = tokens - cost; in nft_limit_eval()
129 u64 cost; member
138 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_pkts_eval()
161 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_pkts_init()
186 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_bytes_eval() local
188 if (nft_limit_eval(priv, cost)) in nft_limit_bytes_eval()
248 if (nft_limit_eval(&priv->limit, priv->cost)) in nft_limit_obj_pkts_eval()
263 priv->cost = div64_u64(priv->limit.nsecs, priv->limit.rate); in nft_limit_obj_pkts_init()
290 u64 cost = div64_u64(priv->nsecs * pkt->skb->len, priv->rate); in nft_limit_obj_bytes_eval() local
[all …]
|
| D | xt_hashlimit.c | 96 u_int64_t cost; member
607 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); in rateinfo_init()
612 dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); in rateinfo_init()
723 tmp = tmp * dh->rateinfo.cost; in hashlimit_byte_cost()
744 u64 cost; in hashlimit_mt_common() local
771 cost = (cfg->mode & XT_HASHLIMIT_BYTES) ? skb->len : 1; in hashlimit_mt_common()
772 dh->rateinfo.current_rate += cost; in hashlimit_mt_common()
785 cost = hashlimit_byte_cost(skb->len, dh); in hashlimit_mt_common()
787 cost = dh->rateinfo.cost; in hashlimit_mt_common()
789 if (dh->rateinfo.credit >= cost) { in hashlimit_mt_common()
[all …]
|
| /Linux-v4.19/kernel/bpf/ |
| D | reuseport_array.c | 154 u64 cost, array_size; in reuseport_array_alloc() local
163 cost = array_size; in reuseport_array_alloc()
164 if (cost >= U32_MAX - PAGE_SIZE) in reuseport_array_alloc()
166 cost = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in reuseport_array_alloc()
168 err = bpf_map_precharge_memlock(cost); in reuseport_array_alloc()
179 array->map.pages = cost; in reuseport_array_alloc()
|
| D | xskmap.c | 22 u64 cost; in xsk_map_alloc() local
38 cost = (u64)m->map.max_entries * sizeof(struct xdp_sock *); in xsk_map_alloc()
39 cost += sizeof(struct list_head) * num_possible_cpus(); in xsk_map_alloc()
40 if (cost >= U32_MAX - PAGE_SIZE) in xsk_map_alloc()
43 m->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in xsk_map_alloc()
|
| D | arraymap.c | 84 u64 cost, array_size, mask64; in array_map_alloc() local
117 cost = array_size; in array_map_alloc()
118 if (cost >= U32_MAX - PAGE_SIZE) in array_map_alloc()
121 cost += (u64)attr->max_entries * elem_size * num_possible_cpus(); in array_map_alloc()
122 if (cost >= U32_MAX - PAGE_SIZE) in array_map_alloc()
125 cost = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in array_map_alloc()
127 ret = bpf_map_precharge_memlock(cost); in array_map_alloc()
140 array->map.pages = cost; in array_map_alloc()
|
| D | stackmap.c | 92 u64 cost, n_buckets; in stack_map_alloc() local
118 cost = n_buckets * sizeof(struct stack_map_bucket *) + sizeof(*smap); in stack_map_alloc()
119 if (cost >= U32_MAX - PAGE_SIZE) in stack_map_alloc()
122 smap = bpf_map_area_alloc(cost, bpf_map_attr_numa_node(attr)); in stack_map_alloc()
127 cost += n_buckets * (value_size + sizeof(struct stack_map_bucket)); in stack_map_alloc()
128 if (cost >= U32_MAX - PAGE_SIZE) in stack_map_alloc()
134 smap->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in stack_map_alloc()
|
| D | cpumap.c | 83 u64 cost; in cpu_map_alloc() local
107 cost = (u64) cmap->map.max_entries * sizeof(struct bpf_cpu_map_entry *); in cpu_map_alloc()
108 cost += cpu_map_bitmap_size(attr) * num_possible_cpus(); in cpu_map_alloc()
109 if (cost >= U32_MAX - PAGE_SIZE) in cpu_map_alloc()
111 cmap->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in cpu_map_alloc()
|
| D | devmap.c | 92 u64 cost; in dev_map_alloc() local
109 cost = (u64) dtab->map.max_entries * sizeof(struct bpf_dtab_netdev *); in dev_map_alloc()
110 cost += dev_map_bitmap_size(attr) * num_possible_cpus(); in dev_map_alloc()
111 if (cost >= U32_MAX - PAGE_SIZE) in dev_map_alloc()
114 dtab->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in dev_map_alloc()
|
| D | lpm_trie.c | 506 u64 cost = sizeof(*trie), cost_per_node; in trie_alloc() local
534 cost += (u64) attr->max_entries * cost_per_node; in trie_alloc()
535 if (cost >= U32_MAX - PAGE_SIZE) { in trie_alloc()
540 trie->map.pages = round_up(cost, PAGE_SIZE) >> PAGE_SHIFT; in trie_alloc()
|
| /Linux-v4.19/net/bridge/netfilter/ |
| D | ebt_limit.c | 45 if (info->credit >= info->cost) { in ebt_limit_mt()
47 info->credit -= info->cost; in ebt_limit_mt()
84 info->cost = user2credits(info->avg); in ebt_limit_mt_check()
97 compat_uint_t credit, credit_cap, cost; member
|
| /Linux-v4.19/drivers/iio/health/ |
| D | Kconfig | 18 heart rate monitor and low-cost pulse oximeter.
31 heart rate monitor and low-cost pulse oximeter.
|
| /Linux-v4.19/include/uapi/linux/netfilter_bridge/ |
| D | ebt_limit.h | 22 __u32 credit_cap, cost; member
|
| /Linux-v4.19/include/uapi/linux/netfilter/ |
| D | xt_limit.h | 21 __u32 credit_cap, cost; member
|
| /Linux-v4.19/kernel/ |
| D | Kconfig.preempt | 27 at the cost of slightly lower throughput.
50 system is under load, at the cost of slightly lower throughput
|
| /Linux-v4.19/fs/cramfs/ |
| 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-v4.19/Documentation/devicetree/bindings/arm/omap/ |
| D | omap.txt | 112 - OMAP3 BeagleBoard : Low cost community board
121 - OMAP4 PandaBoard : Low cost community board
139 - AM335X Bone : Low cost community board
142 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
|
| /Linux-v4.19/net/openvswitch/ |
| D | meter.c | 454 u32 cost; in ovs_meter_execute() local
490 cost = (meter->kbps) ? skb->len * 8 : 1000; in ovs_meter_execute()
503 if (band->bucket >= cost) { in ovs_meter_execute()
504 band->bucket -= cost; in ovs_meter_execute()
|
| /Linux-v4.19/Documentation/vm/ |
| D | overcommit-accounting.rst | 59 | SHARED or READ-only - 0 cost (the file is the map not swap)
64 | PRIVATE READ-only - 0 cost (but of little use)
|
| /Linux-v4.19/Documentation/i2c/busses/ |
| D | i2c-diolan-u2c | 15 The Diolan U2C-12 I2C-USB Adapter provides a low cost solution to connect
|
| /Linux-v4.19/Documentation/block/ |
| D | deadline-iosched.txt | 44 generally improves throughput, at the cost of latency variation.
69 that comes at basically 0 cost we leave that on. We simply disable the
|
| /Linux-v4.19/Documentation/fb/ |
| D | deferred_io.txt | 16 - app continues writing to that page with no additional cost. this is
25 writes to occur at minimum cost. Then after some time when hopefully things
|
| /Linux-v4.19/Documentation/ABI/testing/ |
| D | sysfs-bus-iio-ina2xx-adc | 9 in-driver readout rate at the cost of an additional register read.
|
| /Linux-v4.19/Documentation/x86/ |
| D | tlb.txt | 6 destroyed and must be refilled later, at some cost.
8 time. This could potentially cost many more instructions, but
|
| /Linux-v4.19/Documentation/devicetree/bindings/nds32/ |
| D | andestech-boards | 21 processors to provide a cost-effective and high performance solution for
|
