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()
126 			array_size += (u64) max_entries * elem_size;  in array_map_alloc()
171 	if (unlikely(index >= array->map.max_entries))  in array_map_lookup_elem()
182 	if (map->max_entries != 1)  in array_map_direct_value_addr()
198 	if (map->max_entries != 1)  in array_map_direct_value_meta()
223 		*insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 4);  in array_map_gen_lookup()
226 		*insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 3);  in array_map_gen_lookup()
246 	if (unlikely(index >= array->map.max_entries))  in percpu_array_map_lookup_elem()
269 		*insn++ = BPF_JMP_IMM(BPF_JGE, BPF_REG_0, map->max_entries, 6);  in percpu_array_map_gen_lookup()
272 		*insn++ = BPF_JMP_IMM(BPF_JGE, BPF_REG_0, map->max_entries, 5);  in percpu_array_map_gen_lookup()
292 	if (unlikely(index >= array->map.max_entries))  in percpu_array_map_lookup_percpu_elem()
306 	if (unlikely(index >= array->map.max_entries))  in bpf_percpu_array_copy()
332 	if (index >= array->map.max_entries) {  in array_map_get_next_key()
337 	if (index == array->map.max_entries - 1)  in array_map_get_next_key()
356 	if (unlikely(index >= array->map.max_entries))  in array_map_update_elem()
397 	if (unlikely(index >= array->map.max_entries))  in bpf_percpu_array_update()
443 		for (i = 0; i < array->map.max_entries; i++) {  in array_map_free_timers_wq()
460 			for (i = 0; i < array->map.max_entries; i++) {  in array_map_free()
470 			for (i = 0; i < array->map.max_entries; i++)  in array_map_free()
538 		    map->max_entries != 1)  in array_map_check_btf()
569 	    PAGE_ALIGN((u64)array->map.max_entries * array->elem_size))  in array_map_mmap()
582 	       meta0->max_entries == meta1->max_entries;  in array_map_meta_equal()
598 	if (info->index >= map->max_entries)  in bpf_array_map_seq_start()
619 	if (info->index >= map->max_entries)  in bpf_array_map_seq_next()
745 	for (i = 0; i < map->max_entries; i++) {  in bpf_for_each_array_elem()
769 	u64 entries = map->max_entries;  in array_map_mem_usage()
851 	for (i = 0; i < array->map.max_entries; i++)  in fd_array_map_free()
893 	if (index >= array->map.max_entries)  in bpf_fd_array_map_update_elem()
921 	if (index >= array->map.max_entries)  in __fd_array_map_delete_elem()
979 	for (i = 0; i < array->map.max_entries; i++)  in bpf_fd_array_map_clear()
1268 	for (i = 0; i < array->map.max_entries; i++) {  in perf_event_fd_array_release()
1387 		*insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 6);  in array_of_map_gen_lookup()
1390 		*insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 5);  in array_of_map_gen_lookup()