bpf/progs/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);
191 	__uint(max_entries, MAX_ENTRIES);
208 	__uint(max_entries, MAX_ENTRIES);
225 	__uint(max_entries, MAX_ENTRIES);
246 	__uint(max_entries, MAX_ENTRIES);
265 	__uint(max_entries, MAX_ENTRIES);
282 	__uint(max_entries, MAX_ENTRIES);
299 	__uint(max_entries, MAX_ENTRIES);
326 	__uint(max_entries, MAX_ENTRIES);
346 	__uint(max_entries, INNER_MAX_ENTRIES);
353 	__uint(max_entries, MAX_ENTRIES);
358 		__uint(max_entries, INNER_MAX_ENTRIES);
376 	VERIFY(inner_map->map.max_entries == INNER_MAX_ENTRIES);  in check_array_of_maps()
383 	__uint(max_entries, MAX_ENTRIES);
403 	VERIFY(inner_map->map.max_entries == INNER_MAX_ENTRIES);  in check_hash_of_maps()
414 	__uint(max_entries, MAX_ENTRIES);
435 	__uint(max_entries, MAX_ENTRIES);
456 	__uint(max_entries, MAX_ENTRIES);
477 	__uint(max_entries, MAX_ENTRIES);
498 	__uint(max_entries, MAX_ENTRIES);
541 	__uint(max_entries, MAX_ENTRIES);
581 	__uint(max_entries, MAX_ENTRIES);
597 	__uint(max_entries, MAX_ENTRIES);
635 	__uint(max_entries, MAX_ENTRIES);