rcutiny.c 7.5 KB

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