/linux/tools/testing/selftests/bpf/map_tests/ |
H A D | htab_map_batch_ops.c | 14 static void map_batch_update(int map_fd, __u32 max_entries, int *keys, in map_batch_update() argument 28 for (i = 0; i < max_entries; i++) { in map_batch_update() 37 err = bpf_map_update_batch(map_fd, keys, values, &max_entries, &opts); in map_batch_update() 41 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument 51 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify() 52 for (i = 0; i < max_entries; i++) { in map_batch_verify() 71 for (i = 0; i < max_entries; i++) { in map_batch_verify() 82 const __u32 max_entries = 10; in __test_map_lookup_and_delete_batch() local 83 value pcpu_values[max_entries]; in __test_map_lookup_and_delete_batch() 93 "hash_map", sizeof(int), sizeof(int), max_entries, NULL); in __test_map_lookup_and_delete_batch() [all …]
|
H A D | lpm_trie_map_batch_ops.c | 22 static void map_batch_update(int map_fd, __u32 max_entries, in map_batch_update() argument 33 for (i = 0; i < max_entries; i++) { in map_batch_update() 40 err = bpf_map_update_batch(map_fd, keys, values, &max_entries, &opts); in map_batch_update() 44 static void map_batch_verify(int *visited, __u32 max_entries, in map_batch_verify() argument 51 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify() 52 for (i = 0; i < max_entries; i++) { in map_batch_verify() 60 for (i = 0; i < max_entries; i++) { in map_batch_verify() 72 const __u32 max_entries = 10; in test_lpm_trie_map_batch_ops() local 82 max_entries, &create_opts); in test_lpm_trie_map_batch_ops() 86 keys = malloc(max_entries * sizeof(struct test_lpm_key)); in test_lpm_trie_map_batch_ops() [all …]
|
H A D | array_map_batch_ops.c | 15 static void map_batch_update(int map_fd, __u32 max_entries, int *keys, in map_batch_update() argument 25 for (i = 0; i < max_entries; i++) { in map_batch_update() 36 err = bpf_map_update_batch(map_fd, keys, values, &max_entries, &opts); in map_batch_update() 40 static void map_batch_verify(int *visited, __u32 max_entries, int *keys, in map_batch_verify() argument 46 memset(visited, 0, max_entries * sizeof(*visited)); in map_batch_verify() 47 for (i = 0; i < max_entries; i++) { in map_batch_verify() 64 for (i = 0; i < max_entries; i++) { in map_batch_verify() 74 const __u32 max_entries = 10; in __test_map_lookup_and_update_batch() local 84 "array_map", sizeof(int), sizeof(__s64), max_entries, NULL); in __test_map_lookup_and_update_batch() 92 keys = calloc(max_entries, sizeof(*keys)); in __test_map_lookup_and_update_batch() [all …]
|
H A D | map_in_map_batch_ops.c | 127 int err, max_entries = OUTER_MAP_ENTRIES; in fetch_and_validate() local 131 fetched_keys = calloc(max_entries, value_size); in fetch_and_validate() 132 fetched_values = calloc(max_entries, value_size); in fetch_and_validate() 138 step_size <= max_entries; in fetch_and_validate() 171 CHECK((total_fetched != max_entries), in fetch_and_validate() 174 total_fetched, max_entries, errno, strerror(errno)); in fetch_and_validate() 190 __u32 max_entries = OUTER_MAP_ENTRIES; in _map_in_map_batch_ops() local 197 outer_map_keys = calloc(max_entries, value_size); in _map_in_map_batch_ops() 198 inner_map_fds = calloc(max_entries, value_size); in _map_in_map_batch_ops() 207 for (map_index = 0; map_index < max_entries; map_index++) in _map_in_map_batch_ops() [all …]
|
/linux/tools/testing/selftests/bpf/progs/ |
H A D | test_btf_map_in_map.c | 8 __uint(max_entries, 1); 16 __uint(max_entries, 2); 23 __uint(max_entries, 3); 31 __uint(max_entries, 1); 47 __uint(max_entries, 3); 56 __uint(max_entries, 5); 63 __uint(max_entries, 3); 69 __uint(max_entries, 1); 83 __uint(max_entries, 5); 99 __uint(max_entries, 1); [all …]
|
H A D | map_ptr_kern.c | 34 __u32 max_entries; member 39 __u32 value_size, __u32 max_entries) in check_bpf_map_fields() argument 44 VERIFY(map->max_entries == max_entries); in check_bpf_map_fields() 56 VERIFY(indirect->max_entries == direct->max_entries); in check_bpf_map_ptr() 63 __u32 key_size, __u32 value_size, __u32 max_entries) in check() argument 67 max_entries)); in check() 101 __uint(max_entries, MAX_ENTRIES); 142 __uint(max_entries, MAX_ENTRIES); 157 for (i = 0; i < array->map.max_entries && i < LOOP_BOUND; ++i) { in check_array() 174 __uint(max_entries, MAX_ENTRIES); [all …]
|
H A D | lsm.c | 16 __uint(max_entries, 1); 23 __uint(max_entries, 1); 30 __uint(max_entries, 1); 37 __uint(max_entries, 1); 44 __uint(max_entries, 1); 51 __uint(max_entries, 1); 58 __uint(max_entries, 1); 65 __uint(max_entries, 1); 75 __uint(max_entries, 1);
|
H A D | test_unpriv_bpf_disabled.c | 17 __uint(max_entries, 1); 24 __uint(max_entries, 1); 31 __uint(max_entries, 1); 38 __uint(max_entries, 1); 51 __uint(max_entries, 1 << 12); 56 __uint(max_entries, 1);
|
H A D | verifier_map_ptr_mixing.c | 17 __uint(max_entries, 1); 24 __uint(max_entries, 1); 31 __uint(max_entries, 1); 36 __uint(max_entries, 1); 49 __uint(max_entries, 4); 62 __uint(max_entries, 8);
|
H A D | syscall.c | 22 int max_entries; member 41 __uint(max_entries, 1); 48 __uint(max_entries, 1); 55 __uint(max_entries, 1); 132 map_create_attr.max_entries = ctx->max_entries; in load_prog() 182 attr->max_entries = 1; in update_outer_map()
|
H A D | test_sockmap_listen.c | 12 __uint(max_entries, 2); 19 __uint(max_entries, 2); 26 __uint(max_entries, 2); 33 __uint(max_entries, 2); 40 __uint(max_entries, 1);
|
H A D | sockmap_verdict_prog.c | 8 __uint(max_entries, 20); 15 __uint(max_entries, 20); 22 __uint(max_entries, 20); 29 __uint(max_entries, 20);
|
H A D | test_stacktrace_build_id.c | 13 __uint(max_entries, 1); 20 __uint(max_entries, 16384); 29 __uint(max_entries, 128); 37 __uint(max_entries, 128);
|
/linux/drivers/md/persistent-data/ |
H A D | dm-array.c | 26 __le32 max_entries; member 48 bh_le->csum = cpu_to_le32(dm_bm_checksum(&bh_le->max_entries, in array_block_prepare_for_write() 67 csum_disk = cpu_to_le32(dm_bm_checksum(&bh_le->max_entries, in array_block_check() 153 uint32_t max_entries, in alloc_ablock() argument 163 (*ab)->max_entries = cpu_to_le32(max_entries); in alloc_ablock() 181 BUG_ON(new_nr > le32_to_cpu(ab->max_entries)); in fill_ablock() 204 BUG_ON(new_nr > le32_to_cpu(ab->max_entries)); in trim_ablock() 350 uint32_t max_entries, in insert_new_ablock() argument 358 r = alloc_ablock(info, size_of_block, max_entries, &block, &ab); in insert_new_ablock() 371 unsigned int max_entries, const void *value, in insert_full_ablocks() argument [all …]
|
H A D | dm-btree-remove.c | 76 BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries)); in node_shift() 99 if (nr_left + shift > le32_to_cpu(left->header.max_entries)) { in node_copy() 111 if (shift > le32_to_cpu(right->header.max_entries)) { in node_copy() 152 return le32_to_cpu(n->header.max_entries) / 3; in merge_threshold() 197 uint32_t max_entries = le32_to_cpu(left->header.max_entries); in shift() local 198 uint32_t r_max_entries = le32_to_cpu(right->header.max_entries); in shift() 200 if (max_entries != r_max_entries) { in shift() 205 if (nr_left - count > max_entries) { in shift() 210 if (nr_right + count > max_entries) { in shift() 316 uint32_t max_entries = le32_to_cpu(left->header.max_entries); in delete_center_node() local [all …]
|
/linux/tools/testing/selftests/bpf/prog_tests/ |
H A D | for_each.c | 14 int i, err, max_entries; in test_hash_map() local 30 max_entries = bpf_map__max_entries(skel->maps.hashmap); in test_hash_map() 31 for (i = 0; i < max_entries; i++) { in test_hash_map() 61 ASSERT_EQ(skel->bss->hashmap_elems, max_entries, "hashmap_elems"); in test_hash_map() 80 __u32 key, num_cpus, max_entries; in test_array_map() local 97 max_entries = bpf_map__max_entries(skel->maps.arraymap); in test_array_map() 98 for (i = 0; i < max_entries; i++) { in test_array_map() 102 if (i != max_entries - 1) in test_array_map() 151 __u32 key, max_entries; in test_multi_maps() local 165 max_entries = bpf_map__max_entries(skel->maps.arraymap); in test_multi_maps() [all …]
|
H A D | btf.c | 72 __u32 max_entries; member 140 .max_entries = 4, 195 .max_entries = 4, 220 .max_entries = 4, 261 .max_entries = 4, 306 .max_entries = 1, 328 .max_entries = 1, 350 .max_entries = 1, 372 .max_entries = 1, 397 .max_entries = 1, [all …]
|
/linux/kernel/bpf/ |
H A D | arraymap.c | 26 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_free_percpu() 37 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_alloc_percpu() 58 if (attr->max_entries == 0 || attr->key_size != 4 || in array_map_alloc_check() 87 u32 elem_size, index_mask, max_entries; in array_map_alloc() local 94 max_entries = attr->max_entries; in array_map_alloc() 100 mask64 = fls_long(max_entries - 1); in array_map_alloc() 109 max_entries = index_mask + 1; in array_map_alloc() 111 if (max_entries < attr->max_entries) in array_map_alloc() 117 array_size += (u64) max_entries * sizeof(void *); in array_map_alloc() 124 array_size += PAGE_ALIGN((u64) max_entries * elem_size); in array_map_alloc() [all …]
|
/linux/samples/bpf/ |
H A D | map_perf_test.bpf.c | 21 __uint(max_entries, MAX_ENTRIES); 28 __uint(max_entries, 10000); 35 __uint(max_entries, 10000); 43 __uint(max_entries, MAX_ENTRIES); 50 __uint(max_entries, MAX_NR_CPUS); 62 __uint(max_entries, MAX_ENTRIES); 69 __uint(max_entries, MAX_ENTRIES); 77 __uint(max_entries, MAX_ENTRIES); 85 __uint(max_entries, 10000); 93 __uint(max_entries, MAX_ENTRIES); [all …]
|
H A D | test_map_in_map.bpf.c | 25 __uint(max_entries, MAX_NR_PORTS); 33 __uint(max_entries, 1); 41 __uint(max_entries, 1); 49 __uint(max_entries, 1); 55 __uint(max_entries, MAX_NR_PORTS); 63 __uint(max_entries, 1); 71 __uint(max_entries, 1);
|
/linux/net/xdp/ |
H A D | xskmap.c | 70 if (attr->max_entries == 0 || attr->key_size != 4 || in xsk_map_alloc() 76 size = struct_size(m, xsk_map, attr->max_entries); in xsk_map_alloc() 92 return struct_size(m, xsk_map, map->max_entries) + in xsk_map_mem_usage() 110 if (index >= m->map.max_entries) { in xsk_map_get_next_key() 115 if (index == m->map.max_entries - 1) in xsk_map_get_next_key() 127 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 5); in xsk_map_gen_lookup() 145 if (key >= map->max_entries) in __xsk_map_lookup_elem() 174 if (unlikely(i >= m->map.max_entries)) in xsk_map_update_elem() 229 if (k >= map->max_entries) in xsk_map_delete_elem() 262 return meta0->max_entries in xsk_map_meta_equal() [all...] |
/linux/fs/ext4/ |
H A D | migrate.c | 97 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; in update_ind_extent_range() local 104 for (i = 0; i < max_entries; i++) { in update_ind_extent_range() 126 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; in update_dind_extent_range() local 133 for (i = 0; i < max_entries; i++) { in update_dind_extent_range() 141 lb->curr_block += max_entries; in update_dind_extent_range() 156 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; in update_tind_extent_range() local 163 for (i = 0; i < max_entries; i++) { in update_tind_extent_range() 171 lb->curr_block += max_entries * max_entries; in update_tind_extent_range() 186 unsigned long max_entries = inode->i_sb->s_blocksize >> 2; in free_dind_blocks() local 194 for (i = 0; i < max_entries; i++) { in free_dind_blocks() [all …]
|
/linux/tools/lib/perf/ |
H A D | cpumap.c | 166 int max_entries = 0; in perf_cpu_map__read() 182 if (new_max >= max_entries) { in perf_cpu_map__read() 183 max_entries = new_max + MAX_NR_CPUS / 2; in perf_cpu_map__read() 184 tmp = realloc(tmp_cpus, max_entries * sizeof(struct perf_cpu)); in perf_cpu_map__read() 193 if (nr_cpus == max_entries) { in perf_cpu_map__read() 194 max_entries += MAX_NR_CPUS; in perf_cpu_map__read() 195 tmp = realloc(tmp_cpus, max_entries * sizeof(struct perf_cpu)); in perf_cpu_map__read() 224 int max_entries = 0; in perf_cpu_map__new() 267 if (nr_cpus == max_entries) { in perf_cpu_map__new() 268 max_entries in perf_cpu_map__new() 162 int max_entries = 0; perf_cpu_map__read() local 220 int max_entries = 0; perf_cpu_map__new() local [all...] |
/linux/tools/perf/util/bpf_skel/ |
H A D | lock_contention.bpf.c | 27 __uint(max_entries, MAX_ENTRIES); 35 __uint(max_entries, MAX_ENTRIES); 43 __uint(max_entries, 1); 51 __uint(max_entries, MAX_ENTRIES); 58 __uint(max_entries, MAX_ENTRIES); 65 __uint(max_entries, MAX_ENTRIES); 72 __uint(max_entries, 1); 79 __uint(max_entries, 1); 86 __uint(max_entries, 1); 93 __uint(max_entries, 1); [all …]
|
/linux/lib/ |
H A D | fw_table.c | 154 int proc_num, unsigned int max_entries) in acpi_parse_entries_array() argument 180 if (!max_entries || count < max_entries) in acpi_parse_entries_array() 203 if (max_entries && count > max_entries) { in acpi_parse_entries_array() 205 id, proc->id, count - max_entries, count); in acpi_parse_entries_array()
|