tree.h 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620
  1. /*
  2. * Read-Copy Update mechanism for mutual exclusion (tree-based version)
  3. * Internal non-public definitions.
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, you can access it online at
  17. * http://www.gnu.org/licenses/gpl-2.0.html.
  18. *
  19. * Copyright IBM Corporation, 2008
  20. *
  21. * Author: Ingo Molnar <mingo@elte.hu>
  22. * Paul E. McKenney <paulmck@linux.vnet.ibm.com>
  23. */
  24. #include <linux/cache.h>
  25. #include <linux/spinlock.h>
  26. #include <linux/threads.h>
  27. #include <linux/cpumask.h>
  28. #include <linux/seqlock.h>
  29. /*
  30. * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and
  31. * CONFIG_RCU_FANOUT_LEAF.
  32. * In theory, it should be possible to add more levels straightforwardly.
  33. * In practice, this did work well going from three levels to four.
  34. * Of course, your mileage may vary.
  35. */
  36. #define MAX_RCU_LVLS 4
  37. #define RCU_FANOUT_1 (CONFIG_RCU_FANOUT_LEAF)
  38. #define RCU_FANOUT_2 (RCU_FANOUT_1 * CONFIG_RCU_FANOUT)
  39. #define RCU_FANOUT_3 (RCU_FANOUT_2 * CONFIG_RCU_FANOUT)
  40. #define RCU_FANOUT_4 (RCU_FANOUT_3 * CONFIG_RCU_FANOUT)
  41. #if NR_CPUS <= RCU_FANOUT_1
  42. # define RCU_NUM_LVLS 1
  43. # define NUM_RCU_LVL_0 1
  44. # define NUM_RCU_LVL_1 (NR_CPUS)
  45. # define NUM_RCU_LVL_2 0
  46. # define NUM_RCU_LVL_3 0
  47. # define NUM_RCU_LVL_4 0
  48. #elif NR_CPUS <= RCU_FANOUT_2
  49. # define RCU_NUM_LVLS 2
  50. # define NUM_RCU_LVL_0 1
  51. # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  52. # define NUM_RCU_LVL_2 (NR_CPUS)
  53. # define NUM_RCU_LVL_3 0
  54. # define NUM_RCU_LVL_4 0
  55. #elif NR_CPUS <= RCU_FANOUT_3
  56. # define RCU_NUM_LVLS 3
  57. # define NUM_RCU_LVL_0 1
  58. # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
  59. # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  60. # define NUM_RCU_LVL_3 (NR_CPUS)
  61. # define NUM_RCU_LVL_4 0
  62. #elif NR_CPUS <= RCU_FANOUT_4
  63. # define RCU_NUM_LVLS 4
  64. # define NUM_RCU_LVL_0 1
  65. # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
  66. # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
  67. # define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
  68. # define NUM_RCU_LVL_4 (NR_CPUS)
  69. #else
  70. # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS"
  71. #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */
  72. #define RCU_SUM (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3 + NUM_RCU_LVL_4)
  73. #define NUM_RCU_NODES (RCU_SUM - NR_CPUS)
  74. extern int rcu_num_lvls;
  75. extern int rcu_num_nodes;
  76. /*
  77. * Dynticks per-CPU state.
  78. */
  79. struct rcu_dynticks {
  80. long long dynticks_nesting; /* Track irq/process nesting level. */
  81. /* Process level is worth LLONG_MAX/2. */
  82. int dynticks_nmi_nesting; /* Track NMI nesting level. */
  83. atomic_t dynticks; /* Even value for idle, else odd. */
  84. #ifdef CONFIG_NO_HZ_FULL_SYSIDLE
  85. long long dynticks_idle_nesting;
  86. /* irq/process nesting level from idle. */
  87. atomic_t dynticks_idle; /* Even value for idle, else odd. */
  88. /* "Idle" excludes userspace execution. */
  89. unsigned long dynticks_idle_jiffies;
  90. /* End of last non-NMI non-idle period. */
  91. #endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */
  92. #ifdef CONFIG_RCU_FAST_NO_HZ
  93. bool all_lazy; /* Are all CPU's CBs lazy? */
  94. unsigned long nonlazy_posted;
  95. /* # times non-lazy CBs posted to CPU. */
  96. unsigned long nonlazy_posted_snap;
  97. /* idle-period nonlazy_posted snapshot. */
  98. unsigned long last_accelerate;
  99. /* Last jiffy CBs were accelerated. */
  100. unsigned long last_advance_all;
  101. /* Last jiffy CBs were all advanced. */
  102. int tick_nohz_enabled_snap; /* Previously seen value from sysfs. */
  103. #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
  104. };
  105. /* RCU's kthread states for tracing. */
  106. #define RCU_KTHREAD_STOPPED 0
  107. #define RCU_KTHREAD_RUNNING 1
  108. #define RCU_KTHREAD_WAITING 2
  109. #define RCU_KTHREAD_OFFCPU 3
  110. #define RCU_KTHREAD_YIELDING 4
  111. #define RCU_KTHREAD_MAX 4
  112. /*
  113. * Definition for node within the RCU grace-period-detection hierarchy.
  114. */
  115. struct rcu_node {
  116. raw_spinlock_t lock; /* Root rcu_node's lock protects some */
  117. /* rcu_state fields as well as following. */
  118. unsigned long gpnum; /* Current grace period for this node. */
  119. /* This will either be equal to or one */
  120. /* behind the root rcu_node's gpnum. */
  121. unsigned long completed; /* Last GP completed for this node. */
  122. /* This will either be equal to or one */
  123. /* behind the root rcu_node's gpnum. */
  124. unsigned long qsmask; /* CPUs or groups that need to switch in */
  125. /* order for current grace period to proceed.*/
  126. /* In leaf rcu_node, each bit corresponds to */
  127. /* an rcu_data structure, otherwise, each */
  128. /* bit corresponds to a child rcu_node */
  129. /* structure. */
  130. unsigned long expmask; /* Groups that have ->blkd_tasks */
  131. /* elements that need to drain to allow the */
  132. /* current expedited grace period to */
  133. /* complete (only for PREEMPT_RCU). */
  134. unsigned long qsmaskinit;
  135. /* Per-GP initial value for qsmask & expmask. */
  136. /* Initialized from ->qsmaskinitnext at the */
  137. /* beginning of each grace period. */
  138. unsigned long qsmaskinitnext;
  139. /* Online CPUs for next grace period. */
  140. unsigned long grpmask; /* Mask to apply to parent qsmask. */
  141. /* Only one bit will be set in this mask. */
  142. int grplo; /* lowest-numbered CPU or group here. */
  143. int grphi; /* highest-numbered CPU or group here. */
  144. u8 grpnum; /* CPU/group number for next level up. */
  145. u8 level; /* root is at level 0. */
  146. bool wait_blkd_tasks;/* Necessary to wait for blocked tasks to */
  147. /* exit RCU read-side critical sections */
  148. /* before propagating offline up the */
  149. /* rcu_node tree? */
  150. struct rcu_node *parent;
  151. struct list_head blkd_tasks;
  152. /* Tasks blocked in RCU read-side critical */
  153. /* section. Tasks are placed at the head */
  154. /* of this list and age towards the tail. */
  155. struct list_head *gp_tasks;
  156. /* Pointer to the first task blocking the */
  157. /* current grace period, or NULL if there */
  158. /* is no such task. */
  159. struct list_head *exp_tasks;
  160. /* Pointer to the first task blocking the */
  161. /* current expedited grace period, or NULL */
  162. /* if there is no such task. If there */
  163. /* is no current expedited grace period, */
  164. /* then there can cannot be any such task. */
  165. #ifdef CONFIG_RCU_BOOST
  166. struct list_head *boost_tasks;
  167. /* Pointer to first task that needs to be */
  168. /* priority boosted, or NULL if no priority */
  169. /* boosting is needed for this rcu_node */
  170. /* structure. If there are no tasks */
  171. /* queued on this rcu_node structure that */
  172. /* are blocking the current grace period, */
  173. /* there can be no such task. */
  174. struct rt_mutex boost_mtx;
  175. /* Used only for the priority-boosting */
  176. /* side effect, not as a lock. */
  177. unsigned long boost_time;
  178. /* When to start boosting (jiffies). */
  179. struct task_struct *boost_kthread_task;
  180. /* kthread that takes care of priority */
  181. /* boosting for this rcu_node structure. */
  182. unsigned int boost_kthread_status;
  183. /* State of boost_kthread_task for tracing. */
  184. unsigned long n_tasks_boosted;
  185. /* Total number of tasks boosted. */
  186. unsigned long n_exp_boosts;
  187. /* Number of tasks boosted for expedited GP. */
  188. unsigned long n_normal_boosts;
  189. /* Number of tasks boosted for normal GP. */
  190. unsigned long n_balk_blkd_tasks;
  191. /* Refused to boost: no blocked tasks. */
  192. unsigned long n_balk_exp_gp_tasks;
  193. /* Refused to boost: nothing blocking GP. */
  194. unsigned long n_balk_boost_tasks;
  195. /* Refused to boost: already boosting. */
  196. unsigned long n_balk_notblocked;
  197. /* Refused to boost: RCU RS CS still running. */
  198. unsigned long n_balk_notyet;
  199. /* Refused to boost: not yet time. */
  200. unsigned long n_balk_nos;
  201. /* Refused to boost: not sure why, though. */
  202. /* This can happen due to race conditions. */
  203. #endif /* #ifdef CONFIG_RCU_BOOST */
  204. #ifdef CONFIG_RCU_NOCB_CPU
  205. wait_queue_head_t nocb_gp_wq[2];
  206. /* Place for rcu_nocb_kthread() to wait GP. */
  207. #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
  208. int need_future_gp[2];
  209. /* Counts of upcoming no-CB GP requests. */
  210. raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
  211. } ____cacheline_internodealigned_in_smp;
  212. /*
  213. * Do a full breadth-first scan of the rcu_node structures for the
  214. * specified rcu_state structure.
  215. */
  216. #define rcu_for_each_node_breadth_first(rsp, rnp) \
  217. for ((rnp) = &(rsp)->node[0]; \
  218. (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
  219. /*
  220. * Do a breadth-first scan of the non-leaf rcu_node structures for the
  221. * specified rcu_state structure. Note that if there is a singleton
  222. * rcu_node tree with but one rcu_node structure, this loop is a no-op.
  223. */
  224. #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \
  225. for ((rnp) = &(rsp)->node[0]; \
  226. (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++)
  227. /*
  228. * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
  229. * structure. Note that if there is a singleton rcu_node tree with but
  230. * one rcu_node structure, this loop -will- visit the rcu_node structure.
  231. * It is still a leaf node, even if it is also the root node.
  232. */
  233. #define rcu_for_each_leaf_node(rsp, rnp) \
  234. for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \
  235. (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
  236. /* Index values for nxttail array in struct rcu_data. */
  237. #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */
  238. #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */
  239. #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */
  240. #define RCU_NEXT_TAIL 3
  241. #define RCU_NEXT_SIZE 4
  242. /* Per-CPU data for read-copy update. */
  243. struct rcu_data {
  244. /* 1) quiescent-state and grace-period handling : */
  245. unsigned long completed; /* Track rsp->completed gp number */
  246. /* in order to detect GP end. */
  247. unsigned long gpnum; /* Highest gp number that this CPU */
  248. /* is aware of having started. */
  249. unsigned long rcu_qs_ctr_snap;/* Snapshot of rcu_qs_ctr to check */
  250. /* for rcu_all_qs() invocations. */
  251. bool passed_quiesce; /* User-mode/idle loop etc. */
  252. bool qs_pending; /* Core waits for quiesc state. */
  253. bool beenonline; /* CPU online at least once. */
  254. bool gpwrap; /* Possible gpnum/completed wrap. */
  255. struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
  256. unsigned long grpmask; /* Mask to apply to leaf qsmask. */
  257. #ifdef CONFIG_RCU_CPU_STALL_INFO
  258. unsigned long ticks_this_gp; /* The number of scheduling-clock */
  259. /* ticks this CPU has handled */
  260. /* during and after the last grace */
  261. /* period it is aware of. */
  262. #endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
  263. /* 2) batch handling */
  264. /*
  265. * If nxtlist is not NULL, it is partitioned as follows.
  266. * Any of the partitions might be empty, in which case the
  267. * pointer to that partition will be equal to the pointer for
  268. * the following partition. When the list is empty, all of
  269. * the nxttail elements point to the ->nxtlist pointer itself,
  270. * which in that case is NULL.
  271. *
  272. * [nxtlist, *nxttail[RCU_DONE_TAIL]):
  273. * Entries that batch # <= ->completed
  274. * The grace period for these entries has completed, and
  275. * the other grace-period-completed entries may be moved
  276. * here temporarily in rcu_process_callbacks().
  277. * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
  278. * Entries that batch # <= ->completed - 1: waiting for current GP
  279. * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
  280. * Entries known to have arrived before current GP ended
  281. * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
  282. * Entries that might have arrived after current GP ended
  283. * Note that the value of *nxttail[RCU_NEXT_TAIL] will
  284. * always be NULL, as this is the end of the list.
  285. */
  286. struct rcu_head *nxtlist;
  287. struct rcu_head **nxttail[RCU_NEXT_SIZE];
  288. unsigned long nxtcompleted[RCU_NEXT_SIZE];
  289. /* grace periods for sublists. */
  290. long qlen_lazy; /* # of lazy queued callbacks */
  291. long qlen; /* # of queued callbacks, incl lazy */
  292. long qlen_last_fqs_check;
  293. /* qlen at last check for QS forcing */
  294. unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */
  295. unsigned long n_nocbs_invoked; /* count of no-CBs RCU cbs invoked. */
  296. unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
  297. unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */
  298. unsigned long n_force_qs_snap;
  299. /* did other CPU force QS recently? */
  300. long blimit; /* Upper limit on a processed batch */
  301. /* 3) dynticks interface. */
  302. struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */
  303. int dynticks_snap; /* Per-GP tracking for dynticks. */
  304. /* 4) reasons this CPU needed to be kicked by force_quiescent_state */
  305. unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */
  306. unsigned long offline_fqs; /* Kicked due to being offline. */
  307. unsigned long cond_resched_completed;
  308. /* Grace period that needs help */
  309. /* from cond_resched(). */
  310. /* 5) __rcu_pending() statistics. */
  311. unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */
  312. unsigned long n_rp_qs_pending;
  313. unsigned long n_rp_report_qs;
  314. unsigned long n_rp_cb_ready;
  315. unsigned long n_rp_cpu_needs_gp;
  316. unsigned long n_rp_gp_completed;
  317. unsigned long n_rp_gp_started;
  318. unsigned long n_rp_nocb_defer_wakeup;
  319. unsigned long n_rp_need_nothing;
  320. /* 6) _rcu_barrier() and OOM callbacks. */
  321. struct rcu_head barrier_head;
  322. #ifdef CONFIG_RCU_FAST_NO_HZ
  323. struct rcu_head oom_head;
  324. #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
  325. /* 7) Callback offloading. */
  326. #ifdef CONFIG_RCU_NOCB_CPU
  327. struct rcu_head *nocb_head; /* CBs waiting for kthread. */
  328. struct rcu_head **nocb_tail;
  329. atomic_long_t nocb_q_count; /* # CBs waiting for nocb */
  330. atomic_long_t nocb_q_count_lazy; /* invocation (all stages). */
  331. struct rcu_head *nocb_follower_head; /* CBs ready to invoke. */
  332. struct rcu_head **nocb_follower_tail;
  333. wait_queue_head_t nocb_wq; /* For nocb kthreads to sleep on. */
  334. struct task_struct *nocb_kthread;
  335. int nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */
  336. /* The following fields are used by the leader, hence own cacheline. */
  337. struct rcu_head *nocb_gp_head ____cacheline_internodealigned_in_smp;
  338. /* CBs waiting for GP. */
  339. struct rcu_head **nocb_gp_tail;
  340. bool nocb_leader_sleep; /* Is the nocb leader thread asleep? */
  341. struct rcu_data *nocb_next_follower;
  342. /* Next follower in wakeup chain. */
  343. /* The following fields are used by the follower, hence new cachline. */
  344. struct rcu_data *nocb_leader ____cacheline_internodealigned_in_smp;
  345. /* Leader CPU takes GP-end wakeups. */
  346. #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
  347. /* 8) RCU CPU stall data. */
  348. #ifdef CONFIG_RCU_CPU_STALL_INFO
  349. unsigned int softirq_snap; /* Snapshot of softirq activity. */
  350. #endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
  351. int cpu;
  352. struct rcu_state *rsp;
  353. };
  354. /* Values for fqs_state field in struct rcu_state. */
  355. #define RCU_GP_IDLE 0 /* No grace period in progress. */
  356. #define RCU_GP_INIT 1 /* Grace period being initialized. */
  357. #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */
  358. #define RCU_FORCE_QS 3 /* Need to force quiescent state. */
  359. #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK
  360. /* Values for nocb_defer_wakeup field in struct rcu_data. */
  361. #define RCU_NOGP_WAKE_NOT 0
  362. #define RCU_NOGP_WAKE 1
  363. #define RCU_NOGP_WAKE_FORCE 2
  364. #define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
  365. /* For jiffies_till_first_fqs and */
  366. /* and jiffies_till_next_fqs. */
  367. #define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */
  368. /* delay between bouts of */
  369. /* quiescent-state forcing. */
  370. #define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */
  371. /* at least one scheduling clock */
  372. /* irq before ratting on them. */
  373. #define rcu_wait(cond) \
  374. do { \
  375. for (;;) { \
  376. set_current_state(TASK_INTERRUPTIBLE); \
  377. if (cond) \
  378. break; \
  379. schedule(); \
  380. } \
  381. __set_current_state(TASK_RUNNING); \
  382. } while (0)
  383. /*
  384. * RCU global state, including node hierarchy. This hierarchy is
  385. * represented in "heap" form in a dense array. The root (first level)
  386. * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
  387. * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
  388. * and the third level in ->node[m+1] and following (->node[m+1] referenced
  389. * by ->level[2]). The number of levels is determined by the number of
  390. * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
  391. * consisting of a single rcu_node.
  392. */
  393. struct rcu_state {
  394. struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
  395. struct rcu_node *level[RCU_NUM_LVLS]; /* Hierarchy levels. */
  396. u32 levelcnt[MAX_RCU_LVLS + 1]; /* # nodes in each level. */
  397. u8 levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */
  398. u8 flavor_mask; /* bit in flavor mask. */
  399. struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */
  400. void (*call)(struct rcu_head *head, /* call_rcu() flavor. */
  401. void (*func)(struct rcu_head *head));
  402. /* The following fields are guarded by the root rcu_node's lock. */
  403. u8 fqs_state ____cacheline_internodealigned_in_smp;
  404. /* Force QS state. */
  405. u8 boost; /* Subject to priority boost. */
  406. unsigned long gpnum; /* Current gp number. */
  407. unsigned long completed; /* # of last completed gp. */
  408. struct task_struct *gp_kthread; /* Task for grace periods. */
  409. wait_queue_head_t gp_wq; /* Where GP task waits. */
  410. short gp_flags; /* Commands for GP task. */
  411. short gp_state; /* GP kthread sleep state. */
  412. /* End of fields guarded by root rcu_node's lock. */
  413. raw_spinlock_t orphan_lock ____cacheline_internodealigned_in_smp;
  414. /* Protect following fields. */
  415. struct rcu_head *orphan_nxtlist; /* Orphaned callbacks that */
  416. /* need a grace period. */
  417. struct rcu_head **orphan_nxttail; /* Tail of above. */
  418. struct rcu_head *orphan_donelist; /* Orphaned callbacks that */
  419. /* are ready to invoke. */
  420. struct rcu_head **orphan_donetail; /* Tail of above. */
  421. long qlen_lazy; /* Number of lazy callbacks. */
  422. long qlen; /* Total number of callbacks. */
  423. /* End of fields guarded by orphan_lock. */
  424. struct mutex barrier_mutex; /* Guards barrier fields. */
  425. atomic_t barrier_cpu_count; /* # CPUs waiting on. */
  426. struct completion barrier_completion; /* Wake at barrier end. */
  427. unsigned long n_barrier_done; /* ++ at start and end of */
  428. /* _rcu_barrier(). */
  429. /* End of fields guarded by barrier_mutex. */
  430. atomic_long_t expedited_start; /* Starting ticket. */
  431. atomic_long_t expedited_done; /* Done ticket. */
  432. atomic_long_t expedited_wrap; /* # near-wrap incidents. */
  433. atomic_long_t expedited_tryfail; /* # acquisition failures. */
  434. atomic_long_t expedited_workdone1; /* # done by others #1. */
  435. atomic_long_t expedited_workdone2; /* # done by others #2. */
  436. atomic_long_t expedited_normal; /* # fallbacks to normal. */
  437. atomic_long_t expedited_stoppedcpus; /* # successful stop_cpus. */
  438. atomic_long_t expedited_done_tries; /* # tries to update _done. */
  439. atomic_long_t expedited_done_lost; /* # times beaten to _done. */
  440. atomic_long_t expedited_done_exit; /* # times exited _done loop. */
  441. unsigned long jiffies_force_qs; /* Time at which to invoke */
  442. /* force_quiescent_state(). */
  443. unsigned long n_force_qs; /* Number of calls to */
  444. /* force_quiescent_state(). */
  445. unsigned long n_force_qs_lh; /* ~Number of calls leaving */
  446. /* due to lock unavailable. */
  447. unsigned long n_force_qs_ngp; /* Number of calls leaving */
  448. /* due to no GP active. */
  449. unsigned long gp_start; /* Time at which GP started, */
  450. /* but in jiffies. */
  451. unsigned long gp_activity; /* Time of last GP kthread */
  452. /* activity in jiffies. */
  453. unsigned long jiffies_stall; /* Time at which to check */
  454. /* for CPU stalls. */
  455. unsigned long jiffies_resched; /* Time at which to resched */
  456. /* a reluctant CPU. */
  457. unsigned long n_force_qs_gpstart; /* Snapshot of n_force_qs at */
  458. /* GP start. */
  459. unsigned long gp_max; /* Maximum GP duration in */
  460. /* jiffies. */
  461. const char *name; /* Name of structure. */
  462. char abbr; /* Abbreviated name. */
  463. struct list_head flavors; /* List of RCU flavors. */
  464. };
  465. /* Values for rcu_state structure's gp_flags field. */
  466. #define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */
  467. #define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */
  468. /* Values for rcu_state structure's gp_flags field. */
  469. #define RCU_GP_WAIT_INIT 0 /* Initial state. */
  470. #define RCU_GP_WAIT_GPS 1 /* Wait for grace-period start. */
  471. #define RCU_GP_WAIT_FQS 2 /* Wait for force-quiescent-state time. */
  472. extern struct list_head rcu_struct_flavors;
  473. /* Sequence through rcu_state structures for each RCU flavor. */
  474. #define for_each_rcu_flavor(rsp) \
  475. list_for_each_entry((rsp), &rcu_struct_flavors, flavors)
  476. /*
  477. * RCU implementation internal declarations:
  478. */
  479. extern struct rcu_state rcu_sched_state;
  480. DECLARE_PER_CPU(struct rcu_data, rcu_sched_data);
  481. extern struct rcu_state rcu_bh_state;
  482. DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);
  483. #ifdef CONFIG_PREEMPT_RCU
  484. extern struct rcu_state rcu_preempt_state;
  485. DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data);
  486. #endif /* #ifdef CONFIG_PREEMPT_RCU */
  487. #ifdef CONFIG_RCU_BOOST
  488. DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status);
  489. DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu);
  490. DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops);
  491. DECLARE_PER_CPU(char, rcu_cpu_has_work);
  492. #endif /* #ifdef CONFIG_RCU_BOOST */
  493. #ifndef RCU_TREE_NONCORE
  494. /* Forward declarations for rcutree_plugin.h */
  495. static void rcu_bootup_announce(void);
  496. static void rcu_preempt_note_context_switch(void);
  497. static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
  498. #ifdef CONFIG_HOTPLUG_CPU
  499. static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
  500. #endif /* #ifdef CONFIG_HOTPLUG_CPU */
  501. static void rcu_print_detail_task_stall(struct rcu_state *rsp);
  502. static int rcu_print_task_stall(struct rcu_node *rnp);
  503. static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
  504. static void rcu_preempt_check_callbacks(void);
  505. void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu));
  506. static void __init __rcu_init_preempt(void);
  507. static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
  508. static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
  509. static void invoke_rcu_callbacks_kthread(void);
  510. static bool rcu_is_callbacks_kthread(void);
  511. #ifdef CONFIG_RCU_BOOST
  512. static void rcu_preempt_do_callbacks(void);
  513. static int rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
  514. struct rcu_node *rnp);
  515. #endif /* #ifdef CONFIG_RCU_BOOST */
  516. static void __init rcu_spawn_boost_kthreads(void);
  517. static void rcu_prepare_kthreads(int cpu);
  518. static void rcu_cleanup_after_idle(void);
  519. static void rcu_prepare_for_idle(void);
  520. static void rcu_idle_count_callbacks_posted(void);
  521. static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
  522. static void print_cpu_stall_info_begin(void);
  523. static void print_cpu_stall_info(struct rcu_state *rsp, int cpu);
  524. static void print_cpu_stall_info_end(void);
  525. static void zero_cpu_stall_ticks(struct rcu_data *rdp);
  526. static void increment_cpu_stall_ticks(void);
  527. static bool rcu_nocb_cpu_needs_barrier(struct rcu_state *rsp, int cpu);
  528. static void rcu_nocb_gp_set(struct rcu_node *rnp, int nrq);
  529. static void rcu_nocb_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp);
  530. static void rcu_init_one_nocb(struct rcu_node *rnp);
  531. static bool __call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *rhp,
  532. bool lazy, unsigned long flags);
  533. static bool rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp,
  534. struct rcu_data *rdp,
  535. unsigned long flags);
  536. static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp);
  537. static void do_nocb_deferred_wakeup(struct rcu_data *rdp);
  538. static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
  539. static void rcu_spawn_all_nocb_kthreads(int cpu);
  540. static void __init rcu_spawn_nocb_kthreads(void);
  541. #ifdef CONFIG_RCU_NOCB_CPU
  542. static void __init rcu_organize_nocb_kthreads(struct rcu_state *rsp);
  543. #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
  544. static void __maybe_unused rcu_kick_nohz_cpu(int cpu);
  545. static bool init_nocb_callback_list(struct rcu_data *rdp);
  546. static void rcu_sysidle_enter(int irq);
  547. static void rcu_sysidle_exit(int irq);
  548. static void rcu_sysidle_check_cpu(struct rcu_data *rdp, bool *isidle,
  549. unsigned long *maxj);
  550. static bool is_sysidle_rcu_state(struct rcu_state *rsp);
  551. static void rcu_sysidle_report_gp(struct rcu_state *rsp, int isidle,
  552. unsigned long maxj);
  553. static void rcu_bind_gp_kthread(void);
  554. static void rcu_sysidle_init_percpu_data(struct rcu_dynticks *rdtp);
  555. static bool rcu_nohz_full_cpu(struct rcu_state *rsp);
  556. static void rcu_dynticks_task_enter(void);
  557. static void rcu_dynticks_task_exit(void);
  558. #endif /* #ifndef RCU_TREE_NONCORE */
  559. #ifdef CONFIG_RCU_TRACE
  560. /* Read out queue lengths for tracing. */
  561. static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
  562. {
  563. #ifdef CONFIG_RCU_NOCB_CPU
  564. *ql = atomic_long_read(&rdp->nocb_q_count);
  565. *qll = atomic_long_read(&rdp->nocb_q_count_lazy);
  566. #else /* #ifdef CONFIG_RCU_NOCB_CPU */
  567. *ql = 0;
  568. *qll = 0;
  569. #endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
  570. }
  571. #endif /* #ifdef CONFIG_RCU_TRACE */