Lines Matching full:array
21 static void bpf_array_free_percpu(struct bpf_array *array) in bpf_array_free_percpu() argument
25 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_free_percpu()
26 free_percpu(array->pptrs[i]); in bpf_array_free_percpu()
31 static int bpf_array_alloc_percpu(struct bpf_array *array) in bpf_array_alloc_percpu() argument
36 for (i = 0; i < array->map.max_entries; i++) { in bpf_array_alloc_percpu()
37 ptr = __alloc_percpu_gfp(array->elem_size, 8, in bpf_array_alloc_percpu()
40 bpf_array_free_percpu(array); in bpf_array_alloc_percpu()
43 array->pptrs[i] = ptr; in bpf_array_alloc_percpu()
89 struct bpf_array *array; in array_map_alloc() local
105 /* round up array size to nearest power of 2, in array_map_alloc()
114 array_size = sizeof(*array); in array_map_alloc()
119 * ensure array->value is exactly page-aligned in array_map_alloc()
148 array = data + PAGE_ALIGN(sizeof(struct bpf_array)) in array_map_alloc()
151 array = bpf_map_area_alloc(array_size, numa_node); in array_map_alloc()
153 if (!array) { in array_map_alloc()
157 array->index_mask = index_mask; in array_map_alloc()
158 array->map.bypass_spec_v1 = bypass_spec_v1; in array_map_alloc()
161 bpf_map_init_from_attr(&array->map, attr); in array_map_alloc()
162 bpf_map_charge_move(&array->map.memory, &mem); in array_map_alloc()
163 array->elem_size = elem_size; in array_map_alloc()
165 if (percpu && bpf_array_alloc_percpu(array)) { in array_map_alloc()
166 bpf_map_charge_finish(&array->map.memory); in array_map_alloc()
167 bpf_map_area_free(array); in array_map_alloc()
171 return &array->map; in array_map_alloc()
177 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_lookup_elem() local
180 if (unlikely(index >= array->map.max_entries)) in array_map_lookup_elem()
183 return array->value + array->elem_size * (index & array->index_mask); in array_map_lookup_elem()
189 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_direct_value_addr() local
196 *imm = (unsigned long)array->value; in array_map_direct_value_addr()
203 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_direct_value_meta() local
204 u64 base = (unsigned long)array->value; in array_map_direct_value_meta()
205 u64 range = array->elem_size; in array_map_direct_value_meta()
219 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_gen_lookup() local
233 *insn++ = BPF_ALU32_IMM(BPF_AND, ret, array->index_mask); in array_map_gen_lookup()
252 struct bpf_array *array = container_of(map, struct bpf_array, map); in percpu_array_map_lookup_elem() local
255 if (unlikely(index >= array->map.max_entries)) in percpu_array_map_lookup_elem()
258 return this_cpu_ptr(array->pptrs[index & array->index_mask]); in percpu_array_map_lookup_elem()
263 struct bpf_array *array = container_of(map, struct bpf_array, map); in bpf_percpu_array_copy() local
269 if (unlikely(index >= array->map.max_entries)) in bpf_percpu_array_copy()
278 pptr = array->pptrs[index & array->index_mask]; in bpf_percpu_array_copy()
290 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_get_next_key() local
294 if (index >= array->map.max_entries) { in array_map_get_next_key()
299 if (index == array->map.max_entries - 1) in array_map_get_next_key()
310 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_update_elem() local
318 if (unlikely(index >= array->map.max_entries)) in array_map_update_elem()
330 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY) { in array_map_update_elem()
331 memcpy(this_cpu_ptr(array->pptrs[index & array->index_mask]), in array_map_update_elem()
334 val = array->value + in array_map_update_elem()
335 array->elem_size * (index & array->index_mask); in array_map_update_elem()
347 struct bpf_array *array = container_of(map, struct bpf_array, map); in bpf_percpu_array_update() local
357 if (unlikely(index >= array->map.max_entries)) in bpf_percpu_array_update()
373 pptr = array->pptrs[index & array->index_mask]; in bpf_percpu_array_update()
388 static void *array_map_vmalloc_addr(struct bpf_array *array) in array_map_vmalloc_addr() argument
390 return (void *)round_down((unsigned long)array, PAGE_SIZE); in array_map_vmalloc_addr()
396 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_free() local
398 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY) in array_map_free()
399 bpf_array_free_percpu(array); in array_map_free()
401 if (array->map.map_flags & BPF_F_MMAPABLE) in array_map_free()
402 bpf_map_area_free(array_map_vmalloc_addr(array)); in array_map_free()
404 bpf_map_area_free(array); in array_map_free()
431 struct bpf_array *array = container_of(map, struct bpf_array, map); in percpu_array_map_seq_show_elem() local
439 pptr = array->pptrs[index & array->index_mask]; in percpu_array_map_seq_show_elem()
474 /* bpf array can only take a u32 key. This check makes sure in array_map_check_btf()
485 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_map_mmap() local
486 pgoff_t pgoff = PAGE_ALIGN(sizeof(*array)) >> PAGE_SHIFT; in array_map_mmap()
492 PAGE_ALIGN((u64)array->map.max_entries * array->elem_size)) in array_map_mmap()
495 return remap_vmalloc_range(vma, array_map_vmalloc_addr(array), in array_map_mmap()
518 struct bpf_array *array; in bpf_array_map_seq_start() local
526 array = container_of(map, struct bpf_array, map); in bpf_array_map_seq_start()
527 index = info->index & array->index_mask; in bpf_array_map_seq_start()
529 return array->pptrs[index]; in bpf_array_map_seq_start()
530 return array->value + array->elem_size * index; in bpf_array_map_seq_start()
537 struct bpf_array *array; in bpf_array_map_seq_next() local
545 array = container_of(map, struct bpf_array, map); in bpf_array_map_seq_next()
546 index = info->index & array->index_mask; in bpf_array_map_seq_next()
548 return array->pptrs[index]; in bpf_array_map_seq_next()
549 return array->value + array->elem_size * index; in bpf_array_map_seq_next()
697 struct bpf_array *array = container_of(map, struct bpf_array, map); in fd_array_map_free() local
701 for (i = 0; i < array->map.max_entries; i++) in fd_array_map_free()
702 BUG_ON(array->ptrs[i] != NULL); in fd_array_map_free()
704 bpf_map_area_free(array); in fd_array_map_free()
736 struct bpf_array *array = container_of(map, struct bpf_array, map); in bpf_fd_array_map_update_elem() local
743 if (index >= array->map.max_entries) in bpf_fd_array_map_update_elem()
752 mutex_lock(&array->aux->poke_mutex); in bpf_fd_array_map_update_elem()
753 old_ptr = xchg(array->ptrs + index, new_ptr); in bpf_fd_array_map_update_elem()
755 mutex_unlock(&array->aux->poke_mutex); in bpf_fd_array_map_update_elem()
757 old_ptr = xchg(array->ptrs + index, new_ptr); in bpf_fd_array_map_update_elem()
767 struct bpf_array *array = container_of(map, struct bpf_array, map); in fd_array_map_delete_elem() local
771 if (index >= array->map.max_entries) in fd_array_map_delete_elem()
775 mutex_lock(&array->aux->poke_mutex); in fd_array_map_delete_elem()
776 old_ptr = xchg(array->ptrs + index, NULL); in fd_array_map_delete_elem()
778 mutex_unlock(&array->aux->poke_mutex); in fd_array_map_delete_elem()
780 old_ptr = xchg(array->ptrs + index, NULL); in fd_array_map_delete_elem()
794 struct bpf_array *array = container_of(map, struct bpf_array, map); in prog_fd_array_get_ptr() local
800 if (!bpf_prog_array_compatible(array, prog)) { in prog_fd_array_get_ptr()
821 struct bpf_array *array = container_of(map, struct bpf_array, map); in bpf_fd_array_map_clear() local
824 for (i = 0; i < array->map.max_entries; i++) in bpf_fd_array_map_clear()
1143 struct bpf_array *array = container_of(map, struct bpf_array, map); in perf_event_fd_array_release() local
1151 for (i = 0; i < array->map.max_entries; i++) { in perf_event_fd_array_release()
1152 ee = READ_ONCE(array->ptrs[i]); in perf_event_fd_array_release()
1262 struct bpf_array *array = container_of(map, struct bpf_array, map); in array_of_map_gen_lookup() local
1273 *insn++ = BPF_ALU32_IMM(BPF_AND, ret, array->index_mask); in array_of_map_gen_lookup()