2 * Fast Userspace Mutexes (which I call "Futexes!").
3 * (C) Rusty Russell, IBM 2002
5 * Generalized futexes, futex requeueing, misc fixes by Ingo Molnar
6 * (C) Copyright 2003 Red Hat Inc, All Rights Reserved
8 * Removed page pinning, fix privately mapped COW pages and other cleanups
9 * (C) Copyright 2003, 2004 Jamie Lokier
11 * Robust futex support started by Ingo Molnar
12 * (C) Copyright 2006 Red Hat Inc, All Rights Reserved
13 * Thanks to Thomas Gleixner for suggestions, analysis and fixes.
15 * PI-futex support started by Ingo Molnar and Thomas Gleixner
16 * Copyright (C) 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
17 * Copyright (C) 2006 Timesys Corp., Thomas Gleixner <tglx@timesys.com>
19 * PRIVATE futexes by Eric Dumazet
20 * Copyright (C) 2007 Eric Dumazet <dada1@cosmosbay.com>
22 * Requeue-PI support by Darren Hart <dvhltc@us.ibm.com>
23 * Copyright (C) IBM Corporation, 2009
24 * Thanks to Thomas Gleixner for conceptual design and careful reviews.
26 * Thanks to Ben LaHaise for yelling "hashed waitqueues" loudly
27 * enough at me, Linus for the original (flawed) idea, Matthew
28 * Kirkwood for proof-of-concept implementation.
30 * "The futexes are also cursed."
31 * "But they come in a choice of three flavours!"
33 * This program is free software; you can redistribute it and/or modify
34 * it under the terms of the GNU General Public License as published by
35 * the Free Software Foundation; either version 2 of the License, or
36 * (at your option) any later version.
38 * This program is distributed in the hope that it will be useful,
39 * but WITHOUT ANY WARRANTY; without even the implied warranty of
40 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
41 * GNU General Public License for more details.
43 * You should have received a copy of the GNU General Public License
44 * along with this program; if not, write to the Free Software
45 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
47 #include <linux/compat.h>
48 #include <linux/slab.h>
49 #include <linux/poll.h>
51 #include <linux/file.h>
52 #include <linux/jhash.h>
53 #include <linux/init.h>
54 #include <linux/futex.h>
55 #include <linux/mount.h>
56 #include <linux/pagemap.h>
57 #include <linux/syscalls.h>
58 #include <linux/signal.h>
59 #include <linux/export.h>
60 #include <linux/magic.h>
61 #include <linux/pid.h>
62 #include <linux/nsproxy.h>
63 #include <linux/ptrace.h>
64 #include <linux/sched/rt.h>
65 #include <linux/sched/wake_q.h>
66 #include <linux/sched/mm.h>
67 #include <linux/hugetlb.h>
68 #include <linux/freezer.h>
69 #include <linux/memblock.h>
70 #include <linux/fault-inject.h>
72 #include <asm/futex.h>
74 #include "locking/rtmutex_common.h"
77 * READ this before attempting to hack on futexes!
79 * Basic futex operation and ordering guarantees
80 * =============================================
82 * The waiter reads the futex value in user space and calls
83 * futex_wait(). This function computes the hash bucket and acquires
84 * the hash bucket lock. After that it reads the futex user space value
85 * again and verifies that the data has not changed. If it has not changed
86 * it enqueues itself into the hash bucket, releases the hash bucket lock
89 * The waker side modifies the user space value of the futex and calls
90 * futex_wake(). This function computes the hash bucket and acquires the
91 * hash bucket lock. Then it looks for waiters on that futex in the hash
92 * bucket and wakes them.
94 * In futex wake up scenarios where no tasks are blocked on a futex, taking
95 * the hb spinlock can be avoided and simply return. In order for this
96 * optimization to work, ordering guarantees must exist so that the waiter
97 * being added to the list is acknowledged when the list is concurrently being
98 * checked by the waker, avoiding scenarios like the following:
102 * sys_futex(WAIT, futex, val);
103 * futex_wait(futex, val);
106 * sys_futex(WAKE, futex);
111 * lock(hash_bucket(futex));
113 * unlock(hash_bucket(futex));
116 * This would cause the waiter on CPU 0 to wait forever because it
117 * missed the transition of the user space value from val to newval
118 * and the waker did not find the waiter in the hash bucket queue.
120 * The correct serialization ensures that a waiter either observes
121 * the changed user space value before blocking or is woken by a
126 * sys_futex(WAIT, futex, val);
127 * futex_wait(futex, val);
130 * smp_mb(); (A) <-- paired with -.
132 * lock(hash_bucket(futex)); |
136 * | sys_futex(WAKE, futex);
137 * | futex_wake(futex);
139 * `--------> smp_mb(); (B)
142 * unlock(hash_bucket(futex));
143 * schedule(); if (waiters)
144 * lock(hash_bucket(futex));
145 * else wake_waiters(futex);
146 * waiters--; (b) unlock(hash_bucket(futex));
148 * Where (A) orders the waiters increment and the futex value read through
149 * atomic operations (see hb_waiters_inc) and where (B) orders the write
150 * to futex and the waiters read -- this is done by the barriers for both
151 * shared and private futexes in get_futex_key_refs().
153 * This yields the following case (where X:=waiters, Y:=futex):
161 * Which guarantees that x==0 && y==0 is impossible; which translates back into
162 * the guarantee that we cannot both miss the futex variable change and the
165 * Note that a new waiter is accounted for in (a) even when it is possible that
166 * the wait call can return error, in which case we backtrack from it in (b).
167 * Refer to the comment in queue_lock().
169 * Similarly, in order to account for waiters being requeued on another
170 * address we always increment the waiters for the destination bucket before
171 * acquiring the lock. It then decrements them again after releasing it -
172 * the code that actually moves the futex(es) between hash buckets (requeue_futex)
173 * will do the additional required waiter count housekeeping. This is done for
174 * double_lock_hb() and double_unlock_hb(), respectively.
177 #ifdef CONFIG_HAVE_FUTEX_CMPXCHG
178 #define futex_cmpxchg_enabled 1
180 static int __read_mostly futex_cmpxchg_enabled;
184 * Futex flags used to encode options to functions and preserve them across
188 # define FLAGS_SHARED 0x01
191 * NOMMU does not have per process address space. Let the compiler optimize
194 # define FLAGS_SHARED 0x00
196 #define FLAGS_CLOCKRT 0x02
197 #define FLAGS_HAS_TIMEOUT 0x04
200 * Priority Inheritance state:
202 struct futex_pi_state {
204 * list of 'owned' pi_state instances - these have to be
205 * cleaned up in do_exit() if the task exits prematurely:
207 struct list_head list;
212 struct rt_mutex pi_mutex;
214 struct task_struct *owner;
218 } __randomize_layout;
221 * struct futex_q - The hashed futex queue entry, one per waiting task
222 * @list: priority-sorted list of tasks waiting on this futex
223 * @task: the task waiting on the futex
224 * @lock_ptr: the hash bucket lock
225 * @key: the key the futex is hashed on
226 * @pi_state: optional priority inheritance state
227 * @rt_waiter: rt_waiter storage for use with requeue_pi
228 * @requeue_pi_key: the requeue_pi target futex key
229 * @bitset: bitset for the optional bitmasked wakeup
231 * We use this hashed waitqueue, instead of a normal wait_queue_entry_t, so
232 * we can wake only the relevant ones (hashed queues may be shared).
234 * A futex_q has a woken state, just like tasks have TASK_RUNNING.
235 * It is considered woken when plist_node_empty(&q->list) || q->lock_ptr == 0.
236 * The order of wakeup is always to make the first condition true, then
239 * PI futexes are typically woken before they are removed from the hash list via
240 * the rt_mutex code. See unqueue_me_pi().
243 struct plist_node list;
245 struct task_struct *task;
246 spinlock_t *lock_ptr;
248 struct futex_pi_state *pi_state;
249 struct rt_mutex_waiter *rt_waiter;
250 union futex_key *requeue_pi_key;
252 } __randomize_layout;
254 static const struct futex_q futex_q_init = {
255 /* list gets initialized in queue_me()*/
256 .key = FUTEX_KEY_INIT,
257 .bitset = FUTEX_BITSET_MATCH_ANY
261 * Hash buckets are shared by all the futex_keys that hash to the same
262 * location. Each key may have multiple futex_q structures, one for each task
263 * waiting on a futex.
265 struct futex_hash_bucket {
268 struct plist_head chain;
269 } ____cacheline_aligned_in_smp;
272 * The base of the bucket array and its size are always used together
273 * (after initialization only in hash_futex()), so ensure that they
274 * reside in the same cacheline.
277 struct futex_hash_bucket *queues;
278 unsigned long hashsize;
279 } __futex_data __read_mostly __aligned(2*sizeof(long));
280 #define futex_queues (__futex_data.queues)
281 #define futex_hashsize (__futex_data.hashsize)
285 * Fault injections for futexes.
287 #ifdef CONFIG_FAIL_FUTEX
290 struct fault_attr attr;
294 .attr = FAULT_ATTR_INITIALIZER,
295 .ignore_private = false,
298 static int __init setup_fail_futex(char *str)
300 return setup_fault_attr(&fail_futex.attr, str);
302 __setup("fail_futex=", setup_fail_futex);
304 static bool should_fail_futex(bool fshared)
306 if (fail_futex.ignore_private && !fshared)
309 return should_fail(&fail_futex.attr, 1);
312 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
314 static int __init fail_futex_debugfs(void)
316 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
319 dir = fault_create_debugfs_attr("fail_futex", NULL,
324 debugfs_create_bool("ignore-private", mode, dir,
325 &fail_futex.ignore_private);
329 late_initcall(fail_futex_debugfs);
331 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
334 static inline bool should_fail_futex(bool fshared)
338 #endif /* CONFIG_FAIL_FUTEX */
340 static inline void futex_get_mm(union futex_key *key)
342 mmgrab(key->private.mm);
344 * Ensure futex_get_mm() implies a full barrier such that
345 * get_futex_key() implies a full barrier. This is relied upon
346 * as smp_mb(); (B), see the ordering comment above.
348 smp_mb__after_atomic();
352 * Reflects a new waiter being added to the waitqueue.
354 static inline void hb_waiters_inc(struct futex_hash_bucket *hb)
357 atomic_inc(&hb->waiters);
359 * Full barrier (A), see the ordering comment above.
361 smp_mb__after_atomic();
366 * Reflects a waiter being removed from the waitqueue by wakeup
369 static inline void hb_waiters_dec(struct futex_hash_bucket *hb)
372 atomic_dec(&hb->waiters);
376 static inline int hb_waiters_pending(struct futex_hash_bucket *hb)
379 return atomic_read(&hb->waiters);
386 * hash_futex - Return the hash bucket in the global hash
387 * @key: Pointer to the futex key for which the hash is calculated
389 * We hash on the keys returned from get_futex_key (see below) and return the
390 * corresponding hash bucket in the global hash.
392 static struct futex_hash_bucket *hash_futex(union futex_key *key)
394 u32 hash = jhash2((u32*)&key->both.word,
395 (sizeof(key->both.word)+sizeof(key->both.ptr))/4,
397 return &futex_queues[hash & (futex_hashsize - 1)];
402 * match_futex - Check whether two futex keys are equal
403 * @key1: Pointer to key1
404 * @key2: Pointer to key2
406 * Return 1 if two futex_keys are equal, 0 otherwise.
408 static inline int match_futex(union futex_key *key1, union futex_key *key2)
411 && key1->both.word == key2->both.word
412 && key1->both.ptr == key2->both.ptr
413 && key1->both.offset == key2->both.offset);
417 * Take a reference to the resource addressed by a key.
418 * Can be called while holding spinlocks.
421 static void get_futex_key_refs(union futex_key *key)
427 * On MMU less systems futexes are always "private" as there is no per
428 * process address space. We need the smp wmb nevertheless - yes,
429 * arch/blackfin has MMU less SMP ...
431 if (!IS_ENABLED(CONFIG_MMU)) {
432 smp_mb(); /* explicit smp_mb(); (B) */
436 switch (key->both.offset & (FUT_OFF_INODE|FUT_OFF_MMSHARED)) {
438 ihold(key->shared.inode); /* implies smp_mb(); (B) */
440 case FUT_OFF_MMSHARED:
441 futex_get_mm(key); /* implies smp_mb(); (B) */
445 * Private futexes do not hold reference on an inode or
446 * mm, therefore the only purpose of calling get_futex_key_refs
447 * is because we need the barrier for the lockless waiter check.
449 smp_mb(); /* explicit smp_mb(); (B) */
454 * Drop a reference to the resource addressed by a key.
455 * The hash bucket spinlock must not be held. This is
456 * a no-op for private futexes, see comment in the get
459 static void drop_futex_key_refs(union futex_key *key)
461 if (!key->both.ptr) {
462 /* If we're here then we tried to put a key we failed to get */
467 if (!IS_ENABLED(CONFIG_MMU))
470 switch (key->both.offset & (FUT_OFF_INODE|FUT_OFF_MMSHARED)) {
472 iput(key->shared.inode);
474 case FUT_OFF_MMSHARED:
475 mmdrop(key->private.mm);
486 * get_futex_key() - Get parameters which are the keys for a futex
487 * @uaddr: virtual address of the futex
488 * @fshared: 0 for a PROCESS_PRIVATE futex, 1 for PROCESS_SHARED
489 * @key: address where result is stored.
490 * @rw: mapping needs to be read/write (values: FUTEX_READ,
493 * Return: a negative error code or 0
495 * The key words are stored in @key on success.
497 * For shared mappings, it's (page->index, file_inode(vma->vm_file),
498 * offset_within_page). For private mappings, it's (uaddr, current->mm).
499 * We can usually work out the index without swapping in the page.
501 * lock_page() might sleep, the caller should not hold a spinlock.
504 get_futex_key(u32 __user *uaddr, int fshared, union futex_key *key, enum futex_access rw)
506 unsigned long address = (unsigned long)uaddr;
507 struct mm_struct *mm = current->mm;
508 struct page *page, *tail;
509 struct address_space *mapping;
513 * The futex address must be "naturally" aligned.
515 key->both.offset = address % PAGE_SIZE;
516 if (unlikely((address % sizeof(u32)) != 0))
518 address -= key->both.offset;
520 if (unlikely(!access_ok(uaddr, sizeof(u32))))
523 if (unlikely(should_fail_futex(fshared)))
527 * PROCESS_PRIVATE futexes are fast.
528 * As the mm cannot disappear under us and the 'key' only needs
529 * virtual address, we dont even have to find the underlying vma.
530 * Note : We do have to check 'uaddr' is a valid user address,
531 * but access_ok() should be faster than find_vma()
534 key->private.mm = mm;
535 key->private.address = address;
536 get_futex_key_refs(key); /* implies smp_mb(); (B) */
541 /* Ignore any VERIFY_READ mapping (futex common case) */
542 if (unlikely(should_fail_futex(fshared)))
545 err = get_user_pages_fast(address, 1, 1, &page);
547 * If write access is not required (eg. FUTEX_WAIT), try
548 * and get read-only access.
550 if (err == -EFAULT && rw == FUTEX_READ) {
551 err = get_user_pages_fast(address, 1, 0, &page);
560 * The treatment of mapping from this point on is critical. The page
561 * lock protects many things but in this context the page lock
562 * stabilizes mapping, prevents inode freeing in the shared
563 * file-backed region case and guards against movement to swap cache.
565 * Strictly speaking the page lock is not needed in all cases being
566 * considered here and page lock forces unnecessarily serialization
567 * From this point on, mapping will be re-verified if necessary and
568 * page lock will be acquired only if it is unavoidable
570 * Mapping checks require the head page for any compound page so the
571 * head page and mapping is looked up now. For anonymous pages, it
572 * does not matter if the page splits in the future as the key is
573 * based on the address. For filesystem-backed pages, the tail is
574 * required as the index of the page determines the key. For
575 * base pages, there is no tail page and tail == page.
578 page = compound_head(page);
579 mapping = READ_ONCE(page->mapping);
582 * If page->mapping is NULL, then it cannot be a PageAnon
583 * page; but it might be the ZERO_PAGE or in the gate area or
584 * in a special mapping (all cases which we are happy to fail);
585 * or it may have been a good file page when get_user_pages_fast
586 * found it, but truncated or holepunched or subjected to
587 * invalidate_complete_page2 before we got the page lock (also
588 * cases which we are happy to fail). And we hold a reference,
589 * so refcount care in invalidate_complete_page's remove_mapping
590 * prevents drop_caches from setting mapping to NULL beneath us.
592 * The case we do have to guard against is when memory pressure made
593 * shmem_writepage move it from filecache to swapcache beneath us:
594 * an unlikely race, but we do need to retry for page->mapping.
596 if (unlikely(!mapping)) {
600 * Page lock is required to identify which special case above
601 * applies. If this is really a shmem page then the page lock
602 * will prevent unexpected transitions.
605 shmem_swizzled = PageSwapCache(page) || page->mapping;
616 * Private mappings are handled in a simple way.
618 * If the futex key is stored on an anonymous page, then the associated
619 * object is the mm which is implicitly pinned by the calling process.
621 * NOTE: When userspace waits on a MAP_SHARED mapping, even if
622 * it's a read-only handle, it's expected that futexes attach to
623 * the object not the particular process.
625 if (PageAnon(page)) {
627 * A RO anonymous page will never change and thus doesn't make
628 * sense for futex operations.
630 if (unlikely(should_fail_futex(fshared)) || ro) {
635 key->both.offset |= FUT_OFF_MMSHARED; /* ref taken on mm */
636 key->private.mm = mm;
637 key->private.address = address;
639 get_futex_key_refs(key); /* implies smp_mb(); (B) */
645 * The associated futex object in this case is the inode and
646 * the page->mapping must be traversed. Ordinarily this should
647 * be stabilised under page lock but it's not strictly
648 * necessary in this case as we just want to pin the inode, not
649 * update the radix tree or anything like that.
651 * The RCU read lock is taken as the inode is finally freed
652 * under RCU. If the mapping still matches expectations then the
653 * mapping->host can be safely accessed as being a valid inode.
657 if (READ_ONCE(page->mapping) != mapping) {
664 inode = READ_ONCE(mapping->host);
673 * Take a reference unless it is about to be freed. Previously
674 * this reference was taken by ihold under the page lock
675 * pinning the inode in place so i_lock was unnecessary. The
676 * only way for this check to fail is if the inode was
677 * truncated in parallel which is almost certainly an
678 * application bug. In such a case, just retry.
680 * We are not calling into get_futex_key_refs() in file-backed
681 * cases, therefore a successful atomic_inc return below will
682 * guarantee that get_futex_key() will still imply smp_mb(); (B).
684 if (!atomic_inc_not_zero(&inode->i_count)) {
691 /* Should be impossible but lets be paranoid for now */
692 if (WARN_ON_ONCE(inode->i_mapping != mapping)) {
700 key->both.offset |= FUT_OFF_INODE; /* inode-based key */
701 key->shared.inode = inode;
702 key->shared.pgoff = basepage_index(tail);
711 static inline void put_futex_key(union futex_key *key)
713 drop_futex_key_refs(key);
717 * fault_in_user_writeable() - Fault in user address and verify RW access
718 * @uaddr: pointer to faulting user space address
720 * Slow path to fixup the fault we just took in the atomic write
723 * We have no generic implementation of a non-destructive write to the
724 * user address. We know that we faulted in the atomic pagefault
725 * disabled section so we can as well avoid the #PF overhead by
726 * calling get_user_pages() right away.
728 static int fault_in_user_writeable(u32 __user *uaddr)
730 struct mm_struct *mm = current->mm;
733 down_read(&mm->mmap_sem);
734 ret = fixup_user_fault(current, mm, (unsigned long)uaddr,
735 FAULT_FLAG_WRITE, NULL);
736 up_read(&mm->mmap_sem);
738 return ret < 0 ? ret : 0;
742 * futex_top_waiter() - Return the highest priority waiter on a futex
743 * @hb: the hash bucket the futex_q's reside in
744 * @key: the futex key (to distinguish it from other futex futex_q's)
746 * Must be called with the hb lock held.
748 static struct futex_q *futex_top_waiter(struct futex_hash_bucket *hb,
749 union futex_key *key)
751 struct futex_q *this;
753 plist_for_each_entry(this, &hb->chain, list) {
754 if (match_futex(&this->key, key))
760 static int cmpxchg_futex_value_locked(u32 *curval, u32 __user *uaddr,
761 u32 uval, u32 newval)
766 ret = futex_atomic_cmpxchg_inatomic(curval, uaddr, uval, newval);
772 static int get_futex_value_locked(u32 *dest, u32 __user *from)
777 ret = __get_user(*dest, from);
780 return ret ? -EFAULT : 0;
787 static int refill_pi_state_cache(void)
789 struct futex_pi_state *pi_state;
791 if (likely(current->pi_state_cache))
794 pi_state = kzalloc(sizeof(*pi_state), GFP_KERNEL);
799 INIT_LIST_HEAD(&pi_state->list);
800 /* pi_mutex gets initialized later */
801 pi_state->owner = NULL;
802 atomic_set(&pi_state->refcount, 1);
803 pi_state->key = FUTEX_KEY_INIT;
805 current->pi_state_cache = pi_state;
810 static struct futex_pi_state *alloc_pi_state(void)
812 struct futex_pi_state *pi_state = current->pi_state_cache;
815 current->pi_state_cache = NULL;
820 static void get_pi_state(struct futex_pi_state *pi_state)
822 WARN_ON_ONCE(!atomic_inc_not_zero(&pi_state->refcount));
826 * Drops a reference to the pi_state object and frees or caches it
827 * when the last reference is gone.
829 static void put_pi_state(struct futex_pi_state *pi_state)
834 if (!atomic_dec_and_test(&pi_state->refcount))
838 * If pi_state->owner is NULL, the owner is most probably dying
839 * and has cleaned up the pi_state already
841 if (pi_state->owner) {
842 struct task_struct *owner;
844 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
845 owner = pi_state->owner;
847 raw_spin_lock(&owner->pi_lock);
848 list_del_init(&pi_state->list);
849 raw_spin_unlock(&owner->pi_lock);
851 rt_mutex_proxy_unlock(&pi_state->pi_mutex, owner);
852 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
855 if (current->pi_state_cache) {
859 * pi_state->list is already empty.
860 * clear pi_state->owner.
861 * refcount is at 0 - put it back to 1.
863 pi_state->owner = NULL;
864 atomic_set(&pi_state->refcount, 1);
865 current->pi_state_cache = pi_state;
869 #ifdef CONFIG_FUTEX_PI
872 * This task is holding PI mutexes at exit time => bad.
873 * Kernel cleans up PI-state, but userspace is likely hosed.
874 * (Robust-futex cleanup is separate and might save the day for userspace.)
876 void exit_pi_state_list(struct task_struct *curr)
878 struct list_head *next, *head = &curr->pi_state_list;
879 struct futex_pi_state *pi_state;
880 struct futex_hash_bucket *hb;
881 union futex_key key = FUTEX_KEY_INIT;
883 if (!futex_cmpxchg_enabled)
886 * We are a ZOMBIE and nobody can enqueue itself on
887 * pi_state_list anymore, but we have to be careful
888 * versus waiters unqueueing themselves:
890 raw_spin_lock_irq(&curr->pi_lock);
891 while (!list_empty(head)) {
893 pi_state = list_entry(next, struct futex_pi_state, list);
895 hb = hash_futex(&key);
898 * We can race against put_pi_state() removing itself from the
899 * list (a waiter going away). put_pi_state() will first
900 * decrement the reference count and then modify the list, so
901 * its possible to see the list entry but fail this reference
904 * In that case; drop the locks to let put_pi_state() make
905 * progress and retry the loop.
907 if (!atomic_inc_not_zero(&pi_state->refcount)) {
908 raw_spin_unlock_irq(&curr->pi_lock);
910 raw_spin_lock_irq(&curr->pi_lock);
913 raw_spin_unlock_irq(&curr->pi_lock);
915 spin_lock(&hb->lock);
916 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
917 raw_spin_lock(&curr->pi_lock);
919 * We dropped the pi-lock, so re-check whether this
920 * task still owns the PI-state:
922 if (head->next != next) {
923 /* retain curr->pi_lock for the loop invariant */
924 raw_spin_unlock(&pi_state->pi_mutex.wait_lock);
925 spin_unlock(&hb->lock);
926 put_pi_state(pi_state);
930 WARN_ON(pi_state->owner != curr);
931 WARN_ON(list_empty(&pi_state->list));
932 list_del_init(&pi_state->list);
933 pi_state->owner = NULL;
935 raw_spin_unlock(&curr->pi_lock);
936 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
937 spin_unlock(&hb->lock);
939 rt_mutex_futex_unlock(&pi_state->pi_mutex);
940 put_pi_state(pi_state);
942 raw_spin_lock_irq(&curr->pi_lock);
944 raw_spin_unlock_irq(&curr->pi_lock);
950 * We need to check the following states:
952 * Waiter | pi_state | pi->owner | uTID | uODIED | ?
954 * [1] NULL | --- | --- | 0 | 0/1 | Valid
955 * [2] NULL | --- | --- | >0 | 0/1 | Valid
957 * [3] Found | NULL | -- | Any | 0/1 | Invalid
959 * [4] Found | Found | NULL | 0 | 1 | Valid
960 * [5] Found | Found | NULL | >0 | 1 | Invalid
962 * [6] Found | Found | task | 0 | 1 | Valid
964 * [7] Found | Found | NULL | Any | 0 | Invalid
966 * [8] Found | Found | task | ==taskTID | 0/1 | Valid
967 * [9] Found | Found | task | 0 | 0 | Invalid
968 * [10] Found | Found | task | !=taskTID | 0/1 | Invalid
970 * [1] Indicates that the kernel can acquire the futex atomically. We
971 * came came here due to a stale FUTEX_WAITERS/FUTEX_OWNER_DIED bit.
973 * [2] Valid, if TID does not belong to a kernel thread. If no matching
974 * thread is found then it indicates that the owner TID has died.
976 * [3] Invalid. The waiter is queued on a non PI futex
978 * [4] Valid state after exit_robust_list(), which sets the user space
979 * value to FUTEX_WAITERS | FUTEX_OWNER_DIED.
981 * [5] The user space value got manipulated between exit_robust_list()
982 * and exit_pi_state_list()
984 * [6] Valid state after exit_pi_state_list() which sets the new owner in
985 * the pi_state but cannot access the user space value.
987 * [7] pi_state->owner can only be NULL when the OWNER_DIED bit is set.
989 * [8] Owner and user space value match
991 * [9] There is no transient state which sets the user space TID to 0
992 * except exit_robust_list(), but this is indicated by the
993 * FUTEX_OWNER_DIED bit. See [4]
995 * [10] There is no transient state which leaves owner and user space
999 * Serialization and lifetime rules:
1003 * hb -> futex_q, relation
1004 * futex_q -> pi_state, relation
1006 * (cannot be raw because hb can contain arbitrary amount
1009 * pi_mutex->wait_lock:
1013 * (and pi_mutex 'obviously')
1017 * p->pi_state_list -> pi_state->list, relation
1019 * pi_state->refcount:
1027 * pi_mutex->wait_lock
1033 * Validate that the existing waiter has a pi_state and sanity check
1034 * the pi_state against the user space value. If correct, attach to
1037 static int attach_to_pi_state(u32 __user *uaddr, u32 uval,
1038 struct futex_pi_state *pi_state,
1039 struct futex_pi_state **ps)
1041 pid_t pid = uval & FUTEX_TID_MASK;
1046 * Userspace might have messed up non-PI and PI futexes [3]
1048 if (unlikely(!pi_state))
1052 * We get here with hb->lock held, and having found a
1053 * futex_top_waiter(). This means that futex_lock_pi() of said futex_q
1054 * has dropped the hb->lock in between queue_me() and unqueue_me_pi(),
1055 * which in turn means that futex_lock_pi() still has a reference on
1058 * The waiter holding a reference on @pi_state also protects against
1059 * the unlocked put_pi_state() in futex_unlock_pi(), futex_lock_pi()
1060 * and futex_wait_requeue_pi() as it cannot go to 0 and consequently
1061 * free pi_state before we can take a reference ourselves.
1063 WARN_ON(!atomic_read(&pi_state->refcount));
1066 * Now that we have a pi_state, we can acquire wait_lock
1067 * and do the state validation.
1069 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
1072 * Since {uval, pi_state} is serialized by wait_lock, and our current
1073 * uval was read without holding it, it can have changed. Verify it
1074 * still is what we expect it to be, otherwise retry the entire
1077 if (get_futex_value_locked(&uval2, uaddr))
1084 * Handle the owner died case:
1086 if (uval & FUTEX_OWNER_DIED) {
1088 * exit_pi_state_list sets owner to NULL and wakes the
1089 * topmost waiter. The task which acquires the
1090 * pi_state->rt_mutex will fixup owner.
1092 if (!pi_state->owner) {
1094 * No pi state owner, but the user space TID
1095 * is not 0. Inconsistent state. [5]
1100 * Take a ref on the state and return success. [4]
1106 * If TID is 0, then either the dying owner has not
1107 * yet executed exit_pi_state_list() or some waiter
1108 * acquired the rtmutex in the pi state, but did not
1109 * yet fixup the TID in user space.
1111 * Take a ref on the state and return success. [6]
1117 * If the owner died bit is not set, then the pi_state
1118 * must have an owner. [7]
1120 if (!pi_state->owner)
1125 * Bail out if user space manipulated the futex value. If pi
1126 * state exists then the owner TID must be the same as the
1127 * user space TID. [9/10]
1129 if (pid != task_pid_vnr(pi_state->owner))
1133 get_pi_state(pi_state);
1134 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
1151 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
1155 static int handle_exit_race(u32 __user *uaddr, u32 uval,
1156 struct task_struct *tsk)
1161 * If PF_EXITPIDONE is not yet set, then try again.
1163 if (tsk && !(tsk->flags & PF_EXITPIDONE))
1167 * Reread the user space value to handle the following situation:
1171 * sys_exit() sys_futex()
1172 * do_exit() futex_lock_pi()
1173 * futex_lock_pi_atomic()
1174 * exit_signals(tsk) No waiters:
1175 * tsk->flags |= PF_EXITING; *uaddr == 0x00000PID
1176 * mm_release(tsk) Set waiter bit
1177 * exit_robust_list(tsk) { *uaddr = 0x80000PID;
1178 * Set owner died attach_to_pi_owner() {
1179 * *uaddr = 0xC0000000; tsk = get_task(PID);
1180 * } if (!tsk->flags & PF_EXITING) {
1182 * tsk->flags |= PF_EXITPIDONE; } else {
1183 * if (!(tsk->flags & PF_EXITPIDONE))
1185 * return -ESRCH; <--- FAIL
1188 * Returning ESRCH unconditionally is wrong here because the
1189 * user space value has been changed by the exiting task.
1191 * The same logic applies to the case where the exiting task is
1194 if (get_futex_value_locked(&uval2, uaddr))
1197 /* If the user space value has changed, try again. */
1202 * The exiting task did not have a robust list, the robust list was
1203 * corrupted or the user space value in *uaddr is simply bogus.
1204 * Give up and tell user space.
1210 * Lookup the task for the TID provided from user space and attach to
1211 * it after doing proper sanity checks.
1213 static int attach_to_pi_owner(u32 __user *uaddr, u32 uval, union futex_key *key,
1214 struct futex_pi_state **ps)
1216 pid_t pid = uval & FUTEX_TID_MASK;
1217 struct futex_pi_state *pi_state;
1218 struct task_struct *p;
1221 * We are the first waiter - try to look up the real owner and attach
1222 * the new pi_state to it, but bail out when TID = 0 [1]
1224 * The !pid check is paranoid. None of the call sites should end up
1225 * with pid == 0, but better safe than sorry. Let the caller retry
1229 p = find_get_task_by_vpid(pid);
1231 return handle_exit_race(uaddr, uval, NULL);
1233 if (unlikely(p->flags & PF_KTHREAD)) {
1239 * We need to look at the task state flags to figure out,
1240 * whether the task is exiting. To protect against the do_exit
1241 * change of the task flags, we do this protected by
1244 raw_spin_lock_irq(&p->pi_lock);
1245 if (unlikely(p->flags & PF_EXITING)) {
1247 * The task is on the way out. When PF_EXITPIDONE is
1248 * set, we know that the task has finished the
1251 int ret = handle_exit_race(uaddr, uval, p);
1253 raw_spin_unlock_irq(&p->pi_lock);
1259 * No existing pi state. First waiter. [2]
1261 * This creates pi_state, we have hb->lock held, this means nothing can
1262 * observe this state, wait_lock is irrelevant.
1264 pi_state = alloc_pi_state();
1267 * Initialize the pi_mutex in locked state and make @p
1270 rt_mutex_init_proxy_locked(&pi_state->pi_mutex, p);
1272 /* Store the key for possible exit cleanups: */
1273 pi_state->key = *key;
1275 WARN_ON(!list_empty(&pi_state->list));
1276 list_add(&pi_state->list, &p->pi_state_list);
1278 * Assignment without holding pi_state->pi_mutex.wait_lock is safe
1279 * because there is no concurrency as the object is not published yet.
1281 pi_state->owner = p;
1282 raw_spin_unlock_irq(&p->pi_lock);
1291 static int lookup_pi_state(u32 __user *uaddr, u32 uval,
1292 struct futex_hash_bucket *hb,
1293 union futex_key *key, struct futex_pi_state **ps)
1295 struct futex_q *top_waiter = futex_top_waiter(hb, key);
1298 * If there is a waiter on that futex, validate it and
1299 * attach to the pi_state when the validation succeeds.
1302 return attach_to_pi_state(uaddr, uval, top_waiter->pi_state, ps);
1305 * We are the first waiter - try to look up the owner based on
1306 * @uval and attach to it.
1308 return attach_to_pi_owner(uaddr, uval, key, ps);
1311 static int lock_pi_update_atomic(u32 __user *uaddr, u32 uval, u32 newval)
1313 u32 uninitialized_var(curval);
1315 if (unlikely(should_fail_futex(true)))
1318 if (unlikely(cmpxchg_futex_value_locked(&curval, uaddr, uval, newval)))
1321 /* If user space value changed, let the caller retry */
1322 return curval != uval ? -EAGAIN : 0;
1326 * futex_lock_pi_atomic() - Atomic work required to acquire a pi aware futex
1327 * @uaddr: the pi futex user address
1328 * @hb: the pi futex hash bucket
1329 * @key: the futex key associated with uaddr and hb
1330 * @ps: the pi_state pointer where we store the result of the
1332 * @task: the task to perform the atomic lock work for. This will
1333 * be "current" except in the case of requeue pi.
1334 * @set_waiters: force setting the FUTEX_WAITERS bit (1) or not (0)
1337 * - 0 - ready to wait;
1338 * - 1 - acquired the lock;
1341 * The hb->lock and futex_key refs shall be held by the caller.
1343 static int futex_lock_pi_atomic(u32 __user *uaddr, struct futex_hash_bucket *hb,
1344 union futex_key *key,
1345 struct futex_pi_state **ps,
1346 struct task_struct *task, int set_waiters)
1348 u32 uval, newval, vpid = task_pid_vnr(task);
1349 struct futex_q *top_waiter;
1353 * Read the user space value first so we can validate a few
1354 * things before proceeding further.
1356 if (get_futex_value_locked(&uval, uaddr))
1359 if (unlikely(should_fail_futex(true)))
1365 if ((unlikely((uval & FUTEX_TID_MASK) == vpid)))
1368 if ((unlikely(should_fail_futex(true))))
1372 * Lookup existing state first. If it exists, try to attach to
1375 top_waiter = futex_top_waiter(hb, key);
1377 return attach_to_pi_state(uaddr, uval, top_waiter->pi_state, ps);
1380 * No waiter and user TID is 0. We are here because the
1381 * waiters or the owner died bit is set or called from
1382 * requeue_cmp_pi or for whatever reason something took the
1385 if (!(uval & FUTEX_TID_MASK)) {
1387 * We take over the futex. No other waiters and the user space
1388 * TID is 0. We preserve the owner died bit.
1390 newval = uval & FUTEX_OWNER_DIED;
1393 /* The futex requeue_pi code can enforce the waiters bit */
1395 newval |= FUTEX_WAITERS;
1397 ret = lock_pi_update_atomic(uaddr, uval, newval);
1398 /* If the take over worked, return 1 */
1399 return ret < 0 ? ret : 1;
1403 * First waiter. Set the waiters bit before attaching ourself to
1404 * the owner. If owner tries to unlock, it will be forced into
1405 * the kernel and blocked on hb->lock.
1407 newval = uval | FUTEX_WAITERS;
1408 ret = lock_pi_update_atomic(uaddr, uval, newval);
1412 * If the update of the user space value succeeded, we try to
1413 * attach to the owner. If that fails, no harm done, we only
1414 * set the FUTEX_WAITERS bit in the user space variable.
1416 return attach_to_pi_owner(uaddr, newval, key, ps);
1420 * __unqueue_futex() - Remove the futex_q from its futex_hash_bucket
1421 * @q: The futex_q to unqueue
1423 * The q->lock_ptr must not be NULL and must be held by the caller.
1425 static void __unqueue_futex(struct futex_q *q)
1427 struct futex_hash_bucket *hb;
1429 if (WARN_ON_SMP(!q->lock_ptr) || WARN_ON(plist_node_empty(&q->list)))
1431 lockdep_assert_held(q->lock_ptr);
1433 hb = container_of(q->lock_ptr, struct futex_hash_bucket, lock);
1434 plist_del(&q->list, &hb->chain);
1439 * The hash bucket lock must be held when this is called.
1440 * Afterwards, the futex_q must not be accessed. Callers
1441 * must ensure to later call wake_up_q() for the actual
1444 static void mark_wake_futex(struct wake_q_head *wake_q, struct futex_q *q)
1446 struct task_struct *p = q->task;
1448 if (WARN(q->pi_state || q->rt_waiter, "refusing to wake PI futex\n"))
1454 * The waiting task can free the futex_q as soon as q->lock_ptr = NULL
1455 * is written, without taking any locks. This is possible in the event
1456 * of a spurious wakeup, for example. A memory barrier is required here
1457 * to prevent the following store to lock_ptr from getting ahead of the
1458 * plist_del in __unqueue_futex().
1460 smp_store_release(&q->lock_ptr, NULL);
1463 * Queue the task for later wakeup for after we've released
1464 * the hb->lock. wake_q_add() grabs reference to p.
1466 wake_q_add(wake_q, p);
1471 * Caller must hold a reference on @pi_state.
1473 static int wake_futex_pi(u32 __user *uaddr, u32 uval, struct futex_pi_state *pi_state)
1475 u32 uninitialized_var(curval), newval;
1476 struct task_struct *new_owner;
1477 bool postunlock = false;
1478 DEFINE_WAKE_Q(wake_q);
1481 new_owner = rt_mutex_next_owner(&pi_state->pi_mutex);
1482 if (WARN_ON_ONCE(!new_owner)) {
1484 * As per the comment in futex_unlock_pi() this should not happen.
1486 * When this happens, give up our locks and try again, giving
1487 * the futex_lock_pi() instance time to complete, either by
1488 * waiting on the rtmutex or removing itself from the futex
1496 * We pass it to the next owner. The WAITERS bit is always kept
1497 * enabled while there is PI state around. We cleanup the owner
1498 * died bit, because we are the owner.
1500 newval = FUTEX_WAITERS | task_pid_vnr(new_owner);
1502 if (unlikely(should_fail_futex(true)))
1505 if (cmpxchg_futex_value_locked(&curval, uaddr, uval, newval)) {
1508 } else if (curval != uval) {
1510 * If a unconditional UNLOCK_PI operation (user space did not
1511 * try the TID->0 transition) raced with a waiter setting the
1512 * FUTEX_WAITERS flag between get_user() and locking the hash
1513 * bucket lock, retry the operation.
1515 if ((FUTEX_TID_MASK & curval) == uval)
1525 * This is a point of no return; once we modify the uval there is no
1526 * going back and subsequent operations must not fail.
1529 raw_spin_lock(&pi_state->owner->pi_lock);
1530 WARN_ON(list_empty(&pi_state->list));
1531 list_del_init(&pi_state->list);
1532 raw_spin_unlock(&pi_state->owner->pi_lock);
1534 raw_spin_lock(&new_owner->pi_lock);
1535 WARN_ON(!list_empty(&pi_state->list));
1536 list_add(&pi_state->list, &new_owner->pi_state_list);
1537 pi_state->owner = new_owner;
1538 raw_spin_unlock(&new_owner->pi_lock);
1540 postunlock = __rt_mutex_futex_unlock(&pi_state->pi_mutex, &wake_q);
1543 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
1546 rt_mutex_postunlock(&wake_q);
1552 * Express the locking dependencies for lockdep:
1555 double_lock_hb(struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2)
1558 spin_lock(&hb1->lock);
1560 spin_lock_nested(&hb2->lock, SINGLE_DEPTH_NESTING);
1561 } else { /* hb1 > hb2 */
1562 spin_lock(&hb2->lock);
1563 spin_lock_nested(&hb1->lock, SINGLE_DEPTH_NESTING);
1568 double_unlock_hb(struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2)
1570 spin_unlock(&hb1->lock);
1572 spin_unlock(&hb2->lock);
1576 * Wake up waiters matching bitset queued on this futex (uaddr).
1579 futex_wake(u32 __user *uaddr, unsigned int flags, int nr_wake, u32 bitset)
1581 struct futex_hash_bucket *hb;
1582 struct futex_q *this, *next;
1583 union futex_key key = FUTEX_KEY_INIT;
1585 DEFINE_WAKE_Q(wake_q);
1590 ret = get_futex_key(uaddr, flags & FLAGS_SHARED, &key, FUTEX_READ);
1591 if (unlikely(ret != 0))
1594 hb = hash_futex(&key);
1596 /* Make sure we really have tasks to wakeup */
1597 if (!hb_waiters_pending(hb))
1600 spin_lock(&hb->lock);
1602 plist_for_each_entry_safe(this, next, &hb->chain, list) {
1603 if (match_futex (&this->key, &key)) {
1604 if (this->pi_state || this->rt_waiter) {
1609 /* Check if one of the bits is set in both bitsets */
1610 if (!(this->bitset & bitset))
1613 mark_wake_futex(&wake_q, this);
1614 if (++ret >= nr_wake)
1619 spin_unlock(&hb->lock);
1622 put_futex_key(&key);
1627 static int futex_atomic_op_inuser(unsigned int encoded_op, u32 __user *uaddr)
1629 unsigned int op = (encoded_op & 0x70000000) >> 28;
1630 unsigned int cmp = (encoded_op & 0x0f000000) >> 24;
1631 int oparg = sign_extend32((encoded_op & 0x00fff000) >> 12, 11);
1632 int cmparg = sign_extend32(encoded_op & 0x00000fff, 11);
1635 if (encoded_op & (FUTEX_OP_OPARG_SHIFT << 28)) {
1636 if (oparg < 0 || oparg > 31) {
1637 char comm[sizeof(current->comm)];
1639 * kill this print and return -EINVAL when userspace
1642 pr_info_ratelimited("futex_wake_op: %s tries to shift op by %d; fix this program\n",
1643 get_task_comm(comm, current), oparg);
1649 if (!access_ok(uaddr, sizeof(u32)))
1652 ret = arch_futex_atomic_op_inuser(op, oparg, &oldval, uaddr);
1657 case FUTEX_OP_CMP_EQ:
1658 return oldval == cmparg;
1659 case FUTEX_OP_CMP_NE:
1660 return oldval != cmparg;
1661 case FUTEX_OP_CMP_LT:
1662 return oldval < cmparg;
1663 case FUTEX_OP_CMP_GE:
1664 return oldval >= cmparg;
1665 case FUTEX_OP_CMP_LE:
1666 return oldval <= cmparg;
1667 case FUTEX_OP_CMP_GT:
1668 return oldval > cmparg;
1675 * Wake up all waiters hashed on the physical page that is mapped
1676 * to this virtual address:
1679 futex_wake_op(u32 __user *uaddr1, unsigned int flags, u32 __user *uaddr2,
1680 int nr_wake, int nr_wake2, int op)
1682 union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT;
1683 struct futex_hash_bucket *hb1, *hb2;
1684 struct futex_q *this, *next;
1686 DEFINE_WAKE_Q(wake_q);
1689 ret = get_futex_key(uaddr1, flags & FLAGS_SHARED, &key1, FUTEX_READ);
1690 if (unlikely(ret != 0))
1692 ret = get_futex_key(uaddr2, flags & FLAGS_SHARED, &key2, FUTEX_WRITE);
1693 if (unlikely(ret != 0))
1696 hb1 = hash_futex(&key1);
1697 hb2 = hash_futex(&key2);
1700 double_lock_hb(hb1, hb2);
1701 op_ret = futex_atomic_op_inuser(op, uaddr2);
1702 if (unlikely(op_ret < 0)) {
1704 double_unlock_hb(hb1, hb2);
1708 * we don't get EFAULT from MMU faults if we don't have an MMU,
1709 * but we might get them from range checking
1715 if (unlikely(op_ret != -EFAULT)) {
1720 ret = fault_in_user_writeable(uaddr2);
1724 if (!(flags & FLAGS_SHARED))
1727 put_futex_key(&key2);
1728 put_futex_key(&key1);
1732 plist_for_each_entry_safe(this, next, &hb1->chain, list) {
1733 if (match_futex (&this->key, &key1)) {
1734 if (this->pi_state || this->rt_waiter) {
1738 mark_wake_futex(&wake_q, this);
1739 if (++ret >= nr_wake)
1746 plist_for_each_entry_safe(this, next, &hb2->chain, list) {
1747 if (match_futex (&this->key, &key2)) {
1748 if (this->pi_state || this->rt_waiter) {
1752 mark_wake_futex(&wake_q, this);
1753 if (++op_ret >= nr_wake2)
1761 double_unlock_hb(hb1, hb2);
1764 put_futex_key(&key2);
1766 put_futex_key(&key1);
1772 * requeue_futex() - Requeue a futex_q from one hb to another
1773 * @q: the futex_q to requeue
1774 * @hb1: the source hash_bucket
1775 * @hb2: the target hash_bucket
1776 * @key2: the new key for the requeued futex_q
1779 void requeue_futex(struct futex_q *q, struct futex_hash_bucket *hb1,
1780 struct futex_hash_bucket *hb2, union futex_key *key2)
1784 * If key1 and key2 hash to the same bucket, no need to
1787 if (likely(&hb1->chain != &hb2->chain)) {
1788 plist_del(&q->list, &hb1->chain);
1789 hb_waiters_dec(hb1);
1790 hb_waiters_inc(hb2);
1791 plist_add(&q->list, &hb2->chain);
1792 q->lock_ptr = &hb2->lock;
1794 get_futex_key_refs(key2);
1799 * requeue_pi_wake_futex() - Wake a task that acquired the lock during requeue
1801 * @key: the key of the requeue target futex
1802 * @hb: the hash_bucket of the requeue target futex
1804 * During futex_requeue, with requeue_pi=1, it is possible to acquire the
1805 * target futex if it is uncontended or via a lock steal. Set the futex_q key
1806 * to the requeue target futex so the waiter can detect the wakeup on the right
1807 * futex, but remove it from the hb and NULL the rt_waiter so it can detect
1808 * atomic lock acquisition. Set the q->lock_ptr to the requeue target hb->lock
1809 * to protect access to the pi_state to fixup the owner later. Must be called
1810 * with both q->lock_ptr and hb->lock held.
1813 void requeue_pi_wake_futex(struct futex_q *q, union futex_key *key,
1814 struct futex_hash_bucket *hb)
1816 get_futex_key_refs(key);
1821 WARN_ON(!q->rt_waiter);
1822 q->rt_waiter = NULL;
1824 q->lock_ptr = &hb->lock;
1826 wake_up_state(q->task, TASK_NORMAL);
1830 * futex_proxy_trylock_atomic() - Attempt an atomic lock for the top waiter
1831 * @pifutex: the user address of the to futex
1832 * @hb1: the from futex hash bucket, must be locked by the caller
1833 * @hb2: the to futex hash bucket, must be locked by the caller
1834 * @key1: the from futex key
1835 * @key2: the to futex key
1836 * @ps: address to store the pi_state pointer
1837 * @set_waiters: force setting the FUTEX_WAITERS bit (1) or not (0)
1839 * Try and get the lock on behalf of the top waiter if we can do it atomically.
1840 * Wake the top waiter if we succeed. If the caller specified set_waiters,
1841 * then direct futex_lock_pi_atomic() to force setting the FUTEX_WAITERS bit.
1842 * hb1 and hb2 must be held by the caller.
1845 * - 0 - failed to acquire the lock atomically;
1846 * - >0 - acquired the lock, return value is vpid of the top_waiter
1849 static int futex_proxy_trylock_atomic(u32 __user *pifutex,
1850 struct futex_hash_bucket *hb1,
1851 struct futex_hash_bucket *hb2,
1852 union futex_key *key1, union futex_key *key2,
1853 struct futex_pi_state **ps, int set_waiters)
1855 struct futex_q *top_waiter = NULL;
1859 if (get_futex_value_locked(&curval, pifutex))
1862 if (unlikely(should_fail_futex(true)))
1866 * Find the top_waiter and determine if there are additional waiters.
1867 * If the caller intends to requeue more than 1 waiter to pifutex,
1868 * force futex_lock_pi_atomic() to set the FUTEX_WAITERS bit now,
1869 * as we have means to handle the possible fault. If not, don't set
1870 * the bit unecessarily as it will force the subsequent unlock to enter
1873 top_waiter = futex_top_waiter(hb1, key1);
1875 /* There are no waiters, nothing for us to do. */
1879 /* Ensure we requeue to the expected futex. */
1880 if (!match_futex(top_waiter->requeue_pi_key, key2))
1884 * Try to take the lock for top_waiter. Set the FUTEX_WAITERS bit in
1885 * the contended case or if set_waiters is 1. The pi_state is returned
1886 * in ps in contended cases.
1888 vpid = task_pid_vnr(top_waiter->task);
1889 ret = futex_lock_pi_atomic(pifutex, hb2, key2, ps, top_waiter->task,
1892 requeue_pi_wake_futex(top_waiter, key2, hb2);
1899 * futex_requeue() - Requeue waiters from uaddr1 to uaddr2
1900 * @uaddr1: source futex user address
1901 * @flags: futex flags (FLAGS_SHARED, etc.)
1902 * @uaddr2: target futex user address
1903 * @nr_wake: number of waiters to wake (must be 1 for requeue_pi)
1904 * @nr_requeue: number of waiters to requeue (0-INT_MAX)
1905 * @cmpval: @uaddr1 expected value (or %NULL)
1906 * @requeue_pi: if we are attempting to requeue from a non-pi futex to a
1907 * pi futex (pi to pi requeue is not supported)
1909 * Requeue waiters on uaddr1 to uaddr2. In the requeue_pi case, try to acquire
1910 * uaddr2 atomically on behalf of the top waiter.
1913 * - >=0 - on success, the number of tasks requeued or woken;
1916 static int futex_requeue(u32 __user *uaddr1, unsigned int flags,
1917 u32 __user *uaddr2, int nr_wake, int nr_requeue,
1918 u32 *cmpval, int requeue_pi)
1920 union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT;
1921 int drop_count = 0, task_count = 0, ret;
1922 struct futex_pi_state *pi_state = NULL;
1923 struct futex_hash_bucket *hb1, *hb2;
1924 struct futex_q *this, *next;
1925 DEFINE_WAKE_Q(wake_q);
1927 if (nr_wake < 0 || nr_requeue < 0)
1931 * When PI not supported: return -ENOSYS if requeue_pi is true,
1932 * consequently the compiler knows requeue_pi is always false past
1933 * this point which will optimize away all the conditional code
1936 if (!IS_ENABLED(CONFIG_FUTEX_PI) && requeue_pi)
1941 * Requeue PI only works on two distinct uaddrs. This
1942 * check is only valid for private futexes. See below.
1944 if (uaddr1 == uaddr2)
1948 * requeue_pi requires a pi_state, try to allocate it now
1949 * without any locks in case it fails.
1951 if (refill_pi_state_cache())
1954 * requeue_pi must wake as many tasks as it can, up to nr_wake
1955 * + nr_requeue, since it acquires the rt_mutex prior to
1956 * returning to userspace, so as to not leave the rt_mutex with
1957 * waiters and no owner. However, second and third wake-ups
1958 * cannot be predicted as they involve race conditions with the
1959 * first wake and a fault while looking up the pi_state. Both
1960 * pthread_cond_signal() and pthread_cond_broadcast() should
1968 ret = get_futex_key(uaddr1, flags & FLAGS_SHARED, &key1, FUTEX_READ);
1969 if (unlikely(ret != 0))
1971 ret = get_futex_key(uaddr2, flags & FLAGS_SHARED, &key2,
1972 requeue_pi ? FUTEX_WRITE : FUTEX_READ);
1973 if (unlikely(ret != 0))
1977 * The check above which compares uaddrs is not sufficient for
1978 * shared futexes. We need to compare the keys:
1980 if (requeue_pi && match_futex(&key1, &key2)) {
1985 hb1 = hash_futex(&key1);
1986 hb2 = hash_futex(&key2);
1989 hb_waiters_inc(hb2);
1990 double_lock_hb(hb1, hb2);
1992 if (likely(cmpval != NULL)) {
1995 ret = get_futex_value_locked(&curval, uaddr1);
1997 if (unlikely(ret)) {
1998 double_unlock_hb(hb1, hb2);
1999 hb_waiters_dec(hb2);
2001 ret = get_user(curval, uaddr1);
2005 if (!(flags & FLAGS_SHARED))
2008 put_futex_key(&key2);
2009 put_futex_key(&key1);
2012 if (curval != *cmpval) {
2018 if (requeue_pi && (task_count - nr_wake < nr_requeue)) {
2020 * Attempt to acquire uaddr2 and wake the top waiter. If we
2021 * intend to requeue waiters, force setting the FUTEX_WAITERS
2022 * bit. We force this here where we are able to easily handle
2023 * faults rather in the requeue loop below.
2025 ret = futex_proxy_trylock_atomic(uaddr2, hb1, hb2, &key1,
2026 &key2, &pi_state, nr_requeue);
2029 * At this point the top_waiter has either taken uaddr2 or is
2030 * waiting on it. If the former, then the pi_state will not
2031 * exist yet, look it up one more time to ensure we have a
2032 * reference to it. If the lock was taken, ret contains the
2033 * vpid of the top waiter task.
2034 * If the lock was not taken, we have pi_state and an initial
2035 * refcount on it. In case of an error we have nothing.
2042 * If we acquired the lock, then the user space value
2043 * of uaddr2 should be vpid. It cannot be changed by
2044 * the top waiter as it is blocked on hb2 lock if it
2045 * tries to do so. If something fiddled with it behind
2046 * our back the pi state lookup might unearth it. So
2047 * we rather use the known value than rereading and
2048 * handing potential crap to lookup_pi_state.
2050 * If that call succeeds then we have pi_state and an
2051 * initial refcount on it.
2053 ret = lookup_pi_state(uaddr2, ret, hb2, &key2, &pi_state);
2058 /* We hold a reference on the pi state. */
2061 /* If the above failed, then pi_state is NULL */
2063 double_unlock_hb(hb1, hb2);
2064 hb_waiters_dec(hb2);
2065 put_futex_key(&key2);
2066 put_futex_key(&key1);
2067 ret = fault_in_user_writeable(uaddr2);
2073 * Two reasons for this:
2074 * - Owner is exiting and we just wait for the
2076 * - The user space value changed.
2078 double_unlock_hb(hb1, hb2);
2079 hb_waiters_dec(hb2);
2080 put_futex_key(&key2);
2081 put_futex_key(&key1);
2089 plist_for_each_entry_safe(this, next, &hb1->chain, list) {
2090 if (task_count - nr_wake >= nr_requeue)
2093 if (!match_futex(&this->key, &key1))
2097 * FUTEX_WAIT_REQEUE_PI and FUTEX_CMP_REQUEUE_PI should always
2098 * be paired with each other and no other futex ops.
2100 * We should never be requeueing a futex_q with a pi_state,
2101 * which is awaiting a futex_unlock_pi().
2103 if ((requeue_pi && !this->rt_waiter) ||
2104 (!requeue_pi && this->rt_waiter) ||
2111 * Wake nr_wake waiters. For requeue_pi, if we acquired the
2112 * lock, we already woke the top_waiter. If not, it will be
2113 * woken by futex_unlock_pi().
2115 if (++task_count <= nr_wake && !requeue_pi) {
2116 mark_wake_futex(&wake_q, this);
2120 /* Ensure we requeue to the expected futex for requeue_pi. */
2121 if (requeue_pi && !match_futex(this->requeue_pi_key, &key2)) {
2127 * Requeue nr_requeue waiters and possibly one more in the case
2128 * of requeue_pi if we couldn't acquire the lock atomically.
2132 * Prepare the waiter to take the rt_mutex. Take a
2133 * refcount on the pi_state and store the pointer in
2134 * the futex_q object of the waiter.
2136 get_pi_state(pi_state);
2137 this->pi_state = pi_state;
2138 ret = rt_mutex_start_proxy_lock(&pi_state->pi_mutex,
2143 * We got the lock. We do neither drop the
2144 * refcount on pi_state nor clear
2145 * this->pi_state because the waiter needs the
2146 * pi_state for cleaning up the user space
2147 * value. It will drop the refcount after
2150 requeue_pi_wake_futex(this, &key2, hb2);
2155 * rt_mutex_start_proxy_lock() detected a
2156 * potential deadlock when we tried to queue
2157 * that waiter. Drop the pi_state reference
2158 * which we took above and remove the pointer
2159 * to the state from the waiters futex_q
2162 this->pi_state = NULL;
2163 put_pi_state(pi_state);
2165 * We stop queueing more waiters and let user
2166 * space deal with the mess.
2171 requeue_futex(this, hb1, hb2, &key2);
2176 * We took an extra initial reference to the pi_state either
2177 * in futex_proxy_trylock_atomic() or in lookup_pi_state(). We
2178 * need to drop it here again.
2180 put_pi_state(pi_state);
2183 double_unlock_hb(hb1, hb2);
2185 hb_waiters_dec(hb2);
2188 * drop_futex_key_refs() must be called outside the spinlocks. During
2189 * the requeue we moved futex_q's from the hash bucket at key1 to the
2190 * one at key2 and updated their key pointer. We no longer need to
2191 * hold the references to key1.
2193 while (--drop_count >= 0)
2194 drop_futex_key_refs(&key1);
2197 put_futex_key(&key2);
2199 put_futex_key(&key1);
2201 return ret ? ret : task_count;
2204 /* The key must be already stored in q->key. */
2205 static inline struct futex_hash_bucket *queue_lock(struct futex_q *q)
2206 __acquires(&hb->lock)
2208 struct futex_hash_bucket *hb;
2210 hb = hash_futex(&q->key);
2213 * Increment the counter before taking the lock so that
2214 * a potential waker won't miss a to-be-slept task that is
2215 * waiting for the spinlock. This is safe as all queue_lock()
2216 * users end up calling queue_me(). Similarly, for housekeeping,
2217 * decrement the counter at queue_unlock() when some error has
2218 * occurred and we don't end up adding the task to the list.
2222 q->lock_ptr = &hb->lock;
2224 spin_lock(&hb->lock); /* implies smp_mb(); (A) */
2229 queue_unlock(struct futex_hash_bucket *hb)
2230 __releases(&hb->lock)
2232 spin_unlock(&hb->lock);
2236 static inline void __queue_me(struct futex_q *q, struct futex_hash_bucket *hb)
2241 * The priority used to register this element is
2242 * - either the real thread-priority for the real-time threads
2243 * (i.e. threads with a priority lower than MAX_RT_PRIO)
2244 * - or MAX_RT_PRIO for non-RT threads.
2245 * Thus, all RT-threads are woken first in priority order, and
2246 * the others are woken last, in FIFO order.
2248 prio = min(current->normal_prio, MAX_RT_PRIO);
2250 plist_node_init(&q->list, prio);
2251 plist_add(&q->list, &hb->chain);
2256 * queue_me() - Enqueue the futex_q on the futex_hash_bucket
2257 * @q: The futex_q to enqueue
2258 * @hb: The destination hash bucket
2260 * The hb->lock must be held by the caller, and is released here. A call to
2261 * queue_me() is typically paired with exactly one call to unqueue_me(). The
2262 * exceptions involve the PI related operations, which may use unqueue_me_pi()
2263 * or nothing if the unqueue is done as part of the wake process and the unqueue
2264 * state is implicit in the state of woken task (see futex_wait_requeue_pi() for
2267 static inline void queue_me(struct futex_q *q, struct futex_hash_bucket *hb)
2268 __releases(&hb->lock)
2271 spin_unlock(&hb->lock);
2275 * unqueue_me() - Remove the futex_q from its futex_hash_bucket
2276 * @q: The futex_q to unqueue
2278 * The q->lock_ptr must not be held by the caller. A call to unqueue_me() must
2279 * be paired with exactly one earlier call to queue_me().
2282 * - 1 - if the futex_q was still queued (and we removed unqueued it);
2283 * - 0 - if the futex_q was already removed by the waking thread
2285 static int unqueue_me(struct futex_q *q)
2287 spinlock_t *lock_ptr;
2290 /* In the common case we don't take the spinlock, which is nice. */
2293 * q->lock_ptr can change between this read and the following spin_lock.
2294 * Use READ_ONCE to forbid the compiler from reloading q->lock_ptr and
2295 * optimizing lock_ptr out of the logic below.
2297 lock_ptr = READ_ONCE(q->lock_ptr);
2298 if (lock_ptr != NULL) {
2299 spin_lock(lock_ptr);
2301 * q->lock_ptr can change between reading it and
2302 * spin_lock(), causing us to take the wrong lock. This
2303 * corrects the race condition.
2305 * Reasoning goes like this: if we have the wrong lock,
2306 * q->lock_ptr must have changed (maybe several times)
2307 * between reading it and the spin_lock(). It can
2308 * change again after the spin_lock() but only if it was
2309 * already changed before the spin_lock(). It cannot,
2310 * however, change back to the original value. Therefore
2311 * we can detect whether we acquired the correct lock.
2313 if (unlikely(lock_ptr != q->lock_ptr)) {
2314 spin_unlock(lock_ptr);
2319 BUG_ON(q->pi_state);
2321 spin_unlock(lock_ptr);
2325 drop_futex_key_refs(&q->key);
2330 * PI futexes can not be requeued and must remove themself from the
2331 * hash bucket. The hash bucket lock (i.e. lock_ptr) is held on entry
2334 static void unqueue_me_pi(struct futex_q *q)
2335 __releases(q->lock_ptr)
2339 BUG_ON(!q->pi_state);
2340 put_pi_state(q->pi_state);
2343 spin_unlock(q->lock_ptr);
2346 static int fixup_pi_state_owner(u32 __user *uaddr, struct futex_q *q,
2347 struct task_struct *argowner)
2349 struct futex_pi_state *pi_state = q->pi_state;
2350 u32 uval, uninitialized_var(curval), newval;
2351 struct task_struct *oldowner, *newowner;
2355 lockdep_assert_held(q->lock_ptr);
2357 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
2359 oldowner = pi_state->owner;
2362 * We are here because either:
2364 * - we stole the lock and pi_state->owner needs updating to reflect
2365 * that (@argowner == current),
2369 * - someone stole our lock and we need to fix things to point to the
2370 * new owner (@argowner == NULL).
2372 * Either way, we have to replace the TID in the user space variable.
2373 * This must be atomic as we have to preserve the owner died bit here.
2375 * Note: We write the user space value _before_ changing the pi_state
2376 * because we can fault here. Imagine swapped out pages or a fork
2377 * that marked all the anonymous memory readonly for cow.
2379 * Modifying pi_state _before_ the user space value would leave the
2380 * pi_state in an inconsistent state when we fault here, because we
2381 * need to drop the locks to handle the fault. This might be observed
2382 * in the PID check in lookup_pi_state.
2386 if (oldowner != current) {
2388 * We raced against a concurrent self; things are
2389 * already fixed up. Nothing to do.
2395 if (__rt_mutex_futex_trylock(&pi_state->pi_mutex)) {
2396 /* We got the lock after all, nothing to fix. */
2402 * Since we just failed the trylock; there must be an owner.
2404 newowner = rt_mutex_owner(&pi_state->pi_mutex);
2407 WARN_ON_ONCE(argowner != current);
2408 if (oldowner == current) {
2410 * We raced against a concurrent self; things are
2411 * already fixed up. Nothing to do.
2416 newowner = argowner;
2419 newtid = task_pid_vnr(newowner) | FUTEX_WAITERS;
2421 if (!pi_state->owner)
2422 newtid |= FUTEX_OWNER_DIED;
2424 if (get_futex_value_locked(&uval, uaddr))
2428 newval = (uval & FUTEX_OWNER_DIED) | newtid;
2430 if (cmpxchg_futex_value_locked(&curval, uaddr, uval, newval))
2438 * We fixed up user space. Now we need to fix the pi_state
2441 if (pi_state->owner != NULL) {
2442 raw_spin_lock(&pi_state->owner->pi_lock);
2443 WARN_ON(list_empty(&pi_state->list));
2444 list_del_init(&pi_state->list);
2445 raw_spin_unlock(&pi_state->owner->pi_lock);
2448 pi_state->owner = newowner;
2450 raw_spin_lock(&newowner->pi_lock);
2451 WARN_ON(!list_empty(&pi_state->list));
2452 list_add(&pi_state->list, &newowner->pi_state_list);
2453 raw_spin_unlock(&newowner->pi_lock);
2454 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
2459 * To handle the page fault we need to drop the locks here. That gives
2460 * the other task (either the highest priority waiter itself or the
2461 * task which stole the rtmutex) the chance to try the fixup of the
2462 * pi_state. So once we are back from handling the fault we need to
2463 * check the pi_state after reacquiring the locks and before trying to
2464 * do another fixup. When the fixup has been done already we simply
2467 * Note: we hold both hb->lock and pi_mutex->wait_lock. We can safely
2468 * drop hb->lock since the caller owns the hb -> futex_q relation.
2469 * Dropping the pi_mutex->wait_lock requires the state revalidate.
2472 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
2473 spin_unlock(q->lock_ptr);
2475 ret = fault_in_user_writeable(uaddr);
2477 spin_lock(q->lock_ptr);
2478 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
2481 * Check if someone else fixed it for us:
2483 if (pi_state->owner != oldowner) {
2494 raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
2498 static long futex_wait_restart(struct restart_block *restart);
2501 * fixup_owner() - Post lock pi_state and corner case management
2502 * @uaddr: user address of the futex
2503 * @q: futex_q (contains pi_state and access to the rt_mutex)
2504 * @locked: if the attempt to take the rt_mutex succeeded (1) or not (0)
2506 * After attempting to lock an rt_mutex, this function is called to cleanup
2507 * the pi_state owner as well as handle race conditions that may allow us to
2508 * acquire the lock. Must be called with the hb lock held.
2511 * - 1 - success, lock taken;
2512 * - 0 - success, lock not taken;
2513 * - <0 - on error (-EFAULT)
2515 static int fixup_owner(u32 __user *uaddr, struct futex_q *q, int locked)
2521 * Got the lock. We might not be the anticipated owner if we
2522 * did a lock-steal - fix up the PI-state in that case:
2524 * Speculative pi_state->owner read (we don't hold wait_lock);
2525 * since we own the lock pi_state->owner == current is the
2526 * stable state, anything else needs more attention.
2528 if (q->pi_state->owner != current)
2529 ret = fixup_pi_state_owner(uaddr, q, current);
2534 * If we didn't get the lock; check if anybody stole it from us. In
2535 * that case, we need to fix up the uval to point to them instead of
2536 * us, otherwise bad things happen. [10]
2538 * Another speculative read; pi_state->owner == current is unstable
2539 * but needs our attention.
2541 if (q->pi_state->owner == current) {
2542 ret = fixup_pi_state_owner(uaddr, q, NULL);
2547 * Paranoia check. If we did not take the lock, then we should not be
2548 * the owner of the rt_mutex.
2550 if (rt_mutex_owner(&q->pi_state->pi_mutex) == current) {
2551 printk(KERN_ERR "fixup_owner: ret = %d pi-mutex: %p "
2552 "pi-state %p\n", ret,
2553 q->pi_state->pi_mutex.owner,
2554 q->pi_state->owner);
2558 return ret ? ret : locked;
2562 * futex_wait_queue_me() - queue_me() and wait for wakeup, timeout, or signal
2563 * @hb: the futex hash bucket, must be locked by the caller
2564 * @q: the futex_q to queue up on
2565 * @timeout: the prepared hrtimer_sleeper, or null for no timeout
2567 static void futex_wait_queue_me(struct futex_hash_bucket *hb, struct futex_q *q,
2568 struct hrtimer_sleeper *timeout)
2571 * The task state is guaranteed to be set before another task can
2572 * wake it. set_current_state() is implemented using smp_store_mb() and
2573 * queue_me() calls spin_unlock() upon completion, both serializing
2574 * access to the hash list and forcing another memory barrier.
2576 set_current_state(TASK_INTERRUPTIBLE);
2581 hrtimer_start_expires(&timeout->timer, HRTIMER_MODE_ABS);
2584 * If we have been removed from the hash list, then another task
2585 * has tried to wake us, and we can skip the call to schedule().
2587 if (likely(!plist_node_empty(&q->list))) {
2589 * If the timer has already expired, current will already be
2590 * flagged for rescheduling. Only call schedule if there
2591 * is no timeout, or if it has yet to expire.
2593 if (!timeout || timeout->task)
2594 freezable_schedule();
2596 __set_current_state(TASK_RUNNING);
2600 * futex_wait_setup() - Prepare to wait on a futex
2601 * @uaddr: the futex userspace address
2602 * @val: the expected value
2603 * @flags: futex flags (FLAGS_SHARED, etc.)
2604 * @q: the associated futex_q
2605 * @hb: storage for hash_bucket pointer to be returned to caller
2607 * Setup the futex_q and locate the hash_bucket. Get the futex value and
2608 * compare it with the expected value. Handle atomic faults internally.
2609 * Return with the hb lock held and a q.key reference on success, and unlocked
2610 * with no q.key reference on failure.
2613 * - 0 - uaddr contains val and hb has been locked;
2614 * - <1 - -EFAULT or -EWOULDBLOCK (uaddr does not contain val) and hb is unlocked
2616 static int futex_wait_setup(u32 __user *uaddr, u32 val, unsigned int flags,
2617 struct futex_q *q, struct futex_hash_bucket **hb)
2623 * Access the page AFTER the hash-bucket is locked.
2624 * Order is important:
2626 * Userspace waiter: val = var; if (cond(val)) futex_wait(&var, val);
2627 * Userspace waker: if (cond(var)) { var = new; futex_wake(&var); }
2629 * The basic logical guarantee of a futex is that it blocks ONLY
2630 * if cond(var) is known to be true at the time of blocking, for
2631 * any cond. If we locked the hash-bucket after testing *uaddr, that
2632 * would open a race condition where we could block indefinitely with
2633 * cond(var) false, which would violate the guarantee.
2635 * On the other hand, we insert q and release the hash-bucket only
2636 * after testing *uaddr. This guarantees that futex_wait() will NOT
2637 * absorb a wakeup if *uaddr does not match the desired values
2638 * while the syscall executes.
2641 ret = get_futex_key(uaddr, flags & FLAGS_SHARED, &q->key, FUTEX_READ);
2642 if (unlikely(ret != 0))
2646 *hb = queue_lock(q);
2648 ret = get_futex_value_locked(&uval, uaddr);
2653 ret = get_user(uval, uaddr);
2657 if (!(flags & FLAGS_SHARED))
2660 put_futex_key(&q->key);
2671 put_futex_key(&q->key);
2675 static int futex_wait(u32 __user *uaddr, unsigned int flags, u32 val,
2676 ktime_t *abs_time, u32 bitset)
2678 struct hrtimer_sleeper timeout, *to = NULL;
2679 struct restart_block *restart;
2680 struct futex_hash_bucket *hb;
2681 struct futex_q q = futex_q_init;
2691 hrtimer_init_on_stack(&to->timer, (flags & FLAGS_CLOCKRT) ?
2692 CLOCK_REALTIME : CLOCK_MONOTONIC,
2694 hrtimer_init_sleeper(to, current);
2695 hrtimer_set_expires_range_ns(&to->timer, *abs_time,
2696 current->timer_slack_ns);
2701 * Prepare to wait on uaddr. On success, holds hb lock and increments
2704 ret = futex_wait_setup(uaddr, val, flags, &q, &hb);
2708 /* queue_me and wait for wakeup, timeout, or a signal. */
2709 futex_wait_queue_me(hb, &q, to);
2711 /* If we were woken (and unqueued), we succeeded, whatever. */
2713 /* unqueue_me() drops q.key ref */
2714 if (!unqueue_me(&q))
2717 if (to && !to->task)
2721 * We expect signal_pending(current), but we might be the
2722 * victim of a spurious wakeup as well.
2724 if (!signal_pending(current))
2731 restart = ¤t->restart_block;
2732 restart->fn = futex_wait_restart;
2733 restart->futex.uaddr = uaddr;
2734 restart->futex.val = val;
2735 restart->futex.time = *abs_time;
2736 restart->futex.bitset = bitset;
2737 restart->futex.flags = flags | FLAGS_HAS_TIMEOUT;
2739 ret = -ERESTART_RESTARTBLOCK;
2743 hrtimer_cancel(&to->timer);
2744 destroy_hrtimer_on_stack(&to->timer);
2750 static long futex_wait_restart(struct restart_block *restart)
2752 u32 __user *uaddr = restart->futex.uaddr;
2753 ktime_t t, *tp = NULL;
2755 if (restart->futex.flags & FLAGS_HAS_TIMEOUT) {
2756 t = restart->futex.time;
2759 restart->fn = do_no_restart_syscall;
2761 return (long)futex_wait(uaddr, restart->futex.flags,
2762 restart->futex.val, tp, restart->futex.bitset);
2767 * Userspace tried a 0 -> TID atomic transition of the futex value
2768 * and failed. The kernel side here does the whole locking operation:
2769 * if there are waiters then it will block as a consequence of relying
2770 * on rt-mutexes, it does PI, etc. (Due to races the kernel might see
2771 * a 0 value of the futex too.).
2773 * Also serves as futex trylock_pi()'ing, and due semantics.
2775 static int futex_lock_pi(u32 __user *uaddr, unsigned int flags,
2776 ktime_t *time, int trylock)
2778 struct hrtimer_sleeper timeout, *to = NULL;
2779 struct futex_pi_state *pi_state = NULL;
2780 struct rt_mutex_waiter rt_waiter;
2781 struct futex_hash_bucket *hb;
2782 struct futex_q q = futex_q_init;
2785 if (!IS_ENABLED(CONFIG_FUTEX_PI))
2788 if (refill_pi_state_cache())
2793 hrtimer_init_on_stack(&to->timer, CLOCK_REALTIME,
2795 hrtimer_init_sleeper(to, current);
2796 hrtimer_set_expires(&to->timer, *time);
2800 ret = get_futex_key(uaddr, flags & FLAGS_SHARED, &q.key, FUTEX_WRITE);
2801 if (unlikely(ret != 0))
2805 hb = queue_lock(&q);
2807 ret = futex_lock_pi_atomic(uaddr, hb, &q.key, &q.pi_state, current, 0);
2808 if (unlikely(ret)) {
2810 * Atomic work succeeded and we got the lock,
2811 * or failed. Either way, we do _not_ block.
2815 /* We got the lock. */
2817 goto out_unlock_put_key;
2822 * Two reasons for this:
2823 * - Task is exiting and we just wait for the
2825 * - The user space value changed.
2828 put_futex_key(&q.key);
2832 goto out_unlock_put_key;
2836 WARN_ON(!q.pi_state);
2839 * Only actually queue now that the atomic ops are done:
2844 ret = rt_mutex_futex_trylock(&q.pi_state->pi_mutex);
2845 /* Fixup the trylock return value: */
2846 ret = ret ? 0 : -EWOULDBLOCK;
2850 rt_mutex_init_waiter(&rt_waiter);
2853 * On PREEMPT_RT_FULL, when hb->lock becomes an rt_mutex, we must not
2854 * hold it while doing rt_mutex_start_proxy(), because then it will
2855 * include hb->lock in the blocking chain, even through we'll not in
2856 * fact hold it while blocking. This will lead it to report -EDEADLK
2857 * and BUG when futex_unlock_pi() interleaves with this.
2859 * Therefore acquire wait_lock while holding hb->lock, but drop the
2860 * latter before calling rt_mutex_start_proxy_lock(). This still fully
2861 * serializes against futex_unlock_pi() as that does the exact same
2862 * lock handoff sequence.
2864 raw_spin_lock_irq(&q.pi_state->pi_mutex.wait_lock);
2865 spin_unlock(q.lock_ptr);
2866 ret = __rt_mutex_start_proxy_lock(&q.pi_state->pi_mutex, &rt_waiter, current);
2867 raw_spin_unlock_irq(&q.pi_state->pi_mutex.wait_lock);
2873 spin_lock(q.lock_ptr);
2879 hrtimer_start_expires(&to->timer, HRTIMER_MODE_ABS);
2881 ret = rt_mutex_wait_proxy_lock(&q.pi_state->pi_mutex, to, &rt_waiter);
2883 spin_lock(q.lock_ptr);
2885 * If we failed to acquire the lock (signal/timeout), we must
2886 * first acquire the hb->lock before removing the lock from the
2887 * rt_mutex waitqueue, such that we can keep the hb and rt_mutex
2888 * wait lists consistent.
2890 * In particular; it is important that futex_unlock_pi() can not
2891 * observe this inconsistency.
2893 if (ret && !rt_mutex_cleanup_proxy_lock(&q.pi_state->pi_mutex, &rt_waiter))
2898 * Fixup the pi_state owner and possibly acquire the lock if we
2901 res = fixup_owner(uaddr, &q, !ret);
2903 * If fixup_owner() returned an error, proprogate that. If it acquired
2904 * the lock, clear our -ETIMEDOUT or -EINTR.
2907 ret = (res < 0) ? res : 0;
2910 * If fixup_owner() faulted and was unable to handle the fault, unlock
2911 * it and return the fault to userspace.
2913 if (ret && (rt_mutex_owner(&q.pi_state->pi_mutex) == current)) {
2914 pi_state = q.pi_state;
2915 get_pi_state(pi_state);
2918 /* Unqueue and drop the lock */
2922 rt_mutex_futex_unlock(&pi_state->pi_mutex);
2923 put_pi_state(pi_state);
2932 put_futex_key(&q.key);
2935 hrtimer_cancel(&to->timer);
2936 destroy_hrtimer_on_stack(&to->timer);
2938 return ret != -EINTR ? ret : -ERESTARTNOINTR;
2943 ret = fault_in_user_writeable(uaddr);
2947 if (!(flags & FLAGS_SHARED))
2950 put_futex_key(&q.key);
2955 * Userspace attempted a TID -> 0 atomic transition, and failed.
2956 * This is the in-kernel slowpath: we look up the PI state (if any),
2957 * and do the rt-mutex unlock.
2959 static int futex_unlock_pi(u32 __user *uaddr, unsigned int flags)
2961 u32 uninitialized_var(curval), uval, vpid = task_pid_vnr(current);
2962 union futex_key key = FUTEX_KEY_INIT;
2963 struct futex_hash_bucket *hb;
2964 struct futex_q *top_waiter;
2967 if (!IS_ENABLED(CONFIG_FUTEX_PI))
2971 if (get_user(uval, uaddr))
2974 * We release only a lock we actually own:
2976 if ((uval & FUTEX_TID_MASK) != vpid)
2979 ret = get_futex_key(uaddr, flags & FLAGS_SHARED, &key, FUTEX_WRITE);
2983 hb = hash_futex(&key);
2984 spin_lock(&hb->lock);
2987 * Check waiters first. We do not trust user space values at
2988 * all and we at least want to know if user space fiddled
2989 * with the futex value instead of blindly unlocking.
2991 top_waiter = futex_top_waiter(hb, &key);
2993 struct futex_pi_state *pi_state = top_waiter->pi_state;
3000 * If current does not own the pi_state then the futex is
3001 * inconsistent and user space fiddled with the futex value.
3003 if (pi_state->owner != current)
3006 get_pi_state(pi_state);
3008 * By taking wait_lock while still holding hb->lock, we ensure
3009 * there is no point where we hold neither; and therefore
3010 * wake_futex_pi() must observe a state consistent with what we
3013 raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
3014 spin_unlock(&hb->lock);
3016 /* drops pi_state->pi_mutex.wait_lock */
3017 ret = wake_futex_pi(uaddr, uval, pi_state);
3019 put_pi_state(pi_state);
3022 * Success, we're done! No tricky corner cases.
3027 * The atomic access to the futex value generated a
3028 * pagefault, so retry the user-access and the wakeup:
3033 * A unconditional UNLOCK_PI op raced against a waiter
3034 * setting the FUTEX_WAITERS bit. Try again.
3036 if (ret == -EAGAIN) {
3037 put_futex_key(&key);
3041 * wake_futex_pi has detected invalid state. Tell user
3048 * We have no kernel internal state, i.e. no waiters in the
3049 * kernel. Waiters which are about to queue themselves are stuck
3050 * on hb->lock. So we can safely ignore them. We do neither
3051 * preserve the WAITERS bit not the OWNER_DIED one. We are the
3054 if (cmpxchg_futex_value_locked(&curval, uaddr, uval, 0)) {
3055 spin_unlock(&hb->lock);
3060 * If uval has changed, let user space handle it.
3062 ret = (curval == uval) ? 0 : -EAGAIN;
3065 spin_unlock(&hb->lock);
3067 put_futex_key(&key);
3071 put_futex_key(&key);
3073 ret = fault_in_user_writeable(uaddr);
3081 * handle_early_requeue_pi_wakeup() - Detect early wakeup on the initial futex
3082 * @hb: the hash_bucket futex_q was original enqueued on
3083 * @q: the futex_q woken while waiting to be requeued
3084 * @key2: the futex_key of the requeue target futex
3085 * @timeout: the timeout associated with the wait (NULL if none)
3087 * Detect if the task was woken on the initial futex as opposed to the requeue
3088 * target futex. If so, determine if it was a timeout or a signal that caused
3089 * the wakeup and return the appropriate error code to the caller. Must be
3090 * called with the hb lock held.
3093 * - 0 = no early wakeup detected;
3094 * - <0 = -ETIMEDOUT or -ERESTARTNOINTR
3097 int handle_early_requeue_pi_wakeup(struct futex_hash_bucket *hb,
3098 struct futex_q *q, union futex_key *key2,
3099 struct hrtimer_sleeper *timeout)
3104 * With the hb lock held, we avoid races while we process the wakeup.
3105 * We only need to hold hb (and not hb2) to ensure atomicity as the
3106 * wakeup code can't change q.key from uaddr to uaddr2 if we hold hb.
3107 * It can't be requeued from uaddr2 to something else since we don't
3108 * support a PI aware source futex for requeue.
3110 if (!match_futex(&q->key, key2)) {
3111 WARN_ON(q->lock_ptr && (&hb->lock != q->lock_ptr));
3113 * We were woken prior to requeue by a timeout or a signal.
3114 * Unqueue the futex_q and determine which it was.
3116 plist_del(&q->list, &hb->chain);
3119 /* Handle spurious wakeups gracefully */
3121 if (timeout && !timeout->task)
3123 else if (signal_pending(current))
3124 ret = -ERESTARTNOINTR;
3130 * futex_wait_requeue_pi() - Wait on uaddr and take uaddr2
3131 * @uaddr: the futex we initially wait on (non-pi)
3132 * @flags: futex flags (FLAGS_SHARED, FLAGS_CLOCKRT, etc.), they must be
3133 * the same type, no requeueing from private to shared, etc.
3134 * @val: the expected value of uaddr
3135 * @abs_time: absolute timeout
3136 * @bitset: 32 bit wakeup bitset set by userspace, defaults to all
3137 * @uaddr2: the pi futex we will take prior to returning to user-space
3139 * The caller will wait on uaddr and will be requeued by futex_requeue() to
3140 * uaddr2 which must be PI aware and unique from uaddr. Normal wakeup will wake
3141 * on uaddr2 and complete the acquisition of the rt_mutex prior to returning to
3142 * userspace. This ensures the rt_mutex maintains an owner when it has waiters;
3143 * without one, the pi logic would not know which task to boost/deboost, if
3144 * there was a need to.
3146 * We call schedule in futex_wait_queue_me() when we enqueue and return there
3147 * via the following--
3148 * 1) wakeup on uaddr2 after an atomic lock acquisition by futex_requeue()
3149 * 2) wakeup on uaddr2 after a requeue
3153 * If 3, cleanup and return -ERESTARTNOINTR.
3155 * If 2, we may then block on trying to take the rt_mutex and return via:
3156 * 5) successful lock
3159 * 8) other lock acquisition failure
3161 * If 6, return -EWOULDBLOCK (restarting the syscall would do the same).
3163 * If 4 or 7, we cleanup and return with -ETIMEDOUT.
3169 static int futex_wait_requeue_pi(u32 __user *uaddr, unsigned int flags,
3170 u32 val, ktime_t *abs_time, u32 bitset,
3173 struct hrtimer_sleeper timeout, *to = NULL;
3174 struct futex_pi_state *pi_state = NULL;
3175 struct rt_mutex_waiter rt_waiter;
3176 struct futex_hash_bucket *hb;
3177 union futex_key key2 = FUTEX_KEY_INIT;
3178 struct futex_q q = futex_q_init;
3181 if (!IS_ENABLED(CONFIG_FUTEX_PI))
3184 if (uaddr == uaddr2)
3192 hrtimer_init_on_stack(&to->timer, (flags & FLAGS_CLOCKRT) ?
3193 CLOCK_REALTIME : CLOCK_MONOTONIC,
3195 hrtimer_init_sleeper(to, current);
3196 hrtimer_set_expires_range_ns(&to->timer, *abs_time,
3197 current->timer_slack_ns);
3201 * The waiter is allocated on our stack, manipulated by the requeue
3202 * code while we sleep on uaddr.
3204 rt_mutex_init_waiter(&rt_waiter);
3206 ret = get_futex_key(uaddr2, flags & FLAGS_SHARED, &key2, FUTEX_WRITE);
3207 if (unlikely(ret != 0))
3211 q.rt_waiter = &rt_waiter;
3212 q.requeue_pi_key = &key2;
3215 * Prepare to wait on uaddr. On success, increments q.key (key1) ref
3218 ret = futex_wait_setup(uaddr, val, flags, &q, &hb);
3223 * The check above which compares uaddrs is not sufficient for
3224 * shared futexes. We need to compare the keys:
3226 if (match_futex(&q.key, &key2)) {
3232 /* Queue the futex_q, drop the hb lock, wait for wakeup. */
3233 futex_wait_queue_me(hb, &q, to);
3235 spin_lock(&hb->lock);
3236 ret = handle_early_requeue_pi_wakeup(hb, &q, &key2, to);
3237 spin_unlock(&hb->lock);
3242 * In order for us to be here, we know our q.key == key2, and since
3243 * we took the hb->lock above, we also know that futex_requeue() has
3244 * completed and we no longer have to concern ourselves with a wakeup
3245 * race with the atomic proxy lock acquisition by the requeue code. The
3246 * futex_requeue dropped our key1 reference and incremented our key2
3250 /* Check if the requeue code acquired the second futex for us. */
3253 * Got the lock. We might not be the anticipated owner if we
3254 * did a lock-steal - fix up the PI-state in that case.
3256 if (q.pi_state && (q.pi_state->owner != current)) {
3257 spin_lock(q.lock_ptr);
3258 ret = fixup_pi_state_owner(uaddr2, &q, current);
3259 if (ret && rt_mutex_owner(&q.pi_state->pi_mutex) == current) {
3260 pi_state = q.pi_state;
3261 get_pi_state(pi_state);
3264 * Drop the reference to the pi state which
3265 * the requeue_pi() code acquired for us.
3267 put_pi_state(q.pi_state);
3268 spin_unlock(q.lock_ptr);
3271 struct rt_mutex *pi_mutex;
3274 * We have been woken up by futex_unlock_pi(), a timeout, or a
3275 * signal. futex_unlock_pi() will not destroy the lock_ptr nor
3278 WARN_ON(!q.pi_state);
3279 pi_mutex = &q.pi_state->pi_mutex;
3280 ret = rt_mutex_wait_proxy_lock(pi_mutex, to, &rt_waiter);
3282 spin_lock(q.lock_ptr);
3283 if (ret && !rt_mutex_cleanup_proxy_lock(pi_mutex, &rt_waiter))
3286 debug_rt_mutex_free_waiter(&rt_waiter);
3288 * Fixup the pi_state owner and possibly acquire the lock if we
3291 res = fixup_owner(uaddr2, &q, !ret);
3293 * If fixup_owner() returned an error, proprogate that. If it
3294 * acquired the lock, clear -ETIMEDOUT or -EINTR.
3297 ret = (res < 0) ? res : 0;
3300 * If fixup_pi_state_owner() faulted and was unable to handle
3301 * the fault, unlock the rt_mutex and return the fault to
3304 if (ret && rt_mutex_owner(&q.pi_state->pi_mutex) == current) {
3305 pi_state = q.pi_state;
3306 get_pi_state(pi_state);
3309 /* Unqueue and drop the lock. */
3314 rt_mutex_futex_unlock(&pi_state->pi_mutex);
3315 put_pi_state(pi_state);
3318 if (ret == -EINTR) {
3320 * We've already been requeued, but cannot restart by calling
3321 * futex_lock_pi() directly. We could restart this syscall, but
3322 * it would detect that the user space "val" changed and return
3323 * -EWOULDBLOCK. Save the overhead of the restart and return
3324 * -EWOULDBLOCK directly.
3330 put_futex_key(&q.key);
3332 put_futex_key(&key2);
3336 hrtimer_cancel(&to->timer);
3337 destroy_hrtimer_on_stack(&to->timer);
3343 * Support for robust futexes: the kernel cleans up held futexes at
3346 * Implementation: user-space maintains a per-thread list of locks it
3347 * is holding. Upon do_exit(), the kernel carefully walks this list,
3348 * and marks all locks that are owned by this thread with the
3349 * FUTEX_OWNER_DIED bit, and wakes up a waiter (if any). The list is
3350 * always manipulated with the lock held, so the list is private and
3351 * per-thread. Userspace also maintains a per-thread 'list_op_pending'
3352 * field, to allow the kernel to clean up if the thread dies after
3353 * acquiring the lock, but just before it could have added itself to
3354 * the list. There can only be one such pending lock.
3358 * sys_set_robust_list() - Set the robust-futex list head of a task
3359 * @head: pointer to the list-head
3360 * @len: length of the list-head, as userspace expects
3362 SYSCALL_DEFINE2(set_robust_list, struct robust_list_head __user *, head,
3365 if (!futex_cmpxchg_enabled)
3368 * The kernel knows only one size for now:
3370 if (unlikely(len != sizeof(*head)))
3373 current->robust_list = head;
3379 * sys_get_robust_list() - Get the robust-futex list head of a task
3380 * @pid: pid of the process [zero for current task]
3381 * @head_ptr: pointer to a list-head pointer, the kernel fills it in
3382 * @len_ptr: pointer to a length field, the kernel fills in the header size
3384 SYSCALL_DEFINE3(get_robust_list, int, pid,
3385 struct robust_list_head __user * __user *, head_ptr,
3386 size_t __user *, len_ptr)
3388 struct robust_list_head __user *head;
3390 struct task_struct *p;
3392 if (!futex_cmpxchg_enabled)
3401 p = find_task_by_vpid(pid);
3407 if (!ptrace_may_access(p, PTRACE_MODE_READ_REALCREDS))
3410 head = p->robust_list;
3413 if (put_user(sizeof(*head), len_ptr))
3415 return put_user(head, head_ptr);
3424 * Process a futex-list entry, check whether it's owned by the
3425 * dying task, and do notification if so:
3427 static int handle_futex_death(u32 __user *uaddr, struct task_struct *curr, int pi)
3429 u32 uval, uninitialized_var(nval), mval;
3432 if (get_user(uval, uaddr))
3435 if ((uval & FUTEX_TID_MASK) == task_pid_vnr(curr)) {
3437 * Ok, this dying thread is truly holding a futex
3438 * of interest. Set the OWNER_DIED bit atomically
3439 * via cmpxchg, and if the value had FUTEX_WAITERS
3440 * set, wake up a waiter (if any). (We have to do a
3441 * futex_wake() even if OWNER_DIED is already set -
3442 * to handle the rare but possible case of recursive
3443 * thread-death.) The rest of the cleanup is done in
3446 mval = (uval & FUTEX_WAITERS) | FUTEX_OWNER_DIED;
3448 * We are not holding a lock here, but we want to have
3449 * the pagefault_disable/enable() protection because
3450 * we want to handle the fault gracefully. If the
3451 * access fails we try to fault in the futex with R/W
3452 * verification via get_user_pages. get_user() above
3453 * does not guarantee R/W access. If that fails we
3454 * give up and leave the futex locked.
3456 if (cmpxchg_futex_value_locked(&nval, uaddr, uval, mval)) {
3457 if (fault_in_user_writeable(uaddr))
3465 * Wake robust non-PI futexes here. The wakeup of
3466 * PI futexes happens in exit_pi_state():
3468 if (!pi && (uval & FUTEX_WAITERS))
3469 futex_wake(uaddr, 1, 1, FUTEX_BITSET_MATCH_ANY);
3475 * Fetch a robust-list pointer. Bit 0 signals PI futexes:
3477 static inline int fetch_robust_entry(struct robust_list __user **entry,
3478 struct robust_list __user * __user *head,
3481 unsigned long uentry;
3483 if (get_user(uentry, (unsigned long __user *)head))
3486 *entry = (void __user *)(uentry & ~1UL);
3493 * Walk curr->robust_list (very carefully, it's a userspace list!)
3494 * and mark any locks found there dead, and notify any waiters.
3496 * We silently return on any sign of list-walking problem.
3498 void exit_robust_list(struct task_struct *curr)
3500 struct robust_list_head __user *head = curr->robust_list;
3501 struct robust_list __user *entry, *next_entry, *pending;
3502 unsigned int limit = ROBUST_LIST_LIMIT, pi, pip;
3503 unsigned int uninitialized_var(next_pi);
3504 unsigned long futex_offset;
3507 if (!futex_cmpxchg_enabled)
3511 * Fetch the list head (which was registered earlier, via
3512 * sys_set_robust_list()):
3514 if (fetch_robust_entry(&entry, &head->list.next, &pi))
3517 * Fetch the relative futex offset:
3519 if (get_user(futex_offset, &head->futex_offset))
3522 * Fetch any possibly pending lock-add first, and handle it
3525 if (fetch_robust_entry(&pending, &head->list_op_pending, &pip))
3528 next_entry = NULL; /* avoid warning with gcc */
3529 while (entry != &head->list) {
3531 * Fetch the next entry in the list before calling
3532 * handle_futex_death:
3534 rc = fetch_robust_entry(&next_entry, &entry->next, &next_pi);
3536 * A pending lock might already be on the list, so
3537 * don't process it twice:
3539 if (entry != pending)
3540 if (handle_futex_death((void __user *)entry + futex_offset,
3548 * Avoid excessively long or circular lists:
3557 handle_futex_death((void __user *)pending + futex_offset,
3561 long do_futex(u32 __user *uaddr, int op, u32 val, ktime_t *timeout,
3562 u32 __user *uaddr2, u32 val2, u32 val3)
3564 int cmd = op & FUTEX_CMD_MASK;
3565 unsigned int flags = 0;
3567 if (!(op & FUTEX_PRIVATE_FLAG))
3568 flags |= FLAGS_SHARED;
3570 if (op & FUTEX_CLOCK_REALTIME) {
3571 flags |= FLAGS_CLOCKRT;
3572 if (cmd != FUTEX_WAIT && cmd != FUTEX_WAIT_BITSET && \
3573 cmd != FUTEX_WAIT_REQUEUE_PI)
3579 case FUTEX_UNLOCK_PI:
3580 case FUTEX_TRYLOCK_PI:
3581 case FUTEX_WAIT_REQUEUE_PI:
3582 case FUTEX_CMP_REQUEUE_PI:
3583 if (!futex_cmpxchg_enabled)
3589 val3 = FUTEX_BITSET_MATCH_ANY;
3591 case FUTEX_WAIT_BITSET:
3592 return futex_wait(uaddr, flags, val, timeout, val3);
3594 val3 = FUTEX_BITSET_MATCH_ANY;
3596 case FUTEX_WAKE_BITSET:
3597 return futex_wake(uaddr, flags, val, val3);
3599 return futex_requeue(uaddr, flags, uaddr2, val, val2, NULL, 0);
3600 case FUTEX_CMP_REQUEUE:
3601 return futex_requeue(uaddr, flags, uaddr2, val, val2, &val3, 0);
3603 return futex_wake_op(uaddr, flags, uaddr2, val, val2, val3);
3605 return futex_lock_pi(uaddr, flags, timeout, 0);
3606 case FUTEX_UNLOCK_PI:
3607 return futex_unlock_pi(uaddr, flags);
3608 case FUTEX_TRYLOCK_PI:
3609 return futex_lock_pi(uaddr, flags, NULL, 1);
3610 case FUTEX_WAIT_REQUEUE_PI:
3611 val3 = FUTEX_BITSET_MATCH_ANY;
3612 return futex_wait_requeue_pi(uaddr, flags, val, timeout, val3,
3614 case FUTEX_CMP_REQUEUE_PI:
3615 return futex_requeue(uaddr, flags, uaddr2, val, val2, &val3, 1);
3621 SYSCALL_DEFINE6(futex, u32 __user *, uaddr, int, op, u32, val,
3622 struct __kernel_timespec __user *, utime, u32 __user *, uaddr2,
3625 struct timespec64 ts;
3626 ktime_t t, *tp = NULL;
3628 int cmd = op & FUTEX_CMD_MASK;
3630 if (utime && (cmd == FUTEX_WAIT || cmd == FUTEX_LOCK_PI ||
3631 cmd == FUTEX_WAIT_BITSET ||
3632 cmd == FUTEX_WAIT_REQUEUE_PI)) {
3633 if (unlikely(should_fail_futex(!(op & FUTEX_PRIVATE_FLAG))))
3635 if (get_timespec64(&ts, utime))
3637 if (!timespec64_valid(&ts))
3640 t = timespec64_to_ktime(ts);
3641 if (cmd == FUTEX_WAIT)
3642 t = ktime_add_safe(ktime_get(), t);
3646 * requeue parameter in 'utime' if cmd == FUTEX_*_REQUEUE_*.
3647 * number of waiters to wake in 'utime' if cmd == FUTEX_WAKE_OP.
3649 if (cmd == FUTEX_REQUEUE || cmd == FUTEX_CMP_REQUEUE ||
3650 cmd == FUTEX_CMP_REQUEUE_PI || cmd == FUTEX_WAKE_OP)
3651 val2 = (u32) (unsigned long) utime;
3653 return do_futex(uaddr, op, val, tp, uaddr2, val2, val3);
3656 #ifdef CONFIG_COMPAT
3658 * Fetch a robust-list pointer. Bit 0 signals PI futexes:
3661 compat_fetch_robust_entry(compat_uptr_t *uentry, struct robust_list __user **entry,
3662 compat_uptr_t __user *head, unsigned int *pi)
3664 if (get_user(*uentry, head))
3667 *entry = compat_ptr((*uentry) & ~1);
3668 *pi = (unsigned int)(*uentry) & 1;
3673 static void __user *futex_uaddr(struct robust_list __user *entry,
3674 compat_long_t futex_offset)
3676 compat_uptr_t base = ptr_to_compat(entry);
3677 void __user *uaddr = compat_ptr(base + futex_offset);
3683 * Walk curr->robust_list (very carefully, it's a userspace list!)
3684 * and mark any locks found there dead, and notify any waiters.
3686 * We silently return on any sign of list-walking problem.
3688 void compat_exit_robust_list(struct task_struct *curr)
3690 struct compat_robust_list_head __user *head = curr->compat_robust_list;
3691 struct robust_list __user *entry, *next_entry, *pending;
3692 unsigned int limit = ROBUST_LIST_LIMIT, pi, pip;
3693 unsigned int uninitialized_var(next_pi);
3694 compat_uptr_t uentry, next_uentry, upending;
3695 compat_long_t futex_offset;
3698 if (!futex_cmpxchg_enabled)
3702 * Fetch the list head (which was registered earlier, via
3703 * sys_set_robust_list()):
3705 if (compat_fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
3708 * Fetch the relative futex offset:
3710 if (get_user(futex_offset, &head->futex_offset))
3713 * Fetch any possibly pending lock-add first, and handle it
3716 if (compat_fetch_robust_entry(&upending, &pending,
3717 &head->list_op_pending, &pip))
3720 next_entry = NULL; /* avoid warning with gcc */
3721 while (entry != (struct robust_list __user *) &head->list) {
3723 * Fetch the next entry in the list before calling
3724 * handle_futex_death:
3726 rc = compat_fetch_robust_entry(&next_uentry, &next_entry,
3727 (compat_uptr_t __user *)&entry->next, &next_pi);
3729 * A pending lock might already be on the list, so
3730 * dont process it twice:
3732 if (entry != pending) {
3733 void __user *uaddr = futex_uaddr(entry, futex_offset);
3735 if (handle_futex_death(uaddr, curr, pi))
3740 uentry = next_uentry;
3744 * Avoid excessively long or circular lists:
3752 void __user *uaddr = futex_uaddr(pending, futex_offset);
3754 handle_futex_death(uaddr, curr, pip);
3758 COMPAT_SYSCALL_DEFINE2(set_robust_list,
3759 struct compat_robust_list_head __user *, head,
3762 if (!futex_cmpxchg_enabled)
3765 if (unlikely(len != sizeof(*head)))
3768 current->compat_robust_list = head;
3773 COMPAT_SYSCALL_DEFINE3(get_robust_list, int, pid,
3774 compat_uptr_t __user *, head_ptr,
3775 compat_size_t __user *, len_ptr)
3777 struct compat_robust_list_head __user *head;
3779 struct task_struct *p;
3781 if (!futex_cmpxchg_enabled)
3790 p = find_task_by_vpid(pid);
3796 if (!ptrace_may_access(p, PTRACE_MODE_READ_REALCREDS))
3799 head = p->compat_robust_list;
3802 if (put_user(sizeof(*head), len_ptr))
3804 return put_user(ptr_to_compat(head), head_ptr);
3811 #endif /* CONFIG_COMPAT */
3813 #ifdef CONFIG_COMPAT_32BIT_TIME
3814 COMPAT_SYSCALL_DEFINE6(futex, u32 __user *, uaddr, int, op, u32, val,
3815 struct old_timespec32 __user *, utime, u32 __user *, uaddr2,
3818 struct timespec64 ts;
3819 ktime_t t, *tp = NULL;
3821 int cmd = op & FUTEX_CMD_MASK;
3823 if (utime && (cmd == FUTEX_WAIT || cmd == FUTEX_LOCK_PI ||
3824 cmd == FUTEX_WAIT_BITSET ||
3825 cmd == FUTEX_WAIT_REQUEUE_PI)) {
3826 if (get_old_timespec32(&ts, utime))
3828 if (!timespec64_valid(&ts))
3831 t = timespec64_to_ktime(ts);
3832 if (cmd == FUTEX_WAIT)
3833 t = ktime_add_safe(ktime_get(), t);
3836 if (cmd == FUTEX_REQUEUE || cmd == FUTEX_CMP_REQUEUE ||
3837 cmd == FUTEX_CMP_REQUEUE_PI || cmd == FUTEX_WAKE_OP)
3838 val2 = (int) (unsigned long) utime;
3840 return do_futex(uaddr, op, val, tp, uaddr2, val2, val3);
3842 #endif /* CONFIG_COMPAT_32BIT_TIME */
3844 static void __init futex_detect_cmpxchg(void)
3846 #ifndef CONFIG_HAVE_FUTEX_CMPXCHG
3850 * This will fail and we want it. Some arch implementations do
3851 * runtime detection of the futex_atomic_cmpxchg_inatomic()
3852 * functionality. We want to know that before we call in any
3853 * of the complex code paths. Also we want to prevent
3854 * registration of robust lists in that case. NULL is
3855 * guaranteed to fault and we get -EFAULT on functional
3856 * implementation, the non-functional ones will return
3859 if (cmpxchg_futex_value_locked(&curval, NULL, 0, 0) == -EFAULT)
3860 futex_cmpxchg_enabled = 1;
3864 static int __init futex_init(void)
3866 unsigned int futex_shift;
3869 #if CONFIG_BASE_SMALL
3870 futex_hashsize = 16;
3872 futex_hashsize = roundup_pow_of_two(256 * num_possible_cpus());
3875 futex_queues = alloc_large_system_hash("futex", sizeof(*futex_queues),
3877 futex_hashsize < 256 ? HASH_SMALL : 0,
3879 futex_hashsize, futex_hashsize);
3880 futex_hashsize = 1UL << futex_shift;
3882 futex_detect_cmpxchg();
3884 for (i = 0; i < futex_hashsize; i++) {
3885 atomic_set(&futex_queues[i].waiters, 0);
3886 plist_head_init(&futex_queues[i].chain);
3887 spin_lock_init(&futex_queues[i].lock);
3892 core_initcall(futex_init);