Merge tag 'fsnotify_for_v5.19-rc5' of git://git.kernel.org/pub/scm/linux/kernel/git...
[linux-2.6-block.git] / kernel / rcu / tree_exp.h
CommitLineData
22e40925 1/* SPDX-License-Identifier: GPL-2.0+ */
3549c2bc
PM
2/*
3 * RCU expedited grace periods
4 *
3549c2bc
PM
5 * Copyright IBM Corporation, 2016
6 *
22e40925 7 * Authors: Paul E. McKenney <paulmck@linux.ibm.com>
3549c2bc
PM
8 */
9
55ebfce0
BF
10#include <linux/lockdep.h>
11
142d106d 12static void rcu_exp_handler(void *unused);
d87cda50 13static int rcu_print_task_exp_stall(struct rcu_node *rnp);
142d106d 14
09e2db37
PM
15/*
16 * Record the start of an expedited grace period.
17 */
63d4c8c9 18static void rcu_exp_gp_seq_start(void)
3549c2bc 19{
63d4c8c9 20 rcu_seq_start(&rcu_state.expedited_sequence);
3549c2bc 21}
09e2db37 22
9a414201 23/*
de8cd0a5 24 * Return the value that the expedited-grace-period counter will have
9a414201
PM
25 * at the end of the current grace period.
26 */
63d4c8c9 27static __maybe_unused unsigned long rcu_exp_gp_seq_endval(void)
9a414201 28{
63d4c8c9 29 return rcu_seq_endval(&rcu_state.expedited_sequence);
9a414201
PM
30}
31
09e2db37
PM
32/*
33 * Record the end of an expedited grace period.
34 */
63d4c8c9 35static void rcu_exp_gp_seq_end(void)
3549c2bc 36{
63d4c8c9 37 rcu_seq_end(&rcu_state.expedited_sequence);
3549c2bc
PM
38 smp_mb(); /* Ensure that consecutive grace periods serialize. */
39}
09e2db37
PM
40
41/*
de8cd0a5
PM
42 * Take a snapshot of the expedited-grace-period counter, which is the
43 * earliest value that will indicate that a full grace period has
44 * elapsed since the current time.
09e2db37 45 */
63d4c8c9 46static unsigned long rcu_exp_gp_seq_snap(void)
3549c2bc
PM
47{
48 unsigned long s;
49
50 smp_mb(); /* Caller's modifications seen first by other CPUs. */
63d4c8c9
PM
51 s = rcu_seq_snap(&rcu_state.expedited_sequence);
52 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("snap"));
3549c2bc
PM
53 return s;
54}
09e2db37
PM
55
56/*
57 * Given a counter snapshot from rcu_exp_gp_seq_snap(), return true
58 * if a full expedited grace period has elapsed since that snapshot
59 * was taken.
60 */
63d4c8c9 61static bool rcu_exp_gp_seq_done(unsigned long s)
3549c2bc 62{
63d4c8c9 63 return rcu_seq_done(&rcu_state.expedited_sequence, s);
3549c2bc
PM
64}
65
66/*
67 * Reset the ->expmaskinit values in the rcu_node tree to reflect any
68 * recent CPU-online activity. Note that these masks are not cleared
69 * when CPUs go offline, so they reflect the union of all CPUs that have
70 * ever been online. This means that this function normally takes its
71 * no-work-to-do fastpath.
72 */
63d4c8c9 73static void sync_exp_reset_tree_hotplug(void)
3549c2bc
PM
74{
75 bool done;
76 unsigned long flags;
77 unsigned long mask;
78 unsigned long oldmask;
63d4c8c9 79 int ncpus = smp_load_acquire(&rcu_state.ncpus); /* Order vs. locking. */
3549c2bc
PM
80 struct rcu_node *rnp;
81 struct rcu_node *rnp_up;
82
83 /* If no new CPUs onlined since last time, nothing to do. */
63d4c8c9 84 if (likely(ncpus == rcu_state.ncpus_snap))
3549c2bc 85 return;
63d4c8c9 86 rcu_state.ncpus_snap = ncpus;
3549c2bc
PM
87
88 /*
89 * Each pass through the following loop propagates newly onlined
90 * CPUs for the current rcu_node structure up the rcu_node tree.
91 */
aedf4ba9 92 rcu_for_each_leaf_node(rnp) {
3549c2bc
PM
93 raw_spin_lock_irqsave_rcu_node(rnp, flags);
94 if (rnp->expmaskinit == rnp->expmaskinitnext) {
95 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
96 continue; /* No new CPUs, nothing to do. */
97 }
98
99 /* Update this node's mask, track old value for propagation. */
100 oldmask = rnp->expmaskinit;
101 rnp->expmaskinit = rnp->expmaskinitnext;
102 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
103
104 /* If was already nonzero, nothing to propagate. */
105 if (oldmask)
106 continue;
107
108 /* Propagate the new CPU up the tree. */
109 mask = rnp->grpmask;
110 rnp_up = rnp->parent;
111 done = false;
112 while (rnp_up) {
113 raw_spin_lock_irqsave_rcu_node(rnp_up, flags);
114 if (rnp_up->expmaskinit)
115 done = true;
116 rnp_up->expmaskinit |= mask;
117 raw_spin_unlock_irqrestore_rcu_node(rnp_up, flags);
118 if (done)
119 break;
120 mask = rnp_up->grpmask;
121 rnp_up = rnp_up->parent;
122 }
123 }
124}
125
126/*
127 * Reset the ->expmask values in the rcu_node tree in preparation for
128 * a new expedited grace period.
129 */
63d4c8c9 130static void __maybe_unused sync_exp_reset_tree(void)
3549c2bc
PM
131{
132 unsigned long flags;
133 struct rcu_node *rnp;
134
63d4c8c9 135 sync_exp_reset_tree_hotplug();
aedf4ba9 136 rcu_for_each_node_breadth_first(rnp) {
3549c2bc
PM
137 raw_spin_lock_irqsave_rcu_node(rnp, flags);
138 WARN_ON_ONCE(rnp->expmask);
15c7c972 139 WRITE_ONCE(rnp->expmask, rnp->expmaskinit);
3549c2bc
PM
140 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
141 }
142}
143
144/*
145 * Return non-zero if there is no RCU expedited grace period in progress
146 * for the specified rcu_node structure, in other words, if all CPUs and
147 * tasks covered by the specified rcu_node structure have done their bit
de8cd0a5 148 * for the current expedited grace period.
3549c2bc 149 */
6c7d7dbf 150static bool sync_rcu_exp_done(struct rcu_node *rnp)
3549c2bc 151{
55ebfce0 152 raw_lockdep_assert_held_rcu_node(rnp);
314eeb43 153 return READ_ONCE(rnp->exp_tasks) == NULL &&
3549c2bc
PM
154 READ_ONCE(rnp->expmask) == 0;
155}
156
55ebfce0 157/*
de8cd0a5
PM
158 * Like sync_rcu_exp_done(), but where the caller does not hold the
159 * rcu_node's ->lock.
55ebfce0 160 */
6c7d7dbf 161static bool sync_rcu_exp_done_unlocked(struct rcu_node *rnp)
55ebfce0
BF
162{
163 unsigned long flags;
164 bool ret;
165
166 raw_spin_lock_irqsave_rcu_node(rnp, flags);
6c7d7dbf 167 ret = sync_rcu_exp_done(rnp);
55ebfce0
BF
168 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
169
170 return ret;
171}
172
173
3549c2bc
PM
174/*
175 * Report the exit from RCU read-side critical section for the last task
176 * that queued itself during or before the current expedited preemptible-RCU
177 * grace period. This event is reported either to the rcu_node structure on
178 * which the task was queued or to one of that rcu_node structure's ancestors,
179 * recursively up the tree. (Calm down, calm down, we do the recursion
180 * iteratively!)
3549c2bc 181 */
63d4c8c9 182static void __rcu_report_exp_rnp(struct rcu_node *rnp,
3549c2bc
PM
183 bool wake, unsigned long flags)
184 __releases(rnp->lock)
185{
186 unsigned long mask;
187
de8cd0a5 188 raw_lockdep_assert_held_rcu_node(rnp);
3549c2bc 189 for (;;) {
6c7d7dbf 190 if (!sync_rcu_exp_done(rnp)) {
3549c2bc
PM
191 if (!rnp->expmask)
192 rcu_initiate_boost(rnp, flags);
193 else
194 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
195 break;
196 }
197 if (rnp->parent == NULL) {
198 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
199 if (wake) {
200 smp_mb(); /* EGP done before wake_up(). */
63d4c8c9 201 swake_up_one(&rcu_state.expedited_wq);
3549c2bc
PM
202 }
203 break;
204 }
205 mask = rnp->grpmask;
206 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled */
207 rnp = rnp->parent;
208 raw_spin_lock_rcu_node(rnp); /* irqs already disabled */
209 WARN_ON_ONCE(!(rnp->expmask & mask));
15c7c972 210 WRITE_ONCE(rnp->expmask, rnp->expmask & ~mask);
3549c2bc
PM
211 }
212}
213
214/*
215 * Report expedited quiescent state for specified node. This is a
216 * lock-acquisition wrapper function for __rcu_report_exp_rnp().
3549c2bc 217 */
63d4c8c9 218static void __maybe_unused rcu_report_exp_rnp(struct rcu_node *rnp, bool wake)
3549c2bc
PM
219{
220 unsigned long flags;
221
222 raw_spin_lock_irqsave_rcu_node(rnp, flags);
63d4c8c9 223 __rcu_report_exp_rnp(rnp, wake, flags);
3549c2bc
PM
224}
225
226/*
227 * Report expedited quiescent state for multiple CPUs, all covered by the
7be8c56f 228 * specified leaf rcu_node structure.
3549c2bc 229 */
63d4c8c9 230static void rcu_report_exp_cpu_mult(struct rcu_node *rnp,
3549c2bc
PM
231 unsigned long mask, bool wake)
232{
df1e849a 233 int cpu;
3549c2bc 234 unsigned long flags;
df1e849a 235 struct rcu_data *rdp;
3549c2bc
PM
236
237 raw_spin_lock_irqsave_rcu_node(rnp, flags);
238 if (!(rnp->expmask & mask)) {
239 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
240 return;
241 }
15c7c972 242 WRITE_ONCE(rnp->expmask, rnp->expmask & ~mask);
df1e849a
PM
243 for_each_leaf_node_cpu_mask(rnp, cpu, mask) {
244 rdp = per_cpu_ptr(&rcu_data, cpu);
245 if (!IS_ENABLED(CONFIG_NO_HZ_FULL) || !rdp->rcu_forced_tick_exp)
246 continue;
247 rdp->rcu_forced_tick_exp = false;
248 tick_dep_clear_cpu(cpu, TICK_DEP_BIT_RCU_EXP);
249 }
63d4c8c9 250 __rcu_report_exp_rnp(rnp, wake, flags); /* Releases rnp->lock. */
3549c2bc
PM
251}
252
253/*
254 * Report expedited quiescent state for specified rcu_data (CPU).
255 */
63d4c8c9 256static void rcu_report_exp_rdp(struct rcu_data *rdp)
3549c2bc 257{
6e16b0f7 258 WRITE_ONCE(rdp->cpu_no_qs.b.exp, false);
63d4c8c9 259 rcu_report_exp_cpu_mult(rdp->mynode, rdp->grpmask, true);
3549c2bc
PM
260}
261
45975c7d 262/* Common code for work-done checking. */
63d4c8c9 263static bool sync_exp_work_done(unsigned long s)
3549c2bc 264{
63d4c8c9
PM
265 if (rcu_exp_gp_seq_done(s)) {
266 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("done"));
96050c68 267 smp_mb(); /* Ensure test happens before caller kfree(). */
3549c2bc
PM
268 return true;
269 }
270 return false;
271}
272
273/*
274 * Funnel-lock acquisition for expedited grace periods. Returns true
275 * if some other task completed an expedited grace period that this task
276 * can piggy-back on, and with no mutex held. Otherwise, returns false
277 * with the mutex held, indicating that the caller must actually do the
278 * expedited grace period.
279 */
63d4c8c9 280static bool exp_funnel_lock(unsigned long s)
3549c2bc 281{
da1df50d 282 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, raw_smp_processor_id());
3549c2bc 283 struct rcu_node *rnp = rdp->mynode;
336a4f6c 284 struct rcu_node *rnp_root = rcu_get_root();
3549c2bc
PM
285
286 /* Low-contention fastpath. */
287 if (ULONG_CMP_LT(READ_ONCE(rnp->exp_seq_rq), s) &&
288 (rnp == rnp_root ||
289 ULONG_CMP_LT(READ_ONCE(rnp_root->exp_seq_rq), s)) &&
63d4c8c9 290 mutex_trylock(&rcu_state.exp_mutex))
3549c2bc
PM
291 goto fastpath;
292
293 /*
294 * Each pass through the following loop works its way up
295 * the rcu_node tree, returning if others have done the work or
63d4c8c9 296 * otherwise falls through to acquire ->exp_mutex. The mapping
3549c2bc
PM
297 * from CPU to rcu_node structure can be inexact, as it is just
298 * promoting locality and is not strictly needed for correctness.
299 */
300 for (; rnp != NULL; rnp = rnp->parent) {
63d4c8c9 301 if (sync_exp_work_done(s))
3549c2bc
PM
302 return true;
303
304 /* Work not done, either wait here or go up. */
305 spin_lock(&rnp->exp_lock);
306 if (ULONG_CMP_GE(rnp->exp_seq_rq, s)) {
307
308 /* Someone else doing GP, so wait for them. */
309 spin_unlock(&rnp->exp_lock);
63d4c8c9 310 trace_rcu_exp_funnel_lock(rcu_state.name, rnp->level,
3549c2bc
PM
311 rnp->grplo, rnp->grphi,
312 TPS("wait"));
031aeee0 313 wait_event(rnp->exp_wq[rcu_seq_ctr(s) & 0x3],
63d4c8c9 314 sync_exp_work_done(s));
3549c2bc
PM
315 return true;
316 }
b0c18c87 317 WRITE_ONCE(rnp->exp_seq_rq, s); /* Followers can wait on us. */
3549c2bc 318 spin_unlock(&rnp->exp_lock);
63d4c8c9
PM
319 trace_rcu_exp_funnel_lock(rcu_state.name, rnp->level,
320 rnp->grplo, rnp->grphi, TPS("nxtlvl"));
3549c2bc 321 }
63d4c8c9 322 mutex_lock(&rcu_state.exp_mutex);
3549c2bc 323fastpath:
63d4c8c9
PM
324 if (sync_exp_work_done(s)) {
325 mutex_unlock(&rcu_state.exp_mutex);
3549c2bc
PM
326 return true;
327 }
63d4c8c9
PM
328 rcu_exp_gp_seq_start();
329 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("start"));
3549c2bc
PM
330 return false;
331}
332
3549c2bc 333/*
25f3d7ef
PM
334 * Select the CPUs within the specified rcu_node that the upcoming
335 * expedited grace period needs to wait for.
3549c2bc 336 */
9621fbee 337static void __sync_rcu_exp_select_node_cpus(struct rcu_exp_work *rewp)
3549c2bc
PM
338{
339 int cpu;
340 unsigned long flags;
3549c2bc
PM
341 unsigned long mask_ofl_test;
342 unsigned long mask_ofl_ipi;
343 int ret;
25f3d7ef 344 struct rcu_node *rnp = container_of(rewp, struct rcu_node, rew);
3549c2bc 345
25f3d7ef 346 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3549c2bc 347
25f3d7ef
PM
348 /* Each pass checks a CPU for identity, offline, and idle. */
349 mask_ofl_test = 0;
350 for_each_leaf_node_cpu_mask(rnp, cpu, rnp->expmask) {
da1df50d 351 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, cpu);
aca2991a 352 unsigned long mask = rdp->grpmask;
25f3d7ef
PM
353 int snap;
354
355 if (raw_smp_processor_id() == cpu ||
356 !(rnp->qsmaskinitnext & mask)) {
357 mask_ofl_test |= mask;
358 } else {
dc5a4f29 359 snap = rcu_dynticks_snap(rdp);
25f3d7ef 360 if (rcu_dynticks_in_eqs(snap))
65963d24 361 mask_ofl_test |= mask;
25f3d7ef
PM
362 else
363 rdp->exp_dynticks_snap = snap;
3549c2bc 364 }
25f3d7ef
PM
365 }
366 mask_ofl_ipi = rnp->expmask & ~mask_ofl_test;
3549c2bc 367
25f3d7ef
PM
368 /*
369 * Need to wait for any blocked tasks as well. Note that
370 * additional blocking tasks will also block the expedited GP
371 * until such time as the ->expmask bits are cleared.
372 */
373 if (rcu_preempt_has_tasks(rnp))
314eeb43 374 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next);
25f3d7ef
PM
375 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
376
377 /* IPI the remaining CPUs for expedited quiescent state. */
15c7c972 378 for_each_leaf_node_cpu_mask(rnp, cpu, mask_ofl_ipi) {
da1df50d 379 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, cpu);
aca2991a 380 unsigned long mask = rdp->grpmask;
0742ac3e 381
3549c2bc 382retry_ipi:
dc5a4f29 383 if (rcu_dynticks_in_eqs_since(rdp, rdp->exp_dynticks_snap)) {
25f3d7ef
PM
384 mask_ofl_test |= mask;
385 continue;
386 }
b9ad4d6e 387 if (get_cpu() == cpu) {
81f6d49c 388 mask_ofl_test |= mask;
b9ad4d6e
PM
389 put_cpu();
390 continue;
391 }
142d106d 392 ret = smp_call_function_single(cpu, rcu_exp_handler, NULL, 0);
b9ad4d6e 393 put_cpu();
9f08cf08
BF
394 /* The CPU will report the QS in response to the IPI. */
395 if (!ret)
25f3d7ef 396 continue;
9f08cf08 397
25f3d7ef
PM
398 /* Failed, raced with CPU hotplug operation. */
399 raw_spin_lock_irqsave_rcu_node(rnp, flags);
400 if ((rnp->qsmaskinitnext & mask) &&
401 (rnp->expmask & mask)) {
402 /* Online, so delay for a bit and try again. */
3549c2bc 403 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
63d4c8c9 404 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("selectofl"));
68c2f27e 405 schedule_timeout_idle(1);
25f3d7ef
PM
406 goto retry_ipi;
407 }
9f08cf08
BF
408 /* CPU really is offline, so we must report its QS. */
409 if (rnp->expmask & mask)
410 mask_ofl_test |= mask;
25f3d7ef
PM
411 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
412 }
413 /* Report quiescent states for those that went offline. */
25f3d7ef 414 if (mask_ofl_test)
63d4c8c9 415 rcu_report_exp_cpu_mult(rnp, mask_ofl_test, false);
25f3d7ef
PM
416}
417
9621fbee
KS
418static void rcu_exp_sel_wait_wake(unsigned long s);
419
420#ifdef CONFIG_RCU_EXP_KTHREAD
421static void sync_rcu_exp_select_node_cpus(struct kthread_work *wp)
422{
423 struct rcu_exp_work *rewp =
424 container_of(wp, struct rcu_exp_work, rew_work);
425
426 __sync_rcu_exp_select_node_cpus(rewp);
427}
428
429static inline bool rcu_gp_par_worker_started(void)
430{
431 return !!READ_ONCE(rcu_exp_par_gp_kworker);
432}
433
434static inline void sync_rcu_exp_select_cpus_queue_work(struct rcu_node *rnp)
435{
436 kthread_init_work(&rnp->rew.rew_work, sync_rcu_exp_select_node_cpus);
437 /*
438 * Use rcu_exp_par_gp_kworker, because flushing a work item from
439 * another work item on the same kthread worker can result in
440 * deadlock.
441 */
442 kthread_queue_work(rcu_exp_par_gp_kworker, &rnp->rew.rew_work);
443}
444
445static inline void sync_rcu_exp_select_cpus_flush_work(struct rcu_node *rnp)
446{
447 kthread_flush_work(&rnp->rew.rew_work);
448}
449
450/*
451 * Work-queue handler to drive an expedited grace period forward.
452 */
453static void wait_rcu_exp_gp(struct kthread_work *wp)
454{
455 struct rcu_exp_work *rewp;
456
457 rewp = container_of(wp, struct rcu_exp_work, rew_work);
458 rcu_exp_sel_wait_wake(rewp->rew_s);
459}
460
461static inline void synchronize_rcu_expedited_queue_work(struct rcu_exp_work *rew)
462{
463 kthread_init_work(&rew->rew_work, wait_rcu_exp_gp);
464 kthread_queue_work(rcu_exp_gp_kworker, &rew->rew_work);
465}
466
467static inline void synchronize_rcu_expedited_destroy_work(struct rcu_exp_work *rew)
468{
469}
470#else /* !CONFIG_RCU_EXP_KTHREAD */
471static void sync_rcu_exp_select_node_cpus(struct work_struct *wp)
472{
473 struct rcu_exp_work *rewp =
474 container_of(wp, struct rcu_exp_work, rew_work);
475
476 __sync_rcu_exp_select_node_cpus(rewp);
477}
478
479static inline bool rcu_gp_par_worker_started(void)
480{
481 return !!READ_ONCE(rcu_par_gp_wq);
482}
483
484static inline void sync_rcu_exp_select_cpus_queue_work(struct rcu_node *rnp)
485{
486 int cpu = find_next_bit(&rnp->ffmask, BITS_PER_LONG, -1);
487
488 INIT_WORK(&rnp->rew.rew_work, sync_rcu_exp_select_node_cpus);
489 /* If all offline, queue the work on an unbound CPU. */
490 if (unlikely(cpu > rnp->grphi - rnp->grplo))
491 cpu = WORK_CPU_UNBOUND;
492 else
493 cpu += rnp->grplo;
494 queue_work_on(cpu, rcu_par_gp_wq, &rnp->rew.rew_work);
495}
496
497static inline void sync_rcu_exp_select_cpus_flush_work(struct rcu_node *rnp)
498{
499 flush_work(&rnp->rew.rew_work);
500}
501
502/*
503 * Work-queue handler to drive an expedited grace period forward.
504 */
505static void wait_rcu_exp_gp(struct work_struct *wp)
506{
507 struct rcu_exp_work *rewp;
508
509 rewp = container_of(wp, struct rcu_exp_work, rew_work);
510 rcu_exp_sel_wait_wake(rewp->rew_s);
511}
512
513static inline void synchronize_rcu_expedited_queue_work(struct rcu_exp_work *rew)
514{
515 INIT_WORK_ONSTACK(&rew->rew_work, wait_rcu_exp_gp);
516 queue_work(rcu_gp_wq, &rew->rew_work);
517}
518
519static inline void synchronize_rcu_expedited_destroy_work(struct rcu_exp_work *rew)
520{
521 destroy_work_on_stack(&rew->rew_work);
522}
523#endif /* CONFIG_RCU_EXP_KTHREAD */
524
25f3d7ef
PM
525/*
526 * Select the nodes that the upcoming expedited grace period needs
527 * to wait for.
528 */
142d106d 529static void sync_rcu_exp_select_cpus(void)
25f3d7ef
PM
530{
531 struct rcu_node *rnp;
532
63d4c8c9
PM
533 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("reset"));
534 sync_exp_reset_tree();
535 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("select"));
25f3d7ef
PM
536
537 /* Schedule work for each leaf rcu_node structure. */
aedf4ba9 538 rcu_for_each_leaf_node(rnp) {
25f3d7ef
PM
539 rnp->exp_need_flush = false;
540 if (!READ_ONCE(rnp->expmask))
541 continue; /* Avoid early boot non-existent wq. */
9621fbee 542 if (!rcu_gp_par_worker_started() ||
5257514d 543 rcu_scheduler_active != RCU_SCHEDULER_RUNNING ||
aedf4ba9 544 rcu_is_last_leaf_node(rnp)) {
9621fbee 545 /* No worker started yet or last leaf, do direct call. */
25f3d7ef
PM
546 sync_rcu_exp_select_node_cpus(&rnp->rew.rew_work);
547 continue;
3549c2bc 548 }
9621fbee 549 sync_rcu_exp_select_cpus_queue_work(rnp);
25f3d7ef 550 rnp->exp_need_flush = true;
3549c2bc 551 }
25f3d7ef 552
9621fbee 553 /* Wait for jobs (if any) to complete. */
aedf4ba9 554 rcu_for_each_leaf_node(rnp)
25f3d7ef 555 if (rnp->exp_need_flush)
9621fbee 556 sync_rcu_exp_select_cpus_flush_work(rnp);
3549c2bc
PM
557}
558
df1e849a
PM
559/*
560 * Wait for the expedited grace period to elapse, within time limit.
561 * If the time limit is exceeded without the grace period elapsing,
562 * return false, otherwise return true.
563 */
564static bool synchronize_rcu_expedited_wait_once(long tlimit)
565{
566 int t;
567 struct rcu_node *rnp_root = rcu_get_root();
568
569 t = swait_event_timeout_exclusive(rcu_state.expedited_wq,
570 sync_rcu_exp_done_unlocked(rnp_root),
571 tlimit);
572 // Workqueues should not be signaled.
573 if (t > 0 || sync_rcu_exp_done_unlocked(rnp_root))
574 return true;
575 WARN_ON(t < 0); /* workqueues should not be signaled. */
576 return false;
577}
578
de8cd0a5
PM
579/*
580 * Wait for the expedited grace period to elapse, issuing any needed
581 * RCU CPU stall warnings along the way.
582 */
28f0361f 583static void synchronize_rcu_expedited_wait(void)
3549c2bc
PM
584{
585 int cpu;
59ee0326 586 unsigned long j;
3549c2bc
PM
587 unsigned long jiffies_stall;
588 unsigned long jiffies_start;
589 unsigned long mask;
590 int ndetected;
df1e849a 591 struct rcu_data *rdp;
3549c2bc 592 struct rcu_node *rnp;
336a4f6c 593 struct rcu_node *rnp_root = rcu_get_root();
3549c2bc 594
63d4c8c9 595 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("startwait"));
28b3ae42 596 jiffies_stall = rcu_exp_jiffies_till_stall_check();
3549c2bc 597 jiffies_start = jiffies;
59ee0326 598 if (tick_nohz_full_enabled() && rcu_inkernel_boot_has_ended()) {
df1e849a
PM
599 if (synchronize_rcu_expedited_wait_once(1))
600 return;
601 rcu_for_each_leaf_node(rnp) {
63c564da
PM
602 mask = READ_ONCE(rnp->expmask);
603 for_each_leaf_node_cpu_mask(rnp, cpu, mask) {
df1e849a
PM
604 rdp = per_cpu_ptr(&rcu_data, cpu);
605 if (rdp->rcu_forced_tick_exp)
606 continue;
607 rdp->rcu_forced_tick_exp = true;
147f04b1
PM
608 preempt_disable();
609 if (cpu_online(cpu))
610 tick_dep_set_cpu(cpu, TICK_DEP_BIT_RCU_EXP);
611 preempt_enable();
df1e849a
PM
612 }
613 }
59ee0326
PM
614 j = READ_ONCE(jiffies_till_first_fqs);
615 if (synchronize_rcu_expedited_wait_once(j + HZ))
616 return;
df1e849a 617 }
3549c2bc
PM
618
619 for (;;) {
df1e849a 620 if (synchronize_rcu_expedited_wait_once(jiffies_stall))
3549c2bc 621 return;
58c53360 622 if (rcu_stall_is_suppressed())
24a6cff2
PM
623 continue;
624 panic_on_rcu_stall();
565cfb9e 625 trace_rcu_stall_warning(rcu_state.name, TPS("ExpeditedStall"));
3549c2bc 626 pr_err("INFO: %s detected expedited stalls on CPUs/tasks: {",
63d4c8c9 627 rcu_state.name);
3549c2bc 628 ndetected = 0;
aedf4ba9 629 rcu_for_each_leaf_node(rnp) {
3549c2bc 630 ndetected += rcu_print_task_exp_stall(rnp);
bc75e999 631 for_each_leaf_node_possible_cpu(rnp, cpu) {
3549c2bc
PM
632 struct rcu_data *rdp;
633
bc75e999 634 mask = leaf_node_cpu_bit(rnp, cpu);
15c7c972 635 if (!(READ_ONCE(rnp->expmask) & mask))
3549c2bc
PM
636 continue;
637 ndetected++;
da1df50d 638 rdp = per_cpu_ptr(&rcu_data, cpu);
3549c2bc
PM
639 pr_cont(" %d-%c%c%c", cpu,
640 "O."[!!cpu_online(cpu)],
641 "o."[!!(rdp->grpmask & rnp->expmaskinit)],
642 "N."[!!(rdp->grpmask & rnp->expmaskinitnext)]);
643 }
3549c2bc
PM
644 }
645 pr_cont(" } %lu jiffies s: %lu root: %#lx/%c\n",
63d4c8c9 646 jiffies - jiffies_start, rcu_state.expedited_sequence,
314eeb43
PM
647 data_race(rnp_root->expmask),
648 ".T"[!!data_race(rnp_root->exp_tasks)]);
3549c2bc 649 if (ndetected) {
b08ea1de 650 pr_err("blocking rcu_node structures (internal RCU debug):");
aedf4ba9 651 rcu_for_each_node_breadth_first(rnp) {
3549c2bc
PM
652 if (rnp == rnp_root)
653 continue; /* printed unconditionally */
6c7d7dbf 654 if (sync_rcu_exp_done_unlocked(rnp))
3549c2bc
PM
655 continue;
656 pr_cont(" l=%u:%d-%d:%#lx/%c",
657 rnp->level, rnp->grplo, rnp->grphi,
314eeb43
PM
658 data_race(rnp->expmask),
659 ".T"[!!data_race(rnp->exp_tasks)]);
3549c2bc
PM
660 }
661 pr_cont("\n");
662 }
aedf4ba9 663 rcu_for_each_leaf_node(rnp) {
bc75e999
MR
664 for_each_leaf_node_possible_cpu(rnp, cpu) {
665 mask = leaf_node_cpu_bit(rnp, cpu);
15c7c972 666 if (!(READ_ONCE(rnp->expmask) & mask))
3549c2bc
PM
667 continue;
668 dump_cpu_task(cpu);
669 }
670 }
28b3ae42 671 jiffies_stall = 3 * rcu_exp_jiffies_till_stall_check() + 3;
3549c2bc
PM
672 }
673}
674
675/*
676 * Wait for the current expedited grace period to complete, and then
677 * wake up everyone who piggybacked on the just-completed expedited
678 * grace period. Also update all the ->exp_seq_rq counters as needed
679 * in order to avoid counter-wrap problems.
680 */
63d4c8c9 681static void rcu_exp_wait_wake(unsigned long s)
3549c2bc
PM
682{
683 struct rcu_node *rnp;
684
28f0361f 685 synchronize_rcu_expedited_wait();
3549c2bc 686
4bc6b745
NU
687 // Switch over to wakeup mode, allowing the next GP to proceed.
688 // End the previous grace period only after acquiring the mutex
689 // to ensure that only one GP runs concurrently with wakeups.
63d4c8c9 690 mutex_lock(&rcu_state.exp_wake_mutex);
4bc6b745
NU
691 rcu_exp_gp_seq_end();
692 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("end"));
3549c2bc 693
aedf4ba9 694 rcu_for_each_node_breadth_first(rnp) {
3549c2bc
PM
695 if (ULONG_CMP_LT(READ_ONCE(rnp->exp_seq_rq), s)) {
696 spin_lock(&rnp->exp_lock);
697 /* Recheck, avoid hang in case someone just arrived. */
698 if (ULONG_CMP_LT(rnp->exp_seq_rq, s))
24bb9ecc 699 WRITE_ONCE(rnp->exp_seq_rq, s);
3549c2bc
PM
700 spin_unlock(&rnp->exp_lock);
701 }
3c345825 702 smp_mb(); /* All above changes before wakeup. */
fd6bc19d 703 wake_up_all(&rnp->exp_wq[rcu_seq_ctr(s) & 0x3]);
3549c2bc 704 }
63d4c8c9
PM
705 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("endwake"));
706 mutex_unlock(&rcu_state.exp_wake_mutex);
3549c2bc
PM
707}
708
52d7e48b
PM
709/*
710 * Common code to drive an expedited grace period forward, used by
711 * workqueues and mid-boot-time tasks.
712 */
142d106d 713static void rcu_exp_sel_wait_wake(unsigned long s)
52d7e48b
PM
714{
715 /* Initialize the rcu_node tree in preparation for the wait. */
142d106d 716 sync_rcu_exp_select_cpus();
52d7e48b
PM
717
718 /* Wait and clean up, including waking everyone. */
63d4c8c9 719 rcu_exp_wait_wake(s);
52d7e48b
PM
720}
721
40e0a6cf
PM
722#ifdef CONFIG_PREEMPT_RCU
723
724/*
725 * Remote handler for smp_call_function_single(). If there is an
726 * RCU read-side critical section in effect, request that the
727 * next rcu_read_unlock() record the quiescent state up the
728 * ->expmask fields in the rcu_node tree. Otherwise, immediately
729 * report the quiescent state.
730 */
142d106d 731static void rcu_exp_handler(void *unused)
40e0a6cf 732{
5f5fa7ea 733 int depth = rcu_preempt_depth();
3e310098 734 unsigned long flags;
da1df50d 735 struct rcu_data *rdp = this_cpu_ptr(&rcu_data);
3e310098 736 struct rcu_node *rnp = rdp->mynode;
40e0a6cf
PM
737 struct task_struct *t = current;
738
739 /*
3e310098
PM
740 * First, the common case of not being in an RCU read-side
741 * critical section. If also enabled or idle, immediately
742 * report the quiescent state, otherwise defer.
40e0a6cf 743 */
5f5fa7ea 744 if (!depth) {
3e310098 745 if (!(preempt_count() & (PREEMPT_MASK | SOFTIRQ_MASK)) ||
4d266c24 746 rcu_is_cpu_rrupt_from_idle()) {
63d4c8c9 747 rcu_report_exp_rdp(rdp);
3e310098 748 } else {
6120b72e 749 WRITE_ONCE(rdp->cpu_no_qs.b.exp, true);
fced9c8c
PM
750 set_tsk_need_resched(t);
751 set_preempt_need_resched();
3e310098 752 }
40e0a6cf
PM
753 return;
754 }
755
756 /*
3e310098
PM
757 * Second, the less-common case of being in an RCU read-side
758 * critical section. In this case we can count on a future
759 * rcu_read_unlock(). However, this rcu_read_unlock() might
760 * execute on some other CPU, but in that case there will be
761 * a future context switch. Either way, if the expedited
762 * grace period is still waiting on this CPU, set ->deferred_qs
763 * so that the eventual quiescent state will be reported.
764 * Note that there is a large group of race conditions that
765 * can have caused this quiescent state to already have been
766 * reported, so we really do need to check ->expmask.
40e0a6cf 767 */
5f5fa7ea 768 if (depth > 0) {
3e310098 769 raw_spin_lock_irqsave_rcu_node(rnp, flags);
05f41571 770 if (rnp->expmask & rdp->grpmask) {
6120b72e 771 WRITE_ONCE(rdp->cpu_no_qs.b.exp, true);
add0d37b 772 t->rcu_read_unlock_special.b.exp_hint = true;
05f41571 773 }
3e310098 774 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1de462ed 775 return;
3e310098
PM
776 }
777
5f5fa7ea
LJ
778 // Finally, negative nesting depth should not happen.
779 WARN_ON_ONCE(1);
40e0a6cf
PM
780}
781
90326f05 782/* PREEMPTION=y, so no PREEMPTION=n expedited grace period to clean up after. */
45975c7d
PM
783static void sync_sched_exp_online_cleanup(int cpu)
784{
785}
786
d87cda50
PM
787/*
788 * Scan the current list of tasks blocked within RCU read-side critical
789 * sections, printing out the tid of each that is blocking the current
790 * expedited grace period.
791 */
792static int rcu_print_task_exp_stall(struct rcu_node *rnp)
793{
314eeb43 794 unsigned long flags;
d87cda50 795 int ndetected = 0;
314eeb43 796 struct task_struct *t;
d87cda50 797
314eeb43 798 if (!READ_ONCE(rnp->exp_tasks))
d87cda50 799 return 0;
314eeb43 800 raw_spin_lock_irqsave_rcu_node(rnp, flags);
d87cda50
PM
801 t = list_entry(rnp->exp_tasks->prev,
802 struct task_struct, rcu_node_entry);
803 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {
804 pr_cont(" P%d", t->pid);
805 ndetected++;
806 }
314eeb43 807 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
d87cda50
PM
808 return ndetected;
809}
810
40e0a6cf
PM
811#else /* #ifdef CONFIG_PREEMPT_RCU */
812
e015a341
PM
813/* Request an expedited quiescent state. */
814static void rcu_exp_need_qs(void)
815{
816 __this_cpu_write(rcu_data.cpu_no_qs.b.exp, true);
817 /* Store .exp before .rcu_urgent_qs. */
818 smp_store_release(this_cpu_ptr(&rcu_data.rcu_urgent_qs), true);
819 set_tsk_need_resched(current);
820 set_preempt_need_resched();
821}
822
45975c7d 823/* Invoked on each online non-idle CPU for expedited quiescent state. */
142d106d 824static void rcu_exp_handler(void *unused)
45975c7d 825{
7487ea07
PM
826 struct rcu_data *rdp = this_cpu_ptr(&rcu_data);
827 struct rcu_node *rnp = rdp->mynode;
45975c7d 828
45975c7d
PM
829 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) ||
830 __this_cpu_read(rcu_data.cpu_no_qs.b.exp))
831 return;
832 if (rcu_is_cpu_rrupt_from_idle()) {
63d4c8c9 833 rcu_report_exp_rdp(this_cpu_ptr(&rcu_data));
45975c7d
PM
834 return;
835 }
e015a341 836 rcu_exp_need_qs();
45975c7d
PM
837}
838
839/* Send IPI for expedited cleanup if needed at end of CPU-hotplug operation. */
840static void sync_sched_exp_online_cleanup(int cpu)
841{
e015a341
PM
842 unsigned long flags;
843 int my_cpu;
45975c7d
PM
844 struct rcu_data *rdp;
845 int ret;
846 struct rcu_node *rnp;
45975c7d 847
da1df50d 848 rdp = per_cpu_ptr(&rcu_data, cpu);
45975c7d 849 rnp = rdp->mynode;
e015a341
PM
850 my_cpu = get_cpu();
851 /* Quiescent state either not needed or already requested, leave. */
852 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) ||
5401cc52 853 READ_ONCE(rdp->cpu_no_qs.b.exp)) {
e015a341 854 put_cpu();
45975c7d 855 return;
e015a341
PM
856 }
857 /* Quiescent state needed on current CPU, so set it up locally. */
858 if (my_cpu == cpu) {
859 local_irq_save(flags);
860 rcu_exp_need_qs();
861 local_irq_restore(flags);
862 put_cpu();
863 return;
864 }
865 /* Quiescent state needed on some other CPU, send IPI. */
142d106d 866 ret = smp_call_function_single(cpu, rcu_exp_handler, NULL, 0);
e015a341 867 put_cpu();
45975c7d
PM
868 WARN_ON_ONCE(ret);
869}
870
d87cda50
PM
871/*
872 * Because preemptible RCU does not exist, we never have to check for
873 * tasks blocked within RCU read-side critical sections that are
874 * blocking the current expedited grace period.
875 */
876static int rcu_print_task_exp_stall(struct rcu_node *rnp)
877{
878 return 0;
879}
880
3cd4ca47 881#endif /* #else #ifdef CONFIG_PREEMPT_RCU */
45975c7d 882
3cd4ca47
PM
883/**
884 * synchronize_rcu_expedited - Brute-force RCU grace period
885 *
886 * Wait for an RCU grace period, but expedite it. The basic idea is to
887 * IPI all non-idle non-nohz online CPUs. The IPI handler checks whether
888 * the CPU is in an RCU critical section, and if so, it sets a flag that
889 * causes the outermost rcu_read_unlock() to report the quiescent state
890 * for RCU-preempt or asks the scheduler for help for RCU-sched. On the
891 * other hand, if the CPU is not in an RCU read-side critical section,
892 * the IPI handler reports the quiescent state immediately.
893 *
511b44f7 894 * Although this is a great improvement over previous expedited
3cd4ca47
PM
895 * implementations, it is still unfriendly to real-time workloads, so is
896 * thus not recommended for any sort of common-case code. In fact, if
897 * you are using synchronize_rcu_expedited() in a loop, please restructure
de8cd0a5 898 * your code to batch your updates, and then use a single synchronize_rcu()
3cd4ca47
PM
899 * instead.
900 *
901 * This has the same semantics as (but is more brutal than) synchronize_rcu().
902 */
40e0a6cf
PM
903void synchronize_rcu_expedited(void)
904{
fbad01af 905 bool boottime = (rcu_scheduler_active == RCU_SCHEDULER_INIT);
89230726
PM
906 struct rcu_exp_work rew;
907 struct rcu_node *rnp;
908 unsigned long s;
909
45975c7d
PM
910 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
911 lock_is_held(&rcu_lock_map) ||
912 lock_is_held(&rcu_sched_lock_map),
8fa946d4 913 "Illegal synchronize_rcu_expedited() in RCU read-side critical section");
45975c7d 914
3cd4ca47 915 /* Is the state is such that the call is a grace period? */
45975c7d
PM
916 if (rcu_blocking_is_gp())
917 return;
918
89230726
PM
919 /* If expedited grace periods are prohibited, fall back to normal. */
920 if (rcu_gp_is_normal()) {
921 wait_rcu_gp(call_rcu);
922 return;
923 }
924
925 /* Take a snapshot of the sequence number. */
926 s = rcu_exp_gp_seq_snap();
927 if (exp_funnel_lock(s))
928 return; /* Someone else did our work for us. */
929
930 /* Ensure that load happens before action based on it. */
fbad01af 931 if (unlikely(boottime)) {
89230726
PM
932 /* Direct call during scheduler init and early_initcalls(). */
933 rcu_exp_sel_wait_wake(s);
934 } else {
935 /* Marshall arguments & schedule the expedited grace period. */
936 rew.rew_s = s;
9621fbee 937 synchronize_rcu_expedited_queue_work(&rew);
89230726
PM
938 }
939
940 /* Wait for expedited grace period to complete. */
89230726
PM
941 rnp = rcu_get_root();
942 wait_event(rnp->exp_wq[rcu_seq_ctr(s) & 0x3],
943 sync_exp_work_done(s));
9621fbee 944 smp_mb(); /* Work actions happen before return. */
89230726
PM
945
946 /* Let the next expedited grace period start. */
947 mutex_unlock(&rcu_state.exp_mutex);
fbad01af
PM
948
949 if (likely(!boottime))
9621fbee 950 synchronize_rcu_expedited_destroy_work(&rew);
40e0a6cf
PM
951}
952EXPORT_SYMBOL_GPL(synchronize_rcu_expedited);