[PATCH] avoid unaligned access when accessing poll stack
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / kernel / rcutorture.c
blob8154e7589d1284a7f96b1aa3b587ab2ffc01c299
1 /*
2 * Read-Copy Update /proc-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
20 * Authors: Paul E. McKenney <paulmck@us.ibm.com>
22 * See also: Documentation/RCU/torture.txt
24 #include <linux/types.h>
25 #include <linux/kernel.h>
26 #include <linux/init.h>
27 #include <linux/module.h>
28 #include <linux/kthread.h>
29 #include <linux/err.h>
30 #include <linux/spinlock.h>
31 #include <linux/smp.h>
32 #include <linux/rcupdate.h>
33 #include <linux/interrupt.h>
34 #include <linux/sched.h>
35 #include <asm/atomic.h>
36 #include <linux/bitops.h>
37 #include <linux/module.h>
38 #include <linux/completion.h>
39 #include <linux/moduleparam.h>
40 #include <linux/percpu.h>
41 #include <linux/notifier.h>
42 #include <linux/cpu.h>
43 #include <linux/random.h>
44 #include <linux/delay.h>
45 #include <linux/byteorder/swabb.h>
46 #include <linux/stat.h>
48 MODULE_LICENSE("GPL");
50 static int nreaders = -1; /* # reader threads, defaults to 4*ncpus */
51 static int stat_interval; /* Interval between stats, in seconds. */
52 /* Defaults to "only at end of test". */
53 static int verbose; /* Print more debug info. */
54 static int test_no_idle_hz; /* Test RCU's support for tickless idle CPUs. */
55 static int shuffle_interval = 5; /* Interval between shuffles (in sec)*/
57 module_param(nreaders, int, 0);
58 MODULE_PARM_DESC(nreaders, "Number of RCU reader threads");
59 module_param(stat_interval, int, 0);
60 MODULE_PARM_DESC(stat_interval, "Number of seconds between stats printk()s");
61 module_param(verbose, bool, 0);
62 MODULE_PARM_DESC(verbose, "Enable verbose debugging printk()s");
63 module_param(test_no_idle_hz, bool, 0);
64 MODULE_PARM_DESC(test_no_idle_hz, "Test support for tickless idle CPUs");
65 module_param(shuffle_interval, int, 0);
66 MODULE_PARM_DESC(shuffle_interval, "Number of seconds between shuffles");
67 #define TORTURE_FLAG "rcutorture: "
68 #define PRINTK_STRING(s) \
69 do { printk(KERN_ALERT TORTURE_FLAG s "\n"); } while (0)
70 #define VERBOSE_PRINTK_STRING(s) \
71 do { if (verbose) printk(KERN_ALERT TORTURE_FLAG s "\n"); } while (0)
72 #define VERBOSE_PRINTK_ERRSTRING(s) \
73 do { if (verbose) printk(KERN_ALERT TORTURE_FLAG "!!! " s "\n"); } while (0)
75 static char printk_buf[4096];
77 static int nrealreaders;
78 static struct task_struct *writer_task;
79 static struct task_struct **reader_tasks;
80 static struct task_struct *stats_task;
81 static struct task_struct *shuffler_task;
83 #define RCU_TORTURE_PIPE_LEN 10
85 struct rcu_torture {
86 struct rcu_head rtort_rcu;
87 int rtort_pipe_count;
88 struct list_head rtort_free;
89 int rtort_mbtest;
92 static int fullstop = 0; /* stop generating callbacks at test end. */
93 static LIST_HEAD(rcu_torture_freelist);
94 static struct rcu_torture *rcu_torture_current = NULL;
95 static long rcu_torture_current_version = 0;
96 static struct rcu_torture rcu_tortures[10 * RCU_TORTURE_PIPE_LEN];
97 static DEFINE_SPINLOCK(rcu_torture_lock);
98 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_count) =
99 { 0 };
100 static DEFINE_PER_CPU(long [RCU_TORTURE_PIPE_LEN + 1], rcu_torture_batch) =
101 { 0 };
102 static atomic_t rcu_torture_wcount[RCU_TORTURE_PIPE_LEN + 1];
103 atomic_t n_rcu_torture_alloc;
104 atomic_t n_rcu_torture_alloc_fail;
105 atomic_t n_rcu_torture_free;
106 atomic_t n_rcu_torture_mberror;
107 atomic_t n_rcu_torture_error;
110 * Allocate an element from the rcu_tortures pool.
112 static struct rcu_torture *
113 rcu_torture_alloc(void)
115 struct list_head *p;
117 spin_lock_bh(&rcu_torture_lock);
118 if (list_empty(&rcu_torture_freelist)) {
119 atomic_inc(&n_rcu_torture_alloc_fail);
120 spin_unlock_bh(&rcu_torture_lock);
121 return NULL;
123 atomic_inc(&n_rcu_torture_alloc);
124 p = rcu_torture_freelist.next;
125 list_del_init(p);
126 spin_unlock_bh(&rcu_torture_lock);
127 return container_of(p, struct rcu_torture, rtort_free);
131 * Free an element to the rcu_tortures pool.
133 static void
134 rcu_torture_free(struct rcu_torture *p)
136 atomic_inc(&n_rcu_torture_free);
137 spin_lock_bh(&rcu_torture_lock);
138 list_add_tail(&p->rtort_free, &rcu_torture_freelist);
139 spin_unlock_bh(&rcu_torture_lock);
142 static void
143 rcu_torture_cb(struct rcu_head *p)
145 int i;
146 struct rcu_torture *rp = container_of(p, struct rcu_torture, rtort_rcu);
148 if (fullstop) {
149 /* Test is ending, just drop callbacks on the floor. */
150 /* The next initialization will pick up the pieces. */
151 return;
153 i = rp->rtort_pipe_count;
154 if (i > RCU_TORTURE_PIPE_LEN)
155 i = RCU_TORTURE_PIPE_LEN;
156 atomic_inc(&rcu_torture_wcount[i]);
157 if (++rp->rtort_pipe_count >= RCU_TORTURE_PIPE_LEN) {
158 rp->rtort_mbtest = 0;
159 rcu_torture_free(rp);
160 } else
161 call_rcu(p, rcu_torture_cb);
164 struct rcu_random_state {
165 unsigned long rrs_state;
166 unsigned long rrs_count;
169 #define RCU_RANDOM_MULT 39916801 /* prime */
170 #define RCU_RANDOM_ADD 479001701 /* prime */
171 #define RCU_RANDOM_REFRESH 10000
173 #define DEFINE_RCU_RANDOM(name) struct rcu_random_state name = { 0, 0 }
176 * Crude but fast random-number generator. Uses a linear congruential
177 * generator, with occasional help from get_random_bytes().
179 static long
180 rcu_random(struct rcu_random_state *rrsp)
182 long refresh;
184 if (--rrsp->rrs_count < 0) {
185 get_random_bytes(&refresh, sizeof(refresh));
186 rrsp->rrs_state += refresh;
187 rrsp->rrs_count = RCU_RANDOM_REFRESH;
189 rrsp->rrs_state = rrsp->rrs_state * RCU_RANDOM_MULT + RCU_RANDOM_ADD;
190 return swahw32(rrsp->rrs_state);
194 * RCU torture writer kthread. Repeatedly substitutes a new structure
195 * for that pointed to by rcu_torture_current, freeing the old structure
196 * after a series of grace periods (the "pipeline").
198 static int
199 rcu_torture_writer(void *arg)
201 int i;
202 long oldbatch = rcu_batches_completed();
203 struct rcu_torture *rp;
204 struct rcu_torture *old_rp;
205 static DEFINE_RCU_RANDOM(rand);
207 VERBOSE_PRINTK_STRING("rcu_torture_writer task started");
208 set_user_nice(current, 19);
210 do {
211 schedule_timeout_uninterruptible(1);
212 if (rcu_batches_completed() == oldbatch)
213 continue;
214 if ((rp = rcu_torture_alloc()) == NULL)
215 continue;
216 rp->rtort_pipe_count = 0;
217 udelay(rcu_random(&rand) & 0x3ff);
218 old_rp = rcu_torture_current;
219 rp->rtort_mbtest = 1;
220 rcu_assign_pointer(rcu_torture_current, rp);
221 smp_wmb();
222 if (old_rp != NULL) {
223 i = old_rp->rtort_pipe_count;
224 if (i > RCU_TORTURE_PIPE_LEN)
225 i = RCU_TORTURE_PIPE_LEN;
226 atomic_inc(&rcu_torture_wcount[i]);
227 old_rp->rtort_pipe_count++;
228 call_rcu(&old_rp->rtort_rcu, rcu_torture_cb);
230 rcu_torture_current_version++;
231 oldbatch = rcu_batches_completed();
232 } while (!kthread_should_stop() && !fullstop);
233 VERBOSE_PRINTK_STRING("rcu_torture_writer task stopping");
234 while (!kthread_should_stop())
235 schedule_timeout_uninterruptible(1);
236 return 0;
240 * RCU torture reader kthread. Repeatedly dereferences rcu_torture_current,
241 * incrementing the corresponding element of the pipeline array. The
242 * counter in the element should never be greater than 1, otherwise, the
243 * RCU implementation is broken.
245 static int
246 rcu_torture_reader(void *arg)
248 int completed;
249 DEFINE_RCU_RANDOM(rand);
250 struct rcu_torture *p;
251 int pipe_count;
253 VERBOSE_PRINTK_STRING("rcu_torture_reader task started");
254 set_user_nice(current, 19);
256 do {
257 rcu_read_lock();
258 completed = rcu_batches_completed();
259 p = rcu_dereference(rcu_torture_current);
260 if (p == NULL) {
261 /* Wait for rcu_torture_writer to get underway */
262 rcu_read_unlock();
263 schedule_timeout_interruptible(HZ);
264 continue;
266 if (p->rtort_mbtest == 0)
267 atomic_inc(&n_rcu_torture_mberror);
268 udelay(rcu_random(&rand) & 0x7f);
269 preempt_disable();
270 pipe_count = p->rtort_pipe_count;
271 if (pipe_count > RCU_TORTURE_PIPE_LEN) {
272 /* Should not happen, but... */
273 pipe_count = RCU_TORTURE_PIPE_LEN;
275 ++__get_cpu_var(rcu_torture_count)[pipe_count];
276 completed = rcu_batches_completed() - completed;
277 if (completed > RCU_TORTURE_PIPE_LEN) {
278 /* Should not happen, but... */
279 completed = RCU_TORTURE_PIPE_LEN;
281 ++__get_cpu_var(rcu_torture_batch)[completed];
282 preempt_enable();
283 rcu_read_unlock();
284 schedule();
285 } while (!kthread_should_stop() && !fullstop);
286 VERBOSE_PRINTK_STRING("rcu_torture_reader task stopping");
287 while (!kthread_should_stop())
288 schedule_timeout_uninterruptible(1);
289 return 0;
293 * Create an RCU-torture statistics message in the specified buffer.
295 static int
296 rcu_torture_printk(char *page)
298 int cnt = 0;
299 int cpu;
300 int i;
301 long pipesummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 };
302 long batchsummary[RCU_TORTURE_PIPE_LEN + 1] = { 0 };
304 for_each_possible_cpu(cpu) {
305 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
306 pipesummary[i] += per_cpu(rcu_torture_count, cpu)[i];
307 batchsummary[i] += per_cpu(rcu_torture_batch, cpu)[i];
310 for (i = RCU_TORTURE_PIPE_LEN - 1; i >= 0; i--) {
311 if (pipesummary[i] != 0)
312 break;
314 cnt += sprintf(&page[cnt], "rcutorture: ");
315 cnt += sprintf(&page[cnt],
316 "rtc: %p ver: %ld tfle: %d rta: %d rtaf: %d rtf: %d "
317 "rtmbe: %d",
318 rcu_torture_current,
319 rcu_torture_current_version,
320 list_empty(&rcu_torture_freelist),
321 atomic_read(&n_rcu_torture_alloc),
322 atomic_read(&n_rcu_torture_alloc_fail),
323 atomic_read(&n_rcu_torture_free),
324 atomic_read(&n_rcu_torture_mberror));
325 if (atomic_read(&n_rcu_torture_mberror) != 0)
326 cnt += sprintf(&page[cnt], " !!!");
327 cnt += sprintf(&page[cnt], "\nrcutorture: ");
328 if (i > 1) {
329 cnt += sprintf(&page[cnt], "!!! ");
330 atomic_inc(&n_rcu_torture_error);
332 cnt += sprintf(&page[cnt], "Reader Pipe: ");
333 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++)
334 cnt += sprintf(&page[cnt], " %ld", pipesummary[i]);
335 cnt += sprintf(&page[cnt], "\nrcutorture: ");
336 cnt += sprintf(&page[cnt], "Reader Batch: ");
337 for (i = 0; i < RCU_TORTURE_PIPE_LEN; i++)
338 cnt += sprintf(&page[cnt], " %ld", batchsummary[i]);
339 cnt += sprintf(&page[cnt], "\nrcutorture: ");
340 cnt += sprintf(&page[cnt], "Free-Block Circulation: ");
341 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
342 cnt += sprintf(&page[cnt], " %d",
343 atomic_read(&rcu_torture_wcount[i]));
345 cnt += sprintf(&page[cnt], "\n");
346 return cnt;
350 * Print torture statistics. Caller must ensure that there is only
351 * one call to this function at a given time!!! This is normally
352 * accomplished by relying on the module system to only have one copy
353 * of the module loaded, and then by giving the rcu_torture_stats
354 * kthread full control (or the init/cleanup functions when rcu_torture_stats
355 * thread is not running).
357 static void
358 rcu_torture_stats_print(void)
360 int cnt;
362 cnt = rcu_torture_printk(printk_buf);
363 printk(KERN_ALERT "%s", printk_buf);
367 * Periodically prints torture statistics, if periodic statistics printing
368 * was specified via the stat_interval module parameter.
370 * No need to worry about fullstop here, since this one doesn't reference
371 * volatile state or register callbacks.
373 static int
374 rcu_torture_stats(void *arg)
376 VERBOSE_PRINTK_STRING("rcu_torture_stats task started");
377 do {
378 schedule_timeout_interruptible(stat_interval * HZ);
379 rcu_torture_stats_print();
380 } while (!kthread_should_stop());
381 VERBOSE_PRINTK_STRING("rcu_torture_stats task stopping");
382 return 0;
385 static int rcu_idle_cpu; /* Force all torture tasks off this CPU */
387 /* Shuffle tasks such that we allow @rcu_idle_cpu to become idle. A special case
388 * is when @rcu_idle_cpu = -1, when we allow the tasks to run on all CPUs.
390 void rcu_torture_shuffle_tasks(void)
392 cpumask_t tmp_mask = CPU_MASK_ALL;
393 int i;
395 lock_cpu_hotplug();
397 /* No point in shuffling if there is only one online CPU (ex: UP) */
398 if (num_online_cpus() == 1) {
399 unlock_cpu_hotplug();
400 return;
403 if (rcu_idle_cpu != -1)
404 cpu_clear(rcu_idle_cpu, tmp_mask);
406 set_cpus_allowed(current, tmp_mask);
408 if (reader_tasks != NULL) {
409 for (i = 0; i < nrealreaders; i++)
410 if (reader_tasks[i])
411 set_cpus_allowed(reader_tasks[i], tmp_mask);
414 if (writer_task)
415 set_cpus_allowed(writer_task, tmp_mask);
417 if (stats_task)
418 set_cpus_allowed(stats_task, tmp_mask);
420 if (rcu_idle_cpu == -1)
421 rcu_idle_cpu = num_online_cpus() - 1;
422 else
423 rcu_idle_cpu--;
425 unlock_cpu_hotplug();
428 /* Shuffle tasks across CPUs, with the intent of allowing each CPU in the
429 * system to become idle at a time and cut off its timer ticks. This is meant
430 * to test the support for such tickless idle CPU in RCU.
432 static int
433 rcu_torture_shuffle(void *arg)
435 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task started");
436 do {
437 schedule_timeout_interruptible(shuffle_interval * HZ);
438 rcu_torture_shuffle_tasks();
439 } while (!kthread_should_stop());
440 VERBOSE_PRINTK_STRING("rcu_torture_shuffle task stopping");
441 return 0;
444 static inline void
445 rcu_torture_print_module_parms(char *tag)
447 printk(KERN_ALERT TORTURE_FLAG "--- %s: nreaders=%d "
448 "stat_interval=%d verbose=%d test_no_idle_hz=%d "
449 "shuffle_interval = %d\n",
450 tag, nrealreaders, stat_interval, verbose, test_no_idle_hz,
451 shuffle_interval);
454 static void
455 rcu_torture_cleanup(void)
457 int i;
459 fullstop = 1;
460 if (shuffler_task != NULL) {
461 VERBOSE_PRINTK_STRING("Stopping rcu_torture_shuffle task");
462 kthread_stop(shuffler_task);
464 shuffler_task = NULL;
466 if (writer_task != NULL) {
467 VERBOSE_PRINTK_STRING("Stopping rcu_torture_writer task");
468 kthread_stop(writer_task);
470 writer_task = NULL;
472 if (reader_tasks != NULL) {
473 for (i = 0; i < nrealreaders; i++) {
474 if (reader_tasks[i] != NULL) {
475 VERBOSE_PRINTK_STRING(
476 "Stopping rcu_torture_reader task");
477 kthread_stop(reader_tasks[i]);
479 reader_tasks[i] = NULL;
481 kfree(reader_tasks);
482 reader_tasks = NULL;
484 rcu_torture_current = NULL;
486 if (stats_task != NULL) {
487 VERBOSE_PRINTK_STRING("Stopping rcu_torture_stats task");
488 kthread_stop(stats_task);
490 stats_task = NULL;
492 /* Wait for all RCU callbacks to fire. */
493 rcu_barrier();
495 rcu_torture_stats_print(); /* -After- the stats thread is stopped! */
496 if (atomic_read(&n_rcu_torture_error))
497 rcu_torture_print_module_parms("End of test: FAILURE");
498 else
499 rcu_torture_print_module_parms("End of test: SUCCESS");
502 static int
503 rcu_torture_init(void)
505 int i;
506 int cpu;
507 int firsterr = 0;
509 /* Process args and tell the world that the torturer is on the job. */
511 if (nreaders >= 0)
512 nrealreaders = nreaders;
513 else
514 nrealreaders = 2 * num_online_cpus();
515 rcu_torture_print_module_parms("Start of test");
516 fullstop = 0;
518 /* Set up the freelist. */
520 INIT_LIST_HEAD(&rcu_torture_freelist);
521 for (i = 0; i < sizeof(rcu_tortures) / sizeof(rcu_tortures[0]); i++) {
522 rcu_tortures[i].rtort_mbtest = 0;
523 list_add_tail(&rcu_tortures[i].rtort_free,
524 &rcu_torture_freelist);
527 /* Initialize the statistics so that each run gets its own numbers. */
529 rcu_torture_current = NULL;
530 rcu_torture_current_version = 0;
531 atomic_set(&n_rcu_torture_alloc, 0);
532 atomic_set(&n_rcu_torture_alloc_fail, 0);
533 atomic_set(&n_rcu_torture_free, 0);
534 atomic_set(&n_rcu_torture_mberror, 0);
535 atomic_set(&n_rcu_torture_error, 0);
536 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++)
537 atomic_set(&rcu_torture_wcount[i], 0);
538 for_each_possible_cpu(cpu) {
539 for (i = 0; i < RCU_TORTURE_PIPE_LEN + 1; i++) {
540 per_cpu(rcu_torture_count, cpu)[i] = 0;
541 per_cpu(rcu_torture_batch, cpu)[i] = 0;
545 /* Start up the kthreads. */
547 VERBOSE_PRINTK_STRING("Creating rcu_torture_writer task");
548 writer_task = kthread_run(rcu_torture_writer, NULL,
549 "rcu_torture_writer");
550 if (IS_ERR(writer_task)) {
551 firsterr = PTR_ERR(writer_task);
552 VERBOSE_PRINTK_ERRSTRING("Failed to create writer");
553 writer_task = NULL;
554 goto unwind;
556 reader_tasks = kmalloc(nrealreaders * sizeof(reader_tasks[0]),
557 GFP_KERNEL);
558 if (reader_tasks == NULL) {
559 VERBOSE_PRINTK_ERRSTRING("out of memory");
560 firsterr = -ENOMEM;
561 goto unwind;
563 for (i = 0; i < nrealreaders; i++) {
564 VERBOSE_PRINTK_STRING("Creating rcu_torture_reader task");
565 reader_tasks[i] = kthread_run(rcu_torture_reader, NULL,
566 "rcu_torture_reader");
567 if (IS_ERR(reader_tasks[i])) {
568 firsterr = PTR_ERR(reader_tasks[i]);
569 VERBOSE_PRINTK_ERRSTRING("Failed to create reader");
570 reader_tasks[i] = NULL;
571 goto unwind;
574 if (stat_interval > 0) {
575 VERBOSE_PRINTK_STRING("Creating rcu_torture_stats task");
576 stats_task = kthread_run(rcu_torture_stats, NULL,
577 "rcu_torture_stats");
578 if (IS_ERR(stats_task)) {
579 firsterr = PTR_ERR(stats_task);
580 VERBOSE_PRINTK_ERRSTRING("Failed to create stats");
581 stats_task = NULL;
582 goto unwind;
585 if (test_no_idle_hz) {
586 rcu_idle_cpu = num_online_cpus() - 1;
587 /* Create the shuffler thread */
588 shuffler_task = kthread_run(rcu_torture_shuffle, NULL,
589 "rcu_torture_shuffle");
590 if (IS_ERR(shuffler_task)) {
591 firsterr = PTR_ERR(shuffler_task);
592 VERBOSE_PRINTK_ERRSTRING("Failed to create shuffler");
593 shuffler_task = NULL;
594 goto unwind;
597 return 0;
599 unwind:
600 rcu_torture_cleanup();
601 return firsterr;
604 module_init(rcu_torture_init);
605 module_exit(rcu_torture_cleanup);