rcupdate.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141
  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, 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. * Authors: Dipankar Sarma <dipankar@in.ibm.com>
  21. * Manfred Spraul <manfred@colorfullife.com>
  22. *
  23. * Based on the original work by Paul McKenney <paulmck@us.ibm.com>
  24. * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen.
  25. * Papers:
  26. * http://www.rdrop.com/users/paulmck/paper/rclockpdcsproof.pdf
  27. * http://lse.sourceforge.net/locking/rclock_OLS.2001.05.01c.sc.pdf (OLS2001)
  28. *
  29. * For detailed explanation of Read-Copy Update mechanism see -
  30. * http://lse.sourceforge.net/locking/rcupdate.html
  31. *
  32. */
  33. #include <linux/types.h>
  34. #include <linux/kernel.h>
  35. #include <linux/init.h>
  36. #include <linux/spinlock.h>
  37. #include <linux/smp.h>
  38. #include <linux/interrupt.h>
  39. #include <linux/sched.h>
  40. #include <asm/atomic.h>
  41. #include <linux/bitops.h>
  42. #include <linux/completion.h>
  43. #include <linux/percpu.h>
  44. #include <linux/notifier.h>
  45. #include <linux/cpu.h>
  46. #include <linux/mutex.h>
  47. #include <linux/module.h>
  48. struct rcu_synchronize {
  49. struct rcu_head head;
  50. struct completion completion;
  51. };
  52. static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL};
  53. static atomic_t rcu_barrier_cpu_count;
  54. static DEFINE_MUTEX(rcu_barrier_mutex);
  55. static struct completion rcu_barrier_completion;
  56. /*
  57. * Awaken the corresponding synchronize_rcu() instance now that a
  58. * grace period has elapsed.
  59. */
  60. static void wakeme_after_rcu(struct rcu_head *head)
  61. {
  62. struct rcu_synchronize *rcu;
  63. rcu = container_of(head, struct rcu_synchronize, head);
  64. complete(&rcu->completion);
  65. }
  66. /**
  67. * synchronize_rcu - wait until a grace period has elapsed.
  68. *
  69. * Control will return to the caller some time after a full grace
  70. * period has elapsed, in other words after all currently executing RCU
  71. * read-side critical sections have completed. RCU read-side critical
  72. * sections are delimited by rcu_read_lock() and rcu_read_unlock(),
  73. * and may be nested.
  74. */
  75. void synchronize_rcu(void)
  76. {
  77. struct rcu_synchronize rcu;
  78. init_completion(&rcu.completion);
  79. /* Will wake me after RCU finished */
  80. call_rcu(&rcu.head, wakeme_after_rcu);
  81. /* Wait for it */
  82. wait_for_completion(&rcu.completion);
  83. }
  84. EXPORT_SYMBOL_GPL(synchronize_rcu);
  85. static void rcu_barrier_callback(struct rcu_head *notused)
  86. {
  87. if (atomic_dec_and_test(&rcu_barrier_cpu_count))
  88. complete(&rcu_barrier_completion);
  89. }
  90. /*
  91. * Called with preemption disabled, and from cross-cpu IRQ context.
  92. */
  93. static void rcu_barrier_func(void *notused)
  94. {
  95. int cpu = smp_processor_id();
  96. struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu);
  97. atomic_inc(&rcu_barrier_cpu_count);
  98. call_rcu(head, rcu_barrier_callback);
  99. }
  100. /**
  101. * rcu_barrier - Wait until all the in-flight RCUs are complete.
  102. */
  103. void rcu_barrier(void)
  104. {
  105. BUG_ON(in_interrupt());
  106. /* Take cpucontrol mutex to protect against CPU hotplug */
  107. mutex_lock(&rcu_barrier_mutex);
  108. init_completion(&rcu_barrier_completion);
  109. atomic_set(&rcu_barrier_cpu_count, 0);
  110. /*
  111. * The queueing of callbacks in all CPUs must be atomic with
  112. * respect to RCU, otherwise one CPU may queue a callback,
  113. * wait for a grace period, decrement barrier count and call
  114. * complete(), while other CPUs have not yet queued anything.
  115. * So, we need to make sure that grace periods cannot complete
  116. * until all the callbacks are queued.
  117. */
  118. rcu_read_lock();
  119. on_each_cpu(rcu_barrier_func, NULL, 0, 1);
  120. rcu_read_unlock();
  121. wait_for_completion(&rcu_barrier_completion);
  122. mutex_unlock(&rcu_barrier_mutex);
  123. }
  124. EXPORT_SYMBOL_GPL(rcu_barrier);
  125. void __init rcu_init(void)
  126. {
  127. __rcu_init();
  128. }