Commit | Line | Data |
---|---|---|
9f77da9f PM |
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, write to the Free Software | |
17 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
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 | ||
31 | /* | |
8932a63d PM |
32 | * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and |
33 | * CONFIG_RCU_FANOUT_LEAF. | |
9f77da9f | 34 | * In theory, it should be possible to add more levels straightforwardly. |
0209f649 PM |
35 | * In practice, this did work well going from three levels to four. |
36 | * Of course, your mileage may vary. | |
9f77da9f | 37 | */ |
cf244dc0 | 38 | #define MAX_RCU_LVLS 4 |
8932a63d | 39 | #define RCU_FANOUT_1 (CONFIG_RCU_FANOUT_LEAF) |
0209f649 PM |
40 | #define RCU_FANOUT_2 (RCU_FANOUT_1 * CONFIG_RCU_FANOUT) |
41 | #define RCU_FANOUT_3 (RCU_FANOUT_2 * CONFIG_RCU_FANOUT) | |
42 | #define RCU_FANOUT_4 (RCU_FANOUT_3 * CONFIG_RCU_FANOUT) | |
9f77da9f | 43 | |
0209f649 | 44 | #if NR_CPUS <= RCU_FANOUT_1 |
f885b7f2 | 45 | # define RCU_NUM_LVLS 1 |
9f77da9f PM |
46 | # define NUM_RCU_LVL_0 1 |
47 | # define NUM_RCU_LVL_1 (NR_CPUS) | |
48 | # define NUM_RCU_LVL_2 0 | |
49 | # define NUM_RCU_LVL_3 0 | |
cf244dc0 | 50 | # define NUM_RCU_LVL_4 0 |
0209f649 | 51 | #elif NR_CPUS <= RCU_FANOUT_2 |
f885b7f2 | 52 | # define RCU_NUM_LVLS 2 |
9f77da9f | 53 | # define NUM_RCU_LVL_0 1 |
0209f649 | 54 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) |
9f77da9f PM |
55 | # define NUM_RCU_LVL_2 (NR_CPUS) |
56 | # define NUM_RCU_LVL_3 0 | |
cf244dc0 | 57 | # define NUM_RCU_LVL_4 0 |
0209f649 | 58 | #elif NR_CPUS <= RCU_FANOUT_3 |
f885b7f2 | 59 | # define RCU_NUM_LVLS 3 |
9f77da9f | 60 | # define NUM_RCU_LVL_0 1 |
0209f649 PM |
61 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2) |
62 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) | |
63 | # define NUM_RCU_LVL_3 (NR_CPUS) | |
cf244dc0 | 64 | # define NUM_RCU_LVL_4 0 |
0209f649 | 65 | #elif NR_CPUS <= RCU_FANOUT_4 |
f885b7f2 | 66 | # define RCU_NUM_LVLS 4 |
cf244dc0 | 67 | # define NUM_RCU_LVL_0 1 |
0209f649 PM |
68 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3) |
69 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2) | |
70 | # define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) | |
71 | # define NUM_RCU_LVL_4 (NR_CPUS) | |
9f77da9f PM |
72 | #else |
73 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" | |
0209f649 | 74 | #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */ |
9f77da9f | 75 | |
cf244dc0 | 76 | #define RCU_SUM (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3 + NUM_RCU_LVL_4) |
9f77da9f PM |
77 | #define NUM_RCU_NODES (RCU_SUM - NR_CPUS) |
78 | ||
f885b7f2 PM |
79 | extern int rcu_num_lvls; |
80 | extern int rcu_num_nodes; | |
81 | ||
9f77da9f PM |
82 | /* |
83 | * Dynticks per-CPU state. | |
84 | */ | |
85 | struct rcu_dynticks { | |
9b2e4f18 PM |
86 | long long dynticks_nesting; /* Track irq/process nesting level. */ |
87 | /* Process level is worth LLONG_MAX/2. */ | |
88 | int dynticks_nmi_nesting; /* Track NMI nesting level. */ | |
89 | atomic_t dynticks; /* Even value for idle, else odd. */ | |
5955f7ee PM |
90 | #ifdef CONFIG_RCU_FAST_NO_HZ |
91 | int dyntick_drain; /* Prepare-for-idle state variable. */ | |
92 | unsigned long dyntick_holdoff; | |
93 | /* No retries for the jiffy of failure. */ | |
94 | struct timer_list idle_gp_timer; | |
95 | /* Wake up CPU sleeping with callbacks. */ | |
96 | unsigned long idle_gp_timer_expires; | |
97 | /* When to wake up CPU (for repost). */ | |
98 | bool idle_first_pass; /* First pass of attempt to go idle? */ | |
99 | unsigned long nonlazy_posted; | |
100 | /* # times non-lazy CBs posted to CPU. */ | |
101 | unsigned long nonlazy_posted_snap; | |
102 | /* idle-period nonlazy_posted snapshot. */ | |
9d2ad243 | 103 | int tick_nohz_enabled_snap; /* Previously seen value from sysfs. */ |
5955f7ee | 104 | #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */ |
9f77da9f PM |
105 | }; |
106 | ||
d71df90e PM |
107 | /* RCU's kthread states for tracing. */ |
108 | #define RCU_KTHREAD_STOPPED 0 | |
109 | #define RCU_KTHREAD_RUNNING 1 | |
110 | #define RCU_KTHREAD_WAITING 2 | |
15ba0ba8 PM |
111 | #define RCU_KTHREAD_OFFCPU 3 |
112 | #define RCU_KTHREAD_YIELDING 4 | |
113 | #define RCU_KTHREAD_MAX 4 | |
d71df90e | 114 | |
9f77da9f PM |
115 | /* |
116 | * Definition for node within the RCU grace-period-detection hierarchy. | |
117 | */ | |
118 | struct rcu_node { | |
1304afb2 | 119 | raw_spinlock_t lock; /* Root rcu_node's lock protects some */ |
1eba8f84 | 120 | /* rcu_state fields as well as following. */ |
20133cfc | 121 | unsigned long gpnum; /* Current grace period for this node. */ |
86848966 PM |
122 | /* This will either be equal to or one */ |
123 | /* behind the root rcu_node's gpnum. */ | |
20133cfc | 124 | unsigned long completed; /* Last GP completed for this node. */ |
d09b62df PM |
125 | /* This will either be equal to or one */ |
126 | /* behind the root rcu_node's gpnum. */ | |
9f77da9f PM |
127 | unsigned long qsmask; /* CPUs or groups that need to switch in */ |
128 | /* order for current grace period to proceed.*/ | |
1eba8f84 PM |
129 | /* In leaf rcu_node, each bit corresponds to */ |
130 | /* an rcu_data structure, otherwise, each */ | |
131 | /* bit corresponds to a child rcu_node */ | |
132 | /* structure. */ | |
12f5f524 | 133 | unsigned long expmask; /* Groups that have ->blkd_tasks */ |
d9a3da06 PM |
134 | /* elements that need to drain to allow the */ |
135 | /* current expedited grace period to */ | |
136 | /* complete (only for TREE_PREEMPT_RCU). */ | |
8826f3b0 PM |
137 | atomic_t wakemask; /* CPUs whose kthread needs to be awakened. */ |
138 | /* Since this has meaning only for leaf */ | |
139 | /* rcu_node structures, 32 bits suffices. */ | |
9f77da9f | 140 | unsigned long qsmaskinit; |
d9a3da06 | 141 | /* Per-GP initial value for qsmask & expmask. */ |
9f77da9f | 142 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ |
1eba8f84 | 143 | /* Only one bit will be set in this mask. */ |
9f77da9f PM |
144 | int grplo; /* lowest-numbered CPU or group here. */ |
145 | int grphi; /* highest-numbered CPU or group here. */ | |
146 | u8 grpnum; /* CPU/group number for next level up. */ | |
147 | u8 level; /* root is at level 0. */ | |
148 | struct rcu_node *parent; | |
12f5f524 PM |
149 | struct list_head blkd_tasks; |
150 | /* Tasks blocked in RCU read-side critical */ | |
151 | /* section. Tasks are placed at the head */ | |
152 | /* of this list and age towards the tail. */ | |
153 | struct list_head *gp_tasks; | |
154 | /* Pointer to the first task blocking the */ | |
155 | /* current grace period, or NULL if there */ | |
156 | /* is no such task. */ | |
157 | struct list_head *exp_tasks; | |
158 | /* Pointer to the first task blocking the */ | |
159 | /* current expedited grace period, or NULL */ | |
160 | /* if there is no such task. If there */ | |
161 | /* is no current expedited grace period, */ | |
162 | /* then there can cannot be any such task. */ | |
27f4d280 PM |
163 | #ifdef CONFIG_RCU_BOOST |
164 | struct list_head *boost_tasks; | |
165 | /* Pointer to first task that needs to be */ | |
166 | /* priority boosted, or NULL if no priority */ | |
167 | /* boosting is needed for this rcu_node */ | |
168 | /* structure. If there are no tasks */ | |
169 | /* queued on this rcu_node structure that */ | |
170 | /* are blocking the current grace period, */ | |
171 | /* there can be no such task. */ | |
172 | unsigned long boost_time; | |
173 | /* When to start boosting (jiffies). */ | |
174 | struct task_struct *boost_kthread_task; | |
175 | /* kthread that takes care of priority */ | |
176 | /* boosting for this rcu_node structure. */ | |
d71df90e PM |
177 | unsigned int boost_kthread_status; |
178 | /* State of boost_kthread_task for tracing. */ | |
0ea1f2eb PM |
179 | unsigned long n_tasks_boosted; |
180 | /* Total number of tasks boosted. */ | |
181 | unsigned long n_exp_boosts; | |
182 | /* Number of tasks boosted for expedited GP. */ | |
183 | unsigned long n_normal_boosts; | |
184 | /* Number of tasks boosted for normal GP. */ | |
185 | unsigned long n_balk_blkd_tasks; | |
186 | /* Refused to boost: no blocked tasks. */ | |
187 | unsigned long n_balk_exp_gp_tasks; | |
188 | /* Refused to boost: nothing blocking GP. */ | |
189 | unsigned long n_balk_boost_tasks; | |
190 | /* Refused to boost: already boosting. */ | |
191 | unsigned long n_balk_notblocked; | |
192 | /* Refused to boost: RCU RS CS still running. */ | |
193 | unsigned long n_balk_notyet; | |
194 | /* Refused to boost: not yet time. */ | |
195 | unsigned long n_balk_nos; | |
196 | /* Refused to boost: not sure why, though. */ | |
197 | /* This can happen due to race conditions. */ | |
27f4d280 | 198 | #endif /* #ifdef CONFIG_RCU_BOOST */ |
9f77da9f PM |
199 | } ____cacheline_internodealigned_in_smp; |
200 | ||
a0b6c9a7 PM |
201 | /* |
202 | * Do a full breadth-first scan of the rcu_node structures for the | |
203 | * specified rcu_state structure. | |
204 | */ | |
205 | #define rcu_for_each_node_breadth_first(rsp, rnp) \ | |
206 | for ((rnp) = &(rsp)->node[0]; \ | |
f885b7f2 | 207 | (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++) |
a0b6c9a7 | 208 | |
d9a3da06 PM |
209 | /* |
210 | * Do a breadth-first scan of the non-leaf rcu_node structures for the | |
211 | * specified rcu_state structure. Note that if there is a singleton | |
212 | * rcu_node tree with but one rcu_node structure, this loop is a no-op. | |
213 | */ | |
214 | #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \ | |
215 | for ((rnp) = &(rsp)->node[0]; \ | |
f885b7f2 | 216 | (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++) |
d9a3da06 PM |
217 | |
218 | /* | |
219 | * Scan the leaves of the rcu_node hierarchy for the specified rcu_state | |
220 | * structure. Note that if there is a singleton rcu_node tree with but | |
221 | * one rcu_node structure, this loop -will- visit the rcu_node structure. | |
222 | * It is still a leaf node, even if it is also the root node. | |
223 | */ | |
a0b6c9a7 | 224 | #define rcu_for_each_leaf_node(rsp, rnp) \ |
f885b7f2 PM |
225 | for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \ |
226 | (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++) | |
a0b6c9a7 | 227 | |
9f77da9f PM |
228 | /* Index values for nxttail array in struct rcu_data. */ |
229 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ | |
230 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ | |
231 | #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */ | |
232 | #define RCU_NEXT_TAIL 3 | |
233 | #define RCU_NEXT_SIZE 4 | |
234 | ||
235 | /* Per-CPU data for read-copy update. */ | |
236 | struct rcu_data { | |
237 | /* 1) quiescent-state and grace-period handling : */ | |
20133cfc | 238 | unsigned long completed; /* Track rsp->completed gp number */ |
9f77da9f | 239 | /* in order to detect GP end. */ |
20133cfc | 240 | unsigned long gpnum; /* Highest gp number that this CPU */ |
9f77da9f | 241 | /* is aware of having started. */ |
e4cc1f22 PM |
242 | unsigned long passed_quiesce_gpnum; |
243 | /* gpnum at time of quiescent state. */ | |
244 | bool passed_quiesce; /* User-mode/idle loop etc. */ | |
9f77da9f PM |
245 | bool qs_pending; /* Core waits for quiesc state. */ |
246 | bool beenonline; /* CPU online at least once. */ | |
6cc68793 | 247 | bool preemptible; /* Preemptible RCU? */ |
9f77da9f PM |
248 | struct rcu_node *mynode; /* This CPU's leaf of hierarchy */ |
249 | unsigned long grpmask; /* Mask to apply to leaf qsmask. */ | |
a858af28 PM |
250 | #ifdef CONFIG_RCU_CPU_STALL_INFO |
251 | unsigned long ticks_this_gp; /* The number of scheduling-clock */ | |
252 | /* ticks this CPU has handled */ | |
253 | /* during and after the last grace */ | |
254 | /* period it is aware of. */ | |
255 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_INFO */ | |
9f77da9f PM |
256 | |
257 | /* 2) batch handling */ | |
258 | /* | |
259 | * If nxtlist is not NULL, it is partitioned as follows. | |
260 | * Any of the partitions might be empty, in which case the | |
261 | * pointer to that partition will be equal to the pointer for | |
262 | * the following partition. When the list is empty, all of | |
1eba8f84 PM |
263 | * the nxttail elements point to the ->nxtlist pointer itself, |
264 | * which in that case is NULL. | |
9f77da9f | 265 | * |
9f77da9f PM |
266 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): |
267 | * Entries that batch # <= ->completed | |
268 | * The grace period for these entries has completed, and | |
269 | * the other grace-period-completed entries may be moved | |
270 | * here temporarily in rcu_process_callbacks(). | |
1eba8f84 PM |
271 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): |
272 | * Entries that batch # <= ->completed - 1: waiting for current GP | |
273 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | |
274 | * Entries known to have arrived before current GP ended | |
275 | * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]): | |
276 | * Entries that might have arrived after current GP ended | |
277 | * Note that the value of *nxttail[RCU_NEXT_TAIL] will | |
278 | * always be NULL, as this is the end of the list. | |
9f77da9f PM |
279 | */ |
280 | struct rcu_head *nxtlist; | |
281 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; | |
486e2593 PM |
282 | long qlen_lazy; /* # of lazy queued callbacks */ |
283 | long qlen; /* # of queued callbacks, incl lazy */ | |
37c72e56 PM |
284 | long qlen_last_fqs_check; |
285 | /* qlen at last check for QS forcing */ | |
269dcc1c | 286 | unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */ |
29494be7 LJ |
287 | unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */ |
288 | unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */ | |
37c72e56 PM |
289 | unsigned long n_force_qs_snap; |
290 | /* did other CPU force QS recently? */ | |
9f77da9f PM |
291 | long blimit; /* Upper limit on a processed batch */ |
292 | ||
9f77da9f PM |
293 | /* 3) dynticks interface. */ |
294 | struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */ | |
295 | int dynticks_snap; /* Per-GP tracking for dynticks. */ | |
9f77da9f PM |
296 | |
297 | /* 4) reasons this CPU needed to be kicked by force_quiescent_state */ | |
9f77da9f | 298 | unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */ |
9f77da9f | 299 | unsigned long offline_fqs; /* Kicked due to being offline. */ |
9f77da9f PM |
300 | |
301 | /* 5) __rcu_pending() statistics. */ | |
20133cfc PM |
302 | unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */ |
303 | unsigned long n_rp_qs_pending; | |
d21670ac | 304 | unsigned long n_rp_report_qs; |
20133cfc PM |
305 | unsigned long n_rp_cb_ready; |
306 | unsigned long n_rp_cpu_needs_gp; | |
307 | unsigned long n_rp_gp_completed; | |
308 | unsigned long n_rp_gp_started; | |
309 | unsigned long n_rp_need_fqs; | |
310 | unsigned long n_rp_need_nothing; | |
9f77da9f | 311 | |
06668efa PM |
312 | /* 6) _rcu_barrier() callback. */ |
313 | struct rcu_head barrier_head; | |
314 | ||
9f77da9f | 315 | int cpu; |
d4c08f2a | 316 | struct rcu_state *rsp; |
9f77da9f PM |
317 | }; |
318 | ||
af446b70 | 319 | /* Values for fqs_state field in struct rcu_state. */ |
83f5b01f PM |
320 | #define RCU_GP_IDLE 0 /* No grace period in progress. */ |
321 | #define RCU_GP_INIT 1 /* Grace period being initialized. */ | |
322 | #define RCU_SAVE_DYNTICK 2 /* Need to scan dyntick state. */ | |
ee47eb9f | 323 | #define RCU_FORCE_QS 3 /* Need to force quiescent state. */ |
9f77da9f | 324 | #define RCU_SIGNAL_INIT RCU_SAVE_DYNTICK |
9f77da9f PM |
325 | |
326 | #define RCU_JIFFIES_TILL_FORCE_QS 3 /* for rsp->jiffies_force_qs */ | |
007b0924 PM |
327 | |
328 | #ifdef CONFIG_PROVE_RCU | |
329 | #define RCU_STALL_DELAY_DELTA (5 * HZ) | |
330 | #else | |
331 | #define RCU_STALL_DELAY_DELTA 0 | |
332 | #endif | |
007b0924 PM |
333 | #define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time */ |
334 | /* to take at least one */ | |
335 | /* scheduling clock irq */ | |
336 | /* before ratting on them. */ | |
9f77da9f | 337 | |
08bca60a PZ |
338 | #define rcu_wait(cond) \ |
339 | do { \ | |
340 | for (;;) { \ | |
341 | set_current_state(TASK_INTERRUPTIBLE); \ | |
342 | if (cond) \ | |
343 | break; \ | |
344 | schedule(); \ | |
345 | } \ | |
346 | __set_current_state(TASK_RUNNING); \ | |
347 | } while (0) | |
9f77da9f PM |
348 | |
349 | /* | |
350 | * RCU global state, including node hierarchy. This hierarchy is | |
351 | * represented in "heap" form in a dense array. The root (first level) | |
352 | * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second | |
353 | * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]), | |
354 | * and the third level in ->node[m+1] and following (->node[m+1] referenced | |
355 | * by ->level[2]). The number of levels is determined by the number of | |
356 | * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy" | |
357 | * consisting of a single rcu_node. | |
358 | */ | |
359 | struct rcu_state { | |
360 | struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */ | |
f885b7f2 | 361 | struct rcu_node *level[RCU_NUM_LVLS]; /* Hierarchy levels. */ |
9f77da9f | 362 | u32 levelcnt[MAX_RCU_LVLS + 1]; /* # nodes in each level. */ |
f885b7f2 | 363 | u8 levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */ |
394f99a9 | 364 | struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */ |
037b64ed PM |
365 | void (*call)(struct rcu_head *head, /* call_rcu() flavor. */ |
366 | void (*func)(struct rcu_head *head)); | |
9f77da9f PM |
367 | |
368 | /* The following fields are guarded by the root rcu_node's lock. */ | |
369 | ||
af446b70 | 370 | u8 fqs_state ____cacheline_internodealigned_in_smp; |
9f77da9f | 371 | /* Force QS state. */ |
07079d53 PM |
372 | u8 fqs_active; /* force_quiescent_state() */ |
373 | /* is running. */ | |
46a1e34e PM |
374 | u8 fqs_need_gp; /* A CPU was prevented from */ |
375 | /* starting a new grace */ | |
376 | /* period because */ | |
377 | /* force_quiescent_state() */ | |
378 | /* was running. */ | |
a46e0899 | 379 | u8 boost; /* Subject to priority boost. */ |
20133cfc PM |
380 | unsigned long gpnum; /* Current gp number. */ |
381 | unsigned long completed; /* # of last completed gp. */ | |
1eba8f84 | 382 | |
d9a3da06 | 383 | /* End of fields guarded by root rcu_node's lock. */ |
1eba8f84 | 384 | |
1304afb2 | 385 | raw_spinlock_t onofflock; /* exclude on/offline and */ |
29494be7 | 386 | /* starting new GP. */ |
b1420f1c PM |
387 | struct rcu_head *orphan_nxtlist; /* Orphaned callbacks that */ |
388 | /* need a grace period. */ | |
389 | struct rcu_head **orphan_nxttail; /* Tail of above. */ | |
390 | struct rcu_head *orphan_donelist; /* Orphaned callbacks that */ | |
391 | /* are ready to invoke. */ | |
392 | struct rcu_head **orphan_donetail; /* Tail of above. */ | |
393 | long qlen_lazy; /* Number of lazy callbacks. */ | |
394 | long qlen; /* Total number of callbacks. */ | |
395 | struct task_struct *rcu_barrier_in_progress; | |
396 | /* Task doing rcu_barrier(), */ | |
397 | /* or NULL if no barrier. */ | |
7be7f0be | 398 | struct mutex barrier_mutex; /* Guards barrier fields. */ |
24ebbca8 | 399 | atomic_t barrier_cpu_count; /* # CPUs waiting on. */ |
7db74df8 | 400 | struct completion barrier_completion; /* Wake at barrier end. */ |
cf3a9c48 PM |
401 | unsigned long n_barrier_done; /* ++ at start and end of */ |
402 | /* _rcu_barrier(). */ | |
1304afb2 | 403 | raw_spinlock_t fqslock; /* Only one task forcing */ |
9f77da9f PM |
404 | /* quiescent states. */ |
405 | unsigned long jiffies_force_qs; /* Time at which to invoke */ | |
406 | /* force_quiescent_state(). */ | |
407 | unsigned long n_force_qs; /* Number of calls to */ | |
408 | /* force_quiescent_state(). */ | |
409 | unsigned long n_force_qs_lh; /* ~Number of calls leaving */ | |
410 | /* due to lock unavailable. */ | |
411 | unsigned long n_force_qs_ngp; /* Number of calls leaving */ | |
412 | /* due to no GP active. */ | |
9f77da9f PM |
413 | unsigned long gp_start; /* Time at which GP started, */ |
414 | /* but in jiffies. */ | |
415 | unsigned long jiffies_stall; /* Time at which to check */ | |
416 | /* for CPU stalls. */ | |
15ba0ba8 PM |
417 | unsigned long gp_max; /* Maximum GP duration in */ |
418 | /* jiffies. */ | |
4300aa64 | 419 | char *name; /* Name of structure. */ |
6ce75a23 | 420 | struct list_head flavors; /* List of RCU flavors. */ |
9f77da9f PM |
421 | }; |
422 | ||
6ce75a23 PM |
423 | extern struct list_head rcu_struct_flavors; |
424 | #define for_each_rcu_flavor(rsp) \ | |
425 | list_for_each_entry((rsp), &rcu_struct_flavors, flavors) | |
426 | ||
d9a3da06 PM |
427 | /* Return values for rcu_preempt_offline_tasks(). */ |
428 | ||
429 | #define RCU_OFL_TASKS_NORM_GP 0x1 /* Tasks blocking normal */ | |
430 | /* GP were moved to root. */ | |
431 | #define RCU_OFL_TASKS_EXP_GP 0x2 /* Tasks blocking expedited */ | |
432 | /* GP were moved to root. */ | |
433 | ||
6258c4fb IM |
434 | /* |
435 | * RCU implementation internal declarations: | |
436 | */ | |
d6714c22 PM |
437 | extern struct rcu_state rcu_sched_state; |
438 | DECLARE_PER_CPU(struct rcu_data, rcu_sched_data); | |
6258c4fb IM |
439 | |
440 | extern struct rcu_state rcu_bh_state; | |
441 | DECLARE_PER_CPU(struct rcu_data, rcu_bh_data); | |
442 | ||
f41d911f PM |
443 | #ifdef CONFIG_TREE_PREEMPT_RCU |
444 | extern struct rcu_state rcu_preempt_state; | |
445 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); | |
446 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | |
447 | ||
eab0993c PM |
448 | #ifdef CONFIG_RCU_BOOST |
449 | DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status); | |
450 | DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu); | |
451 | DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops); | |
452 | DECLARE_PER_CPU(char, rcu_cpu_has_work); | |
453 | #endif /* #ifdef CONFIG_RCU_BOOST */ | |
454 | ||
017c4261 | 455 | #ifndef RCU_TREE_NONCORE |
9f77da9f | 456 | |
9b2619af | 457 | /* Forward declarations for rcutree_plugin.h */ |
dbe01350 | 458 | static void rcu_bootup_announce(void); |
9b2619af | 459 | long rcu_batches_completed(void); |
cba6d0d6 | 460 | static void rcu_preempt_note_context_switch(int cpu); |
27f4d280 | 461 | static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp); |
b668c9cf | 462 | #ifdef CONFIG_HOTPLUG_CPU |
d3f6bad3 PM |
463 | static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, |
464 | unsigned long flags); | |
b668c9cf | 465 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ |
1ed509a2 | 466 | static void rcu_print_detail_task_stall(struct rcu_state *rsp); |
9bc8b558 | 467 | static int rcu_print_task_stall(struct rcu_node *rnp); |
9b2619af PM |
468 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); |
469 | #ifdef CONFIG_HOTPLUG_CPU | |
237c80c5 PM |
470 | static int rcu_preempt_offline_tasks(struct rcu_state *rsp, |
471 | struct rcu_node *rnp, | |
472 | struct rcu_data *rdp); | |
9b2619af PM |
473 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ |
474 | static void rcu_preempt_check_callbacks(int cpu); | |
9b2619af | 475 | void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu)); |
d9a3da06 | 476 | #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU) |
b40d293e TG |
477 | static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp, |
478 | bool wake); | |
d9a3da06 | 479 | #endif /* #if defined(CONFIG_HOTPLUG_CPU) || defined(CONFIG_TREE_PREEMPT_RCU) */ |
9b2619af | 480 | static void __init __rcu_init_preempt(void); |
1217ed1b | 481 | static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags); |
a46e0899 PM |
482 | static void rcu_preempt_boost_start_gp(struct rcu_node *rnp); |
483 | static void invoke_rcu_callbacks_kthread(void); | |
dff1672d | 484 | static bool rcu_is_callbacks_kthread(void); |
a46e0899 PM |
485 | #ifdef CONFIG_RCU_BOOST |
486 | static void rcu_preempt_do_callbacks(void); | |
27f4d280 | 487 | static int __cpuinit rcu_spawn_one_boost_kthread(struct rcu_state *rsp, |
5d01bbd1 | 488 | struct rcu_node *rnp); |
a46e0899 | 489 | #endif /* #ifdef CONFIG_RCU_BOOST */ |
f8b7fc6b | 490 | static void __cpuinit rcu_prepare_kthreads(int cpu); |
7cb92499 PM |
491 | static void rcu_prepare_for_idle_init(int cpu); |
492 | static void rcu_cleanup_after_idle(int cpu); | |
aea1b35e | 493 | static void rcu_prepare_for_idle(int cpu); |
c57afe80 | 494 | static void rcu_idle_count_callbacks_posted(void); |
a858af28 PM |
495 | static void print_cpu_stall_info_begin(void); |
496 | static void print_cpu_stall_info(struct rcu_state *rsp, int cpu); | |
497 | static void print_cpu_stall_info_end(void); | |
498 | static void zero_cpu_stall_ticks(struct rcu_data *rdp); | |
499 | static void increment_cpu_stall_ticks(void); | |
9b2619af | 500 | |
017c4261 | 501 | #endif /* #ifndef RCU_TREE_NONCORE */ |