Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * kernel/locking/mutex.c
4 *
5 * Mutexes: blocking mutual exclusion locks
6 *
7 * Started by Ingo Molnar:
8 *
9 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
10 *
11 * Many thanks to Arjan van de Ven, Thomas Gleixner, Steven Rostedt and
12 * David Howells for suggestions and improvements.
13 *
14 * - Adaptive spinning for mutexes by Peter Zijlstra. (Ported to mainline
15 * from the -rt tree, where it was originally implemented for rtmutexes
16 * by Steven Rostedt, based on work by Gregory Haskins, Peter Morreale
17 * and Sven Dietrich.
18 *
19 * Also see Documentation/locking/mutex-design.rst.
20 */
21#include <linux/mutex.h>
22#include <linux/ww_mutex.h>
23#include <linux/sched/signal.h>
24#include <linux/sched/rt.h>
25#include <linux/sched/wake_q.h>
26#include <linux/sched/debug.h>
27#include <linux/export.h>
28#include <linux/spinlock.h>
29#include <linux/interrupt.h>
30#include <linux/debug_locks.h>
31#include <linux/osq_lock.h>
32
33#define CREATE_TRACE_POINTS
34#include <trace/events/lock.h>
35
36#ifndef CONFIG_PREEMPT_RT
37#include "mutex.h"
38
39#ifdef CONFIG_DEBUG_MUTEXES
40# define MUTEX_WARN_ON(cond) DEBUG_LOCKS_WARN_ON(cond)
41#else
42# define MUTEX_WARN_ON(cond)
43#endif
44
45void
46__mutex_init(struct mutex *lock, const char *name, struct lock_class_key *key)
47{
48 atomic_long_set(&lock->owner, 0);
49 raw_spin_lock_init(&lock->wait_lock);
50 INIT_LIST_HEAD(&lock->wait_list);
51#ifdef CONFIG_MUTEX_SPIN_ON_OWNER
52 osq_lock_init(&lock->osq);
53#endif
54
55 debug_mutex_init(lock, name, key);
56}
57EXPORT_SYMBOL(__mutex_init);
58
59static inline struct task_struct *__owner_task(unsigned long owner)
60{
61 return (struct task_struct *)(owner & ~MUTEX_FLAGS);
62}
63
64bool mutex_is_locked(struct mutex *lock)
65{
66 return __mutex_owner(lock) != NULL;
67}
68EXPORT_SYMBOL(mutex_is_locked);
69
70static inline unsigned long __owner_flags(unsigned long owner)
71{
72 return owner & MUTEX_FLAGS;
73}
74
75/*
76 * Returns: __mutex_owner(lock) on failure or NULL on success.
77 */
78static inline struct task_struct *__mutex_trylock_common(struct mutex *lock, bool handoff)
79{
80 unsigned long owner, curr = (unsigned long)current;
81
82 owner = atomic_long_read(&lock->owner);
83 for (;;) { /* must loop, can race against a flag */
84 unsigned long flags = __owner_flags(owner);
85 unsigned long task = owner & ~MUTEX_FLAGS;
86
87 if (task) {
88 if (flags & MUTEX_FLAG_PICKUP) {
89 if (task != curr)
90 break;
91 flags &= ~MUTEX_FLAG_PICKUP;
92 } else if (handoff) {
93 if (flags & MUTEX_FLAG_HANDOFF)
94 break;
95 flags |= MUTEX_FLAG_HANDOFF;
96 } else {
97 break;
98 }
99 } else {
100 MUTEX_WARN_ON(flags & (MUTEX_FLAG_HANDOFF | MUTEX_FLAG_PICKUP));
101 task = curr;
102 }
103
104 if (atomic_long_try_cmpxchg_acquire(&lock->owner, &owner, task | flags)) {
105 if (task == curr)
106 return NULL;
107 break;
108 }
109 }
110
111 return __owner_task(owner);
112}
113
114/*
115 * Trylock or set HANDOFF
116 */
117static inline bool __mutex_trylock_or_handoff(struct mutex *lock, bool handoff)
118{
119 return !__mutex_trylock_common(lock, handoff);
120}
121
122/*
123 * Actual trylock that will work on any unlocked state.
124 */
125static inline bool __mutex_trylock(struct mutex *lock)
126{
127 return !__mutex_trylock_common(lock, false);
128}
129
130#ifndef CONFIG_DEBUG_LOCK_ALLOC
131/*
132 * Lockdep annotations are contained to the slow paths for simplicity.
133 * There is nothing that would stop spreading the lockdep annotations outwards
134 * except more code.
135 */
136
137/*
138 * Optimistic trylock that only works in the uncontended case. Make sure to
139 * follow with a __mutex_trylock() before failing.
140 */
141static __always_inline bool __mutex_trylock_fast(struct mutex *lock)
142{
143 unsigned long curr = (unsigned long)current;
144 unsigned long zero = 0UL;
145
146 if (atomic_long_try_cmpxchg_acquire(&lock->owner, &zero, curr))
147 return true;
148
149 return false;
150}
151
152static __always_inline bool __mutex_unlock_fast(struct mutex *lock)
153{
154 unsigned long curr = (unsigned long)current;
155
156 return atomic_long_try_cmpxchg_release(&lock->owner, &curr, 0UL);
157}
158#endif
159
160static inline void __mutex_set_flag(struct mutex *lock, unsigned long flag)
161{
162 atomic_long_or(flag, &lock->owner);
163}
164
165static inline void __mutex_clear_flag(struct mutex *lock, unsigned long flag)
166{
167 atomic_long_andnot(flag, &lock->owner);
168}
169
170static inline bool __mutex_waiter_is_first(struct mutex *lock, struct mutex_waiter *waiter)
171{
172 return list_first_entry(&lock->wait_list, struct mutex_waiter, list) == waiter;
173}
174
175/*
176 * Add @waiter to a given location in the lock wait_list and set the
177 * FLAG_WAITERS flag if it's the first waiter.
178 */
179static void
180__mutex_add_waiter(struct mutex *lock, struct mutex_waiter *waiter,
181 struct list_head *list)
182{
183 debug_mutex_add_waiter(lock, waiter, current);
184
185 list_add_tail(&waiter->list, list);
186 if (__mutex_waiter_is_first(lock, waiter))
187 __mutex_set_flag(lock, MUTEX_FLAG_WAITERS);
188}
189
190static void
191__mutex_remove_waiter(struct mutex *lock, struct mutex_waiter *waiter)
192{
193 list_del(&waiter->list);
194 if (likely(list_empty(&lock->wait_list)))
195 __mutex_clear_flag(lock, MUTEX_FLAGS);
196
197 debug_mutex_remove_waiter(lock, waiter, current);
198}
199
200/*
201 * Give up ownership to a specific task, when @task = NULL, this is equivalent
202 * to a regular unlock. Sets PICKUP on a handoff, clears HANDOFF, preserves
203 * WAITERS. Provides RELEASE semantics like a regular unlock, the
204 * __mutex_trylock() provides a matching ACQUIRE semantics for the handoff.
205 */
206static void __mutex_handoff(struct mutex *lock, struct task_struct *task)
207{
208 unsigned long owner = atomic_long_read(&lock->owner);
209
210 for (;;) {
211 unsigned long new;
212
213 MUTEX_WARN_ON(__owner_task(owner) != current);
214 MUTEX_WARN_ON(owner & MUTEX_FLAG_PICKUP);
215
216 new = (owner & MUTEX_FLAG_WAITERS);
217 new |= (unsigned long)task;
218 if (task)
219 new |= MUTEX_FLAG_PICKUP;
220
221 if (atomic_long_try_cmpxchg_release(&lock->owner, &owner, new))
222 break;
223 }
224}
225
226#ifndef CONFIG_DEBUG_LOCK_ALLOC
227/*
228 * We split the mutex lock/unlock logic into separate fastpath and
229 * slowpath functions, to reduce the register pressure on the fastpath.
230 * We also put the fastpath first in the kernel image, to make sure the
231 * branch is predicted by the CPU as default-untaken.
232 */
233static void __sched __mutex_lock_slowpath(struct mutex *lock);
234
235/**
236 * mutex_lock - acquire the mutex
237 * @lock: the mutex to be acquired
238 *
239 * Lock the mutex exclusively for this task. If the mutex is not
240 * available right now, it will sleep until it can get it.
241 *
242 * The mutex must later on be released by the same task that
243 * acquired it. Recursive locking is not allowed. The task
244 * may not exit without first unlocking the mutex. Also, kernel
245 * memory where the mutex resides must not be freed with
246 * the mutex still locked. The mutex must first be initialized
247 * (or statically defined) before it can be locked. memset()-ing
248 * the mutex to 0 is not allowed.
249 *
250 * (The CONFIG_DEBUG_MUTEXES .config option turns on debugging
251 * checks that will enforce the restrictions and will also do
252 * deadlock debugging)
253 *
254 * This function is similar to (but not equivalent to) down().
255 */
256void __sched mutex_lock(struct mutex *lock)
257{
258 might_sleep();
259
260 if (!__mutex_trylock_fast(lock))
261 __mutex_lock_slowpath(lock);
262}
263EXPORT_SYMBOL(mutex_lock);
264#endif
265
266#include "ww_mutex.h"
267
268#ifdef CONFIG_MUTEX_SPIN_ON_OWNER
269
270/*
271 * Trylock variant that returns the owning task on failure.
272 */
273static inline struct task_struct *__mutex_trylock_or_owner(struct mutex *lock)
274{
275 return __mutex_trylock_common(lock, false);
276}
277
278static inline
279bool ww_mutex_spin_on_owner(struct mutex *lock, struct ww_acquire_ctx *ww_ctx,
280 struct mutex_waiter *waiter)
281{
282 struct ww_mutex *ww;
283
284 ww = container_of(lock, struct ww_mutex, base);
285
286 /*
287 * If ww->ctx is set the contents are undefined, only
288 * by acquiring wait_lock there is a guarantee that
289 * they are not invalid when reading.
290 *
291 * As such, when deadlock detection needs to be
292 * performed the optimistic spinning cannot be done.
293 *
294 * Check this in every inner iteration because we may
295 * be racing against another thread's ww_mutex_lock.
296 */
297 if (ww_ctx->acquired > 0 && READ_ONCE(ww->ctx))
298 return false;
299
300 /*
301 * If we aren't on the wait list yet, cancel the spin
302 * if there are waiters. We want to avoid stealing the
303 * lock from a waiter with an earlier stamp, since the
304 * other thread may already own a lock that we also
305 * need.
306 */
307 if (!waiter && (atomic_long_read(&lock->owner) & MUTEX_FLAG_WAITERS))
308 return false;
309
310 /*
311 * Similarly, stop spinning if we are no longer the
312 * first waiter.
313 */
314 if (waiter && !__mutex_waiter_is_first(lock, waiter))
315 return false;
316
317 return true;
318}
319
320/*
321 * Look out! "owner" is an entirely speculative pointer access and not
322 * reliable.
323 *
324 * "noinline" so that this function shows up on perf profiles.
325 */
326static noinline
327bool mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner,
328 struct ww_acquire_ctx *ww_ctx, struct mutex_waiter *waiter)
329{
330 bool ret = true;
331
332 lockdep_assert_preemption_disabled();
333
334 while (__mutex_owner(lock) == owner) {
335 /*
336 * Ensure we emit the owner->on_cpu, dereference _after_
337 * checking lock->owner still matches owner. And we already
338 * disabled preemption which is equal to the RCU read-side
339 * crital section in optimistic spinning code. Thus the
340 * task_strcut structure won't go away during the spinning
341 * period
342 */
343 barrier();
344
345 /*
346 * Use vcpu_is_preempted to detect lock holder preemption issue.
347 */
348 if (!owner_on_cpu(owner) || need_resched()) {
349 ret = false;
350 break;
351 }
352
353 if (ww_ctx && !ww_mutex_spin_on_owner(lock, ww_ctx, waiter)) {
354 ret = false;
355 break;
356 }
357
358 cpu_relax();
359 }
360
361 return ret;
362}
363
364/*
365 * Initial check for entering the mutex spinning loop
366 */
367static inline int mutex_can_spin_on_owner(struct mutex *lock)
368{
369 struct task_struct *owner;
370 int retval = 1;
371
372 lockdep_assert_preemption_disabled();
373
374 if (need_resched())
375 return 0;
376
377 /*
378 * We already disabled preemption which is equal to the RCU read-side
379 * crital section in optimistic spinning code. Thus the task_strcut
380 * structure won't go away during the spinning period.
381 */
382 owner = __mutex_owner(lock);
383 if (owner)
384 retval = owner_on_cpu(owner);
385
386 /*
387 * If lock->owner is not set, the mutex has been released. Return true
388 * such that we'll trylock in the spin path, which is a faster option
389 * than the blocking slow path.
390 */
391 return retval;
392}
393
394/*
395 * Optimistic spinning.
396 *
397 * We try to spin for acquisition when we find that the lock owner
398 * is currently running on a (different) CPU and while we don't
399 * need to reschedule. The rationale is that if the lock owner is
400 * running, it is likely to release the lock soon.
401 *
402 * The mutex spinners are queued up using MCS lock so that only one
403 * spinner can compete for the mutex. However, if mutex spinning isn't
404 * going to happen, there is no point in going through the lock/unlock
405 * overhead.
406 *
407 * Returns true when the lock was taken, otherwise false, indicating
408 * that we need to jump to the slowpath and sleep.
409 *
410 * The waiter flag is set to true if the spinner is a waiter in the wait
411 * queue. The waiter-spinner will spin on the lock directly and concurrently
412 * with the spinner at the head of the OSQ, if present, until the owner is
413 * changed to itself.
414 */
415static __always_inline bool
416mutex_optimistic_spin(struct mutex *lock, struct ww_acquire_ctx *ww_ctx,
417 struct mutex_waiter *waiter)
418{
419 if (!waiter) {
420 /*
421 * The purpose of the mutex_can_spin_on_owner() function is
422 * to eliminate the overhead of osq_lock() and osq_unlock()
423 * in case spinning isn't possible. As a waiter-spinner
424 * is not going to take OSQ lock anyway, there is no need
425 * to call mutex_can_spin_on_owner().
426 */
427 if (!mutex_can_spin_on_owner(lock))
428 goto fail;
429
430 /*
431 * In order to avoid a stampede of mutex spinners trying to
432 * acquire the mutex all at once, the spinners need to take a
433 * MCS (queued) lock first before spinning on the owner field.
434 */
435 if (!osq_lock(&lock->osq))
436 goto fail;
437 }
438
439 for (;;) {
440 struct task_struct *owner;
441
442 /* Try to acquire the mutex... */
443 owner = __mutex_trylock_or_owner(lock);
444 if (!owner)
445 break;
446
447 /*
448 * There's an owner, wait for it to either
449 * release the lock or go to sleep.
450 */
451 if (!mutex_spin_on_owner(lock, owner, ww_ctx, waiter))
452 goto fail_unlock;
453
454 /*
455 * The cpu_relax() call is a compiler barrier which forces
456 * everything in this loop to be re-loaded. We don't need
457 * memory barriers as we'll eventually observe the right
458 * values at the cost of a few extra spins.
459 */
460 cpu_relax();
461 }
462
463 if (!waiter)
464 osq_unlock(&lock->osq);
465
466 return true;
467
468
469fail_unlock:
470 if (!waiter)
471 osq_unlock(&lock->osq);
472
473fail:
474 /*
475 * If we fell out of the spin path because of need_resched(),
476 * reschedule now, before we try-lock the mutex. This avoids getting
477 * scheduled out right after we obtained the mutex.
478 */
479 if (need_resched()) {
480 /*
481 * We _should_ have TASK_RUNNING here, but just in case
482 * we do not, make it so, otherwise we might get stuck.
483 */
484 __set_current_state(TASK_RUNNING);
485 schedule_preempt_disabled();
486 }
487
488 return false;
489}
490#else
491static __always_inline bool
492mutex_optimistic_spin(struct mutex *lock, struct ww_acquire_ctx *ww_ctx,
493 struct mutex_waiter *waiter)
494{
495 return false;
496}
497#endif
498
499static noinline void __sched __mutex_unlock_slowpath(struct mutex *lock, unsigned long ip);
500
501/**
502 * mutex_unlock - release the mutex
503 * @lock: the mutex to be released
504 *
505 * Unlock a mutex that has been locked by this task previously.
506 *
507 * This function must not be used in interrupt context. Unlocking
508 * of a not locked mutex is not allowed.
509 *
510 * The caller must ensure that the mutex stays alive until this function has
511 * returned - mutex_unlock() can NOT directly be used to release an object such
512 * that another concurrent task can free it.
513 * Mutexes are different from spinlocks & refcounts in this aspect.
514 *
515 * This function is similar to (but not equivalent to) up().
516 */
517void __sched mutex_unlock(struct mutex *lock)
518{
519#ifndef CONFIG_DEBUG_LOCK_ALLOC
520 if (__mutex_unlock_fast(lock))
521 return;
522#endif
523 __mutex_unlock_slowpath(lock, _RET_IP_);
524}
525EXPORT_SYMBOL(mutex_unlock);
526
527/**
528 * ww_mutex_unlock - release the w/w mutex
529 * @lock: the mutex to be released
530 *
531 * Unlock a mutex that has been locked by this task previously with any of the
532 * ww_mutex_lock* functions (with or without an acquire context). It is
533 * forbidden to release the locks after releasing the acquire context.
534 *
535 * This function must not be used in interrupt context. Unlocking
536 * of a unlocked mutex is not allowed.
537 */
538void __sched ww_mutex_unlock(struct ww_mutex *lock)
539{
540 __ww_mutex_unlock(lock);
541 mutex_unlock(&lock->base);
542}
543EXPORT_SYMBOL(ww_mutex_unlock);
544
545/*
546 * Lock a mutex (possibly interruptible), slowpath:
547 */
548static __always_inline int __sched
549__mutex_lock_common(struct mutex *lock, unsigned int state, unsigned int subclass,
550 struct lockdep_map *nest_lock, unsigned long ip,
551 struct ww_acquire_ctx *ww_ctx, const bool use_ww_ctx)
552{
553 DEFINE_WAKE_Q(wake_q);
554 struct mutex_waiter waiter;
555 struct ww_mutex *ww;
556 unsigned long flags;
557 int ret;
558
559 if (!use_ww_ctx)
560 ww_ctx = NULL;
561
562 might_sleep();
563
564 MUTEX_WARN_ON(lock->magic != lock);
565
566 ww = container_of(lock, struct ww_mutex, base);
567 if (ww_ctx) {
568 if (unlikely(ww_ctx == READ_ONCE(ww->ctx)))
569 return -EALREADY;
570
571 /*
572 * Reset the wounded flag after a kill. No other process can
573 * race and wound us here since they can't have a valid owner
574 * pointer if we don't have any locks held.
575 */
576 if (ww_ctx->acquired == 0)
577 ww_ctx->wounded = 0;
578
579#ifdef CONFIG_DEBUG_LOCK_ALLOC
580 nest_lock = &ww_ctx->dep_map;
581#endif
582 }
583
584 preempt_disable();
585 mutex_acquire_nest(&lock->dep_map, subclass, 0, nest_lock, ip);
586
587 trace_contention_begin(lock, LCB_F_MUTEX | LCB_F_SPIN);
588 if (__mutex_trylock(lock) ||
589 mutex_optimistic_spin(lock, ww_ctx, NULL)) {
590 /* got the lock, yay! */
591 lock_acquired(&lock->dep_map, ip);
592 if (ww_ctx)
593 ww_mutex_set_context_fastpath(ww, ww_ctx);
594 trace_contention_end(lock, 0);
595 preempt_enable();
596 return 0;
597 }
598
599 raw_spin_lock_irqsave(&lock->wait_lock, flags);
600 /*
601 * After waiting to acquire the wait_lock, try again.
602 */
603 if (__mutex_trylock(lock)) {
604 if (ww_ctx)
605 __ww_mutex_check_waiters(lock, ww_ctx, &wake_q);
606
607 goto skip_wait;
608 }
609
610 debug_mutex_lock_common(lock, &waiter);
611 waiter.task = current;
612 if (use_ww_ctx)
613 waiter.ww_ctx = ww_ctx;
614
615 lock_contended(&lock->dep_map, ip);
616
617 if (!use_ww_ctx) {
618 /* add waiting tasks to the end of the waitqueue (FIFO): */
619 __mutex_add_waiter(lock, &waiter, &lock->wait_list);
620 } else {
621 /*
622 * Add in stamp order, waking up waiters that must kill
623 * themselves.
624 */
625 ret = __ww_mutex_add_waiter(&waiter, lock, ww_ctx, &wake_q);
626 if (ret)
627 goto err_early_kill;
628 }
629
630 set_current_state(state);
631 trace_contention_begin(lock, LCB_F_MUTEX);
632 for (;;) {
633 bool first;
634
635 /*
636 * Once we hold wait_lock, we're serialized against
637 * mutex_unlock() handing the lock off to us, do a trylock
638 * before testing the error conditions to make sure we pick up
639 * the handoff.
640 */
641 if (__mutex_trylock(lock))
642 goto acquired;
643
644 /*
645 * Check for signals and kill conditions while holding
646 * wait_lock. This ensures the lock cancellation is ordered
647 * against mutex_unlock() and wake-ups do not go missing.
648 */
649 if (signal_pending_state(state, current)) {
650 ret = -EINTR;
651 goto err;
652 }
653
654 if (ww_ctx) {
655 ret = __ww_mutex_check_kill(lock, &waiter, ww_ctx);
656 if (ret)
657 goto err;
658 }
659
660 raw_spin_unlock_irqrestore(&lock->wait_lock, flags);
661 /* Make sure we do wakeups before calling schedule */
662 wake_up_q(&wake_q);
663 wake_q_init(&wake_q);
664
665 schedule_preempt_disabled();
666
667 first = __mutex_waiter_is_first(lock, &waiter);
668
669 set_current_state(state);
670 /*
671 * Here we order against unlock; we must either see it change
672 * state back to RUNNING and fall through the next schedule(),
673 * or we must see its unlock and acquire.
674 */
675 if (__mutex_trylock_or_handoff(lock, first))
676 break;
677
678 if (first) {
679 trace_contention_begin(lock, LCB_F_MUTEX | LCB_F_SPIN);
680 if (mutex_optimistic_spin(lock, ww_ctx, &waiter))
681 break;
682 trace_contention_begin(lock, LCB_F_MUTEX);
683 }
684
685 raw_spin_lock_irqsave(&lock->wait_lock, flags);
686 }
687 raw_spin_lock_irqsave(&lock->wait_lock, flags);
688acquired:
689 __set_current_state(TASK_RUNNING);
690
691 if (ww_ctx) {
692 /*
693 * Wound-Wait; we stole the lock (!first_waiter), check the
694 * waiters as anyone might want to wound us.
695 */
696 if (!ww_ctx->is_wait_die &&
697 !__mutex_waiter_is_first(lock, &waiter))
698 __ww_mutex_check_waiters(lock, ww_ctx, &wake_q);
699 }
700
701 __mutex_remove_waiter(lock, &waiter);
702
703 debug_mutex_free_waiter(&waiter);
704
705skip_wait:
706 /* got the lock - cleanup and rejoice! */
707 lock_acquired(&lock->dep_map, ip);
708 trace_contention_end(lock, 0);
709
710 if (ww_ctx)
711 ww_mutex_lock_acquired(ww, ww_ctx);
712
713 raw_spin_unlock_irqrestore(&lock->wait_lock, flags);
714 wake_up_q(&wake_q);
715 preempt_enable();
716 return 0;
717
718err:
719 __set_current_state(TASK_RUNNING);
720 __mutex_remove_waiter(lock, &waiter);
721err_early_kill:
722 trace_contention_end(lock, ret);
723 raw_spin_unlock_irqrestore(&lock->wait_lock, flags);
724 debug_mutex_free_waiter(&waiter);
725 mutex_release(&lock->dep_map, ip);
726 wake_up_q(&wake_q);
727 preempt_enable();
728 return ret;
729}
730
731static int __sched
732__mutex_lock(struct mutex *lock, unsigned int state, unsigned int subclass,
733 struct lockdep_map *nest_lock, unsigned long ip)
734{
735 return __mutex_lock_common(lock, state, subclass, nest_lock, ip, NULL, false);
736}
737
738static int __sched
739__ww_mutex_lock(struct mutex *lock, unsigned int state, unsigned int subclass,
740 unsigned long ip, struct ww_acquire_ctx *ww_ctx)
741{
742 return __mutex_lock_common(lock, state, subclass, NULL, ip, ww_ctx, true);
743}
744
745/**
746 * ww_mutex_trylock - tries to acquire the w/w mutex with optional acquire context
747 * @ww: mutex to lock
748 * @ww_ctx: optional w/w acquire context
749 *
750 * Trylocks a mutex with the optional acquire context; no deadlock detection is
751 * possible. Returns 1 if the mutex has been acquired successfully, 0 otherwise.
752 *
753 * Unlike ww_mutex_lock, no deadlock handling is performed. However, if a @ctx is
754 * specified, -EALREADY handling may happen in calls to ww_mutex_trylock.
755 *
756 * A mutex acquired with this function must be released with ww_mutex_unlock.
757 */
758int ww_mutex_trylock(struct ww_mutex *ww, struct ww_acquire_ctx *ww_ctx)
759{
760 if (!ww_ctx)
761 return mutex_trylock(&ww->base);
762
763 MUTEX_WARN_ON(ww->base.magic != &ww->base);
764
765 /*
766 * Reset the wounded flag after a kill. No other process can
767 * race and wound us here, since they can't have a valid owner
768 * pointer if we don't have any locks held.
769 */
770 if (ww_ctx->acquired == 0)
771 ww_ctx->wounded = 0;
772
773 if (__mutex_trylock(&ww->base)) {
774 ww_mutex_set_context_fastpath(ww, ww_ctx);
775 mutex_acquire_nest(&ww->base.dep_map, 0, 1, &ww_ctx->dep_map, _RET_IP_);
776 return 1;
777 }
778
779 return 0;
780}
781EXPORT_SYMBOL(ww_mutex_trylock);
782
783#ifdef CONFIG_DEBUG_LOCK_ALLOC
784void __sched
785mutex_lock_nested(struct mutex *lock, unsigned int subclass)
786{
787 __mutex_lock(lock, TASK_UNINTERRUPTIBLE, subclass, NULL, _RET_IP_);
788}
789
790EXPORT_SYMBOL_GPL(mutex_lock_nested);
791
792void __sched
793_mutex_lock_nest_lock(struct mutex *lock, struct lockdep_map *nest)
794{
795 __mutex_lock(lock, TASK_UNINTERRUPTIBLE, 0, nest, _RET_IP_);
796}
797EXPORT_SYMBOL_GPL(_mutex_lock_nest_lock);
798
799int __sched
800mutex_lock_killable_nested(struct mutex *lock, unsigned int subclass)
801{
802 return __mutex_lock(lock, TASK_KILLABLE, subclass, NULL, _RET_IP_);
803}
804EXPORT_SYMBOL_GPL(mutex_lock_killable_nested);
805
806int __sched
807mutex_lock_interruptible_nested(struct mutex *lock, unsigned int subclass)
808{
809 return __mutex_lock(lock, TASK_INTERRUPTIBLE, subclass, NULL, _RET_IP_);
810}
811EXPORT_SYMBOL_GPL(mutex_lock_interruptible_nested);
812
813void __sched
814mutex_lock_io_nested(struct mutex *lock, unsigned int subclass)
815{
816 int token;
817
818 might_sleep();
819
820 token = io_schedule_prepare();
821 __mutex_lock_common(lock, TASK_UNINTERRUPTIBLE,
822 subclass, NULL, _RET_IP_, NULL, 0);
823 io_schedule_finish(token);
824}
825EXPORT_SYMBOL_GPL(mutex_lock_io_nested);
826
827static inline int
828ww_mutex_deadlock_injection(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
829{
830#ifdef CONFIG_DEBUG_WW_MUTEX_SLOWPATH
831 unsigned tmp;
832
833 if (ctx->deadlock_inject_countdown-- == 0) {
834 tmp = ctx->deadlock_inject_interval;
835 if (tmp > UINT_MAX/4)
836 tmp = UINT_MAX;
837 else
838 tmp = tmp*2 + tmp + tmp/2;
839
840 ctx->deadlock_inject_interval = tmp;
841 ctx->deadlock_inject_countdown = tmp;
842 ctx->contending_lock = lock;
843
844 ww_mutex_unlock(lock);
845
846 return -EDEADLK;
847 }
848#endif
849
850 return 0;
851}
852
853int __sched
854ww_mutex_lock(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
855{
856 int ret;
857
858 might_sleep();
859 ret = __ww_mutex_lock(&lock->base, TASK_UNINTERRUPTIBLE,
860 0, _RET_IP_, ctx);
861 if (!ret && ctx && ctx->acquired > 1)
862 return ww_mutex_deadlock_injection(lock, ctx);
863
864 return ret;
865}
866EXPORT_SYMBOL_GPL(ww_mutex_lock);
867
868int __sched
869ww_mutex_lock_interruptible(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
870{
871 int ret;
872
873 might_sleep();
874 ret = __ww_mutex_lock(&lock->base, TASK_INTERRUPTIBLE,
875 0, _RET_IP_, ctx);
876
877 if (!ret && ctx && ctx->acquired > 1)
878 return ww_mutex_deadlock_injection(lock, ctx);
879
880 return ret;
881}
882EXPORT_SYMBOL_GPL(ww_mutex_lock_interruptible);
883
884#endif
885
886/*
887 * Release the lock, slowpath:
888 */
889static noinline void __sched __mutex_unlock_slowpath(struct mutex *lock, unsigned long ip)
890{
891 struct task_struct *next = NULL;
892 DEFINE_WAKE_Q(wake_q);
893 unsigned long owner;
894 unsigned long flags;
895
896 mutex_release(&lock->dep_map, ip);
897
898 /*
899 * Release the lock before (potentially) taking the spinlock such that
900 * other contenders can get on with things ASAP.
901 *
902 * Except when HANDOFF, in that case we must not clear the owner field,
903 * but instead set it to the top waiter.
904 */
905 owner = atomic_long_read(&lock->owner);
906 for (;;) {
907 MUTEX_WARN_ON(__owner_task(owner) != current);
908 MUTEX_WARN_ON(owner & MUTEX_FLAG_PICKUP);
909
910 if (owner & MUTEX_FLAG_HANDOFF)
911 break;
912
913 if (atomic_long_try_cmpxchg_release(&lock->owner, &owner, __owner_flags(owner))) {
914 if (owner & MUTEX_FLAG_WAITERS)
915 break;
916
917 return;
918 }
919 }
920
921 raw_spin_lock_irqsave(&lock->wait_lock, flags);
922 debug_mutex_unlock(lock);
923 if (!list_empty(&lock->wait_list)) {
924 /* get the first entry from the wait-list: */
925 struct mutex_waiter *waiter =
926 list_first_entry(&lock->wait_list,
927 struct mutex_waiter, list);
928
929 next = waiter->task;
930
931 debug_mutex_wake_waiter(lock, waiter);
932 wake_q_add(&wake_q, next);
933 }
934
935 if (owner & MUTEX_FLAG_HANDOFF)
936 __mutex_handoff(lock, next);
937
938 preempt_disable();
939 raw_spin_unlock_irqrestore(&lock->wait_lock, flags);
940 wake_up_q(&wake_q);
941 preempt_enable();
942}
943
944#ifndef CONFIG_DEBUG_LOCK_ALLOC
945/*
946 * Here come the less common (and hence less performance-critical) APIs:
947 * mutex_lock_interruptible() and mutex_trylock().
948 */
949static noinline int __sched
950__mutex_lock_killable_slowpath(struct mutex *lock);
951
952static noinline int __sched
953__mutex_lock_interruptible_slowpath(struct mutex *lock);
954
955/**
956 * mutex_lock_interruptible() - Acquire the mutex, interruptible by signals.
957 * @lock: The mutex to be acquired.
958 *
959 * Lock the mutex like mutex_lock(). If a signal is delivered while the
960 * process is sleeping, this function will return without acquiring the
961 * mutex.
962 *
963 * Context: Process context.
964 * Return: 0 if the lock was successfully acquired or %-EINTR if a
965 * signal arrived.
966 */
967int __sched mutex_lock_interruptible(struct mutex *lock)
968{
969 might_sleep();
970
971 if (__mutex_trylock_fast(lock))
972 return 0;
973
974 return __mutex_lock_interruptible_slowpath(lock);
975}
976
977EXPORT_SYMBOL(mutex_lock_interruptible);
978
979/**
980 * mutex_lock_killable() - Acquire the mutex, interruptible by fatal signals.
981 * @lock: The mutex to be acquired.
982 *
983 * Lock the mutex like mutex_lock(). If a signal which will be fatal to
984 * the current process is delivered while the process is sleeping, this
985 * function will return without acquiring the mutex.
986 *
987 * Context: Process context.
988 * Return: 0 if the lock was successfully acquired or %-EINTR if a
989 * fatal signal arrived.
990 */
991int __sched mutex_lock_killable(struct mutex *lock)
992{
993 might_sleep();
994
995 if (__mutex_trylock_fast(lock))
996 return 0;
997
998 return __mutex_lock_killable_slowpath(lock);
999}
1000EXPORT_SYMBOL(mutex_lock_killable);
1001
1002/**
1003 * mutex_lock_io() - Acquire the mutex and mark the process as waiting for I/O
1004 * @lock: The mutex to be acquired.
1005 *
1006 * Lock the mutex like mutex_lock(). While the task is waiting for this
1007 * mutex, it will be accounted as being in the IO wait state by the
1008 * scheduler.
1009 *
1010 * Context: Process context.
1011 */
1012void __sched mutex_lock_io(struct mutex *lock)
1013{
1014 int token;
1015
1016 token = io_schedule_prepare();
1017 mutex_lock(lock);
1018 io_schedule_finish(token);
1019}
1020EXPORT_SYMBOL_GPL(mutex_lock_io);
1021
1022static noinline void __sched
1023__mutex_lock_slowpath(struct mutex *lock)
1024{
1025 __mutex_lock(lock, TASK_UNINTERRUPTIBLE, 0, NULL, _RET_IP_);
1026}
1027
1028static noinline int __sched
1029__mutex_lock_killable_slowpath(struct mutex *lock)
1030{
1031 return __mutex_lock(lock, TASK_KILLABLE, 0, NULL, _RET_IP_);
1032}
1033
1034static noinline int __sched
1035__mutex_lock_interruptible_slowpath(struct mutex *lock)
1036{
1037 return __mutex_lock(lock, TASK_INTERRUPTIBLE, 0, NULL, _RET_IP_);
1038}
1039
1040static noinline int __sched
1041__ww_mutex_lock_slowpath(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
1042{
1043 return __ww_mutex_lock(&lock->base, TASK_UNINTERRUPTIBLE, 0,
1044 _RET_IP_, ctx);
1045}
1046
1047static noinline int __sched
1048__ww_mutex_lock_interruptible_slowpath(struct ww_mutex *lock,
1049 struct ww_acquire_ctx *ctx)
1050{
1051 return __ww_mutex_lock(&lock->base, TASK_INTERRUPTIBLE, 0,
1052 _RET_IP_, ctx);
1053}
1054
1055#endif
1056
1057/**
1058 * mutex_trylock - try to acquire the mutex, without waiting
1059 * @lock: the mutex to be acquired
1060 *
1061 * Try to acquire the mutex atomically. Returns 1 if the mutex
1062 * has been acquired successfully, and 0 on contention.
1063 *
1064 * NOTE: this function follows the spin_trylock() convention, so
1065 * it is negated from the down_trylock() return values! Be careful
1066 * about this when converting semaphore users to mutexes.
1067 *
1068 * This function must not be used in interrupt context. The
1069 * mutex must be released by the same task that acquired it.
1070 */
1071int __sched mutex_trylock(struct mutex *lock)
1072{
1073 bool locked;
1074
1075 MUTEX_WARN_ON(lock->magic != lock);
1076
1077 locked = __mutex_trylock(lock);
1078 if (locked)
1079 mutex_acquire(&lock->dep_map, 0, 1, _RET_IP_);
1080
1081 return locked;
1082}
1083EXPORT_SYMBOL(mutex_trylock);
1084
1085#ifndef CONFIG_DEBUG_LOCK_ALLOC
1086int __sched
1087ww_mutex_lock(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
1088{
1089 might_sleep();
1090
1091 if (__mutex_trylock_fast(&lock->base)) {
1092 if (ctx)
1093 ww_mutex_set_context_fastpath(lock, ctx);
1094 return 0;
1095 }
1096
1097 return __ww_mutex_lock_slowpath(lock, ctx);
1098}
1099EXPORT_SYMBOL(ww_mutex_lock);
1100
1101int __sched
1102ww_mutex_lock_interruptible(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
1103{
1104 might_sleep();
1105
1106 if (__mutex_trylock_fast(&lock->base)) {
1107 if (ctx)
1108 ww_mutex_set_context_fastpath(lock, ctx);
1109 return 0;
1110 }
1111
1112 return __ww_mutex_lock_interruptible_slowpath(lock, ctx);
1113}
1114EXPORT_SYMBOL(ww_mutex_lock_interruptible);
1115
1116#endif /* !CONFIG_DEBUG_LOCK_ALLOC */
1117#endif /* !CONFIG_PREEMPT_RT */
1118
1119EXPORT_TRACEPOINT_SYMBOL_GPL(contention_begin);
1120EXPORT_TRACEPOINT_SYMBOL_GPL(contention_end);
1121
1122/**
1123 * atomic_dec_and_mutex_lock - return holding mutex if we dec to 0
1124 * @cnt: the atomic which we are to dec
1125 * @lock: the mutex to return holding if we dec to 0
1126 *
1127 * return true and hold lock if we dec to 0, return false otherwise
1128 */
1129int atomic_dec_and_mutex_lock(atomic_t *cnt, struct mutex *lock)
1130{
1131 /* dec if we can't possibly hit 0 */
1132 if (atomic_add_unless(cnt, -1, 1))
1133 return 0;
1134 /* we might hit 0, so take the lock */
1135 mutex_lock(lock);
1136 if (!atomic_dec_and_test(cnt)) {
1137 /* when we actually did the dec, we didn't hit 0 */
1138 mutex_unlock(lock);
1139 return 0;
1140 }
1141 /* we hit 0, and we hold the lock */
1142 return 1;
1143}
1144EXPORT_SYMBOL(atomic_dec_and_mutex_lock);
1/*
2 * kernel/locking/mutex.c
3 *
4 * Mutexes: blocking mutual exclusion locks
5 *
6 * Started by Ingo Molnar:
7 *
8 * Copyright (C) 2004, 2005, 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
9 *
10 * Many thanks to Arjan van de Ven, Thomas Gleixner, Steven Rostedt and
11 * David Howells for suggestions and improvements.
12 *
13 * - Adaptive spinning for mutexes by Peter Zijlstra. (Ported to mainline
14 * from the -rt tree, where it was originally implemented for rtmutexes
15 * by Steven Rostedt, based on work by Gregory Haskins, Peter Morreale
16 * and Sven Dietrich.
17 *
18 * Also see Documentation/locking/mutex-design.txt.
19 */
20#include <linux/mutex.h>
21#include <linux/ww_mutex.h>
22#include <linux/sched.h>
23#include <linux/sched/rt.h>
24#include <linux/export.h>
25#include <linux/spinlock.h>
26#include <linux/interrupt.h>
27#include <linux/debug_locks.h>
28#include <linux/osq_lock.h>
29
30/*
31 * In the DEBUG case we are using the "NULL fastpath" for mutexes,
32 * which forces all calls into the slowpath:
33 */
34#ifdef CONFIG_DEBUG_MUTEXES
35# include "mutex-debug.h"
36# include <asm-generic/mutex-null.h>
37/*
38 * Must be 0 for the debug case so we do not do the unlock outside of the
39 * wait_lock region. debug_mutex_unlock() will do the actual unlock in this
40 * case.
41 */
42# undef __mutex_slowpath_needs_to_unlock
43# define __mutex_slowpath_needs_to_unlock() 0
44#else
45# include "mutex.h"
46# include <asm/mutex.h>
47#endif
48
49void
50__mutex_init(struct mutex *lock, const char *name, struct lock_class_key *key)
51{
52 atomic_set(&lock->count, 1);
53 spin_lock_init(&lock->wait_lock);
54 INIT_LIST_HEAD(&lock->wait_list);
55 mutex_clear_owner(lock);
56#ifdef CONFIG_MUTEX_SPIN_ON_OWNER
57 osq_lock_init(&lock->osq);
58#endif
59
60 debug_mutex_init(lock, name, key);
61}
62
63EXPORT_SYMBOL(__mutex_init);
64
65#ifndef CONFIG_DEBUG_LOCK_ALLOC
66/*
67 * We split the mutex lock/unlock logic into separate fastpath and
68 * slowpath functions, to reduce the register pressure on the fastpath.
69 * We also put the fastpath first in the kernel image, to make sure the
70 * branch is predicted by the CPU as default-untaken.
71 */
72__visible void __sched __mutex_lock_slowpath(atomic_t *lock_count);
73
74/**
75 * mutex_lock - acquire the mutex
76 * @lock: the mutex to be acquired
77 *
78 * Lock the mutex exclusively for this task. If the mutex is not
79 * available right now, it will sleep until it can get it.
80 *
81 * The mutex must later on be released by the same task that
82 * acquired it. Recursive locking is not allowed. The task
83 * may not exit without first unlocking the mutex. Also, kernel
84 * memory where the mutex resides must not be freed with
85 * the mutex still locked. The mutex must first be initialized
86 * (or statically defined) before it can be locked. memset()-ing
87 * the mutex to 0 is not allowed.
88 *
89 * ( The CONFIG_DEBUG_MUTEXES .config option turns on debugging
90 * checks that will enforce the restrictions and will also do
91 * deadlock debugging. )
92 *
93 * This function is similar to (but not equivalent to) down().
94 */
95void __sched mutex_lock(struct mutex *lock)
96{
97 might_sleep();
98 /*
99 * The locking fastpath is the 1->0 transition from
100 * 'unlocked' into 'locked' state.
101 */
102 __mutex_fastpath_lock(&lock->count, __mutex_lock_slowpath);
103 mutex_set_owner(lock);
104}
105
106EXPORT_SYMBOL(mutex_lock);
107#endif
108
109static __always_inline void ww_mutex_lock_acquired(struct ww_mutex *ww,
110 struct ww_acquire_ctx *ww_ctx)
111{
112#ifdef CONFIG_DEBUG_MUTEXES
113 /*
114 * If this WARN_ON triggers, you used ww_mutex_lock to acquire,
115 * but released with a normal mutex_unlock in this call.
116 *
117 * This should never happen, always use ww_mutex_unlock.
118 */
119 DEBUG_LOCKS_WARN_ON(ww->ctx);
120
121 /*
122 * Not quite done after calling ww_acquire_done() ?
123 */
124 DEBUG_LOCKS_WARN_ON(ww_ctx->done_acquire);
125
126 if (ww_ctx->contending_lock) {
127 /*
128 * After -EDEADLK you tried to
129 * acquire a different ww_mutex? Bad!
130 */
131 DEBUG_LOCKS_WARN_ON(ww_ctx->contending_lock != ww);
132
133 /*
134 * You called ww_mutex_lock after receiving -EDEADLK,
135 * but 'forgot' to unlock everything else first?
136 */
137 DEBUG_LOCKS_WARN_ON(ww_ctx->acquired > 0);
138 ww_ctx->contending_lock = NULL;
139 }
140
141 /*
142 * Naughty, using a different class will lead to undefined behavior!
143 */
144 DEBUG_LOCKS_WARN_ON(ww_ctx->ww_class != ww->ww_class);
145#endif
146 ww_ctx->acquired++;
147}
148
149/*
150 * After acquiring lock with fastpath or when we lost out in contested
151 * slowpath, set ctx and wake up any waiters so they can recheck.
152 *
153 * This function is never called when CONFIG_DEBUG_LOCK_ALLOC is set,
154 * as the fastpath and opportunistic spinning are disabled in that case.
155 */
156static __always_inline void
157ww_mutex_set_context_fastpath(struct ww_mutex *lock,
158 struct ww_acquire_ctx *ctx)
159{
160 unsigned long flags;
161 struct mutex_waiter *cur;
162
163 ww_mutex_lock_acquired(lock, ctx);
164
165 lock->ctx = ctx;
166
167 /*
168 * The lock->ctx update should be visible on all cores before
169 * the atomic read is done, otherwise contended waiters might be
170 * missed. The contended waiters will either see ww_ctx == NULL
171 * and keep spinning, or it will acquire wait_lock, add itself
172 * to waiter list and sleep.
173 */
174 smp_mb(); /* ^^^ */
175
176 /*
177 * Check if lock is contended, if not there is nobody to wake up
178 */
179 if (likely(atomic_read(&lock->base.count) == 0))
180 return;
181
182 /*
183 * Uh oh, we raced in fastpath, wake up everyone in this case,
184 * so they can see the new lock->ctx.
185 */
186 spin_lock_mutex(&lock->base.wait_lock, flags);
187 list_for_each_entry(cur, &lock->base.wait_list, list) {
188 debug_mutex_wake_waiter(&lock->base, cur);
189 wake_up_process(cur->task);
190 }
191 spin_unlock_mutex(&lock->base.wait_lock, flags);
192}
193
194/*
195 * After acquiring lock in the slowpath set ctx and wake up any
196 * waiters so they can recheck.
197 *
198 * Callers must hold the mutex wait_lock.
199 */
200static __always_inline void
201ww_mutex_set_context_slowpath(struct ww_mutex *lock,
202 struct ww_acquire_ctx *ctx)
203{
204 struct mutex_waiter *cur;
205
206 ww_mutex_lock_acquired(lock, ctx);
207 lock->ctx = ctx;
208
209 /*
210 * Give any possible sleeping processes the chance to wake up,
211 * so they can recheck if they have to back off.
212 */
213 list_for_each_entry(cur, &lock->base.wait_list, list) {
214 debug_mutex_wake_waiter(&lock->base, cur);
215 wake_up_process(cur->task);
216 }
217}
218
219#ifdef CONFIG_MUTEX_SPIN_ON_OWNER
220/*
221 * Look out! "owner" is an entirely speculative pointer
222 * access and not reliable.
223 */
224static noinline
225bool mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner)
226{
227 bool ret = true;
228
229 rcu_read_lock();
230 while (lock->owner == owner) {
231 /*
232 * Ensure we emit the owner->on_cpu, dereference _after_
233 * checking lock->owner still matches owner. If that fails,
234 * owner might point to freed memory. If it still matches,
235 * the rcu_read_lock() ensures the memory stays valid.
236 */
237 barrier();
238
239 if (!owner->on_cpu || need_resched()) {
240 ret = false;
241 break;
242 }
243
244 cpu_relax_lowlatency();
245 }
246 rcu_read_unlock();
247
248 return ret;
249}
250
251/*
252 * Initial check for entering the mutex spinning loop
253 */
254static inline int mutex_can_spin_on_owner(struct mutex *lock)
255{
256 struct task_struct *owner;
257 int retval = 1;
258
259 if (need_resched())
260 return 0;
261
262 rcu_read_lock();
263 owner = READ_ONCE(lock->owner);
264 if (owner)
265 retval = owner->on_cpu;
266 rcu_read_unlock();
267 /*
268 * if lock->owner is not set, the mutex owner may have just acquired
269 * it and not set the owner yet or the mutex has been released.
270 */
271 return retval;
272}
273
274/*
275 * Atomically try to take the lock when it is available
276 */
277static inline bool mutex_try_to_acquire(struct mutex *lock)
278{
279 return !mutex_is_locked(lock) &&
280 (atomic_cmpxchg_acquire(&lock->count, 1, 0) == 1);
281}
282
283/*
284 * Optimistic spinning.
285 *
286 * We try to spin for acquisition when we find that the lock owner
287 * is currently running on a (different) CPU and while we don't
288 * need to reschedule. The rationale is that if the lock owner is
289 * running, it is likely to release the lock soon.
290 *
291 * Since this needs the lock owner, and this mutex implementation
292 * doesn't track the owner atomically in the lock field, we need to
293 * track it non-atomically.
294 *
295 * We can't do this for DEBUG_MUTEXES because that relies on wait_lock
296 * to serialize everything.
297 *
298 * The mutex spinners are queued up using MCS lock so that only one
299 * spinner can compete for the mutex. However, if mutex spinning isn't
300 * going to happen, there is no point in going through the lock/unlock
301 * overhead.
302 *
303 * Returns true when the lock was taken, otherwise false, indicating
304 * that we need to jump to the slowpath and sleep.
305 */
306static bool mutex_optimistic_spin(struct mutex *lock,
307 struct ww_acquire_ctx *ww_ctx, const bool use_ww_ctx)
308{
309 struct task_struct *task = current;
310
311 if (!mutex_can_spin_on_owner(lock))
312 goto done;
313
314 /*
315 * In order to avoid a stampede of mutex spinners trying to
316 * acquire the mutex all at once, the spinners need to take a
317 * MCS (queued) lock first before spinning on the owner field.
318 */
319 if (!osq_lock(&lock->osq))
320 goto done;
321
322 while (true) {
323 struct task_struct *owner;
324
325 if (use_ww_ctx && ww_ctx->acquired > 0) {
326 struct ww_mutex *ww;
327
328 ww = container_of(lock, struct ww_mutex, base);
329 /*
330 * If ww->ctx is set the contents are undefined, only
331 * by acquiring wait_lock there is a guarantee that
332 * they are not invalid when reading.
333 *
334 * As such, when deadlock detection needs to be
335 * performed the optimistic spinning cannot be done.
336 */
337 if (READ_ONCE(ww->ctx))
338 break;
339 }
340
341 /*
342 * If there's an owner, wait for it to either
343 * release the lock or go to sleep.
344 */
345 owner = READ_ONCE(lock->owner);
346 if (owner && !mutex_spin_on_owner(lock, owner))
347 break;
348
349 /* Try to acquire the mutex if it is unlocked. */
350 if (mutex_try_to_acquire(lock)) {
351 lock_acquired(&lock->dep_map, ip);
352
353 if (use_ww_ctx) {
354 struct ww_mutex *ww;
355 ww = container_of(lock, struct ww_mutex, base);
356
357 ww_mutex_set_context_fastpath(ww, ww_ctx);
358 }
359
360 mutex_set_owner(lock);
361 osq_unlock(&lock->osq);
362 return true;
363 }
364
365 /*
366 * When there's no owner, we might have preempted between the
367 * owner acquiring the lock and setting the owner field. If
368 * we're an RT task that will live-lock because we won't let
369 * the owner complete.
370 */
371 if (!owner && (need_resched() || rt_task(task)))
372 break;
373
374 /*
375 * The cpu_relax() call is a compiler barrier which forces
376 * everything in this loop to be re-loaded. We don't need
377 * memory barriers as we'll eventually observe the right
378 * values at the cost of a few extra spins.
379 */
380 cpu_relax_lowlatency();
381 }
382
383 osq_unlock(&lock->osq);
384done:
385 /*
386 * If we fell out of the spin path because of need_resched(),
387 * reschedule now, before we try-lock the mutex. This avoids getting
388 * scheduled out right after we obtained the mutex.
389 */
390 if (need_resched()) {
391 /*
392 * We _should_ have TASK_RUNNING here, but just in case
393 * we do not, make it so, otherwise we might get stuck.
394 */
395 __set_current_state(TASK_RUNNING);
396 schedule_preempt_disabled();
397 }
398
399 return false;
400}
401#else
402static bool mutex_optimistic_spin(struct mutex *lock,
403 struct ww_acquire_ctx *ww_ctx, const bool use_ww_ctx)
404{
405 return false;
406}
407#endif
408
409__visible __used noinline
410void __sched __mutex_unlock_slowpath(atomic_t *lock_count);
411
412/**
413 * mutex_unlock - release the mutex
414 * @lock: the mutex to be released
415 *
416 * Unlock a mutex that has been locked by this task previously.
417 *
418 * This function must not be used in interrupt context. Unlocking
419 * of a not locked mutex is not allowed.
420 *
421 * This function is similar to (but not equivalent to) up().
422 */
423void __sched mutex_unlock(struct mutex *lock)
424{
425 /*
426 * The unlocking fastpath is the 0->1 transition from 'locked'
427 * into 'unlocked' state:
428 */
429#ifndef CONFIG_DEBUG_MUTEXES
430 /*
431 * When debugging is enabled we must not clear the owner before time,
432 * the slow path will always be taken, and that clears the owner field
433 * after verifying that it was indeed current.
434 */
435 mutex_clear_owner(lock);
436#endif
437 __mutex_fastpath_unlock(&lock->count, __mutex_unlock_slowpath);
438}
439
440EXPORT_SYMBOL(mutex_unlock);
441
442/**
443 * ww_mutex_unlock - release the w/w mutex
444 * @lock: the mutex to be released
445 *
446 * Unlock a mutex that has been locked by this task previously with any of the
447 * ww_mutex_lock* functions (with or without an acquire context). It is
448 * forbidden to release the locks after releasing the acquire context.
449 *
450 * This function must not be used in interrupt context. Unlocking
451 * of a unlocked mutex is not allowed.
452 */
453void __sched ww_mutex_unlock(struct ww_mutex *lock)
454{
455 /*
456 * The unlocking fastpath is the 0->1 transition from 'locked'
457 * into 'unlocked' state:
458 */
459 if (lock->ctx) {
460#ifdef CONFIG_DEBUG_MUTEXES
461 DEBUG_LOCKS_WARN_ON(!lock->ctx->acquired);
462#endif
463 if (lock->ctx->acquired > 0)
464 lock->ctx->acquired--;
465 lock->ctx = NULL;
466 }
467
468#ifndef CONFIG_DEBUG_MUTEXES
469 /*
470 * When debugging is enabled we must not clear the owner before time,
471 * the slow path will always be taken, and that clears the owner field
472 * after verifying that it was indeed current.
473 */
474 mutex_clear_owner(&lock->base);
475#endif
476 __mutex_fastpath_unlock(&lock->base.count, __mutex_unlock_slowpath);
477}
478EXPORT_SYMBOL(ww_mutex_unlock);
479
480static inline int __sched
481__ww_mutex_lock_check_stamp(struct mutex *lock, struct ww_acquire_ctx *ctx)
482{
483 struct ww_mutex *ww = container_of(lock, struct ww_mutex, base);
484 struct ww_acquire_ctx *hold_ctx = READ_ONCE(ww->ctx);
485
486 if (!hold_ctx)
487 return 0;
488
489 if (unlikely(ctx == hold_ctx))
490 return -EALREADY;
491
492 if (ctx->stamp - hold_ctx->stamp <= LONG_MAX &&
493 (ctx->stamp != hold_ctx->stamp || ctx > hold_ctx)) {
494#ifdef CONFIG_DEBUG_MUTEXES
495 DEBUG_LOCKS_WARN_ON(ctx->contending_lock);
496 ctx->contending_lock = ww;
497#endif
498 return -EDEADLK;
499 }
500
501 return 0;
502}
503
504/*
505 * Lock a mutex (possibly interruptible), slowpath:
506 */
507static __always_inline int __sched
508__mutex_lock_common(struct mutex *lock, long state, unsigned int subclass,
509 struct lockdep_map *nest_lock, unsigned long ip,
510 struct ww_acquire_ctx *ww_ctx, const bool use_ww_ctx)
511{
512 struct task_struct *task = current;
513 struct mutex_waiter waiter;
514 unsigned long flags;
515 int ret;
516
517 preempt_disable();
518 mutex_acquire_nest(&lock->dep_map, subclass, 0, nest_lock, ip);
519
520 if (mutex_optimistic_spin(lock, ww_ctx, use_ww_ctx)) {
521 /* got the lock, yay! */
522 preempt_enable();
523 return 0;
524 }
525
526 spin_lock_mutex(&lock->wait_lock, flags);
527
528 /*
529 * Once more, try to acquire the lock. Only try-lock the mutex if
530 * it is unlocked to reduce unnecessary xchg() operations.
531 */
532 if (!mutex_is_locked(lock) &&
533 (atomic_xchg_acquire(&lock->count, 0) == 1))
534 goto skip_wait;
535
536 debug_mutex_lock_common(lock, &waiter);
537 debug_mutex_add_waiter(lock, &waiter, task_thread_info(task));
538
539 /* add waiting tasks to the end of the waitqueue (FIFO): */
540 list_add_tail(&waiter.list, &lock->wait_list);
541 waiter.task = task;
542
543 lock_contended(&lock->dep_map, ip);
544
545 for (;;) {
546 /*
547 * Lets try to take the lock again - this is needed even if
548 * we get here for the first time (shortly after failing to
549 * acquire the lock), to make sure that we get a wakeup once
550 * it's unlocked. Later on, if we sleep, this is the
551 * operation that gives us the lock. We xchg it to -1, so
552 * that when we release the lock, we properly wake up the
553 * other waiters. We only attempt the xchg if the count is
554 * non-negative in order to avoid unnecessary xchg operations:
555 */
556 if (atomic_read(&lock->count) >= 0 &&
557 (atomic_xchg_acquire(&lock->count, -1) == 1))
558 break;
559
560 /*
561 * got a signal? (This code gets eliminated in the
562 * TASK_UNINTERRUPTIBLE case.)
563 */
564 if (unlikely(signal_pending_state(state, task))) {
565 ret = -EINTR;
566 goto err;
567 }
568
569 if (use_ww_ctx && ww_ctx->acquired > 0) {
570 ret = __ww_mutex_lock_check_stamp(lock, ww_ctx);
571 if (ret)
572 goto err;
573 }
574
575 __set_task_state(task, state);
576
577 /* didn't get the lock, go to sleep: */
578 spin_unlock_mutex(&lock->wait_lock, flags);
579 schedule_preempt_disabled();
580 spin_lock_mutex(&lock->wait_lock, flags);
581 }
582 __set_task_state(task, TASK_RUNNING);
583
584 mutex_remove_waiter(lock, &waiter, current_thread_info());
585 /* set it to 0 if there are no waiters left: */
586 if (likely(list_empty(&lock->wait_list)))
587 atomic_set(&lock->count, 0);
588 debug_mutex_free_waiter(&waiter);
589
590skip_wait:
591 /* got the lock - cleanup and rejoice! */
592 lock_acquired(&lock->dep_map, ip);
593 mutex_set_owner(lock);
594
595 if (use_ww_ctx) {
596 struct ww_mutex *ww = container_of(lock, struct ww_mutex, base);
597 ww_mutex_set_context_slowpath(ww, ww_ctx);
598 }
599
600 spin_unlock_mutex(&lock->wait_lock, flags);
601 preempt_enable();
602 return 0;
603
604err:
605 mutex_remove_waiter(lock, &waiter, task_thread_info(task));
606 spin_unlock_mutex(&lock->wait_lock, flags);
607 debug_mutex_free_waiter(&waiter);
608 mutex_release(&lock->dep_map, 1, ip);
609 preempt_enable();
610 return ret;
611}
612
613#ifdef CONFIG_DEBUG_LOCK_ALLOC
614void __sched
615mutex_lock_nested(struct mutex *lock, unsigned int subclass)
616{
617 might_sleep();
618 __mutex_lock_common(lock, TASK_UNINTERRUPTIBLE,
619 subclass, NULL, _RET_IP_, NULL, 0);
620}
621
622EXPORT_SYMBOL_GPL(mutex_lock_nested);
623
624void __sched
625_mutex_lock_nest_lock(struct mutex *lock, struct lockdep_map *nest)
626{
627 might_sleep();
628 __mutex_lock_common(lock, TASK_UNINTERRUPTIBLE,
629 0, nest, _RET_IP_, NULL, 0);
630}
631
632EXPORT_SYMBOL_GPL(_mutex_lock_nest_lock);
633
634int __sched
635mutex_lock_killable_nested(struct mutex *lock, unsigned int subclass)
636{
637 might_sleep();
638 return __mutex_lock_common(lock, TASK_KILLABLE,
639 subclass, NULL, _RET_IP_, NULL, 0);
640}
641EXPORT_SYMBOL_GPL(mutex_lock_killable_nested);
642
643int __sched
644mutex_lock_interruptible_nested(struct mutex *lock, unsigned int subclass)
645{
646 might_sleep();
647 return __mutex_lock_common(lock, TASK_INTERRUPTIBLE,
648 subclass, NULL, _RET_IP_, NULL, 0);
649}
650
651EXPORT_SYMBOL_GPL(mutex_lock_interruptible_nested);
652
653static inline int
654ww_mutex_deadlock_injection(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
655{
656#ifdef CONFIG_DEBUG_WW_MUTEX_SLOWPATH
657 unsigned tmp;
658
659 if (ctx->deadlock_inject_countdown-- == 0) {
660 tmp = ctx->deadlock_inject_interval;
661 if (tmp > UINT_MAX/4)
662 tmp = UINT_MAX;
663 else
664 tmp = tmp*2 + tmp + tmp/2;
665
666 ctx->deadlock_inject_interval = tmp;
667 ctx->deadlock_inject_countdown = tmp;
668 ctx->contending_lock = lock;
669
670 ww_mutex_unlock(lock);
671
672 return -EDEADLK;
673 }
674#endif
675
676 return 0;
677}
678
679int __sched
680__ww_mutex_lock(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
681{
682 int ret;
683
684 might_sleep();
685 ret = __mutex_lock_common(&lock->base, TASK_UNINTERRUPTIBLE,
686 0, &ctx->dep_map, _RET_IP_, ctx, 1);
687 if (!ret && ctx->acquired > 1)
688 return ww_mutex_deadlock_injection(lock, ctx);
689
690 return ret;
691}
692EXPORT_SYMBOL_GPL(__ww_mutex_lock);
693
694int __sched
695__ww_mutex_lock_interruptible(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
696{
697 int ret;
698
699 might_sleep();
700 ret = __mutex_lock_common(&lock->base, TASK_INTERRUPTIBLE,
701 0, &ctx->dep_map, _RET_IP_, ctx, 1);
702
703 if (!ret && ctx->acquired > 1)
704 return ww_mutex_deadlock_injection(lock, ctx);
705
706 return ret;
707}
708EXPORT_SYMBOL_GPL(__ww_mutex_lock_interruptible);
709
710#endif
711
712/*
713 * Release the lock, slowpath:
714 */
715static inline void
716__mutex_unlock_common_slowpath(struct mutex *lock, int nested)
717{
718 unsigned long flags;
719 WAKE_Q(wake_q);
720
721 /*
722 * As a performance measurement, release the lock before doing other
723 * wakeup related duties to follow. This allows other tasks to acquire
724 * the lock sooner, while still handling cleanups in past unlock calls.
725 * This can be done as we do not enforce strict equivalence between the
726 * mutex counter and wait_list.
727 *
728 *
729 * Some architectures leave the lock unlocked in the fastpath failure
730 * case, others need to leave it locked. In the later case we have to
731 * unlock it here - as the lock counter is currently 0 or negative.
732 */
733 if (__mutex_slowpath_needs_to_unlock())
734 atomic_set(&lock->count, 1);
735
736 spin_lock_mutex(&lock->wait_lock, flags);
737 mutex_release(&lock->dep_map, nested, _RET_IP_);
738 debug_mutex_unlock(lock);
739
740 if (!list_empty(&lock->wait_list)) {
741 /* get the first entry from the wait-list: */
742 struct mutex_waiter *waiter =
743 list_entry(lock->wait_list.next,
744 struct mutex_waiter, list);
745
746 debug_mutex_wake_waiter(lock, waiter);
747 wake_q_add(&wake_q, waiter->task);
748 }
749
750 spin_unlock_mutex(&lock->wait_lock, flags);
751 wake_up_q(&wake_q);
752}
753
754/*
755 * Release the lock, slowpath:
756 */
757__visible void
758__mutex_unlock_slowpath(atomic_t *lock_count)
759{
760 struct mutex *lock = container_of(lock_count, struct mutex, count);
761
762 __mutex_unlock_common_slowpath(lock, 1);
763}
764
765#ifndef CONFIG_DEBUG_LOCK_ALLOC
766/*
767 * Here come the less common (and hence less performance-critical) APIs:
768 * mutex_lock_interruptible() and mutex_trylock().
769 */
770static noinline int __sched
771__mutex_lock_killable_slowpath(struct mutex *lock);
772
773static noinline int __sched
774__mutex_lock_interruptible_slowpath(struct mutex *lock);
775
776/**
777 * mutex_lock_interruptible - acquire the mutex, interruptible
778 * @lock: the mutex to be acquired
779 *
780 * Lock the mutex like mutex_lock(), and return 0 if the mutex has
781 * been acquired or sleep until the mutex becomes available. If a
782 * signal arrives while waiting for the lock then this function
783 * returns -EINTR.
784 *
785 * This function is similar to (but not equivalent to) down_interruptible().
786 */
787int __sched mutex_lock_interruptible(struct mutex *lock)
788{
789 int ret;
790
791 might_sleep();
792 ret = __mutex_fastpath_lock_retval(&lock->count);
793 if (likely(!ret)) {
794 mutex_set_owner(lock);
795 return 0;
796 } else
797 return __mutex_lock_interruptible_slowpath(lock);
798}
799
800EXPORT_SYMBOL(mutex_lock_interruptible);
801
802int __sched mutex_lock_killable(struct mutex *lock)
803{
804 int ret;
805
806 might_sleep();
807 ret = __mutex_fastpath_lock_retval(&lock->count);
808 if (likely(!ret)) {
809 mutex_set_owner(lock);
810 return 0;
811 } else
812 return __mutex_lock_killable_slowpath(lock);
813}
814EXPORT_SYMBOL(mutex_lock_killable);
815
816__visible void __sched
817__mutex_lock_slowpath(atomic_t *lock_count)
818{
819 struct mutex *lock = container_of(lock_count, struct mutex, count);
820
821 __mutex_lock_common(lock, TASK_UNINTERRUPTIBLE, 0,
822 NULL, _RET_IP_, NULL, 0);
823}
824
825static noinline int __sched
826__mutex_lock_killable_slowpath(struct mutex *lock)
827{
828 return __mutex_lock_common(lock, TASK_KILLABLE, 0,
829 NULL, _RET_IP_, NULL, 0);
830}
831
832static noinline int __sched
833__mutex_lock_interruptible_slowpath(struct mutex *lock)
834{
835 return __mutex_lock_common(lock, TASK_INTERRUPTIBLE, 0,
836 NULL, _RET_IP_, NULL, 0);
837}
838
839static noinline int __sched
840__ww_mutex_lock_slowpath(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
841{
842 return __mutex_lock_common(&lock->base, TASK_UNINTERRUPTIBLE, 0,
843 NULL, _RET_IP_, ctx, 1);
844}
845
846static noinline int __sched
847__ww_mutex_lock_interruptible_slowpath(struct ww_mutex *lock,
848 struct ww_acquire_ctx *ctx)
849{
850 return __mutex_lock_common(&lock->base, TASK_INTERRUPTIBLE, 0,
851 NULL, _RET_IP_, ctx, 1);
852}
853
854#endif
855
856/*
857 * Spinlock based trylock, we take the spinlock and check whether we
858 * can get the lock:
859 */
860static inline int __mutex_trylock_slowpath(atomic_t *lock_count)
861{
862 struct mutex *lock = container_of(lock_count, struct mutex, count);
863 unsigned long flags;
864 int prev;
865
866 /* No need to trylock if the mutex is locked. */
867 if (mutex_is_locked(lock))
868 return 0;
869
870 spin_lock_mutex(&lock->wait_lock, flags);
871
872 prev = atomic_xchg_acquire(&lock->count, -1);
873 if (likely(prev == 1)) {
874 mutex_set_owner(lock);
875 mutex_acquire(&lock->dep_map, 0, 1, _RET_IP_);
876 }
877
878 /* Set it back to 0 if there are no waiters: */
879 if (likely(list_empty(&lock->wait_list)))
880 atomic_set(&lock->count, 0);
881
882 spin_unlock_mutex(&lock->wait_lock, flags);
883
884 return prev == 1;
885}
886
887/**
888 * mutex_trylock - try to acquire the mutex, without waiting
889 * @lock: the mutex to be acquired
890 *
891 * Try to acquire the mutex atomically. Returns 1 if the mutex
892 * has been acquired successfully, and 0 on contention.
893 *
894 * NOTE: this function follows the spin_trylock() convention, so
895 * it is negated from the down_trylock() return values! Be careful
896 * about this when converting semaphore users to mutexes.
897 *
898 * This function must not be used in interrupt context. The
899 * mutex must be released by the same task that acquired it.
900 */
901int __sched mutex_trylock(struct mutex *lock)
902{
903 int ret;
904
905 ret = __mutex_fastpath_trylock(&lock->count, __mutex_trylock_slowpath);
906 if (ret)
907 mutex_set_owner(lock);
908
909 return ret;
910}
911EXPORT_SYMBOL(mutex_trylock);
912
913#ifndef CONFIG_DEBUG_LOCK_ALLOC
914int __sched
915__ww_mutex_lock(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
916{
917 int ret;
918
919 might_sleep();
920
921 ret = __mutex_fastpath_lock_retval(&lock->base.count);
922
923 if (likely(!ret)) {
924 ww_mutex_set_context_fastpath(lock, ctx);
925 mutex_set_owner(&lock->base);
926 } else
927 ret = __ww_mutex_lock_slowpath(lock, ctx);
928 return ret;
929}
930EXPORT_SYMBOL(__ww_mutex_lock);
931
932int __sched
933__ww_mutex_lock_interruptible(struct ww_mutex *lock, struct ww_acquire_ctx *ctx)
934{
935 int ret;
936
937 might_sleep();
938
939 ret = __mutex_fastpath_lock_retval(&lock->base.count);
940
941 if (likely(!ret)) {
942 ww_mutex_set_context_fastpath(lock, ctx);
943 mutex_set_owner(&lock->base);
944 } else
945 ret = __ww_mutex_lock_interruptible_slowpath(lock, ctx);
946 return ret;
947}
948EXPORT_SYMBOL(__ww_mutex_lock_interruptible);
949
950#endif
951
952/**
953 * atomic_dec_and_mutex_lock - return holding mutex if we dec to 0
954 * @cnt: the atomic which we are to dec
955 * @lock: the mutex to return holding if we dec to 0
956 *
957 * return true and hold lock if we dec to 0, return false otherwise
958 */
959int atomic_dec_and_mutex_lock(atomic_t *cnt, struct mutex *lock)
960{
961 /* dec if we can't possibly hit 0 */
962 if (atomic_add_unless(cnt, -1, 1))
963 return 0;
964 /* we might hit 0, so take the lock */
965 mutex_lock(lock);
966 if (!atomic_dec_and_test(cnt)) {
967 /* when we actually did the dec, we didn't hit 0 */
968 mutex_unlock(lock);
969 return 0;
970 }
971 /* we hit 0, and we hold the lock */
972 return 1;
973}
974EXPORT_SYMBOL(atomic_dec_and_mutex_lock);