rcutorture.c 34 KB

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