Searched refs:max_entries (Results 76 - 100 of 417) sorted by last modified time

1234567891011>>

/linux-master/tools/bpf/bpftool/
H A Dprog.c270 map_info->max_entries != 1 ||
H A Dmap.c484 jsonw_uint_field(json_wtr, "max_entries", info->max_entries);
570 printf("\tkey %uB value %uB max_entries %u",
571 info->key_size, info->value_size, info->max_entries);
1243 __u32 key_size = 0, value_size = 0, max_entries = 0; local
1282 if (parse_u32_arg(&argc, &argv, &max_entries,
1335 fd = bpf_map_create(map_type, map_name, key_size, value_size, max_entries, &attr);
/linux-master/net/core/
H A Dfilter.c4901 if (unlikely(idx >= array->map.max_entries))
/linux-master/kernel/bpf/
H A Dstackmap.c51 smap->elems = bpf_map_area_alloc(elem_size * smap->map.max_entries,
61 smap->map.max_entries);
81 if (attr->max_entries == 0 || attr->key_size != 4 ||
97 if (attr->max_entries > 1UL << 31)
100 n_buckets = roundup_pow_of_two(attr->max_entries);
671 u64 enties = map->max_entries;
H A Dlpm_trie.c328 if (trie->n_entries == trie->map.max_entries) {
551 if (attr->max_entries == 0 ||
H A Dhashtab.c226 u32 num_entries = htab->map.max_entries;
245 u32 num_entries = htab->map.max_entries;
279 for (i = 0; i < htab->map.max_entries; i++) {
320 u32 num_entries = htab->map.max_entries;
450 if (attr->max_entries == 0 || attr->key_size == 0 ||
495 htab->map.max_entries = roundup(attr->max_entries,
497 if (htab->map.max_entries < attr->max_entries)
498 htab->map.max_entries
[all...]
H A Ddevmap.c118 if (attr->max_entries == 0 || attr->key_size != 4 ||
136 if (dtab->map.max_entries > 1UL << 31)
139 dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries);
148 dtab->netdev_map = bpf_map_area_alloc((u64) dtab->map.max_entries *
224 for (i = 0; i < dtab->map.max_entries; i++) {
249 if (index >= dtab->map.max_entries) {
254 if (index == dtab->map.max_entries - 1)
441 if (key >= map->max_entries)
619 for (i = 0; i < map->max_entries; i++) {
737 for (i = 0; i < map->max_entries;
[all...]
H A Dcore.c2014 if (unlikely(index >= array->map.max_entries))
H A Dbpf_struct_ops.c887 if (attr->key_size != sizeof(unsigned int) || attr->max_entries != 1 ||
H A Dbpf_local_storage.c675 attr->max_entries ||
H A Darraymap.c26 for (i = 0; i < array->map.max_entries; i++) {
37 for (i = 0; i < array->map.max_entries; i++) {
58 if (attr->max_entries == 0 || attr->key_size != 4 ||
84 u32 elem_size, index_mask, max_entries; local
91 max_entries = attr->max_entries;
93 /* On 32 bit archs roundup_pow_of_two() with max_entries that has
97 mask64 = fls_long(max_entries - 1);
106 max_entries = index_mask + 1;
108 if (max_entries < att
[all...]
/linux-master/io_uring/
H A Dio_uring.h86 struct llist_node *io_handle_tw_list(struct llist_node *node, unsigned int *count, unsigned int max_entries);
87 struct llist_node *tctx_task_work_run(struct io_uring_task *tctx, unsigned int max_entries, unsigned int *count);
/linux-master/include/uapi/linux/
H A Dbpf.h211 * *max_entries* limit specified at map creation time.
733 * the map reached the *max_entries* limit specified at map
1459 __u32 max_entries; /* max number of entries in a map */ member in struct:bpf_attr::__anon2589
6583 __u32 max_entries; member in struct:bpf_map_info
/linux-master/drivers/net/wireless/ath/ath12k/
H A Ddp.c224 int max_entries = ath12k_hal_srng_get_max_entries(ab, type); local
227 if (max_entries < 0 || entry_sz < 0)
230 if (num_entries > max_entries)
231 num_entries = max_entries;
/linux-master/drivers/net/wireless/ath/ath11k/
H A Ddp.c230 int max_entries = ath11k_hal_srng_get_max_entries(ab, type); local
234 if (max_entries < 0 || entry_sz < 0)
237 if (num_entries > max_entries)
238 num_entries = max_entries;
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dparams.c205 u32 max_entries = mlx5e_mpwrq_max_num_entries(mdev, umr_mode); local
207 return ilog2(max_entries / mtts_per_wqe);
/linux-master/drivers/net/ethernet/broadcom/bnxt/
H A Dbnxt.h1795 u32 max_entries; member in struct:bnxt_ctx_mem_type
/linux-master/arch/x86/net/
H A Dbpf_jit_comp32.c1289 * if (index >= array->map.max_entries)
1311 * if (index >= array->map.max_entries)
1321 offsetof(struct bpf_array, map.max_entries));
/linux-master/arch/riscv/net/
H A Dbpf_jit_comp32.c788 /* max_entries = array->map.max_entries; */
789 off = offsetof(struct bpf_array, map.max_entries);
795 * if (index >= max_entries)
/linux-master/tools/testing/selftests/bpf/progs/
H A Dtimer.c18 __uint(max_entries, 1000);
26 __uint(max_entries, 1000);
37 __uint(max_entries, 2);
44 __uint(max_entries, 4);
51 __uint(max_entries, 1);
101 * should be larger than ~ lru->max_entries * 2
H A Dverifier_value_illegal_alu.c17 __uint(max_entries, 1);
/linux-master/tools/lib/perf/
H A Dcpumap.c162 int max_entries = 0; local
178 if (new_max >= max_entries) {
179 max_entries = new_max + MAX_NR_CPUS / 2;
180 tmp = realloc(tmp_cpus, max_entries * sizeof(struct perf_cpu));
189 if (nr_cpus == max_entries) {
190 max_entries += MAX_NR_CPUS;
191 tmp = realloc(tmp_cpus, max_entries * sizeof(struct perf_cpu));
220 int max_entries = 0; local
263 if (nr_cpus == max_entries) {
264 max_entries
[all...]
/linux-master/drivers/scsi/mpi3mr/
H A Dmpi3mr_fw.c43 u16 pi, ci, max_entries; local
48 max_entries = op_req_q->num_requests;
50 if ((ci == (pi + 1)) || ((!ci) && (pi == (max_entries - 1))))
1643 u16 areq_pi = 0, areq_ci = 0, max_entries = 0; local
1656 max_entries = mrioc->num_admin_req;
1658 (areq_pi == (max_entries - 1)))) {
1673 if (++areq_pi == max_entries)
2305 u16 pi = 0, max_entries, reply_qidx = 0, midx; local
2320 max_entries = op_req_q->num_requests;
2346 if (++pi == max_entries)
[all...]
/linux-master/arch/loongarch/net/
H A Dbpf_jit.c230 * if (index >= array->map.max_entries)
233 off = offsetof(struct bpf_array, map.max_entries);
/linux-master/kernel/trace/
H A Dtrace_events_hist.c5321 unsigned int max_entries)
5326 for (i = 0; i < max_entries; i++) {
5319 hist_trigger_stacktrace_print(struct seq_file *m, unsigned long *stacktrace_entries, unsigned int max_entries) argument

Completed in 390 milliseconds

1234567891011>>