2 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
3 * Internal non-public definitions.
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.
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.
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.
19 * Copyright IBM Corporation, 2008
21 * Author: Ingo Molnar <mingo@elte.hu>
22 * Paul E. McKenney <paulmck@linux.vnet.ibm.com>
25 #include <linux/cache.h>
26 #include <linux/spinlock.h>
27 #include <linux/threads.h>
28 #include <linux/cpumask.h>
29 #include <linux/seqlock.h>
30 #include <linux/swait.h>
31 #include <linux/stop_machine.h>
34 * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and
35 * CONFIG_RCU_FANOUT_LEAF.
36 * In theory, it should be possible to add more levels straightforwardly.
37 * In practice, this did work well going from three levels to four.
38 * Of course, your mileage may vary.
41 #ifdef CONFIG_RCU_FANOUT
42 #define RCU_FANOUT CONFIG_RCU_FANOUT
43 #else /* #ifdef CONFIG_RCU_FANOUT */
45 # define RCU_FANOUT 64
47 # define RCU_FANOUT 32
49 #endif /* #else #ifdef CONFIG_RCU_FANOUT */
51 #ifdef CONFIG_RCU_FANOUT_LEAF
52 #define RCU_FANOUT_LEAF CONFIG_RCU_FANOUT_LEAF
53 #else /* #ifdef CONFIG_RCU_FANOUT_LEAF */
55 # define RCU_FANOUT_LEAF 64
57 # define RCU_FANOUT_LEAF 32
59 #endif /* #else #ifdef CONFIG_RCU_FANOUT_LEAF */
61 #define RCU_FANOUT_1 (RCU_FANOUT_LEAF)
62 #define RCU_FANOUT_2 (RCU_FANOUT_1 * RCU_FANOUT)
63 #define RCU_FANOUT_3 (RCU_FANOUT_2 * RCU_FANOUT)
64 #define RCU_FANOUT_4 (RCU_FANOUT_3 * RCU_FANOUT)
66 #if NR_CPUS <= RCU_FANOUT_1
67 # define RCU_NUM_LVLS 1
68 # define NUM_RCU_LVL_0 1
69 # define NUM_RCU_NODES NUM_RCU_LVL_0
70 # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0 }
71 # define RCU_NODE_NAME_INIT { "rcu_node_0" }
72 # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0" }
73 #elif NR_CPUS <= RCU_FANOUT_2
74 # define RCU_NUM_LVLS 2
75 # define NUM_RCU_LVL_0 1
76 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
77 # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1)
78 # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1 }
79 # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1" }
80 # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1" }
81 #elif NR_CPUS <= RCU_FANOUT_3
82 # define RCU_NUM_LVLS 3
83 # define NUM_RCU_LVL_0 1
84 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
85 # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
86 # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2)
87 # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1, NUM_RCU_LVL_2 }
88 # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1", "rcu_node_2" }
89 # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1", "rcu_node_fqs_2" }
90 #elif NR_CPUS <= RCU_FANOUT_4
91 # define RCU_NUM_LVLS 4
92 # define NUM_RCU_LVL_0 1
93 # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
94 # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
95 # define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
96 # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3)
97 # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1, NUM_RCU_LVL_2, NUM_RCU_LVL_3 }
98 # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1", "rcu_node_2", "rcu_node_3" }
99 # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1", "rcu_node_fqs_2", "rcu_node_fqs_3" }
101 # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS"
102 #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */
104 extern int rcu_num_lvls;
105 extern int rcu_num_nodes;
108 * Dynticks per-CPU state.
110 struct rcu_dynticks {
111 long long dynticks_nesting; /* Track irq/process nesting level. */
112 /* Process level is worth LLONG_MAX/2. */
113 int dynticks_nmi_nesting; /* Track NMI nesting level. */
114 atomic_t dynticks; /* Even value for idle, else odd. */
115 #ifdef CONFIG_NO_HZ_FULL_SYSIDLE
116 long long dynticks_idle_nesting;
117 /* irq/process nesting level from idle. */
118 atomic_t dynticks_idle; /* Even value for idle, else odd. */
119 /* "Idle" excludes userspace execution. */
120 unsigned long dynticks_idle_jiffies;
121 /* End of last non-NMI non-idle period. */
122 #endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */
123 #ifdef CONFIG_RCU_FAST_NO_HZ
124 bool all_lazy; /* Are all CPU's CBs lazy? */
125 unsigned long nonlazy_posted;
126 /* # times non-lazy CBs posted to CPU. */
127 unsigned long nonlazy_posted_snap;
128 /* idle-period nonlazy_posted snapshot. */
129 unsigned long last_accelerate;
130 /* Last jiffy CBs were accelerated. */
131 unsigned long last_advance_all;
132 /* Last jiffy CBs were all advanced. */
133 int tick_nohz_enabled_snap; /* Previously seen value from sysfs. */
134 #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
137 /* RCU's kthread states for tracing. */
138 #define RCU_KTHREAD_STOPPED 0
139 #define RCU_KTHREAD_RUNNING 1
140 #define RCU_KTHREAD_WAITING 2
141 #define RCU_KTHREAD_OFFCPU 3
142 #define RCU_KTHREAD_YIELDING 4
143 #define RCU_KTHREAD_MAX 4
146 * Definition for node within the RCU grace-period-detection hierarchy.
149 raw_spinlock_t __private lock; /* Root rcu_node's lock protects */
150 /* some rcu_state fields as well as */
152 unsigned long gpnum; /* Current grace period for this node. */
153 /* This will either be equal to or one */
154 /* behind the root rcu_node's gpnum. */
155 unsigned long completed; /* Last GP completed for this node. */
156 /* This will either be equal to or one */
157 /* behind the root rcu_node's gpnum. */
158 unsigned long qsmask; /* CPUs or groups that need to switch in */
159 /* order for current grace period to proceed.*/
160 /* In leaf rcu_node, each bit corresponds to */
161 /* an rcu_data structure, otherwise, each */
162 /* bit corresponds to a child rcu_node */
164 unsigned long qsmaskinit;
165 /* Per-GP initial value for qsmask. */
166 /* Initialized from ->qsmaskinitnext at the */
167 /* beginning of each grace period. */
168 unsigned long qsmaskinitnext;
169 /* Online CPUs for next grace period. */
170 unsigned long expmask; /* CPUs or groups that need to check in */
171 /* to allow the current expedited GP */
173 unsigned long expmaskinit;
174 /* Per-GP initial values for expmask. */
175 /* Initialized from ->expmaskinitnext at the */
176 /* beginning of each expedited GP. */
177 unsigned long expmaskinitnext;
178 /* Online CPUs for next expedited GP. */
179 /* Any CPU that has ever been online will */
180 /* have its bit set. */
181 unsigned long grpmask; /* Mask to apply to parent qsmask. */
182 /* Only one bit will be set in this mask. */
183 int grplo; /* lowest-numbered CPU or group here. */
184 int grphi; /* highest-numbered CPU or group here. */
185 u8 grpnum; /* CPU/group number for next level up. */
186 u8 level; /* root is at level 0. */
187 bool wait_blkd_tasks;/* Necessary to wait for blocked tasks to */
188 /* exit RCU read-side critical sections */
189 /* before propagating offline up the */
191 struct rcu_node *parent;
192 struct list_head blkd_tasks;
193 /* Tasks blocked in RCU read-side critical */
194 /* section. Tasks are placed at the head */
195 /* of this list and age towards the tail. */
196 struct list_head *gp_tasks;
197 /* Pointer to the first task blocking the */
198 /* current grace period, or NULL if there */
199 /* is no such task. */
200 struct list_head *exp_tasks;
201 /* Pointer to the first task blocking the */
202 /* current expedited grace period, or NULL */
203 /* if there is no such task. If there */
204 /* is no current expedited grace period, */
205 /* then there can cannot be any such task. */
206 struct list_head *boost_tasks;
207 /* Pointer to first task that needs to be */
208 /* priority boosted, or NULL if no priority */
209 /* boosting is needed for this rcu_node */
210 /* structure. If there are no tasks */
211 /* queued on this rcu_node structure that */
212 /* are blocking the current grace period, */
213 /* there can be no such task. */
214 struct rt_mutex boost_mtx;
215 /* Used only for the priority-boosting */
216 /* side effect, not as a lock. */
217 unsigned long boost_time;
218 /* When to start boosting (jiffies). */
219 struct task_struct *boost_kthread_task;
220 /* kthread that takes care of priority */
221 /* boosting for this rcu_node structure. */
222 unsigned int boost_kthread_status;
223 /* State of boost_kthread_task for tracing. */
224 unsigned long n_tasks_boosted;
225 /* Total number of tasks boosted. */
226 unsigned long n_exp_boosts;
227 /* Number of tasks boosted for expedited GP. */
228 unsigned long n_normal_boosts;
229 /* Number of tasks boosted for normal GP. */
230 unsigned long n_balk_blkd_tasks;
231 /* Refused to boost: no blocked tasks. */
232 unsigned long n_balk_exp_gp_tasks;
233 /* Refused to boost: nothing blocking GP. */
234 unsigned long n_balk_boost_tasks;
235 /* Refused to boost: already boosting. */
236 unsigned long n_balk_notblocked;
237 /* Refused to boost: RCU RS CS still running. */
238 unsigned long n_balk_notyet;
239 /* Refused to boost: not yet time. */
240 unsigned long n_balk_nos;
241 /* Refused to boost: not sure why, though. */
242 /* This can happen due to race conditions. */
243 #ifdef CONFIG_RCU_NOCB_CPU
244 struct swait_queue_head nocb_gp_wq[2];
245 /* Place for rcu_nocb_kthread() to wait GP. */
246 #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
247 int need_future_gp[2];
248 /* Counts of upcoming no-CB GP requests. */
249 raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
251 spinlock_t exp_lock ____cacheline_internodealigned_in_smp;
252 unsigned long exp_seq_rq;
253 wait_queue_head_t exp_wq[4];
254 } ____cacheline_internodealigned_in_smp;
257 * Bitmasks in an rcu_node cover the interval [grplo, grphi] of CPU IDs, and
258 * are indexed relative to this interval rather than the global CPU ID space.
259 * This generates the bit for a CPU in node-local masks.
261 #define leaf_node_cpu_bit(rnp, cpu) (1UL << ((cpu) - (rnp)->grplo))
264 * Do a full breadth-first scan of the rcu_node structures for the
265 * specified rcu_state structure.
267 #define rcu_for_each_node_breadth_first(rsp, rnp) \
268 for ((rnp) = &(rsp)->node[0]; \
269 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
272 * Do a breadth-first scan of the non-leaf rcu_node structures for the
273 * specified rcu_state structure. Note that if there is a singleton
274 * rcu_node tree with but one rcu_node structure, this loop is a no-op.
276 #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \
277 for ((rnp) = &(rsp)->node[0]; \
278 (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++)
281 * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
282 * structure. Note that if there is a singleton rcu_node tree with but
283 * one rcu_node structure, this loop -will- visit the rcu_node structure.
284 * It is still a leaf node, even if it is also the root node.
286 #define rcu_for_each_leaf_node(rsp, rnp) \
287 for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \
288 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
291 * Iterate over all possible CPUs in a leaf RCU node.
293 #define for_each_leaf_node_possible_cpu(rnp, cpu) \
294 for ((cpu) = cpumask_next(rnp->grplo - 1, cpu_possible_mask); \
296 cpu = cpumask_next((cpu), cpu_possible_mask))
299 * Union to allow "aggregate OR" operation on the need for a quiescent
300 * state by the normal and expedited grace periods.
307 u16 s; /* Set of bits, aggregate OR here. */
310 /* Index values for nxttail array in struct rcu_data. */
311 #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */
312 #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */
313 #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */
314 #define RCU_NEXT_TAIL 3
315 #define RCU_NEXT_SIZE 4
317 /* Per-CPU data for read-copy update. */
319 /* 1) quiescent-state and grace-period handling : */
320 unsigned long completed; /* Track rsp->completed gp number */
321 /* in order to detect GP end. */
322 unsigned long gpnum; /* Highest gp number that this CPU */
323 /* is aware of having started. */
324 unsigned long rcu_qs_ctr_snap;/* Snapshot of rcu_qs_ctr to check */
325 /* for rcu_all_qs() invocations. */
326 union rcu_noqs cpu_no_qs; /* No QSes yet for this CPU. */
327 bool core_needs_qs; /* Core waits for quiesc state. */
328 bool beenonline; /* CPU online at least once. */
329 bool gpwrap; /* Possible gpnum/completed wrap. */
330 struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
331 unsigned long grpmask; /* Mask to apply to leaf qsmask. */
332 unsigned long ticks_this_gp; /* The number of scheduling-clock */
333 /* ticks this CPU has handled */
334 /* during and after the last grace */
335 /* period it is aware of. */
337 /* 2) batch handling */
339 * If nxtlist is not NULL, it is partitioned as follows.
340 * Any of the partitions might be empty, in which case the
341 * pointer to that partition will be equal to the pointer for
342 * the following partition. When the list is empty, all of
343 * the nxttail elements point to the ->nxtlist pointer itself,
344 * which in that case is NULL.
346 * [nxtlist, *nxttail[RCU_DONE_TAIL]):
347 * Entries that batch # <= ->completed
348 * The grace period for these entries has completed, and
349 * the other grace-period-completed entries may be moved
350 * here temporarily in rcu_process_callbacks().
351 * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
352 * Entries that batch # <= ->completed - 1: waiting for current GP
353 * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
354 * Entries known to have arrived before current GP ended
355 * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
356 * Entries that might have arrived after current GP ended
357 * Note that the value of *nxttail[RCU_NEXT_TAIL] will
358 * always be NULL, as this is the end of the list.
360 struct rcu_head *nxtlist;
361 struct rcu_head **nxttail[RCU_NEXT_SIZE];
362 unsigned long nxtcompleted[RCU_NEXT_SIZE];
363 /* grace periods for sublists. */
364 long qlen_lazy; /* # of lazy queued callbacks */
365 long qlen; /* # of queued callbacks, incl lazy */
366 long qlen_last_fqs_check;
367 /* qlen at last check for QS forcing */
368 unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */
369 unsigned long n_nocbs_invoked; /* count of no-CBs RCU cbs invoked. */
370 unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
371 unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */
372 unsigned long n_force_qs_snap;
373 /* did other CPU force QS recently? */
374 long blimit; /* Upper limit on a processed batch */
376 /* 3) dynticks interface. */
377 struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */
378 int dynticks_snap; /* Per-GP tracking for dynticks. */
380 /* 4) reasons this CPU needed to be kicked by force_quiescent_state */
381 unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */
382 unsigned long offline_fqs; /* Kicked due to being offline. */
383 unsigned long cond_resched_completed;
384 /* Grace period that needs help */
385 /* from cond_resched(). */
387 /* 5) __rcu_pending() statistics. */
388 unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */
389 unsigned long n_rp_core_needs_qs;
390 unsigned long n_rp_report_qs;
391 unsigned long n_rp_cb_ready;
392 unsigned long n_rp_cpu_needs_gp;
393 unsigned long n_rp_gp_completed;
394 unsigned long n_rp_gp_started;
395 unsigned long n_rp_nocb_defer_wakeup;
396 unsigned long n_rp_need_nothing;
398 /* 6) _rcu_barrier(), OOM callbacks, and expediting. */
399 struct rcu_head barrier_head;
400 #ifdef CONFIG_RCU_FAST_NO_HZ
401 struct rcu_head oom_head;
402 #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
403 atomic_long_t exp_workdone1; /* # done by others #1. */
404 atomic_long_t exp_workdone2; /* # done by others #2. */
405 atomic_long_t exp_workdone3; /* # done by others #3. */
407 /* 7) Callback offloading. */
408 #ifdef CONFIG_RCU_NOCB_CPU
409 struct rcu_head *nocb_head; /* CBs waiting for kthread. */
410 struct rcu_head **nocb_tail;
411 atomic_long_t nocb_q_count; /* # CBs waiting for nocb */
412 atomic_long_t nocb_q_count_lazy; /* invocation (all stages). */
413 struct rcu_head *nocb_follower_head; /* CBs ready to invoke. */
414 struct rcu_head **nocb_follower_tail;
415 struct swait_queue_head nocb_wq; /* For nocb kthreads to sleep on. */
416 struct task_struct *nocb_kthread;
417 int nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */
419 /* The following fields are used by the leader, hence own cacheline. */
420 struct rcu_head *nocb_gp_head ____cacheline_internodealigned_in_smp;
421 /* CBs waiting for GP. */
422 struct rcu_head **nocb_gp_tail;
423 bool nocb_leader_sleep; /* Is the nocb leader thread asleep? */
424 struct rcu_data *nocb_next_follower;
425 /* Next follower in wakeup chain. */
427 /* The following fields are used by the follower, hence new cachline. */
428 struct rcu_data *nocb_leader ____cacheline_internodealigned_in_smp;
429 /* Leader CPU takes GP-end wakeups. */
430 #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
432 /* 8) RCU CPU stall data. */
433 unsigned int softirq_snap; /* Snapshot of softirq activity. */
436 struct rcu_state *rsp;
439 /* Values for nocb_defer_wakeup field in struct rcu_data. */
440 #define RCU_NOGP_WAKE_NOT 0
441 #define RCU_NOGP_WAKE 1
442 #define RCU_NOGP_WAKE_FORCE 2
444 #define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
445 /* For jiffies_till_first_fqs and */
446 /* and jiffies_till_next_fqs. */
448 #define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */
449 /* delay between bouts of */
450 /* quiescent-state forcing. */
452 #define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */
453 /* at least one scheduling clock */
454 /* irq before ratting on them. */
456 #define rcu_wait(cond) \
459 set_current_state(TASK_INTERRUPTIBLE); \
464 __set_current_state(TASK_RUNNING); \
468 * RCU global state, including node hierarchy. This hierarchy is
469 * represented in "heap" form in a dense array. The root (first level)
470 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
471 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
472 * and the third level in ->node[m+1] and following (->node[m+1] referenced
473 * by ->level[2]). The number of levels is determined by the number of
474 * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
475 * consisting of a single rcu_node.
478 struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
479 struct rcu_node *level[RCU_NUM_LVLS + 1];
480 /* Hierarchy levels (+1 to */
481 /* shut bogus gcc warning) */
482 u8 flavor_mask; /* bit in flavor mask. */
483 struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */
484 call_rcu_func_t call; /* call_rcu() flavor. */
485 int ncpus; /* # CPUs seen so far. */
487 /* The following fields are guarded by the root rcu_node's lock. */
489 u8 boost ____cacheline_internodealigned_in_smp;
490 /* Subject to priority boost. */
491 unsigned long gpnum; /* Current gp number. */
492 unsigned long completed; /* # of last completed gp. */
493 struct task_struct *gp_kthread; /* Task for grace periods. */
494 struct swait_queue_head gp_wq; /* Where GP task waits. */
495 short gp_flags; /* Commands for GP task. */
496 short gp_state; /* GP kthread sleep state. */
498 /* End of fields guarded by root rcu_node's lock. */
500 raw_spinlock_t orphan_lock ____cacheline_internodealigned_in_smp;
501 /* Protect following fields. */
502 struct rcu_head *orphan_nxtlist; /* Orphaned callbacks that */
503 /* need a grace period. */
504 struct rcu_head **orphan_nxttail; /* Tail of above. */
505 struct rcu_head *orphan_donelist; /* Orphaned callbacks that */
506 /* are ready to invoke. */
507 struct rcu_head **orphan_donetail; /* Tail of above. */
508 long qlen_lazy; /* Number of lazy callbacks. */
509 long qlen; /* Total number of callbacks. */
510 /* End of fields guarded by orphan_lock. */
512 struct mutex barrier_mutex; /* Guards barrier fields. */
513 atomic_t barrier_cpu_count; /* # CPUs waiting on. */
514 struct completion barrier_completion; /* Wake at barrier end. */
515 unsigned long barrier_sequence; /* ++ at start and end of */
516 /* _rcu_barrier(). */
517 /* End of fields guarded by barrier_mutex. */
519 struct mutex exp_mutex; /* Serialize expedited GP. */
520 struct mutex exp_wake_mutex; /* Serialize wakeup. */
521 unsigned long expedited_sequence; /* Take a ticket. */
522 atomic_long_t expedited_normal; /* # fallbacks to normal. */
523 atomic_t expedited_need_qs; /* # CPUs left to check in. */
524 struct swait_queue_head expedited_wq; /* Wait for check-ins. */
525 int ncpus_snap; /* # CPUs seen last time. */
527 unsigned long jiffies_force_qs; /* Time at which to invoke */
528 /* force_quiescent_state(). */
529 unsigned long jiffies_kick_kthreads; /* Time at which to kick */
530 /* kthreads, if configured. */
531 unsigned long n_force_qs; /* Number of calls to */
532 /* force_quiescent_state(). */
533 unsigned long n_force_qs_lh; /* ~Number of calls leaving */
534 /* due to lock unavailable. */
535 unsigned long n_force_qs_ngp; /* Number of calls leaving */
536 /* due to no GP active. */
537 unsigned long gp_start; /* Time at which GP started, */
538 /* but in jiffies. */
539 unsigned long gp_activity; /* Time of last GP kthread */
540 /* activity in jiffies. */
541 unsigned long jiffies_stall; /* Time at which to check */
542 /* for CPU stalls. */
543 unsigned long jiffies_resched; /* Time at which to resched */
544 /* a reluctant CPU. */
545 unsigned long n_force_qs_gpstart; /* Snapshot of n_force_qs at */
547 unsigned long gp_max; /* Maximum GP duration in */
549 const char *name; /* Name of structure. */
550 char abbr; /* Abbreviated name. */
551 struct list_head flavors; /* List of RCU flavors. */
554 /* Values for rcu_state structure's gp_flags field. */
555 #define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */
556 #define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */
558 /* Values for rcu_state structure's gp_state field. */
559 #define RCU_GP_IDLE 0 /* Initial state and no GP in progress. */
560 #define RCU_GP_WAIT_GPS 1 /* Wait for grace-period start. */
561 #define RCU_GP_DONE_GPS 2 /* Wait done for grace-period start. */
562 #define RCU_GP_WAIT_FQS 3 /* Wait for force-quiescent-state time. */
563 #define RCU_GP_DOING_FQS 4 /* Wait done for force-quiescent-state time. */
564 #define RCU_GP_CLEANUP 5 /* Grace-period cleanup started. */
565 #define RCU_GP_CLEANED 6 /* Grace-period cleanup complete. */
567 #ifndef RCU_TREE_NONCORE
568 static const char * const gp_state_names[] = {
577 #endif /* #ifndef RCU_TREE_NONCORE */
579 extern struct list_head rcu_struct_flavors;
581 /* Sequence through rcu_state structures for each RCU flavor. */
582 #define for_each_rcu_flavor(rsp) \
583 list_for_each_entry((rsp), &rcu_struct_flavors, flavors)
586 * RCU implementation internal declarations:
588 extern struct rcu_state rcu_sched_state;
590 extern struct rcu_state rcu_bh_state;
592 #ifdef CONFIG_PREEMPT_RCU
593 extern struct rcu_state rcu_preempt_state;
594 #endif /* #ifdef CONFIG_PREEMPT_RCU */
596 #ifdef CONFIG_RCU_BOOST
597 DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status);
598 DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu);
599 DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops);
600 DECLARE_PER_CPU(char, rcu_cpu_has_work);
601 #endif /* #ifdef CONFIG_RCU_BOOST */
603 #ifndef RCU_TREE_NONCORE
605 /* Forward declarations for rcutree_plugin.h */
606 static void rcu_bootup_announce(void);
607 static void rcu_preempt_note_context_switch(void);
608 static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
609 #ifdef CONFIG_HOTPLUG_CPU
610 static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
611 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
612 static void rcu_print_detail_task_stall(struct rcu_state *rsp);
613 static int rcu_print_task_stall(struct rcu_node *rnp);
614 static int rcu_print_task_exp_stall(struct rcu_node *rnp);
615 static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
616 static void rcu_preempt_check_callbacks(void);
617 void call_rcu(struct rcu_head *head, rcu_callback_t func);
618 static void __init __rcu_init_preempt(void);
619 static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
620 static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
621 static void invoke_rcu_callbacks_kthread(void);
622 static bool rcu_is_callbacks_kthread(void);
623 #ifdef CONFIG_RCU_BOOST
624 static void rcu_preempt_do_callbacks(void);
625 static int rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
626 struct rcu_node *rnp);
627 #endif /* #ifdef CONFIG_RCU_BOOST */
628 static void __init rcu_spawn_boost_kthreads(void);
629 static void rcu_prepare_kthreads(int cpu);
630 static void rcu_cleanup_after_idle(void);
631 static void rcu_prepare_for_idle(void);
632 static void rcu_idle_count_callbacks_posted(void);
633 static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
634 static void print_cpu_stall_info_begin(void);
635 static void print_cpu_stall_info(struct rcu_state *rsp, int cpu);
636 static void print_cpu_stall_info_end(void);
637 static void zero_cpu_stall_ticks(struct rcu_data *rdp);
638 static void increment_cpu_stall_ticks(void);
639 static bool rcu_nocb_cpu_needs_barrier(struct rcu_state *rsp, int cpu);
640 static void rcu_nocb_gp_set(struct rcu_node *rnp, int nrq);
641 static struct swait_queue_head *rcu_nocb_gp_get(struct rcu_node *rnp);
642 static void rcu_nocb_gp_cleanup(struct swait_queue_head *sq);
643 static void rcu_init_one_nocb(struct rcu_node *rnp);
644 static bool __call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *rhp,
645 bool lazy, unsigned long flags);
646 static bool rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp,
647 struct rcu_data *rdp,
648 unsigned long flags);
649 static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp);
650 static void do_nocb_deferred_wakeup(struct rcu_data *rdp);
651 static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
652 static void rcu_spawn_all_nocb_kthreads(int cpu);
653 static void __init rcu_spawn_nocb_kthreads(void);
654 #ifdef CONFIG_RCU_NOCB_CPU
655 static void __init rcu_organize_nocb_kthreads(struct rcu_state *rsp);
656 #endif /* #ifdef CONFIG_RCU_NOCB_CPU */
657 static void __maybe_unused rcu_kick_nohz_cpu(int cpu);
658 static bool init_nocb_callback_list(struct rcu_data *rdp);
659 static void rcu_sysidle_enter(int irq);
660 static void rcu_sysidle_exit(int irq);
661 static void rcu_sysidle_check_cpu(struct rcu_data *rdp, bool *isidle,
662 unsigned long *maxj);
663 static bool is_sysidle_rcu_state(struct rcu_state *rsp);
664 static void rcu_sysidle_report_gp(struct rcu_state *rsp, int isidle,
666 static void rcu_bind_gp_kthread(void);
667 static void rcu_sysidle_init_percpu_data(struct rcu_dynticks *rdtp);
668 static bool rcu_nohz_full_cpu(struct rcu_state *rsp);
669 static void rcu_dynticks_task_enter(void);
670 static void rcu_dynticks_task_exit(void);
672 #endif /* #ifndef RCU_TREE_NONCORE */
674 #ifdef CONFIG_RCU_TRACE
675 /* Read out queue lengths for tracing. */
676 static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
678 #ifdef CONFIG_RCU_NOCB_CPU
679 *ql = atomic_long_read(&rdp->nocb_q_count);
680 *qll = atomic_long_read(&rdp->nocb_q_count_lazy);
681 #else /* #ifdef CONFIG_RCU_NOCB_CPU */
684 #endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
686 #endif /* #ifdef CONFIG_RCU_TRACE */
689 * Place this after a lock-acquisition primitive to guarantee that
690 * an UNLOCK+LOCK pair act as a full barrier. This guarantee applies
691 * if the UNLOCK and LOCK are executed by the same CPU or if the
692 * UNLOCK and LOCK operate on the same lock variable.
695 #define smp_mb__after_unlock_lock() smp_mb() /* Full ordering for lock. */
696 #else /* #ifdef CONFIG_PPC */
697 #define smp_mb__after_unlock_lock() do { } while (0)
698 #endif /* #else #ifdef CONFIG_PPC */
701 * Wrappers for the rcu_node::lock acquire and release.
703 * Because the rcu_nodes form a tree, the tree traversal locking will observe
704 * different lock values, this in turn means that an UNLOCK of one level
705 * followed by a LOCK of another level does not imply a full memory barrier;
706 * and most importantly transitivity is lost.
708 * In order to restore full ordering between tree levels, augment the regular
709 * lock acquire functions with smp_mb__after_unlock_lock().
711 * As ->lock of struct rcu_node is a __private field, therefore one should use
712 * these wrappers rather than directly call raw_spin_{lock,unlock}* on ->lock.
714 static inline void raw_spin_lock_rcu_node(struct rcu_node *rnp)
716 raw_spin_lock(&ACCESS_PRIVATE(rnp, lock));
717 smp_mb__after_unlock_lock();
720 static inline void raw_spin_unlock_rcu_node(struct rcu_node *rnp)
722 raw_spin_unlock(&ACCESS_PRIVATE(rnp, lock));
725 static inline void raw_spin_lock_irq_rcu_node(struct rcu_node *rnp)
727 raw_spin_lock_irq(&ACCESS_PRIVATE(rnp, lock));
728 smp_mb__after_unlock_lock();
731 static inline void raw_spin_unlock_irq_rcu_node(struct rcu_node *rnp)
733 raw_spin_unlock_irq(&ACCESS_PRIVATE(rnp, lock));
736 #define raw_spin_lock_irqsave_rcu_node(rnp, flags) \
738 typecheck(unsigned long, flags); \
739 raw_spin_lock_irqsave(&ACCESS_PRIVATE(rnp, lock), flags); \
740 smp_mb__after_unlock_lock(); \
743 #define raw_spin_unlock_irqrestore_rcu_node(rnp, flags) \
745 typecheck(unsigned long, flags); \
746 raw_spin_unlock_irqrestore(&ACCESS_PRIVATE(rnp, lock), flags); \
749 static inline bool raw_spin_trylock_rcu_node(struct rcu_node *rnp)
751 bool locked = raw_spin_trylock(&ACCESS_PRIVATE(rnp, lock));
754 smp_mb__after_unlock_lock();