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/completion.h>
39 #include <linux/moduleparam.h>
40 #include <linux/percpu.h>
41 #include <linux/notifier.h>
42 #include <linux/freezer.h>
43 #include <linux/cpu.h>
44 #include <linux/delay.h>
45 #include <linux/byteorder/swabb.h>
46 #include <linux/stat.h>
47 #include <linux/srcu.h>
49 MODULE_LICENSE("GPL");
50 MODULE_AUTHOR("Paul E. McKenney <paulmck@us.ibm.com> and "
51 "Josh Triplett <josh@freedesktop.org>");
53 static int nreaders
= -1; /* # reader threads, defaults to 2*ncpus */
54 static int nfakewriters
= 4; /* # fake writer threads */
55 static int stat_interval
; /* Interval between stats, in seconds. */
56 /* Defaults to "only at end of test". */
57 static int verbose
; /* Print more debug info. */
58 static int test_no_idle_hz
; /* Test RCU's support for tickless idle CPUs. */
59 static int shuffle_interval
= 5; /* Interval between shuffles (in sec)*/
60 static char *torture_type
= "rcu"; /* What RCU implementation to torture. */
62 module_param(nreaders
, int, 0444);
63 MODULE_PARM_DESC(nreaders
, "Number of RCU reader threads");
64 module_param(nfakewriters
, int, 0444);
65 MODULE_PARM_DESC(nfakewriters
, "Number of RCU fake writer threads");
66 module_param(stat_interval
, int, 0444);
67 MODULE_PARM_DESC(stat_interval
, "Number of seconds between stats printk()s");
68 module_param(verbose
, bool, 0444);
69 MODULE_PARM_DESC(verbose
, "Enable verbose debugging printk()s");
70 module_param(test_no_idle_hz
, bool, 0444);
71 MODULE_PARM_DESC(test_no_idle_hz
, "Test support for tickless idle CPUs");
72 module_param(shuffle_interval
, int, 0444);
73 MODULE_PARM_DESC(shuffle_interval
, "Number of seconds between shuffles");
74 module_param(torture_type
, charp
, 0444);
75 MODULE_PARM_DESC(torture_type
, "Type of RCU to torture (rcu, rcu_bh, srcu)");
77 #define TORTURE_FLAG "-torture:"
78 #define PRINTK_STRING(s) \
79 do { printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)
80 #define VERBOSE_PRINTK_STRING(s) \
81 do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG s "\n", torture_type); } while (0)
82 #define VERBOSE_PRINTK_ERRSTRING(s) \
83 do { if (verbose) printk(KERN_ALERT "%s" TORTURE_FLAG "!!! " s "\n", torture_type); } while (0)
85 static char printk_buf
[4096];
87 static int nrealreaders
;
88 static struct task_struct
*writer_task
;
89 static struct task_struct
**fakewriter_tasks
;
90 static struct task_struct
**reader_tasks
;
91 static struct task_struct
*stats_task
;
92 static struct task_struct
*shuffler_task
;
94 #define RCU_TORTURE_PIPE_LEN 10
97 struct rcu_head rtort_rcu
;
99 struct list_head rtort_free
;
103 static int fullstop
= 0; /* stop generating callbacks at test end. */
104 static LIST_HEAD(rcu_torture_freelist
);
105 static struct rcu_torture
*rcu_torture_current
= NULL
;
106 static long rcu_torture_current_version
= 0;
107 static struct rcu_torture rcu_tortures
[10 * RCU_TORTURE_PIPE_LEN
];
108 static DEFINE_SPINLOCK(rcu_torture_lock
);
109 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN
+ 1], rcu_torture_count
) =
111 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN
+ 1], rcu_torture_batch
) =
113 static atomic_t rcu_torture_wcount
[RCU_TORTURE_PIPE_LEN
+ 1];
114 static atomic_t n_rcu_torture_alloc
;
115 static atomic_t n_rcu_torture_alloc_fail
;
116 static atomic_t n_rcu_torture_free
;
117 static atomic_t n_rcu_torture_mberror
;
118 static atomic_t n_rcu_torture_error
;
119 static struct list_head rcu_torture_removed
;
122 * Allocate an element from the rcu_tortures pool.
124 static struct rcu_torture
*
125 rcu_torture_alloc(void)
129 spin_lock_bh(&rcu_torture_lock
);
130 if (list_empty(&rcu_torture_freelist
)) {
131 atomic_inc(&n_rcu_torture_alloc_fail
);
132 spin_unlock_bh(&rcu_torture_lock
);
135 atomic_inc(&n_rcu_torture_alloc
);
136 p
= rcu_torture_freelist
.next
;
138 spin_unlock_bh(&rcu_torture_lock
);
139 return container_of(p
, struct rcu_torture
, rtort_free
);
143 * Free an element to the rcu_tortures pool.
146 rcu_torture_free(struct rcu_torture
*p
)
148 atomic_inc(&n_rcu_torture_free
);
149 spin_lock_bh(&rcu_torture_lock
);
150 list_add_tail(&p
->rtort_free
, &rcu_torture_freelist
);
151 spin_unlock_bh(&rcu_torture_lock
);
154 struct rcu_random_state
{
155 unsigned long rrs_state
;
159 #define RCU_RANDOM_MULT 39916801 /* prime */
160 #define RCU_RANDOM_ADD 479001701 /* prime */
161 #define RCU_RANDOM_REFRESH 10000
163 #define DEFINE_RCU_RANDOM(name) struct rcu_random_state name = { 0, 0 }
166 * Crude but fast random-number generator. Uses a linear congruential
167 * generator, with occasional help from cpu_clock().
170 rcu_random(struct rcu_random_state
*rrsp
)
172 if (--rrsp
->rrs_count
< 0) {
174 (unsigned long)cpu_clock(raw_smp_processor_id());
175 rrsp
->rrs_count
= RCU_RANDOM_REFRESH
;
177 rrsp
->rrs_state
= rrsp
->rrs_state
* RCU_RANDOM_MULT
+ RCU_RANDOM_ADD
;
178 return swahw32(rrsp
->rrs_state
);
182 * Operations vector for selecting different types of tests.
185 struct rcu_torture_ops
{
187 void (*cleanup
)(void);
188 int (*readlock
)(void);
189 void (*readdelay
)(struct rcu_random_state
*rrsp
);
190 void (*readunlock
)(int idx
);
191 int (*completed
)(void);
192 void (*deferredfree
)(struct rcu_torture
*p
);
194 int (*stats
)(char *page
);
197 static struct rcu_torture_ops
*cur_ops
= NULL
;
200 * Definitions for rcu torture testing.
203 static int rcu_torture_read_lock(void) __acquires(RCU
)
209 static void rcu_read_delay(struct rcu_random_state
*rrsp
)
212 const long longdelay
= 200;
214 /* We want there to be long-running readers, but not all the time. */
216 delay
= rcu_random(rrsp
) % (nrealreaders
* 2 * longdelay
);
221 static void rcu_torture_read_unlock(int idx
) __releases(RCU
)
226 static int rcu_torture_completed(void)
228 return rcu_batches_completed();
232 rcu_torture_cb(struct rcu_head
*p
)
235 struct rcu_torture
*rp
= container_of(p
, struct rcu_torture
, rtort_rcu
);
238 /* Test is ending, just drop callbacks on the floor. */
239 /* The next initialization will pick up the pieces. */
242 i
= rp
->rtort_pipe_count
;
243 if (i
> RCU_TORTURE_PIPE_LEN
)
244 i
= RCU_TORTURE_PIPE_LEN
;
245 atomic_inc(&rcu_torture_wcount
[i
]);
246 if (++rp
->rtort_pipe_count
>= RCU_TORTURE_PIPE_LEN
) {
247 rp
->rtort_mbtest
= 0;
248 rcu_torture_free(rp
);
250 cur_ops
->deferredfree(rp
);
253 static void rcu_torture_deferred_free(struct rcu_torture
*p
)
255 call_rcu(&p
->rtort_rcu
, rcu_torture_cb
);
258 static struct rcu_torture_ops rcu_ops
= {
261 .readlock
= rcu_torture_read_lock
,
262 .readdelay
= rcu_read_delay
,
263 .readunlock
= rcu_torture_read_unlock
,
264 .completed
= rcu_torture_completed
,
265 .deferredfree
= rcu_torture_deferred_free
,
266 .sync
= synchronize_rcu
,
271 static void rcu_sync_torture_deferred_free(struct rcu_torture
*p
)
274 struct rcu_torture
*rp
;
275 struct rcu_torture
*rp1
;
278 list_add(&p
->rtort_free
, &rcu_torture_removed
);
279 list_for_each_entry_safe(rp
, rp1
, &rcu_torture_removed
, rtort_free
) {
280 i
= rp
->rtort_pipe_count
;
281 if (i
> RCU_TORTURE_PIPE_LEN
)
282 i
= RCU_TORTURE_PIPE_LEN
;
283 atomic_inc(&rcu_torture_wcount
[i
]);
284 if (++rp
->rtort_pipe_count
>= RCU_TORTURE_PIPE_LEN
) {
285 rp
->rtort_mbtest
= 0;
286 list_del(&rp
->rtort_free
);
287 rcu_torture_free(rp
);
292 static void rcu_sync_torture_init(void)
294 INIT_LIST_HEAD(&rcu_torture_removed
);
297 static struct rcu_torture_ops rcu_sync_ops
= {
298 .init
= rcu_sync_torture_init
,
300 .readlock
= rcu_torture_read_lock
,
301 .readdelay
= rcu_read_delay
,
302 .readunlock
= rcu_torture_read_unlock
,
303 .completed
= rcu_torture_completed
,
304 .deferredfree
= rcu_sync_torture_deferred_free
,
305 .sync
= synchronize_rcu
,
311 * Definitions for rcu_bh torture testing.
314 static int rcu_bh_torture_read_lock(void) __acquires(RCU_BH
)
320 static void rcu_bh_torture_read_unlock(int idx
) __releases(RCU_BH
)
322 rcu_read_unlock_bh();
325 static int rcu_bh_torture_completed(void)
327 return rcu_batches_completed_bh();
330 static void rcu_bh_torture_deferred_free(struct rcu_torture
*p
)
332 call_rcu_bh(&p
->rtort_rcu
, rcu_torture_cb
);
335 struct rcu_bh_torture_synchronize
{
336 struct rcu_head head
;
337 struct completion completion
;
340 static void rcu_bh_torture_wakeme_after_cb(struct rcu_head
*head
)
342 struct rcu_bh_torture_synchronize
*rcu
;
344 rcu
= container_of(head
, struct rcu_bh_torture_synchronize
, head
);
345 complete(&rcu
->completion
);
348 static void rcu_bh_torture_synchronize(void)
350 struct rcu_bh_torture_synchronize rcu
;
352 init_completion(&rcu
.completion
);
353 call_rcu_bh(&rcu
.head
, rcu_bh_torture_wakeme_after_cb
);
354 wait_for_completion(&rcu
.completion
);
357 static struct rcu_torture_ops rcu_bh_ops
= {
360 .readlock
= rcu_bh_torture_read_lock
,
361 .readdelay
= rcu_read_delay
, /* just reuse rcu's version. */
362 .readunlock
= rcu_bh_torture_read_unlock
,
363 .completed
= rcu_bh_torture_completed
,
364 .deferredfree
= rcu_bh_torture_deferred_free
,
365 .sync
= rcu_bh_torture_synchronize
,
370 static struct rcu_torture_ops rcu_bh_sync_ops
= {
371 .init
= rcu_sync_torture_init
,
373 .readlock
= rcu_bh_torture_read_lock
,
374 .readdelay
= rcu_read_delay
, /* just reuse rcu's version. */
375 .readunlock
= rcu_bh_torture_read_unlock
,
376 .completed
= rcu_bh_torture_completed
,
377 .deferredfree
= rcu_sync_torture_deferred_free
,
378 .sync
= rcu_bh_torture_synchronize
,
380 .name
= "rcu_bh_sync"
384 * Definitions for srcu torture testing.
387 static struct srcu_struct srcu_ctl
;
389 static void srcu_torture_init(void)
391 init_srcu_struct(&srcu_ctl
);
392 rcu_sync_torture_init();
395 static void srcu_torture_cleanup(void)
397 synchronize_srcu(&srcu_ctl
);
398 cleanup_srcu_struct(&srcu_ctl
);
401 static int srcu_torture_read_lock(void) __acquires(&srcu_ctl
)
403 return srcu_read_lock(&srcu_ctl
);
406 static void srcu_read_delay(struct rcu_random_state
*rrsp
)
409 const long uspertick
= 1000000 / HZ
;
410 const long longdelay
= 10;
412 /* We want there to be long-running readers, but not all the time. */
414 delay
= rcu_random(rrsp
) % (nrealreaders
* 2 * longdelay
* uspertick
);
416 schedule_timeout_interruptible(longdelay
);
419 static void srcu_torture_read_unlock(int idx
) __releases(&srcu_ctl
)
421 srcu_read_unlock(&srcu_ctl
, idx
);
424 static int srcu_torture_completed(void)
426 return srcu_batches_completed(&srcu_ctl
);
429 static void srcu_torture_synchronize(void)
431 synchronize_srcu(&srcu_ctl
);
434 static int srcu_torture_stats(char *page
)
438 int idx
= srcu_ctl
.completed
& 0x1;
440 cnt
+= sprintf(&page
[cnt
], "%s%s per-CPU(idx=%d):",
441 torture_type
, TORTURE_FLAG
, idx
);
442 for_each_possible_cpu(cpu
) {
443 cnt
+= sprintf(&page
[cnt
], " %d(%d,%d)", cpu
,
444 per_cpu_ptr(srcu_ctl
.per_cpu_ref
, cpu
)->c
[!idx
],
445 per_cpu_ptr(srcu_ctl
.per_cpu_ref
, cpu
)->c
[idx
]);
447 cnt
+= sprintf(&page
[cnt
], "\n");
451 static struct rcu_torture_ops srcu_ops
= {
452 .init
= srcu_torture_init
,
453 .cleanup
= srcu_torture_cleanup
,
454 .readlock
= srcu_torture_read_lock
,
455 .readdelay
= srcu_read_delay
,
456 .readunlock
= srcu_torture_read_unlock
,
457 .completed
= srcu_torture_completed
,
458 .deferredfree
= rcu_sync_torture_deferred_free
,
459 .sync
= srcu_torture_synchronize
,
460 .stats
= srcu_torture_stats
,
465 * Definitions for sched torture testing.
468 static int sched_torture_read_lock(void)
474 static void sched_torture_read_unlock(int idx
)
479 static int sched_torture_completed(void)
484 static void sched_torture_synchronize(void)
489 static struct rcu_torture_ops sched_ops
= {
490 .init
= rcu_sync_torture_init
,
492 .readlock
= sched_torture_read_lock
,
493 .readdelay
= rcu_read_delay
, /* just reuse rcu's version. */
494 .readunlock
= sched_torture_read_unlock
,
495 .completed
= sched_torture_completed
,
496 .deferredfree
= rcu_sync_torture_deferred_free
,
497 .sync
= sched_torture_synchronize
,
503 * RCU torture writer kthread. Repeatedly substitutes a new structure
504 * for that pointed to by rcu_torture_current, freeing the old structure
505 * after a series of grace periods (the "pipeline").
508 rcu_torture_writer(void *arg
)
511 long oldbatch
= rcu_batches_completed();
512 struct rcu_torture
*rp
;
513 struct rcu_torture
*old_rp
;
514 static DEFINE_RCU_RANDOM(rand
);
516 VERBOSE_PRINTK_STRING("rcu_torture_writer task started");
517 set_user_nice(current
, 19);
520 schedule_timeout_uninterruptible(1);
521 if ((rp
= rcu_torture_alloc()) == NULL
)
523 rp
->rtort_pipe_count
= 0;
524 udelay(rcu_random(&rand
) & 0x3ff);
525 old_rp
= rcu_torture_current
;
526 rp
->rtort_mbtest
= 1;
527 rcu_assign_pointer(rcu_torture_current
, rp
);
530 i
= old_rp
->rtort_pipe_count
;
531 if (i
> RCU_TORTURE_PIPE_LEN
)
532 i
= RCU_TORTURE_PIPE_LEN
;
533 atomic_inc(&rcu_torture_wcount
[i
]);
534 old_rp
->rtort_pipe_count
++;
535 cur_ops
->deferredfree(old_rp
);
537 rcu_torture_current_version
++;
538 oldbatch
= cur_ops
->completed();
539 } while (!kthread_should_stop() && !fullstop
);
540 VERBOSE_PRINTK_STRING("rcu_torture_writer task stopping");
541 while (!kthread_should_stop())
542 schedule_timeout_uninterruptible(1);
547 * RCU torture fake writer kthread. Repeatedly calls sync, with a random
548 * delay between calls.
551 rcu_torture_fakewriter(void *arg
)
553 DEFINE_RCU_RANDOM(rand
);
555 VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task started");
556 set_user_nice(current
, 19);
559 schedule_timeout_uninterruptible(1 + rcu_random(&rand
)%10);
560 udelay(rcu_random(&rand
) & 0x3ff);
562 } while (!kthread_should_stop() && !fullstop
);
564 VERBOSE_PRINTK_STRING("rcu_torture_fakewriter task stopping");
565 while (!kthread_should_stop())
566 schedule_timeout_uninterruptible(1);
571 * RCU torture reader kthread. Repeatedly dereferences rcu_torture_current,
572 * incrementing the corresponding element of the pipeline array. The
573 * counter in the element should never be greater than 1, otherwise, the
574 * RCU implementation is broken.
577 rcu_torture_reader(void *arg
)
581 DEFINE_RCU_RANDOM(rand
);
582 struct rcu_torture
*p
;
585 VERBOSE_PRINTK_STRING("rcu_torture_reader task started");
586 set_user_nice(current
, 19);
589 idx
= cur_ops
->readlock();
590 completed
= cur_ops
->completed();
591 p
= rcu_dereference(rcu_torture_current
);
593 /* Wait for rcu_torture_writer to get underway */
594 cur_ops
->readunlock(idx
);
595 schedule_timeout_interruptible(HZ
);
598 if (p
->rtort_mbtest
== 0)
599 atomic_inc(&n_rcu_torture_mberror
);
600 cur_ops
->readdelay(&rand
);
602 pipe_count
= p
->rtort_pipe_count
;
603 if (pipe_count
> RCU_TORTURE_PIPE_LEN
) {
604 /* Should not happen, but... */
605 pipe_count
= RCU_TORTURE_PIPE_LEN
;
607 ++__get_cpu_var(rcu_torture_count
)[pipe_count
];
608 completed
= cur_ops
->completed() - completed
;
609 if (completed
> RCU_TORTURE_PIPE_LEN
) {
610 /* Should not happen, but... */
611 completed
= RCU_TORTURE_PIPE_LEN
;
613 ++__get_cpu_var(rcu_torture_batch
)[completed
];
615 cur_ops
->readunlock(idx
);
617 } while (!kthread_should_stop() && !fullstop
);
618 VERBOSE_PRINTK_STRING("rcu_torture_reader task stopping");
619 while (!kthread_should_stop())
620 schedule_timeout_uninterruptible(1);
625 * Create an RCU-torture statistics message in the specified buffer.
628 rcu_torture_printk(char *page
)
633 long pipesummary
[RCU_TORTURE_PIPE_LEN
+ 1] = { 0 };
634 long batchsummary
[RCU_TORTURE_PIPE_LEN
+ 1] = { 0 };
636 for_each_possible_cpu(cpu
) {
637 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++) {
638 pipesummary
[i
] += per_cpu(rcu_torture_count
, cpu
)[i
];
639 batchsummary
[i
] += per_cpu(rcu_torture_batch
, cpu
)[i
];
642 for (i
= RCU_TORTURE_PIPE_LEN
- 1; i
>= 0; i
--) {
643 if (pipesummary
[i
] != 0)
646 cnt
+= sprintf(&page
[cnt
], "%s%s ", torture_type
, TORTURE_FLAG
);
647 cnt
+= sprintf(&page
[cnt
],
648 "rtc: %p ver: %ld tfle: %d rta: %d rtaf: %d rtf: %d "
651 rcu_torture_current_version
,
652 list_empty(&rcu_torture_freelist
),
653 atomic_read(&n_rcu_torture_alloc
),
654 atomic_read(&n_rcu_torture_alloc_fail
),
655 atomic_read(&n_rcu_torture_free
),
656 atomic_read(&n_rcu_torture_mberror
));
657 if (atomic_read(&n_rcu_torture_mberror
) != 0)
658 cnt
+= sprintf(&page
[cnt
], " !!!");
659 cnt
+= sprintf(&page
[cnt
], "\n%s%s ", torture_type
, TORTURE_FLAG
);
661 cnt
+= sprintf(&page
[cnt
], "!!! ");
662 atomic_inc(&n_rcu_torture_error
);
664 cnt
+= sprintf(&page
[cnt
], "Reader Pipe: ");
665 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++)
666 cnt
+= sprintf(&page
[cnt
], " %ld", pipesummary
[i
]);
667 cnt
+= sprintf(&page
[cnt
], "\n%s%s ", torture_type
, TORTURE_FLAG
);
668 cnt
+= sprintf(&page
[cnt
], "Reader Batch: ");
669 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++)
670 cnt
+= sprintf(&page
[cnt
], " %ld", batchsummary
[i
]);
671 cnt
+= sprintf(&page
[cnt
], "\n%s%s ", torture_type
, TORTURE_FLAG
);
672 cnt
+= sprintf(&page
[cnt
], "Free-Block Circulation: ");
673 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++) {
674 cnt
+= sprintf(&page
[cnt
], " %d",
675 atomic_read(&rcu_torture_wcount
[i
]));
677 cnt
+= sprintf(&page
[cnt
], "\n");
679 cnt
+= cur_ops
->stats(&page
[cnt
]);
684 * Print torture statistics. Caller must ensure that there is only
685 * one call to this function at a given time!!! This is normally
686 * accomplished by relying on the module system to only have one copy
687 * of the module loaded, and then by giving the rcu_torture_stats
688 * kthread full control (or the init/cleanup functions when rcu_torture_stats
689 * thread is not running).
692 rcu_torture_stats_print(void)
696 cnt
= rcu_torture_printk(printk_buf
);
697 printk(KERN_ALERT
"%s", printk_buf
);
701 * Periodically prints torture statistics, if periodic statistics printing
702 * was specified via the stat_interval module parameter.
704 * No need to worry about fullstop here, since this one doesn't reference
705 * volatile state or register callbacks.
708 rcu_torture_stats(void *arg
)
710 VERBOSE_PRINTK_STRING("rcu_torture_stats task started");
712 schedule_timeout_interruptible(stat_interval
* HZ
);
713 rcu_torture_stats_print();
714 } while (!kthread_should_stop());
715 VERBOSE_PRINTK_STRING("rcu_torture_stats task stopping");
719 static int rcu_idle_cpu
; /* Force all torture tasks off this CPU */
721 /* Shuffle tasks such that we allow @rcu_idle_cpu to become idle. A special case
722 * is when @rcu_idle_cpu = -1, when we allow the tasks to run on all CPUs.
724 static void rcu_torture_shuffle_tasks(void)
726 cpumask_t tmp_mask
= CPU_MASK_ALL
;
731 /* No point in shuffling if there is only one online CPU (ex: UP) */
732 if (num_online_cpus() == 1) {
733 unlock_cpu_hotplug();
737 if (rcu_idle_cpu
!= -1)
738 cpu_clear(rcu_idle_cpu
, tmp_mask
);
740 set_cpus_allowed(current
, tmp_mask
);
743 for (i
= 0; i
< nrealreaders
; i
++)
745 set_cpus_allowed(reader_tasks
[i
], tmp_mask
);
748 if (fakewriter_tasks
) {
749 for (i
= 0; i
< nfakewriters
; i
++)
750 if (fakewriter_tasks
[i
])
751 set_cpus_allowed(fakewriter_tasks
[i
], tmp_mask
);
755 set_cpus_allowed(writer_task
, tmp_mask
);
758 set_cpus_allowed(stats_task
, tmp_mask
);
760 if (rcu_idle_cpu
== -1)
761 rcu_idle_cpu
= num_online_cpus() - 1;
765 unlock_cpu_hotplug();
768 /* Shuffle tasks across CPUs, with the intent of allowing each CPU in the
769 * system to become idle at a time and cut off its timer ticks. This is meant
770 * to test the support for such tickless idle CPU in RCU.
773 rcu_torture_shuffle(void *arg
)
775 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task started");
777 schedule_timeout_interruptible(shuffle_interval
* HZ
);
778 rcu_torture_shuffle_tasks();
779 } while (!kthread_should_stop());
780 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task stopping");
785 rcu_torture_print_module_parms(char *tag
)
787 printk(KERN_ALERT
"%s" TORTURE_FLAG
788 "--- %s: nreaders=%d nfakewriters=%d "
789 "stat_interval=%d verbose=%d test_no_idle_hz=%d "
790 "shuffle_interval = %d\n",
791 torture_type
, tag
, nrealreaders
, nfakewriters
,
792 stat_interval
, verbose
, test_no_idle_hz
, shuffle_interval
);
796 rcu_torture_cleanup(void)
802 VERBOSE_PRINTK_STRING("Stopping rcu_torture_shuffle task");
803 kthread_stop(shuffler_task
);
805 shuffler_task
= NULL
;
808 VERBOSE_PRINTK_STRING("Stopping rcu_torture_writer task");
809 kthread_stop(writer_task
);
814 for (i
= 0; i
< nrealreaders
; i
++) {
815 if (reader_tasks
[i
]) {
816 VERBOSE_PRINTK_STRING(
817 "Stopping rcu_torture_reader task");
818 kthread_stop(reader_tasks
[i
]);
820 reader_tasks
[i
] = NULL
;
825 rcu_torture_current
= NULL
;
827 if (fakewriter_tasks
) {
828 for (i
= 0; i
< nfakewriters
; i
++) {
829 if (fakewriter_tasks
[i
]) {
830 VERBOSE_PRINTK_STRING(
831 "Stopping rcu_torture_fakewriter task");
832 kthread_stop(fakewriter_tasks
[i
]);
834 fakewriter_tasks
[i
] = NULL
;
836 kfree(fakewriter_tasks
);
837 fakewriter_tasks
= NULL
;
841 VERBOSE_PRINTK_STRING("Stopping rcu_torture_stats task");
842 kthread_stop(stats_task
);
846 /* Wait for all RCU callbacks to fire. */
849 rcu_torture_stats_print(); /* -After- the stats thread is stopped! */
851 if (cur_ops
->cleanup
)
853 if (atomic_read(&n_rcu_torture_error
))
854 rcu_torture_print_module_parms("End of test: FAILURE");
856 rcu_torture_print_module_parms("End of test: SUCCESS");
860 rcu_torture_init(void)
865 static struct rcu_torture_ops
*torture_ops
[] =
866 { &rcu_ops
, &rcu_sync_ops
, &rcu_bh_ops
, &rcu_bh_sync_ops
,
867 &srcu_ops
, &sched_ops
, };
869 /* Process args and tell the world that the torturer is on the job. */
870 for (i
= 0; i
< ARRAY_SIZE(torture_ops
); i
++) {
871 cur_ops
= torture_ops
[i
];
872 if (strcmp(torture_type
, cur_ops
->name
) == 0)
875 if (i
== ARRAY_SIZE(torture_ops
)) {
876 printk(KERN_ALERT
"rcutorture: invalid torture type: \"%s\"\n",
881 cur_ops
->init(); /* no "goto unwind" prior to this point!!! */
884 nrealreaders
= nreaders
;
886 nrealreaders
= 2 * num_online_cpus();
887 rcu_torture_print_module_parms("Start of test");
890 /* Set up the freelist. */
892 INIT_LIST_HEAD(&rcu_torture_freelist
);
893 for (i
= 0; i
< ARRAY_SIZE(rcu_tortures
); i
++) {
894 rcu_tortures
[i
].rtort_mbtest
= 0;
895 list_add_tail(&rcu_tortures
[i
].rtort_free
,
896 &rcu_torture_freelist
);
899 /* Initialize the statistics so that each run gets its own numbers. */
901 rcu_torture_current
= NULL
;
902 rcu_torture_current_version
= 0;
903 atomic_set(&n_rcu_torture_alloc
, 0);
904 atomic_set(&n_rcu_torture_alloc_fail
, 0);
905 atomic_set(&n_rcu_torture_free
, 0);
906 atomic_set(&n_rcu_torture_mberror
, 0);
907 atomic_set(&n_rcu_torture_error
, 0);
908 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++)
909 atomic_set(&rcu_torture_wcount
[i
], 0);
910 for_each_possible_cpu(cpu
) {
911 for (i
= 0; i
< RCU_TORTURE_PIPE_LEN
+ 1; i
++) {
912 per_cpu(rcu_torture_count
, cpu
)[i
] = 0;
913 per_cpu(rcu_torture_batch
, cpu
)[i
] = 0;
917 /* Start up the kthreads. */
919 VERBOSE_PRINTK_STRING("Creating rcu_torture_writer task");
920 writer_task
= kthread_run(rcu_torture_writer
, NULL
,
921 "rcu_torture_writer");
922 if (IS_ERR(writer_task
)) {
923 firsterr
= PTR_ERR(writer_task
);
924 VERBOSE_PRINTK_ERRSTRING("Failed to create writer");
928 fakewriter_tasks
= kzalloc(nfakewriters
* sizeof(fakewriter_tasks
[0]),
930 if (fakewriter_tasks
== NULL
) {
931 VERBOSE_PRINTK_ERRSTRING("out of memory");
935 for (i
= 0; i
< nfakewriters
; i
++) {
936 VERBOSE_PRINTK_STRING("Creating rcu_torture_fakewriter task");
937 fakewriter_tasks
[i
] = kthread_run(rcu_torture_fakewriter
, NULL
,
938 "rcu_torture_fakewriter");
939 if (IS_ERR(fakewriter_tasks
[i
])) {
940 firsterr
= PTR_ERR(fakewriter_tasks
[i
]);
941 VERBOSE_PRINTK_ERRSTRING("Failed to create fakewriter");
942 fakewriter_tasks
[i
] = NULL
;
946 reader_tasks
= kzalloc(nrealreaders
* sizeof(reader_tasks
[0]),
948 if (reader_tasks
== NULL
) {
949 VERBOSE_PRINTK_ERRSTRING("out of memory");
953 for (i
= 0; i
< nrealreaders
; i
++) {
954 VERBOSE_PRINTK_STRING("Creating rcu_torture_reader task");
955 reader_tasks
[i
] = kthread_run(rcu_torture_reader
, NULL
,
956 "rcu_torture_reader");
957 if (IS_ERR(reader_tasks
[i
])) {
958 firsterr
= PTR_ERR(reader_tasks
[i
]);
959 VERBOSE_PRINTK_ERRSTRING("Failed to create reader");
960 reader_tasks
[i
] = NULL
;
964 if (stat_interval
> 0) {
965 VERBOSE_PRINTK_STRING("Creating rcu_torture_stats task");
966 stats_task
= kthread_run(rcu_torture_stats
, NULL
,
967 "rcu_torture_stats");
968 if (IS_ERR(stats_task
)) {
969 firsterr
= PTR_ERR(stats_task
);
970 VERBOSE_PRINTK_ERRSTRING("Failed to create stats");
975 if (test_no_idle_hz
) {
976 rcu_idle_cpu
= num_online_cpus() - 1;
977 /* Create the shuffler thread */
978 shuffler_task
= kthread_run(rcu_torture_shuffle
, NULL
,
979 "rcu_torture_shuffle");
980 if (IS_ERR(shuffler_task
)) {
981 firsterr
= PTR_ERR(shuffler_task
);
982 VERBOSE_PRINTK_ERRSTRING("Failed to create shuffler");
983 shuffler_task
= NULL
;
990 rcu_torture_cleanup();
994 module_init(rcu_torture_init
);
995 module_exit(rcu_torture_cleanup
);