]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* rwsem.c: R/W semaphores: contention handling functions |
2 | * | |
3 | * Written by David Howells (dhowells@redhat.com). | |
4 | * Derived from arch/i386/kernel/semaphore.c | |
ce6711f3 AS |
5 | * |
6 | * Writer lock-stealing by Alex Shi <alex.shi@intel.com> | |
fe6e674c | 7 | * and Michel Lespinasse <walken@google.com> |
4fc828e2 DB |
8 | * |
9 | * Optimistic spinning by Tim Chen <tim.c.chen@intel.com> | |
10 | * and Davidlohr Bueso <davidlohr@hp.com>. Based on mutexes. | |
1da177e4 LT |
11 | */ |
12 | #include <linux/rwsem.h> | |
13 | #include <linux/sched.h> | |
14 | #include <linux/init.h> | |
8bc3bcc9 | 15 | #include <linux/export.h> |
4fc828e2 | 16 | #include <linux/sched/rt.h> |
7a215f89 | 17 | #include <linux/osq_lock.h> |
4fc828e2 | 18 | |
7a215f89 | 19 | #include "rwsem.h" |
1da177e4 | 20 | |
3cf2f34e TC |
21 | /* |
22 | * Guide to the rw_semaphore's count field for common values. | |
23 | * (32-bit case illustrated, similar for 64-bit) | |
24 | * | |
25 | * 0x0000000X (1) X readers active or attempting lock, no writer waiting | |
26 | * X = #active_readers + #readers attempting to lock | |
27 | * (X*ACTIVE_BIAS) | |
28 | * | |
29 | * 0x00000000 rwsem is unlocked, and no one is waiting for the lock or | |
30 | * attempting to read lock or write lock. | |
31 | * | |
32 | * 0xffff000X (1) X readers active or attempting lock, with waiters for lock | |
33 | * X = #active readers + # readers attempting lock | |
34 | * (X*ACTIVE_BIAS + WAITING_BIAS) | |
35 | * (2) 1 writer attempting lock, no waiters for lock | |
36 | * X-1 = #active readers + #readers attempting lock | |
37 | * ((X-1)*ACTIVE_BIAS + ACTIVE_WRITE_BIAS) | |
38 | * (3) 1 writer active, no waiters for lock | |
39 | * X-1 = #active readers + #readers attempting lock | |
40 | * ((X-1)*ACTIVE_BIAS + ACTIVE_WRITE_BIAS) | |
41 | * | |
42 | * 0xffff0001 (1) 1 reader active or attempting lock, waiters for lock | |
43 | * (WAITING_BIAS + ACTIVE_BIAS) | |
44 | * (2) 1 writer active or attempting lock, no waiters for lock | |
45 | * (ACTIVE_WRITE_BIAS) | |
46 | * | |
47 | * 0xffff0000 (1) There are writers or readers queued but none active | |
48 | * or in the process of attempting lock. | |
49 | * (WAITING_BIAS) | |
50 | * Note: writer can attempt to steal lock for this count by adding | |
51 | * ACTIVE_WRITE_BIAS in cmpxchg and checking the old count | |
52 | * | |
53 | * 0xfffe0001 (1) 1 writer active, or attempting lock. Waiters on queue. | |
54 | * (ACTIVE_WRITE_BIAS + WAITING_BIAS) | |
55 | * | |
56 | * Note: Readers attempt to lock by adding ACTIVE_BIAS in down_read and checking | |
57 | * the count becomes more than 0 for successful lock acquisition, | |
58 | * i.e. the case where there are only readers or nobody has lock. | |
59 | * (1st and 2nd case above). | |
60 | * | |
61 | * Writers attempt to lock by adding ACTIVE_WRITE_BIAS in down_write and | |
62 | * checking the count becomes ACTIVE_WRITE_BIAS for successful lock | |
63 | * acquisition (i.e. nobody else has lock or attempts lock). If | |
64 | * unsuccessful, in rwsem_down_write_failed, we'll check to see if there | |
65 | * are only waiters but none active (5th case above), and attempt to | |
66 | * steal the lock. | |
67 | * | |
68 | */ | |
69 | ||
4ea2176d IM |
70 | /* |
71 | * Initialize an rwsem: | |
72 | */ | |
73 | void __init_rwsem(struct rw_semaphore *sem, const char *name, | |
74 | struct lock_class_key *key) | |
75 | { | |
76 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
77 | /* | |
78 | * Make sure we are not reinitializing a held semaphore: | |
79 | */ | |
80 | debug_check_no_locks_freed((void *)sem, sizeof(*sem)); | |
4dfbb9d8 | 81 | lockdep_init_map(&sem->dep_map, name, key, 0); |
4ea2176d | 82 | #endif |
8ee62b18 | 83 | atomic_long_set(&sem->count, RWSEM_UNLOCKED_VALUE); |
ddb6c9b5 | 84 | raw_spin_lock_init(&sem->wait_lock); |
4ea2176d | 85 | INIT_LIST_HEAD(&sem->wait_list); |
5db6c6fe | 86 | #ifdef CONFIG_RWSEM_SPIN_ON_OWNER |
4fc828e2 | 87 | sem->owner = NULL; |
4d9d951e | 88 | osq_lock_init(&sem->osq); |
4fc828e2 | 89 | #endif |
4ea2176d IM |
90 | } |
91 | ||
92 | EXPORT_SYMBOL(__init_rwsem); | |
93 | ||
e2d57f78 ML |
94 | enum rwsem_waiter_type { |
95 | RWSEM_WAITING_FOR_WRITE, | |
96 | RWSEM_WAITING_FOR_READ | |
97 | }; | |
98 | ||
1da177e4 LT |
99 | struct rwsem_waiter { |
100 | struct list_head list; | |
101 | struct task_struct *task; | |
e2d57f78 | 102 | enum rwsem_waiter_type type; |
1da177e4 LT |
103 | }; |
104 | ||
fe6e674c ML |
105 | enum rwsem_wake_type { |
106 | RWSEM_WAKE_ANY, /* Wake whatever's at head of wait list */ | |
107 | RWSEM_WAKE_READERS, /* Wake readers only */ | |
108 | RWSEM_WAKE_READ_OWNED /* Waker thread holds the read lock */ | |
109 | }; | |
70bdc6e0 | 110 | |
1da177e4 LT |
111 | /* |
112 | * handle the lock release when processes blocked on it that can now run | |
113 | * - if we come here from up_xxxx(), then: | |
114 | * - the 'active part' of count (&0x0000ffff) reached 0 (but may have changed) | |
115 | * - the 'waiting part' of count (&0xffff0000) is -ve (and will still be so) | |
345af7bf | 116 | * - there must be someone on the queue |
133e89ef DB |
117 | * - the wait_lock must be held by the caller |
118 | * - tasks are marked for wakeup, the caller must later invoke wake_up_q() | |
119 | * to actually wakeup the blocked task(s) and drop the reference count, | |
120 | * preferably when the wait_lock is released | |
1da177e4 | 121 | * - woken process blocks are discarded from the list after having task zeroed |
133e89ef | 122 | * - writers are only marked woken if downgrading is false |
1da177e4 | 123 | */ |
84b23f9b DB |
124 | static void __rwsem_mark_wake(struct rw_semaphore *sem, |
125 | enum rwsem_wake_type wake_type, | |
126 | struct wake_q_head *wake_q) | |
1da177e4 | 127 | { |
70800c3c DB |
128 | struct rwsem_waiter *waiter, *tmp; |
129 | long oldcount, woken = 0, adjustment = 0; | |
1da177e4 | 130 | |
70800c3c DB |
131 | /* |
132 | * Take a peek at the queue head waiter such that we can determine | |
133 | * the wakeup(s) to perform. | |
134 | */ | |
135 | waiter = list_first_entry(&sem->wait_list, struct rwsem_waiter, list); | |
84b23f9b | 136 | |
8cf5322c | 137 | if (waiter->type == RWSEM_WAITING_FOR_WRITE) { |
133e89ef DB |
138 | if (wake_type == RWSEM_WAKE_ANY) { |
139 | /* | |
140 | * Mark writer at the front of the queue for wakeup. | |
141 | * Until the task is actually later awoken later by | |
142 | * the caller, other writers are able to steal it. | |
143 | * Readers, on the other hand, will block as they | |
144 | * will notice the queued writer. | |
8cf5322c | 145 | */ |
133e89ef DB |
146 | wake_q_add(wake_q, waiter->task); |
147 | } | |
84b23f9b DB |
148 | |
149 | return; | |
8cf5322c | 150 | } |
1da177e4 | 151 | |
84b23f9b DB |
152 | /* |
153 | * Writers might steal the lock before we grant it to the next reader. | |
fe6e674c ML |
154 | * We prefer to do the first reader grant before counting readers |
155 | * so we can bail out early if a writer stole the lock. | |
70bdc6e0 | 156 | */ |
fe6e674c ML |
157 | if (wake_type != RWSEM_WAKE_READ_OWNED) { |
158 | adjustment = RWSEM_ACTIVE_READ_BIAS; | |
159 | try_reader_grant: | |
86a3b5f3 | 160 | oldcount = atomic_long_fetch_add(adjustment, &sem->count); |
fe6e674c | 161 | if (unlikely(oldcount < RWSEM_WAITING_BIAS)) { |
bf7b4c47 WL |
162 | /* |
163 | * If the count is still less than RWSEM_WAITING_BIAS | |
164 | * after removing the adjustment, it is assumed that | |
165 | * a writer has stolen the lock. We have to undo our | |
166 | * reader grant. | |
167 | */ | |
168 | if (atomic_long_add_return(-adjustment, &sem->count) < | |
169 | RWSEM_WAITING_BIAS) | |
84b23f9b DB |
170 | return; |
171 | ||
fe6e674c ML |
172 | /* Last active locker left. Retry waking readers. */ |
173 | goto try_reader_grant; | |
174 | } | |
19c5d690 WL |
175 | /* |
176 | * It is not really necessary to set it to reader-owned here, | |
177 | * but it gives the spinners an early indication that the | |
178 | * readers now have the lock. | |
179 | */ | |
180 | rwsem_set_reader_owned(sem); | |
fe6e674c | 181 | } |
1da177e4 | 182 | |
84b23f9b DB |
183 | /* |
184 | * Grant an infinite number of read locks to the readers at the front | |
70800c3c DB |
185 | * of the queue. We know that woken will be at least 1 as we accounted |
186 | * for above. Note we increment the 'active part' of the count by the | |
187 | * number of readers before waking any processes up. | |
1da177e4 | 188 | */ |
70800c3c DB |
189 | list_for_each_entry_safe(waiter, tmp, &sem->wait_list, list) { |
190 | struct task_struct *tsk; | |
1da177e4 | 191 | |
70800c3c | 192 | if (waiter->type == RWSEM_WAITING_FOR_WRITE) |
1da177e4 LT |
193 | break; |
194 | ||
70800c3c | 195 | woken++; |
1da177e4 | 196 | tsk = waiter->task; |
e3851390 DB |
197 | |
198 | wake_q_add(wake_q, tsk); | |
70800c3c | 199 | list_del(&waiter->list); |
49e4b2bc | 200 | /* |
e3851390 DB |
201 | * Ensure that the last operation is setting the reader |
202 | * waiter to nil such that rwsem_down_read_failed() cannot | |
203 | * race with do_exit() by always holding a reference count | |
204 | * to the task to wakeup. | |
49e4b2bc | 205 | */ |
e3851390 | 206 | smp_store_release(&waiter->task, NULL); |
70800c3c | 207 | } |
1da177e4 | 208 | |
70800c3c DB |
209 | adjustment = woken * RWSEM_ACTIVE_READ_BIAS - adjustment; |
210 | if (list_empty(&sem->wait_list)) { | |
211 | /* hit end of list above */ | |
212 | adjustment -= RWSEM_WAITING_BIAS; | |
213 | } | |
214 | ||
215 | if (adjustment) | |
216 | atomic_long_add(adjustment, &sem->count); | |
ce6711f3 AS |
217 | } |
218 | ||
1da177e4 | 219 | /* |
4fc828e2 | 220 | * Wait for the read lock to be granted |
1da177e4 | 221 | */ |
3ebae4f3 | 222 | __visible |
1e78277c | 223 | struct rw_semaphore __sched *rwsem_down_read_failed(struct rw_semaphore *sem) |
1da177e4 | 224 | { |
b5f54181 | 225 | long count, adjustment = -RWSEM_ACTIVE_READ_BIAS; |
a8618a0e | 226 | struct rwsem_waiter waiter; |
1da177e4 | 227 | struct task_struct *tsk = current; |
194a6b5b | 228 | DEFINE_WAKE_Q(wake_q); |
1da177e4 | 229 | |
a8618a0e | 230 | waiter.task = tsk; |
da16922c | 231 | waiter.type = RWSEM_WAITING_FOR_READ; |
1da177e4 | 232 | |
f7dd1cee | 233 | raw_spin_lock_irq(&sem->wait_lock); |
fd41b334 ML |
234 | if (list_empty(&sem->wait_list)) |
235 | adjustment += RWSEM_WAITING_BIAS; | |
a8618a0e | 236 | list_add_tail(&waiter.list, &sem->wait_list); |
1da177e4 | 237 | |
70bdc6e0 | 238 | /* we're now waiting on the lock, but no longer actively locking */ |
8ee62b18 | 239 | count = atomic_long_add_return(adjustment, &sem->count); |
1da177e4 | 240 | |
70800c3c DB |
241 | /* |
242 | * If there are no active locks, wake the front queued process(es). | |
25c39325 ML |
243 | * |
244 | * If there are no writers and we are first in the queue, | |
245 | * wake our own waiter to join the existing active readers ! | |
246 | */ | |
247 | if (count == RWSEM_WAITING_BIAS || | |
248 | (count > RWSEM_WAITING_BIAS && | |
249 | adjustment != -RWSEM_ACTIVE_READ_BIAS)) | |
84b23f9b | 250 | __rwsem_mark_wake(sem, RWSEM_WAKE_ANY, &wake_q); |
1da177e4 | 251 | |
ddb6c9b5 | 252 | raw_spin_unlock_irq(&sem->wait_lock); |
133e89ef | 253 | wake_up_q(&wake_q); |
1da177e4 LT |
254 | |
255 | /* wait to be given the lock */ | |
f7dd1cee ML |
256 | while (true) { |
257 | set_task_state(tsk, TASK_UNINTERRUPTIBLE); | |
a8618a0e | 258 | if (!waiter.task) |
1da177e4 LT |
259 | break; |
260 | schedule(); | |
1da177e4 LT |
261 | } |
262 | ||
73105994 | 263 | __set_task_state(tsk, TASK_RUNNING); |
1da177e4 LT |
264 | return sem; |
265 | } | |
db0e716a | 266 | EXPORT_SYMBOL(rwsem_down_read_failed); |
1da177e4 | 267 | |
c0fcb6c2 JL |
268 | /* |
269 | * This function must be called with the sem->wait_lock held to prevent | |
270 | * race conditions between checking the rwsem wait list and setting the | |
271 | * sem->count accordingly. | |
272 | */ | |
4fc828e2 DB |
273 | static inline bool rwsem_try_write_lock(long count, struct rw_semaphore *sem) |
274 | { | |
debfab74 | 275 | /* |
c0fcb6c2 | 276 | * Avoid trying to acquire write lock if count isn't RWSEM_WAITING_BIAS. |
debfab74 | 277 | */ |
c0fcb6c2 JL |
278 | if (count != RWSEM_WAITING_BIAS) |
279 | return false; | |
280 | ||
281 | /* | |
282 | * Acquire the lock by trying to set it to ACTIVE_WRITE_BIAS. If there | |
283 | * are other tasks on the wait list, we need to add on WAITING_BIAS. | |
284 | */ | |
285 | count = list_is_singular(&sem->wait_list) ? | |
286 | RWSEM_ACTIVE_WRITE_BIAS : | |
287 | RWSEM_ACTIVE_WRITE_BIAS + RWSEM_WAITING_BIAS; | |
288 | ||
8ee62b18 JL |
289 | if (atomic_long_cmpxchg_acquire(&sem->count, RWSEM_WAITING_BIAS, count) |
290 | == RWSEM_WAITING_BIAS) { | |
7a215f89 | 291 | rwsem_set_owner(sem); |
debfab74 | 292 | return true; |
4fc828e2 | 293 | } |
debfab74 | 294 | |
4fc828e2 DB |
295 | return false; |
296 | } | |
297 | ||
5db6c6fe | 298 | #ifdef CONFIG_RWSEM_SPIN_ON_OWNER |
1da177e4 | 299 | /* |
4fc828e2 DB |
300 | * Try to acquire write lock before the writer has been put on wait queue. |
301 | */ | |
302 | static inline bool rwsem_try_write_lock_unqueued(struct rw_semaphore *sem) | |
303 | { | |
8ee62b18 | 304 | long old, count = atomic_long_read(&sem->count); |
4fc828e2 DB |
305 | |
306 | while (true) { | |
307 | if (!(count == 0 || count == RWSEM_WAITING_BIAS)) | |
308 | return false; | |
309 | ||
8ee62b18 | 310 | old = atomic_long_cmpxchg_acquire(&sem->count, count, |
00eb4bab | 311 | count + RWSEM_ACTIVE_WRITE_BIAS); |
7a215f89 DB |
312 | if (old == count) { |
313 | rwsem_set_owner(sem); | |
4fc828e2 | 314 | return true; |
7a215f89 | 315 | } |
4fc828e2 DB |
316 | |
317 | count = old; | |
318 | } | |
319 | } | |
320 | ||
321 | static inline bool rwsem_can_spin_on_owner(struct rw_semaphore *sem) | |
322 | { | |
323 | struct task_struct *owner; | |
1a993670 | 324 | bool ret = true; |
4fc828e2 DB |
325 | |
326 | if (need_resched()) | |
37e95624 | 327 | return false; |
4fc828e2 DB |
328 | |
329 | rcu_read_lock(); | |
4d3199e4 | 330 | owner = READ_ONCE(sem->owner); |
19c5d690 | 331 | if (!rwsem_owner_is_writer(owner)) { |
1a993670 | 332 | /* |
19c5d690 | 333 | * Don't spin if the rwsem is readers owned. |
1a993670 | 334 | */ |
19c5d690 | 335 | ret = !rwsem_owner_is_reader(owner); |
1a993670 DB |
336 | goto done; |
337 | } | |
4fc828e2 | 338 | |
05ffc951 PX |
339 | /* |
340 | * As lock holder preemption issue, we both skip spinning if task is not | |
341 | * on cpu or its cpu is preempted | |
342 | */ | |
343 | ret = owner->on_cpu && !vcpu_is_preempted(task_cpu(owner)); | |
1a993670 DB |
344 | done: |
345 | rcu_read_unlock(); | |
346 | return ret; | |
4fc828e2 DB |
347 | } |
348 | ||
ddd0fa73 WL |
349 | /* |
350 | * Return true only if we can still spin on the owner field of the rwsem. | |
351 | */ | |
352 | static noinline bool rwsem_spin_on_owner(struct rw_semaphore *sem) | |
4fc828e2 | 353 | { |
ddd0fa73 WL |
354 | struct task_struct *owner = READ_ONCE(sem->owner); |
355 | ||
356 | if (!rwsem_owner_is_writer(owner)) | |
357 | goto out; | |
358 | ||
4fc828e2 | 359 | rcu_read_lock(); |
9198f6ed JL |
360 | while (sem->owner == owner) { |
361 | /* | |
362 | * Ensure we emit the owner->on_cpu, dereference _after_ | |
363 | * checking sem->owner still matches owner, if that fails, | |
364 | * owner might point to free()d memory, if it still matches, | |
365 | * the rcu_read_lock() ensures the memory stays valid. | |
366 | */ | |
367 | barrier(); | |
368 | ||
05ffc951 PX |
369 | /* |
370 | * abort spinning when need_resched or owner is not running or | |
371 | * owner's cpu is preempted. | |
372 | */ | |
373 | if (!owner->on_cpu || need_resched() || | |
374 | vcpu_is_preempted(task_cpu(owner))) { | |
b3fd4f03 DB |
375 | rcu_read_unlock(); |
376 | return false; | |
377 | } | |
4fc828e2 | 378 | |
f2f09a4c | 379 | cpu_relax(); |
4fc828e2 DB |
380 | } |
381 | rcu_read_unlock(); | |
ddd0fa73 | 382 | out: |
4fc828e2 | 383 | /* |
19c5d690 WL |
384 | * If there is a new owner or the owner is not set, we continue |
385 | * spinning. | |
4fc828e2 | 386 | */ |
19c5d690 | 387 | return !rwsem_owner_is_reader(READ_ONCE(sem->owner)); |
4fc828e2 DB |
388 | } |
389 | ||
390 | static bool rwsem_optimistic_spin(struct rw_semaphore *sem) | |
391 | { | |
4fc828e2 DB |
392 | bool taken = false; |
393 | ||
394 | preempt_disable(); | |
395 | ||
396 | /* sem->wait_lock should not be held when doing optimistic spinning */ | |
397 | if (!rwsem_can_spin_on_owner(sem)) | |
398 | goto done; | |
399 | ||
400 | if (!osq_lock(&sem->osq)) | |
401 | goto done; | |
402 | ||
ddd0fa73 WL |
403 | /* |
404 | * Optimistically spin on the owner field and attempt to acquire the | |
405 | * lock whenever the owner changes. Spinning will be stopped when: | |
406 | * 1) the owning writer isn't running; or | |
407 | * 2) readers own the lock as we can't determine if they are | |
408 | * actively running or not. | |
409 | */ | |
410 | while (rwsem_spin_on_owner(sem)) { | |
19c5d690 | 411 | /* |
ddd0fa73 | 412 | * Try to acquire the lock |
19c5d690 | 413 | */ |
4fc828e2 DB |
414 | if (rwsem_try_write_lock_unqueued(sem)) { |
415 | taken = true; | |
416 | break; | |
417 | } | |
418 | ||
419 | /* | |
420 | * When there's no owner, we might have preempted between the | |
421 | * owner acquiring the lock and setting the owner field. If | |
422 | * we're an RT task that will live-lock because we won't let | |
423 | * the owner complete. | |
424 | */ | |
ddd0fa73 | 425 | if (!sem->owner && (need_resched() || rt_task(current))) |
4fc828e2 DB |
426 | break; |
427 | ||
428 | /* | |
429 | * The cpu_relax() call is a compiler barrier which forces | |
430 | * everything in this loop to be re-loaded. We don't need | |
431 | * memory barriers as we'll eventually observe the right | |
432 | * values at the cost of a few extra spins. | |
433 | */ | |
f2f09a4c | 434 | cpu_relax(); |
4fc828e2 DB |
435 | } |
436 | osq_unlock(&sem->osq); | |
437 | done: | |
438 | preempt_enable(); | |
439 | return taken; | |
440 | } | |
441 | ||
59aabfc7 WL |
442 | /* |
443 | * Return true if the rwsem has active spinner | |
444 | */ | |
445 | static inline bool rwsem_has_spinner(struct rw_semaphore *sem) | |
446 | { | |
447 | return osq_is_locked(&sem->osq); | |
448 | } | |
449 | ||
4fc828e2 DB |
450 | #else |
451 | static bool rwsem_optimistic_spin(struct rw_semaphore *sem) | |
452 | { | |
453 | return false; | |
454 | } | |
59aabfc7 WL |
455 | |
456 | static inline bool rwsem_has_spinner(struct rw_semaphore *sem) | |
457 | { | |
458 | return false; | |
459 | } | |
4fc828e2 DB |
460 | #endif |
461 | ||
462 | /* | |
463 | * Wait until we successfully acquire the write lock | |
1da177e4 | 464 | */ |
d4799608 MH |
465 | static inline struct rw_semaphore * |
466 | __rwsem_down_write_failed_common(struct rw_semaphore *sem, int state) | |
1da177e4 | 467 | { |
4fc828e2 DB |
468 | long count; |
469 | bool waiting = true; /* any queued threads before us */ | |
1e78277c | 470 | struct rwsem_waiter waiter; |
d4799608 | 471 | struct rw_semaphore *ret = sem; |
194a6b5b | 472 | DEFINE_WAKE_Q(wake_q); |
1e78277c | 473 | |
4fc828e2 | 474 | /* undo write bias from down_write operation, stop active locking */ |
8ee62b18 | 475 | count = atomic_long_sub_return(RWSEM_ACTIVE_WRITE_BIAS, &sem->count); |
4fc828e2 DB |
476 | |
477 | /* do optimistic spinning and steal lock if possible */ | |
478 | if (rwsem_optimistic_spin(sem)) | |
479 | return sem; | |
480 | ||
481 | /* | |
482 | * Optimistic spinning failed, proceed to the slowpath | |
483 | * and block until we can acquire the sem. | |
484 | */ | |
485 | waiter.task = current; | |
023fe4f7 | 486 | waiter.type = RWSEM_WAITING_FOR_WRITE; |
1e78277c ML |
487 | |
488 | raw_spin_lock_irq(&sem->wait_lock); | |
4fc828e2 DB |
489 | |
490 | /* account for this before adding a new element to the list */ | |
1e78277c | 491 | if (list_empty(&sem->wait_list)) |
4fc828e2 DB |
492 | waiting = false; |
493 | ||
1e78277c ML |
494 | list_add_tail(&waiter.list, &sem->wait_list); |
495 | ||
496 | /* we're now waiting on the lock, but no longer actively locking */ | |
4fc828e2 | 497 | if (waiting) { |
8ee62b18 | 498 | count = atomic_long_read(&sem->count); |
1e78277c | 499 | |
4fc828e2 | 500 | /* |
0cc3d011 AM |
501 | * If there were already threads queued before us and there are |
502 | * no active writers, the lock must be read owned; so we try to | |
503 | * wake any read locks that were queued ahead of us. | |
4fc828e2 | 504 | */ |
133e89ef | 505 | if (count > RWSEM_WAITING_BIAS) { |
194a6b5b | 506 | DEFINE_WAKE_Q(wake_q); |
133e89ef | 507 | |
84b23f9b | 508 | __rwsem_mark_wake(sem, RWSEM_WAKE_READERS, &wake_q); |
133e89ef DB |
509 | /* |
510 | * The wakeup is normally called _after_ the wait_lock | |
511 | * is released, but given that we are proactively waking | |
512 | * readers we can deal with the wake_q overhead as it is | |
513 | * similar to releasing and taking the wait_lock again | |
514 | * for attempting rwsem_try_write_lock(). | |
515 | */ | |
516 | wake_up_q(&wake_q); | |
517 | } | |
4fc828e2 DB |
518 | |
519 | } else | |
8ee62b18 | 520 | count = atomic_long_add_return(RWSEM_WAITING_BIAS, &sem->count); |
1e78277c | 521 | |
023fe4f7 | 522 | /* wait until we successfully acquire the lock */ |
d4799608 | 523 | set_current_state(state); |
1e78277c | 524 | while (true) { |
4fc828e2 DB |
525 | if (rwsem_try_write_lock(count, sem)) |
526 | break; | |
1e78277c | 527 | raw_spin_unlock_irq(&sem->wait_lock); |
a7d2c573 ML |
528 | |
529 | /* Block until there are no active lockers. */ | |
530 | do { | |
04cafed7 PZ |
531 | if (signal_pending_state(state, current)) |
532 | goto out_nolock; | |
533 | ||
a7d2c573 | 534 | schedule(); |
d4799608 | 535 | set_current_state(state); |
8ee62b18 | 536 | } while ((count = atomic_long_read(&sem->count)) & RWSEM_ACTIVE_MASK); |
a7d2c573 | 537 | |
023fe4f7 | 538 | raw_spin_lock_irq(&sem->wait_lock); |
1e78277c | 539 | } |
4fc828e2 | 540 | __set_current_state(TASK_RUNNING); |
023fe4f7 ML |
541 | list_del(&waiter.list); |
542 | raw_spin_unlock_irq(&sem->wait_lock); | |
1e78277c | 543 | |
d4799608 | 544 | return ret; |
04cafed7 PZ |
545 | |
546 | out_nolock: | |
547 | __set_current_state(TASK_RUNNING); | |
548 | raw_spin_lock_irq(&sem->wait_lock); | |
549 | list_del(&waiter.list); | |
550 | if (list_empty(&sem->wait_list)) | |
8ee62b18 | 551 | atomic_long_add(-RWSEM_WAITING_BIAS, &sem->count); |
04cafed7 | 552 | else |
133e89ef | 553 | __rwsem_mark_wake(sem, RWSEM_WAKE_ANY, &wake_q); |
04cafed7 | 554 | raw_spin_unlock_irq(&sem->wait_lock); |
133e89ef | 555 | wake_up_q(&wake_q); |
04cafed7 PZ |
556 | |
557 | return ERR_PTR(-EINTR); | |
d4799608 MH |
558 | } |
559 | ||
560 | __visible struct rw_semaphore * __sched | |
561 | rwsem_down_write_failed(struct rw_semaphore *sem) | |
562 | { | |
563 | return __rwsem_down_write_failed_common(sem, TASK_UNINTERRUPTIBLE); | |
1da177e4 | 564 | } |
db0e716a | 565 | EXPORT_SYMBOL(rwsem_down_write_failed); |
1da177e4 | 566 | |
d4799608 MH |
567 | __visible struct rw_semaphore * __sched |
568 | rwsem_down_write_failed_killable(struct rw_semaphore *sem) | |
569 | { | |
570 | return __rwsem_down_write_failed_common(sem, TASK_KILLABLE); | |
571 | } | |
572 | EXPORT_SYMBOL(rwsem_down_write_failed_killable); | |
573 | ||
1da177e4 LT |
574 | /* |
575 | * handle waking up a waiter on the semaphore | |
576 | * - up_read/up_write has decremented the active part of count if we come here | |
577 | */ | |
3ebae4f3 | 578 | __visible |
d1233754 | 579 | struct rw_semaphore *rwsem_wake(struct rw_semaphore *sem) |
1da177e4 LT |
580 | { |
581 | unsigned long flags; | |
194a6b5b | 582 | DEFINE_WAKE_Q(wake_q); |
1da177e4 | 583 | |
59aabfc7 WL |
584 | /* |
585 | * If a spinner is present, it is not necessary to do the wakeup. | |
586 | * Try to do wakeup only if the trylock succeeds to minimize | |
587 | * spinlock contention which may introduce too much delay in the | |
588 | * unlock operation. | |
589 | * | |
590 | * spinning writer up_write/up_read caller | |
591 | * --------------- ----------------------- | |
592 | * [S] osq_unlock() [L] osq | |
593 | * MB RMB | |
594 | * [RmW] rwsem_try_write_lock() [RmW] spin_trylock(wait_lock) | |
595 | * | |
596 | * Here, it is important to make sure that there won't be a missed | |
597 | * wakeup while the rwsem is free and the only spinning writer goes | |
598 | * to sleep without taking the rwsem. Even when the spinning writer | |
599 | * is just going to break out of the waiting loop, it will still do | |
600 | * a trylock in rwsem_down_write_failed() before sleeping. IOW, if | |
601 | * rwsem_has_spinner() is true, it will guarantee at least one | |
602 | * trylock attempt on the rwsem later on. | |
603 | */ | |
604 | if (rwsem_has_spinner(sem)) { | |
605 | /* | |
606 | * The smp_rmb() here is to make sure that the spinner | |
607 | * state is consulted before reading the wait_lock. | |
608 | */ | |
609 | smp_rmb(); | |
610 | if (!raw_spin_trylock_irqsave(&sem->wait_lock, flags)) | |
611 | return sem; | |
612 | goto locked; | |
613 | } | |
ddb6c9b5 | 614 | raw_spin_lock_irqsave(&sem->wait_lock, flags); |
59aabfc7 | 615 | locked: |
1da177e4 | 616 | |
1da177e4 | 617 | if (!list_empty(&sem->wait_list)) |
84b23f9b | 618 | __rwsem_mark_wake(sem, RWSEM_WAKE_ANY, &wake_q); |
1da177e4 | 619 | |
ddb6c9b5 | 620 | raw_spin_unlock_irqrestore(&sem->wait_lock, flags); |
133e89ef | 621 | wake_up_q(&wake_q); |
1da177e4 | 622 | |
1da177e4 LT |
623 | return sem; |
624 | } | |
db0e716a | 625 | EXPORT_SYMBOL(rwsem_wake); |
1da177e4 LT |
626 | |
627 | /* | |
628 | * downgrade a write lock into a read lock | |
629 | * - caller incremented waiting part of count and discovered it still negative | |
630 | * - just wake up any readers at the front of the queue | |
631 | */ | |
3ebae4f3 | 632 | __visible |
d1233754 | 633 | struct rw_semaphore *rwsem_downgrade_wake(struct rw_semaphore *sem) |
1da177e4 LT |
634 | { |
635 | unsigned long flags; | |
194a6b5b | 636 | DEFINE_WAKE_Q(wake_q); |
1da177e4 | 637 | |
ddb6c9b5 | 638 | raw_spin_lock_irqsave(&sem->wait_lock, flags); |
1da177e4 | 639 | |
1da177e4 | 640 | if (!list_empty(&sem->wait_list)) |
84b23f9b | 641 | __rwsem_mark_wake(sem, RWSEM_WAKE_READ_OWNED, &wake_q); |
1da177e4 | 642 | |
ddb6c9b5 | 643 | raw_spin_unlock_irqrestore(&sem->wait_lock, flags); |
133e89ef | 644 | wake_up_q(&wake_q); |
1da177e4 | 645 | |
1da177e4 LT |
646 | return sem; |
647 | } | |
1da177e4 | 648 | EXPORT_SYMBOL(rwsem_downgrade_wake); |