28 	unsigned long cnt, idx;  in benchmark_bitmap()  local
34 	for (cnt = 0; cnt <= cap; cnt++) {  in benchmark_bitmap()
35 		idx = bitmap_find_next_zero_area(bitmap, cap, 0, reg_sz[cnt], 0);  in benchmark_bitmap()
39 		reg_idx[cnt] = idx;  in benchmark_bitmap()
40 		bitmap_set(bitmap, idx, reg_sz[cnt]);  in benchmark_bitmap()
44 	idx = cnt;  in benchmark_bitmap()
55 	       alloc_time, free_time, cnt, cap, sz);  in benchmark_bitmap()
57 	return cnt;  in benchmark_bitmap()
82 	unsigned long cnt, idx, off, nr_ids = 0;  in benchmark_ida()  local
87 	for (cnt = 0; cnt <= cap; cnt++) {  in benchmark_ida()
88 		for (off = 0; off < reg_sz[cnt]; off++) {  in benchmark_ida()
94 				reg_idx[cnt] = id;  in benchmark_ida()
98 				ida_free(&ida, reg_idx[cnt] + off);  in benchmark_ida()
101 		WARN_ON(id != reg_idx[cnt] + reg_sz[cnt] - 1);  in benchmark_ida()
102 		nr_ids += reg_sz[cnt];  in benchmark_ida()
108 	idx = cnt;  in benchmark_ida()
120 	       alloc_time, free_time, cnt, cap, ida_size(nr_ids));  in benchmark_ida()
123 	return cnt;  in benchmark_ida()
129 	unsigned long cnt, idx;  in benchmark_maple_tree()  local
135 	for (cnt = 0; cnt <= cap; cnt++) {  in benchmark_maple_tree()
136 		ret = mtree_alloc_range(&mt, &idx, xa_mk_value(cnt + 1),  in benchmark_maple_tree()
137 					reg_sz[cnt], 0, cap - 1, GFP_KERNEL);  in benchmark_maple_tree()
141 		reg_idx[cnt] = idx;  in benchmark_maple_tree()
147 	idx = cnt;  in benchmark_maple_tree()
157 	sz = sizeof(mt) + DIV_ROUND_UP(cnt, MAPLE_ARANGE64_SLOTS) * sizeof(struct maple_node);  in benchmark_maple_tree()
159 	       alloc_time, free_time, cnt, cap, sz);  in benchmark_maple_tree()
162 	return cnt;  in benchmark_maple_tree()