rcutiny.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325
  1. /*
  2. * Read-Copy Update mechanism for mutual exclusion, the Bloatwatch edition.
  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 IBM Corporation, 2008
  19. *
  20. * Author: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
  21. *
  22. * For detailed explanation of Read-Copy Update mechanism see -
  23. * Documentation/RCU
  24. */
  25. #include <linux/moduleparam.h>
  26. #include <linux/completion.h>
  27. #include <linux/interrupt.h>
  28. #include <linux/notifier.h>
  29. #include <linux/rcupdate.h>
  30. #include <linux/kernel.h>
  31. #include <linux/module.h>
  32. #include <linux/mutex.h>
  33. #include <linux/sched.h>
  34. #include <linux/types.h>
  35. #include <linux/init.h>
  36. #include <linux/time.h>
  37. #include <linux/cpu.h>
  38. #include <linux/prefetch.h>
  39. /* Controls for rcu_kthread() kthread, replacing RCU_SOFTIRQ used previously. */
  40. static struct task_struct *rcu_kthread_task;
  41. static DECLARE_WAIT_QUEUE_HEAD(rcu_kthread_wq);
  42. static unsigned long have_rcu_kthread_work;
  43. /* Forward declarations for rcutiny_plugin.h. */
  44. struct rcu_ctrlblk;
  45. static void invoke_rcu_kthread(void);
  46. static void rcu_process_callbacks(struct rcu_ctrlblk *rcp);
  47. static int rcu_kthread(void *arg);
  48. static void __call_rcu(struct rcu_head *head,
  49. void (*func)(struct rcu_head *rcu),
  50. struct rcu_ctrlblk *rcp);
  51. #include "rcutiny_plugin.h"
  52. #ifdef CONFIG_NO_HZ
  53. static long rcu_dynticks_nesting = 1;
  54. /*
  55. * Enter dynticks-idle mode, which is an extended quiescent state
  56. * if we have fully entered that mode (i.e., if the new value of
  57. * dynticks_nesting is zero).
  58. */
  59. void rcu_enter_nohz(void)
  60. {
  61. if (--rcu_dynticks_nesting == 0)
  62. rcu_sched_qs(0); /* implies rcu_bh_qsctr_inc(0) */
  63. }
  64. /*
  65. * Exit dynticks-idle mode, so that we are no longer in an extended
  66. * quiescent state.
  67. */
  68. void rcu_exit_nohz(void)
  69. {
  70. rcu_dynticks_nesting++;
  71. }
  72. #endif /* #ifdef CONFIG_NO_HZ */
  73. /*
  74. * Helper function for rcu_sched_qs() and rcu_bh_qs().
  75. * Also irqs are disabled to avoid confusion due to interrupt handlers
  76. * invoking call_rcu().
  77. */
  78. static int rcu_qsctr_help(struct rcu_ctrlblk *rcp)
  79. {
  80. if (rcp->rcucblist != NULL &&
  81. rcp->donetail != rcp->curtail) {
  82. rcp->donetail = rcp->curtail;
  83. return 1;
  84. }
  85. return 0;
  86. }
  87. /*
  88. * Wake up rcu_kthread() to process callbacks now eligible for invocation
  89. * or to boost readers.
  90. */
  91. static void invoke_rcu_kthread(void)
  92. {
  93. have_rcu_kthread_work = 1;
  94. wake_up(&rcu_kthread_wq);
  95. }
  96. /*
  97. * Record an rcu quiescent state. And an rcu_bh quiescent state while we
  98. * are at it, given that any rcu quiescent state is also an rcu_bh
  99. * quiescent state. Use "+" instead of "||" to defeat short circuiting.
  100. */
  101. void rcu_sched_qs(int cpu)
  102. {
  103. unsigned long flags;
  104. local_irq_save(flags);
  105. if (rcu_qsctr_help(&rcu_sched_ctrlblk) +
  106. rcu_qsctr_help(&rcu_bh_ctrlblk))
  107. invoke_rcu_kthread();
  108. local_irq_restore(flags);
  109. }
  110. /*
  111. * Record an rcu_bh quiescent state.
  112. */
  113. void rcu_bh_qs(int cpu)
  114. {
  115. unsigned long flags;
  116. local_irq_save(flags);
  117. if (rcu_qsctr_help(&rcu_bh_ctrlblk))
  118. invoke_rcu_kthread();
  119. local_irq_restore(flags);
  120. }
  121. /*
  122. * Check to see if the scheduling-clock interrupt came from an extended
  123. * quiescent state, and, if so, tell RCU about it.
  124. */
  125. void rcu_check_callbacks(int cpu, int user)
  126. {
  127. if (user ||
  128. (idle_cpu(cpu) &&
  129. !in_softirq() &&
  130. hardirq_count() <= (1 << HARDIRQ_SHIFT)))
  131. rcu_sched_qs(cpu);
  132. else if (!in_softirq())
  133. rcu_bh_qs(cpu);
  134. rcu_preempt_check_callbacks();
  135. }
  136. /*
  137. * Invoke the RCU callbacks on the specified rcu_ctrlkblk structure
  138. * whose grace period has elapsed.
  139. */
  140. static void rcu_process_callbacks(struct rcu_ctrlblk *rcp)
  141. {
  142. struct rcu_head *next, *list;
  143. unsigned long flags;
  144. RCU_TRACE(int cb_count = 0);
  145. /* If no RCU callbacks ready to invoke, just return. */
  146. if (&rcp->rcucblist == rcp->donetail)
  147. return;
  148. /* Move the ready-to-invoke callbacks to a local list. */
  149. local_irq_save(flags);
  150. list = rcp->rcucblist;
  151. rcp->rcucblist = *rcp->donetail;
  152. *rcp->donetail = NULL;
  153. if (rcp->curtail == rcp->donetail)
  154. rcp->curtail = &rcp->rcucblist;
  155. rcu_preempt_remove_callbacks(rcp);
  156. rcp->donetail = &rcp->rcucblist;
  157. local_irq_restore(flags);
  158. /* Invoke the callbacks on the local list. */
  159. while (list) {
  160. next = list->next;
  161. prefetch(next);
  162. debug_rcu_head_unqueue(list);
  163. local_bh_disable();
  164. __rcu_reclaim(list);
  165. local_bh_enable();
  166. list = next;
  167. RCU_TRACE(cb_count++);
  168. }
  169. RCU_TRACE(rcu_trace_sub_qlen(rcp, cb_count));
  170. }
  171. /*
  172. * This kthread invokes RCU callbacks whose grace periods have
  173. * elapsed. It is awakened as needed, and takes the place of the
  174. * RCU_SOFTIRQ that was used previously for this purpose.
  175. * This is a kthread, but it is never stopped, at least not until
  176. * the system goes down.
  177. */
  178. static int rcu_kthread(void *arg)
  179. {
  180. unsigned long work;
  181. unsigned long morework;
  182. unsigned long flags;
  183. for (;;) {
  184. wait_event_interruptible(rcu_kthread_wq,
  185. have_rcu_kthread_work != 0);
  186. morework = rcu_boost();
  187. local_irq_save(flags);
  188. work = have_rcu_kthread_work;
  189. have_rcu_kthread_work = morework;
  190. local_irq_restore(flags);
  191. if (work) {
  192. rcu_process_callbacks(&rcu_sched_ctrlblk);
  193. rcu_process_callbacks(&rcu_bh_ctrlblk);
  194. rcu_preempt_process_callbacks();
  195. }
  196. schedule_timeout_interruptible(1); /* Leave CPU for others. */
  197. }
  198. return 0; /* Not reached, but needed to shut gcc up. */
  199. }
  200. /*
  201. * Wait for a grace period to elapse. But it is illegal to invoke
  202. * synchronize_sched() from within an RCU read-side critical section.
  203. * Therefore, any legal call to synchronize_sched() is a quiescent
  204. * state, and so on a UP system, synchronize_sched() need do nothing.
  205. * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
  206. * benefits of doing might_sleep() to reduce latency.)
  207. *
  208. * Cool, huh? (Due to Josh Triplett.)
  209. *
  210. * But we want to make this a static inline later. The cond_resched()
  211. * currently makes this problematic.
  212. */
  213. void synchronize_sched(void)
  214. {
  215. cond_resched();
  216. }
  217. EXPORT_SYMBOL_GPL(synchronize_sched);
  218. /*
  219. * Helper function for call_rcu() and call_rcu_bh().
  220. */
  221. static void __call_rcu(struct rcu_head *head,
  222. void (*func)(struct rcu_head *rcu),
  223. struct rcu_ctrlblk *rcp)
  224. {
  225. unsigned long flags;
  226. debug_rcu_head_queue(head);
  227. head->func = func;
  228. head->next = NULL;
  229. local_irq_save(flags);
  230. *rcp->curtail = head;
  231. rcp->curtail = &head->next;
  232. RCU_TRACE(rcp->qlen++);
  233. local_irq_restore(flags);
  234. }
  235. /*
  236. * Post an RCU callback to be invoked after the end of an RCU-sched grace
  237. * period. But since we have but one CPU, that would be after any
  238. * quiescent state.
  239. */
  240. void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  241. {
  242. __call_rcu(head, func, &rcu_sched_ctrlblk);
  243. }
  244. EXPORT_SYMBOL_GPL(call_rcu_sched);
  245. /*
  246. * Post an RCU bottom-half callback to be invoked after any subsequent
  247. * quiescent state.
  248. */
  249. void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  250. {
  251. __call_rcu(head, func, &rcu_bh_ctrlblk);
  252. }
  253. EXPORT_SYMBOL_GPL(call_rcu_bh);
  254. void rcu_barrier_bh(void)
  255. {
  256. struct rcu_synchronize rcu;
  257. init_rcu_head_on_stack(&rcu.head);
  258. init_completion(&rcu.completion);
  259. /* Will wake me after RCU finished. */
  260. call_rcu_bh(&rcu.head, wakeme_after_rcu);
  261. /* Wait for it. */
  262. wait_for_completion(&rcu.completion);
  263. destroy_rcu_head_on_stack(&rcu.head);
  264. }
  265. EXPORT_SYMBOL_GPL(rcu_barrier_bh);
  266. void rcu_barrier_sched(void)
  267. {
  268. struct rcu_synchronize rcu;
  269. init_rcu_head_on_stack(&rcu.head);
  270. init_completion(&rcu.completion);
  271. /* Will wake me after RCU finished. */
  272. call_rcu_sched(&rcu.head, wakeme_after_rcu);
  273. /* Wait for it. */
  274. wait_for_completion(&rcu.completion);
  275. destroy_rcu_head_on_stack(&rcu.head);
  276. }
  277. EXPORT_SYMBOL_GPL(rcu_barrier_sched);
  278. /*
  279. * Spawn the kthread that invokes RCU callbacks.
  280. */
  281. static int __init rcu_spawn_kthreads(void)
  282. {
  283. struct sched_param sp;
  284. rcu_kthread_task = kthread_run(rcu_kthread, NULL, "rcu_kthread");
  285. sp.sched_priority = RCU_BOOST_PRIO;
  286. sched_setscheduler_nocheck(rcu_kthread_task, SCHED_FIFO, &sp);
  287. return 0;
  288. }
  289. early_initcall(rcu_spawn_kthreads);