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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 */ 256 static void rcu_report_exp_rdp(struct rcu_data *rdp) 257 { 258 WRITE_ONCE(rdp->cpu_no_qs.b.exp, false); 259 rcu_report_exp_cpu_mult(rdp->mynode, rdp->grpmask, true); 260 } 261 262 /* Common code for work-done checking. */ 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 */ 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 */ 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 */ 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 */ 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 */ 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 mask = READ_ONCE(rnp->expmask); 506 for_each_leaf_node_cpu_mask(rnp, cpu, mask) { 507 rdp = per_cpu_ptr(&rcu_data, cpu); 508 if (rdp->rcu_forced_tick_exp) 509 continue; 510 rdp->rcu_forced_tick_exp = true; 511 preempt_disable(); 512 if (cpu_online(cpu)) 513 tick_dep_set_cpu(cpu, TICK_DEP_BIT_RCU_EXP); 514 preempt_enable(); 515 } 516 } 517 j = READ_ONCE(jiffies_till_first_fqs); 518 if (synchronize_rcu_expedited_wait_once(j + HZ)) 519 return; 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 (internal RCU debug):"); 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 dump_cpu_task(cpu); 572 } 573 } 574 jiffies_stall = 3 * rcu_jiffies_till_stall_check() + 3; 575 } 576 } 577 578 /* 579 * Wait for the current expedited grace period to complete, and then 580 * wake up everyone who piggybacked on the just-completed expedited 581 * grace period. Also update all the ->exp_seq_rq counters as needed 582 * in order to avoid counter-wrap problems. 583 */ 584 static void rcu_exp_wait_wake(unsigned long s) 585 { 586 struct rcu_node *rnp; 587 588 synchronize_rcu_expedited_wait(); 589 590 // Switch over to wakeup mode, allowing the next GP to proceed. 591 // End the previous grace period only after acquiring the mutex 592 // to ensure that only one GP runs concurrently with wakeups. 593 mutex_lock(&rcu_state.exp_wake_mutex); 594 rcu_exp_gp_seq_end(); 595 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("end")); 596 597 rcu_for_each_node_breadth_first(rnp) { 598 if (ULONG_CMP_LT(READ_ONCE(rnp->exp_seq_rq), s)) { 599 spin_lock(&rnp->exp_lock); 600 /* Recheck, avoid hang in case someone just arrived. */ 601 if (ULONG_CMP_LT(rnp->exp_seq_rq, s)) 602 WRITE_ONCE(rnp->exp_seq_rq, s); 603 spin_unlock(&rnp->exp_lock); 604 } 605 smp_mb(); /* All above changes before wakeup. */ 606 wake_up_all(&rnp->exp_wq[rcu_seq_ctr(s) & 0x3]); 607 } 608 trace_rcu_exp_grace_period(rcu_state.name, s, TPS("endwake")); 609 mutex_unlock(&rcu_state.exp_wake_mutex); 610 } 611 612 /* 613 * Common code to drive an expedited grace period forward, used by 614 * workqueues and mid-boot-time tasks. 615 */ 616 static void rcu_exp_sel_wait_wake(unsigned long s) 617 { 618 /* Initialize the rcu_node tree in preparation for the wait. */ 619 sync_rcu_exp_select_cpus(); 620 621 /* Wait and clean up, including waking everyone. */ 622 rcu_exp_wait_wake(s); 623 } 624 625 /* 626 * Work-queue handler to drive an expedited grace period forward. 627 */ 628 static void wait_rcu_exp_gp(struct work_struct *wp) 629 { 630 struct rcu_exp_work *rewp; 631 632 rewp = container_of(wp, struct rcu_exp_work, rew_work); 633 rcu_exp_sel_wait_wake(rewp->rew_s); 634 } 635 636 #ifdef CONFIG_PREEMPT_RCU 637 638 /* 639 * Remote handler for smp_call_function_single(). If there is an 640 * RCU read-side critical section in effect, request that the 641 * next rcu_read_unlock() record the quiescent state up the 642 * ->expmask fields in the rcu_node tree. Otherwise, immediately 643 * report the quiescent state. 644 */ 645 static void rcu_exp_handler(void *unused) 646 { 647 int depth = rcu_preempt_depth(); 648 unsigned long flags; 649 struct rcu_data *rdp = this_cpu_ptr(&rcu_data); 650 struct rcu_node *rnp = rdp->mynode; 651 struct task_struct *t = current; 652 653 /* 654 * First, the common case of not being in an RCU read-side 655 * critical section. If also enabled or idle, immediately 656 * report the quiescent state, otherwise defer. 657 */ 658 if (!depth) { 659 if (!(preempt_count() & (PREEMPT_MASK | SOFTIRQ_MASK)) || 660 rcu_is_cpu_rrupt_from_idle()) { 661 rcu_report_exp_rdp(rdp); 662 } else { 663 WRITE_ONCE(rdp->cpu_no_qs.b.exp, true); 664 set_tsk_need_resched(t); 665 set_preempt_need_resched(); 666 } 667 return; 668 } 669 670 /* 671 * Second, the less-common case of being in an RCU read-side 672 * critical section. In this case we can count on a future 673 * rcu_read_unlock(). However, this rcu_read_unlock() might 674 * execute on some other CPU, but in that case there will be 675 * a future context switch. Either way, if the expedited 676 * grace period is still waiting on this CPU, set ->deferred_qs 677 * so that the eventual quiescent state will be reported. 678 * Note that there is a large group of race conditions that 679 * can have caused this quiescent state to already have been 680 * reported, so we really do need to check ->expmask. 681 */ 682 if (depth > 0) { 683 raw_spin_lock_irqsave_rcu_node(rnp, flags); 684 if (rnp->expmask & rdp->grpmask) { 685 WRITE_ONCE(rdp->cpu_no_qs.b.exp, true); 686 t->rcu_read_unlock_special.b.exp_hint = true; 687 } 688 raw_spin_unlock_irqrestore_rcu_node(rnp, flags); 689 return; 690 } 691 692 // Finally, negative nesting depth should not happen. 693 WARN_ON_ONCE(1); 694 } 695 696 /* PREEMPTION=y, so no PREEMPTION=n expedited grace period to clean up after. */ 697 static void sync_sched_exp_online_cleanup(int cpu) 698 { 699 } 700 701 /* 702 * Scan the current list of tasks blocked within RCU read-side critical 703 * sections, printing out the tid of each that is blocking the current 704 * expedited grace period. 705 */ 706 static int rcu_print_task_exp_stall(struct rcu_node *rnp) 707 { 708 unsigned long flags; 709 int ndetected = 0; 710 struct task_struct *t; 711 712 if (!READ_ONCE(rnp->exp_tasks)) 713 return 0; 714 raw_spin_lock_irqsave_rcu_node(rnp, flags); 715 t = list_entry(rnp->exp_tasks->prev, 716 struct task_struct, rcu_node_entry); 717 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { 718 pr_cont(" P%d", t->pid); 719 ndetected++; 720 } 721 raw_spin_unlock_irqrestore_rcu_node(rnp, flags); 722 return ndetected; 723 } 724 725 #else /* #ifdef CONFIG_PREEMPT_RCU */ 726 727 /* Request an expedited quiescent state. */ 728 static void rcu_exp_need_qs(void) 729 { 730 __this_cpu_write(rcu_data.cpu_no_qs.b.exp, true); 731 /* Store .exp before .rcu_urgent_qs. */ 732 smp_store_release(this_cpu_ptr(&rcu_data.rcu_urgent_qs), true); 733 set_tsk_need_resched(current); 734 set_preempt_need_resched(); 735 } 736 737 /* Invoked on each online non-idle CPU for expedited quiescent state. */ 738 static void rcu_exp_handler(void *unused) 739 { 740 struct rcu_data *rdp = this_cpu_ptr(&rcu_data); 741 struct rcu_node *rnp = rdp->mynode; 742 743 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) || 744 __this_cpu_read(rcu_data.cpu_no_qs.b.exp)) 745 return; 746 if (rcu_is_cpu_rrupt_from_idle()) { 747 rcu_report_exp_rdp(this_cpu_ptr(&rcu_data)); 748 return; 749 } 750 rcu_exp_need_qs(); 751 } 752 753 /* Send IPI for expedited cleanup if needed at end of CPU-hotplug operation. */ 754 static void sync_sched_exp_online_cleanup(int cpu) 755 { 756 unsigned long flags; 757 int my_cpu; 758 struct rcu_data *rdp; 759 int ret; 760 struct rcu_node *rnp; 761 762 rdp = per_cpu_ptr(&rcu_data, cpu); 763 rnp = rdp->mynode; 764 my_cpu = get_cpu(); 765 /* Quiescent state either not needed or already requested, leave. */ 766 if (!(READ_ONCE(rnp->expmask) & rdp->grpmask) || 767 READ_ONCE(rdp->cpu_no_qs.b.exp)) { 768 put_cpu(); 769 return; 770 } 771 /* Quiescent state needed on current CPU, so set it up locally. */ 772 if (my_cpu == cpu) { 773 local_irq_save(flags); 774 rcu_exp_need_qs(); 775 local_irq_restore(flags); 776 put_cpu(); 777 return; 778 } 779 /* Quiescent state needed on some other CPU, send IPI. */ 780 ret = smp_call_function_single(cpu, rcu_exp_handler, NULL, 0); 781 put_cpu(); 782 WARN_ON_ONCE(ret); 783 } 784 785 /* 786 * Because preemptible RCU does not exist, we never have to check for 787 * tasks blocked within RCU read-side critical sections that are 788 * blocking the current expedited grace period. 789 */ 790 static int rcu_print_task_exp_stall(struct rcu_node *rnp) 791 { 792 return 0; 793 } 794 795 #endif /* #else #ifdef CONFIG_PREEMPT_RCU */ 796 797 /** 798 * synchronize_rcu_expedited - Brute-force RCU grace period 799 * 800 * Wait for an RCU grace period, but expedite it. The basic idea is to 801 * IPI all non-idle non-nohz online CPUs. The IPI handler checks whether 802 * the CPU is in an RCU critical section, and if so, it sets a flag that 803 * causes the outermost rcu_read_unlock() to report the quiescent state 804 * for RCU-preempt or asks the scheduler for help for RCU-sched. On the 805 * other hand, if the CPU is not in an RCU read-side critical section, 806 * the IPI handler reports the quiescent state immediately. 807 * 808 * Although this is a great improvement over previous expedited 809 * implementations, it is still unfriendly to real-time workloads, so is 810 * thus not recommended for any sort of common-case code. In fact, if 811 * you are using synchronize_rcu_expedited() in a loop, please restructure 812 * your code to batch your updates, and then use a single synchronize_rcu() 813 * instead. 814 * 815 * This has the same semantics as (but is more brutal than) synchronize_rcu(). 816 */ 817 void synchronize_rcu_expedited(void) 818 { 819 bool boottime = (rcu_scheduler_active == RCU_SCHEDULER_INIT); 820 struct rcu_exp_work rew; 821 struct rcu_node *rnp; 822 unsigned long s; 823 824 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) || 825 lock_is_held(&rcu_lock_map) || 826 lock_is_held(&rcu_sched_lock_map), 827 "Illegal synchronize_rcu_expedited() in RCU read-side critical section"); 828 829 /* Is the state is such that the call is a grace period? */ 830 if (rcu_blocking_is_gp()) 831 return; 832 833 /* If expedited grace periods are prohibited, fall back to normal. */ 834 if (rcu_gp_is_normal()) { 835 wait_rcu_gp(call_rcu); 836 return; 837 } 838 839 /* Take a snapshot of the sequence number. */ 840 s = rcu_exp_gp_seq_snap(); 841 if (exp_funnel_lock(s)) 842 return; /* Someone else did our work for us. */ 843 844 /* Ensure that load happens before action based on it. */ 845 if (unlikely(boottime)) { 846 /* Direct call during scheduler init and early_initcalls(). */ 847 rcu_exp_sel_wait_wake(s); 848 } else { 849 /* Marshall arguments & schedule the expedited grace period. */ 850 rew.rew_s = s; 851 INIT_WORK_ONSTACK(&rew.rew_work, wait_rcu_exp_gp); 852 queue_work(rcu_gp_wq, &rew.rew_work); 853 } 854 855 /* Wait for expedited grace period to complete. */ 856 rnp = rcu_get_root(); 857 wait_event(rnp->exp_wq[rcu_seq_ctr(s) & 0x3], 858 sync_exp_work_done(s)); 859 smp_mb(); /* Workqueue actions happen before return. */ 860 861 /* Let the next expedited grace period start. */ 862 mutex_unlock(&rcu_state.exp_mutex); 863 864 if (likely(!boottime)) 865 destroy_work_on_stack(&rew.rew_work); 866 } 867 EXPORT_SYMBOL_GPL(synchronize_rcu_expedited); 868