tty_ldsem.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453
  1. /*
  2. * Ldisc rw semaphore
  3. *
  4. * The ldisc semaphore is semantically a rw_semaphore but which enforces
  5. * an alternate policy, namely:
  6. * 1) Supports lock wait timeouts
  7. * 2) Write waiter has priority
  8. * 3) Downgrading is not supported
  9. *
  10. * Implementation notes:
  11. * 1) Upper half of semaphore count is a wait count (differs from rwsem
  12. * in that rwsem normalizes the upper half to the wait bias)
  13. * 2) Lacks overflow checking
  14. *
  15. * The generic counting was copied and modified from include/asm-generic/rwsem.h
  16. * by Paul Mackerras <paulus@samba.org>.
  17. *
  18. * The scheduling policy was copied and modified from lib/rwsem.c
  19. * Written by David Howells (dhowells@redhat.com).
  20. *
  21. * This implementation incorporates the write lock stealing work of
  22. * Michel Lespinasse <walken@google.com>.
  23. *
  24. * Copyright (C) 2013 Peter Hurley <peter@hurleysoftware.com>
  25. *
  26. * This file may be redistributed under the terms of the GNU General Public
  27. * License v2.
  28. */
  29. #include <linux/list.h>
  30. #include <linux/spinlock.h>
  31. #include <linux/atomic.h>
  32. #include <linux/tty.h>
  33. #include <linux/sched.h>
  34. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  35. # define __acq(l, s, t, r, c, n, i) \
  36. lock_acquire(&(l)->dep_map, s, t, r, c, n, i)
  37. # define __rel(l, n, i) \
  38. lock_release(&(l)->dep_map, n, i)
  39. # ifdef CONFIG_PROVE_LOCKING
  40. # define lockdep_acquire(l, s, t, i) __acq(l, s, t, 0, 2, NULL, i)
  41. # define lockdep_acquire_nest(l, s, t, n, i) __acq(l, s, t, 0, 2, n, i)
  42. # define lockdep_acquire_read(l, s, t, i) __acq(l, s, t, 1, 2, NULL, i)
  43. # define lockdep_release(l, n, i) __rel(l, n, i)
  44. # else
  45. # define lockdep_acquire(l, s, t, i) __acq(l, s, t, 0, 1, NULL, i)
  46. # define lockdep_acquire_nest(l, s, t, n, i) __acq(l, s, t, 0, 1, n, i)
  47. # define lockdep_acquire_read(l, s, t, i) __acq(l, s, t, 1, 1, NULL, i)
  48. # define lockdep_release(l, n, i) __rel(l, n, i)
  49. # endif
  50. #else
  51. # define lockdep_acquire(l, s, t, i) do { } while (0)
  52. # define lockdep_acquire_nest(l, s, t, n, i) do { } while (0)
  53. # define lockdep_acquire_read(l, s, t, i) do { } while (0)
  54. # define lockdep_release(l, n, i) do { } while (0)
  55. #endif
  56. #ifdef CONFIG_LOCK_STAT
  57. # define lock_stat(_lock, stat) lock_##stat(&(_lock)->dep_map, _RET_IP_)
  58. #else
  59. # define lock_stat(_lock, stat) do { } while (0)
  60. #endif
  61. #if BITS_PER_LONG == 64
  62. # define LDSEM_ACTIVE_MASK 0xffffffffL
  63. #else
  64. # define LDSEM_ACTIVE_MASK 0x0000ffffL
  65. #endif
  66. #define LDSEM_UNLOCKED 0L
  67. #define LDSEM_ACTIVE_BIAS 1L
  68. #define LDSEM_WAIT_BIAS (-LDSEM_ACTIVE_MASK-1)
  69. #define LDSEM_READ_BIAS LDSEM_ACTIVE_BIAS
  70. #define LDSEM_WRITE_BIAS (LDSEM_WAIT_BIAS + LDSEM_ACTIVE_BIAS)
  71. struct ldsem_waiter {
  72. struct list_head list;
  73. struct task_struct *task;
  74. };
  75. static inline long ldsem_atomic_update(long delta, struct ld_semaphore *sem)
  76. {
  77. return atomic_long_add_return(delta, (atomic_long_t *)&sem->count);
  78. }
  79. static inline int ldsem_cmpxchg(long *old, long new, struct ld_semaphore *sem)
  80. {
  81. long tmp = *old;
  82. *old = atomic_long_cmpxchg(&sem->count, *old, new);
  83. return *old == tmp;
  84. }
  85. /*
  86. * Initialize an ldsem:
  87. */
  88. void __init_ldsem(struct ld_semaphore *sem, const char *name,
  89. struct lock_class_key *key)
  90. {
  91. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  92. /*
  93. * Make sure we are not reinitializing a held semaphore:
  94. */
  95. debug_check_no_locks_freed((void *)sem, sizeof(*sem));
  96. lockdep_init_map(&sem->dep_map, name, key, 0);
  97. #endif
  98. sem->count = LDSEM_UNLOCKED;
  99. sem->wait_readers = 0;
  100. raw_spin_lock_init(&sem->wait_lock);
  101. INIT_LIST_HEAD(&sem->read_wait);
  102. INIT_LIST_HEAD(&sem->write_wait);
  103. }
  104. static void __ldsem_wake_readers(struct ld_semaphore *sem)
  105. {
  106. struct ldsem_waiter *waiter, *next;
  107. struct task_struct *tsk;
  108. long adjust, count;
  109. /* Try to grant read locks to all readers on the read wait list.
  110. * Note the 'active part' of the count is incremented by
  111. * the number of readers before waking any processes up.
  112. */
  113. adjust = sem->wait_readers * (LDSEM_ACTIVE_BIAS - LDSEM_WAIT_BIAS);
  114. count = ldsem_atomic_update(adjust, sem);
  115. do {
  116. if (count > 0)
  117. break;
  118. if (ldsem_cmpxchg(&count, count - adjust, sem))
  119. return;
  120. } while (1);
  121. list_for_each_entry_safe(waiter, next, &sem->read_wait, list) {
  122. tsk = waiter->task;
  123. smp_mb();
  124. waiter->task = NULL;
  125. wake_up_process(tsk);
  126. put_task_struct(tsk);
  127. }
  128. INIT_LIST_HEAD(&sem->read_wait);
  129. sem->wait_readers = 0;
  130. }
  131. static inline int writer_trylock(struct ld_semaphore *sem)
  132. {
  133. /* only wake this writer if the active part of the count can be
  134. * transitioned from 0 -> 1
  135. */
  136. long count = ldsem_atomic_update(LDSEM_ACTIVE_BIAS, sem);
  137. do {
  138. if ((count & LDSEM_ACTIVE_MASK) == LDSEM_ACTIVE_BIAS)
  139. return 1;
  140. if (ldsem_cmpxchg(&count, count - LDSEM_ACTIVE_BIAS, sem))
  141. return 0;
  142. } while (1);
  143. }
  144. static void __ldsem_wake_writer(struct ld_semaphore *sem)
  145. {
  146. struct ldsem_waiter *waiter;
  147. waiter = list_entry(sem->write_wait.next, struct ldsem_waiter, list);
  148. wake_up_process(waiter->task);
  149. }
  150. /*
  151. * handle the lock release when processes blocked on it that can now run
  152. * - if we come here from up_xxxx(), then:
  153. * - the 'active part' of count (&0x0000ffff) reached 0 (but may have changed)
  154. * - the 'waiting part' of count (&0xffff0000) is -ve (and will still be so)
  155. * - the spinlock must be held by the caller
  156. * - woken process blocks are discarded from the list after having task zeroed
  157. */
  158. static void __ldsem_wake(struct ld_semaphore *sem)
  159. {
  160. if (!list_empty(&sem->write_wait))
  161. __ldsem_wake_writer(sem);
  162. else if (!list_empty(&sem->read_wait))
  163. __ldsem_wake_readers(sem);
  164. }
  165. static void ldsem_wake(struct ld_semaphore *sem)
  166. {
  167. unsigned long flags;
  168. raw_spin_lock_irqsave(&sem->wait_lock, flags);
  169. __ldsem_wake(sem);
  170. raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
  171. }
  172. /*
  173. * wait for the read lock to be granted
  174. */
  175. static struct ld_semaphore __sched *
  176. down_read_failed(struct ld_semaphore *sem, long count, long timeout)
  177. {
  178. struct ldsem_waiter waiter;
  179. struct task_struct *tsk = current;
  180. long adjust = -LDSEM_ACTIVE_BIAS + LDSEM_WAIT_BIAS;
  181. /* set up my own style of waitqueue */
  182. raw_spin_lock_irq(&sem->wait_lock);
  183. /* Try to reverse the lock attempt but if the count has changed
  184. * so that reversing fails, check if there are are no waiters,
  185. * and early-out if not */
  186. do {
  187. if (ldsem_cmpxchg(&count, count + adjust, sem))
  188. break;
  189. if (count > 0) {
  190. raw_spin_unlock_irq(&sem->wait_lock);
  191. return sem;
  192. }
  193. } while (1);
  194. list_add_tail(&waiter.list, &sem->read_wait);
  195. sem->wait_readers++;
  196. waiter.task = tsk;
  197. get_task_struct(tsk);
  198. /* if there are no active locks, wake the new lock owner(s) */
  199. if ((count & LDSEM_ACTIVE_MASK) == 0)
  200. __ldsem_wake(sem);
  201. raw_spin_unlock_irq(&sem->wait_lock);
  202. /* wait to be given the lock */
  203. for (;;) {
  204. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  205. if (!waiter.task)
  206. break;
  207. if (!timeout)
  208. break;
  209. timeout = schedule_timeout(timeout);
  210. }
  211. __set_task_state(tsk, TASK_RUNNING);
  212. if (!timeout) {
  213. /* lock timed out but check if this task was just
  214. * granted lock ownership - if so, pretend there
  215. * was no timeout; otherwise, cleanup lock wait */
  216. raw_spin_lock_irq(&sem->wait_lock);
  217. if (waiter.task) {
  218. ldsem_atomic_update(-LDSEM_WAIT_BIAS, sem);
  219. list_del(&waiter.list);
  220. raw_spin_unlock_irq(&sem->wait_lock);
  221. put_task_struct(waiter.task);
  222. return NULL;
  223. }
  224. raw_spin_unlock_irq(&sem->wait_lock);
  225. }
  226. return sem;
  227. }
  228. /*
  229. * wait for the write lock to be granted
  230. */
  231. static struct ld_semaphore __sched *
  232. down_write_failed(struct ld_semaphore *sem, long count, long timeout)
  233. {
  234. struct ldsem_waiter waiter;
  235. struct task_struct *tsk = current;
  236. long adjust = -LDSEM_ACTIVE_BIAS;
  237. int locked = 0;
  238. /* set up my own style of waitqueue */
  239. raw_spin_lock_irq(&sem->wait_lock);
  240. /* Try to reverse the lock attempt but if the count has changed
  241. * so that reversing fails, check if the lock is now owned,
  242. * and early-out if so */
  243. do {
  244. if (ldsem_cmpxchg(&count, count + adjust, sem))
  245. break;
  246. if ((count & LDSEM_ACTIVE_MASK) == LDSEM_ACTIVE_BIAS) {
  247. raw_spin_unlock_irq(&sem->wait_lock);
  248. return sem;
  249. }
  250. } while (1);
  251. list_add_tail(&waiter.list, &sem->write_wait);
  252. waiter.task = tsk;
  253. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  254. for (;;) {
  255. if (!timeout)
  256. break;
  257. raw_spin_unlock_irq(&sem->wait_lock);
  258. timeout = schedule_timeout(timeout);
  259. raw_spin_lock_irq(&sem->wait_lock);
  260. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  261. if ((locked = writer_trylock(sem)))
  262. break;
  263. }
  264. if (!locked)
  265. ldsem_atomic_update(-LDSEM_WAIT_BIAS, sem);
  266. list_del(&waiter.list);
  267. raw_spin_unlock_irq(&sem->wait_lock);
  268. __set_task_state(tsk, TASK_RUNNING);
  269. /* lock wait may have timed out */
  270. if (!locked)
  271. return NULL;
  272. return sem;
  273. }
  274. static inline int __ldsem_down_read_nested(struct ld_semaphore *sem,
  275. int subclass, long timeout)
  276. {
  277. long count;
  278. lockdep_acquire_read(sem, subclass, 0, _RET_IP_);
  279. count = ldsem_atomic_update(LDSEM_READ_BIAS, sem);
  280. if (count <= 0) {
  281. lock_stat(sem, contended);
  282. if (!down_read_failed(sem, count, timeout)) {
  283. lockdep_release(sem, 1, _RET_IP_);
  284. return 0;
  285. }
  286. }
  287. lock_stat(sem, acquired);
  288. return 1;
  289. }
  290. static inline int __ldsem_down_write_nested(struct ld_semaphore *sem,
  291. int subclass, long timeout)
  292. {
  293. long count;
  294. lockdep_acquire(sem, subclass, 0, _RET_IP_);
  295. count = ldsem_atomic_update(LDSEM_WRITE_BIAS, sem);
  296. if ((count & LDSEM_ACTIVE_MASK) != LDSEM_ACTIVE_BIAS) {
  297. lock_stat(sem, contended);
  298. if (!down_write_failed(sem, count, timeout)) {
  299. lockdep_release(sem, 1, _RET_IP_);
  300. return 0;
  301. }
  302. }
  303. lock_stat(sem, acquired);
  304. return 1;
  305. }
  306. /*
  307. * lock for reading -- returns 1 if successful, 0 if timed out
  308. */
  309. int __sched ldsem_down_read(struct ld_semaphore *sem, long timeout)
  310. {
  311. might_sleep();
  312. return __ldsem_down_read_nested(sem, 0, timeout);
  313. }
  314. /*
  315. * trylock for reading -- returns 1 if successful, 0 if contention
  316. */
  317. int ldsem_down_read_trylock(struct ld_semaphore *sem)
  318. {
  319. long count = sem->count;
  320. while (count >= 0) {
  321. if (ldsem_cmpxchg(&count, count + LDSEM_READ_BIAS, sem)) {
  322. lockdep_acquire_read(sem, 0, 1, _RET_IP_);
  323. lock_stat(sem, acquired);
  324. return 1;
  325. }
  326. }
  327. return 0;
  328. }
  329. /*
  330. * lock for writing -- returns 1 if successful, 0 if timed out
  331. */
  332. int __sched ldsem_down_write(struct ld_semaphore *sem, long timeout)
  333. {
  334. might_sleep();
  335. return __ldsem_down_write_nested(sem, 0, timeout);
  336. }
  337. /*
  338. * trylock for writing -- returns 1 if successful, 0 if contention
  339. */
  340. int ldsem_down_write_trylock(struct ld_semaphore *sem)
  341. {
  342. long count = sem->count;
  343. while ((count & LDSEM_ACTIVE_MASK) == 0) {
  344. if (ldsem_cmpxchg(&count, count + LDSEM_WRITE_BIAS, sem)) {
  345. lockdep_acquire(sem, 0, 1, _RET_IP_);
  346. lock_stat(sem, acquired);
  347. return 1;
  348. }
  349. }
  350. return 0;
  351. }
  352. /*
  353. * release a read lock
  354. */
  355. void ldsem_up_read(struct ld_semaphore *sem)
  356. {
  357. long count;
  358. lockdep_release(sem, 1, _RET_IP_);
  359. count = ldsem_atomic_update(-LDSEM_READ_BIAS, sem);
  360. if (count < 0 && (count & LDSEM_ACTIVE_MASK) == 0)
  361. ldsem_wake(sem);
  362. }
  363. /*
  364. * release a write lock
  365. */
  366. void ldsem_up_write(struct ld_semaphore *sem)
  367. {
  368. long count;
  369. lockdep_release(sem, 1, _RET_IP_);
  370. count = ldsem_atomic_update(-LDSEM_WRITE_BIAS, sem);
  371. if (count < 0)
  372. ldsem_wake(sem);
  373. }
  374. #ifdef CONFIG_DEBUG_LOCK_ALLOC
  375. int ldsem_down_read_nested(struct ld_semaphore *sem, int subclass, long timeout)
  376. {
  377. might_sleep();
  378. return __ldsem_down_read_nested(sem, subclass, timeout);
  379. }
  380. int ldsem_down_write_nested(struct ld_semaphore *sem, int subclass,
  381. long timeout)
  382. {
  383. might_sleep();
  384. return __ldsem_down_write_nested(sem, subclass, timeout);
  385. }
  386. #endif