1 /* 2 * Read-Copy Update mechanism for mutual exclusion 3 * 4 * This program is free software; you can redistribute it and/or modify 5 * it under the terms of the GNU General Public License as published by 6 * the Free Software Foundation; either version 2 of the License, or 7 * (at your option) any later version. 8 * 9 * This program is distributed in the hope that it will be useful, 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 * GNU General Public License for more details. 13 * 14 * You should have received a copy of the GNU General Public License 15 * along with this program; if not, you can access it online at 16 * http://www.gnu.org/licenses/gpl-2.0.html. 17 * 18 * Copyright IBM Corporation, 2001 19 * 20 * Author: Dipankar Sarma <[email protected]> 21 * 22 * Based on the original work by Paul McKenney <[email protected]> 23 * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen. 24 * Papers: 25 * http://www.rdrop.com/users/paulmck/paper/rclockpdcsproof.pdf 26 * http://lse.sourceforge.net/locking/rclock_OLS.2001.05.01c.sc.pdf (OLS2001) 27 * 28 * For detailed explanation of Read-Copy Update mechanism see - 29 * http://lse.sourceforge.net/locking/rcupdate.html 30 * 31 */ 32 33 #ifndef __LINUX_RCUPDATE_H 34 #define __LINUX_RCUPDATE_H 35 36 #include <linux/types.h> 37 #include <linux/cache.h> 38 #include <linux/spinlock.h> 39 #include <linux/threads.h> 40 #include <linux/cpumask.h> 41 #include <linux/seqlock.h> 42 #include <linux/lockdep.h> 43 #include <linux/debugobjects.h> 44 #include <linux/bug.h> 45 #include <linux/compiler.h> 46 #include <linux/ktime.h> 47 #include <linux/irqflags.h> 48 49 #include <asm/barrier.h> 50 51 #ifndef CONFIG_TINY_RCU 52 extern int rcu_expedited; /* for sysctl */ 53 extern int rcu_normal; /* also for sysctl */ 54 #endif /* #ifndef CONFIG_TINY_RCU */ 55 56 #ifdef CONFIG_TINY_RCU 57 /* Tiny RCU doesn't expedite, as its purpose in life is instead to be tiny. */ 58 static inline bool rcu_gp_is_normal(void) /* Internal RCU use. */ 59 { 60 return true; 61 } 62 static inline bool rcu_gp_is_expedited(void) /* Internal RCU use. */ 63 { 64 return false; 65 } 66 67 static inline void rcu_expedite_gp(void) 68 { 69 } 70 71 static inline void rcu_unexpedite_gp(void) 72 { 73 } 74 #else /* #ifdef CONFIG_TINY_RCU */ 75 bool rcu_gp_is_normal(void); /* Internal RCU use. */ 76 bool rcu_gp_is_expedited(void); /* Internal RCU use. */ 77 void rcu_expedite_gp(void); 78 void rcu_unexpedite_gp(void); 79 #endif /* #else #ifdef CONFIG_TINY_RCU */ 80 81 enum rcutorture_type { 82 RCU_FLAVOR, 83 RCU_BH_FLAVOR, 84 RCU_SCHED_FLAVOR, 85 RCU_TASKS_FLAVOR, 86 SRCU_FLAVOR, 87 INVALID_RCU_FLAVOR 88 }; 89 90 #if defined(CONFIG_TREE_RCU) || defined(CONFIG_PREEMPT_RCU) 91 void rcutorture_get_gp_data(enum rcutorture_type test_type, int *flags, 92 unsigned long *gpnum, unsigned long *completed); 93 void rcutorture_record_test_transition(void); 94 void rcutorture_record_progress(unsigned long vernum); 95 void do_trace_rcu_torture_read(const char *rcutorturename, 96 struct rcu_head *rhp, 97 unsigned long secs, 98 unsigned long c_old, 99 unsigned long c); 100 bool rcu_irq_enter_disabled(void); 101 #else 102 static inline void rcutorture_get_gp_data(enum rcutorture_type test_type, 103 int *flags, 104 unsigned long *gpnum, 105 unsigned long *completed) 106 { 107 *flags = 0; 108 *gpnum = 0; 109 *completed = 0; 110 } 111 static inline void rcutorture_record_test_transition(void) 112 { 113 } 114 static inline void rcutorture_record_progress(unsigned long vernum) 115 { 116 } 117 static inline bool rcu_irq_enter_disabled(void) 118 { 119 return false; 120 } 121 #ifdef CONFIG_RCU_TRACE 122 void do_trace_rcu_torture_read(const char *rcutorturename, 123 struct rcu_head *rhp, 124 unsigned long secs, 125 unsigned long c_old, 126 unsigned long c); 127 #else 128 #define do_trace_rcu_torture_read(rcutorturename, rhp, secs, c_old, c) \ 129 do { } while (0) 130 #endif 131 #endif 132 133 #define UINT_CMP_GE(a, b) (UINT_MAX / 2 >= (a) - (b)) 134 #define UINT_CMP_LT(a, b) (UINT_MAX / 2 < (a) - (b)) 135 #define ULONG_CMP_GE(a, b) (ULONG_MAX / 2 >= (a) - (b)) 136 #define ULONG_CMP_LT(a, b) (ULONG_MAX / 2 < (a) - (b)) 137 #define ulong2long(a) (*(long *)(&(a))) 138 139 /* Exported common interfaces */ 140 141 #ifdef CONFIG_PREEMPT_RCU 142 143 /** 144 * call_rcu() - Queue an RCU callback for invocation after a grace period. 145 * @head: structure to be used for queueing the RCU updates. 146 * @func: actual callback function to be invoked after the grace period 147 * 148 * The callback function will be invoked some time after a full grace 149 * period elapses, in other words after all pre-existing RCU read-side 150 * critical sections have completed. However, the callback function 151 * might well execute concurrently with RCU read-side critical sections 152 * that started after call_rcu() was invoked. RCU read-side critical 153 * sections are delimited by rcu_read_lock() and rcu_read_unlock(), 154 * and may be nested. 155 * 156 * Note that all CPUs must agree that the grace period extended beyond 157 * all pre-existing RCU read-side critical section. On systems with more 158 * than one CPU, this means that when "func()" is invoked, each CPU is 159 * guaranteed to have executed a full memory barrier since the end of its 160 * last RCU read-side critical section whose beginning preceded the call 161 * to call_rcu(). It also means that each CPU executing an RCU read-side 162 * critical section that continues beyond the start of "func()" must have 163 * executed a memory barrier after the call_rcu() but before the beginning 164 * of that RCU read-side critical section. Note that these guarantees 165 * include CPUs that are offline, idle, or executing in user mode, as 166 * well as CPUs that are executing in the kernel. 167 * 168 * Furthermore, if CPU A invoked call_rcu() and CPU B invoked the 169 * resulting RCU callback function "func()", then both CPU A and CPU B are 170 * guaranteed to execute a full memory barrier during the time interval 171 * between the call to call_rcu() and the invocation of "func()" -- even 172 * if CPU A and CPU B are the same CPU (but again only if the system has 173 * more than one CPU). 174 */ 175 void call_rcu(struct rcu_head *head, 176 rcu_callback_t func); 177 178 #else /* #ifdef CONFIG_PREEMPT_RCU */ 179 180 /* In classic RCU, call_rcu() is just call_rcu_sched(). */ 181 #define call_rcu call_rcu_sched 182 183 #endif /* #else #ifdef CONFIG_PREEMPT_RCU */ 184 185 /** 186 * call_rcu_bh() - Queue an RCU for invocation after a quicker grace period. 187 * @head: structure to be used for queueing the RCU updates. 188 * @func: actual callback function to be invoked after the grace period 189 * 190 * The callback function will be invoked some time after a full grace 191 * period elapses, in other words after all currently executing RCU 192 * read-side critical sections have completed. call_rcu_bh() assumes 193 * that the read-side critical sections end on completion of a softirq 194 * handler. This means that read-side critical sections in process 195 * context must not be interrupted by softirqs. This interface is to be 196 * used when most of the read-side critical sections are in softirq context. 197 * RCU read-side critical sections are delimited by : 198 * - rcu_read_lock() and rcu_read_unlock(), if in interrupt context. 199 * OR 200 * - rcu_read_lock_bh() and rcu_read_unlock_bh(), if in process context. 201 * These may be nested. 202 * 203 * See the description of call_rcu() for more detailed information on 204 * memory ordering guarantees. 205 */ 206 void call_rcu_bh(struct rcu_head *head, 207 rcu_callback_t func); 208 209 /** 210 * call_rcu_sched() - Queue an RCU for invocation after sched grace period. 211 * @head: structure to be used for queueing the RCU updates. 212 * @func: actual callback function to be invoked after the grace period 213 * 214 * The callback function will be invoked some time after a full grace 215 * period elapses, in other words after all currently executing RCU 216 * read-side critical sections have completed. call_rcu_sched() assumes 217 * that the read-side critical sections end on enabling of preemption 218 * or on voluntary preemption. 219 * RCU read-side critical sections are delimited by : 220 * - rcu_read_lock_sched() and rcu_read_unlock_sched(), 221 * OR 222 * anything that disables preemption. 223 * These may be nested. 224 * 225 * See the description of call_rcu() for more detailed information on 226 * memory ordering guarantees. 227 */ 228 void call_rcu_sched(struct rcu_head *head, 229 rcu_callback_t func); 230 231 void synchronize_sched(void); 232 233 /** 234 * call_rcu_tasks() - Queue an RCU for invocation task-based grace period 235 * @head: structure to be used for queueing the RCU updates. 236 * @func: actual callback function to be invoked after the grace period 237 * 238 * The callback function will be invoked some time after a full grace 239 * period elapses, in other words after all currently executing RCU 240 * read-side critical sections have completed. call_rcu_tasks() assumes 241 * that the read-side critical sections end at a voluntary context 242 * switch (not a preemption!), entry into idle, or transition to usermode 243 * execution. As such, there are no read-side primitives analogous to 244 * rcu_read_lock() and rcu_read_unlock() because this primitive is intended 245 * to determine that all tasks have passed through a safe state, not so 246 * much for data-strcuture synchronization. 247 * 248 * See the description of call_rcu() for more detailed information on 249 * memory ordering guarantees. 250 */ 251 void call_rcu_tasks(struct rcu_head *head, rcu_callback_t func); 252 void synchronize_rcu_tasks(void); 253 void rcu_barrier_tasks(void); 254 255 #ifdef CONFIG_PREEMPT_RCU 256 257 void __rcu_read_lock(void); 258 void __rcu_read_unlock(void); 259 void rcu_read_unlock_special(struct task_struct *t); 260 void synchronize_rcu(void); 261 262 /* 263 * Defined as a macro as it is a very low level header included from 264 * areas that don't even know about current. This gives the rcu_read_lock() 265 * nesting depth, but makes sense only if CONFIG_PREEMPT_RCU -- in other 266 * types of kernel builds, the rcu_read_lock() nesting depth is unknowable. 267 */ 268 #define rcu_preempt_depth() (current->rcu_read_lock_nesting) 269 270 #else /* #ifdef CONFIG_PREEMPT_RCU */ 271 272 static inline void __rcu_read_lock(void) 273 { 274 if (IS_ENABLED(CONFIG_PREEMPT_COUNT)) 275 preempt_disable(); 276 } 277 278 static inline void __rcu_read_unlock(void) 279 { 280 if (IS_ENABLED(CONFIG_PREEMPT_COUNT)) 281 preempt_enable(); 282 } 283 284 static inline void synchronize_rcu(void) 285 { 286 synchronize_sched(); 287 } 288 289 static inline int rcu_preempt_depth(void) 290 { 291 return 0; 292 } 293 294 #endif /* #else #ifdef CONFIG_PREEMPT_RCU */ 295 296 /* Internal to kernel */ 297 void rcu_init(void); 298 void rcu_sched_qs(void); 299 void rcu_bh_qs(void); 300 void rcu_check_callbacks(int user); 301 void rcu_report_dead(unsigned int cpu); 302 void rcu_cpu_starting(unsigned int cpu); 303 304 #ifndef CONFIG_TINY_RCU 305 void rcu_end_inkernel_boot(void); 306 #else /* #ifndef CONFIG_TINY_RCU */ 307 static inline void rcu_end_inkernel_boot(void) { } 308 #endif /* #ifndef CONFIG_TINY_RCU */ 309 310 #ifdef CONFIG_RCU_STALL_COMMON 311 void rcu_sysrq_start(void); 312 void rcu_sysrq_end(void); 313 #else /* #ifdef CONFIG_RCU_STALL_COMMON */ 314 static inline void rcu_sysrq_start(void) 315 { 316 } 317 static inline void rcu_sysrq_end(void) 318 { 319 } 320 #endif /* #else #ifdef CONFIG_RCU_STALL_COMMON */ 321 322 #ifdef CONFIG_NO_HZ_FULL 323 void rcu_user_enter(void); 324 void rcu_user_exit(void); 325 #else 326 static inline void rcu_user_enter(void) { } 327 static inline void rcu_user_exit(void) { } 328 #endif /* CONFIG_NO_HZ_FULL */ 329 330 #ifdef CONFIG_RCU_NOCB_CPU 331 void rcu_init_nohz(void); 332 #else /* #ifdef CONFIG_RCU_NOCB_CPU */ 333 static inline void rcu_init_nohz(void) 334 { 335 } 336 #endif /* #else #ifdef CONFIG_RCU_NOCB_CPU */ 337 338 /** 339 * RCU_NONIDLE - Indicate idle-loop code that needs RCU readers 340 * @a: Code that RCU needs to pay attention to. 341 * 342 * RCU, RCU-bh, and RCU-sched read-side critical sections are forbidden 343 * in the inner idle loop, that is, between the rcu_idle_enter() and 344 * the rcu_idle_exit() -- RCU will happily ignore any such read-side 345 * critical sections. However, things like powertop need tracepoints 346 * in the inner idle loop. 347 * 348 * This macro provides the way out: RCU_NONIDLE(do_something_with_RCU()) 349 * will tell RCU that it needs to pay attention, invoke its argument 350 * (in this example, calling the do_something_with_RCU() function), 351 * and then tell RCU to go back to ignoring this CPU. It is permissible 352 * to nest RCU_NONIDLE() wrappers, but not indefinitely (but the limit is 353 * on the order of a million or so, even on 32-bit systems). It is 354 * not legal to block within RCU_NONIDLE(), nor is it permissible to 355 * transfer control either into or out of RCU_NONIDLE()'s statement. 356 */ 357 #define RCU_NONIDLE(a) \ 358 do { \ 359 rcu_irq_enter_irqson(); \ 360 do { a; } while (0); \ 361 rcu_irq_exit_irqson(); \ 362 } while (0) 363 364 /* 365 * Note a voluntary context switch for RCU-tasks benefit. This is a 366 * macro rather than an inline function to avoid #include hell. 367 */ 368 #ifdef CONFIG_TASKS_RCU 369 #define TASKS_RCU(x) x 370 extern struct srcu_struct tasks_rcu_exit_srcu; 371 #define rcu_note_voluntary_context_switch(t) \ 372 do { \ 373 rcu_all_qs(); \ 374 if (READ_ONCE((t)->rcu_tasks_holdout)) \ 375 WRITE_ONCE((t)->rcu_tasks_holdout, false); \ 376 } while (0) 377 #else /* #ifdef CONFIG_TASKS_RCU */ 378 #define TASKS_RCU(x) do { } while (0) 379 #define rcu_note_voluntary_context_switch(t) rcu_all_qs() 380 #endif /* #else #ifdef CONFIG_TASKS_RCU */ 381 382 /** 383 * cond_resched_rcu_qs - Report potential quiescent states to RCU 384 * 385 * This macro resembles cond_resched(), except that it is defined to 386 * report potential quiescent states to RCU-tasks even if the cond_resched() 387 * machinery were to be shut off, as some advocate for PREEMPT kernels. 388 */ 389 #define cond_resched_rcu_qs() \ 390 do { \ 391 if (!cond_resched()) \ 392 rcu_note_voluntary_context_switch(current); \ 393 } while (0) 394 395 #if defined(CONFIG_DEBUG_LOCK_ALLOC) || defined(CONFIG_RCU_TRACE) || defined(CONFIG_SMP) 396 bool __rcu_is_watching(void); 397 #endif /* #if defined(CONFIG_DEBUG_LOCK_ALLOC) || defined(CONFIG_RCU_TRACE) || defined(CONFIG_SMP) */ 398 399 /* 400 * Infrastructure to implement the synchronize_() primitives in 401 * TREE_RCU and rcu_barrier_() primitives in TINY_RCU. 402 */ 403 404 #if defined(CONFIG_TREE_RCU) || defined(CONFIG_PREEMPT_RCU) 405 #include <linux/rcutree.h> 406 #elif defined(CONFIG_TINY_RCU) 407 #include <linux/rcutiny.h> 408 #else 409 #error "Unknown RCU implementation specified to kernel configuration" 410 #endif 411 412 #define RCU_SCHEDULER_INACTIVE 0 413 #define RCU_SCHEDULER_INIT 1 414 #define RCU_SCHEDULER_RUNNING 2 415 416 /* 417 * init_rcu_head_on_stack()/destroy_rcu_head_on_stack() are needed for dynamic 418 * initialization and destruction of rcu_head on the stack. rcu_head structures 419 * allocated dynamically in the heap or defined statically don't need any 420 * initialization. 421 */ 422 #ifdef CONFIG_DEBUG_OBJECTS_RCU_HEAD 423 void init_rcu_head(struct rcu_head *head); 424 void destroy_rcu_head(struct rcu_head *head); 425 void init_rcu_head_on_stack(struct rcu_head *head); 426 void destroy_rcu_head_on_stack(struct rcu_head *head); 427 #else /* !CONFIG_DEBUG_OBJECTS_RCU_HEAD */ 428 static inline void init_rcu_head(struct rcu_head *head) 429 { 430 } 431 432 static inline void destroy_rcu_head(struct rcu_head *head) 433 { 434 } 435 436 static inline void init_rcu_head_on_stack(struct rcu_head *head) 437 { 438 } 439 440 static inline void destroy_rcu_head_on_stack(struct rcu_head *head) 441 { 442 } 443 #endif /* #else !CONFIG_DEBUG_OBJECTS_RCU_HEAD */ 444 445 #if defined(CONFIG_HOTPLUG_CPU) && defined(CONFIG_PROVE_RCU) 446 bool rcu_lockdep_current_cpu_online(void); 447 #else /* #if defined(CONFIG_HOTPLUG_CPU) && defined(CONFIG_PROVE_RCU) */ 448 static inline bool rcu_lockdep_current_cpu_online(void) 449 { 450 return true; 451 } 452 #endif /* #else #if defined(CONFIG_HOTPLUG_CPU) && defined(CONFIG_PROVE_RCU) */ 453 454 #ifdef CONFIG_DEBUG_LOCK_ALLOC 455 456 static inline void rcu_lock_acquire(struct lockdep_map *map) 457 { 458 lock_acquire(map, 0, 0, 2, 0, NULL, _THIS_IP_); 459 } 460 461 static inline void rcu_lock_release(struct lockdep_map *map) 462 { 463 lock_release(map, 1, _THIS_IP_); 464 } 465 466 extern struct lockdep_map rcu_lock_map; 467 extern struct lockdep_map rcu_bh_lock_map; 468 extern struct lockdep_map rcu_sched_lock_map; 469 extern struct lockdep_map rcu_callback_map; 470 int debug_lockdep_rcu_enabled(void); 471 472 int rcu_read_lock_held(void); 473 int rcu_read_lock_bh_held(void); 474 475 /** 476 * rcu_read_lock_sched_held() - might we be in RCU-sched read-side critical section? 477 * 478 * If CONFIG_DEBUG_LOCK_ALLOC is selected, returns nonzero iff in an 479 * RCU-sched read-side critical section. In absence of 480 * CONFIG_DEBUG_LOCK_ALLOC, this assumes we are in an RCU-sched read-side 481 * critical section unless it can prove otherwise. 482 */ 483 int rcu_read_lock_sched_held(void); 484 485 #else /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */ 486 487 # define rcu_lock_acquire(a) do { } while (0) 488 # define rcu_lock_release(a) do { } while (0) 489 490 static inline int rcu_read_lock_held(void) 491 { 492 return 1; 493 } 494 495 static inline int rcu_read_lock_bh_held(void) 496 { 497 return 1; 498 } 499 500 static inline int rcu_read_lock_sched_held(void) 501 { 502 return !preemptible(); 503 } 504 #endif /* #else #ifdef CONFIG_DEBUG_LOCK_ALLOC */ 505 506 #ifdef CONFIG_PROVE_RCU 507 508 /** 509 * RCU_LOCKDEP_WARN - emit lockdep splat if specified condition is met 510 * @c: condition to check 511 * @s: informative message 512 */ 513 #define RCU_LOCKDEP_WARN(c, s) \ 514 do { \ 515 static bool __section(.data.unlikely) __warned; \ 516 if (debug_lockdep_rcu_enabled() && !__warned && (c)) { \ 517 __warned = true; \ 518 lockdep_rcu_suspicious(__FILE__, __LINE__, s); \ 519 } \ 520 } while (0) 521 522 #if defined(CONFIG_PROVE_RCU) && !defined(CONFIG_PREEMPT_RCU) 523 static inline void rcu_preempt_sleep_check(void) 524 { 525 RCU_LOCKDEP_WARN(lock_is_held(&rcu_lock_map), 526 "Illegal context switch in RCU read-side critical section"); 527 } 528 #else /* #ifdef CONFIG_PROVE_RCU */ 529 static inline void rcu_preempt_sleep_check(void) 530 { 531 } 532 #endif /* #else #ifdef CONFIG_PROVE_RCU */ 533 534 #define rcu_sleep_check() \ 535 do { \ 536 rcu_preempt_sleep_check(); \ 537 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map), \ 538 "Illegal context switch in RCU-bh read-side critical section"); \ 539 RCU_LOCKDEP_WARN(lock_is_held(&rcu_sched_lock_map), \ 540 "Illegal context switch in RCU-sched read-side critical section"); \ 541 } while (0) 542 543 #else /* #ifdef CONFIG_PROVE_RCU */ 544 545 #define RCU_LOCKDEP_WARN(c, s) do { } while (0) 546 #define rcu_sleep_check() do { } while (0) 547 548 #endif /* #else #ifdef CONFIG_PROVE_RCU */ 549 550 /* 551 * Helper functions for rcu_dereference_check(), rcu_dereference_protected() 552 * and rcu_assign_pointer(). Some of these could be folded into their 553 * callers, but they are left separate in order to ease introduction of 554 * multiple flavors of pointers to match the multiple flavors of RCU 555 * (e.g., __rcu_bh, * __rcu_sched, and __srcu), should this make sense in 556 * the future. 557 */ 558 559 #ifdef __CHECKER__ 560 #define rcu_dereference_sparse(p, space) \ 561 ((void)(((typeof(*p) space *)p) == p)) 562 #else /* #ifdef __CHECKER__ */ 563 #define rcu_dereference_sparse(p, space) 564 #endif /* #else #ifdef __CHECKER__ */ 565 566 #define __rcu_access_pointer(p, space) \ 567 ({ \ 568 typeof(*p) *_________p1 = (typeof(*p) *__force)READ_ONCE(p); \ 569 rcu_dereference_sparse(p, space); \ 570 ((typeof(*p) __force __kernel *)(_________p1)); \ 571 }) 572 #define __rcu_dereference_check(p, c, space) \ 573 ({ \ 574 /* Dependency order vs. p above. */ \ 575 typeof(*p) *________p1 = (typeof(*p) *__force)lockless_dereference(p); \ 576 RCU_LOCKDEP_WARN(!(c), "suspicious rcu_dereference_check() usage"); \ 577 rcu_dereference_sparse(p, space); \ 578 ((typeof(*p) __force __kernel *)(________p1)); \ 579 }) 580 #define __rcu_dereference_protected(p, c, space) \ 581 ({ \ 582 RCU_LOCKDEP_WARN(!(c), "suspicious rcu_dereference_protected() usage"); \ 583 rcu_dereference_sparse(p, space); \ 584 ((typeof(*p) __force __kernel *)(p)); \ 585 }) 586 #define rcu_dereference_raw(p) \ 587 ({ \ 588 /* Dependency order vs. p above. */ \ 589 typeof(p) ________p1 = lockless_dereference(p); \ 590 ((typeof(*p) __force __kernel *)(________p1)); \ 591 }) 592 593 /** 594 * RCU_INITIALIZER() - statically initialize an RCU-protected global variable 595 * @v: The value to statically initialize with. 596 */ 597 #define RCU_INITIALIZER(v) (typeof(*(v)) __force __rcu *)(v) 598 599 /** 600 * rcu_assign_pointer() - assign to RCU-protected pointer 601 * @p: pointer to assign to 602 * @v: value to assign (publish) 603 * 604 * Assigns the specified value to the specified RCU-protected 605 * pointer, ensuring that any concurrent RCU readers will see 606 * any prior initialization. 607 * 608 * Inserts memory barriers on architectures that require them 609 * (which is most of them), and also prevents the compiler from 610 * reordering the code that initializes the structure after the pointer 611 * assignment. More importantly, this call documents which pointers 612 * will be dereferenced by RCU read-side code. 613 * 614 * In some special cases, you may use RCU_INIT_POINTER() instead 615 * of rcu_assign_pointer(). RCU_INIT_POINTER() is a bit faster due 616 * to the fact that it does not constrain either the CPU or the compiler. 617 * That said, using RCU_INIT_POINTER() when you should have used 618 * rcu_assign_pointer() is a very bad thing that results in 619 * impossible-to-diagnose memory corruption. So please be careful. 620 * See the RCU_INIT_POINTER() comment header for details. 621 * 622 * Note that rcu_assign_pointer() evaluates each of its arguments only 623 * once, appearances notwithstanding. One of the "extra" evaluations 624 * is in typeof() and the other visible only to sparse (__CHECKER__), 625 * neither of which actually execute the argument. As with most cpp 626 * macros, this execute-arguments-only-once property is important, so 627 * please be careful when making changes to rcu_assign_pointer() and the 628 * other macros that it invokes. 629 */ 630 #define rcu_assign_pointer(p, v) \ 631 ({ \ 632 uintptr_t _r_a_p__v = (uintptr_t)(v); \ 633 \ 634 if (__builtin_constant_p(v) && (_r_a_p__v) == (uintptr_t)NULL) \ 635 WRITE_ONCE((p), (typeof(p))(_r_a_p__v)); \ 636 else \ 637 smp_store_release(&p, RCU_INITIALIZER((typeof(p))_r_a_p__v)); \ 638 _r_a_p__v; \ 639 }) 640 641 /** 642 * rcu_access_pointer() - fetch RCU pointer with no dereferencing 643 * @p: The pointer to read 644 * 645 * Return the value of the specified RCU-protected pointer, but omit the 646 * smp_read_barrier_depends() and keep the READ_ONCE(). This is useful 647 * when the value of this pointer is accessed, but the pointer is not 648 * dereferenced, for example, when testing an RCU-protected pointer against 649 * NULL. Although rcu_access_pointer() may also be used in cases where 650 * update-side locks prevent the value of the pointer from changing, you 651 * should instead use rcu_dereference_protected() for this use case. 652 * 653 * It is also permissible to use rcu_access_pointer() when read-side 654 * access to the pointer was removed at least one grace period ago, as 655 * is the case in the context of the RCU callback that is freeing up 656 * the data, or after a synchronize_rcu() returns. This can be useful 657 * when tearing down multi-linked structures after a grace period 658 * has elapsed. 659 */ 660 #define rcu_access_pointer(p) __rcu_access_pointer((p), __rcu) 661 662 /** 663 * rcu_dereference_check() - rcu_dereference with debug checking 664 * @p: The pointer to read, prior to dereferencing 665 * @c: The conditions under which the dereference will take place 666 * 667 * Do an rcu_dereference(), but check that the conditions under which the 668 * dereference will take place are correct. Typically the conditions 669 * indicate the various locking conditions that should be held at that 670 * point. The check should return true if the conditions are satisfied. 671 * An implicit check for being in an RCU read-side critical section 672 * (rcu_read_lock()) is included. 673 * 674 * For example: 675 * 676 * bar = rcu_dereference_check(foo->bar, lockdep_is_held(&foo->lock)); 677 * 678 * could be used to indicate to lockdep that foo->bar may only be dereferenced 679 * if either rcu_read_lock() is held, or that the lock required to replace 680 * the bar struct at foo->bar is held. 681 * 682 * Note that the list of conditions may also include indications of when a lock 683 * need not be held, for example during initialisation or destruction of the 684 * target struct: 685 * 686 * bar = rcu_dereference_check(foo->bar, lockdep_is_held(&foo->lock) || 687 * atomic_read(&foo->usage) == 0); 688 * 689 * Inserts memory barriers on architectures that require them 690 * (currently only the Alpha), prevents the compiler from refetching 691 * (and from merging fetches), and, more importantly, documents exactly 692 * which pointers are protected by RCU and checks that the pointer is 693 * annotated as __rcu. 694 */ 695 #define rcu_dereference_check(p, c) \ 696 __rcu_dereference_check((p), (c) || rcu_read_lock_held(), __rcu) 697 698 /** 699 * rcu_dereference_bh_check() - rcu_dereference_bh with debug checking 700 * @p: The pointer to read, prior to dereferencing 701 * @c: The conditions under which the dereference will take place 702 * 703 * This is the RCU-bh counterpart to rcu_dereference_check(). 704 */ 705 #define rcu_dereference_bh_check(p, c) \ 706 __rcu_dereference_check((p), (c) || rcu_read_lock_bh_held(), __rcu) 707 708 /** 709 * rcu_dereference_sched_check() - rcu_dereference_sched with debug checking 710 * @p: The pointer to read, prior to dereferencing 711 * @c: The conditions under which the dereference will take place 712 * 713 * This is the RCU-sched counterpart to rcu_dereference_check(). 714 */ 715 #define rcu_dereference_sched_check(p, c) \ 716 __rcu_dereference_check((p), (c) || rcu_read_lock_sched_held(), \ 717 __rcu) 718 719 /* 720 * The tracing infrastructure traces RCU (we want that), but unfortunately 721 * some of the RCU checks causes tracing to lock up the system. 722 * 723 * The no-tracing version of rcu_dereference_raw() must not call 724 * rcu_read_lock_held(). 725 */ 726 #define rcu_dereference_raw_notrace(p) __rcu_dereference_check((p), 1, __rcu) 727 728 /** 729 * rcu_dereference_protected() - fetch RCU pointer when updates prevented 730 * @p: The pointer to read, prior to dereferencing 731 * @c: The conditions under which the dereference will take place 732 * 733 * Return the value of the specified RCU-protected pointer, but omit 734 * both the smp_read_barrier_depends() and the READ_ONCE(). This 735 * is useful in cases where update-side locks prevent the value of the 736 * pointer from changing. Please note that this primitive does -not- 737 * prevent the compiler from repeating this reference or combining it 738 * with other references, so it should not be used without protection 739 * of appropriate locks. 740 * 741 * This function is only for update-side use. Using this function 742 * when protected only by rcu_read_lock() will result in infrequent 743 * but very ugly failures. 744 */ 745 #define rcu_dereference_protected(p, c) \ 746 __rcu_dereference_protected((p), (c), __rcu) 747 748 749 /** 750 * rcu_dereference() - fetch RCU-protected pointer for dereferencing 751 * @p: The pointer to read, prior to dereferencing 752 * 753 * This is a simple wrapper around rcu_dereference_check(). 754 */ 755 #define rcu_dereference(p) rcu_dereference_check(p, 0) 756 757 /** 758 * rcu_dereference_bh() - fetch an RCU-bh-protected pointer for dereferencing 759 * @p: The pointer to read, prior to dereferencing 760 * 761 * Makes rcu_dereference_check() do the dirty work. 762 */ 763 #define rcu_dereference_bh(p) rcu_dereference_bh_check(p, 0) 764 765 /** 766 * rcu_dereference_sched() - fetch RCU-sched-protected pointer for dereferencing 767 * @p: The pointer to read, prior to dereferencing 768 * 769 * Makes rcu_dereference_check() do the dirty work. 770 */ 771 #define rcu_dereference_sched(p) rcu_dereference_sched_check(p, 0) 772 773 /** 774 * rcu_pointer_handoff() - Hand off a pointer from RCU to other mechanism 775 * @p: The pointer to hand off 776 * 777 * This is simply an identity function, but it documents where a pointer 778 * is handed off from RCU to some other synchronization mechanism, for 779 * example, reference counting or locking. In C11, it would map to 780 * kill_dependency(). It could be used as follows: 781 * 782 * rcu_read_lock(); 783 * p = rcu_dereference(gp); 784 * long_lived = is_long_lived(p); 785 * if (long_lived) { 786 * if (!atomic_inc_not_zero(p->refcnt)) 787 * long_lived = false; 788 * else 789 * p = rcu_pointer_handoff(p); 790 * } 791 * rcu_read_unlock(); 792 */ 793 #define rcu_pointer_handoff(p) (p) 794 795 /** 796 * rcu_read_lock() - mark the beginning of an RCU read-side critical section 797 * 798 * When synchronize_rcu() is invoked on one CPU while other CPUs 799 * are within RCU read-side critical sections, then the 800 * synchronize_rcu() is guaranteed to block until after all the other 801 * CPUs exit their critical sections. Similarly, if call_rcu() is invoked 802 * on one CPU while other CPUs are within RCU read-side critical 803 * sections, invocation of the corresponding RCU callback is deferred 804 * until after the all the other CPUs exit their critical sections. 805 * 806 * Note, however, that RCU callbacks are permitted to run concurrently 807 * with new RCU read-side critical sections. One way that this can happen 808 * is via the following sequence of events: (1) CPU 0 enters an RCU 809 * read-side critical section, (2) CPU 1 invokes call_rcu() to register 810 * an RCU callback, (3) CPU 0 exits the RCU read-side critical section, 811 * (4) CPU 2 enters a RCU read-side critical section, (5) the RCU 812 * callback is invoked. This is legal, because the RCU read-side critical 813 * section that was running concurrently with the call_rcu() (and which 814 * therefore might be referencing something that the corresponding RCU 815 * callback would free up) has completed before the corresponding 816 * RCU callback is invoked. 817 * 818 * RCU read-side critical sections may be nested. Any deferred actions 819 * will be deferred until the outermost RCU read-side critical section 820 * completes. 821 * 822 * You can avoid reading and understanding the next paragraph by 823 * following this rule: don't put anything in an rcu_read_lock() RCU 824 * read-side critical section that would block in a !PREEMPT kernel. 825 * But if you want the full story, read on! 826 * 827 * In non-preemptible RCU implementations (TREE_RCU and TINY_RCU), 828 * it is illegal to block while in an RCU read-side critical section. 829 * In preemptible RCU implementations (PREEMPT_RCU) in CONFIG_PREEMPT 830 * kernel builds, RCU read-side critical sections may be preempted, 831 * but explicit blocking is illegal. Finally, in preemptible RCU 832 * implementations in real-time (with -rt patchset) kernel builds, RCU 833 * read-side critical sections may be preempted and they may also block, but 834 * only when acquiring spinlocks that are subject to priority inheritance. 835 */ 836 static inline void rcu_read_lock(void) 837 { 838 __rcu_read_lock(); 839 __acquire(RCU); 840 rcu_lock_acquire(&rcu_lock_map); 841 RCU_LOCKDEP_WARN(!rcu_is_watching(), 842 "rcu_read_lock() used illegally while idle"); 843 } 844 845 /* 846 * So where is rcu_write_lock()? It does not exist, as there is no 847 * way for writers to lock out RCU readers. This is a feature, not 848 * a bug -- this property is what provides RCU's performance benefits. 849 * Of course, writers must coordinate with each other. The normal 850 * spinlock primitives work well for this, but any other technique may be 851 * used as well. RCU does not care how the writers keep out of each 852 * others' way, as long as they do so. 853 */ 854 855 /** 856 * rcu_read_unlock() - marks the end of an RCU read-side critical section. 857 * 858 * In most situations, rcu_read_unlock() is immune from deadlock. 859 * However, in kernels built with CONFIG_RCU_BOOST, rcu_read_unlock() 860 * is responsible for deboosting, which it does via rt_mutex_unlock(). 861 * Unfortunately, this function acquires the scheduler's runqueue and 862 * priority-inheritance spinlocks. This means that deadlock could result 863 * if the caller of rcu_read_unlock() already holds one of these locks or 864 * any lock that is ever acquired while holding them; or any lock which 865 * can be taken from interrupt context because rcu_boost()->rt_mutex_lock() 866 * does not disable irqs while taking ->wait_lock. 867 * 868 * That said, RCU readers are never priority boosted unless they were 869 * preempted. Therefore, one way to avoid deadlock is to make sure 870 * that preemption never happens within any RCU read-side critical 871 * section whose outermost rcu_read_unlock() is called with one of 872 * rt_mutex_unlock()'s locks held. Such preemption can be avoided in 873 * a number of ways, for example, by invoking preempt_disable() before 874 * critical section's outermost rcu_read_lock(). 875 * 876 * Given that the set of locks acquired by rt_mutex_unlock() might change 877 * at any time, a somewhat more future-proofed approach is to make sure 878 * that that preemption never happens within any RCU read-side critical 879 * section whose outermost rcu_read_unlock() is called with irqs disabled. 880 * This approach relies on the fact that rt_mutex_unlock() currently only 881 * acquires irq-disabled locks. 882 * 883 * The second of these two approaches is best in most situations, 884 * however, the first approach can also be useful, at least to those 885 * developers willing to keep abreast of the set of locks acquired by 886 * rt_mutex_unlock(). 887 * 888 * See rcu_read_lock() for more information. 889 */ 890 static inline void rcu_read_unlock(void) 891 { 892 RCU_LOCKDEP_WARN(!rcu_is_watching(), 893 "rcu_read_unlock() used illegally while idle"); 894 __release(RCU); 895 __rcu_read_unlock(); 896 rcu_lock_release(&rcu_lock_map); /* Keep acq info for rls diags. */ 897 } 898 899 /** 900 * rcu_read_lock_bh() - mark the beginning of an RCU-bh critical section 901 * 902 * This is equivalent of rcu_read_lock(), but to be used when updates 903 * are being done using call_rcu_bh() or synchronize_rcu_bh(). Since 904 * both call_rcu_bh() and synchronize_rcu_bh() consider completion of a 905 * softirq handler to be a quiescent state, a process in RCU read-side 906 * critical section must be protected by disabling softirqs. Read-side 907 * critical sections in interrupt context can use just rcu_read_lock(), 908 * though this should at least be commented to avoid confusing people 909 * reading the code. 910 * 911 * Note that rcu_read_lock_bh() and the matching rcu_read_unlock_bh() 912 * must occur in the same context, for example, it is illegal to invoke 913 * rcu_read_unlock_bh() from one task if the matching rcu_read_lock_bh() 914 * was invoked from some other task. 915 */ 916 static inline void rcu_read_lock_bh(void) 917 { 918 local_bh_disable(); 919 __acquire(RCU_BH); 920 rcu_lock_acquire(&rcu_bh_lock_map); 921 RCU_LOCKDEP_WARN(!rcu_is_watching(), 922 "rcu_read_lock_bh() used illegally while idle"); 923 } 924 925 /* 926 * rcu_read_unlock_bh - marks the end of a softirq-only RCU critical section 927 * 928 * See rcu_read_lock_bh() for more information. 929 */ 930 static inline void rcu_read_unlock_bh(void) 931 { 932 RCU_LOCKDEP_WARN(!rcu_is_watching(), 933 "rcu_read_unlock_bh() used illegally while idle"); 934 rcu_lock_release(&rcu_bh_lock_map); 935 __release(RCU_BH); 936 local_bh_enable(); 937 } 938 939 /** 940 * rcu_read_lock_sched() - mark the beginning of a RCU-sched critical section 941 * 942 * This is equivalent of rcu_read_lock(), but to be used when updates 943 * are being done using call_rcu_sched() or synchronize_rcu_sched(). 944 * Read-side critical sections can also be introduced by anything that 945 * disables preemption, including local_irq_disable() and friends. 946 * 947 * Note that rcu_read_lock_sched() and the matching rcu_read_unlock_sched() 948 * must occur in the same context, for example, it is illegal to invoke 949 * rcu_read_unlock_sched() from process context if the matching 950 * rcu_read_lock_sched() was invoked from an NMI handler. 951 */ 952 static inline void rcu_read_lock_sched(void) 953 { 954 preempt_disable(); 955 __acquire(RCU_SCHED); 956 rcu_lock_acquire(&rcu_sched_lock_map); 957 RCU_LOCKDEP_WARN(!rcu_is_watching(), 958 "rcu_read_lock_sched() used illegally while idle"); 959 } 960 961 /* Used by lockdep and tracing: cannot be traced, cannot call lockdep. */ 962 static inline notrace void rcu_read_lock_sched_notrace(void) 963 { 964 preempt_disable_notrace(); 965 __acquire(RCU_SCHED); 966 } 967 968 /* 969 * rcu_read_unlock_sched - marks the end of a RCU-classic critical section 970 * 971 * See rcu_read_lock_sched for more information. 972 */ 973 static inline void rcu_read_unlock_sched(void) 974 { 975 RCU_LOCKDEP_WARN(!rcu_is_watching(), 976 "rcu_read_unlock_sched() used illegally while idle"); 977 rcu_lock_release(&rcu_sched_lock_map); 978 __release(RCU_SCHED); 979 preempt_enable(); 980 } 981 982 /* Used by lockdep and tracing: cannot be traced, cannot call lockdep. */ 983 static inline notrace void rcu_read_unlock_sched_notrace(void) 984 { 985 __release(RCU_SCHED); 986 preempt_enable_notrace(); 987 } 988 989 /** 990 * RCU_INIT_POINTER() - initialize an RCU protected pointer 991 * 992 * Initialize an RCU-protected pointer in special cases where readers 993 * do not need ordering constraints on the CPU or the compiler. These 994 * special cases are: 995 * 996 * 1. This use of RCU_INIT_POINTER() is NULLing out the pointer -or- 997 * 2. The caller has taken whatever steps are required to prevent 998 * RCU readers from concurrently accessing this pointer -or- 999 * 3. The referenced data structure has already been exposed to 1000 * readers either at compile time or via rcu_assign_pointer() -and- 1001 * a. You have not made -any- reader-visible changes to 1002 * this structure since then -or- 1003 * b. It is OK for readers accessing this structure from its 1004 * new location to see the old state of the structure. (For 1005 * example, the changes were to statistical counters or to 1006 * other state where exact synchronization is not required.) 1007 * 1008 * Failure to follow these rules governing use of RCU_INIT_POINTER() will 1009 * result in impossible-to-diagnose memory corruption. As in the structures 1010 * will look OK in crash dumps, but any concurrent RCU readers might 1011 * see pre-initialized values of the referenced data structure. So 1012 * please be very careful how you use RCU_INIT_POINTER()!!! 1013 * 1014 * If you are creating an RCU-protected linked structure that is accessed 1015 * by a single external-to-structure RCU-protected pointer, then you may 1016 * use RCU_INIT_POINTER() to initialize the internal RCU-protected 1017 * pointers, but you must use rcu_assign_pointer() to initialize the 1018 * external-to-structure pointer -after- you have completely initialized 1019 * the reader-accessible portions of the linked structure. 1020 * 1021 * Note that unlike rcu_assign_pointer(), RCU_INIT_POINTER() provides no 1022 * ordering guarantees for either the CPU or the compiler. 1023 */ 1024 #define RCU_INIT_POINTER(p, v) \ 1025 do { \ 1026 rcu_dereference_sparse(p, __rcu); \ 1027 WRITE_ONCE(p, RCU_INITIALIZER(v)); \ 1028 } while (0) 1029 1030 /** 1031 * RCU_POINTER_INITIALIZER() - statically initialize an RCU protected pointer 1032 * 1033 * GCC-style initialization for an RCU-protected pointer in a structure field. 1034 */ 1035 #define RCU_POINTER_INITIALIZER(p, v) \ 1036 .p = RCU_INITIALIZER(v) 1037 1038 /* 1039 * Does the specified offset indicate that the corresponding rcu_head 1040 * structure can be handled by kfree_rcu()? 1041 */ 1042 #define __is_kfree_rcu_offset(offset) ((offset) < 4096) 1043 1044 /* 1045 * Helper macro for kfree_rcu() to prevent argument-expansion eyestrain. 1046 */ 1047 #define __kfree_rcu(head, offset) \ 1048 do { \ 1049 BUILD_BUG_ON(!__is_kfree_rcu_offset(offset)); \ 1050 kfree_call_rcu(head, (rcu_callback_t)(unsigned long)(offset)); \ 1051 } while (0) 1052 1053 /** 1054 * kfree_rcu() - kfree an object after a grace period. 1055 * @ptr: pointer to kfree 1056 * @rcu_head: the name of the struct rcu_head within the type of @ptr. 1057 * 1058 * Many rcu callbacks functions just call kfree() on the base structure. 1059 * These functions are trivial, but their size adds up, and furthermore 1060 * when they are used in a kernel module, that module must invoke the 1061 * high-latency rcu_barrier() function at module-unload time. 1062 * 1063 * The kfree_rcu() function handles this issue. Rather than encoding a 1064 * function address in the embedded rcu_head structure, kfree_rcu() instead 1065 * encodes the offset of the rcu_head structure within the base structure. 1066 * Because the functions are not allowed in the low-order 4096 bytes of 1067 * kernel virtual memory, offsets up to 4095 bytes can be accommodated. 1068 * If the offset is larger than 4095 bytes, a compile-time error will 1069 * be generated in __kfree_rcu(). If this error is triggered, you can 1070 * either fall back to use of call_rcu() or rearrange the structure to 1071 * position the rcu_head structure into the first 4096 bytes. 1072 * 1073 * Note that the allowable offset might decrease in the future, for example, 1074 * to allow something like kmem_cache_free_rcu(). 1075 * 1076 * The BUILD_BUG_ON check must not involve any function calls, hence the 1077 * checks are done in macros here. 1078 */ 1079 #define kfree_rcu(ptr, rcu_head) \ 1080 __kfree_rcu(&((ptr)->rcu_head), offsetof(typeof(*(ptr)), rcu_head)) 1081 1082 #ifdef CONFIG_TINY_RCU 1083 static inline int rcu_needs_cpu(u64 basemono, u64 *nextevt) 1084 { 1085 *nextevt = KTIME_MAX; 1086 return 0; 1087 } 1088 #endif /* #ifdef CONFIG_TINY_RCU */ 1089 1090 #if defined(CONFIG_RCU_NOCB_CPU_ALL) 1091 static inline bool rcu_is_nocb_cpu(int cpu) { return true; } 1092 #elif defined(CONFIG_RCU_NOCB_CPU) 1093 bool rcu_is_nocb_cpu(int cpu); 1094 #else 1095 static inline bool rcu_is_nocb_cpu(int cpu) { return false; } 1096 #endif 1097 1098 1099 /* Only for use by adaptive-ticks code. */ 1100 #ifdef CONFIG_NO_HZ_FULL_SYSIDLE 1101 bool rcu_sys_is_idle(void); 1102 void rcu_sysidle_force_exit(void); 1103 #else /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */ 1104 1105 static inline bool rcu_sys_is_idle(void) 1106 { 1107 return false; 1108 } 1109 1110 static inline void rcu_sysidle_force_exit(void) 1111 { 1112 } 1113 1114 #endif /* #else #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */ 1115 1116 1117 /* 1118 * Dump the ftrace buffer, but only one time per callsite per boot. 1119 */ 1120 #define rcu_ftrace_dump(oops_dump_mode) \ 1121 do { \ 1122 static atomic_t ___rfd_beenhere = ATOMIC_INIT(0); \ 1123 \ 1124 if (!atomic_read(&___rfd_beenhere) && \ 1125 !atomic_xchg(&___rfd_beenhere, 1)) \ 1126 ftrace_dump(oops_dump_mode); \ 1127 } while (0) 1128 1129 /* 1130 * Place this after a lock-acquisition primitive to guarantee that 1131 * an UNLOCK+LOCK pair acts as a full barrier. This guarantee applies 1132 * if the UNLOCK and LOCK are executed by the same CPU or if the 1133 * UNLOCK and LOCK operate on the same lock variable. 1134 */ 1135 #ifdef CONFIG_PPC 1136 #define smp_mb__after_unlock_lock() smp_mb() /* Full ordering for lock. */ 1137 #else /* #ifdef CONFIG_PPC */ 1138 #define smp_mb__after_unlock_lock() do { } while (0) 1139 #endif /* #else #ifdef CONFIG_PPC */ 1140 1141 1142 #endif /* __LINUX_RCUPDATE_H */ 1143