tree.h 26.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
 * Internal non-public definitions.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
16 17
 * along with this program; if not, you can access it online at
 * http://www.gnu.org/licenses/gpl-2.0.html.
18 19 20 21 22 23 24 25 26 27 28 29
 *
 * Copyright IBM Corporation, 2008
 *
 * Author: Ingo Molnar <mingo@elte.hu>
 *	   Paul E. McKenney <paulmck@linux.vnet.ibm.com>
 */

#include <linux/cache.h>
#include <linux/spinlock.h>
#include <linux/threads.h>
#include <linux/cpumask.h>
#include <linux/seqlock.h>
30
#include <linux/irq_work.h>
31 32

/*
33 34
 * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and
 * CONFIG_RCU_FANOUT_LEAF.
35
 * In theory, it should be possible to add more levels straightforwardly.
36 37
 * In practice, this did work well going from three levels to four.
 * Of course, your mileage may vary.
38
 */
39
#define MAX_RCU_LVLS 4
40
#define RCU_FANOUT_1	      (CONFIG_RCU_FANOUT_LEAF)
41 42 43
#define RCU_FANOUT_2	      (RCU_FANOUT_1 * CONFIG_RCU_FANOUT)
#define RCU_FANOUT_3	      (RCU_FANOUT_2 * CONFIG_RCU_FANOUT)
#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 48 49 50
#  define NUM_RCU_LVL_0	      1
#  define NUM_RCU_LVL_1	      (NR_CPUS)
#  define NUM_RCU_LVL_2	      0
#  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 57
#  define NUM_RCU_LVL_2	      (NR_CPUS)
#  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 63 64
#  define NUM_RCU_LVL_1	      DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
#  define NUM_RCU_LVL_2	      DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
#  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 70 71 72
#  define NUM_RCU_LVL_1	      DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3)
#  define NUM_RCU_LVL_2	      DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2)
#  define NUM_RCU_LVL_3	      DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1)
#  define NUM_RCU_LVL_4	      (NR_CPUS)
73 74
#else
# 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 79
#define NUM_RCU_NODES (RCU_SUM - NR_CPUS)

80 81 82
extern int rcu_num_lvls;
extern int rcu_num_nodes;

83 84 85 86
/*
 * Dynticks per-CPU state.
 */
struct rcu_dynticks {
87 88 89 90
	long long dynticks_nesting; /* Track irq/process nesting level. */
				    /* Process level is worth LLONG_MAX/2. */
	int dynticks_nmi_nesting;   /* Track NMI nesting level. */
	atomic_t dynticks;	    /* Even value for idle, else odd. */
91 92 93 94 95 96 97 98
#ifdef CONFIG_NO_HZ_FULL_SYSIDLE
	long long dynticks_idle_nesting;
				    /* irq/process nesting level from idle. */
	atomic_t dynticks_idle;	    /* Even value for idle, else odd. */
				    /*  "Idle" excludes userspace execution. */
	unsigned long dynticks_idle_jiffies;
				    /* End of last non-NMI non-idle period. */
#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 102 103 104
	unsigned long nonlazy_posted;
				    /* # times non-lazy CBs posted to CPU. */
	unsigned long nonlazy_posted_snap;
				    /* idle-period nonlazy_posted snapshot. */
105 106
	unsigned long last_accelerate;
				    /* Last jiffy CBs were accelerated. */
107 108
	unsigned long last_advance_all;
				    /* 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 114 115 116
/* RCU's kthread states for tracing. */
#define RCU_KTHREAD_STOPPED  0
#define RCU_KTHREAD_RUNNING  1
#define RCU_KTHREAD_WAITING  2
117 118 119
#define RCU_KTHREAD_OFFCPU   3
#define RCU_KTHREAD_YIELDING 4
#define RCU_KTHREAD_MAX      4
120

121 122 123 124
/*
 * Definition for node within the RCU grace-period-detection hierarchy.
 */
struct rcu_node {
P
Paul E. McKenney 已提交
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 129
				/*  This will either be equal to or one */
				/*  behind the root rcu_node's gpnum. */
130
	unsigned long completed; /* Last GP completed for this node. */
131 132
				/*  This will either be equal to or one */
				/*  behind the root rcu_node's gpnum. */
133 134
	unsigned long qsmask;	/* CPUs or groups that need to switch in */
				/*  order for current grace period to proceed.*/
135 136 137 138
				/*  In leaf rcu_node, each bit corresponds to */
				/*  an rcu_data structure, otherwise, each */
				/*  bit corresponds to a child rcu_node */
				/*  structure. */
139
	unsigned long expmask;	/* Groups that have ->blkd_tasks */
140 141
				/*  elements that need to drain to allow the */
				/*  current expedited grace period to */
142
				/*  complete (only for 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 148 149 150 151
	int	grplo;		/* lowest-numbered CPU or group here. */
	int	grphi;		/* highest-numbered CPU or group here. */
	u8	grpnum;		/* CPU/group number for next level up. */
	u8	level;		/* root is at level 0. */
	struct rcu_node *parent;
152 153 154 155 156 157 158 159 160 161 162 163 164 165
	struct list_head blkd_tasks;
				/* Tasks blocked in RCU read-side critical */
				/*  section.  Tasks are placed at the head */
				/*  of this list and age towards the tail. */
	struct list_head *gp_tasks;
				/* Pointer to the first task blocking the */
				/*  current grace period, or NULL if there */
				/*  is no such task. */
	struct list_head *exp_tasks;
				/* Pointer to the first task blocking the */
				/*  current expedited grace period, or NULL */
				/*  if there is no such task.  If there */
				/*  is no current expedited grace period, */
				/*  then there can cannot be any such task. */
166 167 168 169 170 171 172 173 174
#ifdef CONFIG_RCU_BOOST
	struct list_head *boost_tasks;
				/* Pointer to first task that needs to be */
				/*  priority boosted, or NULL if no priority */
				/*  boosting is needed for this rcu_node */
				/*  structure.  If there are no tasks */
				/*  queued on this rcu_node structure that */
				/*  are blocking the current grace period, */
				/*  there can be no such task. */
175 176 177 178 179
	struct completion boost_completion;
				/* Used to ensure that the rt_mutex used */
				/*  to carry out the boosting is fully */
				/*  released with no future boostee accesses */
				/*  before that rt_mutex is re-initialized. */
180 181 182
	struct rt_mutex boost_mtx;
				/* Used only for the priority-boosting */
				/*  side effect, not as a lock. */
183 184 185 186 187
	unsigned long boost_time;
				/* When to start boosting (jiffies). */
	struct task_struct *boost_kthread_task;
				/* kthread that takes care of priority */
				/*  boosting for this rcu_node structure. */
188 189
	unsigned int boost_kthread_status;
				/* State of boost_kthread_task for tracing. */
190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208
	unsigned long n_tasks_boosted;
				/* Total number of tasks boosted. */
	unsigned long n_exp_boosts;
				/* Number of tasks boosted for expedited GP. */
	unsigned long n_normal_boosts;
				/* Number of tasks boosted for normal GP. */
	unsigned long n_balk_blkd_tasks;
				/* Refused to boost: no blocked tasks. */
	unsigned long n_balk_exp_gp_tasks;
				/* Refused to boost: nothing blocking GP. */
	unsigned long n_balk_boost_tasks;
				/* Refused to boost: already boosting. */
	unsigned long n_balk_notblocked;
				/* Refused to boost: RCU RS CS still running. */
	unsigned long n_balk_notyet;
				/* Refused to boost: not yet time. */
	unsigned long n_balk_nos;
				/* Refused to boost: not sure why, though. */
				/*  This can happen due to race conditions. */
209
#endif /* #ifdef CONFIG_RCU_BOOST */
210 211 212 213
#ifdef CONFIG_RCU_NOCB_CPU
	wait_queue_head_t nocb_gp_wq[2];
				/* Place for rcu_nocb_kthread() to wait GP. */
#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
214 215
	int need_future_gp[2];
				/* Counts of upcoming no-CB GP requests. */
216
	raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp;
217 218
} ____cacheline_internodealigned_in_smp;

219 220 221 222 223 224
/*
 * Do a full breadth-first scan of the rcu_node structures for the
 * specified rcu_state structure.
 */
#define rcu_for_each_node_breadth_first(rsp, rnp) \
	for ((rnp) = &(rsp)->node[0]; \
225
	     (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
226

227 228 229 230 231 232 233
/*
 * Do a breadth-first scan of the non-leaf rcu_node structures for the
 * specified rcu_state structure.  Note that if there is a singleton
 * rcu_node tree with but one rcu_node structure, this loop is a no-op.
 */
#define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \
	for ((rnp) = &(rsp)->node[0]; \
234
	     (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++)
235 236 237 238 239 240 241

/*
 * Scan the leaves of the rcu_node hierarchy for the specified rcu_state
 * structure.  Note that if there is a singleton rcu_node tree with but
 * one rcu_node structure, this loop -will- visit the rcu_node structure.
 * It is still a leaf node, even if it is also the root node.
 */
242
#define rcu_for_each_leaf_node(rsp, rnp) \
243 244
	for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \
	     (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++)
245

246 247 248 249 250 251 252 253 254 255
/* Index values for nxttail array in struct rcu_data. */
#define RCU_DONE_TAIL		0	/* Also RCU_WAIT head. */
#define RCU_WAIT_TAIL		1	/* Also RCU_NEXT_READY head. */
#define RCU_NEXT_READY_TAIL	2	/* Also RCU_NEXT head. */
#define RCU_NEXT_TAIL		3
#define RCU_NEXT_SIZE		4

/* Per-CPU data for read-copy update. */
struct rcu_data {
	/* 1) quiescent-state and grace-period handling : */
256
	unsigned long	completed;	/* Track rsp->completed gp number */
257
					/*  in order to detect GP end. */
258
	unsigned long	gpnum;		/* Highest gp number that this CPU */
259
					/*  is aware of having started. */
260
	bool		passed_quiesce;	/* User-mode/idle loop etc. */
261 262
	bool		qs_pending;	/* Core waits for quiesc state. */
	bool		beenonline;	/* CPU online at least once. */
263
	bool		gpwrap;		/* Possible gpnum/completed wrap. */
264 265
	struct rcu_node *mynode;	/* This CPU's leaf of hierarchy */
	unsigned long grpmask;		/* Mask to apply to leaf qsmask. */
266 267 268 269 270 271
#ifdef CONFIG_RCU_CPU_STALL_INFO
	unsigned long	ticks_this_gp;	/* The number of scheduling-clock */
					/*  ticks this CPU has handled */
					/*  during and after the last grace */
					/* period it is aware of. */
#endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */
272 273 274 275 276 277 278

	/* 2) batch handling */
	/*
	 * If nxtlist is not NULL, it is partitioned as follows.
	 * Any of the partitions might be empty, in which case the
	 * pointer to that partition will be equal to the pointer for
	 * the following partition.  When the list is empty, all of
279 280
	 * the nxttail elements point to the ->nxtlist pointer itself,
	 * which in that case is NULL.
281 282 283 284 285 286
	 *
	 * [nxtlist, *nxttail[RCU_DONE_TAIL]):
	 *	Entries that batch # <= ->completed
	 *	The grace period for these entries has completed, and
	 *	the other grace-period-completed entries may be moved
	 *	here temporarily in rcu_process_callbacks().
287 288 289 290 291 292 293 294
	 * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]):
	 *	Entries that batch # <= ->completed - 1: waiting for current GP
	 * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]):
	 *	Entries known to have arrived before current GP ended
	 * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]):
	 *	Entries that might have arrived after current GP ended
	 *	Note that the value of *nxttail[RCU_NEXT_TAIL] will
	 *	always be NULL, as this is the end of the list.
295 296 297
	 */
	struct rcu_head *nxtlist;
	struct rcu_head **nxttail[RCU_NEXT_SIZE];
298 299
	unsigned long	nxtcompleted[RCU_NEXT_SIZE];
					/* grace periods for sublists. */
300 301
	long		qlen_lazy;	/* # of lazy queued callbacks */
	long		qlen;		/* # of queued callbacks, incl lazy */
302 303
	long		qlen_last_fqs_check;
					/* qlen at last check for QS forcing */
304
	unsigned long	n_cbs_invoked;	/* count of RCU cbs invoked. */
305
	unsigned long	n_nocbs_invoked; /* count of no-CBs RCU cbs invoked. */
306 307
	unsigned long   n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */
	unsigned long   n_cbs_adopted;  /* RCU cbs adopted from dying CPU */
308 309
	unsigned long	n_force_qs_snap;
					/* did other CPU force QS recently? */
310 311 312 313 314 315 316 317 318
	long		blimit;		/* Upper limit on a processed batch */

	/* 3) dynticks interface. */
	struct rcu_dynticks *dynticks;	/* Shared per-CPU dynticks state. */
	int dynticks_snap;		/* Per-GP tracking for dynticks. */

	/* 4) reasons this CPU needed to be kicked by force_quiescent_state */
	unsigned long dynticks_fqs;	/* Kicked due to dynticks idle. */
	unsigned long offline_fqs;	/* Kicked due to being offline. */
319 320 321
	unsigned long cond_resched_completed;
					/* Grace period that needs help */
					/*  from cond_resched(). */
322 323

	/* 5) __rcu_pending() statistics. */
324 325
	unsigned long n_rcu_pending;	/* rcu_pending() calls since boot. */
	unsigned long n_rp_qs_pending;
326
	unsigned long n_rp_report_qs;
327 328 329 330
	unsigned long n_rp_cb_ready;
	unsigned long n_rp_cpu_needs_gp;
	unsigned long n_rp_gp_completed;
	unsigned long n_rp_gp_started;
331
	unsigned long n_rp_nocb_defer_wakeup;
332
	unsigned long n_rp_need_nothing;
333

334
	/* 6) _rcu_barrier() and OOM callbacks. */
335
	struct rcu_head barrier_head;
336 337 338
#ifdef CONFIG_RCU_FAST_NO_HZ
	struct rcu_head oom_head;
#endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */
339

P
Paul E. McKenney 已提交
340 341 342 343 344 345
	/* 7) Callback offloading. */
#ifdef CONFIG_RCU_NOCB_CPU
	struct rcu_head *nocb_head;	/* CBs waiting for kthread. */
	struct rcu_head **nocb_tail;
	atomic_long_t nocb_q_count;	/* # CBs waiting for kthread */
	atomic_long_t nocb_q_count_lazy; /*  (approximate). */
346 347 348 349
	struct rcu_head *nocb_follower_head; /* CBs ready to invoke. */
	struct rcu_head **nocb_follower_tail;
	atomic_long_t nocb_follower_count; /* # CBs ready to invoke. */
	atomic_long_t nocb_follower_count_lazy; /*  (approximate). */
P
Paul E. McKenney 已提交
350 351 352 353
	int nocb_p_count;		/* # CBs being invoked by kthread */
	int nocb_p_count_lazy;		/*  (approximate). */
	wait_queue_head_t nocb_wq;	/* For nocb kthreads to sleep on. */
	struct task_struct *nocb_kthread;
354
	int nocb_defer_wakeup;		/* Defer wakeup of nocb_kthread. */
355 356 357 358 359 360 361

	/* The following fields are used by the leader, hence own cacheline. */
	struct rcu_head *nocb_gp_head ____cacheline_internodealigned_in_smp;
					/* CBs waiting for GP. */
	struct rcu_head **nocb_gp_tail;
	long nocb_gp_count;
	long nocb_gp_count_lazy;
362
	bool nocb_leader_sleep;		/* Is the nocb leader thread asleep? */
363 364 365 366 367 368
	struct rcu_data *nocb_next_follower;
					/* Next follower in wakeup chain. */

	/* The following fields are used by the follower, hence new cachline. */
	struct rcu_data *nocb_leader ____cacheline_internodealigned_in_smp;
					/* Leader CPU takes GP-end wakeups. */
P
Paul E. McKenney 已提交
369 370
#endif /* #ifdef CONFIG_RCU_NOCB_CPU */

371 372 373 374 375
	/* 8) RCU CPU stall data. */
#ifdef CONFIG_RCU_CPU_STALL_INFO
	unsigned int softirq_snap;	/* Snapshot of softirq activity. */
#endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */

376
	int cpu;
377
	struct rcu_state *rsp;
378 379
};

380
/* Values for fqs_state field in struct rcu_state. */
381 382 383
#define RCU_GP_IDLE		0	/* No grace period in progress. */
#define RCU_GP_INIT		1	/* Grace period being initialized. */
#define RCU_SAVE_DYNTICK	2	/* Need to scan dyntick state. */
384
#define RCU_FORCE_QS		3	/* Need to force quiescent state. */
385 386
#define RCU_SIGNAL_INIT		RCU_SAVE_DYNTICK

387 388 389 390 391
/* Values for nocb_defer_wakeup field in struct rcu_data. */
#define RCU_NOGP_WAKE_NOT	0
#define RCU_NOGP_WAKE		1
#define RCU_NOGP_WAKE_FORCE	2

392 393 394
#define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500))
					/* For jiffies_till_first_fqs and */
					/*  and jiffies_till_next_fqs. */
395

396 397 398 399 400 401 402
#define RCU_JIFFIES_FQS_DIV	256	/* Very large systems need more */
					/*  delay between bouts of */
					/*  quiescent-state forcing. */

#define RCU_STALL_RAT_DELAY	2	/* Allow other CPUs time to take */
					/*  at least one scheduling clock */
					/*  irq before ratting on them. */
403

404 405 406 407 408 409 410 411 412 413
#define rcu_wait(cond)							\
do {									\
	for (;;) {							\
		set_current_state(TASK_INTERRUPTIBLE);			\
		if (cond)						\
			break;						\
		schedule();						\
	}								\
	__set_current_state(TASK_RUNNING);				\
} while (0)
414 415 416 417 418 419 420 421 422 423 424 425 426

/*
 * RCU global state, including node hierarchy.  This hierarchy is
 * represented in "heap" form in a dense array.  The root (first level)
 * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second
 * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]),
 * and the third level in ->node[m+1] and following (->node[m+1] referenced
 * by ->level[2]).  The number of levels is determined by the number of
 * CPUs and by CONFIG_RCU_FANOUT.  Small systems will have a "hierarchy"
 * consisting of a single rcu_node.
 */
struct rcu_state {
	struct rcu_node node[NUM_RCU_NODES];	/* Hierarchy. */
427
	struct rcu_node *level[RCU_NUM_LVLS];	/* Hierarchy levels. */
428
	u32 levelcnt[MAX_RCU_LVLS + 1];		/* # nodes in each level. */
429
	u8 levelspread[RCU_NUM_LVLS];		/* kids/node in each level. */
430
	u8 flavor_mask;				/* bit in flavor mask. */
431
	struct rcu_data __percpu *rda;		/* pointer of percu rcu_data. */
432 433
	void (*call)(struct rcu_head *head,	/* call_rcu() flavor. */
		     void (*func)(struct rcu_head *head));
434 435 436

	/* The following fields are guarded by the root rcu_node's lock. */

437
	u8	fqs_state ____cacheline_internodealigned_in_smp;
438
						/* Force QS state. */
439
	u8	boost;				/* Subject to priority boost. */
440 441
	unsigned long gpnum;			/* Current gp number. */
	unsigned long completed;		/* # of last completed gp. */
442 443
	struct task_struct *gp_kthread;		/* Task for grace periods. */
	wait_queue_head_t gp_wq;		/* Where GP task waits. */
444 445
	short gp_flags;				/* Commands for GP task. */
	short gp_state;				/* GP kthread sleep state. */
446

447
	/* End of fields guarded by root rcu_node's lock. */
448

449 450
	raw_spinlock_t orphan_lock ____cacheline_internodealigned_in_smp;
						/* Protect following fields. */
451 452 453 454 455 456 457 458
	struct rcu_head *orphan_nxtlist;	/* Orphaned callbacks that */
						/*  need a grace period. */
	struct rcu_head **orphan_nxttail;	/* Tail of above. */
	struct rcu_head *orphan_donelist;	/* Orphaned callbacks that */
						/*  are ready to invoke. */
	struct rcu_head **orphan_donetail;	/* Tail of above. */
	long qlen_lazy;				/* Number of lazy callbacks. */
	long qlen;				/* Total number of callbacks. */
459
	/* End of fields guarded by orphan_lock. */
460 461 462

	struct mutex onoff_mutex;		/* Coordinate hotplug & GPs. */

463
	struct mutex barrier_mutex;		/* Guards barrier fields. */
464
	atomic_t barrier_cpu_count;		/* # CPUs waiting on. */
465
	struct completion barrier_completion;	/* Wake at barrier end. */
466 467
	unsigned long n_barrier_done;		/* ++ at start and end of */
						/*  _rcu_barrier(). */
468 469
	/* End of fields guarded by barrier_mutex. */

470 471
	atomic_long_t expedited_start;		/* Starting ticket. */
	atomic_long_t expedited_done;		/* Done ticket. */
472 473 474 475 476 477 478 479 480
	atomic_long_t expedited_wrap;		/* # near-wrap incidents. */
	atomic_long_t expedited_tryfail;	/* # acquisition failures. */
	atomic_long_t expedited_workdone1;	/* # done by others #1. */
	atomic_long_t expedited_workdone2;	/* # done by others #2. */
	atomic_long_t expedited_normal;		/* # fallbacks to normal. */
	atomic_long_t expedited_stoppedcpus;	/* # successful stop_cpus. */
	atomic_long_t expedited_done_tries;	/* # tries to update _done. */
	atomic_long_t expedited_done_lost;	/* # times beaten to _done. */
	atomic_long_t expedited_done_exit;	/* # times exited _done loop. */
481

482 483 484 485 486 487 488 489 490 491
	unsigned long jiffies_force_qs;		/* Time at which to invoke */
						/*  force_quiescent_state(). */
	unsigned long n_force_qs;		/* Number of calls to */
						/*  force_quiescent_state(). */
	unsigned long n_force_qs_lh;		/* ~Number of calls leaving */
						/*  due to lock unavailable. */
	unsigned long n_force_qs_ngp;		/* Number of calls leaving */
						/*  due to no GP active. */
	unsigned long gp_start;			/* Time at which GP started, */
						/*  but in jiffies. */
492 493
	unsigned long gp_activity;		/* Time of last GP kthread */
						/*  activity in jiffies. */
494 495
	unsigned long jiffies_stall;		/* Time at which to check */
						/*  for CPU stalls. */
496 497
	unsigned long jiffies_resched;		/* Time at which to resched */
						/*  a reluctant CPU. */
498 499
	unsigned long n_force_qs_gpstart;	/* Snapshot of n_force_qs at */
						/*  GP start. */
500 501
	unsigned long gp_max;			/* Maximum GP duration in */
						/*  jiffies. */
502
	const char *name;			/* Name of structure. */
503
	char abbr;				/* Abbreviated name. */
504
	struct list_head flavors;		/* List of RCU flavors. */
505 506
};

507 508 509 510
/* Values for rcu_state structure's gp_flags field. */
#define RCU_GP_FLAG_INIT 0x1	/* Need grace-period initialization. */
#define RCU_GP_FLAG_FQS  0x2	/* Need grace-period quiescent-state forcing. */

511 512 513 514 515
/* Values for rcu_state structure's gp_flags field. */
#define RCU_GP_WAIT_INIT 0	/* Initial state. */
#define RCU_GP_WAIT_GPS  1	/* Wait for grace-period start. */
#define RCU_GP_WAIT_FQS  2	/* Wait for force-quiescent-state time. */

516
extern struct list_head rcu_struct_flavors;
P
Paul E. McKenney 已提交
517 518

/* Sequence through rcu_state structures for each RCU flavor. */
519 520 521
#define for_each_rcu_flavor(rsp) \
	list_for_each_entry((rsp), &rcu_struct_flavors, flavors)

522 523 524 525 526 527 528
/* Return values for rcu_preempt_offline_tasks(). */

#define RCU_OFL_TASKS_NORM_GP	0x1		/* Tasks blocking normal */
						/*  GP were moved to root. */
#define RCU_OFL_TASKS_EXP_GP	0x2		/* Tasks blocking expedited */
						/*  GP were moved to root. */

529 530 531
/*
 * RCU implementation internal declarations:
 */
532 533
extern struct rcu_state rcu_sched_state;
DECLARE_PER_CPU(struct rcu_data, rcu_sched_data);
534 535 536 537

extern struct rcu_state rcu_bh_state;
DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);

538
#ifdef CONFIG_PREEMPT_RCU
539 540
extern struct rcu_state rcu_preempt_state;
DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data);
541
#endif /* #ifdef CONFIG_PREEMPT_RCU */
542

543 544 545 546 547 548 549
#ifdef CONFIG_RCU_BOOST
DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status);
DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu);
DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops);
DECLARE_PER_CPU(char, rcu_cpu_has_work);
#endif /* #ifdef CONFIG_RCU_BOOST */

P
Paul E. McKenney 已提交
550
#ifndef RCU_TREE_NONCORE
551

552
/* Forward declarations for rcutree_plugin.h */
553
static void rcu_bootup_announce(void);
554
long rcu_batches_completed(void);
555
static void rcu_preempt_note_context_switch(void);
556
static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp);
557
#ifdef CONFIG_HOTPLUG_CPU
P
Paul E. McKenney 已提交
558 559
static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp,
				      unsigned long flags);
560
#endif /* #ifdef CONFIG_HOTPLUG_CPU */
561
static void rcu_print_detail_task_stall(struct rcu_state *rsp);
562
static int rcu_print_task_stall(struct rcu_node *rnp);
563 564
static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp);
#ifdef CONFIG_HOTPLUG_CPU
565 566 567
static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
				     struct rcu_node *rnp,
				     struct rcu_data *rdp);
568
#endif /* #ifdef CONFIG_HOTPLUG_CPU */
569
static void rcu_preempt_check_callbacks(void);
570
void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu));
571
#if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_PREEMPT_RCU)
572 573
static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp,
			       bool wake);
574
#endif /* #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_PREEMPT_RCU) */
575
static void __init __rcu_init_preempt(void);
576
static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags);
577 578
static void rcu_preempt_boost_start_gp(struct rcu_node *rnp);
static void invoke_rcu_callbacks_kthread(void);
579
static bool rcu_is_callbacks_kthread(void);
580 581
#ifdef CONFIG_RCU_BOOST
static void rcu_preempt_do_callbacks(void);
582
static int rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
T
Thomas Gleixner 已提交
583
						 struct rcu_node *rnp);
584
#endif /* #ifdef CONFIG_RCU_BOOST */
585
static void __init rcu_spawn_boost_kthreads(void);
586
static void rcu_prepare_kthreads(int cpu);
587
static void rcu_cleanup_after_idle(void);
588
static void rcu_prepare_for_idle(void);
589
static void rcu_idle_count_callbacks_posted(void);
590 591 592 593 594
static void print_cpu_stall_info_begin(void);
static void print_cpu_stall_info(struct rcu_state *rsp, int cpu);
static void print_cpu_stall_info_end(void);
static void zero_cpu_stall_ticks(struct rcu_data *rdp);
static void increment_cpu_stall_ticks(void);
595
static bool rcu_nocb_cpu_needs_barrier(struct rcu_state *rsp, int cpu);
596
static void rcu_nocb_gp_set(struct rcu_node *rnp, int nrq);
597
static void rcu_nocb_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp);
598
static void rcu_init_one_nocb(struct rcu_node *rnp);
P
Paul E. McKenney 已提交
599
static bool __call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *rhp,
600
			    bool lazy, unsigned long flags);
P
Paul E. McKenney 已提交
601
static bool rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp,
602 603
				      struct rcu_data *rdp,
				      unsigned long flags);
604
static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp);
605
static void do_nocb_deferred_wakeup(struct rcu_data *rdp);
P
Paul E. McKenney 已提交
606
static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp);
607 608 609 610 611
static void rcu_spawn_all_nocb_kthreads(int cpu);
static void __init rcu_spawn_nocb_kthreads(void);
#ifdef CONFIG_RCU_NOCB_CPU
static void __init rcu_organize_nocb_kthreads(struct rcu_state *rsp);
#endif /* #ifdef CONFIG_RCU_NOCB_CPU */
612
static void __maybe_unused rcu_kick_nohz_cpu(int cpu);
613
static bool init_nocb_callback_list(struct rcu_data *rdp);
614 615
static void rcu_sysidle_enter(int irq);
static void rcu_sysidle_exit(int irq);
616 617 618 619 620
static void rcu_sysidle_check_cpu(struct rcu_data *rdp, bool *isidle,
				  unsigned long *maxj);
static bool is_sysidle_rcu_state(struct rcu_state *rsp);
static void rcu_sysidle_report_gp(struct rcu_state *rsp, int isidle,
				  unsigned long maxj);
621
static void rcu_bind_gp_kthread(void);
622
static void rcu_sysidle_init_percpu_data(struct rcu_dynticks *rdtp);
623
static bool rcu_nohz_full_cpu(struct rcu_state *rsp);
624 625
static void rcu_dynticks_task_enter(void);
static void rcu_dynticks_task_exit(void);
626

P
Paul E. McKenney 已提交
627
#endif /* #ifndef RCU_TREE_NONCORE */
P
Paul E. McKenney 已提交
628 629 630 631 632 633

#ifdef CONFIG_RCU_TRACE
#ifdef CONFIG_RCU_NOCB_CPU
/* Sum up queue lengths for tracing. */
static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
{
634 635 636 637 638 639 640 641
	*ql = atomic_long_read(&rdp->nocb_q_count) +
	      rdp->nocb_p_count +
	      atomic_long_read(&rdp->nocb_follower_count) +
	      rdp->nocb_p_count + rdp->nocb_gp_count;
	*qll = atomic_long_read(&rdp->nocb_q_count_lazy) +
	       rdp->nocb_p_count_lazy +
	       atomic_long_read(&rdp->nocb_follower_count_lazy) +
	       rdp->nocb_p_count_lazy + rdp->nocb_gp_count_lazy;
P
Paul E. McKenney 已提交
642 643 644 645 646 647 648 649 650
}
#else /* #ifdef CONFIG_RCU_NOCB_CPU */
static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll)
{
	*ql = 0;
	*qll = 0;
}
#endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */
#endif /* #ifdef CONFIG_RCU_TRACE */