tiny.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  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, you can access it online at
  16. * http://www.gnu.org/licenses/gpl-2.0.html.
  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/completion.h>
  26. #include <linux/interrupt.h>
  27. #include <linux/notifier.h>
  28. #include <linux/rcupdate.h>
  29. #include <linux/kernel.h>
  30. #include <linux/export.h>
  31. #include <linux/mutex.h>
  32. #include <linux/sched.h>
  33. #include <linux/types.h>
  34. #include <linux/init.h>
  35. #include <linux/time.h>
  36. #include <linux/cpu.h>
  37. #include <linux/prefetch.h>
  38. #include <linux/ftrace_event.h>
  39. #include "rcu.h"
  40. /* Forward declarations for tiny_plugin.h. */
  41. struct rcu_ctrlblk;
  42. static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp);
  43. static void rcu_process_callbacks(struct softirq_action *unused);
  44. static void __call_rcu(struct rcu_head *head,
  45. void (*func)(struct rcu_head *rcu),
  46. struct rcu_ctrlblk *rcp);
  47. #include "tiny_plugin.h"
  48. /*
  49. * Enter idle, which is an extended quiescent state if we have fully
  50. * entered that mode.
  51. */
  52. void rcu_idle_enter(void)
  53. {
  54. }
  55. EXPORT_SYMBOL_GPL(rcu_idle_enter);
  56. /*
  57. * Exit an interrupt handler towards idle.
  58. */
  59. void rcu_irq_exit(void)
  60. {
  61. }
  62. EXPORT_SYMBOL_GPL(rcu_irq_exit);
  63. /*
  64. * Exit idle, so that we are no longer in an extended quiescent state.
  65. */
  66. void rcu_idle_exit(void)
  67. {
  68. }
  69. EXPORT_SYMBOL_GPL(rcu_idle_exit);
  70. /*
  71. * Enter an interrupt handler, moving away from idle.
  72. */
  73. void rcu_irq_enter(void)
  74. {
  75. }
  76. EXPORT_SYMBOL_GPL(rcu_irq_enter);
  77. #if defined(CONFIG_DEBUG_LOCK_ALLOC) || defined(CONFIG_RCU_TRACE)
  78. /*
  79. * Test whether RCU thinks that the current CPU is idle.
  80. */
  81. bool notrace __rcu_is_watching(void)
  82. {
  83. return true;
  84. }
  85. EXPORT_SYMBOL(__rcu_is_watching);
  86. #endif /* defined(CONFIG_DEBUG_LOCK_ALLOC) || defined(CONFIG_RCU_TRACE) */
  87. /*
  88. * Helper function for rcu_sched_qs() and rcu_bh_qs().
  89. * Also irqs are disabled to avoid confusion due to interrupt handlers
  90. * invoking call_rcu().
  91. */
  92. static int rcu_qsctr_help(struct rcu_ctrlblk *rcp)
  93. {
  94. RCU_TRACE(reset_cpu_stall_ticks(rcp));
  95. if (rcp->donetail != rcp->curtail) {
  96. rcp->donetail = rcp->curtail;
  97. return 1;
  98. }
  99. return 0;
  100. }
  101. /*
  102. * Record an rcu quiescent state. And an rcu_bh quiescent state while we
  103. * are at it, given that any rcu quiescent state is also an rcu_bh
  104. * quiescent state. Use "+" instead of "||" to defeat short circuiting.
  105. */
  106. void rcu_sched_qs(void)
  107. {
  108. unsigned long flags;
  109. local_irq_save(flags);
  110. if (rcu_qsctr_help(&rcu_sched_ctrlblk) +
  111. rcu_qsctr_help(&rcu_bh_ctrlblk))
  112. raise_softirq(RCU_SOFTIRQ);
  113. local_irq_restore(flags);
  114. }
  115. /*
  116. * Record an rcu_bh quiescent state.
  117. */
  118. void rcu_bh_qs(void)
  119. {
  120. unsigned long flags;
  121. local_irq_save(flags);
  122. if (rcu_qsctr_help(&rcu_bh_ctrlblk))
  123. raise_softirq(RCU_SOFTIRQ);
  124. local_irq_restore(flags);
  125. }
  126. /*
  127. * Check to see if the scheduling-clock interrupt came from an extended
  128. * quiescent state, and, if so, tell RCU about it. This function must
  129. * be called from hardirq context. It is normally called from the
  130. * scheduling-clock interrupt.
  131. */
  132. void rcu_check_callbacks(int user)
  133. {
  134. RCU_TRACE(check_cpu_stalls());
  135. if (user)
  136. rcu_sched_qs();
  137. else if (!in_softirq())
  138. rcu_bh_qs();
  139. if (user)
  140. rcu_note_voluntary_context_switch(current);
  141. }
  142. /*
  143. * Invoke the RCU callbacks on the specified rcu_ctrlkblk structure
  144. * whose grace period has elapsed.
  145. */
  146. static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp)
  147. {
  148. const char *rn = NULL;
  149. struct rcu_head *next, *list;
  150. unsigned long flags;
  151. RCU_TRACE(int cb_count = 0);
  152. /* Move the ready-to-invoke callbacks to a local list. */
  153. local_irq_save(flags);
  154. RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, rcp->qlen, -1));
  155. list = rcp->rcucblist;
  156. rcp->rcucblist = *rcp->donetail;
  157. *rcp->donetail = NULL;
  158. if (rcp->curtail == rcp->donetail)
  159. rcp->curtail = &rcp->rcucblist;
  160. rcp->donetail = &rcp->rcucblist;
  161. local_irq_restore(flags);
  162. /* Invoke the callbacks on the local list. */
  163. RCU_TRACE(rn = rcp->name);
  164. while (list) {
  165. next = list->next;
  166. prefetch(next);
  167. debug_rcu_head_unqueue(list);
  168. local_bh_disable();
  169. __rcu_reclaim(rn, list);
  170. local_bh_enable();
  171. list = next;
  172. RCU_TRACE(cb_count++);
  173. }
  174. RCU_TRACE(rcu_trace_sub_qlen(rcp, cb_count));
  175. RCU_TRACE(trace_rcu_batch_end(rcp->name,
  176. cb_count, 0, need_resched(),
  177. is_idle_task(current),
  178. false));
  179. }
  180. static void rcu_process_callbacks(struct softirq_action *unused)
  181. {
  182. __rcu_process_callbacks(&rcu_sched_ctrlblk);
  183. __rcu_process_callbacks(&rcu_bh_ctrlblk);
  184. }
  185. /*
  186. * Wait for a grace period to elapse. But it is illegal to invoke
  187. * synchronize_sched() from within an RCU read-side critical section.
  188. * Therefore, any legal call to synchronize_sched() is a quiescent
  189. * state, and so on a UP system, synchronize_sched() need do nothing.
  190. * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
  191. * benefits of doing might_sleep() to reduce latency.)
  192. *
  193. * Cool, huh? (Due to Josh Triplett.)
  194. *
  195. * But we want to make this a static inline later. The cond_resched()
  196. * currently makes this problematic.
  197. */
  198. void synchronize_sched(void)
  199. {
  200. rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) &&
  201. !lock_is_held(&rcu_lock_map) &&
  202. !lock_is_held(&rcu_sched_lock_map),
  203. "Illegal synchronize_sched() in RCU read-side critical section");
  204. cond_resched();
  205. }
  206. EXPORT_SYMBOL_GPL(synchronize_sched);
  207. /*
  208. * Helper function for call_rcu() and call_rcu_bh().
  209. */
  210. static void __call_rcu(struct rcu_head *head,
  211. void (*func)(struct rcu_head *rcu),
  212. struct rcu_ctrlblk *rcp)
  213. {
  214. unsigned long flags;
  215. debug_rcu_head_queue(head);
  216. head->func = func;
  217. head->next = NULL;
  218. local_irq_save(flags);
  219. *rcp->curtail = head;
  220. rcp->curtail = &head->next;
  221. RCU_TRACE(rcp->qlen++);
  222. local_irq_restore(flags);
  223. if (unlikely(is_idle_task(current))) {
  224. /* force scheduling for rcu_sched_qs() */
  225. resched_cpu(0);
  226. }
  227. }
  228. /*
  229. * Post an RCU callback to be invoked after the end of an RCU-sched grace
  230. * period. But since we have but one CPU, that would be after any
  231. * quiescent state.
  232. */
  233. void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  234. {
  235. __call_rcu(head, func, &rcu_sched_ctrlblk);
  236. }
  237. EXPORT_SYMBOL_GPL(call_rcu_sched);
  238. /*
  239. * Post an RCU bottom-half callback to be invoked after any subsequent
  240. * quiescent state.
  241. */
  242. void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  243. {
  244. __call_rcu(head, func, &rcu_bh_ctrlblk);
  245. }
  246. EXPORT_SYMBOL_GPL(call_rcu_bh);
  247. void __init rcu_init(void)
  248. {
  249. open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
  250. RCU_TRACE(reset_cpu_stall_ticks(&rcu_sched_ctrlblk));
  251. RCU_TRACE(reset_cpu_stall_ticks(&rcu_bh_ctrlblk));
  252. rcu_early_boot_tests();
  253. }