2 * Read-Copy Update module-based torture test facility
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.
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.
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.
18 * Copyright (C) IBM Corporation, 2005, 2006
20 * Authors: Paul E. McKenney <paulmck@us.ibm.com>
21 * Josh Triplett <josh@freedesktop.org>
23 * See also: Documentation/RCU/torture.txt
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>
38 #include <linux/module.h>
39 #include <linux/completion.h>
40 #include <linux/moduleparam.h>
41 #include <linux/percpu.h>
42 #include <linux/notifier.h>
43 #include <linux/cpu.h>
44 #include <linux/random.h>
45 #include <linux/delay.h>
46 #include <linux/byteorder/swabb.h>
47 #include <linux/stat.h>
48 #include <linux/srcu.h>
50 MODULE_LICENSE("GPL");
51 MODULE_AUTHOR("Paul E. McKenney <paulmck@us.ibm.com> and "
52 "Josh Triplett <josh@freedesktop.org>");
54 static int nreaders = -1; /* # reader threads, defaults to 2*ncpus */
55 static int nfakewriters = 4; /* # fake writer threads */
56 static int stat_interval; /* Interval between stats, in seconds. */
57 /* Defaults to "only at end of test". */
58 static int verbose; /* Print more debug info. */
59 static int test_no_idle_hz; /* Test RCU's support for tickless idle CPUs. */
60 static int shuffle_interval = 5; /* Interval between shuffles (in sec)*/
61 static char *torture_type = "rcu"; /* What RCU implementation to torture. */
63 module_param(nreaders, int, 0444);
64 MODULE_PARM_DESC(nreaders, "Number of RCU reader threads");
65 module_param(nfakewriters, int, 0444);
66 MODULE_PARM_DESC(nfakewriters, "Number of RCU fake writer threads");
67 module_param(stat_interval, int, 0444);
68 MODULE_PARM_DESC(stat_interval, "Number of seconds between stats printk()s");
69 module_param(verbose, bool, 0444);
70 MODULE_PARM_DESC(verbose, "Enable verbose debugging printk()s");
71 module_param(test_no_idle_hz, bool, 0444);
72 MODULE_PARM_DESC(test_no_idle_hz, "Test support for tickless idle CPUs");
73 module_param(shuffle_interval, int, 0444);
74 MODULE_PARM_DESC(shuffle_interval, "Number of seconds between shuffles");
75 module_param(torture_type, charp, 0444);
76 MODULE_PARM_DESC(torture_type, "Type of RCU to torture (rcu, rcu_bh, srcu)");
78 #define TORTURE_FLAG "-torture:"
79 #define PRINTK_STRING(s) \
80 do { printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)
81 #define VERBOSE_PRINTK_STRING(s) \
82 do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)
83 #define VERBOSE_PRINTK_ERRSTRING(s) \
84 do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG "!!! " s "\n", torture_type); } while (0)
86 static char printk_buf[4096];
88 static int nrealreaders;
89 static struct task_struct *writer_task;
90 static struct task_struct **fakewriter_tasks;
91 static struct task_struct **reader_tasks;
92 static struct task_struct *stats_task;
93 static struct task_struct *shuffler_task;
95 #define RCU_TORTURE_PIPE_LEN 10
98 struct rcu_head rtort_rcu;
100 struct list_head rtort_free;
104 static int fullstop = 0; /* stop generating callbacks at test end. */
105 static LIST_HEAD(rcu_torture_freelist);
106 static struct rcu_torture *rcu_torture_current = NULL;
107 static long rcu_torture_current_version = 0;
108 static struct rcu_torture rcu_tortures[10 * RCU_TORTURE_PIPE_LEN];
109 static DEFINE_SPINLOCK(rcu_torture_lock);
110 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_count) =
112 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_batch) =
114 static atomic_t rcu_torture_wcount[RCU_TORTURE_PIPE_LEN + 1];
115 static atomic_t n_rcu_torture_alloc;
116 static atomic_t n_rcu_torture_alloc_fail;
117 static atomic_t n_rcu_torture_free;
118 static atomic_t n_rcu_torture_mberror;
119 static atomic_t n_rcu_torture_error;
120 static struct list_head rcu_torture_removed;
123 * Allocate an element from the rcu_tortures pool.
125 static struct rcu_torture *
126 rcu_torture_alloc(void)
130 spin_lock_bh(&rcu_torture_lock);
131 if (list_empty(&rcu_torture_freelist)) {
132 atomic_inc(&n_rcu_torture_alloc_fail);
133 spin_unlock_bh(&rcu_torture_lock);
136 atomic_inc(&n_rcu_torture_alloc);
137 p = rcu_torture_freelist.next;
139 spin_unlock_bh(&rcu_torture_lock);
140 return container_of(p, struct rcu_torture, rtort_free);
144 * Free an element to the rcu_tortures pool.
147 rcu_torture_free(struct rcu_torture *p)
149 atomic_inc(&n_rcu_torture_free);
150 spin_lock_bh(&rcu_torture_lock);
151 list_add_tail(&p->rtort_free, &rcu_torture_freelist);
152 spin_unlock_bh(&rcu_torture_lock);
155 struct rcu_random_state {
156 unsigned long rrs_state;
160 #define RCU_RANDOM_MULT 39916801 /* prime */
161 #define RCU_RANDOM_ADD 479001701 /* prime */
162 #define RCU_RANDOM_REFRESH 10000
164 #define DEFINE_RCU_RANDOM(name) struct rcu_random_state name = { 0, 0 }
167 * Crude but fast random-number generator. Uses a linear congruential
168 * generator, with occasional help from get_random_bytes().
171 rcu_random(struct rcu_random_state *rrsp)
175 if (--rrsp->rrs_count < 0) {
176 get_random_bytes(&refresh, sizeof(refresh));
177 rrsp->rrs_state += refresh;
178 rrsp->rrs_count = RCU_RANDOM_REFRESH;
180 rrsp->rrs_state = rrsp->rrs_state * RCU_RANDOM_MULT + RCU_RANDOM_ADD;
181 return swahw32(rrsp->rrs_state);
185 * Operations vector for selecting different types of tests.
188 struct rcu_torture_ops {
190 void (*cleanup)(void);
191 int (*readlock)(void);
192 void (*readdelay)(struct rcu_random_state *rrsp);
193 void (*readunlock)(int idx);
194 int (*completed)(void);
195 void (*deferredfree)(struct rcu_torture *p);
197 int (*stats)(char *page);
200 static struct rcu_torture_ops *cur_ops = NULL;
203 * Definitions for rcu torture testing.
206 static int rcu_torture_read_lock(void) __acquires(RCU)
212 static void rcu_read_delay(struct rcu_random_state *rrsp)
215 const long longdelay = 200;
217 /* We want there to be long-running readers, but not all the time. */
219 delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay);
224 static void rcu_torture_read_unlock(int idx) __releases(RCU)
229 static int rcu_torture_completed(void)
231 return rcu_batches_completed();
235 rcu_torture_cb(struct rcu_head *p)
238 struct rcu_torture *rp = container_of(p, struct rcu_torture, rtort_rcu);
241 /* Test is ending, just drop callbacks on the floor. */
242 /* The next initialization will pick up the pieces. */
245 i = rp->rtort_pipe_count;
246 if (i > RCU_TORTURE_PIPE_LEN)
247 i = RCU_TORTURE_PIPE_LEN;
248 atomic_inc(&rcu_torture_wcount[i]);
249 if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) {
250 rp->rtort_mbtest = 0;
251 rcu_torture_free(rp);
253 cur_ops->deferredfree(rp);
256 static void rcu_torture_deferred_free(struct rcu_torture *p)
258 call_rcu(&p->rtort_rcu, rcu_torture_cb);
261 static struct rcu_torture_ops rcu_ops = {
264 .readlock = rcu_torture_read_lock,
265 .readdelay = rcu_read_delay,
266 .readunlock = rcu_torture_read_unlock,
267 .completed = rcu_torture_completed,
268 .deferredfree = rcu_torture_deferred_free,
269 .sync = synchronize_rcu,
274 static void rcu_sync_torture_deferred_free(struct rcu_torture *p)
277 struct rcu_torture *rp;
278 struct rcu_torture *rp1;
281 list_add(&p->rtort_free, &rcu_torture_removed);
282 list_for_each_entry_safe(rp, rp1, &rcu_torture_removed, rtort_free) {
283 i = rp->rtort_pipe_count;
284 if (i > RCU_TORTURE_PIPE_LEN)
285 i = RCU_TORTURE_PIPE_LEN;
286 atomic_inc(&rcu_torture_wcount[i]);
287 if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) {
288 rp->rtort_mbtest = 0;
289 list_del(&rp->rtort_free);
290 rcu_torture_free(rp);
295 static void rcu_sync_torture_init(void)
297 INIT_LIST_HEAD(&rcu_torture_removed);
300 static struct rcu_torture_ops rcu_sync_ops = {
301 .init = rcu_sync_torture_init,
303 .readlock = rcu_torture_read_lock,
304 .readdelay = rcu_read_delay,
305 .readunlock = rcu_torture_read_unlock,
306 .completed = rcu_torture_completed,
307 .deferredfree = rcu_sync_torture_deferred_free,
308 .sync = synchronize_rcu,
314 * Definitions for rcu_bh torture testing.
317 static int rcu_bh_torture_read_lock(void) __acquires(RCU_BH)
323 static void rcu_bh_torture_read_unlock(int idx) __releases(RCU_BH)
325 rcu_read_unlock_bh();
328 static int rcu_bh_torture_completed(void)
330 return rcu_batches_completed_bh();
333 static void rcu_bh_torture_deferred_free(struct rcu_torture *p)
335 call_rcu_bh(&p->rtort_rcu, rcu_torture_cb);
338 struct rcu_bh_torture_synchronize {
339 struct rcu_head head;
340 struct completion completion;
343 static void rcu_bh_torture_wakeme_after_cb(struct rcu_head *head)
345 struct rcu_bh_torture_synchronize *rcu;
347 rcu = container_of(head, struct rcu_bh_torture_synchronize, head);
348 complete(&rcu->completion);
351 static void rcu_bh_torture_synchronize(void)
353 struct rcu_bh_torture_synchronize rcu;
355 init_completion(&rcu.completion);
356 call_rcu_bh(&rcu.head, rcu_bh_torture_wakeme_after_cb);
357 wait_for_completion(&rcu.completion);
360 static struct rcu_torture_ops rcu_bh_ops = {
363 .readlock = rcu_bh_torture_read_lock,
364 .readdelay = rcu_read_delay, /* just reuse rcu's version. */
365 .readunlock = rcu_bh_torture_read_unlock,
366 .completed = rcu_bh_torture_completed,
367 .deferredfree = rcu_bh_torture_deferred_free,
368 .sync = rcu_bh_torture_synchronize,
373 static struct rcu_torture_ops rcu_bh_sync_ops = {
374 .init = rcu_sync_torture_init,
376 .readlock = rcu_bh_torture_read_lock,
377 .readdelay = rcu_read_delay, /* just reuse rcu's version. */
378 .readunlock = rcu_bh_torture_read_unlock,
379 .completed = rcu_bh_torture_completed,
380 .deferredfree = rcu_sync_torture_deferred_free,
381 .sync = rcu_bh_torture_synchronize,
383 .name = "rcu_bh_sync"
387 * Definitions for srcu torture testing.
390 static struct srcu_struct srcu_ctl;
392 static void srcu_torture_init(void)
394 init_srcu_struct(&srcu_ctl);
395 rcu_sync_torture_init();
398 static void srcu_torture_cleanup(void)
400 synchronize_srcu(&srcu_ctl);
401 cleanup_srcu_struct(&srcu_ctl);
404 static int srcu_torture_read_lock(void) __acquires(&srcu_ctl)
406 return srcu_read_lock(&srcu_ctl);
409 static void srcu_read_delay(struct rcu_random_state *rrsp)
412 const long uspertick = 1000000 / HZ;
413 const long longdelay = 10;
415 /* We want there to be long-running readers, but not all the time. */
417 delay = rcu_random(rrsp) % (nrealreaders * 2 * longdelay * uspertick);
419 schedule_timeout_interruptible(longdelay);
422 static void srcu_torture_read_unlock(int idx) __releases(&srcu_ctl)
424 srcu_read_unlock(&srcu_ctl, idx);
427 static int srcu_torture_completed(void)
429 return srcu_batches_completed(&srcu_ctl);
432 static void srcu_torture_synchronize(void)
434 synchronize_srcu(&srcu_ctl);
437 static int srcu_torture_stats(char *page)
441 int idx = srcu_ctl.completed & 0x1;
443 cnt += sprintf(&page[cnt], "%s%s per-CPU(idx=%d):",
444 torture_type, TORTURE_FLAG, idx);
445 for_each_possible_cpu(cpu) {
446 cnt += sprintf(&page[cnt], " %d(%d,%d)", cpu,
447 per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[!idx],
448 per_cpu_ptr(srcu_ctl.per_cpu_ref, cpu)->c[idx]);
450 cnt += sprintf(&page[cnt], "\n");
454 static struct rcu_torture_ops srcu_ops = {
455 .init = srcu_torture_init,
456 .cleanup = srcu_torture_cleanup,
457 .readlock = srcu_torture_read_lock,
458 .readdelay = srcu_read_delay,
459 .readunlock = srcu_torture_read_unlock,
460 .completed = srcu_torture_completed,
461 .deferredfree = rcu_sync_torture_deferred_free,
462 .sync = srcu_torture_synchronize,
463 .stats = srcu_torture_stats,
468 * Definitions for sched torture testing.
471 static int sched_torture_read_lock(void)
477 static void sched_torture_read_unlock(int idx)
482 static int sched_torture_completed(void)
487 static void sched_torture_synchronize(void)
492 static struct rcu_torture_ops sched_ops = {
493 .init = rcu_sync_torture_init,
495 .readlock = sched_torture_read_lock,
496 .readdelay = rcu_read_delay, /* just reuse rcu's version. */
497 .readunlock = sched_torture_read_unlock,
498 .completed = sched_torture_completed,
499 .deferredfree = rcu_sync_torture_deferred_free,
500 .sync = sched_torture_synchronize,
505 static struct rcu_torture_ops *torture_ops[] =
506 { &rcu_ops, &rcu_sync_ops, &rcu_bh_ops, &rcu_bh_sync_ops, &srcu_ops,
510 * RCU torture writer kthread. Repeatedly substitutes a new structure
511 * for that pointed to by rcu_torture_current, freeing the old structure
512 * after a series of grace periods (the "pipeline").
515 rcu_torture_writer(void *arg)
518 long oldbatch = rcu_batches_completed();
519 struct rcu_torture *rp;
520 struct rcu_torture *old_rp;
521 static DEFINE_RCU_RANDOM(rand);
523 VERBOSE_PRINTK_STRING("rcu_torture_writer task started");
524 set_user_nice(current, 19);
525 current->flags |= PF_NOFREEZE;
528 schedule_timeout_uninterruptible(1);
529 if ((rp = rcu_torture_alloc()) == NULL)
531 rp->rtort_pipe_count = 0;
532 udelay(rcu_random(&rand) & 0x3ff);
533 old_rp = rcu_torture_current;
534 rp->rtort_mbtest = 1;
535 rcu_assign_pointer(rcu_torture_current, rp);
537 if (old_rp != NULL) {
538 i = old_rp->rtort_pipe_count;
539 if (i > RCU_TORTURE_PIPE_LEN)
540 i = RCU_TORTURE_PIPE_LEN;
541 atomic_inc(&rcu_torture_wcount[i]);
542 old_rp->rtort_pipe_count++;
543 cur_ops->deferredfree(old_rp);
545 rcu_torture_current_version++;
546 oldbatch = cur_ops->completed();
547 } while (!kthread_should_stop() && !fullstop);
548 VERBOSE_PRINTK_STRING("rcu_torture_writer task stopping");
549 while (!kthread_should_stop())
550 schedule_timeout_uninterruptible(1);
555 * RCU torture fake writer kthread. Repeatedly calls sync, with a random
556 * delay between calls.
559 rcu_torture_fakewriter(void *arg)
561 DEFINE_RCU_RANDOM(rand);
563 VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task started");
564 set_user_nice(current, 19);
565 current->flags |= PF_NOFREEZE;
568 schedule_timeout_uninterruptible(1 + rcu_random(&rand)%10);
569 udelay(rcu_random(&rand) & 0x3ff);
571 } while (!kthread_should_stop() && !fullstop);
573 VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task stopping");
574 while (!kthread_should_stop())
575 schedule_timeout_uninterruptible(1);
580 * RCU torture reader kthread. Repeatedly dereferences rcu_torture_current,
581 * incrementing the corresponding element of the pipeline array. The
582 * counter in the element should never be greater than 1, otherwise, the
583 * RCU implementation is broken.
586 rcu_torture_reader(void *arg)
590 DEFINE_RCU_RANDOM(rand);
591 struct rcu_torture *p;
594 VERBOSE_PRINTK_STRING("rcu_torture_reader task started");
595 set_user_nice(current, 19);
596 current->flags |= PF_NOFREEZE;
599 idx = cur_ops->readlock();
600 completed = cur_ops->completed();
601 p = rcu_dereference(rcu_torture_current);
603 /* Wait for rcu_torture_writer to get underway */
604 cur_ops->readunlock(idx);
605 schedule_timeout_interruptible(HZ);
608 if (p->rtort_mbtest == 0)
609 atomic_inc(&n_rcu_torture_mberror);
610 cur_ops->readdelay(&rand);
612 pipe_count = p->rtort_pipe_count;
613 if (pipe_count > RCU_TORTURE_PIPE_LEN) {
614 /* Should not happen, but... */
615 pipe_count = RCU_TORTURE_PIPE_LEN;
617 ++__get_cpu_var(rcu_torture_count)[pipe_count];
618 completed = cur_ops->completed() - completed;
619 if (completed > RCU_TORTURE_PIPE_LEN) {
620 /* Should not happen, but... */
621 completed = RCU_TORTURE_PIPE_LEN;
623 ++__get_cpu_var(rcu_torture_batch)[completed];
625 cur_ops->readunlock(idx);
627 } while (!kthread_should_stop() && !fullstop);
628 VERBOSE_PRINTK_STRING("rcu_torture_reader task stopping");
629 while (!kthread_should_stop())
630 schedule_timeout_uninterruptible(1);
635 * Create an RCU-torture statistics message in the specified buffer.
638 rcu_torture_printk(char *page)
643 long pipesummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 };
644 long batchsummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 };
646 for_each_possible_cpu(cpu) {
647 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
648 pipesummary[i] += per_cpu(rcu_torture_count, cpu)[i];
649 batchsummary[i] += per_cpu(rcu_torture_batch, cpu)[i];
652 for (i = RCU_TORTURE_PIPE_LEN - 1; i >= 0; i--) {
653 if (pipesummary[i] != 0)
656 cnt += sprintf(&page[cnt], "%s%s ", torture_type, TORTURE_FLAG);
657 cnt += sprintf(&page[cnt],
658 "rtc: %p ver: %ld tfle: %d rta: %d rtaf: %d rtf: %d "
661 rcu_torture_current_version,
662 list_empty(&rcu_torture_freelist),
663 atomic_read(&n_rcu_torture_alloc),
664 atomic_read(&n_rcu_torture_alloc_fail),
665 atomic_read(&n_rcu_torture_free),
666 atomic_read(&n_rcu_torture_mberror));
667 if (atomic_read(&n_rcu_torture_mberror) != 0)
668 cnt += sprintf(&page[cnt], " !!!");
669 cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG);
671 cnt += sprintf(&page[cnt], "!!! ");
672 atomic_inc(&n_rcu_torture_error);
674 cnt += sprintf(&page[cnt], "Reader Pipe: ");
675 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++)
676 cnt += sprintf(&page[cnt], " %ld", pipesummary[i]);
677 cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG);
678 cnt += sprintf(&page[cnt], "Reader Batch: ");
679 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++)
680 cnt += sprintf(&page[cnt], " %ld", batchsummary[i]);
681 cnt += sprintf(&page[cnt], "\n%s%s ", torture_type, TORTURE_FLAG);
682 cnt += sprintf(&page[cnt], "Free-Block Circulation: ");
683 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
684 cnt += sprintf(&page[cnt], " %d",
685 atomic_read(&rcu_torture_wcount[i]));
687 cnt += sprintf(&page[cnt], "\n");
688 if (cur_ops->stats != NULL)
689 cnt += cur_ops->stats(&page[cnt]);
694 * Print torture statistics. Caller must ensure that there is only
695 * one call to this function at a given time!!! This is normally
696 * accomplished by relying on the module system to only have one copy
697 * of the module loaded, and then by giving the rcu_torture_stats
698 * kthread full control (or the init/cleanup functions when rcu_torture_stats
699 * thread is not running).
702 rcu_torture_stats_print(void)
706 cnt = rcu_torture_printk(printk_buf);
707 printk(KERN_ALERT "%s", printk_buf);
711 * Periodically prints torture statistics, if periodic statistics printing
712 * was specified via the stat_interval module parameter.
714 * No need to worry about fullstop here, since this one doesn't reference
715 * volatile state or register callbacks.
718 rcu_torture_stats(void *arg)
720 VERBOSE_PRINTK_STRING("rcu_torture_stats task started");
722 schedule_timeout_interruptible(stat_interval * HZ);
723 rcu_torture_stats_print();
724 } while (!kthread_should_stop());
725 VERBOSE_PRINTK_STRING("rcu_torture_stats task stopping");
729 static int rcu_idle_cpu; /* Force all torture tasks off this CPU */
731 /* Shuffle tasks such that we allow @rcu_idle_cpu to become idle. A special case
732 * is when @rcu_idle_cpu = -1, when we allow the tasks to run on all CPUs.
734 static void rcu_torture_shuffle_tasks(void)
736 cpumask_t tmp_mask = CPU_MASK_ALL;
741 /* No point in shuffling if there is only one online CPU (ex: UP) */
742 if (num_online_cpus() == 1) {
743 unlock_cpu_hotplug();
747 if (rcu_idle_cpu != -1)
748 cpu_clear(rcu_idle_cpu, tmp_mask);
750 set_cpus_allowed(current, tmp_mask);
752 if (reader_tasks != NULL) {
753 for (i = 0; i < nrealreaders; i++)
755 set_cpus_allowed(reader_tasks[i], tmp_mask);
758 if (fakewriter_tasks != NULL) {
759 for (i = 0; i < nfakewriters; i++)
760 if (fakewriter_tasks[i])
761 set_cpus_allowed(fakewriter_tasks[i], tmp_mask);
765 set_cpus_allowed(writer_task, tmp_mask);
768 set_cpus_allowed(stats_task, tmp_mask);
770 if (rcu_idle_cpu == -1)
771 rcu_idle_cpu = num_online_cpus() - 1;
775 unlock_cpu_hotplug();
778 /* Shuffle tasks across CPUs, with the intent of allowing each CPU in the
779 * system to become idle at a time and cut off its timer ticks. This is meant
780 * to test the support for such tickless idle CPU in RCU.
783 rcu_torture_shuffle(void *arg)
785 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task started");
787 schedule_timeout_interruptible(shuffle_interval * HZ);
788 rcu_torture_shuffle_tasks();
789 } while (!kthread_should_stop());
790 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task stopping");
795 rcu_torture_print_module_parms(char *tag)
797 printk(KERN_ALERT "%s" TORTURE_FLAG
798 "--- %s: nreaders=%d nfakewriters=%d "
799 "stat_interval=%d verbose=%d test_no_idle_hz=%d "
800 "shuffle_interval = %d\n",
801 torture_type, tag, nrealreaders, nfakewriters,
802 stat_interval, verbose, test_no_idle_hz, shuffle_interval);
806 rcu_torture_cleanup(void)
811 if (shuffler_task != NULL) {
812 VERBOSE_PRINTK_STRING("Stopping rcu_torture_shuffle task");
813 kthread_stop(shuffler_task);
815 shuffler_task = NULL;
817 if (writer_task != NULL) {
818 VERBOSE_PRINTK_STRING("Stopping rcu_torture_writer task");
819 kthread_stop(writer_task);
823 if (reader_tasks != NULL) {
824 for (i = 0; i < nrealreaders; i++) {
825 if (reader_tasks[i] != NULL) {
826 VERBOSE_PRINTK_STRING(
827 "Stopping rcu_torture_reader task");
828 kthread_stop(reader_tasks[i]);
830 reader_tasks[i] = NULL;
835 rcu_torture_current = NULL;
837 if (fakewriter_tasks != NULL) {
838 for (i = 0; i < nfakewriters; i++) {
839 if (fakewriter_tasks[i] != NULL) {
840 VERBOSE_PRINTK_STRING(
841 "Stopping rcu_torture_fakewriter task");
842 kthread_stop(fakewriter_tasks[i]);
844 fakewriter_tasks[i] = NULL;
846 kfree(fakewriter_tasks);
847 fakewriter_tasks = NULL;
850 if (stats_task != NULL) {
851 VERBOSE_PRINTK_STRING("Stopping rcu_torture_stats task");
852 kthread_stop(stats_task);
856 /* Wait for all RCU callbacks to fire. */
859 rcu_torture_stats_print(); /* -After- the stats thread is stopped! */
861 if (cur_ops->cleanup != NULL)
863 if (atomic_read(&n_rcu_torture_error))
864 rcu_torture_print_module_parms("End of test: FAILURE");
866 rcu_torture_print_module_parms("End of test: SUCCESS");
870 rcu_torture_init(void)
876 /* Process args and tell the world that the torturer is on the job. */
878 for (i = 0; cur_ops = torture_ops[i], cur_ops != NULL; i++) {
879 cur_ops = torture_ops[i];
880 if (strcmp(torture_type, cur_ops->name) == 0) {
884 if (cur_ops == NULL) {
885 printk(KERN_ALERT "rcutorture: invalid torture type: \"%s\"\n",
889 if (cur_ops->init != NULL)
890 cur_ops->init(); /* no "goto unwind" prior to this point!!! */
893 nrealreaders = nreaders;
895 nrealreaders = 2 * num_online_cpus();
896 rcu_torture_print_module_parms("Start of test");
899 /* Set up the freelist. */
901 INIT_LIST_HEAD(&rcu_torture_freelist);
902 for (i = 0; i < sizeof(rcu_tortures) / sizeof(rcu_tortures[0]); i++) {
903 rcu_tortures[i].rtort_mbtest = 0;
904 list_add_tail(&rcu_tortures[i].rtort_free,
905 &rcu_torture_freelist);
908 /* Initialize the statistics so that each run gets its own numbers. */
910 rcu_torture_current = NULL;
911 rcu_torture_current_version = 0;
912 atomic_set(&n_rcu_torture_alloc, 0);
913 atomic_set(&n_rcu_torture_alloc_fail, 0);
914 atomic_set(&n_rcu_torture_free, 0);
915 atomic_set(&n_rcu_torture_mberror, 0);
916 atomic_set(&n_rcu_torture_error, 0);
917 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++)
918 atomic_set(&rcu_torture_wcount[i], 0);
919 for_each_possible_cpu(cpu) {
920 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
921 per_cpu(rcu_torture_count, cpu)[i] = 0;
922 per_cpu(rcu_torture_batch, cpu)[i] = 0;
926 /* Start up the kthreads. */
928 VERBOSE_PRINTK_STRING("Creating rcu_torture_writer task");
929 writer_task = kthread_run(rcu_torture_writer, NULL,
930 "rcu_torture_writer");
931 if (IS_ERR(writer_task)) {
932 firsterr = PTR_ERR(writer_task);
933 VERBOSE_PRINTK_ERRSTRING("Failed to create writer");
937 fakewriter_tasks = kzalloc(nfakewriters * sizeof(fakewriter_tasks[0]),
939 if (fakewriter_tasks == NULL) {
940 VERBOSE_PRINTK_ERRSTRING("out of memory");
944 for (i = 0; i < nfakewriters; i++) {
945 VERBOSE_PRINTK_STRING("Creating rcu_torture_fakewriter task");
946 fakewriter_tasks[i] = kthread_run(rcu_torture_fakewriter, NULL,
947 "rcu_torture_fakewriter");
948 if (IS_ERR(fakewriter_tasks[i])) {
949 firsterr = PTR_ERR(fakewriter_tasks[i]);
950 VERBOSE_PRINTK_ERRSTRING("Failed to create fakewriter");
951 fakewriter_tasks[i] = NULL;
955 reader_tasks = kzalloc(nrealreaders * sizeof(reader_tasks[0]),
957 if (reader_tasks == NULL) {
958 VERBOSE_PRINTK_ERRSTRING("out of memory");
962 for (i = 0; i < nrealreaders; i++) {
963 VERBOSE_PRINTK_STRING("Creating rcu_torture_reader task");
964 reader_tasks[i] = kthread_run(rcu_torture_reader, NULL,
965 "rcu_torture_reader");
966 if (IS_ERR(reader_tasks[i])) {
967 firsterr = PTR_ERR(reader_tasks[i]);
968 VERBOSE_PRINTK_ERRSTRING("Failed to create reader");
969 reader_tasks[i] = NULL;
973 if (stat_interval > 0) {
974 VERBOSE_PRINTK_STRING("Creating rcu_torture_stats task");
975 stats_task = kthread_run(rcu_torture_stats, NULL,
976 "rcu_torture_stats");
977 if (IS_ERR(stats_task)) {
978 firsterr = PTR_ERR(stats_task);
979 VERBOSE_PRINTK_ERRSTRING("Failed to create stats");
984 if (test_no_idle_hz) {
985 rcu_idle_cpu = num_online_cpus() - 1;
986 /* Create the shuffler thread */
987 shuffler_task = kthread_run(rcu_torture_shuffle, NULL,
988 "rcu_torture_shuffle");
989 if (IS_ERR(shuffler_task)) {
990 firsterr = PTR_ERR(shuffler_task);
991 VERBOSE_PRINTK_ERRSTRING("Failed to create shuffler");
992 shuffler_task = NULL;
999 rcu_torture_cleanup();
1003 module_init(rcu_torture_init);
1004 module_exit(rcu_torture_cleanup);