1 // SPDX-License-Identifier: GPL-2.0 1 // SPDX-License-Identifier: GPL-2.0
2 2
3 /* 3 /*
4 * Test module for stress and analyze performa 4 * Test module for stress and analyze performance of vmalloc allocator.
5 * (C) 2018 Uladzislau Rezki (Sony) <urezki@gm 5 * (C) 2018 Uladzislau Rezki (Sony) <urezki@gmail.com>
6 */ 6 */
7 #include <linux/init.h> 7 #include <linux/init.h>
8 #include <linux/kernel.h> 8 #include <linux/kernel.h>
9 #include <linux/module.h> 9 #include <linux/module.h>
10 #include <linux/vmalloc.h> 10 #include <linux/vmalloc.h>
11 #include <linux/random.h> 11 #include <linux/random.h>
12 #include <linux/kthread.h> 12 #include <linux/kthread.h>
13 #include <linux/moduleparam.h> 13 #include <linux/moduleparam.h>
14 #include <linux/completion.h> 14 #include <linux/completion.h>
15 #include <linux/delay.h> 15 #include <linux/delay.h>
16 #include <linux/rwsem.h> 16 #include <linux/rwsem.h>
17 #include <linux/mm.h> 17 #include <linux/mm.h>
18 #include <linux/rcupdate.h> 18 #include <linux/rcupdate.h>
19 #include <linux/slab.h> 19 #include <linux/slab.h>
20 20
21 #define __param(type, name, init, msg) 21 #define __param(type, name, init, msg) \
22 static type name = init; 22 static type name = init; \
23 module_param(name, type, 0444); 23 module_param(name, type, 0444); \
24 MODULE_PARM_DESC(name, msg) 24 MODULE_PARM_DESC(name, msg) \
25 25
26 __param(int, nr_threads, 0, 26 __param(int, nr_threads, 0,
27 "Number of workers to perform tests(mi 27 "Number of workers to perform tests(min: 1 max: USHRT_MAX)");
28 28
29 __param(bool, sequential_test_order, false, 29 __param(bool, sequential_test_order, false,
30 "Use sequential stress tests order"); 30 "Use sequential stress tests order");
31 31
32 __param(int, test_repeat_count, 1, 32 __param(int, test_repeat_count, 1,
33 "Set test repeat counter"); 33 "Set test repeat counter");
34 34
35 __param(int, test_loop_count, 1000000, 35 __param(int, test_loop_count, 1000000,
36 "Set test loop counter"); 36 "Set test loop counter");
37 37
38 __param(int, nr_pages, 0, 38 __param(int, nr_pages, 0,
39 "Set number of pages for fix_size_allo 39 "Set number of pages for fix_size_alloc_test(default: 1)");
40 40
41 __param(bool, use_huge, false, <<
42 "Use vmalloc_huge in fix_size_alloc_te <<
43 <<
44 __param(int, run_test_mask, INT_MAX, 41 __param(int, run_test_mask, INT_MAX,
45 "Set tests specified in the mask.\n\n" 42 "Set tests specified in the mask.\n\n"
46 "\t\tid: 1, name: fix_size_ 43 "\t\tid: 1, name: fix_size_alloc_test\n"
47 "\t\tid: 2, name: full_fit_ 44 "\t\tid: 2, name: full_fit_alloc_test\n"
48 "\t\tid: 4, name: long_busy 45 "\t\tid: 4, name: long_busy_list_alloc_test\n"
49 "\t\tid: 8, name: random_si 46 "\t\tid: 8, name: random_size_alloc_test\n"
50 "\t\tid: 16, name: fix_align 47 "\t\tid: 16, name: fix_align_alloc_test\n"
51 "\t\tid: 32, name: random_si 48 "\t\tid: 32, name: random_size_align_alloc_test\n"
52 "\t\tid: 64, name: align_shi 49 "\t\tid: 64, name: align_shift_alloc_test\n"
53 "\t\tid: 128, name: pcpu_allo 50 "\t\tid: 128, name: pcpu_alloc_test\n"
54 "\t\tid: 256, name: kvfree_rc 51 "\t\tid: 256, name: kvfree_rcu_1_arg_vmalloc_test\n"
55 "\t\tid: 512, name: kvfree_rc 52 "\t\tid: 512, name: kvfree_rcu_2_arg_vmalloc_test\n"
56 "\t\tid: 1024, name: vm_map_ra <<
57 /* Add a new test case descrip 53 /* Add a new test case description here. */
58 ); 54 );
59 55
60 /* 56 /*
61 * Read write semaphore for synchronization of 57 * Read write semaphore for synchronization of setup
62 * phase that is done in main thread and worke 58 * phase that is done in main thread and workers.
63 */ 59 */
64 static DECLARE_RWSEM(prepare_for_test_rwsem); 60 static DECLARE_RWSEM(prepare_for_test_rwsem);
65 61
66 /* 62 /*
67 * Completion tracking for worker threads. 63 * Completion tracking for worker threads.
68 */ 64 */
69 static DECLARE_COMPLETION(test_all_done_comp); 65 static DECLARE_COMPLETION(test_all_done_comp);
70 static atomic_t test_n_undone = ATOMIC_INIT(0) 66 static atomic_t test_n_undone = ATOMIC_INIT(0);
71 67
72 static inline void 68 static inline void
73 test_report_one_done(void) 69 test_report_one_done(void)
74 { 70 {
75 if (atomic_dec_and_test(&test_n_undone 71 if (atomic_dec_and_test(&test_n_undone))
76 complete(&test_all_done_comp); 72 complete(&test_all_done_comp);
77 } 73 }
78 74
79 static int random_size_align_alloc_test(void) 75 static int random_size_align_alloc_test(void)
80 { 76 {
81 unsigned long size, align; 77 unsigned long size, align;
82 unsigned int rnd; 78 unsigned int rnd;
83 void *ptr; 79 void *ptr;
84 int i; 80 int i;
85 81
86 for (i = 0; i < test_loop_count; i++) 82 for (i = 0; i < test_loop_count; i++) {
87 rnd = get_random_u8(); 83 rnd = get_random_u8();
88 84
89 /* 85 /*
90 * Maximum 1024 pages, if PAGE 86 * Maximum 1024 pages, if PAGE_SIZE is 4096.
91 */ 87 */
92 align = 1 << (rnd % 23); 88 align = 1 << (rnd % 23);
93 89
94 /* 90 /*
95 * Maximum 10 pages. 91 * Maximum 10 pages.
96 */ 92 */
97 size = ((rnd % 10) + 1) * PAGE 93 size = ((rnd % 10) + 1) * PAGE_SIZE;
98 94
99 ptr = __vmalloc_node(size, ali 95 ptr = __vmalloc_node(size, align, GFP_KERNEL | __GFP_ZERO, 0,
100 __builtin_retu 96 __builtin_return_address(0));
101 if (!ptr) 97 if (!ptr)
102 return -1; 98 return -1;
103 99
104 vfree(ptr); 100 vfree(ptr);
105 } 101 }
106 102
107 return 0; 103 return 0;
108 } 104 }
109 105
110 /* 106 /*
111 * This test case is supposed to be failed. 107 * This test case is supposed to be failed.
112 */ 108 */
113 static int align_shift_alloc_test(void) 109 static int align_shift_alloc_test(void)
114 { 110 {
115 unsigned long align; 111 unsigned long align;
116 void *ptr; 112 void *ptr;
117 int i; 113 int i;
118 114
119 for (i = 0; i < BITS_PER_LONG; i++) { 115 for (i = 0; i < BITS_PER_LONG; i++) {
120 align = 1UL << i; !! 116 align = ((unsigned long) 1) << i;
121 117
122 ptr = __vmalloc_node(PAGE_SIZE 118 ptr = __vmalloc_node(PAGE_SIZE, align, GFP_KERNEL|__GFP_ZERO, 0,
123 __builtin_retu 119 __builtin_return_address(0));
124 if (!ptr) 120 if (!ptr)
125 return -1; 121 return -1;
126 122
127 vfree(ptr); 123 vfree(ptr);
128 } 124 }
129 125
130 return 0; 126 return 0;
131 } 127 }
132 128
133 static int fix_align_alloc_test(void) 129 static int fix_align_alloc_test(void)
134 { 130 {
135 void *ptr; 131 void *ptr;
136 int i; 132 int i;
137 133
138 for (i = 0; i < test_loop_count; i++) 134 for (i = 0; i < test_loop_count; i++) {
139 ptr = __vmalloc_node(5 * PAGE_ 135 ptr = __vmalloc_node(5 * PAGE_SIZE, THREAD_ALIGN << 1,
140 GFP_KERNEL | _ 136 GFP_KERNEL | __GFP_ZERO, 0,
141 __builtin_retu 137 __builtin_return_address(0));
142 if (!ptr) 138 if (!ptr)
143 return -1; 139 return -1;
144 140
145 vfree(ptr); 141 vfree(ptr);
146 } 142 }
147 143
148 return 0; 144 return 0;
149 } 145 }
150 146
151 static int random_size_alloc_test(void) 147 static int random_size_alloc_test(void)
152 { 148 {
153 unsigned int n; 149 unsigned int n;
154 void *p; 150 void *p;
155 int i; 151 int i;
156 152
157 for (i = 0; i < test_loop_count; i++) 153 for (i = 0; i < test_loop_count; i++) {
158 n = get_random_u32_inclusive(1 !! 154 n = prandom_u32_max(100) + 1;
159 p = vmalloc(n * PAGE_SIZE); 155 p = vmalloc(n * PAGE_SIZE);
160 156
161 if (!p) 157 if (!p)
162 return -1; 158 return -1;
163 159
164 *((__u8 *)p) = 1; 160 *((__u8 *)p) = 1;
165 vfree(p); 161 vfree(p);
166 } 162 }
167 163
168 return 0; 164 return 0;
169 } 165 }
170 166
171 static int long_busy_list_alloc_test(void) 167 static int long_busy_list_alloc_test(void)
172 { 168 {
173 void *ptr_1, *ptr_2; 169 void *ptr_1, *ptr_2;
174 void **ptr; 170 void **ptr;
175 int rv = -1; 171 int rv = -1;
176 int i; 172 int i;
177 173
178 ptr = vmalloc(sizeof(void *) * 15000); 174 ptr = vmalloc(sizeof(void *) * 15000);
179 if (!ptr) 175 if (!ptr)
180 return rv; 176 return rv;
181 177
182 for (i = 0; i < 15000; i++) 178 for (i = 0; i < 15000; i++)
183 ptr[i] = vmalloc(1 * PAGE_SIZE 179 ptr[i] = vmalloc(1 * PAGE_SIZE);
184 180
185 for (i = 0; i < test_loop_count; i++) 181 for (i = 0; i < test_loop_count; i++) {
186 ptr_1 = vmalloc(100 * PAGE_SIZ 182 ptr_1 = vmalloc(100 * PAGE_SIZE);
187 if (!ptr_1) 183 if (!ptr_1)
188 goto leave; 184 goto leave;
189 185
190 ptr_2 = vmalloc(1 * PAGE_SIZE) 186 ptr_2 = vmalloc(1 * PAGE_SIZE);
191 if (!ptr_2) { 187 if (!ptr_2) {
192 vfree(ptr_1); 188 vfree(ptr_1);
193 goto leave; 189 goto leave;
194 } 190 }
195 191
196 *((__u8 *)ptr_1) = 0; 192 *((__u8 *)ptr_1) = 0;
197 *((__u8 *)ptr_2) = 1; 193 *((__u8 *)ptr_2) = 1;
198 194
199 vfree(ptr_1); 195 vfree(ptr_1);
200 vfree(ptr_2); 196 vfree(ptr_2);
201 } 197 }
202 198
203 /* Success */ 199 /* Success */
204 rv = 0; 200 rv = 0;
205 201
206 leave: 202 leave:
207 for (i = 0; i < 15000; i++) 203 for (i = 0; i < 15000; i++)
208 vfree(ptr[i]); 204 vfree(ptr[i]);
209 205
210 vfree(ptr); 206 vfree(ptr);
211 return rv; 207 return rv;
212 } 208 }
213 209
214 static int full_fit_alloc_test(void) 210 static int full_fit_alloc_test(void)
215 { 211 {
216 void **ptr, **junk_ptr, *tmp; 212 void **ptr, **junk_ptr, *tmp;
217 int junk_length; 213 int junk_length;
218 int rv = -1; 214 int rv = -1;
219 int i; 215 int i;
220 216
221 junk_length = fls(num_online_cpus()); 217 junk_length = fls(num_online_cpus());
222 junk_length *= (32 * 1024 * 1024 / PAG 218 junk_length *= (32 * 1024 * 1024 / PAGE_SIZE);
223 219
224 ptr = vmalloc(sizeof(void *) * junk_le 220 ptr = vmalloc(sizeof(void *) * junk_length);
225 if (!ptr) 221 if (!ptr)
226 return rv; 222 return rv;
227 223
228 junk_ptr = vmalloc(sizeof(void *) * ju 224 junk_ptr = vmalloc(sizeof(void *) * junk_length);
229 if (!junk_ptr) { 225 if (!junk_ptr) {
230 vfree(ptr); 226 vfree(ptr);
231 return rv; 227 return rv;
232 } 228 }
233 229
234 for (i = 0; i < junk_length; i++) { 230 for (i = 0; i < junk_length; i++) {
235 ptr[i] = vmalloc(1 * PAGE_SIZE 231 ptr[i] = vmalloc(1 * PAGE_SIZE);
236 junk_ptr[i] = vmalloc(1 * PAGE 232 junk_ptr[i] = vmalloc(1 * PAGE_SIZE);
237 } 233 }
238 234
239 for (i = 0; i < junk_length; i++) 235 for (i = 0; i < junk_length; i++)
240 vfree(junk_ptr[i]); 236 vfree(junk_ptr[i]);
241 237
242 for (i = 0; i < test_loop_count; i++) 238 for (i = 0; i < test_loop_count; i++) {
243 tmp = vmalloc(1 * PAGE_SIZE); 239 tmp = vmalloc(1 * PAGE_SIZE);
244 240
245 if (!tmp) 241 if (!tmp)
246 goto error; 242 goto error;
247 243
248 *((__u8 *)tmp) = 1; 244 *((__u8 *)tmp) = 1;
249 vfree(tmp); 245 vfree(tmp);
250 } 246 }
251 247
252 /* Success */ 248 /* Success */
253 rv = 0; 249 rv = 0;
254 250
255 error: 251 error:
256 for (i = 0; i < junk_length; i++) 252 for (i = 0; i < junk_length; i++)
257 vfree(ptr[i]); 253 vfree(ptr[i]);
258 254
259 vfree(ptr); 255 vfree(ptr);
260 vfree(junk_ptr); 256 vfree(junk_ptr);
261 257
262 return rv; 258 return rv;
263 } 259 }
264 260
265 static int fix_size_alloc_test(void) 261 static int fix_size_alloc_test(void)
266 { 262 {
267 void *ptr; 263 void *ptr;
268 int i; 264 int i;
269 265
270 for (i = 0; i < test_loop_count; i++) 266 for (i = 0; i < test_loop_count; i++) {
271 if (use_huge) !! 267 ptr = vmalloc((nr_pages > 0 ? nr_pages:1) * PAGE_SIZE);
272 ptr = vmalloc_huge((nr <<
273 else <<
274 ptr = vmalloc((nr_page <<
275 268
276 if (!ptr) 269 if (!ptr)
277 return -1; 270 return -1;
278 271
279 *((__u8 *)ptr) = 0; 272 *((__u8 *)ptr) = 0;
280 273
281 vfree(ptr); 274 vfree(ptr);
282 } 275 }
283 276
284 return 0; 277 return 0;
285 } 278 }
286 279
287 static int 280 static int
288 pcpu_alloc_test(void) 281 pcpu_alloc_test(void)
289 { 282 {
290 int rv = 0; 283 int rv = 0;
291 #ifndef CONFIG_NEED_PER_CPU_KM 284 #ifndef CONFIG_NEED_PER_CPU_KM
292 void __percpu **pcpu; 285 void __percpu **pcpu;
293 size_t size, align; 286 size_t size, align;
294 int i; 287 int i;
295 288
296 pcpu = vmalloc(sizeof(void __percpu *) 289 pcpu = vmalloc(sizeof(void __percpu *) * 35000);
297 if (!pcpu) 290 if (!pcpu)
298 return -1; 291 return -1;
299 292
300 for (i = 0; i < 35000; i++) { 293 for (i = 0; i < 35000; i++) {
301 size = get_random_u32_inclusiv !! 294 size = prandom_u32_max(PAGE_SIZE / 4) + 1;
302 295
303 /* 296 /*
304 * Maximum PAGE_SIZE 297 * Maximum PAGE_SIZE
305 */ 298 */
306 align = 1 << get_random_u32_in !! 299 align = 1 << (prandom_u32_max(11) + 1);
307 300
308 pcpu[i] = __alloc_percpu(size, 301 pcpu[i] = __alloc_percpu(size, align);
309 if (!pcpu[i]) 302 if (!pcpu[i])
310 rv = -1; 303 rv = -1;
311 } 304 }
312 305
313 for (i = 0; i < 35000; i++) 306 for (i = 0; i < 35000; i++)
314 free_percpu(pcpu[i]); 307 free_percpu(pcpu[i]);
315 308
316 vfree(pcpu); 309 vfree(pcpu);
317 #endif 310 #endif
318 return rv; 311 return rv;
319 } 312 }
320 313
321 struct test_kvfree_rcu { 314 struct test_kvfree_rcu {
322 struct rcu_head rcu; 315 struct rcu_head rcu;
323 unsigned char array[20]; 316 unsigned char array[20];
324 }; 317 };
325 318
326 static int 319 static int
327 kvfree_rcu_1_arg_vmalloc_test(void) 320 kvfree_rcu_1_arg_vmalloc_test(void)
328 { 321 {
329 struct test_kvfree_rcu *p; 322 struct test_kvfree_rcu *p;
330 int i; 323 int i;
331 324
332 for (i = 0; i < test_loop_count; i++) 325 for (i = 0; i < test_loop_count; i++) {
333 p = vmalloc(1 * PAGE_SIZE); 326 p = vmalloc(1 * PAGE_SIZE);
334 if (!p) 327 if (!p)
335 return -1; 328 return -1;
336 329
337 p->array[0] = 'a'; 330 p->array[0] = 'a';
338 kvfree_rcu_mightsleep(p); !! 331 kvfree_rcu(p);
339 } 332 }
340 333
341 return 0; 334 return 0;
342 } 335 }
343 336
344 static int 337 static int
345 kvfree_rcu_2_arg_vmalloc_test(void) 338 kvfree_rcu_2_arg_vmalloc_test(void)
346 { 339 {
347 struct test_kvfree_rcu *p; 340 struct test_kvfree_rcu *p;
348 int i; 341 int i;
349 342
350 for (i = 0; i < test_loop_count; i++) 343 for (i = 0; i < test_loop_count; i++) {
351 p = vmalloc(1 * PAGE_SIZE); 344 p = vmalloc(1 * PAGE_SIZE);
352 if (!p) 345 if (!p)
353 return -1; 346 return -1;
354 347
355 p->array[0] = 'a'; 348 p->array[0] = 'a';
356 kvfree_rcu(p, rcu); 349 kvfree_rcu(p, rcu);
357 } 350 }
358 351
359 return 0; 352 return 0;
360 } 353 }
361 354
362 static int <<
363 vm_map_ram_test(void) <<
364 { <<
365 unsigned long nr_allocated; <<
366 unsigned int map_nr_pages; <<
367 unsigned char *v_ptr; <<
368 struct page **pages; <<
369 int i; <<
370 <<
371 map_nr_pages = nr_pages > 0 ? nr_pages <<
372 pages = kcalloc(map_nr_pages, sizeof(s <<
373 if (!pages) <<
374 return -1; <<
375 <<
376 nr_allocated = alloc_pages_bulk_array( <<
377 if (nr_allocated != map_nr_pages) <<
378 goto cleanup; <<
379 <<
380 /* Run the test loop. */ <<
381 for (i = 0; i < test_loop_count; i++) <<
382 v_ptr = vm_map_ram(pages, map_ <<
383 *v_ptr = 'a'; <<
384 vm_unmap_ram(v_ptr, map_nr_pag <<
385 } <<
386 <<
387 cleanup: <<
388 for (i = 0; i < nr_allocated; i++) <<
389 __free_page(pages[i]); <<
390 <<
391 kfree(pages); <<
392 <<
393 /* 0 indicates success. */ <<
394 return nr_allocated != map_nr_pages; <<
395 } <<
396 <<
397 struct test_case_desc { 355 struct test_case_desc {
398 const char *test_name; 356 const char *test_name;
399 int (*test_func)(void); 357 int (*test_func)(void);
400 }; 358 };
401 359
402 static struct test_case_desc test_case_array[] 360 static struct test_case_desc test_case_array[] = {
403 { "fix_size_alloc_test", fix_size_allo 361 { "fix_size_alloc_test", fix_size_alloc_test },
404 { "full_fit_alloc_test", full_fit_allo 362 { "full_fit_alloc_test", full_fit_alloc_test },
405 { "long_busy_list_alloc_test", long_bu 363 { "long_busy_list_alloc_test", long_busy_list_alloc_test },
406 { "random_size_alloc_test", random_siz 364 { "random_size_alloc_test", random_size_alloc_test },
407 { "fix_align_alloc_test", fix_align_al 365 { "fix_align_alloc_test", fix_align_alloc_test },
408 { "random_size_align_alloc_test", rand 366 { "random_size_align_alloc_test", random_size_align_alloc_test },
409 { "align_shift_alloc_test", align_shif 367 { "align_shift_alloc_test", align_shift_alloc_test },
410 { "pcpu_alloc_test", pcpu_alloc_test } 368 { "pcpu_alloc_test", pcpu_alloc_test },
411 { "kvfree_rcu_1_arg_vmalloc_test", kvf 369 { "kvfree_rcu_1_arg_vmalloc_test", kvfree_rcu_1_arg_vmalloc_test },
412 { "kvfree_rcu_2_arg_vmalloc_test", kvf 370 { "kvfree_rcu_2_arg_vmalloc_test", kvfree_rcu_2_arg_vmalloc_test },
413 { "vm_map_ram_test", vm_map_ram_test } <<
414 /* Add a new test case here. */ 371 /* Add a new test case here. */
415 }; 372 };
416 373
417 struct test_case_data { 374 struct test_case_data {
418 int test_failed; 375 int test_failed;
419 int test_passed; 376 int test_passed;
420 u64 time; 377 u64 time;
421 }; 378 };
422 379
423 static struct test_driver { 380 static struct test_driver {
424 struct task_struct *task; 381 struct task_struct *task;
425 struct test_case_data data[ARRAY_SIZE( 382 struct test_case_data data[ARRAY_SIZE(test_case_array)];
426 383
427 unsigned long start; 384 unsigned long start;
428 unsigned long stop; 385 unsigned long stop;
429 } *tdriver; 386 } *tdriver;
430 387
431 static void shuffle_array(int *arr, int n) 388 static void shuffle_array(int *arr, int n)
432 { 389 {
433 int i, j; 390 int i, j;
434 391
435 for (i = n - 1; i > 0; i--) { 392 for (i = n - 1; i > 0; i--) {
436 /* Cut the range. */ 393 /* Cut the range. */
437 j = get_random_u32_below(i); !! 394 j = prandom_u32_max(i);
438 395
439 /* Swap indexes. */ 396 /* Swap indexes. */
440 swap(arr[i], arr[j]); 397 swap(arr[i], arr[j]);
441 } 398 }
442 } 399 }
443 400
444 static int test_func(void *private) 401 static int test_func(void *private)
445 { 402 {
446 struct test_driver *t = private; 403 struct test_driver *t = private;
447 int random_array[ARRAY_SIZE(test_case_ 404 int random_array[ARRAY_SIZE(test_case_array)];
448 int index, i, j; 405 int index, i, j;
449 ktime_t kt; 406 ktime_t kt;
450 u64 delta; 407 u64 delta;
451 408
452 for (i = 0; i < ARRAY_SIZE(test_case_a 409 for (i = 0; i < ARRAY_SIZE(test_case_array); i++)
453 random_array[i] = i; 410 random_array[i] = i;
454 411
455 if (!sequential_test_order) 412 if (!sequential_test_order)
456 shuffle_array(random_array, AR 413 shuffle_array(random_array, ARRAY_SIZE(test_case_array));
457 414
458 /* 415 /*
459 * Block until initialization is done. 416 * Block until initialization is done.
460 */ 417 */
461 down_read(&prepare_for_test_rwsem); 418 down_read(&prepare_for_test_rwsem);
462 419
463 t->start = get_cycles(); 420 t->start = get_cycles();
464 for (i = 0; i < ARRAY_SIZE(test_case_a 421 for (i = 0; i < ARRAY_SIZE(test_case_array); i++) {
465 index = random_array[i]; 422 index = random_array[i];
466 423
467 /* 424 /*
468 * Skip tests if run_test_mask 425 * Skip tests if run_test_mask has been specified.
469 */ 426 */
470 if (!((run_test_mask & (1 << i 427 if (!((run_test_mask & (1 << index)) >> index))
471 continue; 428 continue;
472 429
473 kt = ktime_get(); 430 kt = ktime_get();
474 for (j = 0; j < test_repeat_co 431 for (j = 0; j < test_repeat_count; j++) {
475 if (!test_case_array[i 432 if (!test_case_array[index].test_func())
476 t->data[index] 433 t->data[index].test_passed++;
477 else 434 else
478 t->data[index] 435 t->data[index].test_failed++;
479 } 436 }
480 437
481 /* 438 /*
482 * Take an average time that t 439 * Take an average time that test took.
483 */ 440 */
484 delta = (u64) ktime_us_delta(k 441 delta = (u64) ktime_us_delta(ktime_get(), kt);
485 do_div(delta, (u32) test_repea 442 do_div(delta, (u32) test_repeat_count);
486 443
487 t->data[index].time = delta; 444 t->data[index].time = delta;
488 } 445 }
489 t->stop = get_cycles(); 446 t->stop = get_cycles();
490 447
491 up_read(&prepare_for_test_rwsem); 448 up_read(&prepare_for_test_rwsem);
492 test_report_one_done(); 449 test_report_one_done();
493 450
494 /* 451 /*
495 * Wait for the kthread_stop() call. 452 * Wait for the kthread_stop() call.
496 */ 453 */
497 while (!kthread_should_stop()) 454 while (!kthread_should_stop())
498 msleep(10); 455 msleep(10);
499 456
500 return 0; 457 return 0;
501 } 458 }
502 459
503 static int 460 static int
504 init_test_configuration(void) !! 461 init_test_configurtion(void)
505 { 462 {
506 /* 463 /*
507 * A maximum number of workers is defi 464 * A maximum number of workers is defined as hard-coded
508 * value and set to USHRT_MAX. We add 465 * value and set to USHRT_MAX. We add such gap just in
509 * case and for potential heavy stress 466 * case and for potential heavy stressing.
510 */ 467 */
511 nr_threads = clamp(nr_threads, 1, (int 468 nr_threads = clamp(nr_threads, 1, (int) USHRT_MAX);
512 469
513 /* Allocate the space for test instanc 470 /* Allocate the space for test instances. */
514 tdriver = kvcalloc(nr_threads, sizeof( 471 tdriver = kvcalloc(nr_threads, sizeof(*tdriver), GFP_KERNEL);
515 if (tdriver == NULL) 472 if (tdriver == NULL)
516 return -1; 473 return -1;
517 474
518 if (test_repeat_count <= 0) 475 if (test_repeat_count <= 0)
519 test_repeat_count = 1; 476 test_repeat_count = 1;
520 477
521 if (test_loop_count <= 0) 478 if (test_loop_count <= 0)
522 test_loop_count = 1; 479 test_loop_count = 1;
523 480
524 return 0; 481 return 0;
525 } 482 }
526 483
527 static void do_concurrent_test(void) 484 static void do_concurrent_test(void)
528 { 485 {
529 int i, ret; 486 int i, ret;
530 487
531 /* 488 /*
532 * Set some basic configurations plus 489 * Set some basic configurations plus sanity check.
533 */ 490 */
534 ret = init_test_configuration(); !! 491 ret = init_test_configurtion();
535 if (ret < 0) 492 if (ret < 0)
536 return; 493 return;
537 494
538 /* 495 /*
539 * Put on hold all workers. 496 * Put on hold all workers.
540 */ 497 */
541 down_write(&prepare_for_test_rwsem); 498 down_write(&prepare_for_test_rwsem);
542 499
543 for (i = 0; i < nr_threads; i++) { 500 for (i = 0; i < nr_threads; i++) {
544 struct test_driver *t = &tdriv 501 struct test_driver *t = &tdriver[i];
545 502
546 t->task = kthread_run(test_fun 503 t->task = kthread_run(test_func, t, "vmalloc_test/%d", i);
547 504
548 if (!IS_ERR(t->task)) 505 if (!IS_ERR(t->task))
549 /* Success. */ 506 /* Success. */
550 atomic_inc(&test_n_und 507 atomic_inc(&test_n_undone);
551 else 508 else
552 pr_err("Failed to star 509 pr_err("Failed to start %d kthread\n", i);
553 } 510 }
554 511
555 /* 512 /*
556 * Now let the workers do their job. 513 * Now let the workers do their job.
557 */ 514 */
558 up_write(&prepare_for_test_rwsem); 515 up_write(&prepare_for_test_rwsem);
559 516
560 /* 517 /*
561 * Sleep quiet until all workers are d 518 * Sleep quiet until all workers are done with 1 second
562 * interval. Since the test can take a 519 * interval. Since the test can take a lot of time we
563 * can run into a stack trace of the h 520 * can run into a stack trace of the hung task. That is
564 * why we go with completion_timeout a 521 * why we go with completion_timeout and HZ value.
565 */ 522 */
566 do { 523 do {
567 ret = wait_for_completion_time 524 ret = wait_for_completion_timeout(&test_all_done_comp, HZ);
568 } while (!ret); 525 } while (!ret);
569 526
570 for (i = 0; i < nr_threads; i++) { 527 for (i = 0; i < nr_threads; i++) {
571 struct test_driver *t = &tdriv 528 struct test_driver *t = &tdriver[i];
572 int j; 529 int j;
573 530
574 if (!IS_ERR(t->task)) 531 if (!IS_ERR(t->task))
575 kthread_stop(t->task); 532 kthread_stop(t->task);
576 533
577 for (j = 0; j < ARRAY_SIZE(tes 534 for (j = 0; j < ARRAY_SIZE(test_case_array); j++) {
578 if (!((run_test_mask & 535 if (!((run_test_mask & (1 << j)) >> j))
579 continue; 536 continue;
580 537
581 pr_info( 538 pr_info(
582 "Summary: %s p 539 "Summary: %s passed: %d failed: %d repeat: %d loops: %d avg: %llu usec\n",
583 test_case_arra 540 test_case_array[j].test_name,
584 t->data[j].tes 541 t->data[j].test_passed,
585 t->data[j].tes 542 t->data[j].test_failed,
586 test_repeat_co 543 test_repeat_count, test_loop_count,
587 t->data[j].tim 544 t->data[j].time);
588 } 545 }
589 546
590 pr_info("All test took worker% 547 pr_info("All test took worker%d=%lu cycles\n",
591 i, t->stop - t->start) 548 i, t->stop - t->start);
592 } 549 }
593 550
594 kvfree(tdriver); 551 kvfree(tdriver);
595 } 552 }
596 553
597 static int vmalloc_test_init(void) 554 static int vmalloc_test_init(void)
598 { 555 {
599 do_concurrent_test(); 556 do_concurrent_test();
600 return -EAGAIN; /* Fail will directly 557 return -EAGAIN; /* Fail will directly unload the module */
601 } 558 }
602 559
>> 560 static void vmalloc_test_exit(void)
>> 561 {
>> 562 }
>> 563
603 module_init(vmalloc_test_init) 564 module_init(vmalloc_test_init)
>> 565 module_exit(vmalloc_test_exit)
604 566
605 MODULE_LICENSE("GPL"); 567 MODULE_LICENSE("GPL");
606 MODULE_AUTHOR("Uladzislau Rezki"); 568 MODULE_AUTHOR("Uladzislau Rezki");
607 MODULE_DESCRIPTION("vmalloc test module"); 569 MODULE_DESCRIPTION("vmalloc test module");
608 570
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.