tty_ldsem.c 11 KB

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