rcuclassic.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. /*
  2. * Read-Copy Update mechanism for mutual exclusion (classic version)
  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 IBM Corporation, 2001
  19. *
  20. * Author: Dipankar Sarma <dipankar@in.ibm.com>
  21. *
  22. * Based on the original work by Paul McKenney <paulmck@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_RCUCLASSIC_H
  33. #define __LINUX_RCUCLASSIC_H
  34. #ifdef __KERNEL__
  35. #include <linux/cache.h>
  36. #include <linux/spinlock.h>
  37. #include <linux/threads.h>
  38. #include <linux/percpu.h>
  39. #include <linux/cpumask.h>
  40. #include <linux/seqlock.h>
  41. /* Global control variables for rcupdate callback mechanism. */
  42. struct rcu_ctrlblk {
  43. long cur; /* Current batch number. */
  44. long completed; /* Number of the last completed batch */
  45. int next_pending; /* Is the next batch already waiting? */
  46. int signaled;
  47. spinlock_t lock ____cacheline_internodealigned_in_smp;
  48. cpumask_t cpumask; /* CPUs that need to switch in order */
  49. /* for current batch to proceed. */
  50. } ____cacheline_internodealigned_in_smp;
  51. /* Is batch a before batch b ? */
  52. static inline int rcu_batch_before(long a, long b)
  53. {
  54. return (a - b) < 0;
  55. }
  56. /* Is batch a after batch b ? */
  57. static inline int rcu_batch_after(long a, long b)
  58. {
  59. return (a - b) > 0;
  60. }
  61. /*
  62. * Per-CPU data for Read-Copy UPdate.
  63. * nxtlist - new callbacks are added here
  64. * curlist - current batch for which quiescent cycle started if any
  65. */
  66. struct rcu_data {
  67. /* 1) quiescent state handling : */
  68. long quiescbatch; /* Batch # for grace period */
  69. int passed_quiesc; /* User-mode/idle loop etc. */
  70. int qs_pending; /* core waits for quiesc state */
  71. /* 2) batch handling */
  72. long batch; /* Batch # for current RCU batch */
  73. struct rcu_head *nxtlist;
  74. struct rcu_head **nxttail;
  75. long qlen; /* # of queued callbacks */
  76. struct rcu_head *curlist;
  77. struct rcu_head **curtail;
  78. struct rcu_head *donelist;
  79. struct rcu_head **donetail;
  80. long blimit; /* Upper limit on a processed batch */
  81. int cpu;
  82. struct rcu_head barrier;
  83. };
  84. DECLARE_PER_CPU(struct rcu_data, rcu_data);
  85. DECLARE_PER_CPU(struct rcu_data, rcu_bh_data);
  86. /*
  87. * Increment the quiescent state counter.
  88. * The counter is a bit degenerated: We do not need to know
  89. * how many quiescent states passed, just if there was at least
  90. * one since the start of the grace period. Thus just a flag.
  91. */
  92. static inline void rcu_qsctr_inc(int cpu)
  93. {
  94. struct rcu_data *rdp = &per_cpu(rcu_data, cpu);
  95. rdp->passed_quiesc = 1;
  96. }
  97. static inline void rcu_bh_qsctr_inc(int cpu)
  98. {
  99. struct rcu_data *rdp = &per_cpu(rcu_bh_data, cpu);
  100. rdp->passed_quiesc = 1;
  101. }
  102. extern int rcu_pending(int cpu);
  103. extern int rcu_needs_cpu(int cpu);
  104. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  105. extern struct lockdep_map rcu_lock_map;
  106. # define rcu_read_acquire() \
  107. lock_acquire(&rcu_lock_map, 0, 0, 2, 1, _THIS_IP_)
  108. # define rcu_read_release() lock_release(&rcu_lock_map, 1, _THIS_IP_)
  109. #else
  110. # define rcu_read_acquire() do { } while (0)
  111. # define rcu_read_release() do { } while (0)
  112. #endif
  113. #define __rcu_read_lock() \
  114. do { \
  115. preempt_disable(); \
  116. __acquire(RCU); \
  117. rcu_read_acquire(); \
  118. } while (0)
  119. #define __rcu_read_unlock() \
  120. do { \
  121. rcu_read_release(); \
  122. __release(RCU); \
  123. preempt_enable(); \
  124. } while (0)
  125. #define __rcu_read_lock_bh() \
  126. do { \
  127. local_bh_disable(); \
  128. __acquire(RCU_BH); \
  129. rcu_read_acquire(); \
  130. } while (0)
  131. #define __rcu_read_unlock_bh() \
  132. do { \
  133. rcu_read_release(); \
  134. __release(RCU_BH); \
  135. local_bh_enable(); \
  136. } while (0)
  137. #define __synchronize_sched() synchronize_rcu()
  138. extern void __rcu_init(void);
  139. extern void rcu_check_callbacks(int cpu, int user);
  140. extern void rcu_restart_cpu(int cpu);
  141. #endif /* __KERNEL__ */
  142. #endif /* __LINUX_RCUCLASSIC_H */