update.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897
  1. /*
  2. * Read-Copy Update mechanism for mutual exclusion
  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, 2001
  19. *
  20. * Authors: Dipankar Sarma <dipankar@in.ibm.com>
  21. * Manfred Spraul <manfred@colorfullife.com>
  22. *
  23. * Based on the original work by Paul McKenney <paulmck@us.ibm.com>
  24. * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen.
  25. * Papers:
  26. * http://www.rdrop.com/users/paulmck/paper/rclockpdcsproof.pdf
  27. * http://lse.sourceforge.net/locking/rclock_OLS.2001.05.01c.sc.pdf (OLS2001)
  28. *
  29. * For detailed explanation of Read-Copy Update mechanism see -
  30. * http://lse.sourceforge.net/locking/rcupdate.html
  31. *
  32. */
  33. #include <linux/types.h>
  34. #include <linux/kernel.h>
  35. #include <linux/init.h>
  36. #include <linux/spinlock.h>
  37. #include <linux/smp.h>
  38. #include <linux/interrupt.h>
  39. #include <linux/sched.h>
  40. #include <linux/atomic.h>
  41. #include <linux/bitops.h>
  42. #include <linux/percpu.h>
  43. #include <linux/notifier.h>
  44. #include <linux/cpu.h>
  45. #include <linux/mutex.h>
  46. #include <linux/export.h>
  47. #include <linux/hardirq.h>
  48. #include <linux/delay.h>
  49. #include <linux/module.h>
  50. #include <linux/kthread.h>
  51. #include <linux/tick.h>
  52. #define CREATE_TRACE_POINTS
  53. #include "rcu.h"
  54. MODULE_ALIAS("rcupdate");
  55. #ifdef MODULE_PARAM_PREFIX
  56. #undef MODULE_PARAM_PREFIX
  57. #endif
  58. #define MODULE_PARAM_PREFIX "rcupdate."
  59. module_param(rcu_expedited, int, 0);
  60. #if defined(CONFIG_DEBUG_LOCK_ALLOC) && defined(CONFIG_PREEMPT_COUNT)
  61. /**
  62. * rcu_read_lock_sched_held() - might we be in RCU-sched read-side critical section?
  63. *
  64. * If CONFIG_DEBUG_LOCK_ALLOC is selected, returns nonzero iff in an
  65. * RCU-sched read-side critical section. In absence of
  66. * CONFIG_DEBUG_LOCK_ALLOC, this assumes we are in an RCU-sched read-side
  67. * critical section unless it can prove otherwise. Note that disabling
  68. * of preemption (including disabling irqs) counts as an RCU-sched
  69. * read-side critical section. This is useful for debug checks in functions
  70. * that required that they be called within an RCU-sched read-side
  71. * critical section.
  72. *
  73. * Check debug_lockdep_rcu_enabled() to prevent false positives during boot
  74. * and while lockdep is disabled.
  75. *
  76. * Note that if the CPU is in the idle loop from an RCU point of
  77. * view (ie: that we are in the section between rcu_idle_enter() and
  78. * rcu_idle_exit()) then rcu_read_lock_held() returns false even if the CPU
  79. * did an rcu_read_lock(). The reason for this is that RCU ignores CPUs
  80. * that are in such a section, considering these as in extended quiescent
  81. * state, so such a CPU is effectively never in an RCU read-side critical
  82. * section regardless of what RCU primitives it invokes. This state of
  83. * affairs is required --- we need to keep an RCU-free window in idle
  84. * where the CPU may possibly enter into low power mode. This way we can
  85. * notice an extended quiescent state to other CPUs that started a grace
  86. * period. Otherwise we would delay any grace period as long as we run in
  87. * the idle task.
  88. *
  89. * Similarly, we avoid claiming an SRCU read lock held if the current
  90. * CPU is offline.
  91. */
  92. int rcu_read_lock_sched_held(void)
  93. {
  94. int lockdep_opinion = 0;
  95. if (!debug_lockdep_rcu_enabled())
  96. return 1;
  97. if (!rcu_is_watching())
  98. return 0;
  99. if (!rcu_lockdep_current_cpu_online())
  100. return 0;
  101. if (debug_locks)
  102. lockdep_opinion = lock_is_held(&rcu_sched_lock_map);
  103. return lockdep_opinion || preempt_count() != 0 || irqs_disabled();
  104. }
  105. EXPORT_SYMBOL(rcu_read_lock_sched_held);
  106. #endif
  107. #ifndef CONFIG_TINY_RCU
  108. static atomic_t rcu_expedited_nesting =
  109. ATOMIC_INIT(IS_ENABLED(CONFIG_RCU_EXPEDITE_BOOT) ? 1 : 0);
  110. /*
  111. * Should normal grace-period primitives be expedited? Intended for
  112. * use within RCU. Note that this function takes the rcu_expedited
  113. * sysfs/boot variable into account as well as the rcu_expedite_gp()
  114. * nesting. So looping on rcu_unexpedite_gp() until rcu_gp_is_expedited()
  115. * returns false is a -really- bad idea.
  116. */
  117. bool rcu_gp_is_expedited(void)
  118. {
  119. return rcu_expedited || atomic_read(&rcu_expedited_nesting);
  120. }
  121. EXPORT_SYMBOL_GPL(rcu_gp_is_expedited);
  122. /**
  123. * rcu_expedite_gp - Expedite future RCU grace periods
  124. *
  125. * After a call to this function, future calls to synchronize_rcu() and
  126. * friends act as the corresponding synchronize_rcu_expedited() function
  127. * had instead been called.
  128. */
  129. void rcu_expedite_gp(void)
  130. {
  131. atomic_inc(&rcu_expedited_nesting);
  132. }
  133. EXPORT_SYMBOL_GPL(rcu_expedite_gp);
  134. /**
  135. * rcu_unexpedite_gp - Cancel prior rcu_expedite_gp() invocation
  136. *
  137. * Undo a prior call to rcu_expedite_gp(). If all prior calls to
  138. * rcu_expedite_gp() are undone by a subsequent call to rcu_unexpedite_gp(),
  139. * and if the rcu_expedited sysfs/boot parameter is not set, then all
  140. * subsequent calls to synchronize_rcu() and friends will return to
  141. * their normal non-expedited behavior.
  142. */
  143. void rcu_unexpedite_gp(void)
  144. {
  145. atomic_dec(&rcu_expedited_nesting);
  146. }
  147. EXPORT_SYMBOL_GPL(rcu_unexpedite_gp);
  148. #endif /* #ifndef CONFIG_TINY_RCU */
  149. /*
  150. * Inform RCU of the end of the in-kernel boot sequence.
  151. */
  152. void rcu_end_inkernel_boot(void)
  153. {
  154. if (IS_ENABLED(CONFIG_RCU_EXPEDITE_BOOT))
  155. rcu_unexpedite_gp();
  156. }
  157. #ifdef CONFIG_PREEMPT_RCU
  158. /*
  159. * Preemptible RCU implementation for rcu_read_lock().
  160. * Just increment ->rcu_read_lock_nesting, shared state will be updated
  161. * if we block.
  162. */
  163. void __rcu_read_lock(void)
  164. {
  165. current->rcu_read_lock_nesting++;
  166. barrier(); /* critical section after entry code. */
  167. }
  168. EXPORT_SYMBOL_GPL(__rcu_read_lock);
  169. /*
  170. * Preemptible RCU implementation for rcu_read_unlock().
  171. * Decrement ->rcu_read_lock_nesting. If the result is zero (outermost
  172. * rcu_read_unlock()) and ->rcu_read_unlock_special is non-zero, then
  173. * invoke rcu_read_unlock_special() to clean up after a context switch
  174. * in an RCU read-side critical section and other special cases.
  175. */
  176. void __rcu_read_unlock(void)
  177. {
  178. struct task_struct *t = current;
  179. if (t->rcu_read_lock_nesting != 1) {
  180. --t->rcu_read_lock_nesting;
  181. } else {
  182. barrier(); /* critical section before exit code. */
  183. t->rcu_read_lock_nesting = INT_MIN;
  184. barrier(); /* assign before ->rcu_read_unlock_special load */
  185. if (unlikely(READ_ONCE(t->rcu_read_unlock_special.s)))
  186. rcu_read_unlock_special(t);
  187. barrier(); /* ->rcu_read_unlock_special load before assign */
  188. t->rcu_read_lock_nesting = 0;
  189. }
  190. #ifdef CONFIG_PROVE_LOCKING
  191. {
  192. int rrln = READ_ONCE(t->rcu_read_lock_nesting);
  193. WARN_ON_ONCE(rrln < 0 && rrln > INT_MIN / 2);
  194. }
  195. #endif /* #ifdef CONFIG_PROVE_LOCKING */
  196. }
  197. EXPORT_SYMBOL_GPL(__rcu_read_unlock);
  198. #endif /* #ifdef CONFIG_PREEMPT_RCU */
  199. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  200. static struct lock_class_key rcu_lock_key;
  201. struct lockdep_map rcu_lock_map =
  202. STATIC_LOCKDEP_MAP_INIT("rcu_read_lock", &rcu_lock_key);
  203. EXPORT_SYMBOL_GPL(rcu_lock_map);
  204. static struct lock_class_key rcu_bh_lock_key;
  205. struct lockdep_map rcu_bh_lock_map =
  206. STATIC_LOCKDEP_MAP_INIT("rcu_read_lock_bh", &rcu_bh_lock_key);
  207. EXPORT_SYMBOL_GPL(rcu_bh_lock_map);
  208. static struct lock_class_key rcu_sched_lock_key;
  209. struct lockdep_map rcu_sched_lock_map =
  210. STATIC_LOCKDEP_MAP_INIT("rcu_read_lock_sched", &rcu_sched_lock_key);
  211. EXPORT_SYMBOL_GPL(rcu_sched_lock_map);
  212. static struct lock_class_key rcu_callback_key;
  213. struct lockdep_map rcu_callback_map =
  214. STATIC_LOCKDEP_MAP_INIT("rcu_callback", &rcu_callback_key);
  215. EXPORT_SYMBOL_GPL(rcu_callback_map);
  216. int notrace debug_lockdep_rcu_enabled(void)
  217. {
  218. return rcu_scheduler_active && debug_locks &&
  219. current->lockdep_recursion == 0;
  220. }
  221. EXPORT_SYMBOL_GPL(debug_lockdep_rcu_enabled);
  222. /**
  223. * rcu_read_lock_held() - might we be in RCU read-side critical section?
  224. *
  225. * If CONFIG_DEBUG_LOCK_ALLOC is selected, returns nonzero iff in an RCU
  226. * read-side critical section. In absence of CONFIG_DEBUG_LOCK_ALLOC,
  227. * this assumes we are in an RCU read-side critical section unless it can
  228. * prove otherwise. This is useful for debug checks in functions that
  229. * require that they be called within an RCU read-side critical section.
  230. *
  231. * Checks debug_lockdep_rcu_enabled() to prevent false positives during boot
  232. * and while lockdep is disabled.
  233. *
  234. * Note that rcu_read_lock() and the matching rcu_read_unlock() must
  235. * occur in the same context, for example, it is illegal to invoke
  236. * rcu_read_unlock() in process context if the matching rcu_read_lock()
  237. * was invoked from within an irq handler.
  238. *
  239. * Note that rcu_read_lock() is disallowed if the CPU is either idle or
  240. * offline from an RCU perspective, so check for those as well.
  241. */
  242. int rcu_read_lock_held(void)
  243. {
  244. if (!debug_lockdep_rcu_enabled())
  245. return 1;
  246. if (!rcu_is_watching())
  247. return 0;
  248. if (!rcu_lockdep_current_cpu_online())
  249. return 0;
  250. return lock_is_held(&rcu_lock_map);
  251. }
  252. EXPORT_SYMBOL_GPL(rcu_read_lock_held);
  253. /**
  254. * rcu_read_lock_bh_held() - might we be in RCU-bh read-side critical section?
  255. *
  256. * Check for bottom half being disabled, which covers both the
  257. * CONFIG_PROVE_RCU and not cases. Note that if someone uses
  258. * rcu_read_lock_bh(), but then later enables BH, lockdep (if enabled)
  259. * will show the situation. This is useful for debug checks in functions
  260. * that require that they be called within an RCU read-side critical
  261. * section.
  262. *
  263. * Check debug_lockdep_rcu_enabled() to prevent false positives during boot.
  264. *
  265. * Note that rcu_read_lock() is disallowed if the CPU is either idle or
  266. * offline from an RCU perspective, so check for those as well.
  267. */
  268. int rcu_read_lock_bh_held(void)
  269. {
  270. if (!debug_lockdep_rcu_enabled())
  271. return 1;
  272. if (!rcu_is_watching())
  273. return 0;
  274. if (!rcu_lockdep_current_cpu_online())
  275. return 0;
  276. return in_softirq() || irqs_disabled();
  277. }
  278. EXPORT_SYMBOL_GPL(rcu_read_lock_bh_held);
  279. #endif /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */
  280. /**
  281. * wakeme_after_rcu() - Callback function to awaken a task after grace period
  282. * @head: Pointer to rcu_head member within rcu_synchronize structure
  283. *
  284. * Awaken the corresponding task now that a grace period has elapsed.
  285. */
  286. void wakeme_after_rcu(struct rcu_head *head)
  287. {
  288. struct rcu_synchronize *rcu;
  289. rcu = container_of(head, struct rcu_synchronize, head);
  290. complete(&rcu->completion);
  291. }
  292. EXPORT_SYMBOL_GPL(wakeme_after_rcu);
  293. void __wait_rcu_gp(bool checktiny, int n, call_rcu_func_t *crcu_array,
  294. struct rcu_synchronize *rs_array)
  295. {
  296. int i;
  297. /* Initialize and register callbacks for each flavor specified. */
  298. for (i = 0; i < n; i++) {
  299. if (checktiny &&
  300. (crcu_array[i] == call_rcu ||
  301. crcu_array[i] == call_rcu_bh)) {
  302. might_sleep();
  303. continue;
  304. }
  305. init_rcu_head_on_stack(&rs_array[i].head);
  306. init_completion(&rs_array[i].completion);
  307. (crcu_array[i])(&rs_array[i].head, wakeme_after_rcu);
  308. }
  309. /* Wait for all callbacks to be invoked. */
  310. for (i = 0; i < n; i++) {
  311. if (checktiny &&
  312. (crcu_array[i] == call_rcu ||
  313. crcu_array[i] == call_rcu_bh))
  314. continue;
  315. wait_for_completion(&rs_array[i].completion);
  316. destroy_rcu_head_on_stack(&rs_array[i].head);
  317. }
  318. }
  319. EXPORT_SYMBOL_GPL(__wait_rcu_gp);
  320. #ifdef CONFIG_DEBUG_OBJECTS_RCU_HEAD
  321. void init_rcu_head(struct rcu_head *head)
  322. {
  323. debug_object_init(head, &rcuhead_debug_descr);
  324. }
  325. void destroy_rcu_head(struct rcu_head *head)
  326. {
  327. debug_object_free(head, &rcuhead_debug_descr);
  328. }
  329. /*
  330. * fixup_activate is called when:
  331. * - an active object is activated
  332. * - an unknown object is activated (might be a statically initialized object)
  333. * Activation is performed internally by call_rcu().
  334. */
  335. static int rcuhead_fixup_activate(void *addr, enum debug_obj_state state)
  336. {
  337. struct rcu_head *head = addr;
  338. switch (state) {
  339. case ODEBUG_STATE_NOTAVAILABLE:
  340. /*
  341. * This is not really a fixup. We just make sure that it is
  342. * tracked in the object tracker.
  343. */
  344. debug_object_init(head, &rcuhead_debug_descr);
  345. debug_object_activate(head, &rcuhead_debug_descr);
  346. return 0;
  347. default:
  348. return 1;
  349. }
  350. }
  351. /**
  352. * init_rcu_head_on_stack() - initialize on-stack rcu_head for debugobjects
  353. * @head: pointer to rcu_head structure to be initialized
  354. *
  355. * This function informs debugobjects of a new rcu_head structure that
  356. * has been allocated as an auto variable on the stack. This function
  357. * is not required for rcu_head structures that are statically defined or
  358. * that are dynamically allocated on the heap. This function has no
  359. * effect for !CONFIG_DEBUG_OBJECTS_RCU_HEAD kernel builds.
  360. */
  361. void init_rcu_head_on_stack(struct rcu_head *head)
  362. {
  363. debug_object_init_on_stack(head, &rcuhead_debug_descr);
  364. }
  365. EXPORT_SYMBOL_GPL(init_rcu_head_on_stack);
  366. /**
  367. * destroy_rcu_head_on_stack() - destroy on-stack rcu_head for debugobjects
  368. * @head: pointer to rcu_head structure to be initialized
  369. *
  370. * This function informs debugobjects that an on-stack rcu_head structure
  371. * is about to go out of scope. As with init_rcu_head_on_stack(), this
  372. * function is not required for rcu_head structures that are statically
  373. * defined or that are dynamically allocated on the heap. Also as with
  374. * init_rcu_head_on_stack(), this function has no effect for
  375. * !CONFIG_DEBUG_OBJECTS_RCU_HEAD kernel builds.
  376. */
  377. void destroy_rcu_head_on_stack(struct rcu_head *head)
  378. {
  379. debug_object_free(head, &rcuhead_debug_descr);
  380. }
  381. EXPORT_SYMBOL_GPL(destroy_rcu_head_on_stack);
  382. struct debug_obj_descr rcuhead_debug_descr = {
  383. .name = "rcu_head",
  384. .fixup_activate = rcuhead_fixup_activate,
  385. };
  386. EXPORT_SYMBOL_GPL(rcuhead_debug_descr);
  387. #endif /* #ifdef CONFIG_DEBUG_OBJECTS_RCU_HEAD */
  388. #if defined(CONFIG_TREE_RCU) || defined(CONFIG_PREEMPT_RCU) || defined(CONFIG_RCU_TRACE)
  389. void do_trace_rcu_torture_read(const char *rcutorturename, struct rcu_head *rhp,
  390. unsigned long secs,
  391. unsigned long c_old, unsigned long c)
  392. {
  393. trace_rcu_torture_read(rcutorturename, rhp, secs, c_old, c);
  394. }
  395. EXPORT_SYMBOL_GPL(do_trace_rcu_torture_read);
  396. #else
  397. #define do_trace_rcu_torture_read(rcutorturename, rhp, secs, c_old, c) \
  398. do { } while (0)
  399. #endif
  400. #ifdef CONFIG_RCU_STALL_COMMON
  401. #ifdef CONFIG_PROVE_RCU
  402. #define RCU_STALL_DELAY_DELTA (5 * HZ)
  403. #else
  404. #define RCU_STALL_DELAY_DELTA 0
  405. #endif
  406. int rcu_cpu_stall_suppress __read_mostly; /* 1 = suppress stall warnings. */
  407. static int rcu_cpu_stall_timeout __read_mostly = CONFIG_RCU_CPU_STALL_TIMEOUT;
  408. module_param(rcu_cpu_stall_suppress, int, 0644);
  409. module_param(rcu_cpu_stall_timeout, int, 0644);
  410. int rcu_jiffies_till_stall_check(void)
  411. {
  412. int till_stall_check = READ_ONCE(rcu_cpu_stall_timeout);
  413. /*
  414. * Limit check must be consistent with the Kconfig limits
  415. * for CONFIG_RCU_CPU_STALL_TIMEOUT.
  416. */
  417. if (till_stall_check < 3) {
  418. WRITE_ONCE(rcu_cpu_stall_timeout, 3);
  419. till_stall_check = 3;
  420. } else if (till_stall_check > 300) {
  421. WRITE_ONCE(rcu_cpu_stall_timeout, 300);
  422. till_stall_check = 300;
  423. }
  424. return till_stall_check * HZ + RCU_STALL_DELAY_DELTA;
  425. }
  426. void rcu_sysrq_start(void)
  427. {
  428. if (!rcu_cpu_stall_suppress)
  429. rcu_cpu_stall_suppress = 2;
  430. }
  431. void rcu_sysrq_end(void)
  432. {
  433. if (rcu_cpu_stall_suppress == 2)
  434. rcu_cpu_stall_suppress = 0;
  435. }
  436. static int rcu_panic(struct notifier_block *this, unsigned long ev, void *ptr)
  437. {
  438. rcu_cpu_stall_suppress = 1;
  439. return NOTIFY_DONE;
  440. }
  441. static struct notifier_block rcu_panic_block = {
  442. .notifier_call = rcu_panic,
  443. };
  444. static int __init check_cpu_stall_init(void)
  445. {
  446. atomic_notifier_chain_register(&panic_notifier_list, &rcu_panic_block);
  447. return 0;
  448. }
  449. early_initcall(check_cpu_stall_init);
  450. #endif /* #ifdef CONFIG_RCU_STALL_COMMON */
  451. #ifdef CONFIG_TASKS_RCU
  452. /*
  453. * Simple variant of RCU whose quiescent states are voluntary context switch,
  454. * user-space execution, and idle. As such, grace periods can take one good
  455. * long time. There are no read-side primitives similar to rcu_read_lock()
  456. * and rcu_read_unlock() because this implementation is intended to get
  457. * the system into a safe state for some of the manipulations involved in
  458. * tracing and the like. Finally, this implementation does not support
  459. * high call_rcu_tasks() rates from multiple CPUs. If this is required,
  460. * per-CPU callback lists will be needed.
  461. */
  462. /* Global list of callbacks and associated lock. */
  463. static struct rcu_head *rcu_tasks_cbs_head;
  464. static struct rcu_head **rcu_tasks_cbs_tail = &rcu_tasks_cbs_head;
  465. static DECLARE_WAIT_QUEUE_HEAD(rcu_tasks_cbs_wq);
  466. static DEFINE_RAW_SPINLOCK(rcu_tasks_cbs_lock);
  467. /* Track exiting tasks in order to allow them to be waited for. */
  468. DEFINE_SRCU(tasks_rcu_exit_srcu);
  469. /* Control stall timeouts. Disable with <= 0, otherwise jiffies till stall. */
  470. static int rcu_task_stall_timeout __read_mostly = HZ * 60 * 10;
  471. module_param(rcu_task_stall_timeout, int, 0644);
  472. static void rcu_spawn_tasks_kthread(void);
  473. /*
  474. * Post an RCU-tasks callback. First call must be from process context
  475. * after the scheduler if fully operational.
  476. */
  477. void call_rcu_tasks(struct rcu_head *rhp, rcu_callback_t func)
  478. {
  479. unsigned long flags;
  480. bool needwake;
  481. rhp->next = NULL;
  482. rhp->func = func;
  483. raw_spin_lock_irqsave(&rcu_tasks_cbs_lock, flags);
  484. needwake = !rcu_tasks_cbs_head;
  485. *rcu_tasks_cbs_tail = rhp;
  486. rcu_tasks_cbs_tail = &rhp->next;
  487. raw_spin_unlock_irqrestore(&rcu_tasks_cbs_lock, flags);
  488. if (needwake) {
  489. rcu_spawn_tasks_kthread();
  490. wake_up(&rcu_tasks_cbs_wq);
  491. }
  492. }
  493. EXPORT_SYMBOL_GPL(call_rcu_tasks);
  494. /**
  495. * synchronize_rcu_tasks - wait until an rcu-tasks grace period has elapsed.
  496. *
  497. * Control will return to the caller some time after a full rcu-tasks
  498. * grace period has elapsed, in other words after all currently
  499. * executing rcu-tasks read-side critical sections have elapsed. These
  500. * read-side critical sections are delimited by calls to schedule(),
  501. * cond_resched_rcu_qs(), idle execution, userspace execution, calls
  502. * to synchronize_rcu_tasks(), and (in theory, anyway) cond_resched().
  503. *
  504. * This is a very specialized primitive, intended only for a few uses in
  505. * tracing and other situations requiring manipulation of function
  506. * preambles and profiling hooks. The synchronize_rcu_tasks() function
  507. * is not (yet) intended for heavy use from multiple CPUs.
  508. *
  509. * Note that this guarantee implies further memory-ordering guarantees.
  510. * On systems with more than one CPU, when synchronize_rcu_tasks() returns,
  511. * each CPU is guaranteed to have executed a full memory barrier since the
  512. * end of its last RCU-tasks read-side critical section whose beginning
  513. * preceded the call to synchronize_rcu_tasks(). In addition, each CPU
  514. * having an RCU-tasks read-side critical section that extends beyond
  515. * the return from synchronize_rcu_tasks() is guaranteed to have executed
  516. * a full memory barrier after the beginning of synchronize_rcu_tasks()
  517. * and before the beginning of that RCU-tasks read-side critical section.
  518. * Note that these guarantees include CPUs that are offline, idle, or
  519. * executing in user mode, as well as CPUs that are executing in the kernel.
  520. *
  521. * Furthermore, if CPU A invoked synchronize_rcu_tasks(), which returned
  522. * to its caller on CPU B, then both CPU A and CPU B are guaranteed
  523. * to have executed a full memory barrier during the execution of
  524. * synchronize_rcu_tasks() -- even if CPU A and CPU B are the same CPU
  525. * (but again only if the system has more than one CPU).
  526. */
  527. void synchronize_rcu_tasks(void)
  528. {
  529. /* Complain if the scheduler has not started. */
  530. RCU_LOCKDEP_WARN(!rcu_scheduler_active,
  531. "synchronize_rcu_tasks called too soon");
  532. /* Wait for the grace period. */
  533. wait_rcu_gp(call_rcu_tasks);
  534. }
  535. EXPORT_SYMBOL_GPL(synchronize_rcu_tasks);
  536. /**
  537. * rcu_barrier_tasks - Wait for in-flight call_rcu_tasks() callbacks.
  538. *
  539. * Although the current implementation is guaranteed to wait, it is not
  540. * obligated to, for example, if there are no pending callbacks.
  541. */
  542. void rcu_barrier_tasks(void)
  543. {
  544. /* There is only one callback queue, so this is easy. ;-) */
  545. synchronize_rcu_tasks();
  546. }
  547. EXPORT_SYMBOL_GPL(rcu_barrier_tasks);
  548. /* See if tasks are still holding out, complain if so. */
  549. static void check_holdout_task(struct task_struct *t,
  550. bool needreport, bool *firstreport)
  551. {
  552. int cpu;
  553. if (!READ_ONCE(t->rcu_tasks_holdout) ||
  554. t->rcu_tasks_nvcsw != READ_ONCE(t->nvcsw) ||
  555. !READ_ONCE(t->on_rq) ||
  556. (IS_ENABLED(CONFIG_NO_HZ_FULL) &&
  557. !is_idle_task(t) && t->rcu_tasks_idle_cpu >= 0)) {
  558. WRITE_ONCE(t->rcu_tasks_holdout, false);
  559. list_del_init(&t->rcu_tasks_holdout_list);
  560. put_task_struct(t);
  561. return;
  562. }
  563. if (!needreport)
  564. return;
  565. if (*firstreport) {
  566. pr_err("INFO: rcu_tasks detected stalls on tasks:\n");
  567. *firstreport = false;
  568. }
  569. cpu = task_cpu(t);
  570. pr_alert("%p: %c%c nvcsw: %lu/%lu holdout: %d idle_cpu: %d/%d\n",
  571. t, ".I"[is_idle_task(t)],
  572. "N."[cpu < 0 || !tick_nohz_full_cpu(cpu)],
  573. t->rcu_tasks_nvcsw, t->nvcsw, t->rcu_tasks_holdout,
  574. t->rcu_tasks_idle_cpu, cpu);
  575. sched_show_task(t);
  576. }
  577. /* RCU-tasks kthread that detects grace periods and invokes callbacks. */
  578. static int __noreturn rcu_tasks_kthread(void *arg)
  579. {
  580. unsigned long flags;
  581. struct task_struct *g, *t;
  582. unsigned long lastreport;
  583. struct rcu_head *list;
  584. struct rcu_head *next;
  585. LIST_HEAD(rcu_tasks_holdouts);
  586. /* Run on housekeeping CPUs by default. Sysadm can move if desired. */
  587. housekeeping_affine(current);
  588. /*
  589. * Each pass through the following loop makes one check for
  590. * newly arrived callbacks, and, if there are some, waits for
  591. * one RCU-tasks grace period and then invokes the callbacks.
  592. * This loop is terminated by the system going down. ;-)
  593. */
  594. for (;;) {
  595. /* Pick up any new callbacks. */
  596. raw_spin_lock_irqsave(&rcu_tasks_cbs_lock, flags);
  597. list = rcu_tasks_cbs_head;
  598. rcu_tasks_cbs_head = NULL;
  599. rcu_tasks_cbs_tail = &rcu_tasks_cbs_head;
  600. raw_spin_unlock_irqrestore(&rcu_tasks_cbs_lock, flags);
  601. /* If there were none, wait a bit and start over. */
  602. if (!list) {
  603. wait_event_interruptible(rcu_tasks_cbs_wq,
  604. rcu_tasks_cbs_head);
  605. if (!rcu_tasks_cbs_head) {
  606. WARN_ON(signal_pending(current));
  607. schedule_timeout_interruptible(HZ/10);
  608. }
  609. continue;
  610. }
  611. /*
  612. * Wait for all pre-existing t->on_rq and t->nvcsw
  613. * transitions to complete. Invoking synchronize_sched()
  614. * suffices because all these transitions occur with
  615. * interrupts disabled. Without this synchronize_sched(),
  616. * a read-side critical section that started before the
  617. * grace period might be incorrectly seen as having started
  618. * after the grace period.
  619. *
  620. * This synchronize_sched() also dispenses with the
  621. * need for a memory barrier on the first store to
  622. * ->rcu_tasks_holdout, as it forces the store to happen
  623. * after the beginning of the grace period.
  624. */
  625. synchronize_sched();
  626. /*
  627. * There were callbacks, so we need to wait for an
  628. * RCU-tasks grace period. Start off by scanning
  629. * the task list for tasks that are not already
  630. * voluntarily blocked. Mark these tasks and make
  631. * a list of them in rcu_tasks_holdouts.
  632. */
  633. rcu_read_lock();
  634. for_each_process_thread(g, t) {
  635. if (t != current && READ_ONCE(t->on_rq) &&
  636. !is_idle_task(t)) {
  637. get_task_struct(t);
  638. t->rcu_tasks_nvcsw = READ_ONCE(t->nvcsw);
  639. WRITE_ONCE(t->rcu_tasks_holdout, true);
  640. list_add(&t->rcu_tasks_holdout_list,
  641. &rcu_tasks_holdouts);
  642. }
  643. }
  644. rcu_read_unlock();
  645. /*
  646. * Wait for tasks that are in the process of exiting.
  647. * This does only part of the job, ensuring that all
  648. * tasks that were previously exiting reach the point
  649. * where they have disabled preemption, allowing the
  650. * later synchronize_sched() to finish the job.
  651. */
  652. synchronize_srcu(&tasks_rcu_exit_srcu);
  653. /*
  654. * Each pass through the following loop scans the list
  655. * of holdout tasks, removing any that are no longer
  656. * holdouts. When the list is empty, we are done.
  657. */
  658. lastreport = jiffies;
  659. while (!list_empty(&rcu_tasks_holdouts)) {
  660. bool firstreport;
  661. bool needreport;
  662. int rtst;
  663. struct task_struct *t1;
  664. schedule_timeout_interruptible(HZ);
  665. rtst = READ_ONCE(rcu_task_stall_timeout);
  666. needreport = rtst > 0 &&
  667. time_after(jiffies, lastreport + rtst);
  668. if (needreport)
  669. lastreport = jiffies;
  670. firstreport = true;
  671. WARN_ON(signal_pending(current));
  672. list_for_each_entry_safe(t, t1, &rcu_tasks_holdouts,
  673. rcu_tasks_holdout_list) {
  674. check_holdout_task(t, needreport, &firstreport);
  675. cond_resched();
  676. }
  677. }
  678. /*
  679. * Because ->on_rq and ->nvcsw are not guaranteed
  680. * to have a full memory barriers prior to them in the
  681. * schedule() path, memory reordering on other CPUs could
  682. * cause their RCU-tasks read-side critical sections to
  683. * extend past the end of the grace period. However,
  684. * because these ->nvcsw updates are carried out with
  685. * interrupts disabled, we can use synchronize_sched()
  686. * to force the needed ordering on all such CPUs.
  687. *
  688. * This synchronize_sched() also confines all
  689. * ->rcu_tasks_holdout accesses to be within the grace
  690. * period, avoiding the need for memory barriers for
  691. * ->rcu_tasks_holdout accesses.
  692. *
  693. * In addition, this synchronize_sched() waits for exiting
  694. * tasks to complete their final preempt_disable() region
  695. * of execution, cleaning up after the synchronize_srcu()
  696. * above.
  697. */
  698. synchronize_sched();
  699. /* Invoke the callbacks. */
  700. while (list) {
  701. next = list->next;
  702. local_bh_disable();
  703. list->func(list);
  704. local_bh_enable();
  705. list = next;
  706. cond_resched();
  707. }
  708. schedule_timeout_uninterruptible(HZ/10);
  709. }
  710. }
  711. /* Spawn rcu_tasks_kthread() at first call to call_rcu_tasks(). */
  712. static void rcu_spawn_tasks_kthread(void)
  713. {
  714. static DEFINE_MUTEX(rcu_tasks_kthread_mutex);
  715. static struct task_struct *rcu_tasks_kthread_ptr;
  716. struct task_struct *t;
  717. if (READ_ONCE(rcu_tasks_kthread_ptr)) {
  718. smp_mb(); /* Ensure caller sees full kthread. */
  719. return;
  720. }
  721. mutex_lock(&rcu_tasks_kthread_mutex);
  722. if (rcu_tasks_kthread_ptr) {
  723. mutex_unlock(&rcu_tasks_kthread_mutex);
  724. return;
  725. }
  726. t = kthread_run(rcu_tasks_kthread, NULL, "rcu_tasks_kthread");
  727. BUG_ON(IS_ERR(t));
  728. smp_mb(); /* Ensure others see full kthread. */
  729. WRITE_ONCE(rcu_tasks_kthread_ptr, t);
  730. mutex_unlock(&rcu_tasks_kthread_mutex);
  731. }
  732. #endif /* #ifdef CONFIG_TASKS_RCU */
  733. #ifdef CONFIG_PROVE_RCU
  734. /*
  735. * Early boot self test parameters, one for each flavor
  736. */
  737. static bool rcu_self_test;
  738. static bool rcu_self_test_bh;
  739. static bool rcu_self_test_sched;
  740. module_param(rcu_self_test, bool, 0444);
  741. module_param(rcu_self_test_bh, bool, 0444);
  742. module_param(rcu_self_test_sched, bool, 0444);
  743. static int rcu_self_test_counter;
  744. static void test_callback(struct rcu_head *r)
  745. {
  746. rcu_self_test_counter++;
  747. pr_info("RCU test callback executed %d\n", rcu_self_test_counter);
  748. }
  749. static void early_boot_test_call_rcu(void)
  750. {
  751. static struct rcu_head head;
  752. call_rcu(&head, test_callback);
  753. }
  754. static void early_boot_test_call_rcu_bh(void)
  755. {
  756. static struct rcu_head head;
  757. call_rcu_bh(&head, test_callback);
  758. }
  759. static void early_boot_test_call_rcu_sched(void)
  760. {
  761. static struct rcu_head head;
  762. call_rcu_sched(&head, test_callback);
  763. }
  764. void rcu_early_boot_tests(void)
  765. {
  766. pr_info("Running RCU self tests\n");
  767. if (rcu_self_test)
  768. early_boot_test_call_rcu();
  769. if (rcu_self_test_bh)
  770. early_boot_test_call_rcu_bh();
  771. if (rcu_self_test_sched)
  772. early_boot_test_call_rcu_sched();
  773. }
  774. static int rcu_verify_early_boot_tests(void)
  775. {
  776. int ret = 0;
  777. int early_boot_test_counter = 0;
  778. if (rcu_self_test) {
  779. early_boot_test_counter++;
  780. rcu_barrier();
  781. }
  782. if (rcu_self_test_bh) {
  783. early_boot_test_counter++;
  784. rcu_barrier_bh();
  785. }
  786. if (rcu_self_test_sched) {
  787. early_boot_test_counter++;
  788. rcu_barrier_sched();
  789. }
  790. if (rcu_self_test_counter != early_boot_test_counter) {
  791. WARN_ON(1);
  792. ret = -1;
  793. }
  794. return ret;
  795. }
  796. late_initcall(rcu_verify_early_boot_tests);
  797. #else
  798. void rcu_early_boot_tests(void) {}
  799. #endif /* CONFIG_PROVE_RCU */