rcupreempt.h 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  1. /*
  2. * Read-Copy Update mechanism for mutual exclusion (RT implementation)
  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, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  17. *
  18. * Copyright (C) IBM Corporation, 2006
  19. *
  20. * Author: Paul McKenney <paulmck@us.ibm.com>
  21. *
  22. * Based on the original work by Paul McKenney <paul.mckenney@us.ibm.com>
  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. * Documentation/RCU
  30. *
  31. */
  32. #ifndef __LINUX_RCUPREEMPT_H
  33. #define __LINUX_RCUPREEMPT_H
  34. #include <linux/cache.h>
  35. #include <linux/spinlock.h>
  36. #include <linux/threads.h>
  37. #include <linux/smp.h>
  38. #include <linux/cpumask.h>
  39. #include <linux/seqlock.h>
  40. extern void rcu_sched_qs(int cpu);
  41. static inline void rcu_bh_qs(int cpu) { }
  42. /*
  43. * Someone might want to pass call_rcu_bh as a function pointer.
  44. * So this needs to just be a rename and not a macro function.
  45. * (no parentheses)
  46. */
  47. #define call_rcu_bh call_rcu
  48. /**
  49. * call_rcu_sched - Queue RCU callback for invocation after sched grace period.
  50. * @head: structure to be used for queueing the RCU updates.
  51. * @func: actual update function to be invoked after the grace period
  52. *
  53. * The update function will be invoked some time after a full
  54. * synchronize_sched()-style grace period elapses, in other words after
  55. * all currently executing preempt-disabled sections of code (including
  56. * hardirq handlers, NMI handlers, and local_irq_save() blocks) have
  57. * completed.
  58. */
  59. extern void call_rcu_sched(struct rcu_head *head,
  60. void (*func)(struct rcu_head *head));
  61. extern void __rcu_read_lock(void);
  62. extern void __rcu_read_unlock(void);
  63. extern int rcu_needs_cpu(int cpu);
  64. #define __rcu_read_lock_bh() { rcu_read_lock(); local_bh_disable(); }
  65. #define __rcu_read_unlock_bh() { local_bh_enable(); rcu_read_unlock(); }
  66. extern void __synchronize_sched(void);
  67. static inline void synchronize_rcu_expedited(void)
  68. {
  69. synchronize_rcu(); /* Placeholder for new rcupreempt implementation. */
  70. }
  71. static inline void synchronize_rcu_bh_expedited(void)
  72. {
  73. synchronize_rcu_bh(); /* Placeholder for new rcupreempt impl. */
  74. }
  75. extern void __rcu_init(void);
  76. extern void rcu_init_sched(void);
  77. extern void rcu_check_callbacks(int cpu, int user);
  78. extern void rcu_restart_cpu(int cpu);
  79. extern long rcu_batches_completed(void);
  80. /*
  81. * Return the number of RCU batches processed thus far. Useful for debug
  82. * and statistic. The _bh variant is identifcal to straight RCU
  83. */
  84. static inline long rcu_batches_completed_bh(void)
  85. {
  86. return rcu_batches_completed();
  87. }
  88. static inline void exit_rcu(void)
  89. {
  90. }
  91. #ifdef CONFIG_RCU_TRACE
  92. struct rcupreempt_trace;
  93. extern long *rcupreempt_flipctr(int cpu);
  94. extern long rcupreempt_data_completed(void);
  95. extern int rcupreempt_flip_flag(int cpu);
  96. extern int rcupreempt_mb_flag(int cpu);
  97. extern char *rcupreempt_try_flip_state_name(void);
  98. extern struct rcupreempt_trace *rcupreempt_trace_cpu(int cpu);
  99. #endif
  100. struct softirq_action;
  101. #ifdef CONFIG_NO_HZ
  102. extern void rcu_enter_nohz(void);
  103. extern void rcu_exit_nohz(void);
  104. #else
  105. # define rcu_enter_nohz() do { } while (0)
  106. # define rcu_exit_nohz() do { } while (0)
  107. #endif
  108. /*
  109. * A context switch is a grace period for rcupreempt synchronize_rcu()
  110. * only during early boot, before the scheduler has been initialized.
  111. * So, how the heck do we get a context switch? Well, if the caller
  112. * invokes synchronize_rcu(), they are willing to accept a context
  113. * switch, so we simply pretend that one happened.
  114. *
  115. * After boot, there might be a blocked or preempted task in an RCU
  116. * read-side critical section, so we cannot then take the fastpath.
  117. */
  118. static inline int rcu_blocking_is_gp(void)
  119. {
  120. return num_online_cpus() == 1 && !rcu_scheduler_active;
  121. }
  122. #endif /* __LINUX_RCUPREEMPT_H */