percpu-rwsem.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  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. EXPORT_SYMBOL_GPL(percpu_free_rwsem);
  37. /*
  38. * This is the fast-path for down_read/up_read. If it succeeds we rely
  39. * on the barriers provided by rcu_sync_enter/exit; see the comments in
  40. * percpu_down_write() and percpu_up_write().
  41. *
  42. * If this helper fails the callers rely on the normal rw_semaphore and
  43. * atomic_dec_and_test(), so in this case we have the necessary barriers.
  44. */
  45. static bool update_fast_ctr(struct percpu_rw_semaphore *brw, unsigned int val)
  46. {
  47. bool success;
  48. preempt_disable();
  49. success = rcu_sync_is_idle(&brw->rss);
  50. if (likely(success))
  51. __this_cpu_add(*brw->fast_read_ctr, val);
  52. preempt_enable();
  53. return success;
  54. }
  55. /*
  56. * Like the normal down_read() this is not recursive, the writer can
  57. * come after the first percpu_down_read() and create the deadlock.
  58. *
  59. * Note: returns with lock_is_held(brw->rw_sem) == T for lockdep,
  60. * percpu_up_read() does rwsem_release(). This pairs with the usage
  61. * of ->rw_sem in percpu_down/up_write().
  62. */
  63. void percpu_down_read(struct percpu_rw_semaphore *brw)
  64. {
  65. might_sleep();
  66. rwsem_acquire_read(&brw->rw_sem.dep_map, 0, 0, _RET_IP_);
  67. if (likely(update_fast_ctr(brw, +1)))
  68. return;
  69. /* Avoid rwsem_acquire_read() and rwsem_release() */
  70. __down_read(&brw->rw_sem);
  71. atomic_inc(&brw->slow_read_ctr);
  72. __up_read(&brw->rw_sem);
  73. }
  74. EXPORT_SYMBOL_GPL(percpu_down_read);
  75. int percpu_down_read_trylock(struct percpu_rw_semaphore *brw)
  76. {
  77. if (unlikely(!update_fast_ctr(brw, +1))) {
  78. if (!__down_read_trylock(&brw->rw_sem))
  79. return 0;
  80. atomic_inc(&brw->slow_read_ctr);
  81. __up_read(&brw->rw_sem);
  82. }
  83. rwsem_acquire_read(&brw->rw_sem.dep_map, 0, 1, _RET_IP_);
  84. return 1;
  85. }
  86. void percpu_up_read(struct percpu_rw_semaphore *brw)
  87. {
  88. rwsem_release(&brw->rw_sem.dep_map, 1, _RET_IP_);
  89. if (likely(update_fast_ctr(brw, -1)))
  90. return;
  91. /* false-positive is possible but harmless */
  92. if (atomic_dec_and_test(&brw->slow_read_ctr))
  93. wake_up_all(&brw->write_waitq);
  94. }
  95. EXPORT_SYMBOL_GPL(percpu_up_read);
  96. static int clear_fast_ctr(struct percpu_rw_semaphore *brw)
  97. {
  98. unsigned int sum = 0;
  99. int cpu;
  100. for_each_possible_cpu(cpu) {
  101. sum += per_cpu(*brw->fast_read_ctr, cpu);
  102. per_cpu(*brw->fast_read_ctr, cpu) = 0;
  103. }
  104. return sum;
  105. }
  106. void percpu_down_write(struct percpu_rw_semaphore *brw)
  107. {
  108. /*
  109. * Make rcu_sync_is_idle() == F and thus disable the fast-path in
  110. * percpu_down_read() and percpu_up_read(), and wait for gp pass.
  111. *
  112. * The latter synchronises us with the preceding readers which used
  113. * the fast-past, so we can not miss the result of __this_cpu_add()
  114. * or anything else inside their criticial sections.
  115. */
  116. rcu_sync_enter(&brw->rss);
  117. /* exclude other writers, and block the new readers completely */
  118. down_write(&brw->rw_sem);
  119. /* nobody can use fast_read_ctr, move its sum into slow_read_ctr */
  120. atomic_add(clear_fast_ctr(brw), &brw->slow_read_ctr);
  121. /* wait for all readers to complete their percpu_up_read() */
  122. wait_event(brw->write_waitq, !atomic_read(&brw->slow_read_ctr));
  123. }
  124. EXPORT_SYMBOL_GPL(percpu_down_write);
  125. void percpu_up_write(struct percpu_rw_semaphore *brw)
  126. {
  127. /* release the lock, but the readers can't use the fast-path */
  128. up_write(&brw->rw_sem);
  129. /*
  130. * Enable the fast-path in percpu_down_read() and percpu_up_read()
  131. * but only after another gp pass; this adds the necessary barrier
  132. * to ensure the reader can't miss the changes done by us.
  133. */
  134. rcu_sync_exit(&brw->rss);
  135. }
  136. EXPORT_SYMBOL_GPL(percpu_up_write);