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/slab.h>
48 #include <linux/poll.h>
50 #include <linux/file.h>
51 #include <linux/jhash.h>
52 #include <linux/init.h>
53 #include <linux/futex.h>
54 #include <linux/mount.h>
55 #include <linux/pagemap.h>
56 #include <linux/syscalls.h>
57 #include <linux/signal.h>
58 #include <linux/export.h>
59 #include <linux/magic.h>
60 #include <linux/pid.h>
61 #include <linux/nsproxy.h>
62 #include <linux/ptrace.h>
63 #include <linux/sched/rt.h>
64 #include <linux/sched/wake_q.h>
65 #include <linux/sched/mm.h>
66 #include <linux/hugetlb.h>
67 #include <linux/freezer.h>
68 #include <linux/bootmem.h>
69 #include <linux/fault-inject.h>
71 #include <asm/futex.h>
73 #include "locking/rtmutex_common.h"
76 * READ this before attempting to hack on futexes!
78 * Basic futex operation and ordering guarantees
79 * =============================================
81 * The waiter reads the futex value in user space and calls
82 * futex_wait(). This function computes the hash bucket and acquires
83 * the hash bucket lock. After that it reads the futex user space value
84 * again and verifies that the data has not changed. If it has not changed
85 * it enqueues itself into the hash bucket, releases the hash bucket lock
88 * The waker side modifies the user space value of the futex and calls
89 * futex_wake(). This function computes the hash bucket and acquires the
90 * hash bucket lock. Then it looks for waiters on that futex in the hash
91 * bucket and wakes them.
93 * In futex wake up scenarios where no tasks are blocked on a futex, taking
94 * the hb spinlock can be avoided and simply return. In order for this
95 * optimization to work, ordering guarantees must exist so that the waiter
96 * being added to the list is acknowledged when the list is concurrently being
97 * checked by the waker, avoiding scenarios like the following:
101 * sys_futex(WAIT, futex, val);
102 * futex_wait(futex, val);
105 * sys_futex(WAKE, futex);
110 * lock(hash_bucket(futex));
112 * unlock(hash_bucket(futex));
115 * This would cause the waiter on CPU 0 to wait forever because it
116 * missed the transition of the user space value from val to newval
117 * and the waker did not find the waiter in the hash bucket queue.
119 * The correct serialization ensures that a waiter either observes
120 * the changed user space value before blocking or is woken by a
125 * sys_futex(WAIT, futex, val);
126 * futex_wait(futex, val);
129 * smp_mb(); (A) <-- paired with -.
131 * lock(hash_bucket(futex)); |
135 * | sys_futex(WAKE, futex);
136 * | futex_wake(futex);
138 * `--------> smp_mb(); (B)
141 * unlock(hash_bucket(futex));
142 * schedule(); if (waiters)
143 * lock(hash_bucket(futex));
144 * else wake_waiters(futex);
145 * waiters--; (b) unlock(hash_bucket(futex));
147 * Where (A) orders the waiters increment and the futex value read through
148 * atomic operations (see hb_waiters_inc) and where (B) orders the write
149 * to futex and the waiters read -- this is done by the barriers for both
150 * shared and private futexes in get_futex_key_refs().
152 * This yields the following case (where X:=waiters, Y:=futex):
160 * Which guarantees that x==0 && y==0 is impossible; which translates back into
161 * the guarantee that we cannot both miss the futex variable change and the
164 * Note that a new waiter is accounted for in (a) even when it is possible that
165 * the wait call can return error, in which case we backtrack from it in (b).
166 * Refer to the comment in queue_lock().
168 * Similarly, in order to account for waiters being requeued on another
169 * address we always increment the waiters for the destination bucket before
170 * acquiring the lock. It then decrements them again after releasing it -
171 * the code that actually moves the futex(es) between hash buckets (requeue_futex)
172 * will do the additional required waiter count housekeeping. This is done for
173 * double_lock_hb() and double_unlock_hb(), respectively.
176 #ifndef CONFIG_HAVE_FUTEX_CMPXCHG
177 int __read_mostly futex_cmpxchg_enabled
;
181 * Futex flags used to encode options to functions and preserve them across
185 # define FLAGS_SHARED 0x01
188 * NOMMU does not have per process address space. Let the compiler optimize
191 # define FLAGS_SHARED 0x00
193 #define FLAGS_CLOCKRT 0x02
194 #define FLAGS_HAS_TIMEOUT 0x04
197 * Priority Inheritance state:
199 struct futex_pi_state
{
201 * list of 'owned' pi_state instances - these have to be
202 * cleaned up in do_exit() if the task exits prematurely:
204 struct list_head list
;
209 struct rt_mutex pi_mutex
;
211 struct task_struct
*owner
;
215 } __randomize_layout
;
218 * struct futex_q - The hashed futex queue entry, one per waiting task
219 * @list: priority-sorted list of tasks waiting on this futex
220 * @task: the task waiting on the futex
221 * @lock_ptr: the hash bucket lock
222 * @key: the key the futex is hashed on
223 * @pi_state: optional priority inheritance state
224 * @rt_waiter: rt_waiter storage for use with requeue_pi
225 * @requeue_pi_key: the requeue_pi target futex key
226 * @bitset: bitset for the optional bitmasked wakeup
228 * We use this hashed waitqueue, instead of a normal wait_queue_entry_t, so
229 * we can wake only the relevant ones (hashed queues may be shared).
231 * A futex_q has a woken state, just like tasks have TASK_RUNNING.
232 * It is considered woken when plist_node_empty(&q->list) || q->lock_ptr == 0.
233 * The order of wakeup is always to make the first condition true, then
236 * PI futexes are typically woken before they are removed from the hash list via
237 * the rt_mutex code. See unqueue_me_pi().
240 struct plist_node list
;
242 struct task_struct
*task
;
243 spinlock_t
*lock_ptr
;
245 struct futex_pi_state
*pi_state
;
246 struct rt_mutex_waiter
*rt_waiter
;
247 union futex_key
*requeue_pi_key
;
249 } __randomize_layout
;
251 static const struct futex_q futex_q_init
= {
252 /* list gets initialized in queue_me()*/
253 .key
= FUTEX_KEY_INIT
,
254 .bitset
= FUTEX_BITSET_MATCH_ANY
258 * Hash buckets are shared by all the futex_keys that hash to the same
259 * location. Each key may have multiple futex_q structures, one for each task
260 * waiting on a futex.
262 struct futex_hash_bucket
{
265 struct plist_head chain
;
266 } ____cacheline_aligned_in_smp
;
269 * The base of the bucket array and its size are always used together
270 * (after initialization only in hash_futex()), so ensure that they
271 * reside in the same cacheline.
274 struct futex_hash_bucket
*queues
;
275 unsigned long hashsize
;
276 } __futex_data __read_mostly
__aligned(2*sizeof(long));
277 #define futex_queues (__futex_data.queues)
278 #define futex_hashsize (__futex_data.hashsize)
282 * Fault injections for futexes.
284 #ifdef CONFIG_FAIL_FUTEX
287 struct fault_attr attr
;
291 .attr
= FAULT_ATTR_INITIALIZER
,
292 .ignore_private
= false,
295 static int __init
setup_fail_futex(char *str
)
297 return setup_fault_attr(&fail_futex
.attr
, str
);
299 __setup("fail_futex=", setup_fail_futex
);
301 static bool should_fail_futex(bool fshared
)
303 if (fail_futex
.ignore_private
&& !fshared
)
306 return should_fail(&fail_futex
.attr
, 1);
309 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
311 static int __init
fail_futex_debugfs(void)
313 umode_t mode
= S_IFREG
| S_IRUSR
| S_IWUSR
;
316 dir
= fault_create_debugfs_attr("fail_futex", NULL
,
321 if (!debugfs_create_bool("ignore-private", mode
, dir
,
322 &fail_futex
.ignore_private
)) {
323 debugfs_remove_recursive(dir
);
330 late_initcall(fail_futex_debugfs
);
332 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
335 static inline bool should_fail_futex(bool fshared
)
339 #endif /* CONFIG_FAIL_FUTEX */
341 static inline void futex_get_mm(union futex_key
*key
)
343 mmgrab(key
->private.mm
);
345 * Ensure futex_get_mm() implies a full barrier such that
346 * get_futex_key() implies a full barrier. This is relied upon
347 * as smp_mb(); (B), see the ordering comment above.
349 smp_mb__after_atomic();
353 * Reflects a new waiter being added to the waitqueue.
355 static inline void hb_waiters_inc(struct futex_hash_bucket
*hb
)
358 atomic_inc(&hb
->waiters
);
360 * Full barrier (A), see the ordering comment above.
362 smp_mb__after_atomic();
367 * Reflects a waiter being removed from the waitqueue by wakeup
370 static inline void hb_waiters_dec(struct futex_hash_bucket
*hb
)
373 atomic_dec(&hb
->waiters
);
377 static inline int hb_waiters_pending(struct futex_hash_bucket
*hb
)
380 return atomic_read(&hb
->waiters
);
387 * hash_futex - Return the hash bucket in the global hash
388 * @key: Pointer to the futex key for which the hash is calculated
390 * We hash on the keys returned from get_futex_key (see below) and return the
391 * corresponding hash bucket in the global hash.
393 static struct futex_hash_bucket
*hash_futex(union futex_key
*key
)
395 u32 hash
= jhash2((u32
*)&key
->both
.word
,
396 (sizeof(key
->both
.word
)+sizeof(key
->both
.ptr
))/4,
398 return &futex_queues
[hash
& (futex_hashsize
- 1)];
403 * match_futex - Check whether two futex keys are equal
404 * @key1: Pointer to key1
405 * @key2: Pointer to key2
407 * Return 1 if two futex_keys are equal, 0 otherwise.
409 static inline int match_futex(union futex_key
*key1
, union futex_key
*key2
)
412 && key1
->both
.word
== key2
->both
.word
413 && key1
->both
.ptr
== key2
->both
.ptr
414 && key1
->both
.offset
== key2
->both
.offset
);
418 * Take a reference to the resource addressed by a key.
419 * Can be called while holding spinlocks.
422 static void get_futex_key_refs(union futex_key
*key
)
428 * On MMU less systems futexes are always "private" as there is no per
429 * process address space. We need the smp wmb nevertheless - yes,
430 * arch/blackfin has MMU less SMP ...
432 if (!IS_ENABLED(CONFIG_MMU
)) {
433 smp_mb(); /* explicit smp_mb(); (B) */
437 switch (key
->both
.offset
& (FUT_OFF_INODE
|FUT_OFF_MMSHARED
)) {
439 ihold(key
->shared
.inode
); /* implies smp_mb(); (B) */
441 case FUT_OFF_MMSHARED
:
442 futex_get_mm(key
); /* implies smp_mb(); (B) */
446 * Private futexes do not hold reference on an inode or
447 * mm, therefore the only purpose of calling get_futex_key_refs
448 * is because we need the barrier for the lockless waiter check.
450 smp_mb(); /* explicit smp_mb(); (B) */
455 * Drop a reference to the resource addressed by a key.
456 * The hash bucket spinlock must not be held. This is
457 * a no-op for private futexes, see comment in the get
460 static void drop_futex_key_refs(union futex_key
*key
)
462 if (!key
->both
.ptr
) {
463 /* If we're here then we tried to put a key we failed to get */
468 if (!IS_ENABLED(CONFIG_MMU
))
471 switch (key
->both
.offset
& (FUT_OFF_INODE
|FUT_OFF_MMSHARED
)) {
473 iput(key
->shared
.inode
);
475 case FUT_OFF_MMSHARED
:
476 mmdrop(key
->private.mm
);
482 * get_futex_key() - Get parameters which are the keys for a futex
483 * @uaddr: virtual address of the futex
484 * @fshared: 0 for a PROCESS_PRIVATE futex, 1 for PROCESS_SHARED
485 * @key: address where result is stored.
486 * @rw: mapping needs to be read/write (values: VERIFY_READ,
489 * Return: a negative error code or 0
491 * The key words are stored in @key on success.
493 * For shared mappings, it's (page->index, file_inode(vma->vm_file),
494 * offset_within_page). For private mappings, it's (uaddr, current->mm).
495 * We can usually work out the index without swapping in the page.
497 * lock_page() might sleep, the caller should not hold a spinlock.
500 get_futex_key(u32 __user
*uaddr
, int fshared
, union futex_key
*key
, int rw
)
502 unsigned long address
= (unsigned long)uaddr
;
503 struct mm_struct
*mm
= current
->mm
;
504 struct page
*page
, *tail
;
505 struct address_space
*mapping
;
509 * The futex address must be "naturally" aligned.
511 key
->both
.offset
= address
% PAGE_SIZE
;
512 if (unlikely((address
% sizeof(u32
)) != 0))
514 address
-= key
->both
.offset
;
516 if (unlikely(!access_ok(rw
, uaddr
, sizeof(u32
))))
519 if (unlikely(should_fail_futex(fshared
)))
523 * PROCESS_PRIVATE futexes are fast.
524 * As the mm cannot disappear under us and the 'key' only needs
525 * virtual address, we dont even have to find the underlying vma.
526 * Note : We do have to check 'uaddr' is a valid user address,
527 * but access_ok() should be faster than find_vma()
530 key
->private.mm
= mm
;
531 key
->private.address
= address
;
532 get_futex_key_refs(key
); /* implies smp_mb(); (B) */
537 /* Ignore any VERIFY_READ mapping (futex common case) */
538 if (unlikely(should_fail_futex(fshared
)))
541 err
= get_user_pages_fast(address
, 1, 1, &page
);
543 * If write access is not required (eg. FUTEX_WAIT), try
544 * and get read-only access.
546 if (err
== -EFAULT
&& rw
== VERIFY_READ
) {
547 err
= get_user_pages_fast(address
, 1, 0, &page
);
556 * The treatment of mapping from this point on is critical. The page
557 * lock protects many things but in this context the page lock
558 * stabilizes mapping, prevents inode freeing in the shared
559 * file-backed region case and guards against movement to swap cache.
561 * Strictly speaking the page lock is not needed in all cases being
562 * considered here and page lock forces unnecessarily serialization
563 * From this point on, mapping will be re-verified if necessary and
564 * page lock will be acquired only if it is unavoidable
566 * Mapping checks require the head page for any compound page so the
567 * head page and mapping is looked up now. For anonymous pages, it
568 * does not matter if the page splits in the future as the key is
569 * based on the address. For filesystem-backed pages, the tail is
570 * required as the index of the page determines the key. For
571 * base pages, there is no tail page and tail == page.
574 page
= compound_head(page
);
575 mapping
= READ_ONCE(page
->mapping
);
578 * If page->mapping is NULL, then it cannot be a PageAnon
579 * page; but it might be the ZERO_PAGE or in the gate area or
580 * in a special mapping (all cases which we are happy to fail);
581 * or it may have been a good file page when get_user_pages_fast
582 * found it, but truncated or holepunched or subjected to
583 * invalidate_complete_page2 before we got the page lock (also
584 * cases which we are happy to fail). And we hold a reference,
585 * so refcount care in invalidate_complete_page's remove_mapping
586 * prevents drop_caches from setting mapping to NULL beneath us.
588 * The case we do have to guard against is when memory pressure made
589 * shmem_writepage move it from filecache to swapcache beneath us:
590 * an unlikely race, but we do need to retry for page->mapping.
592 if (unlikely(!mapping
)) {
596 * Page lock is required to identify which special case above
597 * applies. If this is really a shmem page then the page lock
598 * will prevent unexpected transitions.
601 shmem_swizzled
= PageSwapCache(page
) || page
->mapping
;
612 * Private mappings are handled in a simple way.
614 * If the futex key is stored on an anonymous page, then the associated
615 * object is the mm which is implicitly pinned by the calling process.
617 * NOTE: When userspace waits on a MAP_SHARED mapping, even if
618 * it's a read-only handle, it's expected that futexes attach to
619 * the object not the particular process.
621 if (PageAnon(page
)) {
623 * A RO anonymous page will never change and thus doesn't make
624 * sense for futex operations.
626 if (unlikely(should_fail_futex(fshared
)) || ro
) {
631 key
->both
.offset
|= FUT_OFF_MMSHARED
; /* ref taken on mm */
632 key
->private.mm
= mm
;
633 key
->private.address
= address
;
635 get_futex_key_refs(key
); /* implies smp_mb(); (B) */
641 * The associated futex object in this case is the inode and
642 * the page->mapping must be traversed. Ordinarily this should
643 * be stabilised under page lock but it's not strictly
644 * necessary in this case as we just want to pin the inode, not
645 * update the radix tree or anything like that.
647 * The RCU read lock is taken as the inode is finally freed
648 * under RCU. If the mapping still matches expectations then the
649 * mapping->host can be safely accessed as being a valid inode.
653 if (READ_ONCE(page
->mapping
) != mapping
) {
660 inode
= READ_ONCE(mapping
->host
);
669 * Take a reference unless it is about to be freed. Previously
670 * this reference was taken by ihold under the page lock
671 * pinning the inode in place so i_lock was unnecessary. The
672 * only way for this check to fail is if the inode was
673 * truncated in parallel which is almost certainly an
674 * application bug. In such a case, just retry.
676 * We are not calling into get_futex_key_refs() in file-backed
677 * cases, therefore a successful atomic_inc return below will
678 * guarantee that get_futex_key() will still imply smp_mb(); (B).
680 if (!atomic_inc_not_zero(&inode
->i_count
)) {
687 /* Should be impossible but lets be paranoid for now */
688 if (WARN_ON_ONCE(inode
->i_mapping
!= mapping
)) {
696 key
->both
.offset
|= FUT_OFF_INODE
; /* inode-based key */
697 key
->shared
.inode
= inode
;
698 key
->shared
.pgoff
= basepage_index(tail
);
707 static inline void put_futex_key(union futex_key
*key
)
709 drop_futex_key_refs(key
);
713 * fault_in_user_writeable() - Fault in user address and verify RW access
714 * @uaddr: pointer to faulting user space address
716 * Slow path to fixup the fault we just took in the atomic write
719 * We have no generic implementation of a non-destructive write to the
720 * user address. We know that we faulted in the atomic pagefault
721 * disabled section so we can as well avoid the #PF overhead by
722 * calling get_user_pages() right away.
724 static int fault_in_user_writeable(u32 __user
*uaddr
)
726 struct mm_struct
*mm
= current
->mm
;
729 down_read(&mm
->mmap_sem
);
730 ret
= fixup_user_fault(current
, mm
, (unsigned long)uaddr
,
731 FAULT_FLAG_WRITE
, NULL
);
732 up_read(&mm
->mmap_sem
);
734 return ret
< 0 ? ret
: 0;
738 * futex_top_waiter() - Return the highest priority waiter on a futex
739 * @hb: the hash bucket the futex_q's reside in
740 * @key: the futex key (to distinguish it from other futex futex_q's)
742 * Must be called with the hb lock held.
744 static struct futex_q
*futex_top_waiter(struct futex_hash_bucket
*hb
,
745 union futex_key
*key
)
747 struct futex_q
*this;
749 plist_for_each_entry(this, &hb
->chain
, list
) {
750 if (match_futex(&this->key
, key
))
756 static int cmpxchg_futex_value_locked(u32
*curval
, u32 __user
*uaddr
,
757 u32 uval
, u32 newval
)
762 ret
= futex_atomic_cmpxchg_inatomic(curval
, uaddr
, uval
, newval
);
768 static int get_futex_value_locked(u32
*dest
, u32 __user
*from
)
773 ret
= __get_user(*dest
, from
);
776 return ret
? -EFAULT
: 0;
783 static int refill_pi_state_cache(void)
785 struct futex_pi_state
*pi_state
;
787 if (likely(current
->pi_state_cache
))
790 pi_state
= kzalloc(sizeof(*pi_state
), GFP_KERNEL
);
795 INIT_LIST_HEAD(&pi_state
->list
);
796 /* pi_mutex gets initialized later */
797 pi_state
->owner
= NULL
;
798 atomic_set(&pi_state
->refcount
, 1);
799 pi_state
->key
= FUTEX_KEY_INIT
;
801 current
->pi_state_cache
= pi_state
;
806 static struct futex_pi_state
*alloc_pi_state(void)
808 struct futex_pi_state
*pi_state
= current
->pi_state_cache
;
811 current
->pi_state_cache
= NULL
;
816 static void get_pi_state(struct futex_pi_state
*pi_state
)
818 WARN_ON_ONCE(!atomic_inc_not_zero(&pi_state
->refcount
));
822 * Drops a reference to the pi_state object and frees or caches it
823 * when the last reference is gone.
825 static void put_pi_state(struct futex_pi_state
*pi_state
)
830 if (!atomic_dec_and_test(&pi_state
->refcount
))
834 * If pi_state->owner is NULL, the owner is most probably dying
835 * and has cleaned up the pi_state already
837 if (pi_state
->owner
) {
838 struct task_struct
*owner
;
840 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
841 owner
= pi_state
->owner
;
843 raw_spin_lock(&owner
->pi_lock
);
844 list_del_init(&pi_state
->list
);
845 raw_spin_unlock(&owner
->pi_lock
);
847 rt_mutex_proxy_unlock(&pi_state
->pi_mutex
, owner
);
848 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
851 if (current
->pi_state_cache
) {
855 * pi_state->list is already empty.
856 * clear pi_state->owner.
857 * refcount is at 0 - put it back to 1.
859 pi_state
->owner
= NULL
;
860 atomic_set(&pi_state
->refcount
, 1);
861 current
->pi_state_cache
= pi_state
;
866 * Look up the task based on what TID userspace gave us.
869 static struct task_struct
*futex_find_get_task(pid_t pid
)
871 struct task_struct
*p
;
874 p
= find_task_by_vpid(pid
);
884 * This task is holding PI mutexes at exit time => bad.
885 * Kernel cleans up PI-state, but userspace is likely hosed.
886 * (Robust-futex cleanup is separate and might save the day for userspace.)
888 void exit_pi_state_list(struct task_struct
*curr
)
890 struct list_head
*next
, *head
= &curr
->pi_state_list
;
891 struct futex_pi_state
*pi_state
;
892 struct futex_hash_bucket
*hb
;
893 union futex_key key
= FUTEX_KEY_INIT
;
895 if (!futex_cmpxchg_enabled
)
898 * We are a ZOMBIE and nobody can enqueue itself on
899 * pi_state_list anymore, but we have to be careful
900 * versus waiters unqueueing themselves:
902 raw_spin_lock_irq(&curr
->pi_lock
);
903 while (!list_empty(head
)) {
906 pi_state
= list_entry(next
, struct futex_pi_state
, list
);
908 hb
= hash_futex(&key
);
909 raw_spin_unlock_irq(&curr
->pi_lock
);
911 spin_lock(&hb
->lock
);
912 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
913 raw_spin_lock(&curr
->pi_lock
);
915 * We dropped the pi-lock, so re-check whether this
916 * task still owns the PI-state:
918 if (head
->next
!= next
) {
919 raw_spin_unlock(&pi_state
->pi_mutex
.wait_lock
);
920 spin_unlock(&hb
->lock
);
924 WARN_ON(pi_state
->owner
!= curr
);
925 WARN_ON(list_empty(&pi_state
->list
));
926 list_del_init(&pi_state
->list
);
927 pi_state
->owner
= NULL
;
928 raw_spin_unlock(&curr
->pi_lock
);
930 get_pi_state(pi_state
);
931 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
932 spin_unlock(&hb
->lock
);
934 rt_mutex_futex_unlock(&pi_state
->pi_mutex
);
935 put_pi_state(pi_state
);
937 raw_spin_lock_irq(&curr
->pi_lock
);
939 raw_spin_unlock_irq(&curr
->pi_lock
);
943 * We need to check the following states:
945 * Waiter | pi_state | pi->owner | uTID | uODIED | ?
947 * [1] NULL | --- | --- | 0 | 0/1 | Valid
948 * [2] NULL | --- | --- | >0 | 0/1 | Valid
950 * [3] Found | NULL | -- | Any | 0/1 | Invalid
952 * [4] Found | Found | NULL | 0 | 1 | Valid
953 * [5] Found | Found | NULL | >0 | 1 | Invalid
955 * [6] Found | Found | task | 0 | 1 | Valid
957 * [7] Found | Found | NULL | Any | 0 | Invalid
959 * [8] Found | Found | task | ==taskTID | 0/1 | Valid
960 * [9] Found | Found | task | 0 | 0 | Invalid
961 * [10] Found | Found | task | !=taskTID | 0/1 | Invalid
963 * [1] Indicates that the kernel can acquire the futex atomically. We
964 * came came here due to a stale FUTEX_WAITERS/FUTEX_OWNER_DIED bit.
966 * [2] Valid, if TID does not belong to a kernel thread. If no matching
967 * thread is found then it indicates that the owner TID has died.
969 * [3] Invalid. The waiter is queued on a non PI futex
971 * [4] Valid state after exit_robust_list(), which sets the user space
972 * value to FUTEX_WAITERS | FUTEX_OWNER_DIED.
974 * [5] The user space value got manipulated between exit_robust_list()
975 * and exit_pi_state_list()
977 * [6] Valid state after exit_pi_state_list() which sets the new owner in
978 * the pi_state but cannot access the user space value.
980 * [7] pi_state->owner can only be NULL when the OWNER_DIED bit is set.
982 * [8] Owner and user space value match
984 * [9] There is no transient state which sets the user space TID to 0
985 * except exit_robust_list(), but this is indicated by the
986 * FUTEX_OWNER_DIED bit. See [4]
988 * [10] There is no transient state which leaves owner and user space
992 * Serialization and lifetime rules:
996 * hb -> futex_q, relation
997 * futex_q -> pi_state, relation
999 * (cannot be raw because hb can contain arbitrary amount
1002 * pi_mutex->wait_lock:
1006 * (and pi_mutex 'obviously')
1010 * p->pi_state_list -> pi_state->list, relation
1012 * pi_state->refcount:
1020 * pi_mutex->wait_lock
1026 * Validate that the existing waiter has a pi_state and sanity check
1027 * the pi_state against the user space value. If correct, attach to
1030 static int attach_to_pi_state(u32 __user
*uaddr
, u32 uval
,
1031 struct futex_pi_state
*pi_state
,
1032 struct futex_pi_state
**ps
)
1034 pid_t pid
= uval
& FUTEX_TID_MASK
;
1039 * Userspace might have messed up non-PI and PI futexes [3]
1041 if (unlikely(!pi_state
))
1045 * We get here with hb->lock held, and having found a
1046 * futex_top_waiter(). This means that futex_lock_pi() of said futex_q
1047 * has dropped the hb->lock in between queue_me() and unqueue_me_pi(),
1048 * which in turn means that futex_lock_pi() still has a reference on
1051 * The waiter holding a reference on @pi_state also protects against
1052 * the unlocked put_pi_state() in futex_unlock_pi(), futex_lock_pi()
1053 * and futex_wait_requeue_pi() as it cannot go to 0 and consequently
1054 * free pi_state before we can take a reference ourselves.
1056 WARN_ON(!atomic_read(&pi_state
->refcount
));
1059 * Now that we have a pi_state, we can acquire wait_lock
1060 * and do the state validation.
1062 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
1065 * Since {uval, pi_state} is serialized by wait_lock, and our current
1066 * uval was read without holding it, it can have changed. Verify it
1067 * still is what we expect it to be, otherwise retry the entire
1070 if (get_futex_value_locked(&uval2
, uaddr
))
1077 * Handle the owner died case:
1079 if (uval
& FUTEX_OWNER_DIED
) {
1081 * exit_pi_state_list sets owner to NULL and wakes the
1082 * topmost waiter. The task which acquires the
1083 * pi_state->rt_mutex will fixup owner.
1085 if (!pi_state
->owner
) {
1087 * No pi state owner, but the user space TID
1088 * is not 0. Inconsistent state. [5]
1093 * Take a ref on the state and return success. [4]
1099 * If TID is 0, then either the dying owner has not
1100 * yet executed exit_pi_state_list() or some waiter
1101 * acquired the rtmutex in the pi state, but did not
1102 * yet fixup the TID in user space.
1104 * Take a ref on the state and return success. [6]
1110 * If the owner died bit is not set, then the pi_state
1111 * must have an owner. [7]
1113 if (!pi_state
->owner
)
1118 * Bail out if user space manipulated the futex value. If pi
1119 * state exists then the owner TID must be the same as the
1120 * user space TID. [9/10]
1122 if (pid
!= task_pid_vnr(pi_state
->owner
))
1126 get_pi_state(pi_state
);
1127 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
1144 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
1149 * Lookup the task for the TID provided from user space and attach to
1150 * it after doing proper sanity checks.
1152 static int attach_to_pi_owner(u32 uval
, union futex_key
*key
,
1153 struct futex_pi_state
**ps
)
1155 pid_t pid
= uval
& FUTEX_TID_MASK
;
1156 struct futex_pi_state
*pi_state
;
1157 struct task_struct
*p
;
1160 * We are the first waiter - try to look up the real owner and attach
1161 * the new pi_state to it, but bail out when TID = 0 [1]
1165 p
= futex_find_get_task(pid
);
1169 if (unlikely(p
->flags
& PF_KTHREAD
)) {
1175 * We need to look at the task state flags to figure out,
1176 * whether the task is exiting. To protect against the do_exit
1177 * change of the task flags, we do this protected by
1180 raw_spin_lock_irq(&p
->pi_lock
);
1181 if (unlikely(p
->flags
& PF_EXITING
)) {
1183 * The task is on the way out. When PF_EXITPIDONE is
1184 * set, we know that the task has finished the
1187 int ret
= (p
->flags
& PF_EXITPIDONE
) ? -ESRCH
: -EAGAIN
;
1189 raw_spin_unlock_irq(&p
->pi_lock
);
1195 * No existing pi state. First waiter. [2]
1197 * This creates pi_state, we have hb->lock held, this means nothing can
1198 * observe this state, wait_lock is irrelevant.
1200 pi_state
= alloc_pi_state();
1203 * Initialize the pi_mutex in locked state and make @p
1206 rt_mutex_init_proxy_locked(&pi_state
->pi_mutex
, p
);
1208 /* Store the key for possible exit cleanups: */
1209 pi_state
->key
= *key
;
1211 WARN_ON(!list_empty(&pi_state
->list
));
1212 list_add(&pi_state
->list
, &p
->pi_state_list
);
1214 * Assignment without holding pi_state->pi_mutex.wait_lock is safe
1215 * because there is no concurrency as the object is not published yet.
1217 pi_state
->owner
= p
;
1218 raw_spin_unlock_irq(&p
->pi_lock
);
1227 static int lookup_pi_state(u32 __user
*uaddr
, u32 uval
,
1228 struct futex_hash_bucket
*hb
,
1229 union futex_key
*key
, struct futex_pi_state
**ps
)
1231 struct futex_q
*top_waiter
= futex_top_waiter(hb
, key
);
1234 * If there is a waiter on that futex, validate it and
1235 * attach to the pi_state when the validation succeeds.
1238 return attach_to_pi_state(uaddr
, uval
, top_waiter
->pi_state
, ps
);
1241 * We are the first waiter - try to look up the owner based on
1242 * @uval and attach to it.
1244 return attach_to_pi_owner(uval
, key
, ps
);
1247 static int lock_pi_update_atomic(u32 __user
*uaddr
, u32 uval
, u32 newval
)
1249 u32
uninitialized_var(curval
);
1251 if (unlikely(should_fail_futex(true)))
1254 if (unlikely(cmpxchg_futex_value_locked(&curval
, uaddr
, uval
, newval
)))
1257 /* If user space value changed, let the caller retry */
1258 return curval
!= uval
? -EAGAIN
: 0;
1262 * futex_lock_pi_atomic() - Atomic work required to acquire a pi aware futex
1263 * @uaddr: the pi futex user address
1264 * @hb: the pi futex hash bucket
1265 * @key: the futex key associated with uaddr and hb
1266 * @ps: the pi_state pointer where we store the result of the
1268 * @task: the task to perform the atomic lock work for. This will
1269 * be "current" except in the case of requeue pi.
1270 * @set_waiters: force setting the FUTEX_WAITERS bit (1) or not (0)
1273 * - 0 - ready to wait;
1274 * - 1 - acquired the lock;
1277 * The hb->lock and futex_key refs shall be held by the caller.
1279 static int futex_lock_pi_atomic(u32 __user
*uaddr
, struct futex_hash_bucket
*hb
,
1280 union futex_key
*key
,
1281 struct futex_pi_state
**ps
,
1282 struct task_struct
*task
, int set_waiters
)
1284 u32 uval
, newval
, vpid
= task_pid_vnr(task
);
1285 struct futex_q
*top_waiter
;
1289 * Read the user space value first so we can validate a few
1290 * things before proceeding further.
1292 if (get_futex_value_locked(&uval
, uaddr
))
1295 if (unlikely(should_fail_futex(true)))
1301 if ((unlikely((uval
& FUTEX_TID_MASK
) == vpid
)))
1304 if ((unlikely(should_fail_futex(true))))
1308 * Lookup existing state first. If it exists, try to attach to
1311 top_waiter
= futex_top_waiter(hb
, key
);
1313 return attach_to_pi_state(uaddr
, uval
, top_waiter
->pi_state
, ps
);
1316 * No waiter and user TID is 0. We are here because the
1317 * waiters or the owner died bit is set or called from
1318 * requeue_cmp_pi or for whatever reason something took the
1321 if (!(uval
& FUTEX_TID_MASK
)) {
1323 * We take over the futex. No other waiters and the user space
1324 * TID is 0. We preserve the owner died bit.
1326 newval
= uval
& FUTEX_OWNER_DIED
;
1329 /* The futex requeue_pi code can enforce the waiters bit */
1331 newval
|= FUTEX_WAITERS
;
1333 ret
= lock_pi_update_atomic(uaddr
, uval
, newval
);
1334 /* If the take over worked, return 1 */
1335 return ret
< 0 ? ret
: 1;
1339 * First waiter. Set the waiters bit before attaching ourself to
1340 * the owner. If owner tries to unlock, it will be forced into
1341 * the kernel and blocked on hb->lock.
1343 newval
= uval
| FUTEX_WAITERS
;
1344 ret
= lock_pi_update_atomic(uaddr
, uval
, newval
);
1348 * If the update of the user space value succeeded, we try to
1349 * attach to the owner. If that fails, no harm done, we only
1350 * set the FUTEX_WAITERS bit in the user space variable.
1352 return attach_to_pi_owner(uval
, key
, ps
);
1356 * __unqueue_futex() - Remove the futex_q from its futex_hash_bucket
1357 * @q: The futex_q to unqueue
1359 * The q->lock_ptr must not be NULL and must be held by the caller.
1361 static void __unqueue_futex(struct futex_q
*q
)
1363 struct futex_hash_bucket
*hb
;
1365 if (WARN_ON_SMP(!q
->lock_ptr
|| !spin_is_locked(q
->lock_ptr
))
1366 || WARN_ON(plist_node_empty(&q
->list
)))
1369 hb
= container_of(q
->lock_ptr
, struct futex_hash_bucket
, lock
);
1370 plist_del(&q
->list
, &hb
->chain
);
1375 * The hash bucket lock must be held when this is called.
1376 * Afterwards, the futex_q must not be accessed. Callers
1377 * must ensure to later call wake_up_q() for the actual
1380 static void mark_wake_futex(struct wake_q_head
*wake_q
, struct futex_q
*q
)
1382 struct task_struct
*p
= q
->task
;
1384 if (WARN(q
->pi_state
|| q
->rt_waiter
, "refusing to wake PI futex\n"))
1388 * Queue the task for later wakeup for after we've released
1389 * the hb->lock. wake_q_add() grabs reference to p.
1391 wake_q_add(wake_q
, p
);
1394 * The waiting task can free the futex_q as soon as q->lock_ptr = NULL
1395 * is written, without taking any locks. This is possible in the event
1396 * of a spurious wakeup, for example. A memory barrier is required here
1397 * to prevent the following store to lock_ptr from getting ahead of the
1398 * plist_del in __unqueue_futex().
1400 smp_store_release(&q
->lock_ptr
, NULL
);
1404 * Caller must hold a reference on @pi_state.
1406 static int wake_futex_pi(u32 __user
*uaddr
, u32 uval
, struct futex_pi_state
*pi_state
)
1408 u32
uninitialized_var(curval
), newval
;
1409 struct task_struct
*new_owner
;
1410 bool postunlock
= false;
1411 DEFINE_WAKE_Q(wake_q
);
1414 new_owner
= rt_mutex_next_owner(&pi_state
->pi_mutex
);
1415 if (WARN_ON_ONCE(!new_owner
)) {
1417 * As per the comment in futex_unlock_pi() this should not happen.
1419 * When this happens, give up our locks and try again, giving
1420 * the futex_lock_pi() instance time to complete, either by
1421 * waiting on the rtmutex or removing itself from the futex
1429 * We pass it to the next owner. The WAITERS bit is always kept
1430 * enabled while there is PI state around. We cleanup the owner
1431 * died bit, because we are the owner.
1433 newval
= FUTEX_WAITERS
| task_pid_vnr(new_owner
);
1435 if (unlikely(should_fail_futex(true)))
1438 if (cmpxchg_futex_value_locked(&curval
, uaddr
, uval
, newval
)) {
1441 } else if (curval
!= uval
) {
1443 * If a unconditional UNLOCK_PI operation (user space did not
1444 * try the TID->0 transition) raced with a waiter setting the
1445 * FUTEX_WAITERS flag between get_user() and locking the hash
1446 * bucket lock, retry the operation.
1448 if ((FUTEX_TID_MASK
& curval
) == uval
)
1458 * This is a point of no return; once we modify the uval there is no
1459 * going back and subsequent operations must not fail.
1462 raw_spin_lock(&pi_state
->owner
->pi_lock
);
1463 WARN_ON(list_empty(&pi_state
->list
));
1464 list_del_init(&pi_state
->list
);
1465 raw_spin_unlock(&pi_state
->owner
->pi_lock
);
1467 raw_spin_lock(&new_owner
->pi_lock
);
1468 WARN_ON(!list_empty(&pi_state
->list
));
1469 list_add(&pi_state
->list
, &new_owner
->pi_state_list
);
1470 pi_state
->owner
= new_owner
;
1471 raw_spin_unlock(&new_owner
->pi_lock
);
1473 postunlock
= __rt_mutex_futex_unlock(&pi_state
->pi_mutex
, &wake_q
);
1476 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
1479 rt_mutex_postunlock(&wake_q
);
1485 * Express the locking dependencies for lockdep:
1488 double_lock_hb(struct futex_hash_bucket
*hb1
, struct futex_hash_bucket
*hb2
)
1491 spin_lock(&hb1
->lock
);
1493 spin_lock_nested(&hb2
->lock
, SINGLE_DEPTH_NESTING
);
1494 } else { /* hb1 > hb2 */
1495 spin_lock(&hb2
->lock
);
1496 spin_lock_nested(&hb1
->lock
, SINGLE_DEPTH_NESTING
);
1501 double_unlock_hb(struct futex_hash_bucket
*hb1
, struct futex_hash_bucket
*hb2
)
1503 spin_unlock(&hb1
->lock
);
1505 spin_unlock(&hb2
->lock
);
1509 * Wake up waiters matching bitset queued on this futex (uaddr).
1512 futex_wake(u32 __user
*uaddr
, unsigned int flags
, int nr_wake
, u32 bitset
)
1514 struct futex_hash_bucket
*hb
;
1515 struct futex_q
*this, *next
;
1516 union futex_key key
= FUTEX_KEY_INIT
;
1518 DEFINE_WAKE_Q(wake_q
);
1523 ret
= get_futex_key(uaddr
, flags
& FLAGS_SHARED
, &key
, VERIFY_READ
);
1524 if (unlikely(ret
!= 0))
1527 hb
= hash_futex(&key
);
1529 /* Make sure we really have tasks to wakeup */
1530 if (!hb_waiters_pending(hb
))
1533 spin_lock(&hb
->lock
);
1535 plist_for_each_entry_safe(this, next
, &hb
->chain
, list
) {
1536 if (match_futex (&this->key
, &key
)) {
1537 if (this->pi_state
|| this->rt_waiter
) {
1542 /* Check if one of the bits is set in both bitsets */
1543 if (!(this->bitset
& bitset
))
1546 mark_wake_futex(&wake_q
, this);
1547 if (++ret
>= nr_wake
)
1552 spin_unlock(&hb
->lock
);
1555 put_futex_key(&key
);
1561 * Wake up all waiters hashed on the physical page that is mapped
1562 * to this virtual address:
1565 futex_wake_op(u32 __user
*uaddr1
, unsigned int flags
, u32 __user
*uaddr2
,
1566 int nr_wake
, int nr_wake2
, int op
)
1568 union futex_key key1
= FUTEX_KEY_INIT
, key2
= FUTEX_KEY_INIT
;
1569 struct futex_hash_bucket
*hb1
, *hb2
;
1570 struct futex_q
*this, *next
;
1572 DEFINE_WAKE_Q(wake_q
);
1575 ret
= get_futex_key(uaddr1
, flags
& FLAGS_SHARED
, &key1
, VERIFY_READ
);
1576 if (unlikely(ret
!= 0))
1578 ret
= get_futex_key(uaddr2
, flags
& FLAGS_SHARED
, &key2
, VERIFY_WRITE
);
1579 if (unlikely(ret
!= 0))
1582 hb1
= hash_futex(&key1
);
1583 hb2
= hash_futex(&key2
);
1586 double_lock_hb(hb1
, hb2
);
1587 op_ret
= futex_atomic_op_inuser(op
, uaddr2
);
1588 if (unlikely(op_ret
< 0)) {
1590 double_unlock_hb(hb1
, hb2
);
1594 * we don't get EFAULT from MMU faults if we don't have an MMU,
1595 * but we might get them from range checking
1601 if (unlikely(op_ret
!= -EFAULT
)) {
1606 ret
= fault_in_user_writeable(uaddr2
);
1610 if (!(flags
& FLAGS_SHARED
))
1613 put_futex_key(&key2
);
1614 put_futex_key(&key1
);
1618 plist_for_each_entry_safe(this, next
, &hb1
->chain
, list
) {
1619 if (match_futex (&this->key
, &key1
)) {
1620 if (this->pi_state
|| this->rt_waiter
) {
1624 mark_wake_futex(&wake_q
, this);
1625 if (++ret
>= nr_wake
)
1632 plist_for_each_entry_safe(this, next
, &hb2
->chain
, list
) {
1633 if (match_futex (&this->key
, &key2
)) {
1634 if (this->pi_state
|| this->rt_waiter
) {
1638 mark_wake_futex(&wake_q
, this);
1639 if (++op_ret
>= nr_wake2
)
1647 double_unlock_hb(hb1
, hb2
);
1650 put_futex_key(&key2
);
1652 put_futex_key(&key1
);
1658 * requeue_futex() - Requeue a futex_q from one hb to another
1659 * @q: the futex_q to requeue
1660 * @hb1: the source hash_bucket
1661 * @hb2: the target hash_bucket
1662 * @key2: the new key for the requeued futex_q
1665 void requeue_futex(struct futex_q
*q
, struct futex_hash_bucket
*hb1
,
1666 struct futex_hash_bucket
*hb2
, union futex_key
*key2
)
1670 * If key1 and key2 hash to the same bucket, no need to
1673 if (likely(&hb1
->chain
!= &hb2
->chain
)) {
1674 plist_del(&q
->list
, &hb1
->chain
);
1675 hb_waiters_dec(hb1
);
1676 hb_waiters_inc(hb2
);
1677 plist_add(&q
->list
, &hb2
->chain
);
1678 q
->lock_ptr
= &hb2
->lock
;
1680 get_futex_key_refs(key2
);
1685 * requeue_pi_wake_futex() - Wake a task that acquired the lock during requeue
1687 * @key: the key of the requeue target futex
1688 * @hb: the hash_bucket of the requeue target futex
1690 * During futex_requeue, with requeue_pi=1, it is possible to acquire the
1691 * target futex if it is uncontended or via a lock steal. Set the futex_q key
1692 * to the requeue target futex so the waiter can detect the wakeup on the right
1693 * futex, but remove it from the hb and NULL the rt_waiter so it can detect
1694 * atomic lock acquisition. Set the q->lock_ptr to the requeue target hb->lock
1695 * to protect access to the pi_state to fixup the owner later. Must be called
1696 * with both q->lock_ptr and hb->lock held.
1699 void requeue_pi_wake_futex(struct futex_q
*q
, union futex_key
*key
,
1700 struct futex_hash_bucket
*hb
)
1702 get_futex_key_refs(key
);
1707 WARN_ON(!q
->rt_waiter
);
1708 q
->rt_waiter
= NULL
;
1710 q
->lock_ptr
= &hb
->lock
;
1712 wake_up_state(q
->task
, TASK_NORMAL
);
1716 * futex_proxy_trylock_atomic() - Attempt an atomic lock for the top waiter
1717 * @pifutex: the user address of the to futex
1718 * @hb1: the from futex hash bucket, must be locked by the caller
1719 * @hb2: the to futex hash bucket, must be locked by the caller
1720 * @key1: the from futex key
1721 * @key2: the to futex key
1722 * @ps: address to store the pi_state pointer
1723 * @set_waiters: force setting the FUTEX_WAITERS bit (1) or not (0)
1725 * Try and get the lock on behalf of the top waiter if we can do it atomically.
1726 * Wake the top waiter if we succeed. If the caller specified set_waiters,
1727 * then direct futex_lock_pi_atomic() to force setting the FUTEX_WAITERS bit.
1728 * hb1 and hb2 must be held by the caller.
1731 * - 0 - failed to acquire the lock atomically;
1732 * - >0 - acquired the lock, return value is vpid of the top_waiter
1735 static int futex_proxy_trylock_atomic(u32 __user
*pifutex
,
1736 struct futex_hash_bucket
*hb1
,
1737 struct futex_hash_bucket
*hb2
,
1738 union futex_key
*key1
, union futex_key
*key2
,
1739 struct futex_pi_state
**ps
, int set_waiters
)
1741 struct futex_q
*top_waiter
= NULL
;
1745 if (get_futex_value_locked(&curval
, pifutex
))
1748 if (unlikely(should_fail_futex(true)))
1752 * Find the top_waiter and determine if there are additional waiters.
1753 * If the caller intends to requeue more than 1 waiter to pifutex,
1754 * force futex_lock_pi_atomic() to set the FUTEX_WAITERS bit now,
1755 * as we have means to handle the possible fault. If not, don't set
1756 * the bit unecessarily as it will force the subsequent unlock to enter
1759 top_waiter
= futex_top_waiter(hb1
, key1
);
1761 /* There are no waiters, nothing for us to do. */
1765 /* Ensure we requeue to the expected futex. */
1766 if (!match_futex(top_waiter
->requeue_pi_key
, key2
))
1770 * Try to take the lock for top_waiter. Set the FUTEX_WAITERS bit in
1771 * the contended case or if set_waiters is 1. The pi_state is returned
1772 * in ps in contended cases.
1774 vpid
= task_pid_vnr(top_waiter
->task
);
1775 ret
= futex_lock_pi_atomic(pifutex
, hb2
, key2
, ps
, top_waiter
->task
,
1778 requeue_pi_wake_futex(top_waiter
, key2
, hb2
);
1785 * futex_requeue() - Requeue waiters from uaddr1 to uaddr2
1786 * @uaddr1: source futex user address
1787 * @flags: futex flags (FLAGS_SHARED, etc.)
1788 * @uaddr2: target futex user address
1789 * @nr_wake: number of waiters to wake (must be 1 for requeue_pi)
1790 * @nr_requeue: number of waiters to requeue (0-INT_MAX)
1791 * @cmpval: @uaddr1 expected value (or %NULL)
1792 * @requeue_pi: if we are attempting to requeue from a non-pi futex to a
1793 * pi futex (pi to pi requeue is not supported)
1795 * Requeue waiters on uaddr1 to uaddr2. In the requeue_pi case, try to acquire
1796 * uaddr2 atomically on behalf of the top waiter.
1799 * - >=0 - on success, the number of tasks requeued or woken;
1802 static int futex_requeue(u32 __user
*uaddr1
, unsigned int flags
,
1803 u32 __user
*uaddr2
, int nr_wake
, int nr_requeue
,
1804 u32
*cmpval
, int requeue_pi
)
1806 union futex_key key1
= FUTEX_KEY_INIT
, key2
= FUTEX_KEY_INIT
;
1807 int drop_count
= 0, task_count
= 0, ret
;
1808 struct futex_pi_state
*pi_state
= NULL
;
1809 struct futex_hash_bucket
*hb1
, *hb2
;
1810 struct futex_q
*this, *next
;
1811 DEFINE_WAKE_Q(wake_q
);
1815 * Requeue PI only works on two distinct uaddrs. This
1816 * check is only valid for private futexes. See below.
1818 if (uaddr1
== uaddr2
)
1822 * requeue_pi requires a pi_state, try to allocate it now
1823 * without any locks in case it fails.
1825 if (refill_pi_state_cache())
1828 * requeue_pi must wake as many tasks as it can, up to nr_wake
1829 * + nr_requeue, since it acquires the rt_mutex prior to
1830 * returning to userspace, so as to not leave the rt_mutex with
1831 * waiters and no owner. However, second and third wake-ups
1832 * cannot be predicted as they involve race conditions with the
1833 * first wake and a fault while looking up the pi_state. Both
1834 * pthread_cond_signal() and pthread_cond_broadcast() should
1842 ret
= get_futex_key(uaddr1
, flags
& FLAGS_SHARED
, &key1
, VERIFY_READ
);
1843 if (unlikely(ret
!= 0))
1845 ret
= get_futex_key(uaddr2
, flags
& FLAGS_SHARED
, &key2
,
1846 requeue_pi
? VERIFY_WRITE
: VERIFY_READ
);
1847 if (unlikely(ret
!= 0))
1851 * The check above which compares uaddrs is not sufficient for
1852 * shared futexes. We need to compare the keys:
1854 if (requeue_pi
&& match_futex(&key1
, &key2
)) {
1859 hb1
= hash_futex(&key1
);
1860 hb2
= hash_futex(&key2
);
1863 hb_waiters_inc(hb2
);
1864 double_lock_hb(hb1
, hb2
);
1866 if (likely(cmpval
!= NULL
)) {
1869 ret
= get_futex_value_locked(&curval
, uaddr1
);
1871 if (unlikely(ret
)) {
1872 double_unlock_hb(hb1
, hb2
);
1873 hb_waiters_dec(hb2
);
1875 ret
= get_user(curval
, uaddr1
);
1879 if (!(flags
& FLAGS_SHARED
))
1882 put_futex_key(&key2
);
1883 put_futex_key(&key1
);
1886 if (curval
!= *cmpval
) {
1892 if (requeue_pi
&& (task_count
- nr_wake
< nr_requeue
)) {
1894 * Attempt to acquire uaddr2 and wake the top waiter. If we
1895 * intend to requeue waiters, force setting the FUTEX_WAITERS
1896 * bit. We force this here where we are able to easily handle
1897 * faults rather in the requeue loop below.
1899 ret
= futex_proxy_trylock_atomic(uaddr2
, hb1
, hb2
, &key1
,
1900 &key2
, &pi_state
, nr_requeue
);
1903 * At this point the top_waiter has either taken uaddr2 or is
1904 * waiting on it. If the former, then the pi_state will not
1905 * exist yet, look it up one more time to ensure we have a
1906 * reference to it. If the lock was taken, ret contains the
1907 * vpid of the top waiter task.
1908 * If the lock was not taken, we have pi_state and an initial
1909 * refcount on it. In case of an error we have nothing.
1916 * If we acquired the lock, then the user space value
1917 * of uaddr2 should be vpid. It cannot be changed by
1918 * the top waiter as it is blocked on hb2 lock if it
1919 * tries to do so. If something fiddled with it behind
1920 * our back the pi state lookup might unearth it. So
1921 * we rather use the known value than rereading and
1922 * handing potential crap to lookup_pi_state.
1924 * If that call succeeds then we have pi_state and an
1925 * initial refcount on it.
1927 ret
= lookup_pi_state(uaddr2
, ret
, hb2
, &key2
, &pi_state
);
1932 /* We hold a reference on the pi state. */
1935 /* If the above failed, then pi_state is NULL */
1937 double_unlock_hb(hb1
, hb2
);
1938 hb_waiters_dec(hb2
);
1939 put_futex_key(&key2
);
1940 put_futex_key(&key1
);
1941 ret
= fault_in_user_writeable(uaddr2
);
1947 * Two reasons for this:
1948 * - Owner is exiting and we just wait for the
1950 * - The user space value changed.
1952 double_unlock_hb(hb1
, hb2
);
1953 hb_waiters_dec(hb2
);
1954 put_futex_key(&key2
);
1955 put_futex_key(&key1
);
1963 plist_for_each_entry_safe(this, next
, &hb1
->chain
, list
) {
1964 if (task_count
- nr_wake
>= nr_requeue
)
1967 if (!match_futex(&this->key
, &key1
))
1971 * FUTEX_WAIT_REQEUE_PI and FUTEX_CMP_REQUEUE_PI should always
1972 * be paired with each other and no other futex ops.
1974 * We should never be requeueing a futex_q with a pi_state,
1975 * which is awaiting a futex_unlock_pi().
1977 if ((requeue_pi
&& !this->rt_waiter
) ||
1978 (!requeue_pi
&& this->rt_waiter
) ||
1985 * Wake nr_wake waiters. For requeue_pi, if we acquired the
1986 * lock, we already woke the top_waiter. If not, it will be
1987 * woken by futex_unlock_pi().
1989 if (++task_count
<= nr_wake
&& !requeue_pi
) {
1990 mark_wake_futex(&wake_q
, this);
1994 /* Ensure we requeue to the expected futex for requeue_pi. */
1995 if (requeue_pi
&& !match_futex(this->requeue_pi_key
, &key2
)) {
2001 * Requeue nr_requeue waiters and possibly one more in the case
2002 * of requeue_pi if we couldn't acquire the lock atomically.
2006 * Prepare the waiter to take the rt_mutex. Take a
2007 * refcount on the pi_state and store the pointer in
2008 * the futex_q object of the waiter.
2010 get_pi_state(pi_state
);
2011 this->pi_state
= pi_state
;
2012 ret
= rt_mutex_start_proxy_lock(&pi_state
->pi_mutex
,
2017 * We got the lock. We do neither drop the
2018 * refcount on pi_state nor clear
2019 * this->pi_state because the waiter needs the
2020 * pi_state for cleaning up the user space
2021 * value. It will drop the refcount after
2024 requeue_pi_wake_futex(this, &key2
, hb2
);
2029 * rt_mutex_start_proxy_lock() detected a
2030 * potential deadlock when we tried to queue
2031 * that waiter. Drop the pi_state reference
2032 * which we took above and remove the pointer
2033 * to the state from the waiters futex_q
2036 this->pi_state
= NULL
;
2037 put_pi_state(pi_state
);
2039 * We stop queueing more waiters and let user
2040 * space deal with the mess.
2045 requeue_futex(this, hb1
, hb2
, &key2
);
2050 * We took an extra initial reference to the pi_state either
2051 * in futex_proxy_trylock_atomic() or in lookup_pi_state(). We
2052 * need to drop it here again.
2054 put_pi_state(pi_state
);
2057 double_unlock_hb(hb1
, hb2
);
2059 hb_waiters_dec(hb2
);
2062 * drop_futex_key_refs() must be called outside the spinlocks. During
2063 * the requeue we moved futex_q's from the hash bucket at key1 to the
2064 * one at key2 and updated their key pointer. We no longer need to
2065 * hold the references to key1.
2067 while (--drop_count
>= 0)
2068 drop_futex_key_refs(&key1
);
2071 put_futex_key(&key2
);
2073 put_futex_key(&key1
);
2075 return ret
? ret
: task_count
;
2078 /* The key must be already stored in q->key. */
2079 static inline struct futex_hash_bucket
*queue_lock(struct futex_q
*q
)
2080 __acquires(&hb
->lock
)
2082 struct futex_hash_bucket
*hb
;
2084 hb
= hash_futex(&q
->key
);
2087 * Increment the counter before taking the lock so that
2088 * a potential waker won't miss a to-be-slept task that is
2089 * waiting for the spinlock. This is safe as all queue_lock()
2090 * users end up calling queue_me(). Similarly, for housekeeping,
2091 * decrement the counter at queue_unlock() when some error has
2092 * occurred and we don't end up adding the task to the list.
2096 q
->lock_ptr
= &hb
->lock
;
2098 spin_lock(&hb
->lock
); /* implies smp_mb(); (A) */
2103 queue_unlock(struct futex_hash_bucket
*hb
)
2104 __releases(&hb
->lock
)
2106 spin_unlock(&hb
->lock
);
2110 static inline void __queue_me(struct futex_q
*q
, struct futex_hash_bucket
*hb
)
2115 * The priority used to register this element is
2116 * - either the real thread-priority for the real-time threads
2117 * (i.e. threads with a priority lower than MAX_RT_PRIO)
2118 * - or MAX_RT_PRIO for non-RT threads.
2119 * Thus, all RT-threads are woken first in priority order, and
2120 * the others are woken last, in FIFO order.
2122 prio
= min(current
->normal_prio
, MAX_RT_PRIO
);
2124 plist_node_init(&q
->list
, prio
);
2125 plist_add(&q
->list
, &hb
->chain
);
2130 * queue_me() - Enqueue the futex_q on the futex_hash_bucket
2131 * @q: The futex_q to enqueue
2132 * @hb: The destination hash bucket
2134 * The hb->lock must be held by the caller, and is released here. A call to
2135 * queue_me() is typically paired with exactly one call to unqueue_me(). The
2136 * exceptions involve the PI related operations, which may use unqueue_me_pi()
2137 * or nothing if the unqueue is done as part of the wake process and the unqueue
2138 * state is implicit in the state of woken task (see futex_wait_requeue_pi() for
2141 static inline void queue_me(struct futex_q
*q
, struct futex_hash_bucket
*hb
)
2142 __releases(&hb
->lock
)
2145 spin_unlock(&hb
->lock
);
2149 * unqueue_me() - Remove the futex_q from its futex_hash_bucket
2150 * @q: The futex_q to unqueue
2152 * The q->lock_ptr must not be held by the caller. A call to unqueue_me() must
2153 * be paired with exactly one earlier call to queue_me().
2156 * - 1 - if the futex_q was still queued (and we removed unqueued it);
2157 * - 0 - if the futex_q was already removed by the waking thread
2159 static int unqueue_me(struct futex_q
*q
)
2161 spinlock_t
*lock_ptr
;
2164 /* In the common case we don't take the spinlock, which is nice. */
2167 * q->lock_ptr can change between this read and the following spin_lock.
2168 * Use READ_ONCE to forbid the compiler from reloading q->lock_ptr and
2169 * optimizing lock_ptr out of the logic below.
2171 lock_ptr
= READ_ONCE(q
->lock_ptr
);
2172 if (lock_ptr
!= NULL
) {
2173 spin_lock(lock_ptr
);
2175 * q->lock_ptr can change between reading it and
2176 * spin_lock(), causing us to take the wrong lock. This
2177 * corrects the race condition.
2179 * Reasoning goes like this: if we have the wrong lock,
2180 * q->lock_ptr must have changed (maybe several times)
2181 * between reading it and the spin_lock(). It can
2182 * change again after the spin_lock() but only if it was
2183 * already changed before the spin_lock(). It cannot,
2184 * however, change back to the original value. Therefore
2185 * we can detect whether we acquired the correct lock.
2187 if (unlikely(lock_ptr
!= q
->lock_ptr
)) {
2188 spin_unlock(lock_ptr
);
2193 BUG_ON(q
->pi_state
);
2195 spin_unlock(lock_ptr
);
2199 drop_futex_key_refs(&q
->key
);
2204 * PI futexes can not be requeued and must remove themself from the
2205 * hash bucket. The hash bucket lock (i.e. lock_ptr) is held on entry
2208 static void unqueue_me_pi(struct futex_q
*q
)
2209 __releases(q
->lock_ptr
)
2213 BUG_ON(!q
->pi_state
);
2214 put_pi_state(q
->pi_state
);
2217 spin_unlock(q
->lock_ptr
);
2221 * Fixup the pi_state owner with the new owner.
2223 * Must be called with hash bucket lock held and mm->sem held for non
2226 static int fixup_pi_state_owner(u32 __user
*uaddr
, struct futex_q
*q
,
2227 struct task_struct
*newowner
)
2229 u32 newtid
= task_pid_vnr(newowner
) | FUTEX_WAITERS
;
2230 struct futex_pi_state
*pi_state
= q
->pi_state
;
2231 u32 uval
, uninitialized_var(curval
), newval
;
2232 struct task_struct
*oldowner
;
2235 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
2237 oldowner
= pi_state
->owner
;
2239 if (!pi_state
->owner
)
2240 newtid
|= FUTEX_OWNER_DIED
;
2243 * We are here either because we stole the rtmutex from the
2244 * previous highest priority waiter or we are the highest priority
2245 * waiter but have failed to get the rtmutex the first time.
2247 * We have to replace the newowner TID in the user space variable.
2248 * This must be atomic as we have to preserve the owner died bit here.
2250 * Note: We write the user space value _before_ changing the pi_state
2251 * because we can fault here. Imagine swapped out pages or a fork
2252 * that marked all the anonymous memory readonly for cow.
2254 * Modifying pi_state _before_ the user space value would leave the
2255 * pi_state in an inconsistent state when we fault here, because we
2256 * need to drop the locks to handle the fault. This might be observed
2257 * in the PID check in lookup_pi_state.
2260 if (get_futex_value_locked(&uval
, uaddr
))
2264 newval
= (uval
& FUTEX_OWNER_DIED
) | newtid
;
2266 if (cmpxchg_futex_value_locked(&curval
, uaddr
, uval
, newval
))
2274 * We fixed up user space. Now we need to fix the pi_state
2277 if (pi_state
->owner
!= NULL
) {
2278 raw_spin_lock(&pi_state
->owner
->pi_lock
);
2279 WARN_ON(list_empty(&pi_state
->list
));
2280 list_del_init(&pi_state
->list
);
2281 raw_spin_unlock(&pi_state
->owner
->pi_lock
);
2284 pi_state
->owner
= newowner
;
2286 raw_spin_lock(&newowner
->pi_lock
);
2287 WARN_ON(!list_empty(&pi_state
->list
));
2288 list_add(&pi_state
->list
, &newowner
->pi_state_list
);
2289 raw_spin_unlock(&newowner
->pi_lock
);
2290 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
2295 * To handle the page fault we need to drop the locks here. That gives
2296 * the other task (either the highest priority waiter itself or the
2297 * task which stole the rtmutex) the chance to try the fixup of the
2298 * pi_state. So once we are back from handling the fault we need to
2299 * check the pi_state after reacquiring the locks and before trying to
2300 * do another fixup. When the fixup has been done already we simply
2303 * Note: we hold both hb->lock and pi_mutex->wait_lock. We can safely
2304 * drop hb->lock since the caller owns the hb -> futex_q relation.
2305 * Dropping the pi_mutex->wait_lock requires the state revalidate.
2308 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
2309 spin_unlock(q
->lock_ptr
);
2311 ret
= fault_in_user_writeable(uaddr
);
2313 spin_lock(q
->lock_ptr
);
2314 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
2317 * Check if someone else fixed it for us:
2319 if (pi_state
->owner
!= oldowner
) {
2330 raw_spin_unlock_irq(&pi_state
->pi_mutex
.wait_lock
);
2334 static long futex_wait_restart(struct restart_block
*restart
);
2337 * fixup_owner() - Post lock pi_state and corner case management
2338 * @uaddr: user address of the futex
2339 * @q: futex_q (contains pi_state and access to the rt_mutex)
2340 * @locked: if the attempt to take the rt_mutex succeeded (1) or not (0)
2342 * After attempting to lock an rt_mutex, this function is called to cleanup
2343 * the pi_state owner as well as handle race conditions that may allow us to
2344 * acquire the lock. Must be called with the hb lock held.
2347 * - 1 - success, lock taken;
2348 * - 0 - success, lock not taken;
2349 * - <0 - on error (-EFAULT)
2351 static int fixup_owner(u32 __user
*uaddr
, struct futex_q
*q
, int locked
)
2357 * Got the lock. We might not be the anticipated owner if we
2358 * did a lock-steal - fix up the PI-state in that case:
2360 * We can safely read pi_state->owner without holding wait_lock
2361 * because we now own the rt_mutex, only the owner will attempt
2364 if (q
->pi_state
->owner
!= current
)
2365 ret
= fixup_pi_state_owner(uaddr
, q
, current
);
2370 * Paranoia check. If we did not take the lock, then we should not be
2371 * the owner of the rt_mutex.
2373 if (rt_mutex_owner(&q
->pi_state
->pi_mutex
) == current
) {
2374 printk(KERN_ERR
"fixup_owner: ret = %d pi-mutex: %p "
2375 "pi-state %p\n", ret
,
2376 q
->pi_state
->pi_mutex
.owner
,
2377 q
->pi_state
->owner
);
2381 return ret
? ret
: locked
;
2385 * futex_wait_queue_me() - queue_me() and wait for wakeup, timeout, or signal
2386 * @hb: the futex hash bucket, must be locked by the caller
2387 * @q: the futex_q to queue up on
2388 * @timeout: the prepared hrtimer_sleeper, or null for no timeout
2390 static void futex_wait_queue_me(struct futex_hash_bucket
*hb
, struct futex_q
*q
,
2391 struct hrtimer_sleeper
*timeout
)
2394 * The task state is guaranteed to be set before another task can
2395 * wake it. set_current_state() is implemented using smp_store_mb() and
2396 * queue_me() calls spin_unlock() upon completion, both serializing
2397 * access to the hash list and forcing another memory barrier.
2399 set_current_state(TASK_INTERRUPTIBLE
);
2404 hrtimer_start_expires(&timeout
->timer
, HRTIMER_MODE_ABS
);
2407 * If we have been removed from the hash list, then another task
2408 * has tried to wake us, and we can skip the call to schedule().
2410 if (likely(!plist_node_empty(&q
->list
))) {
2412 * If the timer has already expired, current will already be
2413 * flagged for rescheduling. Only call schedule if there
2414 * is no timeout, or if it has yet to expire.
2416 if (!timeout
|| timeout
->task
)
2417 freezable_schedule();
2419 __set_current_state(TASK_RUNNING
);
2423 * futex_wait_setup() - Prepare to wait on a futex
2424 * @uaddr: the futex userspace address
2425 * @val: the expected value
2426 * @flags: futex flags (FLAGS_SHARED, etc.)
2427 * @q: the associated futex_q
2428 * @hb: storage for hash_bucket pointer to be returned to caller
2430 * Setup the futex_q and locate the hash_bucket. Get the futex value and
2431 * compare it with the expected value. Handle atomic faults internally.
2432 * Return with the hb lock held and a q.key reference on success, and unlocked
2433 * with no q.key reference on failure.
2436 * - 0 - uaddr contains val and hb has been locked;
2437 * - <1 - -EFAULT or -EWOULDBLOCK (uaddr does not contain val) and hb is unlocked
2439 static int futex_wait_setup(u32 __user
*uaddr
, u32 val
, unsigned int flags
,
2440 struct futex_q
*q
, struct futex_hash_bucket
**hb
)
2446 * Access the page AFTER the hash-bucket is locked.
2447 * Order is important:
2449 * Userspace waiter: val = var; if (cond(val)) futex_wait(&var, val);
2450 * Userspace waker: if (cond(var)) { var = new; futex_wake(&var); }
2452 * The basic logical guarantee of a futex is that it blocks ONLY
2453 * if cond(var) is known to be true at the time of blocking, for
2454 * any cond. If we locked the hash-bucket after testing *uaddr, that
2455 * would open a race condition where we could block indefinitely with
2456 * cond(var) false, which would violate the guarantee.
2458 * On the other hand, we insert q and release the hash-bucket only
2459 * after testing *uaddr. This guarantees that futex_wait() will NOT
2460 * absorb a wakeup if *uaddr does not match the desired values
2461 * while the syscall executes.
2464 ret
= get_futex_key(uaddr
, flags
& FLAGS_SHARED
, &q
->key
, VERIFY_READ
);
2465 if (unlikely(ret
!= 0))
2469 *hb
= queue_lock(q
);
2471 ret
= get_futex_value_locked(&uval
, uaddr
);
2476 ret
= get_user(uval
, uaddr
);
2480 if (!(flags
& FLAGS_SHARED
))
2483 put_futex_key(&q
->key
);
2494 put_futex_key(&q
->key
);
2498 static int futex_wait(u32 __user
*uaddr
, unsigned int flags
, u32 val
,
2499 ktime_t
*abs_time
, u32 bitset
)
2501 struct hrtimer_sleeper timeout
, *to
= NULL
;
2502 struct restart_block
*restart
;
2503 struct futex_hash_bucket
*hb
;
2504 struct futex_q q
= futex_q_init
;
2514 hrtimer_init_on_stack(&to
->timer
, (flags
& FLAGS_CLOCKRT
) ?
2515 CLOCK_REALTIME
: CLOCK_MONOTONIC
,
2517 hrtimer_init_sleeper(to
, current
);
2518 hrtimer_set_expires_range_ns(&to
->timer
, *abs_time
,
2519 current
->timer_slack_ns
);
2524 * Prepare to wait on uaddr. On success, holds hb lock and increments
2527 ret
= futex_wait_setup(uaddr
, val
, flags
, &q
, &hb
);
2531 /* queue_me and wait for wakeup, timeout, or a signal. */
2532 futex_wait_queue_me(hb
, &q
, to
);
2534 /* If we were woken (and unqueued), we succeeded, whatever. */
2536 /* unqueue_me() drops q.key ref */
2537 if (!unqueue_me(&q
))
2540 if (to
&& !to
->task
)
2544 * We expect signal_pending(current), but we might be the
2545 * victim of a spurious wakeup as well.
2547 if (!signal_pending(current
))
2554 restart
= ¤t
->restart_block
;
2555 restart
->fn
= futex_wait_restart
;
2556 restart
->futex
.uaddr
= uaddr
;
2557 restart
->futex
.val
= val
;
2558 restart
->futex
.time
= *abs_time
;
2559 restart
->futex
.bitset
= bitset
;
2560 restart
->futex
.flags
= flags
| FLAGS_HAS_TIMEOUT
;
2562 ret
= -ERESTART_RESTARTBLOCK
;
2566 hrtimer_cancel(&to
->timer
);
2567 destroy_hrtimer_on_stack(&to
->timer
);
2573 static long futex_wait_restart(struct restart_block
*restart
)
2575 u32 __user
*uaddr
= restart
->futex
.uaddr
;
2576 ktime_t t
, *tp
= NULL
;
2578 if (restart
->futex
.flags
& FLAGS_HAS_TIMEOUT
) {
2579 t
= restart
->futex
.time
;
2582 restart
->fn
= do_no_restart_syscall
;
2584 return (long)futex_wait(uaddr
, restart
->futex
.flags
,
2585 restart
->futex
.val
, tp
, restart
->futex
.bitset
);
2590 * Userspace tried a 0 -> TID atomic transition of the futex value
2591 * and failed. The kernel side here does the whole locking operation:
2592 * if there are waiters then it will block as a consequence of relying
2593 * on rt-mutexes, it does PI, etc. (Due to races the kernel might see
2594 * a 0 value of the futex too.).
2596 * Also serves as futex trylock_pi()'ing, and due semantics.
2598 static int futex_lock_pi(u32 __user
*uaddr
, unsigned int flags
,
2599 ktime_t
*time
, int trylock
)
2601 struct hrtimer_sleeper timeout
, *to
= NULL
;
2602 struct futex_pi_state
*pi_state
= NULL
;
2603 struct rt_mutex_waiter rt_waiter
;
2604 struct futex_hash_bucket
*hb
;
2605 struct futex_q q
= futex_q_init
;
2608 if (refill_pi_state_cache())
2613 hrtimer_init_on_stack(&to
->timer
, CLOCK_REALTIME
,
2615 hrtimer_init_sleeper(to
, current
);
2616 hrtimer_set_expires(&to
->timer
, *time
);
2620 ret
= get_futex_key(uaddr
, flags
& FLAGS_SHARED
, &q
.key
, VERIFY_WRITE
);
2621 if (unlikely(ret
!= 0))
2625 hb
= queue_lock(&q
);
2627 ret
= futex_lock_pi_atomic(uaddr
, hb
, &q
.key
, &q
.pi_state
, current
, 0);
2628 if (unlikely(ret
)) {
2630 * Atomic work succeeded and we got the lock,
2631 * or failed. Either way, we do _not_ block.
2635 /* We got the lock. */
2637 goto out_unlock_put_key
;
2642 * Two reasons for this:
2643 * - Task is exiting and we just wait for the
2645 * - The user space value changed.
2648 put_futex_key(&q
.key
);
2652 goto out_unlock_put_key
;
2656 WARN_ON(!q
.pi_state
);
2659 * Only actually queue now that the atomic ops are done:
2664 ret
= rt_mutex_futex_trylock(&q
.pi_state
->pi_mutex
);
2665 /* Fixup the trylock return value: */
2666 ret
= ret
? 0 : -EWOULDBLOCK
;
2670 rt_mutex_init_waiter(&rt_waiter
);
2673 * On PREEMPT_RT_FULL, when hb->lock becomes an rt_mutex, we must not
2674 * hold it while doing rt_mutex_start_proxy(), because then it will
2675 * include hb->lock in the blocking chain, even through we'll not in
2676 * fact hold it while blocking. This will lead it to report -EDEADLK
2677 * and BUG when futex_unlock_pi() interleaves with this.
2679 * Therefore acquire wait_lock while holding hb->lock, but drop the
2680 * latter before calling rt_mutex_start_proxy_lock(). This still fully
2681 * serializes against futex_unlock_pi() as that does the exact same
2682 * lock handoff sequence.
2684 raw_spin_lock_irq(&q
.pi_state
->pi_mutex
.wait_lock
);
2685 spin_unlock(q
.lock_ptr
);
2686 ret
= __rt_mutex_start_proxy_lock(&q
.pi_state
->pi_mutex
, &rt_waiter
, current
);
2687 raw_spin_unlock_irq(&q
.pi_state
->pi_mutex
.wait_lock
);
2693 spin_lock(q
.lock_ptr
);
2699 hrtimer_start_expires(&to
->timer
, HRTIMER_MODE_ABS
);
2701 ret
= rt_mutex_wait_proxy_lock(&q
.pi_state
->pi_mutex
, to
, &rt_waiter
);
2703 spin_lock(q
.lock_ptr
);
2705 * If we failed to acquire the lock (signal/timeout), we must
2706 * first acquire the hb->lock before removing the lock from the
2707 * rt_mutex waitqueue, such that we can keep the hb and rt_mutex
2708 * wait lists consistent.
2710 * In particular; it is important that futex_unlock_pi() can not
2711 * observe this inconsistency.
2713 if (ret
&& !rt_mutex_cleanup_proxy_lock(&q
.pi_state
->pi_mutex
, &rt_waiter
))
2718 * Fixup the pi_state owner and possibly acquire the lock if we
2721 res
= fixup_owner(uaddr
, &q
, !ret
);
2723 * If fixup_owner() returned an error, proprogate that. If it acquired
2724 * the lock, clear our -ETIMEDOUT or -EINTR.
2727 ret
= (res
< 0) ? res
: 0;
2730 * If fixup_owner() faulted and was unable to handle the fault, unlock
2731 * it and return the fault to userspace.
2733 if (ret
&& (rt_mutex_owner(&q
.pi_state
->pi_mutex
) == current
)) {
2734 pi_state
= q
.pi_state
;
2735 get_pi_state(pi_state
);
2738 /* Unqueue and drop the lock */
2742 rt_mutex_futex_unlock(&pi_state
->pi_mutex
);
2743 put_pi_state(pi_state
);
2752 put_futex_key(&q
.key
);
2755 hrtimer_cancel(&to
->timer
);
2756 destroy_hrtimer_on_stack(&to
->timer
);
2758 return ret
!= -EINTR
? ret
: -ERESTARTNOINTR
;
2763 ret
= fault_in_user_writeable(uaddr
);
2767 if (!(flags
& FLAGS_SHARED
))
2770 put_futex_key(&q
.key
);
2775 * Userspace attempted a TID -> 0 atomic transition, and failed.
2776 * This is the in-kernel slowpath: we look up the PI state (if any),
2777 * and do the rt-mutex unlock.
2779 static int futex_unlock_pi(u32 __user
*uaddr
, unsigned int flags
)
2781 u32
uninitialized_var(curval
), uval
, vpid
= task_pid_vnr(current
);
2782 union futex_key key
= FUTEX_KEY_INIT
;
2783 struct futex_hash_bucket
*hb
;
2784 struct futex_q
*top_waiter
;
2788 if (get_user(uval
, uaddr
))
2791 * We release only a lock we actually own:
2793 if ((uval
& FUTEX_TID_MASK
) != vpid
)
2796 ret
= get_futex_key(uaddr
, flags
& FLAGS_SHARED
, &key
, VERIFY_WRITE
);
2800 hb
= hash_futex(&key
);
2801 spin_lock(&hb
->lock
);
2804 * Check waiters first. We do not trust user space values at
2805 * all and we at least want to know if user space fiddled
2806 * with the futex value instead of blindly unlocking.
2808 top_waiter
= futex_top_waiter(hb
, &key
);
2810 struct futex_pi_state
*pi_state
= top_waiter
->pi_state
;
2817 * If current does not own the pi_state then the futex is
2818 * inconsistent and user space fiddled with the futex value.
2820 if (pi_state
->owner
!= current
)
2823 get_pi_state(pi_state
);
2825 * By taking wait_lock while still holding hb->lock, we ensure
2826 * there is no point where we hold neither; and therefore
2827 * wake_futex_pi() must observe a state consistent with what we
2830 raw_spin_lock_irq(&pi_state
->pi_mutex
.wait_lock
);
2831 spin_unlock(&hb
->lock
);
2833 /* drops pi_state->pi_mutex.wait_lock */
2834 ret
= wake_futex_pi(uaddr
, uval
, pi_state
);
2836 put_pi_state(pi_state
);
2839 * Success, we're done! No tricky corner cases.
2844 * The atomic access to the futex value generated a
2845 * pagefault, so retry the user-access and the wakeup:
2850 * A unconditional UNLOCK_PI op raced against a waiter
2851 * setting the FUTEX_WAITERS bit. Try again.
2853 if (ret
== -EAGAIN
) {
2854 put_futex_key(&key
);
2858 * wake_futex_pi has detected invalid state. Tell user
2865 * We have no kernel internal state, i.e. no waiters in the
2866 * kernel. Waiters which are about to queue themselves are stuck
2867 * on hb->lock. So we can safely ignore them. We do neither
2868 * preserve the WAITERS bit not the OWNER_DIED one. We are the
2871 if (cmpxchg_futex_value_locked(&curval
, uaddr
, uval
, 0)) {
2872 spin_unlock(&hb
->lock
);
2877 * If uval has changed, let user space handle it.
2879 ret
= (curval
== uval
) ? 0 : -EAGAIN
;
2882 spin_unlock(&hb
->lock
);
2884 put_futex_key(&key
);
2888 put_futex_key(&key
);
2890 ret
= fault_in_user_writeable(uaddr
);
2898 * handle_early_requeue_pi_wakeup() - Detect early wakeup on the initial futex
2899 * @hb: the hash_bucket futex_q was original enqueued on
2900 * @q: the futex_q woken while waiting to be requeued
2901 * @key2: the futex_key of the requeue target futex
2902 * @timeout: the timeout associated with the wait (NULL if none)
2904 * Detect if the task was woken on the initial futex as opposed to the requeue
2905 * target futex. If so, determine if it was a timeout or a signal that caused
2906 * the wakeup and return the appropriate error code to the caller. Must be
2907 * called with the hb lock held.
2910 * - 0 = no early wakeup detected;
2911 * - <0 = -ETIMEDOUT or -ERESTARTNOINTR
2914 int handle_early_requeue_pi_wakeup(struct futex_hash_bucket
*hb
,
2915 struct futex_q
*q
, union futex_key
*key2
,
2916 struct hrtimer_sleeper
*timeout
)
2921 * With the hb lock held, we avoid races while we process the wakeup.
2922 * We only need to hold hb (and not hb2) to ensure atomicity as the
2923 * wakeup code can't change q.key from uaddr to uaddr2 if we hold hb.
2924 * It can't be requeued from uaddr2 to something else since we don't
2925 * support a PI aware source futex for requeue.
2927 if (!match_futex(&q
->key
, key2
)) {
2928 WARN_ON(q
->lock_ptr
&& (&hb
->lock
!= q
->lock_ptr
));
2930 * We were woken prior to requeue by a timeout or a signal.
2931 * Unqueue the futex_q and determine which it was.
2933 plist_del(&q
->list
, &hb
->chain
);
2936 /* Handle spurious wakeups gracefully */
2938 if (timeout
&& !timeout
->task
)
2940 else if (signal_pending(current
))
2941 ret
= -ERESTARTNOINTR
;
2947 * futex_wait_requeue_pi() - Wait on uaddr and take uaddr2
2948 * @uaddr: the futex we initially wait on (non-pi)
2949 * @flags: futex flags (FLAGS_SHARED, FLAGS_CLOCKRT, etc.), they must be
2950 * the same type, no requeueing from private to shared, etc.
2951 * @val: the expected value of uaddr
2952 * @abs_time: absolute timeout
2953 * @bitset: 32 bit wakeup bitset set by userspace, defaults to all
2954 * @uaddr2: the pi futex we will take prior to returning to user-space
2956 * The caller will wait on uaddr and will be requeued by futex_requeue() to
2957 * uaddr2 which must be PI aware and unique from uaddr. Normal wakeup will wake
2958 * on uaddr2 and complete the acquisition of the rt_mutex prior to returning to
2959 * userspace. This ensures the rt_mutex maintains an owner when it has waiters;
2960 * without one, the pi logic would not know which task to boost/deboost, if
2961 * there was a need to.
2963 * We call schedule in futex_wait_queue_me() when we enqueue and return there
2964 * via the following--
2965 * 1) wakeup on uaddr2 after an atomic lock acquisition by futex_requeue()
2966 * 2) wakeup on uaddr2 after a requeue
2970 * If 3, cleanup and return -ERESTARTNOINTR.
2972 * If 2, we may then block on trying to take the rt_mutex and return via:
2973 * 5) successful lock
2976 * 8) other lock acquisition failure
2978 * If 6, return -EWOULDBLOCK (restarting the syscall would do the same).
2980 * If 4 or 7, we cleanup and return with -ETIMEDOUT.
2986 static int futex_wait_requeue_pi(u32 __user
*uaddr
, unsigned int flags
,
2987 u32 val
, ktime_t
*abs_time
, u32 bitset
,
2990 struct hrtimer_sleeper timeout
, *to
= NULL
;
2991 struct futex_pi_state
*pi_state
= NULL
;
2992 struct rt_mutex_waiter rt_waiter
;
2993 struct futex_hash_bucket
*hb
;
2994 union futex_key key2
= FUTEX_KEY_INIT
;
2995 struct futex_q q
= futex_q_init
;
2998 if (uaddr
== uaddr2
)
3006 hrtimer_init_on_stack(&to
->timer
, (flags
& FLAGS_CLOCKRT
) ?
3007 CLOCK_REALTIME
: CLOCK_MONOTONIC
,
3009 hrtimer_init_sleeper(to
, current
);
3010 hrtimer_set_expires_range_ns(&to
->timer
, *abs_time
,
3011 current
->timer_slack_ns
);
3015 * The waiter is allocated on our stack, manipulated by the requeue
3016 * code while we sleep on uaddr.
3018 rt_mutex_init_waiter(&rt_waiter
);
3020 ret
= get_futex_key(uaddr2
, flags
& FLAGS_SHARED
, &key2
, VERIFY_WRITE
);
3021 if (unlikely(ret
!= 0))
3025 q
.rt_waiter
= &rt_waiter
;
3026 q
.requeue_pi_key
= &key2
;
3029 * Prepare to wait on uaddr. On success, increments q.key (key1) ref
3032 ret
= futex_wait_setup(uaddr
, val
, flags
, &q
, &hb
);
3037 * The check above which compares uaddrs is not sufficient for
3038 * shared futexes. We need to compare the keys:
3040 if (match_futex(&q
.key
, &key2
)) {
3046 /* Queue the futex_q, drop the hb lock, wait for wakeup. */
3047 futex_wait_queue_me(hb
, &q
, to
);
3049 spin_lock(&hb
->lock
);
3050 ret
= handle_early_requeue_pi_wakeup(hb
, &q
, &key2
, to
);
3051 spin_unlock(&hb
->lock
);
3056 * In order for us to be here, we know our q.key == key2, and since
3057 * we took the hb->lock above, we also know that futex_requeue() has
3058 * completed and we no longer have to concern ourselves with a wakeup
3059 * race with the atomic proxy lock acquisition by the requeue code. The
3060 * futex_requeue dropped our key1 reference and incremented our key2
3064 /* Check if the requeue code acquired the second futex for us. */
3067 * Got the lock. We might not be the anticipated owner if we
3068 * did a lock-steal - fix up the PI-state in that case.
3070 if (q
.pi_state
&& (q
.pi_state
->owner
!= current
)) {
3071 spin_lock(q
.lock_ptr
);
3072 ret
= fixup_pi_state_owner(uaddr2
, &q
, current
);
3073 if (ret
&& rt_mutex_owner(&q
.pi_state
->pi_mutex
) == current
) {
3074 pi_state
= q
.pi_state
;
3075 get_pi_state(pi_state
);
3078 * Drop the reference to the pi state which
3079 * the requeue_pi() code acquired for us.
3081 put_pi_state(q
.pi_state
);
3082 spin_unlock(q
.lock_ptr
);
3085 struct rt_mutex
*pi_mutex
;
3088 * We have been woken up by futex_unlock_pi(), a timeout, or a
3089 * signal. futex_unlock_pi() will not destroy the lock_ptr nor
3092 WARN_ON(!q
.pi_state
);
3093 pi_mutex
= &q
.pi_state
->pi_mutex
;
3094 ret
= rt_mutex_wait_proxy_lock(pi_mutex
, to
, &rt_waiter
);
3096 spin_lock(q
.lock_ptr
);
3097 if (ret
&& !rt_mutex_cleanup_proxy_lock(pi_mutex
, &rt_waiter
))
3100 debug_rt_mutex_free_waiter(&rt_waiter
);
3102 * Fixup the pi_state owner and possibly acquire the lock if we
3105 res
= fixup_owner(uaddr2
, &q
, !ret
);
3107 * If fixup_owner() returned an error, proprogate that. If it
3108 * acquired the lock, clear -ETIMEDOUT or -EINTR.
3111 ret
= (res
< 0) ? res
: 0;
3114 * If fixup_pi_state_owner() faulted and was unable to handle
3115 * the fault, unlock the rt_mutex and return the fault to
3118 if (ret
&& rt_mutex_owner(&q
.pi_state
->pi_mutex
) == current
) {
3119 pi_state
= q
.pi_state
;
3120 get_pi_state(pi_state
);
3123 /* Unqueue and drop the lock. */
3128 rt_mutex_futex_unlock(&pi_state
->pi_mutex
);
3129 put_pi_state(pi_state
);
3132 if (ret
== -EINTR
) {
3134 * We've already been requeued, but cannot restart by calling
3135 * futex_lock_pi() directly. We could restart this syscall, but
3136 * it would detect that the user space "val" changed and return
3137 * -EWOULDBLOCK. Save the overhead of the restart and return
3138 * -EWOULDBLOCK directly.
3144 put_futex_key(&q
.key
);
3146 put_futex_key(&key2
);
3150 hrtimer_cancel(&to
->timer
);
3151 destroy_hrtimer_on_stack(&to
->timer
);
3157 * Support for robust futexes: the kernel cleans up held futexes at
3160 * Implementation: user-space maintains a per-thread list of locks it
3161 * is holding. Upon do_exit(), the kernel carefully walks this list,
3162 * and marks all locks that are owned by this thread with the
3163 * FUTEX_OWNER_DIED bit, and wakes up a waiter (if any). The list is
3164 * always manipulated with the lock held, so the list is private and
3165 * per-thread. Userspace also maintains a per-thread 'list_op_pending'
3166 * field, to allow the kernel to clean up if the thread dies after
3167 * acquiring the lock, but just before it could have added itself to
3168 * the list. There can only be one such pending lock.
3172 * sys_set_robust_list() - Set the robust-futex list head of a task
3173 * @head: pointer to the list-head
3174 * @len: length of the list-head, as userspace expects
3176 SYSCALL_DEFINE2(set_robust_list
, struct robust_list_head __user
*, head
,
3179 if (!futex_cmpxchg_enabled
)
3182 * The kernel knows only one size for now:
3184 if (unlikely(len
!= sizeof(*head
)))
3187 current
->robust_list
= head
;
3193 * sys_get_robust_list() - Get the robust-futex list head of a task
3194 * @pid: pid of the process [zero for current task]
3195 * @head_ptr: pointer to a list-head pointer, the kernel fills it in
3196 * @len_ptr: pointer to a length field, the kernel fills in the header size
3198 SYSCALL_DEFINE3(get_robust_list
, int, pid
,
3199 struct robust_list_head __user
* __user
*, head_ptr
,
3200 size_t __user
*, len_ptr
)
3202 struct robust_list_head __user
*head
;
3204 struct task_struct
*p
;
3206 if (!futex_cmpxchg_enabled
)
3215 p
= find_task_by_vpid(pid
);
3221 if (!ptrace_may_access(p
, PTRACE_MODE_READ_REALCREDS
))
3224 head
= p
->robust_list
;
3227 if (put_user(sizeof(*head
), len_ptr
))
3229 return put_user(head
, head_ptr
);
3238 * Process a futex-list entry, check whether it's owned by the
3239 * dying task, and do notification if so:
3241 int handle_futex_death(u32 __user
*uaddr
, struct task_struct
*curr
, int pi
)
3243 u32 uval
, uninitialized_var(nval
), mval
;
3246 if (get_user(uval
, uaddr
))
3249 if ((uval
& FUTEX_TID_MASK
) == task_pid_vnr(curr
)) {
3251 * Ok, this dying thread is truly holding a futex
3252 * of interest. Set the OWNER_DIED bit atomically
3253 * via cmpxchg, and if the value had FUTEX_WAITERS
3254 * set, wake up a waiter (if any). (We have to do a
3255 * futex_wake() even if OWNER_DIED is already set -
3256 * to handle the rare but possible case of recursive
3257 * thread-death.) The rest of the cleanup is done in
3260 mval
= (uval
& FUTEX_WAITERS
) | FUTEX_OWNER_DIED
;
3262 * We are not holding a lock here, but we want to have
3263 * the pagefault_disable/enable() protection because
3264 * we want to handle the fault gracefully. If the
3265 * access fails we try to fault in the futex with R/W
3266 * verification via get_user_pages. get_user() above
3267 * does not guarantee R/W access. If that fails we
3268 * give up and leave the futex locked.
3270 if (cmpxchg_futex_value_locked(&nval
, uaddr
, uval
, mval
)) {
3271 if (fault_in_user_writeable(uaddr
))
3279 * Wake robust non-PI futexes here. The wakeup of
3280 * PI futexes happens in exit_pi_state():
3282 if (!pi
&& (uval
& FUTEX_WAITERS
))
3283 futex_wake(uaddr
, 1, 1, FUTEX_BITSET_MATCH_ANY
);
3289 * Fetch a robust-list pointer. Bit 0 signals PI futexes:
3291 static inline int fetch_robust_entry(struct robust_list __user
**entry
,
3292 struct robust_list __user
* __user
*head
,
3295 unsigned long uentry
;
3297 if (get_user(uentry
, (unsigned long __user
*)head
))
3300 *entry
= (void __user
*)(uentry
& ~1UL);
3307 * Walk curr->robust_list (very carefully, it's a userspace list!)
3308 * and mark any locks found there dead, and notify any waiters.
3310 * We silently return on any sign of list-walking problem.
3312 void exit_robust_list(struct task_struct
*curr
)
3314 struct robust_list_head __user
*head
= curr
->robust_list
;
3315 struct robust_list __user
*entry
, *next_entry
, *pending
;
3316 unsigned int limit
= ROBUST_LIST_LIMIT
, pi
, pip
;
3317 unsigned int uninitialized_var(next_pi
);
3318 unsigned long futex_offset
;
3321 if (!futex_cmpxchg_enabled
)
3325 * Fetch the list head (which was registered earlier, via
3326 * sys_set_robust_list()):
3328 if (fetch_robust_entry(&entry
, &head
->list
.next
, &pi
))
3331 * Fetch the relative futex offset:
3333 if (get_user(futex_offset
, &head
->futex_offset
))
3336 * Fetch any possibly pending lock-add first, and handle it
3339 if (fetch_robust_entry(&pending
, &head
->list_op_pending
, &pip
))
3342 next_entry
= NULL
; /* avoid warning with gcc */
3343 while (entry
!= &head
->list
) {
3345 * Fetch the next entry in the list before calling
3346 * handle_futex_death:
3348 rc
= fetch_robust_entry(&next_entry
, &entry
->next
, &next_pi
);
3350 * A pending lock might already be on the list, so
3351 * don't process it twice:
3353 if (entry
!= pending
)
3354 if (handle_futex_death((void __user
*)entry
+ futex_offset
,
3362 * Avoid excessively long or circular lists:
3371 handle_futex_death((void __user
*)pending
+ futex_offset
,
3375 long do_futex(u32 __user
*uaddr
, int op
, u32 val
, ktime_t
*timeout
,
3376 u32 __user
*uaddr2
, u32 val2
, u32 val3
)
3378 int cmd
= op
& FUTEX_CMD_MASK
;
3379 unsigned int flags
= 0;
3381 if (!(op
& FUTEX_PRIVATE_FLAG
))
3382 flags
|= FLAGS_SHARED
;
3384 if (op
& FUTEX_CLOCK_REALTIME
) {
3385 flags
|= FLAGS_CLOCKRT
;
3386 if (cmd
!= FUTEX_WAIT
&& cmd
!= FUTEX_WAIT_BITSET
&& \
3387 cmd
!= FUTEX_WAIT_REQUEUE_PI
)
3393 case FUTEX_UNLOCK_PI
:
3394 case FUTEX_TRYLOCK_PI
:
3395 case FUTEX_WAIT_REQUEUE_PI
:
3396 case FUTEX_CMP_REQUEUE_PI
:
3397 if (!futex_cmpxchg_enabled
)
3403 val3
= FUTEX_BITSET_MATCH_ANY
;
3404 case FUTEX_WAIT_BITSET
:
3405 return futex_wait(uaddr
, flags
, val
, timeout
, val3
);
3407 val3
= FUTEX_BITSET_MATCH_ANY
;
3408 case FUTEX_WAKE_BITSET
:
3409 return futex_wake(uaddr
, flags
, val
, val3
);
3411 return futex_requeue(uaddr
, flags
, uaddr2
, val
, val2
, NULL
, 0);
3412 case FUTEX_CMP_REQUEUE
:
3413 return futex_requeue(uaddr
, flags
, uaddr2
, val
, val2
, &val3
, 0);
3415 return futex_wake_op(uaddr
, flags
, uaddr2
, val
, val2
, val3
);
3417 return futex_lock_pi(uaddr
, flags
, timeout
, 0);
3418 case FUTEX_UNLOCK_PI
:
3419 return futex_unlock_pi(uaddr
, flags
);
3420 case FUTEX_TRYLOCK_PI
:
3421 return futex_lock_pi(uaddr
, flags
, NULL
, 1);
3422 case FUTEX_WAIT_REQUEUE_PI
:
3423 val3
= FUTEX_BITSET_MATCH_ANY
;
3424 return futex_wait_requeue_pi(uaddr
, flags
, val
, timeout
, val3
,
3426 case FUTEX_CMP_REQUEUE_PI
:
3427 return futex_requeue(uaddr
, flags
, uaddr2
, val
, val2
, &val3
, 1);
3433 SYSCALL_DEFINE6(futex
, u32 __user
*, uaddr
, int, op
, u32
, val
,
3434 struct timespec __user
*, utime
, u32 __user
*, uaddr2
,
3438 ktime_t t
, *tp
= NULL
;
3440 int cmd
= op
& FUTEX_CMD_MASK
;
3442 if (utime
&& (cmd
== FUTEX_WAIT
|| cmd
== FUTEX_LOCK_PI
||
3443 cmd
== FUTEX_WAIT_BITSET
||
3444 cmd
== FUTEX_WAIT_REQUEUE_PI
)) {
3445 if (unlikely(should_fail_futex(!(op
& FUTEX_PRIVATE_FLAG
))))
3447 if (copy_from_user(&ts
, utime
, sizeof(ts
)) != 0)
3449 if (!timespec_valid(&ts
))
3452 t
= timespec_to_ktime(ts
);
3453 if (cmd
== FUTEX_WAIT
)
3454 t
= ktime_add_safe(ktime_get(), t
);
3458 * requeue parameter in 'utime' if cmd == FUTEX_*_REQUEUE_*.
3459 * number of waiters to wake in 'utime' if cmd == FUTEX_WAKE_OP.
3461 if (cmd
== FUTEX_REQUEUE
|| cmd
== FUTEX_CMP_REQUEUE
||
3462 cmd
== FUTEX_CMP_REQUEUE_PI
|| cmd
== FUTEX_WAKE_OP
)
3463 val2
= (u32
) (unsigned long) utime
;
3465 return do_futex(uaddr
, op
, val
, tp
, uaddr2
, val2
, val3
);
3468 static void __init
futex_detect_cmpxchg(void)
3470 #ifndef CONFIG_HAVE_FUTEX_CMPXCHG
3474 * This will fail and we want it. Some arch implementations do
3475 * runtime detection of the futex_atomic_cmpxchg_inatomic()
3476 * functionality. We want to know that before we call in any
3477 * of the complex code paths. Also we want to prevent
3478 * registration of robust lists in that case. NULL is
3479 * guaranteed to fault and we get -EFAULT on functional
3480 * implementation, the non-functional ones will return
3483 if (cmpxchg_futex_value_locked(&curval
, NULL
, 0, 0) == -EFAULT
)
3484 futex_cmpxchg_enabled
= 1;
3488 static int __init
futex_init(void)
3490 unsigned int futex_shift
;
3493 #if CONFIG_BASE_SMALL
3494 futex_hashsize
= 16;
3496 futex_hashsize
= roundup_pow_of_two(256 * num_possible_cpus());
3499 futex_queues
= alloc_large_system_hash("futex", sizeof(*futex_queues
),
3501 futex_hashsize
< 256 ? HASH_SMALL
: 0,
3503 futex_hashsize
, futex_hashsize
);
3504 futex_hashsize
= 1UL << futex_shift
;
3506 futex_detect_cmpxchg();
3508 for (i
= 0; i
< futex_hashsize
; i
++) {
3509 atomic_set(&futex_queues
[i
].waiters
, 0);
3510 plist_head_init(&futex_queues
[i
].chain
);
3511 spin_lock_init(&futex_queues
[i
].lock
);
3516 core_initcall(futex_init
);