tiny.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  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->rcucblist != NULL &&
  96. rcp->donetail != rcp->curtail) {
  97. rcp->donetail = rcp->curtail;
  98. return 1;
  99. }
  100. return 0;
  101. }
  102. /*
  103. * Record an rcu quiescent state. And an rcu_bh quiescent state while we
  104. * are at it, given that any rcu quiescent state is also an rcu_bh
  105. * quiescent state. Use "+" instead of "||" to defeat short circuiting.
  106. */
  107. void rcu_sched_qs(void)
  108. {
  109. unsigned long flags;
  110. local_irq_save(flags);
  111. if (rcu_qsctr_help(&rcu_sched_ctrlblk) +
  112. rcu_qsctr_help(&rcu_bh_ctrlblk))
  113. raise_softirq(RCU_SOFTIRQ);
  114. local_irq_restore(flags);
  115. }
  116. /*
  117. * Record an rcu_bh quiescent state.
  118. */
  119. void rcu_bh_qs(void)
  120. {
  121. unsigned long flags;
  122. local_irq_save(flags);
  123. if (rcu_qsctr_help(&rcu_bh_ctrlblk))
  124. raise_softirq(RCU_SOFTIRQ);
  125. local_irq_restore(flags);
  126. }
  127. /*
  128. * Check to see if the scheduling-clock interrupt came from an extended
  129. * quiescent state, and, if so, tell RCU about it. This function must
  130. * be called from hardirq context. It is normally called from the
  131. * scheduling-clock interrupt.
  132. */
  133. void rcu_check_callbacks(int user)
  134. {
  135. RCU_TRACE(check_cpu_stalls());
  136. if (user)
  137. rcu_sched_qs();
  138. else if (!in_softirq())
  139. rcu_bh_qs();
  140. if (user)
  141. rcu_note_voluntary_context_switch(current);
  142. }
  143. /*
  144. * Invoke the RCU callbacks on the specified rcu_ctrlkblk structure
  145. * whose grace period has elapsed.
  146. */
  147. static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp)
  148. {
  149. const char *rn = NULL;
  150. struct rcu_head *next, *list;
  151. unsigned long flags;
  152. RCU_TRACE(int cb_count = 0);
  153. /* If no RCU callbacks ready to invoke, just return. */
  154. if (&rcp->rcucblist == rcp->donetail) {
  155. RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, 0, -1));
  156. RCU_TRACE(trace_rcu_batch_end(rcp->name, 0,
  157. !!ACCESS_ONCE(rcp->rcucblist),
  158. need_resched(),
  159. is_idle_task(current),
  160. false));
  161. return;
  162. }
  163. /* Move the ready-to-invoke callbacks to a local list. */
  164. local_irq_save(flags);
  165. RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, rcp->qlen, -1));
  166. list = rcp->rcucblist;
  167. rcp->rcucblist = *rcp->donetail;
  168. *rcp->donetail = NULL;
  169. if (rcp->curtail == rcp->donetail)
  170. rcp->curtail = &rcp->rcucblist;
  171. rcp->donetail = &rcp->rcucblist;
  172. local_irq_restore(flags);
  173. /* Invoke the callbacks on the local list. */
  174. RCU_TRACE(rn = rcp->name);
  175. while (list) {
  176. next = list->next;
  177. prefetch(next);
  178. debug_rcu_head_unqueue(list);
  179. local_bh_disable();
  180. __rcu_reclaim(rn, list);
  181. local_bh_enable();
  182. list = next;
  183. RCU_TRACE(cb_count++);
  184. }
  185. RCU_TRACE(rcu_trace_sub_qlen(rcp, cb_count));
  186. RCU_TRACE(trace_rcu_batch_end(rcp->name,
  187. cb_count, 0, need_resched(),
  188. is_idle_task(current),
  189. false));
  190. }
  191. static void rcu_process_callbacks(struct softirq_action *unused)
  192. {
  193. __rcu_process_callbacks(&rcu_sched_ctrlblk);
  194. __rcu_process_callbacks(&rcu_bh_ctrlblk);
  195. }
  196. /*
  197. * Wait for a grace period to elapse. But it is illegal to invoke
  198. * synchronize_sched() from within an RCU read-side critical section.
  199. * Therefore, any legal call to synchronize_sched() is a quiescent
  200. * state, and so on a UP system, synchronize_sched() need do nothing.
  201. * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
  202. * benefits of doing might_sleep() to reduce latency.)
  203. *
  204. * Cool, huh? (Due to Josh Triplett.)
  205. *
  206. * But we want to make this a static inline later. The cond_resched()
  207. * currently makes this problematic.
  208. */
  209. void synchronize_sched(void)
  210. {
  211. rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) &&
  212. !lock_is_held(&rcu_lock_map) &&
  213. !lock_is_held(&rcu_sched_lock_map),
  214. "Illegal synchronize_sched() in RCU read-side critical section");
  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. if (unlikely(is_idle_task(current))) {
  235. /* force scheduling for rcu_sched_qs() */
  236. resched_cpu(0);
  237. }
  238. }
  239. /*
  240. * Post an RCU callback to be invoked after the end of an RCU-sched grace
  241. * period. But since we have but one CPU, that would be after any
  242. * quiescent state.
  243. */
  244. void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  245. {
  246. __call_rcu(head, func, &rcu_sched_ctrlblk);
  247. }
  248. EXPORT_SYMBOL_GPL(call_rcu_sched);
  249. /*
  250. * Post an RCU bottom-half callback to be invoked after any subsequent
  251. * quiescent state.
  252. */
  253. void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
  254. {
  255. __call_rcu(head, func, &rcu_bh_ctrlblk);
  256. }
  257. EXPORT_SYMBOL_GPL(call_rcu_bh);
  258. void __init rcu_init(void)
  259. {
  260. open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
  261. RCU_TRACE(reset_cpu_stall_ticks(&rcu_sched_ctrlblk));
  262. RCU_TRACE(reset_cpu_stall_ticks(&rcu_bh_ctrlblk));
  263. rcu_early_boot_tests();
  264. }