1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
// SPDX-License-Identifier: GPL-2.0-only
/* Benchmark bitmap, IDA and Maple Tree allocation of variable-sized regions. */
#include <linux/bitmap.h>
#include <linux/idr.h>
#include <linux/kernel.h>
#include <linux/maple_tree.h>
#include <linux/module.h>
#include <linux/printk.h>
#include <linux/random.h>
#include <linux/slab.h>
#include <linux/xarray.h>
#define REGION_MAX_SIZE 32
static unsigned long *bitmap __initdata;
/* One more request guarantees that even an all-ones trace reaches ENOSPC. */
static u8 *reg_sz __initdata;
static unsigned long *reg_idx __initdata;
static unsigned long capacities[64] = { 1000000, 100000, 10000, 1000, 100, 10 };
static unsigned int cap_cnt = 6;
module_param_array(capacities, ulong, &cap_cnt, 0400);
MODULE_PARM_DESC(capacities, "Region capacities to benchmark");
static unsigned long __init benchmark_bitmap(unsigned long cap)
{
unsigned long cnt, idx;
ktime_t alloc_time, free_time;
size_t sz;
bitmap_zero(bitmap, cap);
alloc_time = ktime_get();
for (cnt = 0; cnt <= cap; cnt++) {
idx = bitmap_find_next_zero_area(bitmap, cap, 0, reg_sz[cnt], 0);
if (idx >= cap)
break;
reg_idx[cnt] = idx;
bitmap_set(bitmap, idx, reg_sz[cnt]);
}
alloc_time = ktime_get() - alloc_time;
idx = cnt;
free_time = ktime_get();
while (idx--)
bitmap_clear(bitmap, reg_idx[idx], reg_sz[idx]);
free_time = ktime_get() - free_time;
WARN_ON(!bitmap_empty(bitmap, cap));
sz = BITS_TO_LONGS(cap) * sizeof(unsigned long);
pr_err("Bitmap %12llu %12llu %8lu %8lu %10zu\n",
alloc_time, free_time, cnt, cap, sz);
return cnt;
}
static size_t __init ida_size(unsigned long nr_ids)
{
unsigned long entries = DIV_ROUND_UP(nr_ids, IDA_BITMAP_BITS);
unsigned long bitmaps = nr_ids / IDA_BITMAP_BITS;
unsigned long nodes = 0;
if (nr_ids % IDA_BITMAP_BITS > BITS_PER_XA_VALUE)
bitmaps++;
while (entries > 1) {
entries = DIV_ROUND_UP(entries, XA_CHUNK_SIZE);
nodes += entries;
}
return sizeof(struct ida) +
bitmaps * sizeof(struct ida_bitmap) +
nodes * sizeof(struct xa_node);
}
static unsigned long __init benchmark_ida(unsigned long cap)
{
struct ida ida = IDA_INIT(ida);
unsigned long cnt, idx, off, nr_ids = 0;
ktime_t alloc_time, free_time;
int id = -ENOSPC;
alloc_time = ktime_get();
for (cnt = 0; cnt <= cap; cnt++) {
for (off = 0; off < reg_sz[cnt]; off++) {
id = ida_alloc_max(&ida, cap - 1, GFP_KERNEL);
if (id < 0)
break;
if (!off)
reg_idx[cnt] = id;
}
if (id < 0) {
while (off--)
ida_free(&ida, reg_idx[cnt] + off);
break;
}
WARN_ON(id != reg_idx[cnt] + reg_sz[cnt] - 1);
nr_ids += reg_sz[cnt];
}
alloc_time = ktime_get() - alloc_time;
WARN_ON(id != -ENOSPC);
idx = cnt;
free_time = ktime_get();
while (idx--) {
for (off = 0; off < reg_sz[idx]; off++)
ida_free(&ida, reg_idx[idx] + off);
}
free_time = ktime_get() - free_time;
WARN_ON(!ida_is_empty(&ida));
pr_err("IDA %12llu %12llu %8lu %8lu %10zu\n",
alloc_time, free_time, cnt, cap, ida_size(nr_ids));
ida_destroy(&ida);
return cnt;
}
static unsigned long __init benchmark_maple_tree(unsigned long cap)
{
struct maple_tree mt = MTREE_INIT(mt, MT_FLAGS_ALLOC_RANGE);
unsigned long cnt, idx;
ktime_t alloc_time, free_time;
size_t sz;
int ret;
alloc_time = ktime_get();
for (cnt = 0; cnt <= cap; cnt++) {
ret = mtree_alloc_range(&mt, &idx, xa_mk_value(cnt + 1),
reg_sz[cnt], 0, cap - 1, GFP_KERNEL);
if (ret)
break;
reg_idx[cnt] = idx;
}
alloc_time = ktime_get() - alloc_time;
WARN_ON(ret != -EBUSY);
idx = cnt;
free_time = ktime_get();
while (idx--)
mtree_erase(&mt, reg_idx[idx]);
free_time = ktime_get() - free_time;
WARN_ON(!mtree_empty(&mt));
/* Minimum storage assuming fully occupied allocation-range leaf nodes. */
sz = sizeof(mt) + DIV_ROUND_UP(cnt, MAPLE_ARANGE64_SLOTS) * sizeof(struct maple_node);
pr_err("Maple %12llu %12llu %8lu %8lu %10zu\n",
alloc_time, free_time, cnt, cap, sz);
mtree_destroy(&mt);
return cnt;
}
static int __init region_alloc_benchmark(void)
{
unsigned long bitmap_count, ida_count, maple_count;
unsigned long i, max_cap = 0;
int ret = -ENOMEM;
for (i = 0; i < cap_cnt; i++) {
if (capacities[i] == 0) {
pr_err("capacity must be nonzero\n");
return -EINVAL;
}
max_cap = max(max_cap, capacities[i]);
}
bitmap = kvmalloc_array(BITS_TO_LONGS(max_cap), sizeof(*bitmap), GFP_KERNEL);
reg_sz = kvmalloc_array(max_cap + 1, sizeof(*reg_sz), GFP_KERNEL);
reg_idx = kvmalloc_array(max_cap, sizeof(*reg_idx), GFP_KERNEL);
if (!bitmap || !reg_sz || !reg_idx)
goto out;
pr_err("\nStart testing bitmap vs IDA vs Maple Tree region allocation\n");
pr_err("memory: bitmap is exact; IDA and Maple Tree are lower bounds\n");
pr_err("Type alloc (ns) free (ns) regions capacity memory (B)\n");
for (i = 0; i < cap_cnt; i++) {
unsigned long idx, max_size;
max_size = min(REGION_MAX_SIZE, capacities[i] / 10) ? : 1;
for (idx = 0; idx <= capacities[i]; idx++)
reg_sz[idx] = get_random_u32_below(max_size) + 1;
bitmap_count = benchmark_bitmap(capacities[i]);
maple_count = benchmark_maple_tree(capacities[i]);
ida_count = benchmark_ida(capacities[i]);
WARN_ON(bitmap_count != ida_count);
WARN_ON(bitmap_count != maple_count);
}
/* Return an error so the benchmark can run repeatedly without rmmod. */
pr_info("Region allocation benchmark complete\n");
ret = -EAGAIN;
out:
kvfree(reg_idx);
kvfree(reg_sz);
kvfree(bitmap);
return ret;
}
module_init(region_alloc_benchmark);
MODULE_AUTHOR("Yury Norov <ynorov@nvidia.com>");
MODULE_DESCRIPTION("Benchmark bitmap, IDA and Maple Tree region allocation");
MODULE_LICENSE("GPL");
|
