]>
Commit | Line | Data |
---|---|---|
a241ec65 | 1 | /* |
29766f1e | 2 | * Read-Copy Update module-based torture test facility |
a241ec65 PM |
3 | * |
4 | * This program is free software; you can redistribute it and/or modify | |
5 | * it under the terms of the GNU General Public License as published by | |
6 | * the Free Software Foundation; either version 2 of the License, or | |
7 | * (at your option) any later version. | |
8 | * | |
9 | * This program is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public License | |
15 | * along with this program; if not, write to the Free Software | |
16 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
17 | * | |
b772e1dd | 18 | * Copyright (C) IBM Corporation, 2005, 2006 |
a241ec65 PM |
19 | * |
20 | * Authors: Paul E. McKenney <paulmck@us.ibm.com> | |
b772e1dd | 21 | * Josh Triplett <josh@freedesktop.org> |
a241ec65 PM |
22 | * |
23 | * See also: Documentation/RCU/torture.txt | |
24 | */ | |
25 | #include <linux/types.h> | |
26 | #include <linux/kernel.h> | |
27 | #include <linux/init.h> | |
28 | #include <linux/module.h> | |
29 | #include <linux/kthread.h> | |
30 | #include <linux/err.h> | |
31 | #include <linux/spinlock.h> | |
32 | #include <linux/smp.h> | |
33 | #include <linux/rcupdate.h> | |
34 | #include <linux/interrupt.h> | |
35 | #include <linux/sched.h> | |
36 | #include <asm/atomic.h> | |
37 | #include <linux/bitops.h> | |
a241ec65 PM |
38 | #include <linux/completion.h> |
39 | #include <linux/moduleparam.h> | |
40 | #include <linux/percpu.h> | |
41 | #include <linux/notifier.h> | |
343e9099 | 42 | #include <linux/reboot.h> |
83144186 | 43 | #include <linux/freezer.h> |
a241ec65 | 44 | #include <linux/cpu.h> |
a241ec65 | 45 | #include <linux/delay.h> |
a241ec65 | 46 | #include <linux/stat.h> |
b2896d2e | 47 | #include <linux/srcu.h> |
1aeb272c | 48 | #include <linux/slab.h> |
f07767fd | 49 | #include <asm/byteorder.h> |
a241ec65 PM |
50 | |
51 | MODULE_LICENSE("GPL"); | |
b772e1dd JT |
52 | MODULE_AUTHOR("Paul E. McKenney <paulmck@us.ibm.com> and " |
53 | "Josh Triplett <josh@freedesktop.org>"); | |
a241ec65 | 54 | |
4802211c | 55 | static int nreaders = -1; /* # reader threads, defaults to 2*ncpus */ |
b772e1dd | 56 | static int nfakewriters = 4; /* # fake writer threads */ |
d84f5203 | 57 | static int stat_interval; /* Interval between stats, in seconds. */ |
a241ec65 | 58 | /* Defaults to "only at end of test". */ |
d84f5203 SV |
59 | static int verbose; /* Print more debug info. */ |
60 | static int test_no_idle_hz; /* Test RCU's support for tickless idle CPUs. */ | |
d120f65f PM |
61 | static int shuffle_interval = 3; /* Interval between shuffles (in sec)*/ |
62 | static int stutter = 5; /* Start/stop testing interval (in sec) */ | |
0729fbf3 | 63 | static int irqreader = 1; /* RCU readers from irq (timers). */ |
20d2e428 | 64 | static char *torture_type = "rcu"; /* What RCU implementation to torture. */ |
a241ec65 | 65 | |
d6ad6711 | 66 | module_param(nreaders, int, 0444); |
a241ec65 | 67 | MODULE_PARM_DESC(nreaders, "Number of RCU reader threads"); |
d6ad6711 | 68 | module_param(nfakewriters, int, 0444); |
b772e1dd | 69 | MODULE_PARM_DESC(nfakewriters, "Number of RCU fake writer threads"); |
d6ad6711 | 70 | module_param(stat_interval, int, 0444); |
a241ec65 | 71 | MODULE_PARM_DESC(stat_interval, "Number of seconds between stats printk()s"); |
d6ad6711 | 72 | module_param(verbose, bool, 0444); |
a241ec65 | 73 | MODULE_PARM_DESC(verbose, "Enable verbose debugging printk()s"); |
d6ad6711 | 74 | module_param(test_no_idle_hz, bool, 0444); |
d84f5203 | 75 | MODULE_PARM_DESC(test_no_idle_hz, "Test support for tickless idle CPUs"); |
d6ad6711 | 76 | module_param(shuffle_interval, int, 0444); |
d84f5203 | 77 | MODULE_PARM_DESC(shuffle_interval, "Number of seconds between shuffles"); |
d120f65f PM |
78 | module_param(stutter, int, 0444); |
79 | MODULE_PARM_DESC(stutter, "Number of seconds to run/halt test"); | |
0729fbf3 PM |
80 | module_param(irqreader, int, 0444); |
81 | MODULE_PARM_DESC(irqreader, "Allow RCU readers from irq handlers"); | |
d6ad6711 | 82 | module_param(torture_type, charp, 0444); |
b2896d2e | 83 | MODULE_PARM_DESC(torture_type, "Type of RCU to torture (rcu, rcu_bh, srcu)"); |
72e9bb54 PM |
84 | |
85 | #define TORTURE_FLAG "-torture:" | |
a241ec65 | 86 | #define PRINTK_STRING(s) \ |
72e9bb54 | 87 | do { printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0) |
a241ec65 | 88 | #define VERBOSE_PRINTK_STRING(s) \ |
72e9bb54 | 89 | do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0) |
a241ec65 | 90 | #define VERBOSE_PRINTK_ERRSTRING(s) \ |
72e9bb54 | 91 | do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG "!!! " s "\n", torture_type); } while (0) |
a241ec65 PM |
92 | |
93 | static char printk_buf[4096]; | |
94 | ||
95 | static int nrealreaders; | |
96 | static struct task_struct *writer_task; | |
b772e1dd | 97 | static struct task_struct **fakewriter_tasks; |
a241ec65 PM |
98 | static struct task_struct **reader_tasks; |
99 | static struct task_struct *stats_task; | |
d84f5203 | 100 | static struct task_struct *shuffler_task; |
d120f65f | 101 | static struct task_struct *stutter_task; |
a241ec65 PM |
102 | |
103 | #define RCU_TORTURE_PIPE_LEN 10 | |
104 | ||
105 | struct rcu_torture { | |
106 | struct rcu_head rtort_rcu; | |
107 | int rtort_pipe_count; | |
108 | struct list_head rtort_free; | |
996417d2 | 109 | int rtort_mbtest; |
a241ec65 PM |
110 | }; |
111 | ||
a241ec65 PM |
112 | static LIST_HEAD(rcu_torture_freelist); |
113 | static struct rcu_torture *rcu_torture_current = NULL; | |
114 | static long rcu_torture_current_version = 0; | |
115 | static struct rcu_torture rcu_tortures[10 * RCU_TORTURE_PIPE_LEN]; | |
116 | static DEFINE_SPINLOCK(rcu_torture_lock); | |
117 | static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_count) = | |
118 | { 0 }; | |
119 | static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_batch) = | |
120 | { 0 }; | |
121 | static atomic_t rcu_torture_wcount[RCU_TORTURE_PIPE_LEN + 1]; | |
b2896d2e PM |
122 | static atomic_t n_rcu_torture_alloc; |
123 | static atomic_t n_rcu_torture_alloc_fail; | |
124 | static atomic_t n_rcu_torture_free; | |
125 | static atomic_t n_rcu_torture_mberror; | |
126 | static atomic_t n_rcu_torture_error; | |
0729fbf3 | 127 | static long n_rcu_torture_timers = 0; |
e3033736 | 128 | static struct list_head rcu_torture_removed; |
a241ec65 | 129 | |
d120f65f PM |
130 | static int stutter_pause_test = 0; |
131 | ||
31a72bce PM |
132 | #if defined(MODULE) || defined(CONFIG_RCU_TORTURE_TEST_RUNNABLE) |
133 | #define RCUTORTURE_RUNNABLE_INIT 1 | |
134 | #else | |
135 | #define RCUTORTURE_RUNNABLE_INIT 0 | |
136 | #endif | |
137 | int rcutorture_runnable = RCUTORTURE_RUNNABLE_INIT; | |
138 | ||
343e9099 PM |
139 | #define FULLSTOP_SIGNALED 1 /* Bail due to signal. */ |
140 | #define FULLSTOP_CLEANUP 2 /* Orderly shutdown. */ | |
141 | static int fullstop; /* stop generating callbacks at test end. */ | |
142 | DEFINE_MUTEX(fullstop_mutex); /* protect fullstop transitions and */ | |
143 | /* spawning of kthreads. */ | |
144 | ||
145 | /* | |
146 | * Detect and respond to a signal-based shutdown. | |
147 | */ | |
148 | static int | |
149 | rcutorture_shutdown_notify(struct notifier_block *unused1, | |
150 | unsigned long unused2, void *unused3) | |
151 | { | |
152 | if (fullstop) | |
153 | return NOTIFY_DONE; | |
154 | if (signal_pending(current)) { | |
155 | mutex_lock(&fullstop_mutex); | |
156 | if (!ACCESS_ONCE(fullstop)) | |
157 | fullstop = FULLSTOP_SIGNALED; | |
158 | mutex_unlock(&fullstop_mutex); | |
159 | } | |
160 | return NOTIFY_DONE; | |
161 | } | |
162 | ||
a241ec65 PM |
163 | /* |
164 | * Allocate an element from the rcu_tortures pool. | |
165 | */ | |
97a41e26 | 166 | static struct rcu_torture * |
a241ec65 PM |
167 | rcu_torture_alloc(void) |
168 | { | |
169 | struct list_head *p; | |
170 | ||
adac1665 | 171 | spin_lock_bh(&rcu_torture_lock); |
a241ec65 PM |
172 | if (list_empty(&rcu_torture_freelist)) { |
173 | atomic_inc(&n_rcu_torture_alloc_fail); | |
adac1665 | 174 | spin_unlock_bh(&rcu_torture_lock); |
a241ec65 PM |
175 | return NULL; |
176 | } | |
177 | atomic_inc(&n_rcu_torture_alloc); | |
178 | p = rcu_torture_freelist.next; | |
179 | list_del_init(p); | |
adac1665 | 180 | spin_unlock_bh(&rcu_torture_lock); |
a241ec65 PM |
181 | return container_of(p, struct rcu_torture, rtort_free); |
182 | } | |
183 | ||
184 | /* | |
185 | * Free an element to the rcu_tortures pool. | |
186 | */ | |
187 | static void | |
188 | rcu_torture_free(struct rcu_torture *p) | |
189 | { | |
190 | atomic_inc(&n_rcu_torture_free); | |
adac1665 | 191 | spin_lock_bh(&rcu_torture_lock); |
a241ec65 | 192 | list_add_tail(&p->rtort_free, &rcu_torture_freelist); |
adac1665 | 193 | spin_unlock_bh(&rcu_torture_lock); |
a241ec65 PM |
194 | } |
195 | ||
a241ec65 PM |
196 | struct rcu_random_state { |
197 | unsigned long rrs_state; | |
75cfef32 | 198 | long rrs_count; |
a241ec65 PM |
199 | }; |
200 | ||
201 | #define RCU_RANDOM_MULT 39916801 /* prime */ | |
202 | #define RCU_RANDOM_ADD 479001701 /* prime */ | |
203 | #define RCU_RANDOM_REFRESH 10000 | |
204 | ||
205 | #define DEFINE_RCU_RANDOM(name) struct rcu_random_state name = { 0, 0 } | |
206 | ||
207 | /* | |
208 | * Crude but fast random-number generator. Uses a linear congruential | |
c17ac855 | 209 | * generator, with occasional help from cpu_clock(). |
a241ec65 | 210 | */ |
75cfef32 | 211 | static unsigned long |
a241ec65 PM |
212 | rcu_random(struct rcu_random_state *rrsp) |
213 | { | |
a241ec65 | 214 | if (--rrsp->rrs_count < 0) { |
c17ac855 PM |
215 | rrsp->rrs_state += |
216 | (unsigned long)cpu_clock(raw_smp_processor_id()); | |
a241ec65 PM |
217 | rrsp->rrs_count = RCU_RANDOM_REFRESH; |
218 | } | |
219 | rrsp->rrs_state = rrsp->rrs_state * RCU_RANDOM_MULT + RCU_RANDOM_ADD; | |
220 | return swahw32(rrsp->rrs_state); | |
221 | } | |
222 | ||
d120f65f PM |
223 | static void |
224 | rcu_stutter_wait(void) | |
225 | { | |
343e9099 | 226 | while ((stutter_pause_test || !rcutorture_runnable) && !fullstop) { |
e3d7be27 PM |
227 | if (rcutorture_runnable) |
228 | schedule_timeout_interruptible(1); | |
229 | else | |
3ccf79f4 | 230 | schedule_timeout_interruptible(round_jiffies_relative(HZ)); |
343e9099 | 231 | } |
d120f65f PM |
232 | } |
233 | ||
72e9bb54 PM |
234 | /* |
235 | * Operations vector for selecting different types of tests. | |
236 | */ | |
237 | ||
238 | struct rcu_torture_ops { | |
239 | void (*init)(void); | |
240 | void (*cleanup)(void); | |
241 | int (*readlock)(void); | |
b2896d2e | 242 | void (*readdelay)(struct rcu_random_state *rrsp); |
72e9bb54 PM |
243 | void (*readunlock)(int idx); |
244 | int (*completed)(void); | |
245 | void (*deferredfree)(struct rcu_torture *p); | |
b772e1dd | 246 | void (*sync)(void); |
2326974d | 247 | void (*cb_barrier)(void); |
72e9bb54 | 248 | int (*stats)(char *page); |
0729fbf3 | 249 | int irqcapable; |
72e9bb54 PM |
250 | char *name; |
251 | }; | |
252 | static struct rcu_torture_ops *cur_ops = NULL; | |
253 | ||
254 | /* | |
255 | * Definitions for rcu torture testing. | |
256 | */ | |
257 | ||
a49a4af7 | 258 | static int rcu_torture_read_lock(void) __acquires(RCU) |
72e9bb54 PM |
259 | { |
260 | rcu_read_lock(); | |
261 | return 0; | |
262 | } | |
263 | ||
b2896d2e PM |
264 | static void rcu_read_delay(struct rcu_random_state *rrsp) |
265 | { | |
266 | long delay; | |
267 | const long longdelay = 200; | |
268 | ||
269 | /* We want there to be long-running readers, but not all the time. */ | |
270 | ||
271 | delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay); | |
272 | if (!delay) | |
273 | udelay(longdelay); | |
274 | } | |
275 | ||
a49a4af7 | 276 | static void rcu_torture_read_unlock(int idx) __releases(RCU) |
72e9bb54 PM |
277 | { |
278 | rcu_read_unlock(); | |
279 | } | |
280 | ||
281 | static int rcu_torture_completed(void) | |
282 | { | |
283 | return rcu_batches_completed(); | |
284 | } | |
285 | ||
286 | static void | |
287 | rcu_torture_cb(struct rcu_head *p) | |
288 | { | |
289 | int i; | |
290 | struct rcu_torture *rp = container_of(p, struct rcu_torture, rtort_rcu); | |
291 | ||
292 | if (fullstop) { | |
293 | /* Test is ending, just drop callbacks on the floor. */ | |
294 | /* The next initialization will pick up the pieces. */ | |
295 | return; | |
296 | } | |
297 | i = rp->rtort_pipe_count; | |
298 | if (i > RCU_TORTURE_PIPE_LEN) | |
299 | i = RCU_TORTURE_PIPE_LEN; | |
300 | atomic_inc(&rcu_torture_wcount[i]); | |
301 | if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) { | |
302 | rp->rtort_mbtest = 0; | |
303 | rcu_torture_free(rp); | |
304 | } else | |
305 | cur_ops->deferredfree(rp); | |
306 | } | |
307 | ||
308 | static void rcu_torture_deferred_free(struct rcu_torture *p) | |
309 | { | |
310 | call_rcu(&p->rtort_rcu, rcu_torture_cb); | |
311 | } | |
312 | ||
313 | static struct rcu_torture_ops rcu_ops = { | |
314 | .init = NULL, | |
315 | .cleanup = NULL, | |
316 | .readlock = rcu_torture_read_lock, | |
b2896d2e | 317 | .readdelay = rcu_read_delay, |
72e9bb54 PM |
318 | .readunlock = rcu_torture_read_unlock, |
319 | .completed = rcu_torture_completed, | |
320 | .deferredfree = rcu_torture_deferred_free, | |
b772e1dd | 321 | .sync = synchronize_rcu, |
2326974d | 322 | .cb_barrier = rcu_barrier, |
72e9bb54 | 323 | .stats = NULL, |
0729fbf3 | 324 | .irqcapable = 1, |
72e9bb54 PM |
325 | .name = "rcu" |
326 | }; | |
327 | ||
e3033736 JT |
328 | static void rcu_sync_torture_deferred_free(struct rcu_torture *p) |
329 | { | |
330 | int i; | |
331 | struct rcu_torture *rp; | |
332 | struct rcu_torture *rp1; | |
333 | ||
334 | cur_ops->sync(); | |
335 | list_add(&p->rtort_free, &rcu_torture_removed); | |
336 | list_for_each_entry_safe(rp, rp1, &rcu_torture_removed, rtort_free) { | |
337 | i = rp->rtort_pipe_count; | |
338 | if (i > RCU_TORTURE_PIPE_LEN) | |
339 | i = RCU_TORTURE_PIPE_LEN; | |
340 | atomic_inc(&rcu_torture_wcount[i]); | |
341 | if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) { | |
342 | rp->rtort_mbtest = 0; | |
343 | list_del(&rp->rtort_free); | |
344 | rcu_torture_free(rp); | |
345 | } | |
346 | } | |
347 | } | |
348 | ||
349 | static void rcu_sync_torture_init(void) | |
350 | { | |
351 | INIT_LIST_HEAD(&rcu_torture_removed); | |
352 | } | |
353 | ||
20d2e428 JT |
354 | static struct rcu_torture_ops rcu_sync_ops = { |
355 | .init = rcu_sync_torture_init, | |
356 | .cleanup = NULL, | |
357 | .readlock = rcu_torture_read_lock, | |
358 | .readdelay = rcu_read_delay, | |
359 | .readunlock = rcu_torture_read_unlock, | |
360 | .completed = rcu_torture_completed, | |
361 | .deferredfree = rcu_sync_torture_deferred_free, | |
362 | .sync = synchronize_rcu, | |
2326974d | 363 | .cb_barrier = NULL, |
20d2e428 | 364 | .stats = NULL, |
0729fbf3 | 365 | .irqcapable = 1, |
20d2e428 JT |
366 | .name = "rcu_sync" |
367 | }; | |
368 | ||
c32e0660 PM |
369 | /* |
370 | * Definitions for rcu_bh torture testing. | |
371 | */ | |
372 | ||
a49a4af7 | 373 | static int rcu_bh_torture_read_lock(void) __acquires(RCU_BH) |
c32e0660 PM |
374 | { |
375 | rcu_read_lock_bh(); | |
376 | return 0; | |
377 | } | |
378 | ||
a49a4af7 | 379 | static void rcu_bh_torture_read_unlock(int idx) __releases(RCU_BH) |
c32e0660 PM |
380 | { |
381 | rcu_read_unlock_bh(); | |
382 | } | |
383 | ||
384 | static int rcu_bh_torture_completed(void) | |
385 | { | |
386 | return rcu_batches_completed_bh(); | |
387 | } | |
388 | ||
389 | static void rcu_bh_torture_deferred_free(struct rcu_torture *p) | |
390 | { | |
391 | call_rcu_bh(&p->rtort_rcu, rcu_torture_cb); | |
392 | } | |
393 | ||
b772e1dd JT |
394 | struct rcu_bh_torture_synchronize { |
395 | struct rcu_head head; | |
396 | struct completion completion; | |
397 | }; | |
398 | ||
399 | static void rcu_bh_torture_wakeme_after_cb(struct rcu_head *head) | |
400 | { | |
401 | struct rcu_bh_torture_synchronize *rcu; | |
402 | ||
403 | rcu = container_of(head, struct rcu_bh_torture_synchronize, head); | |
404 | complete(&rcu->completion); | |
405 | } | |
406 | ||
407 | static void rcu_bh_torture_synchronize(void) | |
408 | { | |
409 | struct rcu_bh_torture_synchronize rcu; | |
410 | ||
411 | init_completion(&rcu.completion); | |
412 | call_rcu_bh(&rcu.head, rcu_bh_torture_wakeme_after_cb); | |
413 | wait_for_completion(&rcu.completion); | |
414 | } | |
415 | ||
c32e0660 PM |
416 | static struct rcu_torture_ops rcu_bh_ops = { |
417 | .init = NULL, | |
418 | .cleanup = NULL, | |
419 | .readlock = rcu_bh_torture_read_lock, | |
b2896d2e | 420 | .readdelay = rcu_read_delay, /* just reuse rcu's version. */ |
c32e0660 PM |
421 | .readunlock = rcu_bh_torture_read_unlock, |
422 | .completed = rcu_bh_torture_completed, | |
423 | .deferredfree = rcu_bh_torture_deferred_free, | |
b772e1dd | 424 | .sync = rcu_bh_torture_synchronize, |
2326974d | 425 | .cb_barrier = rcu_barrier_bh, |
c32e0660 | 426 | .stats = NULL, |
0729fbf3 | 427 | .irqcapable = 1, |
c32e0660 PM |
428 | .name = "rcu_bh" |
429 | }; | |
430 | ||
11a14701 JT |
431 | static struct rcu_torture_ops rcu_bh_sync_ops = { |
432 | .init = rcu_sync_torture_init, | |
433 | .cleanup = NULL, | |
434 | .readlock = rcu_bh_torture_read_lock, | |
435 | .readdelay = rcu_read_delay, /* just reuse rcu's version. */ | |
436 | .readunlock = rcu_bh_torture_read_unlock, | |
437 | .completed = rcu_bh_torture_completed, | |
438 | .deferredfree = rcu_sync_torture_deferred_free, | |
439 | .sync = rcu_bh_torture_synchronize, | |
2326974d | 440 | .cb_barrier = NULL, |
11a14701 | 441 | .stats = NULL, |
0729fbf3 | 442 | .irqcapable = 1, |
11a14701 JT |
443 | .name = "rcu_bh_sync" |
444 | }; | |
445 | ||
b2896d2e PM |
446 | /* |
447 | * Definitions for srcu torture testing. | |
448 | */ | |
449 | ||
450 | static struct srcu_struct srcu_ctl; | |
b2896d2e PM |
451 | |
452 | static void srcu_torture_init(void) | |
453 | { | |
454 | init_srcu_struct(&srcu_ctl); | |
e3033736 | 455 | rcu_sync_torture_init(); |
b2896d2e PM |
456 | } |
457 | ||
458 | static void srcu_torture_cleanup(void) | |
459 | { | |
460 | synchronize_srcu(&srcu_ctl); | |
461 | cleanup_srcu_struct(&srcu_ctl); | |
462 | } | |
463 | ||
012d3ca8 | 464 | static int srcu_torture_read_lock(void) __acquires(&srcu_ctl) |
b2896d2e PM |
465 | { |
466 | return srcu_read_lock(&srcu_ctl); | |
467 | } | |
468 | ||
469 | static void srcu_read_delay(struct rcu_random_state *rrsp) | |
470 | { | |
471 | long delay; | |
472 | const long uspertick = 1000000 / HZ; | |
473 | const long longdelay = 10; | |
474 | ||
475 | /* We want there to be long-running readers, but not all the time. */ | |
476 | ||
477 | delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay * uspertick); | |
478 | if (!delay) | |
479 | schedule_timeout_interruptible(longdelay); | |
480 | } | |
481 | ||
012d3ca8 | 482 | static void srcu_torture_read_unlock(int idx) __releases(&srcu_ctl) |
b2896d2e PM |
483 | { |
484 | srcu_read_unlock(&srcu_ctl, idx); | |
485 | } | |
486 | ||
487 | static int srcu_torture_completed(void) | |
488 | { | |
489 | return srcu_batches_completed(&srcu_ctl); | |
490 | } | |
491 | ||
b772e1dd JT |
492 | static void srcu_torture_synchronize(void) |
493 | { | |
494 | synchronize_srcu(&srcu_ctl); | |
495 | } | |
496 | ||
b2896d2e PM |
497 | static int srcu_torture_stats(char *page) |
498 | { | |
499 | int cnt = 0; | |
500 | int cpu; | |
501 | int idx = srcu_ctl.completed & 0x1; | |
502 | ||
503 | cnt += sprintf(&page[cnt], "%s%s per-CPU(idx=%d):", | |
504 | torture_type, TORTURE_FLAG, idx); | |
505 | for_each_possible_cpu(cpu) { | |
506 | cnt += sprintf(&page[cnt], " %d(%d,%d)", cpu, | |
507 | per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[!idx], | |
508 | per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[idx]); | |
509 | } | |
510 | cnt += sprintf(&page[cnt], "\n"); | |
511 | return cnt; | |
512 | } | |
513 | ||
514 | static struct rcu_torture_ops srcu_ops = { | |
515 | .init = srcu_torture_init, | |
516 | .cleanup = srcu_torture_cleanup, | |
517 | .readlock = srcu_torture_read_lock, | |
518 | .readdelay = srcu_read_delay, | |
519 | .readunlock = srcu_torture_read_unlock, | |
520 | .completed = srcu_torture_completed, | |
e3033736 | 521 | .deferredfree = rcu_sync_torture_deferred_free, |
b772e1dd | 522 | .sync = srcu_torture_synchronize, |
2326974d | 523 | .cb_barrier = NULL, |
b2896d2e PM |
524 | .stats = srcu_torture_stats, |
525 | .name = "srcu" | |
526 | }; | |
527 | ||
4b6c2cca JT |
528 | /* |
529 | * Definitions for sched torture testing. | |
530 | */ | |
531 | ||
532 | static int sched_torture_read_lock(void) | |
533 | { | |
534 | preempt_disable(); | |
535 | return 0; | |
536 | } | |
537 | ||
538 | static void sched_torture_read_unlock(int idx) | |
539 | { | |
540 | preempt_enable(); | |
541 | } | |
542 | ||
543 | static int sched_torture_completed(void) | |
544 | { | |
545 | return 0; | |
546 | } | |
547 | ||
2326974d PM |
548 | static void rcu_sched_torture_deferred_free(struct rcu_torture *p) |
549 | { | |
550 | call_rcu_sched(&p->rtort_rcu, rcu_torture_cb); | |
551 | } | |
552 | ||
4b6c2cca JT |
553 | static void sched_torture_synchronize(void) |
554 | { | |
555 | synchronize_sched(); | |
556 | } | |
557 | ||
558 | static struct rcu_torture_ops sched_ops = { | |
559 | .init = rcu_sync_torture_init, | |
560 | .cleanup = NULL, | |
561 | .readlock = sched_torture_read_lock, | |
562 | .readdelay = rcu_read_delay, /* just reuse rcu's version. */ | |
563 | .readunlock = sched_torture_read_unlock, | |
564 | .completed = sched_torture_completed, | |
2326974d | 565 | .deferredfree = rcu_sched_torture_deferred_free, |
4b6c2cca | 566 | .sync = sched_torture_synchronize, |
2326974d | 567 | .cb_barrier = rcu_barrier_sched, |
4b6c2cca | 568 | .stats = NULL, |
0729fbf3 | 569 | .irqcapable = 1, |
4b6c2cca JT |
570 | .name = "sched" |
571 | }; | |
572 | ||
2326974d PM |
573 | static struct rcu_torture_ops sched_ops_sync = { |
574 | .init = rcu_sync_torture_init, | |
575 | .cleanup = NULL, | |
576 | .readlock = sched_torture_read_lock, | |
577 | .readdelay = rcu_read_delay, /* just reuse rcu's version. */ | |
578 | .readunlock = sched_torture_read_unlock, | |
579 | .completed = sched_torture_completed, | |
580 | .deferredfree = rcu_sync_torture_deferred_free, | |
581 | .sync = sched_torture_synchronize, | |
582 | .cb_barrier = NULL, | |
583 | .stats = NULL, | |
584 | .name = "sched_sync" | |
585 | }; | |
586 | ||
a241ec65 PM |
587 | /* |
588 | * RCU torture writer kthread. Repeatedly substitutes a new structure | |
589 | * for that pointed to by rcu_torture_current, freeing the old structure | |
590 | * after a series of grace periods (the "pipeline"). | |
591 | */ | |
592 | static int | |
593 | rcu_torture_writer(void *arg) | |
594 | { | |
595 | int i; | |
596 | long oldbatch = rcu_batches_completed(); | |
597 | struct rcu_torture *rp; | |
598 | struct rcu_torture *old_rp; | |
599 | static DEFINE_RCU_RANDOM(rand); | |
600 | ||
601 | VERBOSE_PRINTK_STRING("rcu_torture_writer task started"); | |
dbdf65b1 IM |
602 | set_user_nice(current, 19); |
603 | ||
a241ec65 PM |
604 | do { |
605 | schedule_timeout_uninterruptible(1); | |
a241ec65 PM |
606 | if ((rp = rcu_torture_alloc()) == NULL) |
607 | continue; | |
608 | rp->rtort_pipe_count = 0; | |
609 | udelay(rcu_random(&rand) & 0x3ff); | |
610 | old_rp = rcu_torture_current; | |
996417d2 | 611 | rp->rtort_mbtest = 1; |
a241ec65 PM |
612 | rcu_assign_pointer(rcu_torture_current, rp); |
613 | smp_wmb(); | |
c8e5b163 | 614 | if (old_rp) { |
a241ec65 PM |
615 | i = old_rp->rtort_pipe_count; |
616 | if (i > RCU_TORTURE_PIPE_LEN) | |
617 | i = RCU_TORTURE_PIPE_LEN; | |
618 | atomic_inc(&rcu_torture_wcount[i]); | |
619 | old_rp->rtort_pipe_count++; | |
72e9bb54 | 620 | cur_ops->deferredfree(old_rp); |
a241ec65 PM |
621 | } |
622 | rcu_torture_current_version++; | |
72e9bb54 | 623 | oldbatch = cur_ops->completed(); |
d120f65f | 624 | rcu_stutter_wait(); |
a241ec65 PM |
625 | } while (!kthread_should_stop() && !fullstop); |
626 | VERBOSE_PRINTK_STRING("rcu_torture_writer task stopping"); | |
343e9099 | 627 | while (!kthread_should_stop() && fullstop != FULLSTOP_SIGNALED) |
a241ec65 PM |
628 | schedule_timeout_uninterruptible(1); |
629 | return 0; | |
630 | } | |
631 | ||
b772e1dd JT |
632 | /* |
633 | * RCU torture fake writer kthread. Repeatedly calls sync, with a random | |
634 | * delay between calls. | |
635 | */ | |
636 | static int | |
637 | rcu_torture_fakewriter(void *arg) | |
638 | { | |
639 | DEFINE_RCU_RANDOM(rand); | |
640 | ||
641 | VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task started"); | |
642 | set_user_nice(current, 19); | |
643 | ||
644 | do { | |
645 | schedule_timeout_uninterruptible(1 + rcu_random(&rand)%10); | |
646 | udelay(rcu_random(&rand) & 0x3ff); | |
647 | cur_ops->sync(); | |
d120f65f | 648 | rcu_stutter_wait(); |
b772e1dd JT |
649 | } while (!kthread_should_stop() && !fullstop); |
650 | ||
651 | VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task stopping"); | |
343e9099 | 652 | while (!kthread_should_stop() && fullstop != FULLSTOP_SIGNALED) |
b772e1dd JT |
653 | schedule_timeout_uninterruptible(1); |
654 | return 0; | |
655 | } | |
656 | ||
0729fbf3 PM |
657 | /* |
658 | * RCU torture reader from timer handler. Dereferences rcu_torture_current, | |
659 | * incrementing the corresponding element of the pipeline array. The | |
660 | * counter in the element should never be greater than 1, otherwise, the | |
661 | * RCU implementation is broken. | |
662 | */ | |
663 | static void rcu_torture_timer(unsigned long unused) | |
664 | { | |
665 | int idx; | |
666 | int completed; | |
667 | static DEFINE_RCU_RANDOM(rand); | |
668 | static DEFINE_SPINLOCK(rand_lock); | |
669 | struct rcu_torture *p; | |
670 | int pipe_count; | |
671 | ||
672 | idx = cur_ops->readlock(); | |
673 | completed = cur_ops->completed(); | |
674 | p = rcu_dereference(rcu_torture_current); | |
675 | if (p == NULL) { | |
676 | /* Leave because rcu_torture_writer is not yet underway */ | |
677 | cur_ops->readunlock(idx); | |
678 | return; | |
679 | } | |
680 | if (p->rtort_mbtest == 0) | |
681 | atomic_inc(&n_rcu_torture_mberror); | |
682 | spin_lock(&rand_lock); | |
683 | cur_ops->readdelay(&rand); | |
684 | n_rcu_torture_timers++; | |
685 | spin_unlock(&rand_lock); | |
686 | preempt_disable(); | |
687 | pipe_count = p->rtort_pipe_count; | |
688 | if (pipe_count > RCU_TORTURE_PIPE_LEN) { | |
689 | /* Should not happen, but... */ | |
690 | pipe_count = RCU_TORTURE_PIPE_LEN; | |
691 | } | |
692 | ++__get_cpu_var(rcu_torture_count)[pipe_count]; | |
693 | completed = cur_ops->completed() - completed; | |
694 | if (completed > RCU_TORTURE_PIPE_LEN) { | |
695 | /* Should not happen, but... */ | |
696 | completed = RCU_TORTURE_PIPE_LEN; | |
697 | } | |
698 | ++__get_cpu_var(rcu_torture_batch)[completed]; | |
699 | preempt_enable(); | |
700 | cur_ops->readunlock(idx); | |
701 | } | |
702 | ||
a241ec65 PM |
703 | /* |
704 | * RCU torture reader kthread. Repeatedly dereferences rcu_torture_current, | |
705 | * incrementing the corresponding element of the pipeline array. The | |
706 | * counter in the element should never be greater than 1, otherwise, the | |
707 | * RCU implementation is broken. | |
708 | */ | |
709 | static int | |
710 | rcu_torture_reader(void *arg) | |
711 | { | |
712 | int completed; | |
72e9bb54 | 713 | int idx; |
a241ec65 PM |
714 | DEFINE_RCU_RANDOM(rand); |
715 | struct rcu_torture *p; | |
716 | int pipe_count; | |
0729fbf3 | 717 | struct timer_list t; |
a241ec65 PM |
718 | |
719 | VERBOSE_PRINTK_STRING("rcu_torture_reader task started"); | |
dbdf65b1 | 720 | set_user_nice(current, 19); |
0729fbf3 PM |
721 | if (irqreader && cur_ops->irqcapable) |
722 | setup_timer_on_stack(&t, rcu_torture_timer, 0); | |
dbdf65b1 | 723 | |
a241ec65 | 724 | do { |
0729fbf3 PM |
725 | if (irqreader && cur_ops->irqcapable) { |
726 | if (!timer_pending(&t)) | |
727 | mod_timer(&t, 1); | |
728 | } | |
72e9bb54 PM |
729 | idx = cur_ops->readlock(); |
730 | completed = cur_ops->completed(); | |
a241ec65 PM |
731 | p = rcu_dereference(rcu_torture_current); |
732 | if (p == NULL) { | |
733 | /* Wait for rcu_torture_writer to get underway */ | |
72e9bb54 | 734 | cur_ops->readunlock(idx); |
a241ec65 PM |
735 | schedule_timeout_interruptible(HZ); |
736 | continue; | |
737 | } | |
996417d2 PM |
738 | if (p->rtort_mbtest == 0) |
739 | atomic_inc(&n_rcu_torture_mberror); | |
b2896d2e | 740 | cur_ops->readdelay(&rand); |
a241ec65 PM |
741 | preempt_disable(); |
742 | pipe_count = p->rtort_pipe_count; | |
743 | if (pipe_count > RCU_TORTURE_PIPE_LEN) { | |
744 | /* Should not happen, but... */ | |
745 | pipe_count = RCU_TORTURE_PIPE_LEN; | |
746 | } | |
747 | ++__get_cpu_var(rcu_torture_count)[pipe_count]; | |
72e9bb54 | 748 | completed = cur_ops->completed() - completed; |
a241ec65 PM |
749 | if (completed > RCU_TORTURE_PIPE_LEN) { |
750 | /* Should not happen, but... */ | |
751 | completed = RCU_TORTURE_PIPE_LEN; | |
752 | } | |
753 | ++__get_cpu_var(rcu_torture_batch)[completed]; | |
754 | preempt_enable(); | |
72e9bb54 | 755 | cur_ops->readunlock(idx); |
a241ec65 | 756 | schedule(); |
d120f65f | 757 | rcu_stutter_wait(); |
a241ec65 PM |
758 | } while (!kthread_should_stop() && !fullstop); |
759 | VERBOSE_PRINTK_STRING("rcu_torture_reader task stopping"); | |
0729fbf3 PM |
760 | if (irqreader && cur_ops->irqcapable) |
761 | del_timer_sync(&t); | |
343e9099 | 762 | while (!kthread_should_stop() && fullstop != FULLSTOP_SIGNALED) |
a241ec65 PM |
763 | schedule_timeout_uninterruptible(1); |
764 | return 0; | |
765 | } | |
766 | ||
767 | /* | |
768 | * Create an RCU-torture statistics message in the specified buffer. | |
769 | */ | |
770 | static int | |
771 | rcu_torture_printk(char *page) | |
772 | { | |
773 | int cnt = 0; | |
774 | int cpu; | |
775 | int i; | |
776 | long pipesummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 }; | |
777 | long batchsummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 }; | |
778 | ||
0a945022 | 779 | for_each_possible_cpu(cpu) { |
a241ec65 PM |
780 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) { |
781 | pipesummary[i] += per_cpu(rcu_torture_count, cpu)[i]; | |
782 | batchsummary[i] += per_cpu(rcu_torture_batch, cpu)[i]; | |
783 | } | |
784 | } | |
785 | for (i = RCU_TORTURE_PIPE_LEN - 1; i >= 0; i--) { | |
786 | if (pipesummary[i] != 0) | |
787 | break; | |
788 | } | |
72e9bb54 | 789 | cnt += sprintf(&page[cnt], "%s%s ", torture_type, TORTURE_FLAG); |
a241ec65 | 790 | cnt += sprintf(&page[cnt], |
996417d2 | 791 | "rtc: %p ver: %ld tfle: %d rta: %d rtaf: %d rtf: %d " |
0729fbf3 | 792 | "rtmbe: %d nt: %ld", |
a241ec65 PM |
793 | rcu_torture_current, |
794 | rcu_torture_current_version, | |
795 | list_empty(&rcu_torture_freelist), | |
796 | atomic_read(&n_rcu_torture_alloc), | |
797 | atomic_read(&n_rcu_torture_alloc_fail), | |
996417d2 | 798 | atomic_read(&n_rcu_torture_free), |
0729fbf3 PM |
799 | atomic_read(&n_rcu_torture_mberror), |
800 | n_rcu_torture_timers); | |
996417d2 PM |
801 | if (atomic_read(&n_rcu_torture_mberror) != 0) |
802 | cnt += sprintf(&page[cnt], " !!!"); | |
72e9bb54 | 803 | cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG); |
996417d2 | 804 | if (i > 1) { |
a241ec65 | 805 | cnt += sprintf(&page[cnt], "!!! "); |
996417d2 | 806 | atomic_inc(&n_rcu_torture_error); |
5af970a4 | 807 | WARN_ON_ONCE(1); |
996417d2 | 808 | } |
a241ec65 PM |
809 | cnt += sprintf(&page[cnt], "Reader Pipe: "); |
810 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) | |
811 | cnt += sprintf(&page[cnt], " %ld", pipesummary[i]); | |
72e9bb54 | 812 | cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG); |
a241ec65 | 813 | cnt += sprintf(&page[cnt], "Reader Batch: "); |
72e9bb54 | 814 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) |
a241ec65 | 815 | cnt += sprintf(&page[cnt], " %ld", batchsummary[i]); |
72e9bb54 | 816 | cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG); |
a241ec65 PM |
817 | cnt += sprintf(&page[cnt], "Free-Block Circulation: "); |
818 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) { | |
819 | cnt += sprintf(&page[cnt], " %d", | |
820 | atomic_read(&rcu_torture_wcount[i])); | |
821 | } | |
822 | cnt += sprintf(&page[cnt], "\n"); | |
c8e5b163 | 823 | if (cur_ops->stats) |
72e9bb54 | 824 | cnt += cur_ops->stats(&page[cnt]); |
a241ec65 PM |
825 | return cnt; |
826 | } | |
827 | ||
828 | /* | |
829 | * Print torture statistics. Caller must ensure that there is only | |
830 | * one call to this function at a given time!!! This is normally | |
831 | * accomplished by relying on the module system to only have one copy | |
832 | * of the module loaded, and then by giving the rcu_torture_stats | |
833 | * kthread full control (or the init/cleanup functions when rcu_torture_stats | |
834 | * thread is not running). | |
835 | */ | |
836 | static void | |
837 | rcu_torture_stats_print(void) | |
838 | { | |
839 | int cnt; | |
840 | ||
841 | cnt = rcu_torture_printk(printk_buf); | |
842 | printk(KERN_ALERT "%s", printk_buf); | |
843 | } | |
844 | ||
845 | /* | |
846 | * Periodically prints torture statistics, if periodic statistics printing | |
847 | * was specified via the stat_interval module parameter. | |
848 | * | |
849 | * No need to worry about fullstop here, since this one doesn't reference | |
850 | * volatile state or register callbacks. | |
851 | */ | |
852 | static int | |
853 | rcu_torture_stats(void *arg) | |
854 | { | |
855 | VERBOSE_PRINTK_STRING("rcu_torture_stats task started"); | |
856 | do { | |
857 | schedule_timeout_interruptible(stat_interval * HZ); | |
858 | rcu_torture_stats_print(); | |
343e9099 | 859 | } while (!kthread_should_stop() && !fullstop); |
a241ec65 PM |
860 | VERBOSE_PRINTK_STRING("rcu_torture_stats task stopping"); |
861 | return 0; | |
862 | } | |
863 | ||
d84f5203 SV |
864 | static int rcu_idle_cpu; /* Force all torture tasks off this CPU */ |
865 | ||
866 | /* Shuffle tasks such that we allow @rcu_idle_cpu to become idle. A special case | |
867 | * is when @rcu_idle_cpu = -1, when we allow the tasks to run on all CPUs. | |
868 | */ | |
b2896d2e | 869 | static void rcu_torture_shuffle_tasks(void) |
d84f5203 | 870 | { |
bd232f97 | 871 | cpumask_var_t tmp_mask; |
d84f5203 SV |
872 | int i; |
873 | ||
bd232f97 RR |
874 | if (!alloc_cpumask_var(&tmp_mask, GFP_KERNEL)) |
875 | BUG(); | |
876 | ||
877 | cpumask_setall(tmp_mask); | |
86ef5c9a | 878 | get_online_cpus(); |
d84f5203 SV |
879 | |
880 | /* No point in shuffling if there is only one online CPU (ex: UP) */ | |
bd232f97 RR |
881 | if (num_online_cpus() == 1) |
882 | goto out; | |
d84f5203 SV |
883 | |
884 | if (rcu_idle_cpu != -1) | |
bd232f97 | 885 | cpumask_clear_cpu(rcu_idle_cpu, tmp_mask); |
d84f5203 | 886 | |
bd232f97 | 887 | set_cpus_allowed_ptr(current, tmp_mask); |
d84f5203 | 888 | |
c8e5b163 | 889 | if (reader_tasks) { |
d84f5203 SV |
890 | for (i = 0; i < nrealreaders; i++) |
891 | if (reader_tasks[i]) | |
f70316da | 892 | set_cpus_allowed_ptr(reader_tasks[i], |
bd232f97 | 893 | tmp_mask); |
d84f5203 SV |
894 | } |
895 | ||
c8e5b163 | 896 | if (fakewriter_tasks) { |
b772e1dd JT |
897 | for (i = 0; i < nfakewriters; i++) |
898 | if (fakewriter_tasks[i]) | |
f70316da | 899 | set_cpus_allowed_ptr(fakewriter_tasks[i], |
bd232f97 | 900 | tmp_mask); |
b772e1dd JT |
901 | } |
902 | ||
d84f5203 | 903 | if (writer_task) |
bd232f97 | 904 | set_cpus_allowed_ptr(writer_task, tmp_mask); |
d84f5203 SV |
905 | |
906 | if (stats_task) | |
bd232f97 | 907 | set_cpus_allowed_ptr(stats_task, tmp_mask); |
d84f5203 SV |
908 | |
909 | if (rcu_idle_cpu == -1) | |
910 | rcu_idle_cpu = num_online_cpus() - 1; | |
911 | else | |
912 | rcu_idle_cpu--; | |
913 | ||
bd232f97 | 914 | out: |
86ef5c9a | 915 | put_online_cpus(); |
bd232f97 | 916 | free_cpumask_var(tmp_mask); |
d84f5203 SV |
917 | } |
918 | ||
919 | /* Shuffle tasks across CPUs, with the intent of allowing each CPU in the | |
920 | * system to become idle at a time and cut off its timer ticks. This is meant | |
921 | * to test the support for such tickless idle CPU in RCU. | |
922 | */ | |
923 | static int | |
924 | rcu_torture_shuffle(void *arg) | |
925 | { | |
926 | VERBOSE_PRINTK_STRING("rcu_torture_shuffle task started"); | |
927 | do { | |
928 | schedule_timeout_interruptible(shuffle_interval * HZ); | |
929 | rcu_torture_shuffle_tasks(); | |
343e9099 | 930 | } while (!kthread_should_stop() && !fullstop); |
d84f5203 SV |
931 | VERBOSE_PRINTK_STRING("rcu_torture_shuffle task stopping"); |
932 | return 0; | |
933 | } | |
934 | ||
d120f65f PM |
935 | /* Cause the rcutorture test to "stutter", starting and stopping all |
936 | * threads periodically. | |
937 | */ | |
938 | static int | |
939 | rcu_torture_stutter(void *arg) | |
940 | { | |
941 | VERBOSE_PRINTK_STRING("rcu_torture_stutter task started"); | |
942 | do { | |
943 | schedule_timeout_interruptible(stutter * HZ); | |
944 | stutter_pause_test = 1; | |
343e9099 | 945 | if (!kthread_should_stop() && !fullstop) |
d120f65f PM |
946 | schedule_timeout_interruptible(stutter * HZ); |
947 | stutter_pause_test = 0; | |
343e9099 | 948 | } while (!kthread_should_stop() && !fullstop); |
d120f65f PM |
949 | VERBOSE_PRINTK_STRING("rcu_torture_stutter task stopping"); |
950 | return 0; | |
951 | } | |
952 | ||
95c38322 PM |
953 | static inline void |
954 | rcu_torture_print_module_parms(char *tag) | |
955 | { | |
b772e1dd JT |
956 | printk(KERN_ALERT "%s" TORTURE_FLAG |
957 | "--- %s: nreaders=%d nfakewriters=%d " | |
95c38322 | 958 | "stat_interval=%d verbose=%d test_no_idle_hz=%d " |
0729fbf3 | 959 | "shuffle_interval=%d stutter=%d irqreader=%d\n", |
b772e1dd | 960 | torture_type, tag, nrealreaders, nfakewriters, |
d120f65f | 961 | stat_interval, verbose, test_no_idle_hz, shuffle_interval, |
0729fbf3 | 962 | stutter, irqreader); |
95c38322 PM |
963 | } |
964 | ||
343e9099 PM |
965 | static struct notifier_block rcutorture_nb = { |
966 | .notifier_call = rcutorture_shutdown_notify, | |
967 | }; | |
968 | ||
a241ec65 PM |
969 | static void |
970 | rcu_torture_cleanup(void) | |
971 | { | |
972 | int i; | |
973 | ||
343e9099 PM |
974 | mutex_lock(&fullstop_mutex); |
975 | if (!fullstop) { | |
976 | /* If being signaled, let it happen, then exit. */ | |
977 | mutex_unlock(&fullstop_mutex); | |
978 | schedule_timeout_interruptible(10 * HZ); | |
979 | if (cur_ops->cb_barrier != NULL) | |
980 | cur_ops->cb_barrier(); | |
981 | return; | |
982 | } | |
983 | fullstop = FULLSTOP_CLEANUP; | |
984 | mutex_unlock(&fullstop_mutex); | |
985 | unregister_reboot_notifier(&rcutorture_nb); | |
d120f65f PM |
986 | if (stutter_task) { |
987 | VERBOSE_PRINTK_STRING("Stopping rcu_torture_stutter task"); | |
988 | kthread_stop(stutter_task); | |
989 | } | |
990 | stutter_task = NULL; | |
c8e5b163 | 991 | if (shuffler_task) { |
d84f5203 SV |
992 | VERBOSE_PRINTK_STRING("Stopping rcu_torture_shuffle task"); |
993 | kthread_stop(shuffler_task); | |
994 | } | |
995 | shuffler_task = NULL; | |
996 | ||
c8e5b163 | 997 | if (writer_task) { |
a241ec65 PM |
998 | VERBOSE_PRINTK_STRING("Stopping rcu_torture_writer task"); |
999 | kthread_stop(writer_task); | |
1000 | } | |
1001 | writer_task = NULL; | |
1002 | ||
c8e5b163 | 1003 | if (reader_tasks) { |
a241ec65 | 1004 | for (i = 0; i < nrealreaders; i++) { |
c8e5b163 | 1005 | if (reader_tasks[i]) { |
a241ec65 PM |
1006 | VERBOSE_PRINTK_STRING( |
1007 | "Stopping rcu_torture_reader task"); | |
1008 | kthread_stop(reader_tasks[i]); | |
1009 | } | |
1010 | reader_tasks[i] = NULL; | |
1011 | } | |
1012 | kfree(reader_tasks); | |
1013 | reader_tasks = NULL; | |
1014 | } | |
1015 | rcu_torture_current = NULL; | |
1016 | ||
c8e5b163 | 1017 | if (fakewriter_tasks) { |
b772e1dd | 1018 | for (i = 0; i < nfakewriters; i++) { |
c8e5b163 | 1019 | if (fakewriter_tasks[i]) { |
b772e1dd JT |
1020 | VERBOSE_PRINTK_STRING( |
1021 | "Stopping rcu_torture_fakewriter task"); | |
1022 | kthread_stop(fakewriter_tasks[i]); | |
1023 | } | |
1024 | fakewriter_tasks[i] = NULL; | |
1025 | } | |
1026 | kfree(fakewriter_tasks); | |
1027 | fakewriter_tasks = NULL; | |
1028 | } | |
1029 | ||
c8e5b163 | 1030 | if (stats_task) { |
a241ec65 PM |
1031 | VERBOSE_PRINTK_STRING("Stopping rcu_torture_stats task"); |
1032 | kthread_stop(stats_task); | |
1033 | } | |
1034 | stats_task = NULL; | |
1035 | ||
1036 | /* Wait for all RCU callbacks to fire. */ | |
2326974d PM |
1037 | |
1038 | if (cur_ops->cb_barrier != NULL) | |
1039 | cur_ops->cb_barrier(); | |
a241ec65 | 1040 | |
a241ec65 | 1041 | rcu_torture_stats_print(); /* -After- the stats thread is stopped! */ |
72e9bb54 | 1042 | |
c8e5b163 | 1043 | if (cur_ops->cleanup) |
72e9bb54 | 1044 | cur_ops->cleanup(); |
95c38322 PM |
1045 | if (atomic_read(&n_rcu_torture_error)) |
1046 | rcu_torture_print_module_parms("End of test: FAILURE"); | |
1047 | else | |
1048 | rcu_torture_print_module_parms("End of test: SUCCESS"); | |
a241ec65 PM |
1049 | } |
1050 | ||
6f8bc500 | 1051 | static int __init |
a241ec65 PM |
1052 | rcu_torture_init(void) |
1053 | { | |
1054 | int i; | |
1055 | int cpu; | |
1056 | int firsterr = 0; | |
ade5fb81 JT |
1057 | static struct rcu_torture_ops *torture_ops[] = |
1058 | { &rcu_ops, &rcu_sync_ops, &rcu_bh_ops, &rcu_bh_sync_ops, | |
2326974d | 1059 | &srcu_ops, &sched_ops, &sched_ops_sync, }; |
a241ec65 | 1060 | |
343e9099 PM |
1061 | mutex_lock(&fullstop_mutex); |
1062 | ||
a241ec65 | 1063 | /* Process args and tell the world that the torturer is on the job. */ |
ade5fb81 | 1064 | for (i = 0; i < ARRAY_SIZE(torture_ops); i++) { |
72e9bb54 | 1065 | cur_ops = torture_ops[i]; |
ade5fb81 | 1066 | if (strcmp(torture_type, cur_ops->name) == 0) |
72e9bb54 | 1067 | break; |
72e9bb54 | 1068 | } |
ade5fb81 | 1069 | if (i == ARRAY_SIZE(torture_ops)) { |
72e9bb54 PM |
1070 | printk(KERN_ALERT "rcutorture: invalid torture type: \"%s\"\n", |
1071 | torture_type); | |
343e9099 | 1072 | mutex_unlock(&fullstop_mutex); |
72e9bb54 PM |
1073 | return (-EINVAL); |
1074 | } | |
c8e5b163 | 1075 | if (cur_ops->init) |
72e9bb54 PM |
1076 | cur_ops->init(); /* no "goto unwind" prior to this point!!! */ |
1077 | ||
a241ec65 PM |
1078 | if (nreaders >= 0) |
1079 | nrealreaders = nreaders; | |
1080 | else | |
1081 | nrealreaders = 2 * num_online_cpus(); | |
95c38322 | 1082 | rcu_torture_print_module_parms("Start of test"); |
a241ec65 PM |
1083 | fullstop = 0; |
1084 | ||
1085 | /* Set up the freelist. */ | |
1086 | ||
1087 | INIT_LIST_HEAD(&rcu_torture_freelist); | |
788e770e | 1088 | for (i = 0; i < ARRAY_SIZE(rcu_tortures); i++) { |
996417d2 | 1089 | rcu_tortures[i].rtort_mbtest = 0; |
a241ec65 PM |
1090 | list_add_tail(&rcu_tortures[i].rtort_free, |
1091 | &rcu_torture_freelist); | |
1092 | } | |
1093 | ||
1094 | /* Initialize the statistics so that each run gets its own numbers. */ | |
1095 | ||
1096 | rcu_torture_current = NULL; | |
1097 | rcu_torture_current_version = 0; | |
1098 | atomic_set(&n_rcu_torture_alloc, 0); | |
1099 | atomic_set(&n_rcu_torture_alloc_fail, 0); | |
1100 | atomic_set(&n_rcu_torture_free, 0); | |
996417d2 PM |
1101 | atomic_set(&n_rcu_torture_mberror, 0); |
1102 | atomic_set(&n_rcu_torture_error, 0); | |
a241ec65 PM |
1103 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) |
1104 | atomic_set(&rcu_torture_wcount[i], 0); | |
0a945022 | 1105 | for_each_possible_cpu(cpu) { |
a241ec65 PM |
1106 | for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) { |
1107 | per_cpu(rcu_torture_count, cpu)[i] = 0; | |
1108 | per_cpu(rcu_torture_batch, cpu)[i] = 0; | |
1109 | } | |
1110 | } | |
1111 | ||
1112 | /* Start up the kthreads. */ | |
1113 | ||
1114 | VERBOSE_PRINTK_STRING("Creating rcu_torture_writer task"); | |
1115 | writer_task = kthread_run(rcu_torture_writer, NULL, | |
1116 | "rcu_torture_writer"); | |
1117 | if (IS_ERR(writer_task)) { | |
1118 | firsterr = PTR_ERR(writer_task); | |
1119 | VERBOSE_PRINTK_ERRSTRING("Failed to create writer"); | |
1120 | writer_task = NULL; | |
1121 | goto unwind; | |
1122 | } | |
b772e1dd JT |
1123 | fakewriter_tasks = kzalloc(nfakewriters * sizeof(fakewriter_tasks[0]), |
1124 | GFP_KERNEL); | |
1125 | if (fakewriter_tasks == NULL) { | |
1126 | VERBOSE_PRINTK_ERRSTRING("out of memory"); | |
1127 | firsterr = -ENOMEM; | |
1128 | goto unwind; | |
1129 | } | |
1130 | for (i = 0; i < nfakewriters; i++) { | |
1131 | VERBOSE_PRINTK_STRING("Creating rcu_torture_fakewriter task"); | |
1132 | fakewriter_tasks[i] = kthread_run(rcu_torture_fakewriter, NULL, | |
1133 | "rcu_torture_fakewriter"); | |
1134 | if (IS_ERR(fakewriter_tasks[i])) { | |
1135 | firsterr = PTR_ERR(fakewriter_tasks[i]); | |
1136 | VERBOSE_PRINTK_ERRSTRING("Failed to create fakewriter"); | |
1137 | fakewriter_tasks[i] = NULL; | |
1138 | goto unwind; | |
1139 | } | |
1140 | } | |
2860aaba | 1141 | reader_tasks = kzalloc(nrealreaders * sizeof(reader_tasks[0]), |
a241ec65 PM |
1142 | GFP_KERNEL); |
1143 | if (reader_tasks == NULL) { | |
1144 | VERBOSE_PRINTK_ERRSTRING("out of memory"); | |
1145 | firsterr = -ENOMEM; | |
1146 | goto unwind; | |
1147 | } | |
1148 | for (i = 0; i < nrealreaders; i++) { | |
1149 | VERBOSE_PRINTK_STRING("Creating rcu_torture_reader task"); | |
1150 | reader_tasks[i] = kthread_run(rcu_torture_reader, NULL, | |
1151 | "rcu_torture_reader"); | |
1152 | if (IS_ERR(reader_tasks[i])) { | |
1153 | firsterr = PTR_ERR(reader_tasks[i]); | |
1154 | VERBOSE_PRINTK_ERRSTRING("Failed to create reader"); | |
1155 | reader_tasks[i] = NULL; | |
1156 | goto unwind; | |
1157 | } | |
1158 | } | |
1159 | if (stat_interval > 0) { | |
1160 | VERBOSE_PRINTK_STRING("Creating rcu_torture_stats task"); | |
1161 | stats_task = kthread_run(rcu_torture_stats, NULL, | |
1162 | "rcu_torture_stats"); | |
1163 | if (IS_ERR(stats_task)) { | |
1164 | firsterr = PTR_ERR(stats_task); | |
1165 | VERBOSE_PRINTK_ERRSTRING("Failed to create stats"); | |
1166 | stats_task = NULL; | |
1167 | goto unwind; | |
1168 | } | |
1169 | } | |
d84f5203 SV |
1170 | if (test_no_idle_hz) { |
1171 | rcu_idle_cpu = num_online_cpus() - 1; | |
1172 | /* Create the shuffler thread */ | |
1173 | shuffler_task = kthread_run(rcu_torture_shuffle, NULL, | |
1174 | "rcu_torture_shuffle"); | |
1175 | if (IS_ERR(shuffler_task)) { | |
1176 | firsterr = PTR_ERR(shuffler_task); | |
1177 | VERBOSE_PRINTK_ERRSTRING("Failed to create shuffler"); | |
1178 | shuffler_task = NULL; | |
1179 | goto unwind; | |
1180 | } | |
1181 | } | |
d120f65f PM |
1182 | if (stutter < 0) |
1183 | stutter = 0; | |
1184 | if (stutter) { | |
1185 | /* Create the stutter thread */ | |
1186 | stutter_task = kthread_run(rcu_torture_stutter, NULL, | |
1187 | "rcu_torture_stutter"); | |
1188 | if (IS_ERR(stutter_task)) { | |
1189 | firsterr = PTR_ERR(stutter_task); | |
1190 | VERBOSE_PRINTK_ERRSTRING("Failed to create stutter"); | |
1191 | stutter_task = NULL; | |
1192 | goto unwind; | |
1193 | } | |
1194 | } | |
343e9099 PM |
1195 | register_reboot_notifier(&rcutorture_nb); |
1196 | mutex_unlock(&fullstop_mutex); | |
a241ec65 PM |
1197 | return 0; |
1198 | ||
1199 | unwind: | |
343e9099 | 1200 | mutex_unlock(&fullstop_mutex); |
a241ec65 PM |
1201 | rcu_torture_cleanup(); |
1202 | return firsterr; | |
1203 | } | |
1204 | ||
1205 | module_init(rcu_torture_init); | |
1206 | module_exit(rcu_torture_cleanup); |