245 	size_t nr_maps;  member
784 	if (obj->nr_maps < obj->maps_cap)  in bpf_object__add_map()
785 		return &obj->maps[obj->nr_maps++];  in bpf_object__add_map()
798 	memset(obj->maps + obj->nr_maps, 0,  in bpf_object__add_map()
799 	       (obj->maps_cap - obj->nr_maps) * sizeof(*obj->maps));  in bpf_object__add_map()
804 	for (i = obj->nr_maps; i < obj->maps_cap; i++) {  in bpf_object__add_map()
809 	return &obj->maps[obj->nr_maps++];  in bpf_object__add_map()
895 	int i, map_def_sz = 0, nr_maps = 0, nr_syms;  in bpf_object__init_user_maps()  local
929 		nr_maps++;  in bpf_object__init_user_maps()
933 		 obj->path, nr_maps, data->d_size);  in bpf_object__init_user_maps()
935 	map_def_sz = data->d_size / nr_maps;  in bpf_object__init_user_maps()
936 	if (!data->d_size || (data->d_size % nr_maps) != 0) {  in bpf_object__init_user_maps()
939 			   obj->path, nr_maps, data->d_size);  in bpf_object__init_user_maps()
1337 	if (obj->nr_maps) {  in bpf_object__init_maps()
1338 		qsort(obj->maps, obj->nr_maps, sizeof(obj->maps[0]),  in bpf_object__init_maps()
1731 	size_t nr_maps = obj->nr_maps;  in bpf_program__collect_reloc()  local
1823 			for (map_idx = 0; map_idx < nr_maps; map_idx++) {  in bpf_program__collect_reloc()
1838 			if (map_idx >= nr_maps) {  in bpf_program__collect_reloc()
1840 					   (int)map_idx, (int)nr_maps - 1);  in bpf_program__collect_reloc()
2140 	for (i = 0; i < obj->nr_maps; i++) {  in bpf_object__create_maps()
3686 	for (i = 0; i < obj->nr_maps; i++)  in bpf_object__unload()
4194 	for (i = 0; i < obj->nr_maps; i++) {  in bpf_object__close()
4206 	obj->nr_maps = 0;  in bpf_object__close()
4727 	e = obj->maps + obj->nr_maps;  in __bpf_map__iter()
4736 	if (idx >= obj->nr_maps || idx < 0)  in __bpf_map__iter()
4754 		if (!obj->nr_maps)  in bpf_map__prev()
4756 		return obj->maps + obj->nr_maps - 1;  in bpf_map__prev()