rwsem-spinlock.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305
  1. /* rwsem-spinlock.c: R/W semaphores: contention handling functions for
  2. * generic spinlock implementation
  3. *
  4. * Copyright (c) 2001 David Howells (dhowells@redhat.com).
  5. * - Derived partially from idea by Andrea Arcangeli <andrea@suse.de>
  6. * - Derived also from comments by Linus
  7. */
  8. #include <linux/rwsem.h>
  9. #include <linux/sched.h>
  10. #include <linux/export.h>
  11. enum rwsem_waiter_type {
  12. RWSEM_WAITING_FOR_WRITE,
  13. RWSEM_WAITING_FOR_READ
  14. };
  15. struct rwsem_waiter {
  16. struct list_head list;
  17. struct task_struct *task;
  18. enum rwsem_waiter_type type;
  19. };
  20. int rwsem_is_locked(struct rw_semaphore *sem)
  21. {
  22. int ret = 1;
  23. unsigned long flags;
  24. if (raw_spin_trylock_irqsave(&sem->wait_lock, flags)) {
  25. ret = (sem->activity != 0);
  26. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  27. }
  28. return ret;
  29. }
  30. EXPORT_SYMBOL(rwsem_is_locked);
  31. /*
  32. * initialise the semaphore
  33. */
  34. void __init_rwsem(struct rw_semaphore *sem, const char *name,
  35. struct lock_class_key *key)
  36. {
  37. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  38. /*
  39. * Make sure we are not reinitializing a held semaphore:
  40. */
  41. debug_check_no_locks_freed((void *)sem, sizeof(*sem));
  42. lockdep_init_map(&sem->dep_map, name, key, 0);
  43. #endif
  44. sem->activity = 0;
  45. raw_spin_lock_init(&sem->wait_lock);
  46. INIT_LIST_HEAD(&sem->wait_list);
  47. }
  48. EXPORT_SYMBOL(__init_rwsem);
  49. /*
  50. * handle the lock release when processes blocked on it that can now run
  51. * - if we come here, then:
  52. * - the 'active count' _reached_ zero
  53. * - the 'waiting count' is non-zero
  54. * - the spinlock must be held by the caller
  55. * - woken process blocks are discarded from the list after having task zeroed
  56. * - writers are only woken if wakewrite is non-zero
  57. */
  58. static inline struct rw_semaphore *
  59. __rwsem_do_wake(struct rw_semaphore *sem, int wakewrite)
  60. {
  61. struct rwsem_waiter *waiter;
  62. struct task_struct *tsk;
  63. int woken;
  64. waiter = list_entry(sem->wait_list.next, struct rwsem_waiter, list);
  65. if (!wakewrite) {
  66. if (waiter->type == RWSEM_WAITING_FOR_WRITE)
  67. goto out;
  68. goto dont_wake_writers;
  69. }
  70. /*
  71. * as we support write lock stealing, we can't set sem->activity
  72. * to -1 here to indicate we get the lock. Instead, we wake it up
  73. * to let it go get it again.
  74. */
  75. if (waiter->type == RWSEM_WAITING_FOR_WRITE) {
  76. wake_up_process(waiter->task);
  77. goto out;
  78. }
  79. /* grant an infinite number of read locks to the front of the queue */
  80. dont_wake_writers:
  81. woken = 0;
  82. while (waiter->type == RWSEM_WAITING_FOR_READ) {
  83. struct list_head *next = waiter->list.next;
  84. list_del(&waiter->list);
  85. tsk = waiter->task;
  86. smp_mb();
  87. waiter->task = NULL;
  88. wake_up_process(tsk);
  89. put_task_struct(tsk);
  90. woken++;
  91. if (list_empty(&sem->wait_list))
  92. break;
  93. waiter = list_entry(next, struct rwsem_waiter, list);
  94. }
  95. sem->activity += woken;
  96. out:
  97. return sem;
  98. }
  99. /*
  100. * wake a single writer
  101. */
  102. static inline struct rw_semaphore *
  103. __rwsem_wake_one_writer(struct rw_semaphore *sem)
  104. {
  105. struct rwsem_waiter *waiter;
  106. waiter = list_entry(sem->wait_list.next, struct rwsem_waiter, list);
  107. wake_up_process(waiter->task);
  108. return sem;
  109. }
  110. /*
  111. * get a read lock on the semaphore
  112. */
  113. void __sched __down_read(struct rw_semaphore *sem)
  114. {
  115. struct rwsem_waiter waiter;
  116. struct task_struct *tsk;
  117. unsigned long flags;
  118. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  119. if (sem->activity >= 0 && list_empty(&sem->wait_list)) {
  120. /* granted */
  121. sem->activity++;
  122. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  123. goto out;
  124. }
  125. tsk = current;
  126. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  127. /* set up my own style of waitqueue */
  128. waiter.task = tsk;
  129. waiter.type = RWSEM_WAITING_FOR_READ;
  130. get_task_struct(tsk);
  131. list_add_tail(&waiter.list, &sem->wait_list);
  132. /* we don't need to touch the semaphore struct anymore */
  133. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  134. /* wait to be given the lock */
  135. for (;;) {
  136. if (!waiter.task)
  137. break;
  138. schedule();
  139. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  140. }
  141. tsk->state = TASK_RUNNING;
  142. out:
  143. ;
  144. }
  145. /*
  146. * trylock for reading -- returns 1 if successful, 0 if contention
  147. */
  148. int __down_read_trylock(struct rw_semaphore *sem)
  149. {
  150. unsigned long flags;
  151. int ret = 0;
  152. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  153. if (sem->activity >= 0 && list_empty(&sem->wait_list)) {
  154. /* granted */
  155. sem->activity++;
  156. ret = 1;
  157. }
  158. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  159. return ret;
  160. }
  161. /*
  162. * get a write lock on the semaphore
  163. */
  164. void __sched __down_write_nested(struct rw_semaphore *sem, int subclass)
  165. {
  166. struct rwsem_waiter waiter;
  167. struct task_struct *tsk;
  168. unsigned long flags;
  169. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  170. /* set up my own style of waitqueue */
  171. tsk = current;
  172. waiter.task = tsk;
  173. waiter.type = RWSEM_WAITING_FOR_WRITE;
  174. list_add_tail(&waiter.list, &sem->wait_list);
  175. /* wait for someone to release the lock */
  176. for (;;) {
  177. /*
  178. * That is the key to support write lock stealing: allows the
  179. * task already on CPU to get the lock soon rather than put
  180. * itself into sleep and waiting for system woke it or someone
  181. * else in the head of the wait list up.
  182. */
  183. if (sem->activity == 0)
  184. break;
  185. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  186. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  187. schedule();
  188. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  189. }
  190. /* got the lock */
  191. sem->activity = -1;
  192. list_del(&waiter.list);
  193. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  194. }
  195. void __sched __down_write(struct rw_semaphore *sem)
  196. {
  197. __down_write_nested(sem, 0);
  198. }
  199. /*
  200. * trylock for writing -- returns 1 if successful, 0 if contention
  201. */
  202. int __down_write_trylock(struct rw_semaphore *sem)
  203. {
  204. unsigned long flags;
  205. int ret = 0;
  206. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  207. if (sem->activity == 0) {
  208. /* got the lock */
  209. sem->activity = -1;
  210. ret = 1;
  211. }
  212. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  213. return ret;
  214. }
  215. /*
  216. * release a read lock on the semaphore
  217. */
  218. void __up_read(struct rw_semaphore *sem)
  219. {
  220. unsigned long flags;
  221. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  222. if (--sem->activity == 0 && !list_empty(&sem->wait_list))
  223. sem = __rwsem_wake_one_writer(sem);
  224. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  225. }
  226. /*
  227. * release a write lock on the semaphore
  228. */
  229. void __up_write(struct rw_semaphore *sem)
  230. {
  231. unsigned long flags;
  232. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  233. sem->activity = 0;
  234. if (!list_empty(&sem->wait_list))
  235. sem = __rwsem_do_wake(sem, 1);
  236. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  237. }
  238. /*
  239. * downgrade a write lock into a read lock
  240. * - just wake up any readers at the front of the queue
  241. */
  242. void __downgrade_write(struct rw_semaphore *sem)
  243. {
  244. unsigned long flags;
  245. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  246. sem->activity = 1;
  247. if (!list_empty(&sem->wait_list))
  248. sem = __rwsem_do_wake(sem, 0);
  249. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  250. }