]>
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 | |
87de1cfd PM |
16 | * along with this program; if not, you can access it online at |
17 | * http://www.gnu.org/licenses/gpl-2.0.html. | |
9f77da9f PM |
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> | |
abedf8e2 | 30 | #include <linux/swait.h> |
3a6d7c64 | 31 | #include <linux/stop_machine.h> |
9f77da9f PM |
32 | |
33 | /* | |
8932a63d PM |
34 | * Define shape of hierarchy based on NR_CPUS, CONFIG_RCU_FANOUT, and |
35 | * CONFIG_RCU_FANOUT_LEAF. | |
9f77da9f | 36 | * In theory, it should be possible to add more levels straightforwardly. |
0209f649 PM |
37 | * In practice, this did work well going from three levels to four. |
38 | * Of course, your mileage may vary. | |
9f77da9f | 39 | */ |
05c5df31 | 40 | |
05c5df31 PM |
41 | #ifdef CONFIG_RCU_FANOUT |
42 | #define RCU_FANOUT CONFIG_RCU_FANOUT | |
43 | #else /* #ifdef CONFIG_RCU_FANOUT */ | |
44 | # ifdef CONFIG_64BIT | |
45 | # define RCU_FANOUT 64 | |
46 | # else | |
47 | # define RCU_FANOUT 32 | |
48 | # endif | |
49 | #endif /* #else #ifdef CONFIG_RCU_FANOUT */ | |
50 | ||
47d631af PM |
51 | #ifdef CONFIG_RCU_FANOUT_LEAF |
52 | #define RCU_FANOUT_LEAF CONFIG_RCU_FANOUT_LEAF | |
53 | #else /* #ifdef CONFIG_RCU_FANOUT_LEAF */ | |
54 | # ifdef CONFIG_64BIT | |
55 | # define RCU_FANOUT_LEAF 64 | |
56 | # else | |
57 | # define RCU_FANOUT_LEAF 32 | |
58 | # endif | |
59 | #endif /* #else #ifdef CONFIG_RCU_FANOUT_LEAF */ | |
60 | ||
61 | #define RCU_FANOUT_1 (RCU_FANOUT_LEAF) | |
05c5df31 PM |
62 | #define RCU_FANOUT_2 (RCU_FANOUT_1 * RCU_FANOUT) |
63 | #define RCU_FANOUT_3 (RCU_FANOUT_2 * RCU_FANOUT) | |
64 | #define RCU_FANOUT_4 (RCU_FANOUT_3 * RCU_FANOUT) | |
9f77da9f | 65 | |
0209f649 | 66 | #if NR_CPUS <= RCU_FANOUT_1 |
f885b7f2 | 67 | # define RCU_NUM_LVLS 1 |
9f77da9f | 68 | # define NUM_RCU_LVL_0 1 |
42621697 | 69 | # define NUM_RCU_NODES NUM_RCU_LVL_0 |
cb007102 AG |
70 | # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0 } |
71 | # define RCU_NODE_NAME_INIT { "rcu_node_0" } | |
72 | # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0" } | |
0209f649 | 73 | #elif NR_CPUS <= RCU_FANOUT_2 |
f885b7f2 | 74 | # define RCU_NUM_LVLS 2 |
9f77da9f | 75 | # define NUM_RCU_LVL_0 1 |
0209f649 | 76 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) |
42621697 | 77 | # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1) |
cb007102 AG |
78 | # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1 } |
79 | # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1" } | |
80 | # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1" } | |
0209f649 | 81 | #elif NR_CPUS <= RCU_FANOUT_3 |
f885b7f2 | 82 | # define RCU_NUM_LVLS 3 |
9f77da9f | 83 | # define NUM_RCU_LVL_0 1 |
0209f649 PM |
84 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2) |
85 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) | |
42621697 | 86 | # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2) |
cb007102 AG |
87 | # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1, NUM_RCU_LVL_2 } |
88 | # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1", "rcu_node_2" } | |
89 | # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1", "rcu_node_fqs_2" } | |
0209f649 | 90 | #elif NR_CPUS <= RCU_FANOUT_4 |
f885b7f2 | 91 | # define RCU_NUM_LVLS 4 |
cf244dc0 | 92 | # define NUM_RCU_LVL_0 1 |
0209f649 PM |
93 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_3) |
94 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_2) | |
95 | # define NUM_RCU_LVL_3 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_1) | |
42621697 | 96 | # define NUM_RCU_NODES (NUM_RCU_LVL_0 + NUM_RCU_LVL_1 + NUM_RCU_LVL_2 + NUM_RCU_LVL_3) |
cb007102 AG |
97 | # define NUM_RCU_LVL_INIT { NUM_RCU_LVL_0, NUM_RCU_LVL_1, NUM_RCU_LVL_2, NUM_RCU_LVL_3 } |
98 | # define RCU_NODE_NAME_INIT { "rcu_node_0", "rcu_node_1", "rcu_node_2", "rcu_node_3" } | |
99 | # define RCU_FQS_NAME_INIT { "rcu_node_fqs_0", "rcu_node_fqs_1", "rcu_node_fqs_2", "rcu_node_fqs_3" } | |
9f77da9f PM |
100 | #else |
101 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" | |
0209f649 | 102 | #endif /* #if (NR_CPUS) <= RCU_FANOUT_1 */ |
9f77da9f | 103 | |
f885b7f2 PM |
104 | extern int rcu_num_lvls; |
105 | extern int rcu_num_nodes; | |
106 | ||
9f77da9f PM |
107 | /* |
108 | * Dynticks per-CPU state. | |
109 | */ | |
110 | struct rcu_dynticks { | |
9b2e4f18 PM |
111 | long long dynticks_nesting; /* Track irq/process nesting level. */ |
112 | /* Process level is worth LLONG_MAX/2. */ | |
113 | int dynticks_nmi_nesting; /* Track NMI nesting level. */ | |
114 | atomic_t dynticks; /* Even value for idle, else odd. */ | |
2333210b PM |
115 | #ifdef CONFIG_NO_HZ_FULL_SYSIDLE |
116 | long long dynticks_idle_nesting; | |
117 | /* irq/process nesting level from idle. */ | |
118 | atomic_t dynticks_idle; /* Even value for idle, else odd. */ | |
119 | /* "Idle" excludes userspace execution. */ | |
120 | unsigned long dynticks_idle_jiffies; | |
121 | /* End of last non-NMI non-idle period. */ | |
122 | #endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */ | |
5955f7ee | 123 | #ifdef CONFIG_RCU_FAST_NO_HZ |
c0f4dfd4 | 124 | bool all_lazy; /* Are all CPU's CBs lazy? */ |
5955f7ee PM |
125 | unsigned long nonlazy_posted; |
126 | /* # times non-lazy CBs posted to CPU. */ | |
127 | unsigned long nonlazy_posted_snap; | |
128 | /* idle-period nonlazy_posted snapshot. */ | |
c0f4dfd4 PM |
129 | unsigned long last_accelerate; |
130 | /* Last jiffy CBs were accelerated. */ | |
c229828c PM |
131 | unsigned long last_advance_all; |
132 | /* Last jiffy CBs were all advanced. */ | |
9d2ad243 | 133 | int tick_nohz_enabled_snap; /* Previously seen value from sysfs. */ |
5955f7ee | 134 | #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */ |
9f77da9f PM |
135 | }; |
136 | ||
d71df90e PM |
137 | /* RCU's kthread states for tracing. */ |
138 | #define RCU_KTHREAD_STOPPED 0 | |
139 | #define RCU_KTHREAD_RUNNING 1 | |
140 | #define RCU_KTHREAD_WAITING 2 | |
15ba0ba8 PM |
141 | #define RCU_KTHREAD_OFFCPU 3 |
142 | #define RCU_KTHREAD_YIELDING 4 | |
143 | #define RCU_KTHREAD_MAX 4 | |
d71df90e | 144 | |
9f77da9f PM |
145 | /* |
146 | * Definition for node within the RCU grace-period-detection hierarchy. | |
147 | */ | |
148 | struct rcu_node { | |
67c583a7 BF |
149 | raw_spinlock_t __private lock; /* Root rcu_node's lock protects */ |
150 | /* some rcu_state fields as well as */ | |
151 | /* following. */ | |
20133cfc | 152 | unsigned long gpnum; /* Current grace period for this node. */ |
86848966 PM |
153 | /* This will either be equal to or one */ |
154 | /* behind the root rcu_node's gpnum. */ | |
20133cfc | 155 | unsigned long completed; /* Last GP completed for this node. */ |
d09b62df PM |
156 | /* This will either be equal to or one */ |
157 | /* behind the root rcu_node's gpnum. */ | |
9f77da9f PM |
158 | unsigned long qsmask; /* CPUs or groups that need to switch in */ |
159 | /* order for current grace period to proceed.*/ | |
1eba8f84 PM |
160 | /* In leaf rcu_node, each bit corresponds to */ |
161 | /* an rcu_data structure, otherwise, each */ | |
162 | /* bit corresponds to a child rcu_node */ | |
163 | /* structure. */ | |
9f77da9f | 164 | unsigned long qsmaskinit; |
b9585e94 | 165 | /* Per-GP initial value for qsmask. */ |
0aa04b05 PM |
166 | /* Initialized from ->qsmaskinitnext at the */ |
167 | /* beginning of each grace period. */ | |
168 | unsigned long qsmaskinitnext; | |
169 | /* Online CPUs for next grace period. */ | |
b9585e94 PM |
170 | unsigned long expmask; /* CPUs or groups that need to check in */ |
171 | /* to allow the current expedited GP */ | |
172 | /* to complete. */ | |
173 | unsigned long expmaskinit; | |
174 | /* Per-GP initial values for expmask. */ | |
175 | /* Initialized from ->expmaskinitnext at the */ | |
176 | /* beginning of each expedited GP. */ | |
177 | unsigned long expmaskinitnext; | |
178 | /* Online CPUs for next expedited GP. */ | |
1de6e56d PM |
179 | /* Any CPU that has ever been online will */ |
180 | /* have its bit set. */ | |
9f77da9f | 181 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ |
1eba8f84 | 182 | /* Only one bit will be set in this mask. */ |
9f77da9f PM |
183 | int grplo; /* lowest-numbered CPU or group here. */ |
184 | int grphi; /* highest-numbered CPU or group here. */ | |
185 | u8 grpnum; /* CPU/group number for next level up. */ | |
186 | u8 level; /* root is at level 0. */ | |
0aa04b05 PM |
187 | bool wait_blkd_tasks;/* Necessary to wait for blocked tasks to */ |
188 | /* exit RCU read-side critical sections */ | |
189 | /* before propagating offline up the */ | |
190 | /* rcu_node tree? */ | |
9f77da9f | 191 | struct rcu_node *parent; |
12f5f524 PM |
192 | struct list_head blkd_tasks; |
193 | /* Tasks blocked in RCU read-side critical */ | |
194 | /* section. Tasks are placed at the head */ | |
195 | /* of this list and age towards the tail. */ | |
196 | struct list_head *gp_tasks; | |
197 | /* Pointer to the first task blocking the */ | |
198 | /* current grace period, or NULL if there */ | |
199 | /* is no such task. */ | |
200 | struct list_head *exp_tasks; | |
201 | /* Pointer to the first task blocking the */ | |
202 | /* current expedited grace period, or NULL */ | |
203 | /* if there is no such task. If there */ | |
204 | /* is no current expedited grace period, */ | |
205 | /* then there can cannot be any such task. */ | |
27f4d280 PM |
206 | struct list_head *boost_tasks; |
207 | /* Pointer to first task that needs to be */ | |
208 | /* priority boosted, or NULL if no priority */ | |
209 | /* boosting is needed for this rcu_node */ | |
210 | /* structure. If there are no tasks */ | |
211 | /* queued on this rcu_node structure that */ | |
212 | /* are blocking the current grace period, */ | |
213 | /* there can be no such task. */ | |
abaa93d9 PM |
214 | struct rt_mutex boost_mtx; |
215 | /* Used only for the priority-boosting */ | |
216 | /* side effect, not as a lock. */ | |
27f4d280 PM |
217 | unsigned long boost_time; |
218 | /* When to start boosting (jiffies). */ | |
219 | struct task_struct *boost_kthread_task; | |
220 | /* kthread that takes care of priority */ | |
221 | /* boosting for this rcu_node structure. */ | |
d71df90e PM |
222 | unsigned int boost_kthread_status; |
223 | /* State of boost_kthread_task for tracing. */ | |
0ea1f2eb PM |
224 | unsigned long n_tasks_boosted; |
225 | /* Total number of tasks boosted. */ | |
226 | unsigned long n_exp_boosts; | |
227 | /* Number of tasks boosted for expedited GP. */ | |
228 | unsigned long n_normal_boosts; | |
229 | /* Number of tasks boosted for normal GP. */ | |
230 | unsigned long n_balk_blkd_tasks; | |
231 | /* Refused to boost: no blocked tasks. */ | |
232 | unsigned long n_balk_exp_gp_tasks; | |
233 | /* Refused to boost: nothing blocking GP. */ | |
234 | unsigned long n_balk_boost_tasks; | |
235 | /* Refused to boost: already boosting. */ | |
236 | unsigned long n_balk_notblocked; | |
237 | /* Refused to boost: RCU RS CS still running. */ | |
238 | unsigned long n_balk_notyet; | |
239 | /* Refused to boost: not yet time. */ | |
240 | unsigned long n_balk_nos; | |
241 | /* Refused to boost: not sure why, though. */ | |
242 | /* This can happen due to race conditions. */ | |
dae6e64d | 243 | #ifdef CONFIG_RCU_NOCB_CPU |
abedf8e2 | 244 | struct swait_queue_head nocb_gp_wq[2]; |
dae6e64d | 245 | /* Place for rcu_nocb_kthread() to wait GP. */ |
dae6e64d | 246 | #endif /* #ifdef CONFIG_RCU_NOCB_CPU */ |
8b425aa8 PM |
247 | int need_future_gp[2]; |
248 | /* Counts of upcoming no-CB GP requests. */ | |
394f2769 | 249 | raw_spinlock_t fqslock ____cacheline_internodealigned_in_smp; |
385b73c0 | 250 | |
f6a12f34 PM |
251 | spinlock_t exp_lock ____cacheline_internodealigned_in_smp; |
252 | unsigned long exp_seq_rq; | |
3b5f668e | 253 | wait_queue_head_t exp_wq[4]; |
9f77da9f PM |
254 | } ____cacheline_internodealigned_in_smp; |
255 | ||
bc75e999 MR |
256 | /* |
257 | * Bitmasks in an rcu_node cover the interval [grplo, grphi] of CPU IDs, and | |
258 | * are indexed relative to this interval rather than the global CPU ID space. | |
259 | * This generates the bit for a CPU in node-local masks. | |
260 | */ | |
261 | #define leaf_node_cpu_bit(rnp, cpu) (1UL << ((cpu) - (rnp)->grplo)) | |
262 | ||
a0b6c9a7 PM |
263 | /* |
264 | * Do a full breadth-first scan of the rcu_node structures for the | |
265 | * specified rcu_state structure. | |
266 | */ | |
267 | #define rcu_for_each_node_breadth_first(rsp, rnp) \ | |
268 | for ((rnp) = &(rsp)->node[0]; \ | |
f885b7f2 | 269 | (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++) |
a0b6c9a7 | 270 | |
d9a3da06 PM |
271 | /* |
272 | * Do a breadth-first scan of the non-leaf rcu_node structures for the | |
273 | * specified rcu_state structure. Note that if there is a singleton | |
274 | * rcu_node tree with but one rcu_node structure, this loop is a no-op. | |
275 | */ | |
276 | #define rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) \ | |
277 | for ((rnp) = &(rsp)->node[0]; \ | |
f885b7f2 | 278 | (rnp) < (rsp)->level[rcu_num_lvls - 1]; (rnp)++) |
d9a3da06 PM |
279 | |
280 | /* | |
281 | * Scan the leaves of the rcu_node hierarchy for the specified rcu_state | |
282 | * structure. Note that if there is a singleton rcu_node tree with but | |
283 | * one rcu_node structure, this loop -will- visit the rcu_node structure. | |
284 | * It is still a leaf node, even if it is also the root node. | |
285 | */ | |
a0b6c9a7 | 286 | #define rcu_for_each_leaf_node(rsp, rnp) \ |
f885b7f2 PM |
287 | for ((rnp) = (rsp)->level[rcu_num_lvls - 1]; \ |
288 | (rnp) < &(rsp)->node[rcu_num_nodes]; (rnp)++) | |
a0b6c9a7 | 289 | |
bc75e999 MR |
290 | /* |
291 | * Iterate over all possible CPUs in a leaf RCU node. | |
292 | */ | |
293 | #define for_each_leaf_node_possible_cpu(rnp, cpu) \ | |
294 | for ((cpu) = cpumask_next(rnp->grplo - 1, cpu_possible_mask); \ | |
295 | cpu <= rnp->grphi; \ | |
296 | cpu = cpumask_next((cpu), cpu_possible_mask)) | |
297 | ||
5b74c458 PM |
298 | /* |
299 | * Union to allow "aggregate OR" operation on the need for a quiescent | |
300 | * state by the normal and expedited grace periods. | |
301 | */ | |
302 | union rcu_noqs { | |
303 | struct { | |
304 | u8 norm; | |
305 | u8 exp; | |
306 | } b; /* Bits. */ | |
307 | u16 s; /* Set of bits, aggregate OR here. */ | |
308 | }; | |
309 | ||
9f77da9f PM |
310 | /* Index values for nxttail array in struct rcu_data. */ |
311 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ | |
312 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ | |
313 | #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */ | |
314 | #define RCU_NEXT_TAIL 3 | |
315 | #define RCU_NEXT_SIZE 4 | |
316 | ||
317 | /* Per-CPU data for read-copy update. */ | |
318 | struct rcu_data { | |
319 | /* 1) quiescent-state and grace-period handling : */ | |
20133cfc | 320 | unsigned long completed; /* Track rsp->completed gp number */ |
9f77da9f | 321 | /* in order to detect GP end. */ |
20133cfc | 322 | unsigned long gpnum; /* Highest gp number that this CPU */ |
9f77da9f | 323 | /* is aware of having started. */ |
5cd37193 PM |
324 | unsigned long rcu_qs_ctr_snap;/* Snapshot of rcu_qs_ctr to check */ |
325 | /* for rcu_all_qs() invocations. */ | |
5b74c458 | 326 | union rcu_noqs cpu_no_qs; /* No QSes yet for this CPU. */ |
97c668b8 | 327 | bool core_needs_qs; /* Core waits for quiesc state. */ |
9f77da9f | 328 | bool beenonline; /* CPU online at least once. */ |
e3663b10 | 329 | bool gpwrap; /* Possible gpnum/completed wrap. */ |
9f77da9f PM |
330 | struct rcu_node *mynode; /* This CPU's leaf of hierarchy */ |
331 | unsigned long grpmask; /* Mask to apply to leaf qsmask. */ | |
a858af28 PM |
332 | unsigned long ticks_this_gp; /* The number of scheduling-clock */ |
333 | /* ticks this CPU has handled */ | |
334 | /* during and after the last grace */ | |
335 | /* period it is aware of. */ | |
9f77da9f PM |
336 | |
337 | /* 2) batch handling */ | |
338 | /* | |
339 | * If nxtlist is not NULL, it is partitioned as follows. | |
340 | * Any of the partitions might be empty, in which case the | |
341 | * pointer to that partition will be equal to the pointer for | |
342 | * the following partition. When the list is empty, all of | |
1eba8f84 PM |
343 | * the nxttail elements point to the ->nxtlist pointer itself, |
344 | * which in that case is NULL. | |
9f77da9f | 345 | * |
9f77da9f PM |
346 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): |
347 | * Entries that batch # <= ->completed | |
348 | * The grace period for these entries has completed, and | |
349 | * the other grace-period-completed entries may be moved | |
350 | * here temporarily in rcu_process_callbacks(). | |
1eba8f84 PM |
351 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): |
352 | * Entries that batch # <= ->completed - 1: waiting for current GP | |
353 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | |
354 | * Entries known to have arrived before current GP ended | |
355 | * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]): | |
356 | * Entries that might have arrived after current GP ended | |
357 | * Note that the value of *nxttail[RCU_NEXT_TAIL] will | |
358 | * always be NULL, as this is the end of the list. | |
9f77da9f PM |
359 | */ |
360 | struct rcu_head *nxtlist; | |
361 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; | |
dc35c893 PM |
362 | unsigned long nxtcompleted[RCU_NEXT_SIZE]; |
363 | /* grace periods for sublists. */ | |
486e2593 PM |
364 | long qlen_lazy; /* # of lazy queued callbacks */ |
365 | long qlen; /* # of queued callbacks, incl lazy */ | |
37c72e56 PM |
366 | long qlen_last_fqs_check; |
367 | /* qlen at last check for QS forcing */ | |
269dcc1c | 368 | unsigned long n_cbs_invoked; /* count of RCU cbs invoked. */ |
c635a4e1 | 369 | unsigned long n_nocbs_invoked; /* count of no-CBs RCU cbs invoked. */ |
29494be7 LJ |
370 | unsigned long n_cbs_orphaned; /* RCU cbs orphaned by dying CPU */ |
371 | unsigned long n_cbs_adopted; /* RCU cbs adopted from dying CPU */ | |
37c72e56 PM |
372 | unsigned long n_force_qs_snap; |
373 | /* did other CPU force QS recently? */ | |
9f77da9f PM |
374 | long blimit; /* Upper limit on a processed batch */ |
375 | ||
9f77da9f PM |
376 | /* 3) dynticks interface. */ |
377 | struct rcu_dynticks *dynticks; /* Shared per-CPU dynticks state. */ | |
378 | int dynticks_snap; /* Per-GP tracking for dynticks. */ | |
9f77da9f PM |
379 | |
380 | /* 4) reasons this CPU needed to be kicked by force_quiescent_state */ | |
9f77da9f | 381 | unsigned long dynticks_fqs; /* Kicked due to dynticks idle. */ |
9f77da9f | 382 | unsigned long offline_fqs; /* Kicked due to being offline. */ |
4a81e832 PM |
383 | unsigned long cond_resched_completed; |
384 | /* Grace period that needs help */ | |
385 | /* from cond_resched(). */ | |
9f77da9f PM |
386 | |
387 | /* 5) __rcu_pending() statistics. */ | |
20133cfc | 388 | unsigned long n_rcu_pending; /* rcu_pending() calls since boot. */ |
97c668b8 | 389 | unsigned long n_rp_core_needs_qs; |
d21670ac | 390 | unsigned long n_rp_report_qs; |
20133cfc PM |
391 | unsigned long n_rp_cb_ready; |
392 | unsigned long n_rp_cpu_needs_gp; | |
393 | unsigned long n_rp_gp_completed; | |
394 | unsigned long n_rp_gp_started; | |
96d3fd0d | 395 | unsigned long n_rp_nocb_defer_wakeup; |
20133cfc | 396 | unsigned long n_rp_need_nothing; |
9f77da9f | 397 | |
2cd6ffaf | 398 | /* 6) _rcu_barrier(), OOM callbacks, and expediting. */ |
06668efa | 399 | struct rcu_head barrier_head; |
b626c1b6 PM |
400 | #ifdef CONFIG_RCU_FAST_NO_HZ |
401 | struct rcu_head oom_head; | |
402 | #endif /* #ifdef CONFIG_RCU_FAST_NO_HZ */ | |
8b355e3b | 403 | atomic_long_t exp_workdone0; /* # done by workqueue. */ |
d40a4f09 PM |
404 | atomic_long_t exp_workdone1; /* # done by others #1. */ |
405 | atomic_long_t exp_workdone2; /* # done by others #2. */ | |
406 | atomic_long_t exp_workdone3; /* # done by others #3. */ | |
0742ac3e | 407 | int exp_dynticks_snap; /* Double-check need for IPI. */ |
06668efa | 408 | |
3fbfbf7a PM |
409 | /* 7) Callback offloading. */ |
410 | #ifdef CONFIG_RCU_NOCB_CPU | |
411 | struct rcu_head *nocb_head; /* CBs waiting for kthread. */ | |
412 | struct rcu_head **nocb_tail; | |
41050a00 PM |
413 | atomic_long_t nocb_q_count; /* # CBs waiting for nocb */ |
414 | atomic_long_t nocb_q_count_lazy; /* invocation (all stages). */ | |
fbce7497 PM |
415 | struct rcu_head *nocb_follower_head; /* CBs ready to invoke. */ |
416 | struct rcu_head **nocb_follower_tail; | |
abedf8e2 | 417 | struct swait_queue_head nocb_wq; /* For nocb kthreads to sleep on. */ |
3fbfbf7a | 418 | struct task_struct *nocb_kthread; |
9fdd3bc9 | 419 | int nocb_defer_wakeup; /* Defer wakeup of nocb_kthread. */ |
fbce7497 PM |
420 | |
421 | /* The following fields are used by the leader, hence own cacheline. */ | |
422 | struct rcu_head *nocb_gp_head ____cacheline_internodealigned_in_smp; | |
423 | /* CBs waiting for GP. */ | |
424 | struct rcu_head **nocb_gp_tail; | |
11ed7f93 | 425 | bool nocb_leader_sleep; /* Is the nocb leader thread asleep? */ |
fbce7497 PM |
426 | struct rcu_data *nocb_next_follower; |
427 | /* Next follower in wakeup chain. */ | |
428 | ||
429 | /* The following fields are used by the follower, hence new cachline. */ | |
430 | struct rcu_data *nocb_leader ____cacheline_internodealigned_in_smp; | |
431 | /* Leader CPU takes GP-end wakeups. */ | |
3fbfbf7a PM |
432 | #endif /* #ifdef CONFIG_RCU_NOCB_CPU */ |
433 | ||
6231069b | 434 | /* 8) RCU CPU stall data. */ |
6231069b | 435 | unsigned int softirq_snap; /* Snapshot of softirq activity. */ |
6231069b | 436 | |
9f77da9f | 437 | int cpu; |
d4c08f2a | 438 | struct rcu_state *rsp; |
9f77da9f PM |
439 | }; |
440 | ||
9fdd3bc9 PM |
441 | /* Values for nocb_defer_wakeup field in struct rcu_data. */ |
442 | #define RCU_NOGP_WAKE_NOT 0 | |
443 | #define RCU_NOGP_WAKE 1 | |
444 | #define RCU_NOGP_WAKE_FORCE 2 | |
445 | ||
026ad283 PM |
446 | #define RCU_JIFFIES_TILL_FORCE_QS (1 + (HZ > 250) + (HZ > 500)) |
447 | /* For jiffies_till_first_fqs and */ | |
448 | /* and jiffies_till_next_fqs. */ | |
007b0924 | 449 | |
026ad283 PM |
450 | #define RCU_JIFFIES_FQS_DIV 256 /* Very large systems need more */ |
451 | /* delay between bouts of */ | |
452 | /* quiescent-state forcing. */ | |
453 | ||
454 | #define RCU_STALL_RAT_DELAY 2 /* Allow other CPUs time to take */ | |
455 | /* at least one scheduling clock */ | |
456 | /* irq before ratting on them. */ | |
9f77da9f | 457 | |
08bca60a PZ |
458 | #define rcu_wait(cond) \ |
459 | do { \ | |
460 | for (;;) { \ | |
461 | set_current_state(TASK_INTERRUPTIBLE); \ | |
462 | if (cond) \ | |
463 | break; \ | |
464 | schedule(); \ | |
465 | } \ | |
466 | __set_current_state(TASK_RUNNING); \ | |
467 | } while (0) | |
9f77da9f PM |
468 | |
469 | /* | |
470 | * RCU global state, including node hierarchy. This hierarchy is | |
471 | * represented in "heap" form in a dense array. The root (first level) | |
472 | * of the hierarchy is in ->node[0] (referenced by ->level[0]), the second | |
473 | * level in ->node[1] through ->node[m] (->node[1] referenced by ->level[1]), | |
474 | * and the third level in ->node[m+1] and following (->node[m+1] referenced | |
475 | * by ->level[2]). The number of levels is determined by the number of | |
476 | * CPUs and by CONFIG_RCU_FANOUT. Small systems will have a "hierarchy" | |
477 | * consisting of a single rcu_node. | |
478 | */ | |
479 | struct rcu_state { | |
480 | struct rcu_node node[NUM_RCU_NODES]; /* Hierarchy. */ | |
032dfc87 AG |
481 | struct rcu_node *level[RCU_NUM_LVLS + 1]; |
482 | /* Hierarchy levels (+1 to */ | |
483 | /* shut bogus gcc warning) */ | |
4a81e832 | 484 | u8 flavor_mask; /* bit in flavor mask. */ |
394f99a9 | 485 | struct rcu_data __percpu *rda; /* pointer of percu rcu_data. */ |
db3e8db4 | 486 | call_rcu_func_t call; /* call_rcu() flavor. */ |
b9585e94 | 487 | int ncpus; /* # CPUs seen so far. */ |
9f77da9f PM |
488 | |
489 | /* The following fields are guarded by the root rcu_node's lock. */ | |
490 | ||
77f81fe0 PM |
491 | u8 boost ____cacheline_internodealigned_in_smp; |
492 | /* Subject to priority boost. */ | |
20133cfc PM |
493 | unsigned long gpnum; /* Current gp number. */ |
494 | unsigned long completed; /* # of last completed gp. */ | |
b3dbec76 | 495 | struct task_struct *gp_kthread; /* Task for grace periods. */ |
abedf8e2 | 496 | struct swait_queue_head gp_wq; /* Where GP task waits. */ |
afea227f PM |
497 | short gp_flags; /* Commands for GP task. */ |
498 | short gp_state; /* GP kthread sleep state. */ | |
1eba8f84 | 499 | |
d9a3da06 | 500 | /* End of fields guarded by root rcu_node's lock. */ |
1eba8f84 | 501 | |
7b2e6011 PM |
502 | raw_spinlock_t orphan_lock ____cacheline_internodealigned_in_smp; |
503 | /* Protect following fields. */ | |
b1420f1c PM |
504 | struct rcu_head *orphan_nxtlist; /* Orphaned callbacks that */ |
505 | /* need a grace period. */ | |
506 | struct rcu_head **orphan_nxttail; /* Tail of above. */ | |
507 | struct rcu_head *orphan_donelist; /* Orphaned callbacks that */ | |
508 | /* are ready to invoke. */ | |
509 | struct rcu_head **orphan_donetail; /* Tail of above. */ | |
510 | long qlen_lazy; /* Number of lazy callbacks. */ | |
511 | long qlen; /* Total number of callbacks. */ | |
7b2e6011 | 512 | /* End of fields guarded by orphan_lock. */ |
a4fbe35a | 513 | |
7be7f0be | 514 | struct mutex barrier_mutex; /* Guards barrier fields. */ |
24ebbca8 | 515 | atomic_t barrier_cpu_count; /* # CPUs waiting on. */ |
7db74df8 | 516 | struct completion barrier_completion; /* Wake at barrier end. */ |
4f525a52 | 517 | unsigned long barrier_sequence; /* ++ at start and end of */ |
cf3a9c48 | 518 | /* _rcu_barrier(). */ |
a4fbe35a PM |
519 | /* End of fields guarded by barrier_mutex. */ |
520 | ||
f6a12f34 | 521 | struct mutex exp_mutex; /* Serialize expedited GP. */ |
3b5f668e | 522 | struct mutex exp_wake_mutex; /* Serialize wakeup. */ |
d6ada2cf | 523 | unsigned long expedited_sequence; /* Take a ticket. */ |
a30489c5 | 524 | atomic_long_t expedited_normal; /* # fallbacks to normal. */ |
3a6d7c64 | 525 | atomic_t expedited_need_qs; /* # CPUs left to check in. */ |
abedf8e2 | 526 | struct swait_queue_head expedited_wq; /* Wait for check-ins. */ |
b9585e94 | 527 | int ncpus_snap; /* # CPUs seen last time. */ |
40694d66 | 528 | |
9f77da9f PM |
529 | unsigned long jiffies_force_qs; /* Time at which to invoke */ |
530 | /* force_quiescent_state(). */ | |
8c7c4829 PM |
531 | unsigned long jiffies_kick_kthreads; /* Time at which to kick */ |
532 | /* kthreads, if configured. */ | |
9f77da9f PM |
533 | unsigned long n_force_qs; /* Number of calls to */ |
534 | /* force_quiescent_state(). */ | |
535 | unsigned long n_force_qs_lh; /* ~Number of calls leaving */ | |
536 | /* due to lock unavailable. */ | |
537 | unsigned long n_force_qs_ngp; /* Number of calls leaving */ | |
538 | /* due to no GP active. */ | |
9f77da9f PM |
539 | unsigned long gp_start; /* Time at which GP started, */ |
540 | /* but in jiffies. */ | |
6ccd2ecd PM |
541 | unsigned long gp_activity; /* Time of last GP kthread */ |
542 | /* activity in jiffies. */ | |
9f77da9f PM |
543 | unsigned long jiffies_stall; /* Time at which to check */ |
544 | /* for CPU stalls. */ | |
6193c76a PM |
545 | unsigned long jiffies_resched; /* Time at which to resched */ |
546 | /* a reluctant CPU. */ | |
fc908ed3 PM |
547 | unsigned long n_force_qs_gpstart; /* Snapshot of n_force_qs at */ |
548 | /* GP start. */ | |
15ba0ba8 PM |
549 | unsigned long gp_max; /* Maximum GP duration in */ |
550 | /* jiffies. */ | |
e66c33d5 | 551 | const char *name; /* Name of structure. */ |
a4889858 | 552 | char abbr; /* Abbreviated name. */ |
6ce75a23 | 553 | struct list_head flavors; /* List of RCU flavors. */ |
9f77da9f PM |
554 | }; |
555 | ||
4cdfc175 PM |
556 | /* Values for rcu_state structure's gp_flags field. */ |
557 | #define RCU_GP_FLAG_INIT 0x1 /* Need grace-period initialization. */ | |
558 | #define RCU_GP_FLAG_FQS 0x2 /* Need grace-period quiescent-state forcing. */ | |
559 | ||
c34d2f41 | 560 | /* Values for rcu_state structure's gp_state field. */ |
77f81fe0 | 561 | #define RCU_GP_IDLE 0 /* Initial state and no GP in progress. */ |
afea227f | 562 | #define RCU_GP_WAIT_GPS 1 /* Wait for grace-period start. */ |
319362c9 PM |
563 | #define RCU_GP_DONE_GPS 2 /* Wait done for grace-period start. */ |
564 | #define RCU_GP_WAIT_FQS 3 /* Wait for force-quiescent-state time. */ | |
32bb1c79 | 565 | #define RCU_GP_DOING_FQS 4 /* Wait done for force-quiescent-state time. */ |
319362c9 PM |
566 | #define RCU_GP_CLEANUP 5 /* Grace-period cleanup started. */ |
567 | #define RCU_GP_CLEANED 6 /* Grace-period cleanup complete. */ | |
afea227f | 568 | |
6b50e119 PM |
569 | #ifndef RCU_TREE_NONCORE |
570 | static const char * const gp_state_names[] = { | |
571 | "RCU_GP_IDLE", | |
572 | "RCU_GP_WAIT_GPS", | |
573 | "RCU_GP_DONE_GPS", | |
574 | "RCU_GP_WAIT_FQS", | |
575 | "RCU_GP_DOING_FQS", | |
576 | "RCU_GP_CLEANUP", | |
577 | "RCU_GP_CLEANED", | |
578 | }; | |
579 | #endif /* #ifndef RCU_TREE_NONCORE */ | |
580 | ||
6ce75a23 | 581 | extern struct list_head rcu_struct_flavors; |
3fbfbf7a PM |
582 | |
583 | /* Sequence through rcu_state structures for each RCU flavor. */ | |
6ce75a23 PM |
584 | #define for_each_rcu_flavor(rsp) \ |
585 | list_for_each_entry((rsp), &rcu_struct_flavors, flavors) | |
586 | ||
6258c4fb IM |
587 | /* |
588 | * RCU implementation internal declarations: | |
589 | */ | |
d6714c22 | 590 | extern struct rcu_state rcu_sched_state; |
6258c4fb IM |
591 | |
592 | extern struct rcu_state rcu_bh_state; | |
6258c4fb | 593 | |
28f6569a | 594 | #ifdef CONFIG_PREEMPT_RCU |
f41d911f | 595 | extern struct rcu_state rcu_preempt_state; |
28f6569a | 596 | #endif /* #ifdef CONFIG_PREEMPT_RCU */ |
f41d911f | 597 | |
eab0993c PM |
598 | #ifdef CONFIG_RCU_BOOST |
599 | DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_status); | |
600 | DECLARE_PER_CPU(int, rcu_cpu_kthread_cpu); | |
601 | DECLARE_PER_CPU(unsigned int, rcu_cpu_kthread_loops); | |
602 | DECLARE_PER_CPU(char, rcu_cpu_has_work); | |
603 | #endif /* #ifdef CONFIG_RCU_BOOST */ | |
604 | ||
017c4261 | 605 | #ifndef RCU_TREE_NONCORE |
9f77da9f | 606 | |
9b2619af | 607 | /* Forward declarations for rcutree_plugin.h */ |
dbe01350 | 608 | static void rcu_bootup_announce(void); |
38200cf2 | 609 | static void rcu_preempt_note_context_switch(void); |
27f4d280 | 610 | static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp); |
b668c9cf | 611 | #ifdef CONFIG_HOTPLUG_CPU |
8af3a5e7 | 612 | static bool rcu_preempt_has_tasks(struct rcu_node *rnp); |
b668c9cf | 613 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ |
1ed509a2 | 614 | static void rcu_print_detail_task_stall(struct rcu_state *rsp); |
9bc8b558 | 615 | static int rcu_print_task_stall(struct rcu_node *rnp); |
74611ecb | 616 | static int rcu_print_task_exp_stall(struct rcu_node *rnp); |
9b2619af | 617 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); |
86aea0e6 | 618 | static void rcu_preempt_check_callbacks(void); |
b6a4ae76 | 619 | void call_rcu(struct rcu_head *head, rcu_callback_t func); |
9b2619af | 620 | static void __init __rcu_init_preempt(void); |
1217ed1b | 621 | static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags); |
a46e0899 PM |
622 | static void rcu_preempt_boost_start_gp(struct rcu_node *rnp); |
623 | static void invoke_rcu_callbacks_kthread(void); | |
dff1672d | 624 | static bool rcu_is_callbacks_kthread(void); |
a46e0899 PM |
625 | #ifdef CONFIG_RCU_BOOST |
626 | static void rcu_preempt_do_callbacks(void); | |
49fb4c62 | 627 | static int rcu_spawn_one_boost_kthread(struct rcu_state *rsp, |
5d01bbd1 | 628 | struct rcu_node *rnp); |
a46e0899 | 629 | #endif /* #ifdef CONFIG_RCU_BOOST */ |
9386c0b7 | 630 | static void __init rcu_spawn_boost_kthreads(void); |
49fb4c62 | 631 | static void rcu_prepare_kthreads(int cpu); |
8fa7845d | 632 | static void rcu_cleanup_after_idle(void); |
198bbf81 | 633 | static void rcu_prepare_for_idle(void); |
c57afe80 | 634 | static void rcu_idle_count_callbacks_posted(void); |
0aa04b05 | 635 | static bool rcu_preempt_has_tasks(struct rcu_node *rnp); |
a858af28 PM |
636 | static void print_cpu_stall_info_begin(void); |
637 | static void print_cpu_stall_info(struct rcu_state *rsp, int cpu); | |
638 | static void print_cpu_stall_info_end(void); | |
639 | static void zero_cpu_stall_ticks(struct rcu_data *rdp); | |
640 | static void increment_cpu_stall_ticks(void); | |
d7e29933 | 641 | static bool rcu_nocb_cpu_needs_barrier(struct rcu_state *rsp, int cpu); |
dae6e64d | 642 | static void rcu_nocb_gp_set(struct rcu_node *rnp, int nrq); |
abedf8e2 PG |
643 | static struct swait_queue_head *rcu_nocb_gp_get(struct rcu_node *rnp); |
644 | static void rcu_nocb_gp_cleanup(struct swait_queue_head *sq); | |
dae6e64d | 645 | static void rcu_init_one_nocb(struct rcu_node *rnp); |
3fbfbf7a | 646 | static bool __call_rcu_nocb(struct rcu_data *rdp, struct rcu_head *rhp, |
96d3fd0d | 647 | bool lazy, unsigned long flags); |
3fbfbf7a | 648 | static bool rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp, |
96d3fd0d PM |
649 | struct rcu_data *rdp, |
650 | unsigned long flags); | |
9fdd3bc9 | 651 | static int rcu_nocb_need_deferred_wakeup(struct rcu_data *rdp); |
96d3fd0d | 652 | static void do_nocb_deferred_wakeup(struct rcu_data *rdp); |
3fbfbf7a | 653 | static void rcu_boot_init_nocb_percpu_data(struct rcu_data *rdp); |
35ce7f29 PM |
654 | static void rcu_spawn_all_nocb_kthreads(int cpu); |
655 | static void __init rcu_spawn_nocb_kthreads(void); | |
656 | #ifdef CONFIG_RCU_NOCB_CPU | |
657 | static void __init rcu_organize_nocb_kthreads(struct rcu_state *rsp); | |
658 | #endif /* #ifdef CONFIG_RCU_NOCB_CPU */ | |
4a81e832 | 659 | static void __maybe_unused rcu_kick_nohz_cpu(int cpu); |
34ed6246 | 660 | static bool init_nocb_callback_list(struct rcu_data *rdp); |
28ced795 CL |
661 | static void rcu_sysidle_enter(int irq); |
662 | static void rcu_sysidle_exit(int irq); | |
0edd1b17 PM |
663 | static void rcu_sysidle_check_cpu(struct rcu_data *rdp, bool *isidle, |
664 | unsigned long *maxj); | |
665 | static bool is_sysidle_rcu_state(struct rcu_state *rsp); | |
666 | static void rcu_sysidle_report_gp(struct rcu_state *rsp, int isidle, | |
667 | unsigned long maxj); | |
eb75767b | 668 | static void rcu_bind_gp_kthread(void); |
2333210b | 669 | static void rcu_sysidle_init_percpu_data(struct rcu_dynticks *rdtp); |
a096932f | 670 | static bool rcu_nohz_full_cpu(struct rcu_state *rsp); |
176f8f7a PM |
671 | static void rcu_dynticks_task_enter(void); |
672 | static void rcu_dynticks_task_exit(void); | |
9b2619af | 673 | |
017c4261 | 674 | #endif /* #ifndef RCU_TREE_NONCORE */ |
3fbfbf7a PM |
675 | |
676 | #ifdef CONFIG_RCU_TRACE | |
41050a00 | 677 | /* Read out queue lengths for tracing. */ |
3fbfbf7a PM |
678 | static inline void rcu_nocb_q_lengths(struct rcu_data *rdp, long *ql, long *qll) |
679 | { | |
41050a00 PM |
680 | #ifdef CONFIG_RCU_NOCB_CPU |
681 | *ql = atomic_long_read(&rdp->nocb_q_count); | |
682 | *qll = atomic_long_read(&rdp->nocb_q_count_lazy); | |
3fbfbf7a | 683 | #else /* #ifdef CONFIG_RCU_NOCB_CPU */ |
3fbfbf7a PM |
684 | *ql = 0; |
685 | *qll = 0; | |
3fbfbf7a | 686 | #endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */ |
41050a00 | 687 | } |
3fbfbf7a | 688 | #endif /* #ifdef CONFIG_RCU_TRACE */ |
12d560f4 PM |
689 | |
690 | /* | |
691 | * Place this after a lock-acquisition primitive to guarantee that | |
692 | * an UNLOCK+LOCK pair act as a full barrier. This guarantee applies | |
693 | * if the UNLOCK and LOCK are executed by the same CPU or if the | |
694 | * UNLOCK and LOCK operate on the same lock variable. | |
695 | */ | |
696 | #ifdef CONFIG_PPC | |
697 | #define smp_mb__after_unlock_lock() smp_mb() /* Full ordering for lock. */ | |
698 | #else /* #ifdef CONFIG_PPC */ | |
699 | #define smp_mb__after_unlock_lock() do { } while (0) | |
700 | #endif /* #else #ifdef CONFIG_PPC */ | |
2a67e741 PZ |
701 | |
702 | /* | |
67c583a7 | 703 | * Wrappers for the rcu_node::lock acquire and release. |
2a67e741 PZ |
704 | * |
705 | * Because the rcu_nodes form a tree, the tree traversal locking will observe | |
706 | * different lock values, this in turn means that an UNLOCK of one level | |
707 | * followed by a LOCK of another level does not imply a full memory barrier; | |
708 | * and most importantly transitivity is lost. | |
709 | * | |
710 | * In order to restore full ordering between tree levels, augment the regular | |
711 | * lock acquire functions with smp_mb__after_unlock_lock(). | |
67c583a7 BF |
712 | * |
713 | * As ->lock of struct rcu_node is a __private field, therefore one should use | |
714 | * these wrappers rather than directly call raw_spin_{lock,unlock}* on ->lock. | |
2a67e741 PZ |
715 | */ |
716 | static inline void raw_spin_lock_rcu_node(struct rcu_node *rnp) | |
717 | { | |
67c583a7 | 718 | raw_spin_lock(&ACCESS_PRIVATE(rnp, lock)); |
2a67e741 PZ |
719 | smp_mb__after_unlock_lock(); |
720 | } | |
721 | ||
67c583a7 BF |
722 | static inline void raw_spin_unlock_rcu_node(struct rcu_node *rnp) |
723 | { | |
724 | raw_spin_unlock(&ACCESS_PRIVATE(rnp, lock)); | |
725 | } | |
726 | ||
2a67e741 PZ |
727 | static inline void raw_spin_lock_irq_rcu_node(struct rcu_node *rnp) |
728 | { | |
67c583a7 | 729 | raw_spin_lock_irq(&ACCESS_PRIVATE(rnp, lock)); |
2a67e741 PZ |
730 | smp_mb__after_unlock_lock(); |
731 | } | |
732 | ||
67c583a7 BF |
733 | static inline void raw_spin_unlock_irq_rcu_node(struct rcu_node *rnp) |
734 | { | |
735 | raw_spin_unlock_irq(&ACCESS_PRIVATE(rnp, lock)); | |
736 | } | |
737 | ||
738 | #define raw_spin_lock_irqsave_rcu_node(rnp, flags) \ | |
739 | do { \ | |
740 | typecheck(unsigned long, flags); \ | |
741 | raw_spin_lock_irqsave(&ACCESS_PRIVATE(rnp, lock), flags); \ | |
742 | smp_mb__after_unlock_lock(); \ | |
743 | } while (0) | |
744 | ||
745 | #define raw_spin_unlock_irqrestore_rcu_node(rnp, flags) \ | |
746 | do { \ | |
747 | typecheck(unsigned long, flags); \ | |
748 | raw_spin_unlock_irqrestore(&ACCESS_PRIVATE(rnp, lock), flags); \ | |
2a67e741 PZ |
749 | } while (0) |
750 | ||
751 | static inline bool raw_spin_trylock_rcu_node(struct rcu_node *rnp) | |
752 | { | |
67c583a7 | 753 | bool locked = raw_spin_trylock(&ACCESS_PRIVATE(rnp, lock)); |
2a67e741 PZ |
754 | |
755 | if (locked) | |
756 | smp_mb__after_unlock_lock(); | |
757 | return locked; | |
758 | } |