1939 	u32 i, size, nelems = 1, id = 0;  in __btf_resolve_size()  local
1971 			if (nelems && array->nelems > U32_MAX / nelems)  in __btf_resolve_size()
1973 			nelems *= array->nelems;  in __btf_resolve_size()
1986 	if (nelems && size > U32_MAX / nelems)  in __btf_resolve_size()
1989 	*type_size = nelems * size;  in __btf_resolve_size()
1991 		*total_nelems = nelems;  in __btf_resolve_size()
3001 	if (array->nelems && elem_size > U32_MAX / array->nelems) {  in btf_array_resolve()
3007 	env_stack_pop_resolved(env, elem_type_id, elem_size * array->nelems);  in btf_array_resolve()
3018 			 array->type, array->index_type, array->nelems);  in btf_array_log()
3057 	for (i = 0; i < array->nelems; i++) {  in __btf_array_show()
3575 				  u32 off, u32 nelems,  in btf_find_nested_struct()  argument
3596 	if (nelems > 1) {  in btf_find_nested_struct()
3597 		err = btf_repeat_fields(info, info_cnt, ret, nelems - 1, t->size);  in btf_find_nested_struct()
3599 			ret *= nelems;  in btf_find_nested_struct()
3619 	u32 i, nelems = 1;  in btf_find_field_one()  local
3626 		nelems *= array->nelems;  in btf_find_field_one()
3631 	if (nelems == 0)  in btf_find_field_one()
3639 		if (expected_size && expected_size != sz * nelems)  in btf_find_field_one()
3641 		ret = btf_find_nested_struct(btf, var_type, off, nelems, field_mask,  in btf_find_field_one()
3651 	if (expected_size && expected_size != sz * nelems)  in btf_find_field_one()
3694 	if (nelems > 1) {  in btf_find_field_one()
3695 		ret = btf_repeat_fields(info, info_cnt, 1, nelems - 1, sz);  in btf_find_field_one()
3699 	return nelems;  in btf_find_field_one()
5272 			(array->nelems * elem_size ==  in btf_resolve_valid()
6835 		if (array_elem->nelems != 0)  in btf_struct_walk()