Loading...
1/* SPDX-License-Identifier: GPL-2.0+ */
2/*
3 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
4 * Internal non-public definitions.
5 *
6 * Copyright IBM Corporation, 2008
7 *
8 * Author: Ingo Molnar <mingo@elte.hu>
9 * Paul E. McKenney <paulmck@linux.ibm.com>
10 */
11
12#include <linux/cache.h>
13#include <linux/kthread.h>
14#include <linux/spinlock.h>
15#include <linux/rtmutex.h>
16#include <linux/threads.h>
17#include <linux/cpumask.h>
18#include <linux/seqlock.h>
19#include <linux/swait.h>
20#include <linux/rcu_node_tree.h>
21
22#include "rcu_segcblist.h"
23
24/* Communicate arguments to a workqueue handler. */
25struct rcu_exp_work {
26 unsigned long rew_s;
27#ifdef CONFIG_RCU_EXP_KTHREAD
28 struct kthread_work rew_work;
29#else
30 struct work_struct rew_work;
31#endif /* CONFIG_RCU_EXP_KTHREAD */
32};
33
34/* RCU's kthread states for tracing. */
35#define RCU_KTHREAD_STOPPED 0
36#define RCU_KTHREAD_RUNNING 1
37#define RCU_KTHREAD_WAITING 2
38#define RCU_KTHREAD_OFFCPU 3
39#define RCU_KTHREAD_YIELDING 4
40#define RCU_KTHREAD_MAX 4
41
42/*
43 * Definition for node within the RCU grace-period-detection hierarchy.
44 */
45struct rcu_node {
46 raw_spinlock_t __private lock; /* Root rcu_node's lock protects */
47 /* some rcu_state fields as well as */
48 /* following. */
49 unsigned long gp_seq; /* Track rsp->gp_seq. */
50 unsigned long gp_seq_needed; /* Track furthest future GP request. */
51 unsigned long completedqs; /* All QSes done for this node. */
52 unsigned long qsmask; /* CPUs or groups that need to switch in */
53 /* order for current grace period to proceed.*/
54 /* In leaf rcu_node, each bit corresponds to */
55 /* an rcu_data structure, otherwise, each */
56 /* bit corresponds to a child rcu_node */
57 /* structure. */
58 unsigned long rcu_gp_init_mask; /* Mask of offline CPUs at GP init. */
59 unsigned long qsmaskinit;
60 /* Per-GP initial value for qsmask. */
61 /* Initialized from ->qsmaskinitnext at the */
62 /* beginning of each grace period. */
63 unsigned long qsmaskinitnext;
64 unsigned long expmask; /* CPUs or groups that need to check in */
65 /* to allow the current expedited GP */
66 /* to complete. */
67 unsigned long expmaskinit;
68 /* Per-GP initial values for expmask. */
69 /* Initialized from ->expmaskinitnext at the */
70 /* beginning of each expedited GP. */
71 unsigned long expmaskinitnext;
72 /* Online CPUs for next expedited GP. */
73 /* Any CPU that has ever been online will */
74 /* have its bit set. */
75 unsigned long cbovldmask;
76 /* CPUs experiencing callback overload. */
77 unsigned long ffmask; /* Fully functional CPUs. */
78 unsigned long grpmask; /* Mask to apply to parent qsmask. */
79 /* Only one bit will be set in this mask. */
80 int grplo; /* lowest-numbered CPU here. */
81 int grphi; /* highest-numbered CPU here. */
82 u8 grpnum; /* group number for next level up. */
83 u8 level; /* root is at level 0. */
84 bool wait_blkd_tasks;/* Necessary to wait for blocked tasks to */
85 /* exit RCU read-side critical sections */
86 /* before propagating offline up the */
87 /* rcu_node tree? */
88 struct rcu_node *parent;
89 struct list_head blkd_tasks;
90 /* Tasks blocked in RCU read-side critical */
91 /* section. Tasks are placed at the head */
92 /* of this list and age towards the tail. */
93 struct list_head *gp_tasks;
94 /* Pointer to the first task blocking the */
95 /* current grace period, or NULL if there */
96 /* is no such task. */
97 struct list_head *exp_tasks;
98 /* Pointer to the first task blocking the */
99 /* current expedited grace period, or NULL */
100 /* if there is no such task. If there */
101 /* is no current expedited grace period, */
102 /* then there can cannot be any such task. */
103 struct list_head *boost_tasks;
104 /* Pointer to first task that needs to be */
105 /* priority boosted, or NULL if no priority */
106 /* boosting is needed for this rcu_node */
107 /* structure. If there are no tasks */
108 /* queued on this rcu_node structure that */
109 /* are blocking the current grace period, */
110 /* there can be no such task. */
111 struct rt_mutex boost_mtx;
112 /* Used only for the priority-boosting */
113 /* side effect, not as a lock. */
114 unsigned long boost_time;
115 /* When to start boosting (jiffies). */
116 struct mutex boost_kthread_mutex;
117 /* Exclusion for thread spawning and affinity */
118 /* manipulation. */
119 struct task_struct *boost_kthread_task;
120 /* kthread that takes care of priority */
121 /* boosting for this rcu_node structure. */
122 unsigned int boost_kthread_status;
123 /* State of boost_kthread_task for tracing. */
124 unsigned long n_boosts; /* Number of boosts for this rcu_node structure. */
125#ifdef CONFIG_RCU_NOCB_CPU
126 struct swait_queue_head nocb_gp_wq[2];
127 /* Place for rcu_nocb_kthread() to wait GP. */
128#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
129 raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
130
131 spinlock_t exp_lock ____cacheline_internodealigned_in_smp;
132 unsigned long exp_seq_rq;
133 wait_queue_head_t exp_wq[4];
134 struct rcu_exp_work rew;
135 bool exp_need_flush; /* Need to flush workitem? */
136 raw_spinlock_t exp_poll_lock;
137 /* Lock and data for polled expedited grace periods. */
138 unsigned long exp_seq_poll_rq;
139 struct work_struct exp_poll_wq;
140} ____cacheline_internodealigned_in_smp;
141
142/*
143 * Bitmasks in an rcu_node cover the interval [grplo, grphi] of CPU IDs, and
144 * are indexed relative to this interval rather than the global CPU ID space.
145 * This generates the bit for a CPU in node-local masks.
146 */
147#define leaf_node_cpu_bit(rnp, cpu) (BIT((cpu) - (rnp)->grplo))
148
149/*
150 * Union to allow "aggregate OR" operation on the need for a quiescent
151 * state by the normal and expedited grace periods.
152 */
153union rcu_noqs {
154 struct {
155 u8 norm;
156 u8 exp;
157 } b; /* Bits. */
158 u16 s; /* Set of bits, aggregate OR here. */
159};
160
161/* Per-CPU data for read-copy update. */
162struct rcu_data {
163 /* 1) quiescent-state and grace-period handling : */
164 unsigned long gp_seq; /* Track rsp->gp_seq counter. */
165 unsigned long gp_seq_needed; /* Track furthest future GP request. */
166 union rcu_noqs cpu_no_qs; /* No QSes yet for this CPU. */
167 bool core_needs_qs; /* Core waits for quiescent state. */
168 bool beenonline; /* CPU online at least once. */
169 bool gpwrap; /* Possible ->gp_seq wrap. */
170 bool cpu_started; /* RCU watching this onlining CPU. */
171 struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
172 unsigned long grpmask; /* Mask to apply to leaf qsmask. */
173 unsigned long ticks_this_gp; /* The number of scheduling-clock */
174 /* ticks this CPU has handled */
175 /* during and after the last grace */
176 /* period it is aware of. */
177 struct irq_work defer_qs_iw; /* Obtain later scheduler attention. */
178 bool defer_qs_iw_pending; /* Scheduler attention pending? */
179 struct work_struct strict_work; /* Schedule readers for strict GPs. */
180
181 /* 2) batch handling */
182 struct rcu_segcblist cblist; /* Segmented callback list, with */
183 /* different callbacks waiting for */
184 /* different grace periods. */
185 long qlen_last_fqs_check;
186 /* qlen at last check for QS forcing */
187 unsigned long n_cbs_invoked; /* # callbacks invoked since boot. */
188 unsigned long n_force_qs_snap;
189 /* did other CPU force QS recently? */
190 long blimit; /* Upper limit on a processed batch */
191
192 /* 3) dynticks interface. */
193 int dynticks_snap; /* Per-GP tracking for dynticks. */
194 bool rcu_need_heavy_qs; /* GP old, so heavy quiescent state! */
195 bool rcu_urgent_qs; /* GP old need light quiescent state. */
196 bool rcu_forced_tick; /* Forced tick to provide QS. */
197 bool rcu_forced_tick_exp; /* ... provide QS to expedited GP. */
198
199 /* 4) rcu_barrier(), OOM callbacks, and expediting. */
200 unsigned long barrier_seq_snap; /* Snap of rcu_state.barrier_sequence. */
201 struct rcu_head barrier_head;
202 int exp_dynticks_snap; /* Double-check need for IPI. */
203
204 /* 5) Callback offloading. */
205#ifdef CONFIG_RCU_NOCB_CPU
206 struct swait_queue_head nocb_cb_wq; /* For nocb kthreads to sleep on. */
207 struct swait_queue_head nocb_state_wq; /* For offloading state changes */
208 struct task_struct *nocb_gp_kthread;
209 raw_spinlock_t nocb_lock; /* Guard following pair of fields. */
210 atomic_t nocb_lock_contended; /* Contention experienced. */
211 int nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */
212 struct timer_list nocb_timer; /* Enforce finite deferral. */
213 unsigned long nocb_gp_adv_time; /* Last call_rcu() CB adv (jiffies). */
214 struct mutex nocb_gp_kthread_mutex; /* Exclusion for nocb gp kthread */
215 /* spawning */
216
217 /* The following fields are used by call_rcu, hence own cacheline. */
218 raw_spinlock_t nocb_bypass_lock ____cacheline_internodealigned_in_smp;
219 struct rcu_cblist nocb_bypass; /* Lock-contention-bypass CB list. */
220 unsigned long nocb_bypass_first; /* Time (jiffies) of first enqueue. */
221 unsigned long nocb_nobypass_last; /* Last ->cblist enqueue (jiffies). */
222 int nocb_nobypass_count; /* # ->cblist enqueues at ^^^ time. */
223
224 /* The following fields are used by GP kthread, hence own cacheline. */
225 raw_spinlock_t nocb_gp_lock ____cacheline_internodealigned_in_smp;
226 u8 nocb_gp_sleep; /* Is the nocb GP thread asleep? */
227 u8 nocb_gp_bypass; /* Found a bypass on last scan? */
228 u8 nocb_gp_gp; /* GP to wait for on last scan? */
229 unsigned long nocb_gp_seq; /* If so, ->gp_seq to wait for. */
230 unsigned long nocb_gp_loops; /* # passes through wait code. */
231 struct swait_queue_head nocb_gp_wq; /* For nocb kthreads to sleep on. */
232 bool nocb_cb_sleep; /* Is the nocb CB thread asleep? */
233 struct task_struct *nocb_cb_kthread;
234 struct list_head nocb_head_rdp; /*
235 * Head of rcu_data list in wakeup chain,
236 * if rdp_gp.
237 */
238 struct list_head nocb_entry_rdp; /* rcu_data node in wakeup chain. */
239 struct rcu_data *nocb_toggling_rdp; /* rdp queued for (de-)offloading */
240
241 /* The following fields are used by CB kthread, hence new cacheline. */
242 struct rcu_data *nocb_gp_rdp ____cacheline_internodealigned_in_smp;
243 /* GP rdp takes GP-end wakeups. */
244#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
245
246 /* 6) RCU priority boosting. */
247 struct task_struct *rcu_cpu_kthread_task;
248 /* rcuc per-CPU kthread or NULL. */
249 unsigned int rcu_cpu_kthread_status;
250 char rcu_cpu_has_work;
251 unsigned long rcuc_activity;
252
253 /* 7) Diagnostic data, including RCU CPU stall warnings. */
254 unsigned int softirq_snap; /* Snapshot of softirq activity. */
255 /* ->rcu_iw* fields protected by leaf rcu_node ->lock. */
256 struct irq_work rcu_iw; /* Check for non-irq activity. */
257 bool rcu_iw_pending; /* Is ->rcu_iw pending? */
258 unsigned long rcu_iw_gp_seq; /* ->gp_seq associated with ->rcu_iw. */
259 unsigned long rcu_ofl_gp_seq; /* ->gp_seq at last offline. */
260 short rcu_ofl_gp_flags; /* ->gp_flags at last offline. */
261 unsigned long rcu_onl_gp_seq; /* ->gp_seq at last online. */
262 short rcu_onl_gp_flags; /* ->gp_flags at last online. */
263 unsigned long last_fqs_resched; /* Time of last rcu_resched(). */
264 unsigned long last_sched_clock; /* Jiffies of last rcu_sched_clock_irq(). */
265
266 long lazy_len; /* Length of buffered lazy callbacks. */
267 int cpu;
268};
269
270/* Values for nocb_defer_wakeup field in struct rcu_data. */
271#define RCU_NOCB_WAKE_NOT 0
272#define RCU_NOCB_WAKE_BYPASS 1
273#define RCU_NOCB_WAKE_LAZY 2
274#define RCU_NOCB_WAKE 3
275#define RCU_NOCB_WAKE_FORCE 4
276
277#define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
278 /* For jiffies_till_first_fqs and */
279 /* and jiffies_till_next_fqs. */
280
281#define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */
282 /* delay between bouts of */
283 /* quiescent-state forcing. */
284
285#define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */
286 /* at least one scheduling clock */
287 /* irq before ratting on them. */
288
289#define rcu_wait(cond) \
290do { \
291 for (;;) { \
292 set_current_state(TASK_INTERRUPTIBLE); \
293 if (cond) \
294 break; \
295 schedule(); \
296 } \
297 __set_current_state(TASK_RUNNING); \
298} while (0)
299
300/*
301 * RCU global state, including node hierarchy. This hierarchy is
302 * represented in "heap" form in a dense array. The root (first level)
303 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
304 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
305 * and the third level in ->node[m+1] and following (->node[m+1] referenced
306 * by ->level[2]). The number of levels is determined by the number of
307 * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
308 * consisting of a single rcu_node.
309 */
310struct rcu_state {
311 struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
312 struct rcu_node *level[RCU_NUM_LVLS + 1];
313 /* Hierarchy levels (+1 to */
314 /* shut bogus gcc warning) */
315 int ncpus; /* # CPUs seen so far. */
316 int n_online_cpus; /* # CPUs online for RCU. */
317
318 /* The following fields are guarded by the root rcu_node's lock. */
319
320 unsigned long gp_seq ____cacheline_internodealigned_in_smp;
321 /* Grace-period sequence #. */
322 unsigned long gp_max; /* Maximum GP duration in */
323 /* jiffies. */
324 struct task_struct *gp_kthread; /* Task for grace periods. */
325 struct swait_queue_head gp_wq; /* Where GP task waits. */
326 short gp_flags; /* Commands for GP task. */
327 short gp_state; /* GP kthread sleep state. */
328 unsigned long gp_wake_time; /* Last GP kthread wake. */
329 unsigned long gp_wake_seq; /* ->gp_seq at ^^^. */
330 unsigned long gp_seq_polled; /* GP seq for polled API. */
331 unsigned long gp_seq_polled_snap; /* ->gp_seq_polled at normal GP start. */
332 unsigned long gp_seq_polled_exp_snap; /* ->gp_seq_polled at expedited GP start. */
333
334 /* End of fields guarded by root rcu_node's lock. */
335
336 struct mutex barrier_mutex; /* Guards barrier fields. */
337 atomic_t barrier_cpu_count; /* # CPUs waiting on. */
338 struct completion barrier_completion; /* Wake at barrier end. */
339 unsigned long barrier_sequence; /* ++ at start and end of */
340 /* rcu_barrier(). */
341 /* End of fields guarded by barrier_mutex. */
342
343 raw_spinlock_t barrier_lock; /* Protects ->barrier_seq_snap. */
344
345 struct mutex exp_mutex; /* Serialize expedited GP. */
346 struct mutex exp_wake_mutex; /* Serialize wakeup. */
347 unsigned long expedited_sequence; /* Take a ticket. */
348 atomic_t expedited_need_qs; /* # CPUs left to check in. */
349 struct swait_queue_head expedited_wq; /* Wait for check-ins. */
350 int ncpus_snap; /* # CPUs seen last time. */
351 u8 cbovld; /* Callback overload now? */
352 u8 cbovldnext; /* ^ ^ next time? */
353
354 unsigned long jiffies_force_qs; /* Time at which to invoke */
355 /* force_quiescent_state(). */
356 unsigned long jiffies_kick_kthreads; /* Time at which to kick */
357 /* kthreads, if configured. */
358 unsigned long n_force_qs; /* Number of calls to */
359 /* force_quiescent_state(). */
360 unsigned long gp_start; /* Time at which GP started, */
361 /* but in jiffies. */
362 unsigned long gp_end; /* Time last GP ended, again */
363 /* in jiffies. */
364 unsigned long gp_activity; /* Time of last GP kthread */
365 /* activity in jiffies. */
366 unsigned long gp_req_activity; /* Time of last GP request */
367 /* in jiffies. */
368 unsigned long jiffies_stall; /* Time at which to check */
369 /* for CPU stalls. */
370 unsigned long jiffies_resched; /* Time at which to resched */
371 /* a reluctant CPU. */
372 unsigned long n_force_qs_gpstart; /* Snapshot of n_force_qs at */
373 /* GP start. */
374 const char *name; /* Name of structure. */
375 char abbr; /* Abbreviated name. */
376
377 arch_spinlock_t ofl_lock ____cacheline_internodealigned_in_smp;
378 /* Synchronize offline with */
379 /* GP pre-initialization. */
380 int nocb_is_setup; /* nocb is setup from boot */
381};
382
383/* Values for rcu_state structure's gp_flags field. */
384#define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */
385#define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */
386#define RCU_GP_FLAG_OVLD 0x4 /* Experiencing callback overload. */
387
388/* Values for rcu_state structure's gp_state field. */
389#define RCU_GP_IDLE 0 /* Initial state and no GP in progress. */
390#define RCU_GP_WAIT_GPS 1 /* Wait for grace-period start. */
391#define RCU_GP_DONE_GPS 2 /* Wait done for grace-period start. */
392#define RCU_GP_ONOFF 3 /* Grace-period initialization hotplug. */
393#define RCU_GP_INIT 4 /* Grace-period initialization. */
394#define RCU_GP_WAIT_FQS 5 /* Wait for force-quiescent-state time. */
395#define RCU_GP_DOING_FQS 6 /* Wait done for force-quiescent-state time. */
396#define RCU_GP_CLEANUP 7 /* Grace-period cleanup started. */
397#define RCU_GP_CLEANED 8 /* Grace-period cleanup complete. */
398
399/*
400 * In order to export the rcu_state name to the tracing tools, it
401 * needs to be added in the __tracepoint_string section.
402 * This requires defining a separate variable tp_<sname>_varname
403 * that points to the string being used, and this will allow
404 * the tracing userspace tools to be able to decipher the string
405 * address to the matching string.
406 */
407#ifdef CONFIG_PREEMPT_RCU
408#define RCU_ABBR 'p'
409#define RCU_NAME_RAW "rcu_preempt"
410#else /* #ifdef CONFIG_PREEMPT_RCU */
411#define RCU_ABBR 's'
412#define RCU_NAME_RAW "rcu_sched"
413#endif /* #else #ifdef CONFIG_PREEMPT_RCU */
414#ifndef CONFIG_TRACING
415#define RCU_NAME RCU_NAME_RAW
416#else /* #ifdef CONFIG_TRACING */
417static char rcu_name[] = RCU_NAME_RAW;
418static const char *tp_rcu_varname __used __tracepoint_string = rcu_name;
419#define RCU_NAME rcu_name
420#endif /* #else #ifdef CONFIG_TRACING */
421
422/* Forward declarations for tree_plugin.h */
423static void rcu_bootup_announce(void);
424static void rcu_qs(void);
425static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
426#ifdef CONFIG_HOTPLUG_CPU
427static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
428#endif /* #ifdef CONFIG_HOTPLUG_CPU */
429static int rcu_print_task_exp_stall(struct rcu_node *rnp);
430static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
431static void rcu_flavor_sched_clock_irq(int user);
432static void dump_blkd_tasks(struct rcu_node *rnp, int ncheck);
433static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
434static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
435static bool rcu_is_callbacks_kthread(struct rcu_data *rdp);
436static void rcu_cpu_kthread_setup(unsigned int cpu);
437static void rcu_spawn_one_boost_kthread(struct rcu_node *rnp);
438static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
439static bool rcu_preempt_need_deferred_qs(struct task_struct *t);
440static void zero_cpu_stall_ticks(struct rcu_data *rdp);
441static struct swait_queue_head *rcu_nocb_gp_get(struct rcu_node *rnp);
442static void rcu_nocb_gp_cleanup(struct swait_queue_head *sq);
443static void rcu_init_one_nocb(struct rcu_node *rnp);
444static bool wake_nocb_gp(struct rcu_data *rdp, bool force);
445static bool rcu_nocb_flush_bypass(struct rcu_data *rdp, struct rcu_head *rhp,
446 unsigned long j, bool lazy);
447static bool rcu_nocb_try_bypass(struct rcu_data *rdp, struct rcu_head *rhp,
448 bool *was_alldone, unsigned long flags,
449 bool lazy);
450static void __call_rcu_nocb_wake(struct rcu_data *rdp, bool was_empty,
451 unsigned long flags);
452static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp, int level);
453static bool do_nocb_deferred_wakeup(struct rcu_data *rdp);
454static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
455static void rcu_spawn_cpu_nocb_kthread(int cpu);
456static void show_rcu_nocb_state(struct rcu_data *rdp);
457static void rcu_nocb_lock(struct rcu_data *rdp);
458static void rcu_nocb_unlock(struct rcu_data *rdp);
459static void rcu_nocb_unlock_irqrestore(struct rcu_data *rdp,
460 unsigned long flags);
461static void rcu_lockdep_assert_cblist_protected(struct rcu_data *rdp);
462#ifdef CONFIG_RCU_NOCB_CPU
463static void __init rcu_organize_nocb_kthreads(void);
464
465/*
466 * Disable IRQs before checking offloaded state so that local
467 * locking is safe against concurrent de-offloading.
468 */
469#define rcu_nocb_lock_irqsave(rdp, flags) \
470do { \
471 local_irq_save(flags); \
472 if (rcu_segcblist_is_offloaded(&(rdp)->cblist)) \
473 raw_spin_lock(&(rdp)->nocb_lock); \
474} while (0)
475#else /* #ifdef CONFIG_RCU_NOCB_CPU */
476#define rcu_nocb_lock_irqsave(rdp, flags) local_irq_save(flags)
477#endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
478
479static void rcu_bind_gp_kthread(void);
480static bool rcu_nohz_full_cpu(void);
481
482/* Forward declarations for tree_stall.h */
483static void record_gp_stall_check_time(void);
484static void rcu_iw_handler(struct irq_work *iwp);
485static void check_cpu_stall(struct rcu_data *rdp);
486static void rcu_check_gp_start_stall(struct rcu_node *rnp, struct rcu_data *rdp,
487 const unsigned long gpssdelay);
488
489/* Forward declarations for tree_exp.h. */
490static void sync_rcu_do_polled_gp(struct work_struct *wp);
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
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/irq_work.h>
31
32/*
33 * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and
34 * CONFIG_RCU_FANOUT_LEAF.
35 * In theory, it should be possible to add more levels straightforwardly.
36 * In practice, this did work well going from three levels to four.
37 * Of course, your mileage may vary.
38 */
39#define MAX_RCU_LVLS 4
40#define RCU_FANOUT_1 (CONFIG_RCU_FANOUT_LEAF)
41#define RCU_FANOUT_2 (RCU_FANOUT_1 * CONFIG_RCU_FANOUT)
42#define RCU_FANOUT_3 (RCU_FANOUT_2 * CONFIG_RCU_FANOUT)
43#define RCU_FANOUT_4 (RCU_FANOUT_3 * CONFIG_RCU_FANOUT)
44
45#if NR_CPUS <= RCU_FANOUT_1
46# define RCU_NUM_LVLS 1
47# define NUM_RCU_LVL_0 1
48# define NUM_RCU_LVL_1 (NR_CPUS)
49# define NUM_RCU_LVL_2 0
50# define NUM_RCU_LVL_3 0
51# define NUM_RCU_LVL_4 0
52#elif NR_CPUS <= RCU_FANOUT_2
53# define RCU_NUM_LVLS 2
54# define NUM_RCU_LVL_0 1
55# define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
56# define NUM_RCU_LVL_2 (NR_CPUS)
57# define NUM_RCU_LVL_3 0
58# define NUM_RCU_LVL_4 0
59#elif NR_CPUS <= RCU_FANOUT_3
60# define RCU_NUM_LVLS 3
61# define NUM_RCU_LVL_0 1
62# define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
63# define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
64# define NUM_RCU_LVL_3 (NR_CPUS)
65# define NUM_RCU_LVL_4 0
66#elif NR_CPUS <= RCU_FANOUT_4
67# define RCU_NUM_LVLS 4
68# define NUM_RCU_LVL_0 1
69# define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
70# define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
71# define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
72# define NUM_RCU_LVL_4 (NR_CPUS)
73#else
74# error "CONFIG_RCU_FANOUT insufficient for NR_CPUS"
75#endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */
76
77#define RCU_SUM (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3 + NUM_RCU_LVL_4)
78#define NUM_RCU_NODES (RCU_SUM - NR_CPUS)
79
80extern int rcu_num_lvls;
81extern int rcu_num_nodes;
82
83/*
84 * Dynticks per-CPU state.
85 */
86struct rcu_dynticks {
87 long long dynticks_nesting; /* Track irq/process nesting level. */
88 /* Process level is worth LLONG_MAX/2. */
89 int dynticks_nmi_nesting; /* Track NMI nesting level. */
90 atomic_t dynticks; /* Even value for idle, else odd. */
91#ifdef CONFIG_NO_HZ_FULL_SYSIDLE
92 long long dynticks_idle_nesting;
93 /* irq/process nesting level from idle. */
94 atomic_t dynticks_idle; /* Even value for idle, else odd. */
95 /* "Idle" excludes userspace execution. */
96 unsigned long dynticks_idle_jiffies;
97 /* End of last non-NMI non-idle period. */
98#endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */
99#ifdef CONFIG_RCU_FAST_NO_HZ
100 bool all_lazy; /* Are all CPU's CBs lazy? */
101 unsigned long nonlazy_posted;
102 /* # times non-lazy CBs posted to CPU. */
103 unsigned long nonlazy_posted_snap;
104 /* idle-period nonlazy_posted snapshot. */
105 unsigned long last_accelerate;
106 /* Last jiffy CBs were accelerated. */
107 unsigned long last_advance_all;
108 /* Last jiffy CBs were all advanced. */
109 int tick_nohz_enabled_snap; /* Previously seen value from sysfs. */
110#endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
111};
112
113/* RCU's kthread states for tracing. */
114#define RCU_KTHREAD_STOPPED 0
115#define RCU_KTHREAD_RUNNING 1
116#define RCU_KTHREAD_WAITING 2
117#define RCU_KTHREAD_OFFCPU 3
118#define RCU_KTHREAD_YIELDING 4
119#define RCU_KTHREAD_MAX 4
120
121/*
122 * Definition for node within the RCU grace-period-detection hierarchy.
123 */
124struct rcu_node {
125 raw_spinlock_t lock; /* Root rcu_node's lock protects some */
126 /* rcu_state fields as well as following. */
127 unsigned long gpnum; /* Current grace period for this node. */
128 /* This will either be equal to or one */
129 /* behind the root rcu_node's gpnum. */
130 unsigned long completed; /* Last GP completed for this node. */
131 /* This will either be equal to or one */
132 /* behind the root rcu_node's gpnum. */
133 unsigned long qsmask; /* CPUs or groups that need to switch in */
134 /* order for current grace period to proceed.*/
135 /* In leaf rcu_node, each bit corresponds to */
136 /* an rcu_data structure, otherwise, each */
137 /* bit corresponds to a child rcu_node */
138 /* structure. */
139 unsigned long expmask; /* Groups that have ->blkd_tasks */
140 /* elements that need to drain to allow the */
141 /* current expedited grace period to */
142 /* complete (only for TREE_PREEMPT_RCU). */
143 unsigned long qsmaskinit;
144 /* Per-GP initial value for qsmask & expmask. */
145 unsigned long grpmask; /* Mask to apply to parent qsmask. */
146 /* Only one bit will be set in this mask. */
147 int grplo; /* lowest-numbered CPU or group here. */
148 int grphi; /* highest-numbered CPU or group here. */
149 u8 grpnum; /* CPU/group number for next level up. */
150 u8 level; /* root is at level 0. */
151 struct rcu_node *parent;
152 struct list_head blkd_tasks;
153 /* Tasks blocked in RCU read-side critical */
154 /* section. Tasks are placed at the head */
155 /* of this list and age towards the tail. */
156 struct list_head *gp_tasks;
157 /* Pointer to the first task blocking the */
158 /* current grace period, or NULL if there */
159 /* is no such task. */
160 struct list_head *exp_tasks;
161 /* Pointer to the first task blocking the */
162 /* current expedited grace period, or NULL */
163 /* if there is no such task. If there */
164 /* is no current expedited grace period, */
165 /* then there can cannot be any such task. */
166#ifdef CONFIG_RCU_BOOST
167 struct list_head *boost_tasks;
168 /* Pointer to first task that needs to be */
169 /* priority boosted, or NULL if no priority */
170 /* boosting is needed for this rcu_node */
171 /* structure. If there are no tasks */
172 /* queued on this rcu_node structure that */
173 /* are blocking the current grace period, */
174 /* there can be no such task. */
175 unsigned long boost_time;
176 /* When to start boosting (jiffies). */
177 struct task_struct *boost_kthread_task;
178 /* kthread that takes care of priority */
179 /* boosting for this rcu_node structure. */
180 unsigned int boost_kthread_status;
181 /* State of boost_kthread_task for tracing. */
182 unsigned long n_tasks_boosted;
183 /* Total number of tasks boosted. */
184 unsigned long n_exp_boosts;
185 /* Number of tasks boosted for expedited GP. */
186 unsigned long n_normal_boosts;
187 /* Number of tasks boosted for normal GP. */
188 unsigned long n_balk_blkd_tasks;
189 /* Refused to boost: no blocked tasks. */
190 unsigned long n_balk_exp_gp_tasks;
191 /* Refused to boost: nothing blocking GP. */
192 unsigned long n_balk_boost_tasks;
193 /* Refused to boost: already boosting. */
194 unsigned long n_balk_notblocked;
195 /* Refused to boost: RCU RS CS still running. */
196 unsigned long n_balk_notyet;
197 /* Refused to boost: not yet time. */
198 unsigned long n_balk_nos;
199 /* Refused to boost: not sure why, though. */
200 /* This can happen due to race conditions. */
201#endif /* #ifdef CONFIG_RCU_BOOST */
202#ifdef CONFIG_RCU_NOCB_CPU
203 wait_queue_head_t nocb_gp_wq[2];
204 /* Place for rcu_nocb_kthread() to wait GP. */
205#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
206 int need_future_gp[2];
207 /* Counts of upcoming no-CB GP requests. */
208 raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
209} ____cacheline_internodealigned_in_smp;
210
211/*
212 * Do a full breadth-first scan of the rcu_node structures for the
213 * specified rcu_state structure.
214 */
215#define rcu_for_each_node_breadth_first(rsp, rnp) \
216 for ((rnp) = &(rsp)->node[0]; \
217 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
218
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/*
229 * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
230 * structure. Note that if there is a singleton rcu_node tree with but
231 * one rcu_node structure, this loop -will- visit the rcu_node structure.
232 * It is still a leaf node, even if it is also the root node.
233 */
234#define rcu_for_each_leaf_node(rsp, rnp) \
235 for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \
236 (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
237
238/* Index values for nxttail array in struct rcu_data. */
239#define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */
240#define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */
241#define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */
242#define RCU_NEXT_TAIL 3
243#define RCU_NEXT_SIZE 4
244
245/* Per-CPU data for read-copy update. */
246struct rcu_data {
247 /* 1) quiescent-state and grace-period handling : */
248 unsigned long completed; /* Track rsp->completed gp number */
249 /* in order to detect GP end. */
250 unsigned long gpnum; /* Highest gp number that this CPU */
251 /* is aware of having started. */
252 bool passed_quiesce; /* User-mode/idle loop etc. */
253 bool qs_pending; /* Core waits for quiesc state. */
254 bool beenonline; /* CPU online at least once. */
255 bool preemptible; /* Preemptible RCU? */
256 struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
257 unsigned long grpmask; /* Mask to apply to leaf qsmask. */
258#ifdef CONFIG_RCU_CPU_STALL_INFO
259 unsigned long ticks_this_gp; /* The number of scheduling-clock */
260 /* ticks this CPU has handled */
261 /* during and after the last grace */
262 /* period it is aware of. */
263#endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
264
265 /* 2) batch handling */
266 /*
267 * If nxtlist is not NULL, it is partitioned as follows.
268 * Any of the partitions might be empty, in which case the
269 * pointer to that partition will be equal to the pointer for
270 * the following partition. When the list is empty, all of
271 * the nxttail elements point to the ->nxtlist pointer itself,
272 * which in that case is NULL.
273 *
274 * [nxtlist, *nxttail[RCU_DONE_TAIL]):
275 * Entries that batch # <= ->completed
276 * The grace period for these entries has completed, and
277 * the other grace-period-completed entries may be moved
278 * here temporarily in rcu_process_callbacks().
279 * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
280 * Entries that batch # <= ->completed - 1: waiting for current GP
281 * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
282 * Entries known to have arrived before current GP ended
283 * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
284 * Entries that might have arrived after current GP ended
285 * Note that the value of *nxttail[RCU_NEXT_TAIL] will
286 * always be NULL, as this is the end of the list.
287 */
288 struct rcu_head *nxtlist;
289 struct rcu_head **nxttail[RCU_NEXT_SIZE];
290 unsigned long nxtcompleted[RCU_NEXT_SIZE];
291 /* grace periods for sublists. */
292 long qlen_lazy; /* # of lazy queued callbacks */
293 long qlen; /* # of queued callbacks, incl lazy */
294 long qlen_last_fqs_check;
295 /* qlen at last check for QS forcing */
296 unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */
297 unsigned long n_nocbs_invoked; /* count of no-CBs RCU cbs invoked. */
298 unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
299 unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */
300 unsigned long n_force_qs_snap;
301 /* did other CPU force QS recently? */
302 long blimit; /* Upper limit on a processed batch */
303
304 /* 3) dynticks interface. */
305 struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */
306 int dynticks_snap; /* Per-GP tracking for dynticks. */
307
308 /* 4) reasons this CPU needed to be kicked by force_quiescent_state */
309 unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */
310 unsigned long offline_fqs; /* Kicked due to being offline. */
311
312 /* 5) __rcu_pending() statistics. */
313 unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */
314 unsigned long n_rp_qs_pending;
315 unsigned long n_rp_report_qs;
316 unsigned long n_rp_cb_ready;
317 unsigned long n_rp_cpu_needs_gp;
318 unsigned long n_rp_gp_completed;
319 unsigned long n_rp_gp_started;
320 unsigned long n_rp_nocb_defer_wakeup;
321 unsigned long n_rp_need_nothing;
322
323 /* 6) _rcu_barrier() and OOM callbacks. */
324 struct rcu_head barrier_head;
325#ifdef CONFIG_RCU_FAST_NO_HZ
326 struct rcu_head oom_head;
327#endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
328
329 /* 7) Callback offloading. */
330#ifdef CONFIG_RCU_NOCB_CPU
331 struct rcu_head *nocb_head; /* CBs waiting for kthread. */
332 struct rcu_head **nocb_tail;
333 atomic_long_t nocb_q_count; /* # CBs waiting for kthread */
334 atomic_long_t nocb_q_count_lazy; /* (approximate). */
335 int nocb_p_count; /* # CBs being invoked by kthread */
336 int nocb_p_count_lazy; /* (approximate). */
337 wait_queue_head_t nocb_wq; /* For nocb kthreads to sleep on. */
338 struct task_struct *nocb_kthread;
339 bool nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */
340#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
341
342 /* 8) RCU CPU stall data. */
343#ifdef CONFIG_RCU_CPU_STALL_INFO
344 unsigned int softirq_snap; /* Snapshot of softirq activity. */
345#endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
346
347 int cpu;
348 struct rcu_state *rsp;
349};
350
351/* Values for fqs_state field in struct rcu_state. */
352#define RCU_GP_IDLE 0 /* No grace period in progress. */
353#define RCU_GP_INIT 1 /* Grace period being initialized. */
354#define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */
355#define RCU_FORCE_QS 3 /* Need to force quiescent state. */
356#define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK
357
358#define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
359 /* For jiffies_till_first_fqs and */
360 /* and jiffies_till_next_fqs. */
361
362#define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */
363 /* delay between bouts of */
364 /* quiescent-state forcing. */
365
366#define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */
367 /* at least one scheduling clock */
368 /* irq before ratting on them. */
369
370#define rcu_wait(cond) \
371do { \
372 for (;;) { \
373 set_current_state(TASK_INTERRUPTIBLE); \
374 if (cond) \
375 break; \
376 schedule(); \
377 } \
378 __set_current_state(TASK_RUNNING); \
379} while (0)
380
381/*
382 * RCU global state, including node hierarchy. This hierarchy is
383 * represented in "heap" form in a dense array. The root (first level)
384 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
385 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
386 * and the third level in ->node[m+1] and following (->node[m+1] referenced
387 * by ->level[2]). The number of levels is determined by the number of
388 * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
389 * consisting of a single rcu_node.
390 */
391struct rcu_state {
392 struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
393 struct rcu_node *level[RCU_NUM_LVLS]; /* Hierarchy levels. */
394 u32 levelcnt[MAX_RCU_LVLS + 1]; /* # nodes in each level. */
395 u8 levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */
396 struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */
397 void (*call)(struct rcu_head *head, /* call_rcu() flavor. */
398 void (*func)(struct rcu_head *head));
399
400 /* The following fields are guarded by the root rcu_node's lock. */
401
402 u8 fqs_state ____cacheline_internodealigned_in_smp;
403 /* Force QS state. */
404 u8 boost; /* Subject to priority boost. */
405 unsigned long gpnum; /* Current gp number. */
406 unsigned long completed; /* # of last completed gp. */
407 struct task_struct *gp_kthread; /* Task for grace periods. */
408 wait_queue_head_t gp_wq; /* Where GP task waits. */
409 int gp_flags; /* Commands for GP task. */
410
411 /* End of fields guarded by root rcu_node's lock. */
412
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
425 struct mutex onoff_mutex; /* Coordinate hotplug & GPs. */
426
427 struct mutex barrier_mutex; /* Guards barrier fields. */
428 atomic_t barrier_cpu_count; /* # CPUs waiting on. */
429 struct completion barrier_completion; /* Wake at barrier end. */
430 unsigned long n_barrier_done; /* ++ at start and end of */
431 /* _rcu_barrier(). */
432 /* End of fields guarded by barrier_mutex. */
433
434 atomic_long_t expedited_start; /* Starting ticket. */
435 atomic_long_t expedited_done; /* Done ticket. */
436 atomic_long_t expedited_wrap; /* # near-wrap incidents. */
437 atomic_long_t expedited_tryfail; /* # acquisition failures. */
438 atomic_long_t expedited_workdone1; /* # done by others #1. */
439 atomic_long_t expedited_workdone2; /* # done by others #2. */
440 atomic_long_t expedited_normal; /* # fallbacks to normal. */
441 atomic_long_t expedited_stoppedcpus; /* # successful stop_cpus. */
442 atomic_long_t expedited_done_tries; /* # tries to update _done. */
443 atomic_long_t expedited_done_lost; /* # times beaten to _done. */
444 atomic_long_t expedited_done_exit; /* # times exited _done loop. */
445
446 unsigned long jiffies_force_qs; /* Time at which to invoke */
447 /* force_quiescent_state(). */
448 unsigned long n_force_qs; /* Number of calls to */
449 /* force_quiescent_state(). */
450 unsigned long n_force_qs_lh; /* ~Number of calls leaving */
451 /* due to lock unavailable. */
452 unsigned long n_force_qs_ngp; /* Number of calls leaving */
453 /* due to no GP active. */
454 unsigned long gp_start; /* Time at which GP started, */
455 /* but in jiffies. */
456 unsigned long jiffies_stall; /* Time at which to check */
457 /* for CPU stalls. */
458 unsigned long jiffies_resched; /* Time at which to resched */
459 /* a reluctant CPU. */
460 unsigned long gp_max; /* Maximum GP duration in */
461 /* jiffies. */
462 const char *name; /* Name of structure. */
463 char abbr; /* Abbreviated name. */
464 struct list_head flavors; /* List of RCU flavors. */
465 struct irq_work wakeup_work; /* Postponed wakeups */
466};
467
468/* Values for rcu_state structure's gp_flags field. */
469#define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */
470#define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */
471
472extern struct list_head rcu_struct_flavors;
473
474/* Sequence through rcu_state structures for each RCU flavor. */
475#define for_each_rcu_flavor(rsp) \
476 list_for_each_entry((rsp), &rcu_struct_flavors, flavors)
477
478/* Return values for rcu_preempt_offline_tasks(). */
479
480#define RCU_OFL_TASKS_NORM_GP 0x1 /* Tasks blocking normal */
481 /* GP were moved to root. */
482#define RCU_OFL_TASKS_EXP_GP 0x2 /* Tasks blocking expedited */
483 /* GP were moved to root. */
484
485/*
486 * RCU implementation internal declarations:
487 */
488extern struct rcu_state rcu_sched_state;
489DECLARE_PER_CPU(struct rcu_data, rcu_sched_data);
490
491extern struct rcu_state rcu_bh_state;
492DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);
493
494#ifdef CONFIG_TREE_PREEMPT_RCU
495extern struct rcu_state rcu_preempt_state;
496DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data);
497#endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */
498
499#ifdef CONFIG_RCU_BOOST
500DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status);
501DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu);
502DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops);
503DECLARE_PER_CPU(char, rcu_cpu_has_work);
504#endif /* #ifdef CONFIG_RCU_BOOST */
505
506#ifndef RCU_TREE_NONCORE
507
508/* Forward declarations for rcutree_plugin.h */
509static void rcu_bootup_announce(void);
510long rcu_batches_completed(void);
511static void rcu_preempt_note_context_switch(int cpu);
512static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
513#ifdef CONFIG_HOTPLUG_CPU
514static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp,
515 unsigned long flags);
516#endif /* #ifdef CONFIG_HOTPLUG_CPU */
517static void rcu_print_detail_task_stall(struct rcu_state *rsp);
518static int rcu_print_task_stall(struct rcu_node *rnp);
519static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
520#ifdef CONFIG_HOTPLUG_CPU
521static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
522 struct rcu_node *rnp,
523 struct rcu_data *rdp);
524#endif /* #ifdef CONFIG_HOTPLUG_CPU */
525static void rcu_preempt_check_callbacks(int cpu);
526void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu));
527#if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU)
528static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp,
529 bool wake);
530#endif /* #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU) */
531static void __init __rcu_init_preempt(void);
532static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
533static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
534static void invoke_rcu_callbacks_kthread(void);
535static bool rcu_is_callbacks_kthread(void);
536#ifdef CONFIG_RCU_BOOST
537static void rcu_preempt_do_callbacks(void);
538static int rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
539 struct rcu_node *rnp);
540#endif /* #ifdef CONFIG_RCU_BOOST */
541static void rcu_prepare_kthreads(int cpu);
542static void rcu_cleanup_after_idle(int cpu);
543static void rcu_prepare_for_idle(int cpu);
544static void rcu_idle_count_callbacks_posted(void);
545static void print_cpu_stall_info_begin(void);
546static void print_cpu_stall_info(struct rcu_state *rsp, int cpu);
547static void print_cpu_stall_info_end(void);
548static void zero_cpu_stall_ticks(struct rcu_data *rdp);
549static void increment_cpu_stall_ticks(void);
550static int rcu_nocb_needs_gp(struct rcu_state *rsp);
551static void rcu_nocb_gp_set(struct rcu_node *rnp, int nrq);
552static void rcu_nocb_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp);
553static void rcu_init_one_nocb(struct rcu_node *rnp);
554static bool __call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *rhp,
555 bool lazy, unsigned long flags);
556static bool rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp,
557 struct rcu_data *rdp,
558 unsigned long flags);
559static bool rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp);
560static void do_nocb_deferred_wakeup(struct rcu_data *rdp);
561static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
562static void rcu_spawn_nocb_kthreads(struct rcu_state *rsp);
563static void rcu_kick_nohz_cpu(int cpu);
564static bool init_nocb_callback_list(struct rcu_data *rdp);
565static void rcu_sysidle_enter(struct rcu_dynticks *rdtp, int irq);
566static void rcu_sysidle_exit(struct rcu_dynticks *rdtp, int irq);
567static void rcu_sysidle_check_cpu(struct rcu_data *rdp, bool *isidle,
568 unsigned long *maxj);
569static bool is_sysidle_rcu_state(struct rcu_state *rsp);
570static void rcu_sysidle_report_gp(struct rcu_state *rsp, int isidle,
571 unsigned long maxj);
572static void rcu_bind_gp_kthread(void);
573static void rcu_sysidle_init_percpu_data(struct rcu_dynticks *rdtp);
574static bool rcu_nohz_full_cpu(struct rcu_state *rsp);
575
576#endif /* #ifndef RCU_TREE_NONCORE */
577
578#ifdef CONFIG_RCU_TRACE
579#ifdef CONFIG_RCU_NOCB_CPU
580/* Sum up queue lengths for tracing. */
581static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
582{
583 *ql = atomic_long_read(&rdp->nocb_q_count) + rdp->nocb_p_count;
584 *qll = atomic_long_read(&rdp->nocb_q_count_lazy) + rdp->nocb_p_count_lazy;
585}
586#else /* #ifdef CONFIG_RCU_NOCB_CPU */
587static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
588{
589 *ql = 0;
590 *qll = 0;
591}
592#endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
593#endif /* #ifdef CONFIG_RCU_TRACE */