percpu-rwsem.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  1. #include <linux/atomic.h>
  2. #include <linux/rwsem.h>
  3. #include <linux/percpu.h>
  4. #include <linux/wait.h>
  5. #include <linux/lockdep.h>
  6. #include <linux/percpu-rwsem.h>
  7. #include <linux/rcupdate.h>
  8. #include <linux/sched.h>
  9. #include <linux/errno.h>
  10. int __percpu_init_rwsem(struct percpu_rw_semaphore *brw,
  11. const char *name, struct lock_class_key *rwsem_key)
  12. {
  13. brw->fast_read_ctr = alloc_percpu(int);
  14. if (unlikely(!brw->fast_read_ctr))
  15. return -ENOMEM;
  16. /* ->rw_sem represents the whole percpu_rw_semaphore for lockdep */
  17. __init_rwsem(&brw->rw_sem, name, rwsem_key);
  18. rcu_sync_init(&brw->rss, RCU_SCHED_SYNC);
  19. atomic_set(&brw->slow_read_ctr, 0);
  20. init_waitqueue_head(&brw->write_waitq);
  21. return 0;
  22. }
  23. EXPORT_SYMBOL_GPL(__percpu_init_rwsem);
  24. void percpu_free_rwsem(struct percpu_rw_semaphore *brw)
  25. {
  26. /*
  27. * XXX: temporary kludge. The error path in alloc_super()
  28. * assumes that percpu_free_rwsem() is safe after kzalloc().
  29. */
  30. if (!brw->fast_read_ctr)
  31. return;
  32. rcu_sync_dtor(&brw->rss);
  33. free_percpu(brw->fast_read_ctr);
  34. brw->fast_read_ctr = NULL; /* catch use after free bugs */
  35. }
  36. /*
  37. * This is the fast-path for down_read/up_read. If it succeeds we rely
  38. * on the barriers provided by rcu_sync_enter/exit; see the comments in
  39. * percpu_down_write() and percpu_up_write().
  40. *
  41. * If this helper fails the callers rely on the normal rw_semaphore and
  42. * atomic_dec_and_test(), so in this case we have the necessary barriers.
  43. */
  44. static bool update_fast_ctr(struct percpu_rw_semaphore *brw, unsigned int val)
  45. {
  46. bool success;
  47. preempt_disable();
  48. success = rcu_sync_is_idle(&brw->rss);
  49. if (likely(success))
  50. __this_cpu_add(*brw->fast_read_ctr, val);
  51. preempt_enable();
  52. return success;
  53. }
  54. /*
  55. * Like the normal down_read() this is not recursive, the writer can
  56. * come after the first percpu_down_read() and create the deadlock.
  57. *
  58. * Note: returns with lock_is_held(brw->rw_sem) == T for lockdep,
  59. * percpu_up_read() does rwsem_release(). This pairs with the usage
  60. * of ->rw_sem in percpu_down/up_write().
  61. */
  62. void percpu_down_read(struct percpu_rw_semaphore *brw)
  63. {
  64. might_sleep();
  65. rwsem_acquire_read(&brw->rw_sem.dep_map, 0, 0, _RET_IP_);
  66. if (likely(update_fast_ctr(brw, +1)))
  67. return;
  68. /* Avoid rwsem_acquire_read() and rwsem_release() */
  69. __down_read(&brw->rw_sem);
  70. atomic_inc(&brw->slow_read_ctr);
  71. __up_read(&brw->rw_sem);
  72. }
  73. EXPORT_SYMBOL_GPL(percpu_down_read);
  74. int percpu_down_read_trylock(struct percpu_rw_semaphore *brw)
  75. {
  76. if (unlikely(!update_fast_ctr(brw, +1))) {
  77. if (!__down_read_trylock(&brw->rw_sem))
  78. return 0;
  79. atomic_inc(&brw->slow_read_ctr);
  80. __up_read(&brw->rw_sem);
  81. }
  82. rwsem_acquire_read(&brw->rw_sem.dep_map, 0, 1, _RET_IP_);
  83. return 1;
  84. }
  85. void percpu_up_read(struct percpu_rw_semaphore *brw)
  86. {
  87. rwsem_release(&brw->rw_sem.dep_map, 1, _RET_IP_);
  88. if (likely(update_fast_ctr(brw, -1)))
  89. return;
  90. /* false-positive is possible but harmless */
  91. if (atomic_dec_and_test(&brw->slow_read_ctr))
  92. wake_up_all(&brw->write_waitq);
  93. }
  94. EXPORT_SYMBOL_GPL(percpu_up_read);
  95. static int clear_fast_ctr(struct percpu_rw_semaphore *brw)
  96. {
  97. unsigned int sum = 0;
  98. int cpu;
  99. for_each_possible_cpu(cpu) {
  100. sum += per_cpu(*brw->fast_read_ctr, cpu);
  101. per_cpu(*brw->fast_read_ctr, cpu) = 0;
  102. }
  103. return sum;
  104. }
  105. void percpu_down_write(struct percpu_rw_semaphore *brw)
  106. {
  107. /*
  108. * Make rcu_sync_is_idle() == F and thus disable the fast-path in
  109. * percpu_down_read() and percpu_up_read(), and wait for gp pass.
  110. *
  111. * The latter synchronises us with the preceding readers which used
  112. * the fast-past, so we can not miss the result of __this_cpu_add()
  113. * or anything else inside their criticial sections.
  114. */
  115. rcu_sync_enter(&brw->rss);
  116. /* exclude other writers, and block the new readers completely */
  117. down_write(&brw->rw_sem);
  118. /* nobody can use fast_read_ctr, move its sum into slow_read_ctr */
  119. atomic_add(clear_fast_ctr(brw), &brw->slow_read_ctr);
  120. /* wait for all readers to complete their percpu_up_read() */
  121. wait_event(brw->write_waitq, !atomic_read(&brw->slow_read_ctr));
  122. }
  123. EXPORT_SYMBOL_GPL(percpu_down_write);
  124. void percpu_up_write(struct percpu_rw_semaphore *brw)
  125. {
  126. /* release the lock, but the readers can't use the fast-path */
  127. up_write(&brw->rw_sem);
  128. /*
  129. * Enable the fast-path in percpu_down_read() and percpu_up_read()
  130. * but only after another gp pass; this adds the necessary barrier
  131. * to ensure the reader can't miss the changes done by us.
  132. */
  133. rcu_sync_exit(&brw->rss);
  134. }
  135. EXPORT_SYMBOL_GPL(percpu_up_write);