1 /* SPDX-License-Identifier: GPL-2.0+ */
2 /*
3 * RCU expedited grace periods
4 *
5 * Copyright IBM Corporation, 2016
6 *
7 * Authors: Paul E. McKenney <paulmck@linux.ibm.com>
8 */
9
10 #include <linux/lockdep.h>
11
12 static void rcu_exp_handler(void *unused);
13 static int rcu_print_task_exp_stall(struct rcu_node *rnp);
14
15 /*
16 * Record the start of an expedited grace period.
17 */
rcu_exp_gp_seq_start(void)18 static void rcu_exp_gp_seq_start(void)
19 {
20 rcu_seq_start(&rcu_state.expedited_sequence);
21 }
22
23 /*
24 * Return the value that the expedited-grace-period counter will have
25 * at the end of the current grace period.
26 */
rcu_exp_gp_seq_endval(void)27 static __maybe_unused unsigned long rcu_exp_gp_seq_endval(void)
28 {
29 return rcu_seq_endval(&rcu_state.expedited_sequence);
30 }
31
32 /*
33 * Record the end of an expedited grace period.
34 */
rcu_exp_gp_seq_end(void)35 static void rcu_exp_gp_seq_end(void)
36 {
37 rcu_seq_end(&rcu_state.expedited_sequence);
38 smp_mb(); /* Ensure that consecutive grace periods serialize. */
39 }
40
41 /*
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.
45 */
rcu_exp_gp_seq_snap(void)46 static unsigned long rcu_exp_gp_seq_snap(void)
47 {
48 unsigned long s;
49
50 smp_mb(); /* Caller's modifications seen first by other CPUs. */
51 s = rcu_seq_snap(&rcu_state.expedited_sequence);
52 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("snap"));
53 return s;
54 }
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 */
rcu_exp_gp_seq_done(unsigned long s)61 static bool rcu_exp_gp_seq_done(unsigned long s)
62 {
63 return rcu_seq_done(&rcu_state.expedited_sequence, s);
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 */
sync_exp_reset_tree_hotplug(void)73 static void sync_exp_reset_tree_hotplug(void)
74 {
75 bool done;
76 unsigned long flags;
77 unsigned long mask;
78 unsigned long oldmask;
79 int ncpus = smp_load_acquire(&rcu_state.ncpus); /* Order vs. locking. */
80 struct rcu_node *rnp;
81 struct rcu_node *rnp_up;
82
83 /* If no new CPUs onlined since last time, nothing to do. */
84 if (likely(ncpus == rcu_state.ncpus_snap))
85 return;
86 rcu_state.ncpus_snap = ncpus;
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 */
92 rcu_for_each_leaf_node(rnp) {
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 */
sync_exp_reset_tree(void)130 static void __maybe_unused sync_exp_reset_tree(void)
131 {
132 unsigned long flags;
133 struct rcu_node *rnp;
134
135 sync_exp_reset_tree_hotplug();
136 rcu_for_each_node_breadth_first(rnp) {
137 raw_spin_lock_irqsave_rcu_node(rnp, flags);
138 WARN_ON_ONCE(rnp->expmask);
139 WRITE_ONCE(rnp->expmask, rnp->expmaskinit);
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
148 * for the current expedited grace period.
149 */
sync_rcu_exp_done(struct rcu_node * rnp)150 static bool sync_rcu_exp_done(struct rcu_node *rnp)
151 {
152 raw_lockdep_assert_held_rcu_node(rnp);
153 return READ_ONCE(rnp->exp_tasks) == NULL &&
154 READ_ONCE(rnp->expmask) == 0;
155 }
156
157 /*
158 * Like sync_rcu_exp_done(), but where the caller does not hold the
159 * rcu_node's ->lock.
160 */
sync_rcu_exp_done_unlocked(struct rcu_node * rnp)161 static bool sync_rcu_exp_done_unlocked(struct rcu_node *rnp)
162 {
163 unsigned long flags;
164 bool ret;
165
166 raw_spin_lock_irqsave_rcu_node(rnp, flags);
167 ret = sync_rcu_exp_done(rnp);
168 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
169
170 return ret;
171 }
172
173
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!)
181 */
__rcu_report_exp_rnp(struct rcu_node * rnp,bool wake,unsigned long flags)182 static void __rcu_report_exp_rnp(struct rcu_node *rnp,
183 bool wake, unsigned long flags)
184 __releases(rnp->lock)
185 {
186 unsigned long mask;
187
188 raw_lockdep_assert_held_rcu_node(rnp);
189 for (;;) {
190 if (!sync_rcu_exp_done(rnp)) {
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(). */
201 swake_up_one(&rcu_state.expedited_wq);
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));
210 WRITE_ONCE(rnp->expmask, rnp->expmask & ~mask);
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().
217 */
rcu_report_exp_rnp(struct rcu_node * rnp,bool wake)218 static void __maybe_unused rcu_report_exp_rnp(struct rcu_node *rnp, bool wake)
219 {
220 unsigned long flags;
221
222 raw_spin_lock_irqsave_rcu_node(rnp, flags);
223 __rcu_report_exp_rnp(rnp, wake, flags);
224 }
225
226 /*
227 * Report expedited quiescent state for multiple CPUs, all covered by the
228 * specified leaf rcu_node structure.
229 */
rcu_report_exp_cpu_mult(struct rcu_node * rnp,unsigned long mask,bool wake)230 static void rcu_report_exp_cpu_mult(struct rcu_node *rnp,
231 unsigned long mask, bool wake)
232 {
233 int cpu;
234 unsigned long flags;
235 struct rcu_data *rdp;
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 }
242 WRITE_ONCE(rnp->expmask, rnp->expmask & ~mask);
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 }
250 __rcu_report_exp_rnp(rnp, wake, flags); /* Releases rnp->lock. */
251 }
252
253 /*
254 * Report expedited quiescent state for specified rcu_data (CPU).
255 */
rcu_report_exp_rdp(struct rcu_data * rdp)256 static void rcu_report_exp_rdp(struct rcu_data *rdp)
257 {
258 WRITE_ONCE(rdp->exp_deferred_qs, false);
259 rcu_report_exp_cpu_mult(rdp->mynode, rdp->grpmask, true);
260 }
261
262 /* Common code for work-done checking. */
sync_exp_work_done(unsigned long s)263 static bool sync_exp_work_done(unsigned long s)
264 {
265 if (rcu_exp_gp_seq_done(s)) {
266 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("done"));
267 smp_mb(); /* Ensure test happens before caller kfree(). */
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 */
exp_funnel_lock(unsigned long s)280 static bool exp_funnel_lock(unsigned long s)
281 {
282 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, raw_smp_processor_id());
283 struct rcu_node *rnp = rdp->mynode;
284 struct rcu_node *rnp_root = rcu_get_root();
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)) &&
290 mutex_trylock(&rcu_state.exp_mutex))
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
296 * otherwise falls through to acquire ->exp_mutex. The mapping
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) {
301 if (sync_exp_work_done(s))
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);
310 trace_rcu_exp_funnel_lock(rcu_state.name, rnp->level,
311 rnp->grplo, rnp->grphi,
312 TPS("wait"));
313 wait_event(rnp->exp_wq[rcu_seq_ctr(s) & 0x3],
314 sync_exp_work_done(s));
315 return true;
316 }
317 WRITE_ONCE(rnp->exp_seq_rq, s); /* Followers can wait on us. */
318 spin_unlock(&rnp->exp_lock);
319 trace_rcu_exp_funnel_lock(rcu_state.name, rnp->level,
320 rnp->grplo, rnp->grphi, TPS("nxtlvl"));
321 }
322 mutex_lock(&rcu_state.exp_mutex);
323 fastpath:
324 if (sync_exp_work_done(s)) {
325 mutex_unlock(&rcu_state.exp_mutex);
326 return true;
327 }
328 rcu_exp_gp_seq_start();
329 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("start"));
330 return false;
331 }
332
333 /*
334 * Select the CPUs within the specified rcu_node that the upcoming
335 * expedited grace period needs to wait for.
336 */
sync_rcu_exp_select_node_cpus(struct work_struct * wp)337 static void sync_rcu_exp_select_node_cpus(struct work_struct *wp)
338 {
339 int cpu;
340 unsigned long flags;
341 unsigned long mask_ofl_test;
342 unsigned long mask_ofl_ipi;
343 int ret;
344 struct rcu_exp_work *rewp =
345 container_of(wp, struct rcu_exp_work, rew_work);
346 struct rcu_node *rnp = container_of(rewp, struct rcu_node, rew);
347
348 raw_spin_lock_irqsave_rcu_node(rnp, flags);
349
350 /* Each pass checks a CPU for identity, offline, and idle. */
351 mask_ofl_test = 0;
352 for_each_leaf_node_cpu_mask(rnp, cpu, rnp->expmask) {
353 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, cpu);
354 unsigned long mask = rdp->grpmask;
355 int snap;
356
357 if (raw_smp_processor_id() == cpu ||
358 !(rnp->qsmaskinitnext & mask)) {
359 mask_ofl_test |= mask;
360 } else {
361 snap = rcu_dynticks_snap(rdp);
362 if (rcu_dynticks_in_eqs(snap))
363 mask_ofl_test |= mask;
364 else
365 rdp->exp_dynticks_snap = snap;
366 }
367 }
368 mask_ofl_ipi = rnp->expmask & ~mask_ofl_test;
369
370 /*
371 * Need to wait for any blocked tasks as well. Note that
372 * additional blocking tasks will also block the expedited GP
373 * until such time as the ->expmask bits are cleared.
374 */
375 if (rcu_preempt_has_tasks(rnp))
376 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next);
377 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
378
379 /* IPI the remaining CPUs for expedited quiescent state. */
380 for_each_leaf_node_cpu_mask(rnp, cpu, mask_ofl_ipi) {
381 struct rcu_data *rdp = per_cpu_ptr(&rcu_data, cpu);
382 unsigned long mask = rdp->grpmask;
383
384 retry_ipi:
385 if (rcu_dynticks_in_eqs_since(rdp, rdp->exp_dynticks_snap)) {
386 mask_ofl_test |= mask;
387 continue;
388 }
389 if (get_cpu() == cpu) {
390 mask_ofl_test |= mask;
391 put_cpu();
392 continue;
393 }
394 ret = smp_call_function_single(cpu, rcu_exp_handler, NULL, 0);
395 put_cpu();
396 /* The CPU will report the QS in response to the IPI. */
397 if (!ret)
398 continue;
399
400 /* Failed, raced with CPU hotplug operation. */
401 raw_spin_lock_irqsave_rcu_node(rnp, flags);
402 if ((rnp->qsmaskinitnext & mask) &&
403 (rnp->expmask & mask)) {
404 /* Online, so delay for a bit and try again. */
405 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
406 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("selectofl"));
407 schedule_timeout_idle(1);
408 goto retry_ipi;
409 }
410 /* CPU really is offline, so we must report its QS. */
411 if (rnp->expmask & mask)
412 mask_ofl_test |= mask;
413 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
414 }
415 /* Report quiescent states for those that went offline. */
416 if (mask_ofl_test)
417 rcu_report_exp_cpu_mult(rnp, mask_ofl_test, false);
418 }
419
420 /*
421 * Select the nodes that the upcoming expedited grace period needs
422 * to wait for.
423 */
sync_rcu_exp_select_cpus(void)424 static void sync_rcu_exp_select_cpus(void)
425 {
426 int cpu;
427 struct rcu_node *rnp;
428
429 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("reset"));
430 sync_exp_reset_tree();
431 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("select"));
432
433 /* Schedule work for each leaf rcu_node structure. */
434 rcu_for_each_leaf_node(rnp) {
435 rnp->exp_need_flush = false;
436 if (!READ_ONCE(rnp->expmask))
437 continue; /* Avoid early boot non-existent wq. */
438 if (!READ_ONCE(rcu_par_gp_wq) ||
439 rcu_scheduler_active != RCU_SCHEDULER_RUNNING ||
440 rcu_is_last_leaf_node(rnp)) {
441 /* No workqueues yet or last leaf, do direct call. */
442 sync_rcu_exp_select_node_cpus(&rnp->rew.rew_work);
443 continue;
444 }
445 INIT_WORK(&rnp->rew.rew_work, sync_rcu_exp_select_node_cpus);
446 cpu = find_next_bit(&rnp->ffmask, BITS_PER_LONG, -1);
447 /* If all offline, queue the work on an unbound CPU. */
448 if (unlikely(cpu > rnp->grphi - rnp->grplo))
449 cpu = WORK_CPU_UNBOUND;
450 else
451 cpu += rnp->grplo;
452 queue_work_on(cpu, rcu_par_gp_wq, &rnp->rew.rew_work);
453 rnp->exp_need_flush = true;
454 }
455
456 /* Wait for workqueue jobs (if any) to complete. */
457 rcu_for_each_leaf_node(rnp)
458 if (rnp->exp_need_flush)
459 flush_work(&rnp->rew.rew_work);
460 }
461
462 /*
463 * Wait for the expedited grace period to elapse, within time limit.
464 * If the time limit is exceeded without the grace period elapsing,
465 * return false, otherwise return true.
466 */
synchronize_rcu_expedited_wait_once(long tlimit)467 static bool synchronize_rcu_expedited_wait_once(long tlimit)
468 {
469 int t;
470 struct rcu_node *rnp_root = rcu_get_root();
471
472 t = swait_event_timeout_exclusive(rcu_state.expedited_wq,
473 sync_rcu_exp_done_unlocked(rnp_root),
474 tlimit);
475 // Workqueues should not be signaled.
476 if (t > 0 || sync_rcu_exp_done_unlocked(rnp_root))
477 return true;
478 WARN_ON(t < 0); /* workqueues should not be signaled. */
479 return false;
480 }
481
482 /*
483 * Wait for the expedited grace period to elapse, issuing any needed
484 * RCU CPU stall warnings along the way.
485 */
synchronize_rcu_expedited_wait(void)486 static void synchronize_rcu_expedited_wait(void)
487 {
488 int cpu;
489 unsigned long j;
490 unsigned long jiffies_stall;
491 unsigned long jiffies_start;
492 unsigned long mask;
493 int ndetected;
494 struct rcu_data *rdp;
495 struct rcu_node *rnp;
496 struct rcu_node *rnp_root = rcu_get_root();
497
498 trace_rcu_exp_grace_period(rcu_state.name, rcu_exp_gp_seq_endval(), TPS("startwait"));
499 jiffies_stall = rcu_jiffies_till_stall_check();
500 jiffies_start = jiffies;
501 if (tick_nohz_full_enabled() && rcu_inkernel_boot_has_ended()) {
502 if (synchronize_rcu_expedited_wait_once(1))
503 return;
504 rcu_for_each_leaf_node(rnp) {
505 for_each_leaf_node_cpu_mask(rnp, cpu, rnp->expmask) {
506 rdp = per_cpu_ptr(&rcu_data, cpu);
507 if (rdp->rcu_forced_tick_exp)
508 continue;
509 rdp->rcu_forced_tick_exp = true;
510 preempt_disable();
511 if (cpu_online(cpu))
512 tick_dep_set_cpu(cpu, TICK_DEP_BIT_RCU_EXP);
513 preempt_enable();
514 }
515 }
516 j = READ_ONCE(jiffies_till_first_fqs);
517 if (synchronize_rcu_expedited_wait_once(j + HZ))
518 return;
519 WARN_ON_ONCE(IS_ENABLED(CONFIG_PREEMPT_RT));
520 }
521
522 for (;;) {
523 if (synchronize_rcu_expedited_wait_once(jiffies_stall))
524 return;
525 if (rcu_stall_is_suppressed())
526 continue;
527 panic_on_rcu_stall();
528 trace_rcu_stall_warning(rcu_state.name, TPS("ExpeditedStall"));
529 pr_err("INFO: %s detected expedited stalls on CPUs/tasks: {",
530 rcu_state.name);
531 ndetected = 0;
532 rcu_for_each_leaf_node(rnp) {
533 ndetected += rcu_print_task_exp_stall(rnp);
534 for_each_leaf_node_possible_cpu(rnp, cpu) {
535 struct rcu_data *rdp;
536
537 mask = leaf_node_cpu_bit(rnp, cpu);
538 if (!(READ_ONCE(rnp->expmask) & mask))
539 continue;
540 ndetected++;
541 rdp = per_cpu_ptr(&rcu_data, cpu);
542 pr_cont(" %d-%c%c%c", cpu,
543 "O."[!!cpu_online(cpu)],
544 "o."[!!(rdp->grpmask & rnp->expmaskinit)],
545 "N."[!!(rdp->grpmask & rnp->expmaskinitnext)]);
546 }
547 }
548 pr_cont(" } %lu jiffies s: %lu root: %#lx/%c\n",
549 jiffies - jiffies_start, rcu_state.expedited_sequence,
550 data_race(rnp_root->expmask),
551 ".T"[!!data_race(rnp_root->exp_tasks)]);
552 if (ndetected) {
553 pr_err("blocking rcu_node structures:");
554 rcu_for_each_node_breadth_first(rnp) {
555 if (rnp == rnp_root)
556 continue; /* printed unconditionally */
557 if (sync_rcu_exp_done_unlocked(rnp))
558 continue;
559 pr_cont(" l=%u:%d-%d:%#lx/%c",
560 rnp->level, rnp->grplo, rnp->grphi,
561 data_race(rnp->expmask),
562 ".T"[!!data_race(rnp->exp_tasks)]);
563 }
564 pr_cont("\n");
565 }
566 rcu_for_each_leaf_node(rnp) {
567 for_each_leaf_node_possible_cpu(rnp, cpu) {
568 mask = leaf_node_cpu_bit(rnp, cpu);
569 if (!(READ_ONCE(rnp->expmask) & mask))
570 continue;
571 preempt_disable(); // For smp_processor_id() in dump_cpu_task().
572 dump_cpu_task(cpu);
573 preempt_enable();
574 }
575 }
576 jiffies_stall = 3 * rcu_jiffies_till_stall_check() + 3;
577 }
578 }
579
580 /*
581 * Wait for the current expedited grace period to complete, and then
582 * wake up everyone who piggybacked on the just-completed expedited
583 * grace period. Also update all the ->exp_seq_rq counters as needed
584 * in order to avoid counter-wrap problems.
585 */
rcu_exp_wait_wake(unsigned long s)586 static void rcu_exp_wait_wake(unsigned long s)
587 {
588 struct rcu_node *rnp;
589
590 synchronize_rcu_expedited_wait();
591
592 // Switch over to wakeup mode, allowing the next GP to proceed.
593 // End the previous grace period only after acquiring the mutex
594 // to ensure that only one GP runs concurrently with wakeups.
595 mutex_lock(&rcu_state.exp_wake_mutex);
596 rcu_exp_gp_seq_end();
597 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("end"));
598
599 rcu_for_each_node_breadth_first(rnp) {
600 if (ULONG_CMP_LT(READ_ONCE(rnp->exp_seq_rq), s)) {
601 spin_lock(&rnp->exp_lock);
602 /* Recheck, avoid hang in case someone just arrived. */
603 if (ULONG_CMP_LT(rnp->exp_seq_rq, s))
604 WRITE_ONCE(rnp->exp_seq_rq, s);
605 spin_unlock(&rnp->exp_lock);
606 }
607 smp_mb(); /* All above changes before wakeup. */
608 wake_up_all(&rnp->exp_wq[rcu_seq_ctr(s) & 0x3]);
609 }
610 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("endwake"));
611 mutex_unlock(&rcu_state.exp_wake_mutex);
612 }
613
614 /*
615 * Common code to drive an expedited grace period forward, used by
616 * workqueues and mid-boot-time tasks.
617 */
rcu_exp_sel_wait_wake(unsigned long s)618 static void rcu_exp_sel_wait_wake(unsigned long s)
619 {
620 /* Initialize the rcu_node tree in preparation for the wait. */
621 sync_rcu_exp_select_cpus();
622
623 /* Wait and clean up, including waking everyone. */
624 rcu_exp_wait_wake(s);
625 }
626
627 /*
628 * Work-queue handler to drive an expedited grace period forward.
629 */
wait_rcu_exp_gp(struct work_struct * wp)630 static void wait_rcu_exp_gp(struct work_struct *wp)
631 {
632 struct rcu_exp_work *rewp;
633
634 rewp = container_of(wp, struct rcu_exp_work, rew_work);
635 rcu_exp_sel_wait_wake(rewp->rew_s);
636 }
637
638 #ifdef CONFIG_PREEMPT_RCU
639
640 /*
641 * Remote handler for smp_call_function_single(). If there is an
642 * RCU read-side critical section in effect, request that the
643 * next rcu_read_unlock() record the quiescent state up the
644 * ->expmask fields in the rcu_node tree. Otherwise, immediately
645 * report the quiescent state.
646 */
rcu_exp_handler(void * unused)647 static void rcu_exp_handler(void *unused)
648 {
649 int depth = rcu_preempt_depth();
650 unsigned long flags;
651 struct rcu_data *rdp = this_cpu_ptr(&rcu_data);
652 struct rcu_node *rnp = rdp->mynode;
653 struct task_struct *t = current;
654
655 /*
656 * First, the common case of not being in an RCU read-side
657 * critical section. If also enabled or idle, immediately
658 * report the quiescent state, otherwise defer.
659 */
660 if (!depth) {
661 if (!(preempt_count() & (PREEMPT_MASK | SOFTIRQ_MASK)) ||
662 rcu_dynticks_curr_cpu_in_eqs()) {
663 rcu_report_exp_rdp(rdp);
664 } else {
665 rdp->exp_deferred_qs = true;
666 set_tsk_need_resched(t);
667 set_preempt_need_resched();
668 }
669 return;
670 }
671
672 /*
673 * Second, the less-common case of being in an RCU read-side
674 * critical section. In this case we can count on a future
675 * rcu_read_unlock(). However, this rcu_read_unlock() might
676 * execute on some other CPU, but in that case there will be
677 * a future context switch. Either way, if the expedited
678 * grace period is still waiting on this CPU, set ->deferred_qs
679 * so that the eventual quiescent state will be reported.
680 * Note that there is a large group of race conditions that
681 * can have caused this quiescent state to already have been
682 * reported, so we really do need to check ->expmask.
683 */
684 if (depth > 0) {
685 raw_spin_lock_irqsave_rcu_node(rnp, flags);
686 if (rnp->expmask & rdp->grpmask) {
687 rdp->exp_deferred_qs = true;
688 t->rcu_read_unlock_special.b.exp_hint = true;
689 }
690 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
691 return;
692 }
693
694 // Finally, negative nesting depth should not happen.
695 WARN_ON_ONCE(1);
696 }
697
698 /* PREEMPTION=y, so no PREEMPTION=n expedited grace period to clean up after. */
sync_sched_exp_online_cleanup(int cpu)699 static void sync_sched_exp_online_cleanup(int cpu)
700 {
701 }
702
703 /*
704 * Scan the current list of tasks blocked within RCU read-side critical
705 * sections, printing out the tid of each that is blocking the current
706 * expedited grace period.
707 */
rcu_print_task_exp_stall(struct rcu_node * rnp)708 static int rcu_print_task_exp_stall(struct rcu_node *rnp)
709 {
710 unsigned long flags;
711 int ndetected = 0;
712 struct task_struct *t;
713
714 raw_spin_lock_irqsave_rcu_node(rnp, flags);
715 if (!rnp->exp_tasks) {
716 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
717 return 0;
718 }
719 t = list_entry(rnp->exp_tasks->prev,
720 struct task_struct, rcu_node_entry);
721 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {
722 pr_cont(" P%d", t->pid);
723 ndetected++;
724 }
725 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
726 return ndetected;
727 }
728
729 #else /* #ifdef CONFIG_PREEMPT_RCU */
730
731 /* Request an expedited quiescent state. */
rcu_exp_need_qs(void)732 static void rcu_exp_need_qs(void)
733 {
734 __this_cpu_write(rcu_data.cpu_no_qs.b.exp, true);
735 /* Store .exp before .rcu_urgent_qs. */
736 smp_store_release(this_cpu_ptr(&rcu_data.rcu_urgent_qs), true);
737 set_tsk_need_resched(current);
738 set_preempt_need_resched();
739 }
740
741 /* Invoked on each online non-idle CPU for expedited quiescent state. */
rcu_exp_handler(void * unused)742 static void rcu_exp_handler(void *unused)
743 {
744 struct rcu_data *rdp = this_cpu_ptr(&rcu_data);
745 struct rcu_node *rnp = rdp->mynode;
746
747 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) ||
748 __this_cpu_read(rcu_data.cpu_no_qs.b.exp))
749 return;
750 if (rcu_is_cpu_rrupt_from_idle()) {
751 rcu_report_exp_rdp(this_cpu_ptr(&rcu_data));
752 return;
753 }
754 rcu_exp_need_qs();
755 }
756
757 /* Send IPI for expedited cleanup if needed at end of CPU-hotplug operation. */
sync_sched_exp_online_cleanup(int cpu)758 static void sync_sched_exp_online_cleanup(int cpu)
759 {
760 unsigned long flags;
761 int my_cpu;
762 struct rcu_data *rdp;
763 int ret;
764 struct rcu_node *rnp;
765
766 rdp = per_cpu_ptr(&rcu_data, cpu);
767 rnp = rdp->mynode;
768 my_cpu = get_cpu();
769 /* Quiescent state either not needed or already requested, leave. */
770 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) ||
771 rdp->cpu_no_qs.b.exp) {
772 put_cpu();
773 return;
774 }
775 /* Quiescent state needed on current CPU, so set it up locally. */
776 if (my_cpu == cpu) {
777 local_irq_save(flags);
778 rcu_exp_need_qs();
779 local_irq_restore(flags);
780 put_cpu();
781 return;
782 }
783 /* Quiescent state needed on some other CPU, send IPI. */
784 ret = smp_call_function_single(cpu, rcu_exp_handler, NULL, 0);
785 put_cpu();
786 WARN_ON_ONCE(ret);
787 }
788
789 /*
790 * Because preemptible RCU does not exist, we never have to check for
791 * tasks blocked within RCU read-side critical sections that are
792 * blocking the current expedited grace period.
793 */
rcu_print_task_exp_stall(struct rcu_node * rnp)794 static int rcu_print_task_exp_stall(struct rcu_node *rnp)
795 {
796 return 0;
797 }
798
799 #endif /* #else #ifdef CONFIG_PREEMPT_RCU */
800
801 /**
802 * synchronize_rcu_expedited - Brute-force RCU grace period
803 *
804 * Wait for an RCU grace period, but expedite it. The basic idea is to
805 * IPI all non-idle non-nohz online CPUs. The IPI handler checks whether
806 * the CPU is in an RCU critical section, and if so, it sets a flag that
807 * causes the outermost rcu_read_unlock() to report the quiescent state
808 * for RCU-preempt or asks the scheduler for help for RCU-sched. On the
809 * other hand, if the CPU is not in an RCU read-side critical section,
810 * the IPI handler reports the quiescent state immediately.
811 *
812 * Although this is a great improvement over previous expedited
813 * implementations, it is still unfriendly to real-time workloads, so is
814 * thus not recommended for any sort of common-case code. In fact, if
815 * you are using synchronize_rcu_expedited() in a loop, please restructure
816 * your code to batch your updates, and then use a single synchronize_rcu()
817 * instead.
818 *
819 * This has the same semantics as (but is more brutal than) synchronize_rcu().
820 */
synchronize_rcu_expedited(void)821 void synchronize_rcu_expedited(void)
822 {
823 bool no_wq;
824 struct rcu_exp_work rew;
825 struct rcu_node *rnp;
826 unsigned long s;
827
828 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
829 lock_is_held(&rcu_lock_map) ||
830 lock_is_held(&rcu_sched_lock_map),
831 "Illegal synchronize_rcu_expedited() in RCU read-side critical section");
832
833 /* Is the state is such that the call is a grace period? */
834 if (rcu_blocking_is_gp())
835 return;
836
837 /* If expedited grace periods are prohibited, fall back to normal. */
838 if (rcu_gp_is_normal()) {
839 wait_rcu_gp(call_rcu);
840 return;
841 }
842
843 /* Take a snapshot of the sequence number. */
844 s = rcu_exp_gp_seq_snap();
845 if (exp_funnel_lock(s))
846 return; /* Someone else did our work for us. */
847
848 /* Don't use workqueue during boot or from an incoming CPU. */
849 preempt_disable();
850 no_wq = rcu_scheduler_active == RCU_SCHEDULER_INIT ||
851 !cpumask_test_cpu(smp_processor_id(), cpu_active_mask);
852 preempt_enable();
853
854 /* Ensure that load happens before action based on it. */
855 if (unlikely(no_wq)) {
856 /* Direct call for scheduler init, early_initcall()s, and incoming CPUs. */
857 rcu_exp_sel_wait_wake(s);
858 } else {
859 /* Marshall arguments & schedule the expedited grace period. */
860 rew.rew_s = s;
861 INIT_WORK_ONSTACK(&rew.rew_work, wait_rcu_exp_gp);
862 queue_work(rcu_gp_wq, &rew.rew_work);
863 }
864
865 /* Wait for expedited grace period to complete. */
866 rnp = rcu_get_root();
867 wait_event(rnp->exp_wq[rcu_seq_ctr(s) & 0x3],
868 sync_exp_work_done(s));
869 smp_mb(); /* Workqueue actions happen before return. */
870
871 /* Let the next expedited grace period start. */
872 mutex_unlock(&rcu_state.exp_mutex);
873
874 if (likely(!no_wq))
875 destroy_work_on_stack(&rew.rew_work);
876 }
877 EXPORT_SYMBOL_GPL(synchronize_rcu_expedited);
878