45 	size_t n_entries;  member
218 		for (ni = 0; ni < s->n_entries; ni++) {  in dm_stats_cleanup()
247 	sector_t n_entries;  in dm_stats_create()  local
260 	n_entries = end - start;  in dm_stats_create()
261 	if (dm_sector_div64(n_entries, step))  in dm_stats_create()
262 		n_entries++;  in dm_stats_create()
264 	if (n_entries != (size_t)n_entries || !(size_t)(n_entries + 1))  in dm_stats_create()
267 	shared_alloc_size = sizeof(struct dm_stat) + (size_t)n_entries * sizeof(struct dm_stat_shared);  in dm_stats_create()
268 	if ((shared_alloc_size - sizeof(struct dm_stat)) / sizeof(struct dm_stat_shared) != n_entries)  in dm_stats_create()
271 	percpu_alloc_size = (size_t)n_entries * sizeof(struct dm_stat_percpu);  in dm_stats_create()
272 	if (percpu_alloc_size / sizeof(struct dm_stat_percpu) != n_entries)  in dm_stats_create()
275 	histogram_alloc_size = (n_histogram_entries + 1) * (size_t)n_entries * sizeof(unsigned long long);  in dm_stats_create()
276 …if (histogram_alloc_size / (n_histogram_entries + 1) != (size_t)n_entries * sizeof(unsigned long l…  in dm_stats_create()
288 	s->n_entries = n_entries;  in dm_stats_create()
315 	for (ni = 0; ni < n_entries; ni++) {  in dm_stats_create()
327 		for (ni = 0; ni < n_entries; ni++) {  in dm_stats_create()
347 			for (ni = 0; ni < n_entries; ni++) {  in dm_stats_create()
610 		if (WARN_ON_ONCE(entry >= s->n_entries)) {  in __dm_stat_bio()
771 	__dm_stat_clear(s, 0, s->n_entries, true);  in dm_stats_clear()
828 	    idx_end > s->n_entries)  in dm_stats_print()
829 		idx_end = s->n_entries;  in dm_stats_print()