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 kthread worker handler. */
25struct rcu_exp_work {
26 unsigned long rew_s;
27 struct kthread_work rew_work;
28};
29
30/* RCU's kthread states for tracing. */
31#define RCU_KTHREAD_STOPPED 0
32#define RCU_KTHREAD_RUNNING 1
33#define RCU_KTHREAD_WAITING 2
34#define RCU_KTHREAD_OFFCPU 3
35#define RCU_KTHREAD_YIELDING 4
36#define RCU_KTHREAD_MAX 4
37
38/*
39 * Definition for node within the RCU grace-period-detection hierarchy.
40 */
41struct rcu_node {
42 raw_spinlock_t __private lock; /* Root rcu_node's lock protects */
43 /* some rcu_state fields as well as */
44 /* following. */
45 unsigned long gp_seq; /* Track rsp->gp_seq. */
46 unsigned long gp_seq_needed; /* Track furthest future GP request. */
47 unsigned long completedqs; /* All QSes done for this node. */
48 unsigned long qsmask; /* CPUs or groups that need to switch in */
49 /* order for current grace period to proceed.*/
50 /* In leaf rcu_node, each bit corresponds to */
51 /* an rcu_data structure, otherwise, each */
52 /* bit corresponds to a child rcu_node */
53 /* structure. */
54 unsigned long rcu_gp_init_mask; /* Mask of offline CPUs at GP init. */
55 unsigned long qsmaskinit;
56 /* Per-GP initial value for qsmask. */
57 /* Initialized from ->qsmaskinitnext at the */
58 /* beginning of each grace period. */
59 unsigned long qsmaskinitnext;
60 unsigned long expmask; /* CPUs or groups that need to check in */
61 /* to allow the current expedited GP */
62 /* to complete. */
63 unsigned long expmaskinit;
64 /* Per-GP initial values for expmask. */
65 /* Initialized from ->expmaskinitnext at the */
66 /* beginning of each expedited GP. */
67 unsigned long expmaskinitnext;
68 /* Online CPUs for next expedited GP. */
69 /* Any CPU that has ever been online will */
70 /* have its bit set. */
71 struct kthread_worker *exp_kworker;
72 /* Workers performing per node expedited GP */
73 /* initialization. */
74 unsigned long cbovldmask;
75 /* CPUs experiencing callback overload. */
76 unsigned long ffmask; /* Fully functional CPUs. */
77 unsigned long grpmask; /* Mask to apply to parent qsmask. */
78 /* Only one bit will be set in this mask. */
79 int grplo; /* lowest-numbered CPU here. */
80 int grphi; /* highest-numbered CPU here. */
81 u8 grpnum; /* group number for next level up. */
82 u8 level; /* root is at level 0. */
83 bool wait_blkd_tasks;/* Necessary to wait for blocked tasks to */
84 /* exit RCU read-side critical sections */
85 /* before propagating offline up the */
86 /* rcu_node tree? */
87 struct rcu_node *parent;
88 struct list_head blkd_tasks;
89 /* Tasks blocked in RCU read-side critical */
90 /* section. Tasks are placed at the head */
91 /* of this list and age towards the tail. */
92 struct list_head *gp_tasks;
93 /* Pointer to the first task blocking the */
94 /* current grace period, or NULL if there */
95 /* is no such task. */
96 struct list_head *exp_tasks;
97 /* Pointer to the first task blocking the */
98 /* current expedited grace period, or NULL */
99 /* if there is no such task. If there */
100 /* is no current expedited grace period, */
101 /* then there can cannot be any such task. */
102 struct list_head *boost_tasks;
103 /* Pointer to first task that needs to be */
104 /* priority boosted, or NULL if no priority */
105 /* boosting is needed for this rcu_node */
106 /* structure. If there are no tasks */
107 /* queued on this rcu_node structure that */
108 /* are blocking the current grace period, */
109 /* there can be no such task. */
110 struct rt_mutex boost_mtx;
111 /* Used only for the priority-boosting */
112 /* side effect, not as a lock. */
113 unsigned long boost_time;
114 /* When to start boosting (jiffies). */
115 struct mutex kthread_mutex;
116 /* Exclusion for thread spawning and affinity */
117 /* manipulation. */
118 struct task_struct *boost_kthread_task;
119 /* kthread that takes care of priority */
120 /* boosting for this rcu_node structure. */
121 unsigned int boost_kthread_status;
122 /* State of boost_kthread_task for tracing. */
123 unsigned long n_boosts; /* Number of boosts for this rcu_node structure. */
124#ifdef CONFIG_RCU_NOCB_CPU
125 struct swait_queue_head nocb_gp_wq[2];
126 /* Place for rcu_nocb_kthread() to wait GP. */
127#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
128 raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
129
130 spinlock_t exp_lock ____cacheline_internodealigned_in_smp;
131 unsigned long exp_seq_rq;
132 wait_queue_head_t exp_wq[4];
133 struct rcu_exp_work rew;
134 bool exp_need_flush; /* Need to flush workitem? */
135 raw_spinlock_t exp_poll_lock;
136 /* Lock and data for polled expedited grace periods. */
137 unsigned long exp_seq_poll_rq;
138 struct work_struct exp_poll_wq;
139} ____cacheline_internodealigned_in_smp;
140
141/*
142 * Bitmasks in an rcu_node cover the interval [grplo, grphi] of CPU IDs, and
143 * are indexed relative to this interval rather than the global CPU ID space.
144 * This generates the bit for a CPU in node-local masks.
145 */
146#define leaf_node_cpu_bit(rnp, cpu) (BIT((cpu) - (rnp)->grplo))
147
148/*
149 * Union to allow "aggregate OR" operation on the need for a quiescent
150 * state by the normal and expedited grace periods.
151 */
152union rcu_noqs {
153 struct {
154 u8 norm;
155 u8 exp;
156 } b; /* Bits. */
157 u16 s; /* Set of bits, aggregate OR here. */
158};
159
160/*
161 * Record the snapshot of the core stats at half of the first RCU stall timeout.
162 * The member gp_seq is used to ensure that all members are updated only once
163 * during the sampling period. The snapshot is taken only if this gp_seq is not
164 * equal to rdp->gp_seq.
165 */
166struct rcu_snap_record {
167 unsigned long gp_seq; /* Track rdp->gp_seq counter */
168 u64 cputime_irq; /* Accumulated cputime of hard irqs */
169 u64 cputime_softirq;/* Accumulated cputime of soft irqs */
170 u64 cputime_system; /* Accumulated cputime of kernel tasks */
171 unsigned long nr_hardirqs; /* Accumulated number of hard irqs */
172 unsigned int nr_softirqs; /* Accumulated number of soft irqs */
173 unsigned long long nr_csw; /* Accumulated number of task switches */
174 unsigned long jiffies; /* Track jiffies value */
175};
176
177/* Per-CPU data for read-copy update. */
178struct rcu_data {
179 /* 1) quiescent-state and grace-period handling : */
180 unsigned long gp_seq; /* Track rsp->gp_seq counter. */
181 unsigned long gp_seq_needed; /* Track furthest future GP request. */
182 union rcu_noqs cpu_no_qs; /* No QSes yet for this CPU. */
183 bool core_needs_qs; /* Core waits for quiescent state. */
184 bool beenonline; /* CPU online at least once. */
185 bool gpwrap; /* Possible ->gp_seq wrap. */
186 bool cpu_started; /* RCU watching this onlining CPU. */
187 struct rcu_node *mynode; /* This CPU's leaf of hierarchy */
188 unsigned long grpmask; /* Mask to apply to leaf qsmask. */
189 unsigned long ticks_this_gp; /* The number of scheduling-clock */
190 /* ticks this CPU has handled */
191 /* during and after the last grace */
192 /* period it is aware of. */
193 struct irq_work defer_qs_iw; /* Obtain later scheduler attention. */
194 bool defer_qs_iw_pending; /* Scheduler attention pending? */
195 struct work_struct strict_work; /* Schedule readers for strict GPs. */
196
197 /* 2) batch handling */
198 struct rcu_segcblist cblist; /* Segmented callback list, with */
199 /* different callbacks waiting for */
200 /* different grace periods. */
201 long qlen_last_fqs_check;
202 /* qlen at last check for QS forcing */
203 unsigned long n_cbs_invoked; /* # callbacks invoked since boot. */
204 unsigned long n_force_qs_snap;
205 /* did other CPU force QS recently? */
206 long blimit; /* Upper limit on a processed batch */
207
208 /* 3) dynticks interface. */
209 int dynticks_snap; /* Per-GP tracking for dynticks. */
210 bool rcu_need_heavy_qs; /* GP old, so heavy quiescent state! */
211 bool rcu_urgent_qs; /* GP old need light quiescent state. */
212 bool rcu_forced_tick; /* Forced tick to provide QS. */
213 bool rcu_forced_tick_exp; /* ... provide QS to expedited GP. */
214
215 /* 4) rcu_barrier(), OOM callbacks, and expediting. */
216 unsigned long barrier_seq_snap; /* Snap of rcu_state.barrier_sequence. */
217 struct rcu_head barrier_head;
218 int exp_dynticks_snap; /* Double-check need for IPI. */
219
220 /* 5) Callback offloading. */
221#ifdef CONFIG_RCU_NOCB_CPU
222 struct swait_queue_head nocb_cb_wq; /* For nocb kthreads to sleep on. */
223 struct swait_queue_head nocb_state_wq; /* For offloading state changes */
224 struct task_struct *nocb_gp_kthread;
225 raw_spinlock_t nocb_lock; /* Guard following pair of fields. */
226 atomic_t nocb_lock_contended; /* Contention experienced. */
227 int nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */
228 struct timer_list nocb_timer; /* Enforce finite deferral. */
229 unsigned long nocb_gp_adv_time; /* Last call_rcu() CB adv (jiffies). */
230 struct mutex nocb_gp_kthread_mutex; /* Exclusion for nocb gp kthread */
231 /* spawning */
232
233 /* The following fields are used by call_rcu, hence own cacheline. */
234 raw_spinlock_t nocb_bypass_lock ____cacheline_internodealigned_in_smp;
235 struct rcu_cblist nocb_bypass; /* Lock-contention-bypass CB list. */
236 unsigned long nocb_bypass_first; /* Time (jiffies) of first enqueue. */
237 unsigned long nocb_nobypass_last; /* Last ->cblist enqueue (jiffies). */
238 int nocb_nobypass_count; /* # ->cblist enqueues at ^^^ time. */
239
240 /* The following fields are used by GP kthread, hence own cacheline. */
241 raw_spinlock_t nocb_gp_lock ____cacheline_internodealigned_in_smp;
242 u8 nocb_gp_sleep; /* Is the nocb GP thread asleep? */
243 u8 nocb_gp_bypass; /* Found a bypass on last scan? */
244 u8 nocb_gp_gp; /* GP to wait for on last scan? */
245 unsigned long nocb_gp_seq; /* If so, ->gp_seq to wait for. */
246 unsigned long nocb_gp_loops; /* # passes through wait code. */
247 struct swait_queue_head nocb_gp_wq; /* For nocb kthreads to sleep on. */
248 bool nocb_cb_sleep; /* Is the nocb CB thread asleep? */
249 struct task_struct *nocb_cb_kthread;
250 struct list_head nocb_head_rdp; /*
251 * Head of rcu_data list in wakeup chain,
252 * if rdp_gp.
253 */
254 struct list_head nocb_entry_rdp; /* rcu_data node in wakeup chain. */
255 struct rcu_data *nocb_toggling_rdp; /* rdp queued for (de-)offloading */
256
257 /* The following fields are used by CB kthread, hence new cacheline. */
258 struct rcu_data *nocb_gp_rdp ____cacheline_internodealigned_in_smp;
259 /* GP rdp takes GP-end wakeups. */
260#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
261
262 /* 6) RCU priority boosting. */
263 struct task_struct *rcu_cpu_kthread_task;
264 /* rcuc per-CPU kthread or NULL. */
265 unsigned int rcu_cpu_kthread_status;
266 char rcu_cpu_has_work;
267 unsigned long rcuc_activity;
268
269 /* 7) Diagnostic data, including RCU CPU stall warnings. */
270 unsigned int softirq_snap; /* Snapshot of softirq activity. */
271 /* ->rcu_iw* fields protected by leaf rcu_node ->lock. */
272 struct irq_work rcu_iw; /* Check for non-irq activity. */
273 bool rcu_iw_pending; /* Is ->rcu_iw pending? */
274 unsigned long rcu_iw_gp_seq; /* ->gp_seq associated with ->rcu_iw. */
275 unsigned long rcu_ofl_gp_seq; /* ->gp_seq at last offline. */
276 short rcu_ofl_gp_flags; /* ->gp_flags at last offline. */
277 unsigned long rcu_onl_gp_seq; /* ->gp_seq at last online. */
278 short rcu_onl_gp_flags; /* ->gp_flags at last online. */
279 unsigned long last_fqs_resched; /* Time of last rcu_resched(). */
280 unsigned long last_sched_clock; /* Jiffies of last rcu_sched_clock_irq(). */
281 struct rcu_snap_record snap_record; /* Snapshot of core stats at half of */
282 /* the first RCU stall timeout */
283
284 long lazy_len; /* Length of buffered lazy callbacks. */
285 int cpu;
286};
287
288/* Values for nocb_defer_wakeup field in struct rcu_data. */
289#define RCU_NOCB_WAKE_NOT 0
290#define RCU_NOCB_WAKE_BYPASS 1
291#define RCU_NOCB_WAKE_LAZY 2
292#define RCU_NOCB_WAKE 3
293#define RCU_NOCB_WAKE_FORCE 4
294
295#define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
296 /* For jiffies_till_first_fqs and */
297 /* and jiffies_till_next_fqs. */
298
299#define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */
300 /* delay between bouts of */
301 /* quiescent-state forcing. */
302
303#define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */
304 /* at least one scheduling clock */
305 /* irq before ratting on them. */
306
307#define rcu_wait(cond) \
308do { \
309 for (;;) { \
310 set_current_state(TASK_INTERRUPTIBLE); \
311 if (cond) \
312 break; \
313 schedule(); \
314 } \
315 __set_current_state(TASK_RUNNING); \
316} while (0)
317
318/*
319 * RCU global state, including node hierarchy. This hierarchy is
320 * represented in "heap" form in a dense array. The root (first level)
321 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
322 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
323 * and the third level in ->node[m+1] and following (->node[m+1] referenced
324 * by ->level[2]). The number of levels is determined by the number of
325 * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy"
326 * consisting of a single rcu_node.
327 */
328struct rcu_state {
329 struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */
330 struct rcu_node *level[RCU_NUM_LVLS + 1];
331 /* Hierarchy levels (+1 to */
332 /* shut bogus gcc warning) */
333 int ncpus; /* # CPUs seen so far. */
334 int n_online_cpus; /* # CPUs online for RCU. */
335
336 /* The following fields are guarded by the root rcu_node's lock. */
337
338 unsigned long gp_seq ____cacheline_internodealigned_in_smp;
339 /* Grace-period sequence #. */
340 unsigned long gp_max; /* Maximum GP duration in */
341 /* jiffies. */
342 struct task_struct *gp_kthread; /* Task for grace periods. */
343 struct swait_queue_head gp_wq; /* Where GP task waits. */
344 short gp_flags; /* Commands for GP task. */
345 short gp_state; /* GP kthread sleep state. */
346 unsigned long gp_wake_time; /* Last GP kthread wake. */
347 unsigned long gp_wake_seq; /* ->gp_seq at ^^^. */
348 unsigned long gp_seq_polled; /* GP seq for polled API. */
349 unsigned long gp_seq_polled_snap; /* ->gp_seq_polled at normal GP start. */
350 unsigned long gp_seq_polled_exp_snap; /* ->gp_seq_polled at expedited GP start. */
351
352 /* End of fields guarded by root rcu_node's lock. */
353
354 struct mutex barrier_mutex; /* Guards barrier fields. */
355 atomic_t barrier_cpu_count; /* # CPUs waiting on. */
356 struct completion barrier_completion; /* Wake at barrier end. */
357 unsigned long barrier_sequence; /* ++ at start and end of */
358 /* rcu_barrier(). */
359 /* End of fields guarded by barrier_mutex. */
360
361 raw_spinlock_t barrier_lock; /* Protects ->barrier_seq_snap. */
362
363 struct mutex exp_mutex; /* Serialize expedited GP. */
364 struct mutex exp_wake_mutex; /* Serialize wakeup. */
365 unsigned long expedited_sequence; /* Take a ticket. */
366 atomic_t expedited_need_qs; /* # CPUs left to check in. */
367 struct swait_queue_head expedited_wq; /* Wait for check-ins. */
368 int ncpus_snap; /* # CPUs seen last time. */
369 u8 cbovld; /* Callback overload now? */
370 u8 cbovldnext; /* ^ ^ next time? */
371
372 unsigned long jiffies_force_qs; /* Time at which to invoke */
373 /* force_quiescent_state(). */
374 unsigned long jiffies_kick_kthreads; /* Time at which to kick */
375 /* kthreads, if configured. */
376 unsigned long n_force_qs; /* Number of calls to */
377 /* force_quiescent_state(). */
378 unsigned long gp_start; /* Time at which GP started, */
379 /* but in jiffies. */
380 unsigned long gp_end; /* Time last GP ended, again */
381 /* in jiffies. */
382 unsigned long gp_activity; /* Time of last GP kthread */
383 /* activity in jiffies. */
384 unsigned long gp_req_activity; /* Time of last GP request */
385 /* in jiffies. */
386 unsigned long jiffies_stall; /* Time at which to check */
387 /* for CPU stalls. */
388 int nr_fqs_jiffies_stall; /* Number of fqs loops after
389 * which read jiffies and set
390 * jiffies_stall. Stall
391 * warnings disabled if !0. */
392 unsigned long jiffies_resched; /* Time at which to resched */
393 /* a reluctant CPU. */
394 unsigned long n_force_qs_gpstart; /* Snapshot of n_force_qs at */
395 /* GP start. */
396 const char *name; /* Name of structure. */
397 char abbr; /* Abbreviated name. */
398
399 arch_spinlock_t ofl_lock ____cacheline_internodealigned_in_smp;
400 /* Synchronize offline with */
401 /* GP pre-initialization. */
402 int nocb_is_setup; /* nocb is setup from boot */
403};
404
405/* Values for rcu_state structure's gp_flags field. */
406#define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */
407#define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */
408#define RCU_GP_FLAG_OVLD 0x4 /* Experiencing callback overload. */
409
410/* Values for rcu_state structure's gp_state field. */
411#define RCU_GP_IDLE 0 /* Initial state and no GP in progress. */
412#define RCU_GP_WAIT_GPS 1 /* Wait for grace-period start. */
413#define RCU_GP_DONE_GPS 2 /* Wait done for grace-period start. */
414#define RCU_GP_ONOFF 3 /* Grace-period initialization hotplug. */
415#define RCU_GP_INIT 4 /* Grace-period initialization. */
416#define RCU_GP_WAIT_FQS 5 /* Wait for force-quiescent-state time. */
417#define RCU_GP_DOING_FQS 6 /* Wait done for force-quiescent-state time. */
418#define RCU_GP_CLEANUP 7 /* Grace-period cleanup started. */
419#define RCU_GP_CLEANED 8 /* Grace-period cleanup complete. */
420
421/*
422 * In order to export the rcu_state name to the tracing tools, it
423 * needs to be added in the __tracepoint_string section.
424 * This requires defining a separate variable tp_<sname>_varname
425 * that points to the string being used, and this will allow
426 * the tracing userspace tools to be able to decipher the string
427 * address to the matching string.
428 */
429#ifdef CONFIG_PREEMPT_RCU
430#define RCU_ABBR 'p'
431#define RCU_NAME_RAW "rcu_preempt"
432#else /* #ifdef CONFIG_PREEMPT_RCU */
433#define RCU_ABBR 's'
434#define RCU_NAME_RAW "rcu_sched"
435#endif /* #else #ifdef CONFIG_PREEMPT_RCU */
436#ifndef CONFIG_TRACING
437#define RCU_NAME RCU_NAME_RAW
438#else /* #ifdef CONFIG_TRACING */
439static char rcu_name[] = RCU_NAME_RAW;
440static const char *tp_rcu_varname __used __tracepoint_string = rcu_name;
441#define RCU_NAME rcu_name
442#endif /* #else #ifdef CONFIG_TRACING */
443
444/* Forward declarations for tree_plugin.h */
445static void rcu_bootup_announce(void);
446static void rcu_qs(void);
447static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
448#ifdef CONFIG_HOTPLUG_CPU
449static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
450#endif /* #ifdef CONFIG_HOTPLUG_CPU */
451static int rcu_print_task_exp_stall(struct rcu_node *rnp);
452static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
453static void rcu_flavor_sched_clock_irq(int user);
454static void dump_blkd_tasks(struct rcu_node *rnp, int ncheck);
455static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
456static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
457static bool rcu_is_callbacks_kthread(struct rcu_data *rdp);
458static void rcu_cpu_kthread_setup(unsigned int cpu);
459static void rcu_spawn_one_boost_kthread(struct rcu_node *rnp);
460static bool rcu_preempt_has_tasks(struct rcu_node *rnp);
461static bool rcu_preempt_need_deferred_qs(struct task_struct *t);
462static void zero_cpu_stall_ticks(struct rcu_data *rdp);
463static struct swait_queue_head *rcu_nocb_gp_get(struct rcu_node *rnp);
464static void rcu_nocb_gp_cleanup(struct swait_queue_head *sq);
465static void rcu_init_one_nocb(struct rcu_node *rnp);
466static bool wake_nocb_gp(struct rcu_data *rdp, bool force);
467static bool rcu_nocb_flush_bypass(struct rcu_data *rdp, struct rcu_head *rhp,
468 unsigned long j, bool lazy);
469static void call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *head,
470 rcu_callback_t func, unsigned long flags, bool lazy);
471static void __maybe_unused __call_rcu_nocb_wake(struct rcu_data *rdp, bool was_empty,
472 unsigned long flags);
473static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp, int level);
474static bool do_nocb_deferred_wakeup(struct rcu_data *rdp);
475static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
476static void rcu_spawn_cpu_nocb_kthread(int cpu);
477static void show_rcu_nocb_state(struct rcu_data *rdp);
478static void rcu_nocb_lock(struct rcu_data *rdp);
479static void rcu_nocb_unlock(struct rcu_data *rdp);
480static void rcu_nocb_unlock_irqrestore(struct rcu_data *rdp,
481 unsigned long flags);
482static void rcu_lockdep_assert_cblist_protected(struct rcu_data *rdp);
483#ifdef CONFIG_RCU_NOCB_CPU
484static void __init rcu_organize_nocb_kthreads(void);
485
486/*
487 * Disable IRQs before checking offloaded state so that local
488 * locking is safe against concurrent de-offloading.
489 */
490#define rcu_nocb_lock_irqsave(rdp, flags) \
491do { \
492 local_irq_save(flags); \
493 if (rcu_segcblist_is_offloaded(&(rdp)->cblist)) \
494 raw_spin_lock(&(rdp)->nocb_lock); \
495} while (0)
496#else /* #ifdef CONFIG_RCU_NOCB_CPU */
497#define rcu_nocb_lock_irqsave(rdp, flags) local_irq_save(flags)
498#endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
499
500static void rcu_bind_gp_kthread(void);
501static bool rcu_nohz_full_cpu(void);
502
503/* Forward declarations for tree_stall.h */
504static void record_gp_stall_check_time(void);
505static void rcu_iw_handler(struct irq_work *iwp);
506static void check_cpu_stall(struct rcu_data *rdp);
507static void rcu_check_gp_start_stall(struct rcu_node *rnp, struct rcu_data *rdp,
508 const unsigned long gpssdelay);
509
510/* Forward declarations for tree_exp.h. */
511static void sync_rcu_do_polled_gp(struct work_struct *wp);
512

source code of linux/kernel/rcu/tree.h