rcutiny.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294
  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/types.h>
  26. #include <linux/kernel.h>
  27. #include <linux/init.h>
  28. #include <linux/rcupdate.h>
  29. #include <linux/interrupt.h>
  30. #include <linux/sched.h>
  31. #include <linux/module.h>
  32. #include <linux/completion.h>
  33. #include <linux/moduleparam.h>
  34. #include <linux/notifier.h>
  35. #include <linux/cpu.h>
  36. #include <linux/mutex.h>
  37. #include <linux/time.h>
  38. /* Global control variables for rcupdate callback mechanism. */
  39. struct rcu_ctrlblk {
  40. struct rcu_head *rcucblist; /* List of pending callbacks (CBs). */
  41. struct rcu_head **donetail; /* ->next pointer of last "done" CB. */
  42. struct rcu_head **curtail; /* ->next pointer of last CB. */
  43. };
  44. /* Definition for rcupdate control block. */
  45. static struct rcu_ctrlblk rcu_ctrlblk = {
  46. .rcucblist = NULL,
  47. .donetail = &rcu_ctrlblk.rcucblist,
  48. .curtail = &rcu_ctrlblk.rcucblist,
  49. };
  50. static struct rcu_ctrlblk rcu_bh_ctrlblk = {
  51. .rcucblist = NULL,
  52. .donetail = &rcu_bh_ctrlblk.rcucblist,
  53. .curtail = &rcu_bh_ctrlblk.rcucblist,
  54. };
  55. #ifdef CONFIG_NO_HZ
  56. static long rcu_dynticks_nesting = 1;
  57. /*
  58. * Enter dynticks-idle mode, which is an extended quiescent state
  59. * if we have fully entered that mode (i.e., if the new value of
  60. * dynticks_nesting is zero).
  61. */
  62. void rcu_enter_nohz(void)
  63. {
  64. if (--rcu_dynticks_nesting == 0)
  65. rcu_sched_qs(0); /* implies rcu_bh_qsctr_inc(0) */
  66. }
  67. /*
  68. * Exit dynticks-idle mode, so that we are no longer in an extended
  69. * quiescent state.
  70. */
  71. void rcu_exit_nohz(void)
  72. {
  73. rcu_dynticks_nesting++;
  74. }
  75. #endif /* #ifdef CONFIG_NO_HZ */
  76. /*
  77. * Helper function for rcu_qsctr_inc() and rcu_bh_qsctr_inc().
  78. * Also disable irqs to avoid confusion due to interrupt handlers invoking
  79. * call_rcu().
  80. */
  81. static int rcu_qsctr_help(struct rcu_ctrlblk *rcp)
  82. {
  83. unsigned long flags;
  84. local_irq_save(flags);
  85. if (rcp->rcucblist != NULL &&
  86. rcp->donetail != rcp->curtail) {
  87. rcp->donetail = rcp->curtail;
  88. local_irq_restore(flags);
  89. return 1;
  90. }
  91. local_irq_restore(flags);
  92. return 0;
  93. }
  94. /*
  95. * Record an rcu quiescent state. And an rcu_bh quiescent state while we
  96. * are at it, given that any rcu quiescent state is also an rcu_bh
  97. * quiescent state. Use "+" instead of "||" to defeat short circuiting.
  98. */
  99. void rcu_sched_qs(int cpu)
  100. {
  101. if (rcu_qsctr_help(&rcu_ctrlblk) + rcu_qsctr_help(&rcu_bh_ctrlblk))
  102. raise_softirq(RCU_SOFTIRQ);
  103. }
  104. /*
  105. * Record an rcu_bh quiescent state.
  106. */
  107. void rcu_bh_qs(int cpu)
  108. {
  109. if (rcu_qsctr_help(&rcu_bh_ctrlblk))
  110. raise_softirq(RCU_SOFTIRQ);
  111. }
  112. /*
  113. * Check to see if the scheduling-clock interrupt came from an extended
  114. * quiescent state, and, if so, tell RCU about it.
  115. */
  116. void rcu_check_callbacks(int cpu, int user)
  117. {
  118. if (user ||
  119. (idle_cpu(cpu) &&
  120. !in_softirq() &&
  121. hardirq_count() <= (1 << HARDIRQ_SHIFT)))
  122. rcu_sched_qs(cpu);
  123. else if (!in_softirq())
  124. rcu_bh_qs(cpu);
  125. }
  126. /*
  127. * Helper function for rcu_process_callbacks() that operates on the
  128. * specified rcu_ctrlkblk structure.
  129. */
  130. static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp)
  131. {
  132. unsigned long flags;
  133. struct rcu_head *next, *list;
  134. /* If no RCU callbacks ready to invoke, just return. */
  135. if (&rcp->rcucblist == rcp->donetail)
  136. return;
  137. /* Move the ready-to-invoke callbacks to a local list. */
  138. local_irq_save(flags);
  139. list = rcp->rcucblist;
  140. rcp->rcucblist = *rcp->donetail;
  141. *rcp->donetail = NULL;
  142. if (rcp->curtail == rcp->donetail)
  143. rcp->curtail = &rcp->rcucblist;
  144. rcp->donetail = &rcp->rcucblist;
  145. local_irq_restore(flags);
  146. /* Invoke the callbacks on the local list. */
  147. while (list) {
  148. next = list->next;
  149. prefetch(next);
  150. list->func(list);
  151. list = next;
  152. }
  153. }
  154. /*
  155. * Invoke any callbacks whose grace period has completed.
  156. */
  157. static void rcu_process_callbacks(struct softirq_action *unused)
  158. {
  159. __rcu_process_callbacks(&rcu_ctrlblk);
  160. __rcu_process_callbacks(&rcu_bh_ctrlblk);
  161. }
  162. /*
  163. * Null function to handle CPU being onlined. Longer term, we want to
  164. * make TINY_RCU avoid using rcupdate.c, but later...
  165. */
  166. int rcu_cpu_notify(struct notifier_block *self,
  167. unsigned long action, void *hcpu)
  168. {
  169. return NOTIFY_OK;
  170. }
  171. /*
  172. * Wait for a grace period to elapse. But it is illegal to invoke
  173. * synchronize_sched() from within an RCU read-side critical section.
  174. * Therefore, any legal call to synchronize_sched() is a quiescent
  175. * state, and so on a UP system, synchronize_sched() need do nothing.
  176. * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
  177. * benefits of doing might_sleep() to reduce latency.)
  178. *
  179. * Cool, huh? (Due to Josh Triplett.)
  180. *
  181. * But we want to make this a static inline later.
  182. */
  183. void synchronize_sched(void)
  184. {
  185. cond_resched();
  186. }
  187. EXPORT_SYMBOL_GPL(synchronize_sched);
  188. void synchronize_rcu_bh(void)
  189. {
  190. synchronize_sched();
  191. }
  192. EXPORT_SYMBOL_GPL(synchronize_rcu_bh);
  193. /*
  194. * Helper function for call_rcu() and call_rcu_bh().
  195. */
  196. static void __call_rcu(struct rcu_head *head,
  197. void (*func)(struct rcu_head *rcu),
  198. struct rcu_ctrlblk *rcp)
  199. {
  200. unsigned long flags;
  201. head->func = func;
  202. head->next = NULL;
  203. local_irq_save(flags);
  204. *rcp->curtail = head;
  205. rcp->curtail = &head->next;
  206. local_irq_restore(flags);
  207. }
  208. /*
  209. * Post an RCU callback to be invoked after the end of an RCU grace
  210. * period. But since we have but one CPU, that would be after any
  211. * quiescent state.
  212. */
  213. void call_rcu(struct rcu_head *head,
  214. void (*func)(struct rcu_head *rcu))
  215. {
  216. __call_rcu(head, func, &rcu_ctrlblk);
  217. }
  218. EXPORT_SYMBOL_GPL(call_rcu);
  219. /*
  220. * Post an RCU bottom-half callback to be invoked after any subsequent
  221. * quiescent state.
  222. */
  223. void call_rcu_bh(struct rcu_head *head,
  224. void (*func)(struct rcu_head *rcu))
  225. {
  226. __call_rcu(head, func, &rcu_bh_ctrlblk);
  227. }
  228. EXPORT_SYMBOL_GPL(call_rcu_bh);
  229. void rcu_barrier(void)
  230. {
  231. struct rcu_synchronize rcu;
  232. init_completion(&rcu.completion);
  233. /* Will wake me after RCU finished. */
  234. call_rcu(&rcu.head, wakeme_after_rcu);
  235. /* Wait for it. */
  236. wait_for_completion(&rcu.completion);
  237. }
  238. EXPORT_SYMBOL_GPL(rcu_barrier);
  239. void rcu_barrier_bh(void)
  240. {
  241. struct rcu_synchronize rcu;
  242. init_completion(&rcu.completion);
  243. /* Will wake me after RCU finished. */
  244. call_rcu_bh(&rcu.head, wakeme_after_rcu);
  245. /* Wait for it. */
  246. wait_for_completion(&rcu.completion);
  247. }
  248. EXPORT_SYMBOL_GPL(rcu_barrier_bh);
  249. void rcu_barrier_sched(void)
  250. {
  251. struct rcu_synchronize rcu;
  252. init_completion(&rcu.completion);
  253. /* Will wake me after RCU finished. */
  254. call_rcu_sched(&rcu.head, wakeme_after_rcu);
  255. /* Wait for it. */
  256. wait_for_completion(&rcu.completion);
  257. }
  258. EXPORT_SYMBOL_GPL(rcu_barrier_sched);
  259. void __rcu_init(void)
  260. {
  261. open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
  262. }