// SPDX-License-Identifier: GPL-2.0-or-later

  /*
   *  Fast Userspace Mutexes (which I call "Futexes!").
   *  (C) Rusty Russell, IBM 2002
   *
   *  Generalized futexes, futex requeueing, misc fixes by Ingo Molnar
   *  (C) Copyright 2003 Red Hat Inc, All Rights Reserved
   *
   *  Removed page pinning, fix privately mapped COW pages and other cleanups
   *  (C) Copyright 2003, 2004 Jamie Lokier
   *

   *  Robust futex support started by Ingo Molnar
   *  (C) Copyright 2006 Red Hat Inc, All Rights Reserved
   *  Thanks to Thomas Gleixner for suggestions, analysis and fixes.
   *

   *  PI-futex support started by Ingo Molnar and Thomas Gleixner
   *  Copyright (C) 2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
   *  Copyright (C) 2006 Timesys Corp., Thomas Gleixner <tglx@timesys.com>
   *

   *  PRIVATE futexes by Eric Dumazet
   *  Copyright (C) 2007 Eric Dumazet <dada1@cosmosbay.com>
   *

   *  Requeue-PI support by Darren Hart <dvhltc@us.ibm.com>
   *  Copyright (C) IBM Corporation, 2009
   *  Thanks to Thomas Gleixner for conceptual design and careful reviews.
   *

   *  Thanks to Ben LaHaise for yelling "hashed waitqueues" loudly
   *  enough at me, Linus for the original (flawed) idea, Matthew
   *  Kirkwood for proof-of-concept implementation.
   *
   *  "The futexes are also cursed."
   *  "But they come in a choice of three flavours!"

   */

  #include <linux/compat.h>

  #include <linux/jhash.h>

  #include <linux/pagemap.h>
  #include <linux/syscalls.h>

  #include <linux/hugetlb.h>

  #include <linux/freezer.h>

  #include <linux/memblock.h>

  #include <linux/fault-inject.h>

  #include <linux/time_namespace.h>

  #include <asm/futex.h>

  #include "locking/rtmutex_common.h"

  #include <trace/hooks/futex.h>

  /*

   * READ this before attempting to hack on futexes!
   *
   * Basic futex operation and ordering guarantees
   * =============================================

   *
   * The waiter reads the futex value in user space and calls
   * futex_wait(). This function computes the hash bucket and acquires
   * the hash bucket lock. After that it reads the futex user space value

   * again and verifies that the data has not changed. If it has not changed
   * it enqueues itself into the hash bucket, releases the hash bucket lock
   * and schedules.

   *
   * The waker side modifies the user space value of the futex and calls

   * futex_wake(). This function computes the hash bucket and acquires the
   * hash bucket lock. Then it looks for waiters on that futex in the hash
   * bucket and wakes them.

   *

   * In futex wake up scenarios where no tasks are blocked on a futex, taking
   * the hb spinlock can be avoided and simply return. In order for this
   * optimization to work, ordering guarantees must exist so that the waiter
   * being added to the list is acknowledged when the list is concurrently being
   * checked by the waker, avoiding scenarios like the following:

   *
   * CPU 0                               CPU 1
   * val = *futex;
   * sys_futex(WAIT, futex, val);
   *   futex_wait(futex, val);
   *   uval = *futex;
   *                                     *futex = newval;
   *                                     sys_futex(WAKE, futex);
   *                                       futex_wake(futex);
   *                                       if (queue_empty())
   *                                         return;
   *   if (uval == val)
   *      lock(hash_bucket(futex));
   *      queue();
   *     unlock(hash_bucket(futex));
   *     schedule();
   *
   * This would cause the waiter on CPU 0 to wait forever because it
   * missed the transition of the user space value from val to newval
   * and the waker did not find the waiter in the hash bucket queue.

   *

   * The correct serialization ensures that a waiter either observes
   * the changed user space value before blocking or is woken by a
   * concurrent waker:
   *
   * CPU 0                                 CPU 1

   * val = *futex;
   * sys_futex(WAIT, futex, val);
   *   futex_wait(futex, val);

   *

   *   waiters++; (a)

   *   smp_mb(); (A) <-- paired with -.
   *                                  |
   *   lock(hash_bucket(futex));      |
   *                                  |
   *   uval = *futex;                 |
   *                                  |        *futex = newval;
   *                                  |        sys_futex(WAKE, futex);
   *                                  |          futex_wake(futex);
   *                                  |
   *                                  `--------> smp_mb(); (B)

   *   if (uval == val)

   *     queue();

   *     unlock(hash_bucket(futex));

   *     schedule();                         if (waiters)
   *                                           lock(hash_bucket(futex));

   *   else                                    wake_waiters(futex);
   *     waiters--; (b)                        unlock(hash_bucket(futex));

   *

   * Where (A) orders the waiters increment and the futex value read through
   * atomic operations (see hb_waiters_inc) and where (B) orders the write

   * to futex and the waiters read (see hb_waiters_pending()).

   *
   * This yields the following case (where X:=waiters, Y:=futex):
   *
   *	X = Y = 0
   *
   *	w[X]=1		w[Y]=1
   *	MB		MB
   *	r[Y]=y		r[X]=x
   *
   * Which guarantees that x==0 && y==0 is impossible; which translates back into
   * the guarantee that we cannot both miss the futex variable change and the
   * enqueue.

   *
   * Note that a new waiter is accounted for in (a) even when it is possible that
   * the wait call can return error, in which case we backtrack from it in (b).
   * Refer to the comment in queue_lock().
   *
   * Similarly, in order to account for waiters being requeued on another
   * address we always increment the waiters for the destination bucket before
   * acquiring the lock. It then decrements them again  after releasing it -
   * the code that actually moves the futex(es) between hash buckets (requeue_futex)
   * will do the additional required waiter count housekeeping. This is done for
   * double_lock_hb() and double_unlock_hb(), respectively.

   */

  #ifdef CONFIG_HAVE_FUTEX_CMPXCHG
  #define futex_cmpxchg_enabled 1
  #else
  static int  __read_mostly futex_cmpxchg_enabled;

  #endif

  /*

   * Futex flags used to encode options to functions and preserve them across
   * restarts.
   */

  #ifdef CONFIG_MMU
  # define FLAGS_SHARED		0x01
  #else
  /*
   * NOMMU does not have per process address space. Let the compiler optimize
   * code away.
   */
  # define FLAGS_SHARED		0x00
  #endif

  #define FLAGS_CLOCKRT		0x02
  #define FLAGS_HAS_TIMEOUT	0x04
  
  /*

   * Priority Inheritance state:
   */
  struct futex_pi_state {
  	/*
  	 * list of 'owned' pi_state instances - these have to be
  	 * cleaned up in do_exit() if the task exits prematurely:
  	 */
  	struct list_head list;
  
  	/*
  	 * The PI object:
  	 */
  	struct rt_mutex pi_mutex;
  
  	struct task_struct *owner;

  	refcount_t refcount;

  
  	union futex_key key;

  } __randomize_layout;

  /**
   * struct futex_q - The hashed futex queue entry, one per waiting task

   * @list:		priority-sorted list of tasks waiting on this futex

   * @task:		the task waiting on the futex
   * @lock_ptr:		the hash bucket lock
   * @key:		the key the futex is hashed on
   * @pi_state:		optional priority inheritance state
   * @rt_waiter:		rt_waiter storage for use with requeue_pi
   * @requeue_pi_key:	the requeue_pi target futex key
   * @bitset:		bitset for the optional bitmasked wakeup
   *

   * We use this hashed waitqueue, instead of a normal wait_queue_entry_t, so

   * we can wake only the relevant ones (hashed queues may be shared).
   *
   * A futex_q has a woken state, just like tasks have TASK_RUNNING.

   * It is considered woken when plist_node_empty(&q->list) || q->lock_ptr == 0.

   * The order of wakeup is always to make the first condition true, then

   * the second.
   *
   * PI futexes are typically woken before they are removed from the hash list via
   * the rt_mutex code. See unqueue_me_pi().

   */
  struct futex_q {

  	struct plist_node list;

  	struct task_struct *task;

  	spinlock_t *lock_ptr;

  	union futex_key key;

  	struct futex_pi_state *pi_state;

  	struct rt_mutex_waiter *rt_waiter;

  	union futex_key *requeue_pi_key;

  	u32 bitset;

  } __randomize_layout;

  static const struct futex_q futex_q_init = {
  	/* list gets initialized in queue_me()*/
  	.key = FUTEX_KEY_INIT,
  	.bitset = FUTEX_BITSET_MATCH_ANY
  };

  /*

   * Hash buckets are shared by all the futex_keys that hash to the same
   * location.  Each key may have multiple futex_q structures, one for each task
   * waiting on a futex.

   */
  struct futex_hash_bucket {

  	atomic_t waiters;

  	spinlock_t lock;
  	struct plist_head chain;

  } ____cacheline_aligned_in_smp;

  /*
   * The base of the bucket array and its size are always used together
   * (after initialization only in hash_futex()), so ensure that they
   * reside in the same cacheline.
   */
  static struct {
  	struct futex_hash_bucket *queues;
  	unsigned long            hashsize;
  } __futex_data __read_mostly __aligned(2*sizeof(long));
  #define futex_queues   (__futex_data.queues)
  #define futex_hashsize (__futex_data.hashsize)

  /*
   * Fault injections for futexes.
   */
  #ifdef CONFIG_FAIL_FUTEX
  
  static struct {
  	struct fault_attr attr;

  	bool ignore_private;

  } fail_futex = {
  	.attr = FAULT_ATTR_INITIALIZER,

  	.ignore_private = false,

  };
  
  static int __init setup_fail_futex(char *str)
  {
  	return setup_fault_attr(&fail_futex.attr, str);
  }
  __setup("fail_futex=", setup_fail_futex);

  static bool should_fail_futex(bool fshared)

  {
  	if (fail_futex.ignore_private && !fshared)
  		return false;
  
  	return should_fail(&fail_futex.attr, 1);
  }
  
  #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
  
  static int __init fail_futex_debugfs(void)
  {
  	umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
  	struct dentry *dir;
  
  	dir = fault_create_debugfs_attr("fail_futex", NULL,
  					&fail_futex.attr);
  	if (IS_ERR(dir))
  		return PTR_ERR(dir);

  	debugfs_create_bool("ignore-private", mode, dir,
  			    &fail_futex.ignore_private);

  	return 0;
  }
  
  late_initcall(fail_futex_debugfs);
  
  #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
  
  #else
  static inline bool should_fail_futex(bool fshared)
  {
  	return false;
  }
  #endif /* CONFIG_FAIL_FUTEX */

  #ifdef CONFIG_COMPAT
  static void compat_exit_robust_list(struct task_struct *curr);
  #else
  static inline void compat_exit_robust_list(struct task_struct *curr) { }
  #endif

  /*
   * Reflects a new waiter being added to the waitqueue.
   */
  static inline void hb_waiters_inc(struct futex_hash_bucket *hb)

  {
  #ifdef CONFIG_SMP

  	atomic_inc(&hb->waiters);

  	/*

  	 * Full barrier (A), see the ordering comment above.

  	 */

  	smp_mb__after_atomic();

  #endif
  }
  
  /*
   * Reflects a waiter being removed from the waitqueue by wakeup
   * paths.
   */
  static inline void hb_waiters_dec(struct futex_hash_bucket *hb)
  {
  #ifdef CONFIG_SMP
  	atomic_dec(&hb->waiters);
  #endif
  }

  static inline int hb_waiters_pending(struct futex_hash_bucket *hb)
  {
  #ifdef CONFIG_SMP

  	/*
  	 * Full barrier (B), see the ordering comment above.
  	 */
  	smp_mb();

  	return atomic_read(&hb->waiters);

  #else

  	return 1;

  #endif
  }

  /**
   * hash_futex - Return the hash bucket in the global hash
   * @key:	Pointer to the futex key for which the hash is calculated
   *
   * We hash on the keys returned from get_futex_key (see below) and return the
   * corresponding hash bucket in the global hash.

   */
  static struct futex_hash_bucket *hash_futex(union futex_key *key)
  {

  	u32 hash = jhash2((u32 *)key, offsetof(typeof(*key), both.offset) / 4,

  			  key->both.offset);

  	return &futex_queues[hash & (futex_hashsize - 1)];

  }

  
  /**
   * match_futex - Check whether two futex keys are equal
   * @key1:	Pointer to key1
   * @key2:	Pointer to key2
   *

   * Return 1 if two futex_keys are equal, 0 otherwise.
   */
  static inline int match_futex(union futex_key *key1, union futex_key *key2)
  {

  	return (key1 && key2
  		&& key1->both.word == key2->both.word

  		&& key1->both.ptr == key2->both.ptr
  		&& key1->both.offset == key2->both.offset);
  }

  enum futex_access {
  	FUTEX_READ,
  	FUTEX_WRITE
  };

  /**

   * futex_setup_timer - set up the sleeping hrtimer.
   * @time:	ptr to the given timeout value
   * @timeout:	the hrtimer_sleeper structure to be set up
   * @flags:	futex flags
   * @range_ns:	optional range in ns
   *
   * Return: Initialized hrtimer_sleeper structure or NULL if no timeout
   *	   value given
   */
  static inline struct hrtimer_sleeper *
  futex_setup_timer(ktime_t *time, struct hrtimer_sleeper *timeout,
  		  int flags, u64 range_ns)
  {
  	if (!time)
  		return NULL;

  	hrtimer_init_sleeper_on_stack(timeout, (flags & FLAGS_CLOCKRT) ?
  				      CLOCK_REALTIME : CLOCK_MONOTONIC,
  				      HRTIMER_MODE_ABS);

  	/*
  	 * If range_ns is 0, calling hrtimer_set_expires_range_ns() is
  	 * effectively the same as calling hrtimer_set_expires().
  	 */
  	hrtimer_set_expires_range_ns(&timeout->timer, *time, range_ns);
  
  	return timeout;
  }

  /*
   * Generate a machine wide unique identifier for this inode.
   *
   * This relies on u64 not wrapping in the life-time of the machine; which with
   * 1ns resolution means almost 585 years.
   *
   * This further relies on the fact that a well formed program will not unmap
   * the file while it has a (shared) futex waiting on it. This mapping will have
   * a file reference which pins the mount and inode.
   *
   * If for some reason an inode gets evicted and read back in again, it will get
   * a new sequence number and will _NOT_ match, even though it is the exact same
   * file.
   *
   * It is important that match_futex() will never have a false-positive, esp.
   * for PI futexes that can mess up the state. The above argues that false-negatives
   * are only possible for malformed programs.
   */
  static u64 get_inode_sequence_number(struct inode *inode)
  {
  	static atomic64_t i_seq;
  	u64 old;
  
  	/* Does the inode already have a sequence number? */
  	old = atomic64_read(&inode->i_sequence);
  	if (likely(old))
  		return old;
  
  	for (;;) {
  		u64 new = atomic64_add_return(1, &i_seq);
  		if (WARN_ON_ONCE(!new))
  			continue;
  
  		old = atomic64_cmpxchg_relaxed(&inode->i_sequence, 0, new);
  		if (old)
  			return old;
  		return new;
  	}
  }

  /**

   * get_futex_key() - Get parameters which are the keys for a futex
   * @uaddr:	virtual address of the futex

   * @fshared:	false for a PROCESS_PRIVATE futex, true for PROCESS_SHARED

   * @key:	address where result is stored.

   * @rw:		mapping needs to be read/write (values: FUTEX_READ,
   *              FUTEX_WRITE)

   *

   * Return: a negative error code or 0
   *

   * The key words are stored in @key on success.

   *

   * For shared mappings (when @fshared), the key is:

   *

   *   ( inode->i_sequence, page->index, offset_within_page )

   *

   * [ also see get_inode_sequence_number() ]
   *
   * For private mappings (or when !@fshared), the key is:

   *

   *   ( current->mm, address, 0 )
   *
   * This allows (cross process, where applicable) identification of the futex
   * without keeping the page pinned for the duration of the FUTEX_WAIT.

   *

   * lock_page() might sleep, the caller should not hold a spinlock.

   */

  static int get_futex_key(u32 __user *uaddr, bool fshared, union futex_key *key,
  			 enum futex_access rw)

  {

  	unsigned long address = (unsigned long)uaddr;

  	struct mm_struct *mm = current->mm;

  	struct page *page, *tail;

  	struct address_space *mapping;

  	int err, ro = 0;

  
  	/*
  	 * The futex address must be "naturally" aligned.
  	 */

  	key->both.offset = address % PAGE_SIZE;

  	if (unlikely((address % sizeof(u32)) != 0))

  		return -EINVAL;

  	address -= key->both.offset;

  	if (unlikely(!access_ok(uaddr, sizeof(u32))))

  		return -EFAULT;

  	if (unlikely(should_fail_futex(fshared)))
  		return -EFAULT;

  	/*

  	 * PROCESS_PRIVATE futexes are fast.
  	 * As the mm cannot disappear under us and the 'key' only needs
  	 * virtual address, we dont even have to find the underlying vma.
  	 * Note : We do have to check 'uaddr' is a valid user address,
  	 *        but access_ok() should be faster than find_vma()
  	 */
  	if (!fshared) {

  		key->private.mm = mm;
  		key->private.address = address;
  		return 0;
  	}

  again:

  	/* Ignore any VERIFY_READ mapping (futex common case) */

  	if (unlikely(should_fail_futex(true)))

  		return -EFAULT;

  	err = get_user_pages_fast(address, 1, FOLL_WRITE, &page);

  	/*
  	 * If write access is not required (eg. FUTEX_WAIT), try
  	 * and get read-only access.
  	 */

  	if (err == -EFAULT && rw == FUTEX_READ) {

  		err = get_user_pages_fast(address, 1, 0, &page);
  		ro = 1;
  	}

  	if (err < 0)
  		return err;

  	else
  		err = 0;

  	/*
  	 * The treatment of mapping from this point on is critical. The page
  	 * lock protects many things but in this context the page lock
  	 * stabilizes mapping, prevents inode freeing in the shared
  	 * file-backed region case and guards against movement to swap cache.
  	 *
  	 * Strictly speaking the page lock is not needed in all cases being
  	 * considered here and page lock forces unnecessarily serialization
  	 * From this point on, mapping will be re-verified if necessary and
  	 * page lock will be acquired only if it is unavoidable

  	 *
  	 * Mapping checks require the head page for any compound page so the
  	 * head page and mapping is looked up now. For anonymous pages, it
  	 * does not matter if the page splits in the future as the key is
  	 * based on the address. For filesystem-backed pages, the tail is
  	 * required as the index of the page determines the key. For
  	 * base pages, there is no tail page and tail == page.

  	 */

  	tail = page;

  	page = compound_head(page);
  	mapping = READ_ONCE(page->mapping);

  	/*

  	 * If page->mapping is NULL, then it cannot be a PageAnon

  	 * page; but it might be the ZERO_PAGE or in the gate area or
  	 * in a special mapping (all cases which we are happy to fail);
  	 * or it may have been a good file page when get_user_pages_fast
  	 * found it, but truncated or holepunched or subjected to
  	 * invalidate_complete_page2 before we got the page lock (also
  	 * cases which we are happy to fail).  And we hold a reference,
  	 * so refcount care in invalidate_complete_page's remove_mapping
  	 * prevents drop_caches from setting mapping to NULL beneath us.
  	 *
  	 * The case we do have to guard against is when memory pressure made
  	 * shmem_writepage move it from filecache to swapcache beneath us:

  	 * an unlikely race, but we do need to retry for page->mapping.

  	 */

  	if (unlikely(!mapping)) {
  		int shmem_swizzled;
  
  		/*
  		 * Page lock is required to identify which special case above
  		 * applies. If this is really a shmem page then the page lock
  		 * will prevent unexpected transitions.
  		 */
  		lock_page(page);
  		shmem_swizzled = PageSwapCache(page) || page->mapping;

  		unlock_page(page);
  		put_page(page);

  		if (shmem_swizzled)
  			goto again;

  		return -EFAULT;

  	}

  
  	/*
  	 * Private mappings are handled in a simple way.
  	 *

  	 * If the futex key is stored on an anonymous page, then the associated
  	 * object is the mm which is implicitly pinned by the calling process.
  	 *

  	 * NOTE: When userspace waits on a MAP_SHARED mapping, even if
  	 * it's a read-only handle, it's expected that futexes attach to

  	 * the object not the particular process.

  	 */

  	if (PageAnon(page)) {

  		/*
  		 * A RO anonymous page will never change and thus doesn't make
  		 * sense for futex operations.
  		 */

  		if (unlikely(should_fail_futex(true)) || ro) {

  			err = -EFAULT;
  			goto out;
  		}

  		key->both.offset |= FUT_OFF_MMSHARED; /* ref taken on mm */

  		key->private.mm = mm;

  		key->private.address = address;

  	} else {

  		struct inode *inode;
  
  		/*
  		 * The associated futex object in this case is the inode and
  		 * the page->mapping must be traversed. Ordinarily this should
  		 * be stabilised under page lock but it's not strictly
  		 * necessary in this case as we just want to pin the inode, not
  		 * update the radix tree or anything like that.
  		 *
  		 * The RCU read lock is taken as the inode is finally freed
  		 * under RCU. If the mapping still matches expectations then the
  		 * mapping->host can be safely accessed as being a valid inode.
  		 */
  		rcu_read_lock();
  
  		if (READ_ONCE(page->mapping) != mapping) {
  			rcu_read_unlock();
  			put_page(page);
  
  			goto again;
  		}
  
  		inode = READ_ONCE(mapping->host);
  		if (!inode) {
  			rcu_read_unlock();
  			put_page(page);
  
  			goto again;
  		}

  		key->both.offset |= FUT_OFF_INODE; /* inode-based key */

  		key->shared.i_seq = get_inode_sequence_number(inode);

  		key->shared.pgoff = basepage_index(tail);

  		rcu_read_unlock();

  	}

  out:

  	put_page(page);

  	return err;

  }

  /**
   * fault_in_user_writeable() - Fault in user address and verify RW access

   * @uaddr:	pointer to faulting user space address
   *
   * Slow path to fixup the fault we just took in the atomic write
   * access to @uaddr.
   *

   * We have no generic implementation of a non-destructive write to the

   * user address. We know that we faulted in the atomic pagefault
   * disabled section so we can as well avoid the #PF overhead by
   * calling get_user_pages() right away.
   */
  static int fault_in_user_writeable(u32 __user *uaddr)
  {

  	struct mm_struct *mm = current->mm;
  	int ret;

  	mmap_read_lock(mm);

  	ret = fixup_user_fault(mm, (unsigned long)uaddr,

  			       FAULT_FLAG_WRITE, NULL);

  	mmap_read_unlock(mm);

  	return ret < 0 ? ret : 0;
  }

  /**
   * futex_top_waiter() - Return the highest priority waiter on a futex

   * @hb:		the hash bucket the futex_q's reside in
   * @key:	the futex key (to distinguish it from other futex futex_q's)

   *
   * Must be called with the hb lock held.
   */
  static struct futex_q *futex_top_waiter(struct futex_hash_bucket *hb,
  					union futex_key *key)
  {
  	struct futex_q *this;
  
  	plist_for_each_entry(this, &hb->chain, list) {
  		if (match_futex(&this->key, key))
  			return this;
  	}
  	return NULL;
  }

  static int cmpxchg_futex_value_locked(u32 *curval, u32 __user *uaddr,
  				      u32 uval, u32 newval)

  {

  	int ret;

  
  	pagefault_disable();

  	ret = futex_atomic_cmpxchg_inatomic(curval, uaddr, uval, newval);

  	pagefault_enable();

  	return ret;

  }
  
  static int get_futex_value_locked(u32 *dest, u32 __user *from)

  {
  	int ret;

  	pagefault_disable();

  	ret = __get_user(*dest, from);

  	pagefault_enable();

  
  	return ret ? -EFAULT : 0;
  }

  
  /*
   * PI code:
   */
  static int refill_pi_state_cache(void)
  {
  	struct futex_pi_state *pi_state;
  
  	if (likely(current->pi_state_cache))
  		return 0;

  	pi_state = kzalloc(sizeof(*pi_state), GFP_KERNEL);

  
  	if (!pi_state)
  		return -ENOMEM;

  	INIT_LIST_HEAD(&pi_state->list);
  	/* pi_mutex gets initialized later */
  	pi_state->owner = NULL;

  	refcount_set(&pi_state->refcount, 1);

  	pi_state->key = FUTEX_KEY_INIT;

  
  	current->pi_state_cache = pi_state;
  
  	return 0;
  }

  static struct futex_pi_state *alloc_pi_state(void)

  {
  	struct futex_pi_state *pi_state = current->pi_state_cache;
  
  	WARN_ON(!pi_state);
  	current->pi_state_cache = NULL;
  
  	return pi_state;
  }

  static void get_pi_state(struct futex_pi_state *pi_state)
  {

  	WARN_ON_ONCE(!refcount_inc_not_zero(&pi_state->refcount));

  }

  /*

   * Drops a reference to the pi_state object and frees or caches it
   * when the last reference is gone.

   */

  static void put_pi_state(struct futex_pi_state *pi_state)

  {

  	if (!pi_state)
  		return;

  	if (!refcount_dec_and_test(&pi_state->refcount))

  		return;
  
  	/*
  	 * If pi_state->owner is NULL, the owner is most probably dying
  	 * and has cleaned up the pi_state already
  	 */
  	if (pi_state->owner) {

  		struct task_struct *owner;

  		unsigned long flags;

  		raw_spin_lock_irqsave(&pi_state->pi_mutex.wait_lock, flags);

  		owner = pi_state->owner;
  		if (owner) {
  			raw_spin_lock(&owner->pi_lock);
  			list_del_init(&pi_state->list);
  			raw_spin_unlock(&owner->pi_lock);
  		}
  		rt_mutex_proxy_unlock(&pi_state->pi_mutex, owner);

  		raw_spin_unlock_irqrestore(&pi_state->pi_mutex.wait_lock, flags);

  	}

  	if (current->pi_state_cache) {

  		kfree(pi_state);

  	} else {

  		/*
  		 * pi_state->list is already empty.
  		 * clear pi_state->owner.
  		 * refcount is at 0 - put it back to 1.
  		 */
  		pi_state->owner = NULL;

  		refcount_set(&pi_state->refcount, 1);

  		current->pi_state_cache = pi_state;
  	}
  }

  #ifdef CONFIG_FUTEX_PI

  /*
   * This task is holding PI mutexes at exit time => bad.
   * Kernel cleans up PI-state, but userspace is likely hosed.
   * (Robust-futex cleanup is separate and might save the day for userspace.)
   */

  static void exit_pi_state_list(struct task_struct *curr)

  {

  	struct list_head *next, *head = &curr->pi_state_list;
  	struct futex_pi_state *pi_state;

  	struct futex_hash_bucket *hb;

  	union futex_key key = FUTEX_KEY_INIT;

  	if (!futex_cmpxchg_enabled)
  		return;

  	/*
  	 * We are a ZOMBIE and nobody can enqueue itself on
  	 * pi_state_list anymore, but we have to be careful

  	 * versus waiters unqueueing themselves:

  	 */

  	raw_spin_lock_irq(&curr->pi_lock);

  	while (!list_empty(head)) {

  		next = head->next;
  		pi_state = list_entry(next, struct futex_pi_state, list);
  		key = pi_state->key;

  		hb = hash_futex(&key);

  
  		/*
  		 * We can race against put_pi_state() removing itself from the
  		 * list (a waiter going away). put_pi_state() will first
  		 * decrement the reference count and then modify the list, so
  		 * its possible to see the list entry but fail this reference
  		 * acquire.
  		 *
  		 * In that case; drop the locks to let put_pi_state() make
  		 * progress and retry the loop.
  		 */

  		if (!refcount_inc_not_zero(&pi_state->refcount)) {

  			raw_spin_unlock_irq(&curr->pi_lock);
  			cpu_relax();
  			raw_spin_lock_irq(&curr->pi_lock);
  			continue;
  		}

  		raw_spin_unlock_irq(&curr->pi_lock);

  		spin_lock(&hb->lock);

  		raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
  		raw_spin_lock(&curr->pi_lock);

  		/*
  		 * We dropped the pi-lock, so re-check whether this
  		 * task still owns the PI-state:
  		 */

  		if (head->next != next) {

  			/* retain curr->pi_lock for the loop invariant */

  			raw_spin_unlock(&pi_state->pi_mutex.wait_lock);

  			spin_unlock(&hb->lock);

  			put_pi_state(pi_state);

  			continue;
  		}

  		WARN_ON(pi_state->owner != curr);

  		WARN_ON(list_empty(&pi_state->list));
  		list_del_init(&pi_state->list);

  		pi_state->owner = NULL;

  		raw_spin_unlock(&curr->pi_lock);

  		raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);

  		spin_unlock(&hb->lock);

  		rt_mutex_futex_unlock(&pi_state->pi_mutex);
  		put_pi_state(pi_state);

  		raw_spin_lock_irq(&curr->pi_lock);

  	}

  	raw_spin_unlock_irq(&curr->pi_lock);

  }

  #else
  static inline void exit_pi_state_list(struct task_struct *curr) { }

  #endif

  /*
   * We need to check the following states:
   *
   *      Waiter | pi_state | pi->owner | uTID      | uODIED | ?
   *
   * [1]  NULL   | ---      | ---       | 0         | 0/1    | Valid
   * [2]  NULL   | ---      | ---       | >0        | 0/1    | Valid
   *
   * [3]  Found  | NULL     | --        | Any       | 0/1    | Invalid
   *
   * [4]  Found  | Found    | NULL      | 0         | 1      | Valid
   * [5]  Found  | Found    | NULL      | >0        | 1      | Invalid
   *
   * [6]  Found  | Found    | task      | 0         | 1      | Valid
   *
   * [7]  Found  | Found    | NULL      | Any       | 0      | Invalid
   *
   * [8]  Found  | Found    | task      | ==taskTID | 0/1    | Valid
   * [9]  Found  | Found    | task      | 0         | 0      | Invalid
   * [10] Found  | Found    | task      | !=taskTID | 0/1    | Invalid
   *
   * [1]	Indicates that the kernel can acquire the futex atomically. We

   *	came here due to a stale FUTEX_WAITERS/FUTEX_OWNER_DIED bit.

   *
   * [2]	Valid, if TID does not belong to a kernel thread. If no matching
   *      thread is found then it indicates that the owner TID has died.
   *
   * [3]	Invalid. The waiter is queued on a non PI futex
   *
   * [4]	Valid state after exit_robust_list(), which sets the user space
   *	value to FUTEX_WAITERS | FUTEX_OWNER_DIED.
   *
   * [5]	The user space value got manipulated between exit_robust_list()
   *	and exit_pi_state_list()
   *
   * [6]	Valid state after exit_pi_state_list() which sets the new owner in
   *	the pi_state but cannot access the user space value.
   *
   * [7]	pi_state->owner can only be NULL when the OWNER_DIED bit is set.
   *
   * [8]	Owner and user space value match
   *
   * [9]	There is no transient state which sets the user space TID to 0
   *	except exit_robust_list(), but this is indicated by the
   *	FUTEX_OWNER_DIED bit. See [4]
   *
   * [10] There is no transient state which leaves owner and user space
   *	TID out of sync.

   *
   *
   * Serialization and lifetime rules:
   *
   * hb->lock:
   *
   *	hb -> futex_q, relation
   *	futex_q -> pi_state, relation
   *
   *	(cannot be raw because hb can contain arbitrary amount
   *	 of futex_q's)
   *
   * pi_mutex->wait_lock:
   *
   *	{uval, pi_state}
   *
   *	(and pi_mutex 'obviously')
   *
   * p->pi_lock:
   *
   *	p->pi_state_list -> pi_state->list, relation
   *
   * pi_state->refcount:
   *
   *	pi_state lifetime
   *
   *
   * Lock order:
   *
   *   hb->lock
   *     pi_mutex->wait_lock
   *       p->pi_lock
   *

   */

  
  /*
   * Validate that the existing waiter has a pi_state and sanity check
   * the pi_state against the user space value. If correct, attach to
   * it.
   */

  static int attach_to_pi_state(u32 __user *uaddr, u32 uval,
  			      struct futex_pi_state *pi_state,

  			      struct futex_pi_state **ps)

  {

  	pid_t pid = uval & FUTEX_TID_MASK;

  	u32 uval2;
  	int ret;

  	/*
  	 * Userspace might have messed up non-PI and PI futexes [3]
  	 */
  	if (unlikely(!pi_state))
  		return -EINVAL;

  	/*
  	 * We get here with hb->lock held, and having found a
  	 * futex_top_waiter(). This means that futex_lock_pi() of said futex_q
  	 * has dropped the hb->lock in between queue_me() and unqueue_me_pi(),
  	 * which in turn means that futex_lock_pi() still has a reference on
  	 * our pi_state.

  	 *
  	 * The waiter holding a reference on @pi_state also protects against
  	 * the unlocked put_pi_state() in futex_unlock_pi(), futex_lock_pi()
  	 * and futex_wait_requeue_pi() as it cannot go to 0 and consequently
  	 * free pi_state before we can take a reference ourselves.

  	 */

  	WARN_ON(!refcount_read(&pi_state->refcount));

  	/*

  	 * Now that we have a pi_state, we can acquire wait_lock
  	 * and do the state validation.
  	 */
  	raw_spin_lock_irq(&pi_state->pi_mutex.wait_lock);
  
  	/*
  	 * Since {uval, pi_state} is serialized by wait_lock, and our current
  	 * uval was read without holding it, it can have changed. Verify it
  	 * still is what we expect it to be, otherwise retry the entire
  	 * operation.
  	 */
  	if (get_futex_value_locked(&uval2, uaddr))
  		goto out_efault;
  
  	if (uval != uval2)
  		goto out_eagain;
  
  	/*

  	 * Handle the owner died case:
  	 */
  	if (uval & FUTEX_OWNER_DIED) {

  		/*

  		 * exit_pi_state_list sets owner to NULL and wakes the
  		 * topmost waiter. The task which acquires the
  		 * pi_state->rt_mutex will fixup owner.

  		 */

  		if (!pi_state->owner) {

  			/*

  			 * No pi state owner, but the user space TID
  			 * is not 0. Inconsistent state. [5]

  			 */

  			if (pid)

  				goto out_einval;

  			/*

  			 * Take a ref on the state and return success. [4]

  			 */

  			goto out_attach;

  		}

  
  		/*

  		 * If TID is 0, then either the dying owner has not
  		 * yet executed exit_pi_state_list() or some waiter
  		 * acquired the rtmutex in the pi state, but did not
  		 * yet fixup the TID in user space.
  		 *
  		 * Take a ref on the state and return success. [6]
  		 */
  		if (!pid)

  			goto out_attach;

  	} else {
  		/*
  		 * If the owner died bit is not set, then the pi_state
  		 * must have an owner. [7]

  		 */

  		if (!pi_state->owner)

  			goto out_einval;

  	}
  
  	/*

  	 * Bail out if user space manipulated the futex value. If pi
  	 * state exists then the owner TID must be the same as the
  	 * user space TID. [9/10]
  	 */
  	if (pid != task_pid_vnr(pi_state->owner))

  		goto out_einval;
  
  out_attach:

  	get_pi_state(pi_state);

  	raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);

  	*ps = pi_state;
  	return 0;

  
  out_einval:
  	ret = -EINVAL;
  	goto out_error;
  
  out_eagain:
  	ret = -EAGAIN;
  	goto out_error;
  
  out_efault:
  	ret = -EFAULT;
  	goto out_error;
  
  out_error:
  	raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);
  	return ret;

  }

  /**
   * wait_for_owner_exiting - Block until the owner has exited

   * @ret: owner's current futex lock status

   * @exiting:	Pointer to the exiting task
   *
   * Caller must hold a refcount on @exiting.
   */
  static void wait_for_owner_exiting(int ret, struct task_struct *exiting)
  {
  	if (ret != -EBUSY) {
  		WARN_ON_ONCE(exiting);
  		return;
  	}
  
  	if (WARN_ON_ONCE(ret == -EBUSY && !exiting))
  		return;
  
  	mutex_lock(&exiting->futex_exit_mutex);
  	/*
  	 * No point in doing state checking here. If the waiter got here
  	 * while the task was in exec()->exec_futex_release() then it can
  	 * have any FUTEX_STATE_* value when the waiter has acquired the
  	 * mutex. OK, if running, EXITING or DEAD if it reached exit()
  	 * already. Highly unlikely and not a problem. Just one more round
  	 * through the futex maze.
  	 */
  	mutex_unlock(&exiting->futex_exit_mutex);
  
  	put_task_struct(exiting);
  }

  static int handle_exit_race(u32 __user *uaddr, u32 uval,
  			    struct task_struct *tsk)
  {
  	u32 uval2;
  
  	/*

  	 * If the futex exit state is not yet FUTEX_STATE_DEAD, tell the
  	 * caller that the alleged owner is busy.

  	 */

  	if (tsk && tsk->futex_state != FUTEX_STATE_DEAD)

  		return -EBUSY;

  
  	/*
  	 * Reread the user space value to handle the following situation:
  	 *
  	 * CPU0				CPU1
  	 *
  	 * sys_exit()			sys_futex()
  	 *  do_exit()			 futex_lock_pi()
  	 *                                futex_lock_pi_atomic()
  	 *   exit_signals(tsk)		    No waiters:
  	 *    tsk->flags |= PF_EXITING;	    *uaddr == 0x00000PID
  	 *  mm_release(tsk)		    Set waiter bit
  	 *   exit_robust_list(tsk) {	    *uaddr = 0x80000PID;
  	 *      Set owner died		    attach_to_pi_owner() {
  	 *    *uaddr = 0xC0000000;	     tsk = get_task(PID);
  	 *   }				     if (!tsk->flags & PF_EXITING) {
  	 *  ...				       attach();

  	 *  tsk->futex_state =               } else {
  	 *	FUTEX_STATE_DEAD;              if (tsk->futex_state !=
  	 *					  FUTEX_STATE_DEAD)

  	 *				         return -EAGAIN;
  	 *				       return -ESRCH; <--- FAIL
  	 *				     }
  	 *
  	 * Returning ESRCH unconditionally is wrong here because the
  	 * user space value has been changed by the exiting task.
  	 *
  	 * The same logic applies to the case where the exiting task is
  	 * already gone.
  	 */
  	if (get_futex_value_locked(&uval2, uaddr))
  		return -EFAULT;
  
  	/* If the user space value has changed, try again. */
  	if (uval2 != uval)
  		return -EAGAIN;
  
  	/*
  	 * The exiting task did not have a robust list, the robust list was
  	 * corrupted or the user space value in *uaddr is simply bogus.
  	 * Give up and tell user space.
  	 */
  	return -ESRCH;
  }

  /*
   * Lookup the task for the TID provided from user space and attach to
   * it after doing proper sanity checks.
   */

  static int attach_to_pi_owner(u32 __user *uaddr, u32 uval, union futex_key *key,

  			      struct futex_pi_state **ps,
  			      struct task_struct **exiting)

  {

  	pid_t pid = uval & FUTEX_TID_MASK;

  	struct futex_pi_state *pi_state;
  	struct task_struct *p;

  
  	/*

  	 * We are the first waiter - try to look up the real owner and attach

  	 * the new pi_state to it, but bail out when TID = 0 [1]

  	 *
  	 * The !pid check is paranoid. None of the call sites should end up
  	 * with pid == 0, but better safe than sorry. Let the caller retry

  	 */

  	if (!pid)

  		return -EAGAIN;

  	p = find_get_task_by_vpid(pid);

  	if (!p)

  		return handle_exit_race(uaddr, uval, NULL);

  	if (unlikely(p->flags & PF_KTHREAD)) {

  		put_task_struct(p);
  		return -EPERM;
  	}

  	/*

  	 * We need to look at the task state to figure out, whether the
  	 * task is exiting. To protect against the change of the task state
  	 * in futex_exit_release(), we do this protected by p->pi_lock:

  	 */

  	raw_spin_lock_irq(&p->pi_lock);

  	if (unlikely(p->futex_state != FUTEX_STATE_OK)) {

  		/*

  		 * The task is on the way out. When the futex state is
  		 * FUTEX_STATE_DEAD, we know that the task has finished
  		 * the cleanup:

  		 */

  		int ret = handle_exit_race(uaddr, uval, p);

  		raw_spin_unlock_irq(&p->pi_lock);

  		/*
  		 * If the owner task is between FUTEX_STATE_EXITING and
  		 * FUTEX_STATE_DEAD then store the task pointer and keep
  		 * the reference on the task struct. The calling code will
  		 * drop all locks, wait for the task to reach
  		 * FUTEX_STATE_DEAD and then drop the refcount. This is
  		 * required to prevent a live lock when the current task
  		 * preempted the exiting task between the two states.
  		 */
  		if (ret == -EBUSY)
  			*exiting = p;
  		else
  			put_task_struct(p);

  		return ret;
  	}

  	/*
  	 * No existing pi state. First waiter. [2]

  	 *
  	 * This creates pi_state, we have hb->lock held, this means nothing can
  	 * observe this state, wait_lock is irrelevant.

  	 */

  	pi_state = alloc_pi_state();
  
  	/*

  	 * Initialize the pi_mutex in locked state and make @p

  	 * the owner of it:
  	 */
  	rt_mutex_init_proxy_locked(&pi_state->pi_mutex, p);
  
  	/* Store the key for possible exit cleanups: */

  	pi_state->key = *key;

  	WARN_ON(!list_empty(&pi_state->list));

  	list_add(&pi_state->list, &p->pi_state_list);

  	/*
  	 * Assignment without holding pi_state->pi_mutex.wait_lock is safe
  	 * because there is no concurrency as the object is not published yet.
  	 */

  	pi_state->owner = p;

  	raw_spin_unlock_irq(&p->pi_lock);

  
  	put_task_struct(p);

  	*ps = pi_state;

  
  	return 0;
  }

  static int lookup_pi_state(u32 __user *uaddr, u32 uval,
  			   struct futex_hash_bucket *hb,

  			   union futex_key *key, struct futex_pi_state **ps,
  			   struct task_struct **exiting)

  {

  	struct futex_q *top_waiter = futex_top_waiter(hb, key);

  
  	/*
  	 * If there is a waiter on that futex, validate it and
  	 * attach to the pi_state when the validation succeeds.
  	 */

  	if (top_waiter)

  		return attach_to_pi_state(uaddr, uval, top_waiter->pi_state, ps);

  
  	/*
  	 * We are the first waiter - try to look up the owner based on
  	 * @uval and attach to it.
  	 */

  	return attach_to_pi_owner(uaddr, uval, key, ps, exiting);

  }

  static int lock_pi_update_atomic(u32 __user *uaddr, u32 uval, u32 newval)
  {

  	int err;

  	u32 curval;

  	if (unlikely(should_fail_futex(true)))
  		return -EFAULT;

  	err = cmpxchg_futex_value_locked(&curval, uaddr, uval, newval);
  	if (unlikely(err))
  		return err;

  	/* If user space value changed, let the caller retry */

  	return curval != uval ? -EAGAIN : 0;
  }

  /**

   * futex_lock_pi_atomic() - Atomic work required to acquire a pi aware futex

   * @uaddr:		the pi futex user address
   * @hb:			the pi futex hash bucket
   * @key:		the futex key associated with uaddr and hb
   * @ps:			the pi_state pointer where we store the result of the
   *			lookup
   * @task:		the task to perform the atomic lock work for.  This will
   *			be "current" except in the case of requeue pi.

   * @exiting:		Pointer to store the task pointer of the owner task
   *			which is in the middle of exiting

   * @set_waiters:	force setting the FUTEX_WAITERS bit (1) or not (0)

   *

   * Return:

   *  -  0 - ready to wait;
   *  -  1 - acquired the lock;
   *  - <0 - error

   *
   * The hb->lock and futex_key refs shall be held by the caller.

   *
   * @exiting is only set when the return value is -EBUSY. If so, this holds
   * a refcount on the exiting task on return and the caller needs to drop it
   * after waiting for the exit to complete.

   */
  static int futex_lock_pi_atomic(u32 __user *uaddr, struct futex_hash_bucket *hb,
  				union futex_key *key,
  				struct futex_pi_state **ps,

  				struct task_struct *task,
  				struct task_struct **exiting,
  				int set_waiters)

  {

  	u32 uval, newval, vpid = task_pid_vnr(task);

  	struct futex_q *top_waiter;

  	int ret;

  
  	/*

  	 * Read the user space value first so we can validate a few
  	 * things before proceeding further.

  	 */

  	if (get_futex_value_locked(&uval, uaddr))

  		return -EFAULT;

  	if (unlikely(should_fail_futex(true)))
  		return -EFAULT;

  	/*
  	 * Detect deadlocks.
  	 */

  	if ((unlikely((uval & FUTEX_TID_MASK) == vpid)))

  		return -EDEADLK;

  	if ((unlikely(should_fail_futex(true))))
  		return -EDEADLK;

  	/*

  	 * Lookup existing state first. If it exists, try to attach to
  	 * its pi_state.

  	 */

  	top_waiter = futex_top_waiter(hb, key);
  	if (top_waiter)

  		return attach_to_pi_state(uaddr, uval, top_waiter->pi_state, ps);

  
  	/*

  	 * No waiter and user TID is 0. We are here because the
  	 * waiters or the owner died bit is set or called from
  	 * requeue_cmp_pi or for whatever reason something took the
  	 * syscall.

  	 */

  	if (!(uval & FUTEX_TID_MASK)) {

  		/*

  		 * We take over the futex. No other waiters and the user space
  		 * TID is 0. We preserve the owner died bit.

  		 */

  		newval = uval & FUTEX_OWNER_DIED;
  		newval |= vpid;

  		/* The futex requeue_pi code can enforce the waiters bit */
  		if (set_waiters)
  			newval |= FUTEX_WAITERS;
  
  		ret = lock_pi_update_atomic(uaddr, uval, newval);
  		/* If the take over worked, return 1 */
  		return ret < 0 ? ret : 1;
  	}

  
  	/*

  	 * First waiter. Set the waiters bit before attaching ourself to
  	 * the owner. If owner tries to unlock, it will be forced into
  	 * the kernel and blocked on hb->lock.

  	 */

  	newval = uval | FUTEX_WAITERS;
  	ret = lock_pi_update_atomic(uaddr, uval, newval);
  	if (ret)
  		return ret;

  	/*

  	 * If the update of the user space value succeeded, we try to
  	 * attach to the owner. If that fails, no harm done, we only
  	 * set the FUTEX_WAITERS bit in the user space variable.

  	 */

  	return attach_to_pi_owner(uaddr, newval, key, ps, exiting);

  }

  /**
   * __unqueue_futex() - Remove the futex_q from its futex_hash_bucket
   * @q:	The futex_q to unqueue
   *
   * The q->lock_ptr must not be NULL and must be held by the caller.
   */
  static void __unqueue_futex(struct futex_q *q)
  {
  	struct futex_hash_bucket *hb;

  	if (WARN_ON_SMP(!q->lock_ptr) || WARN_ON(plist_node_empty(&q->list)))

  		return;

  	lockdep_assert_held(q->lock_ptr);

  
  	hb = container_of(q->lock_ptr, struct futex_hash_bucket, lock);
  	plist_del(&q->list, &hb->chain);

  	hb_waiters_dec(hb);

  }

  /*

   * The hash bucket lock must be held when this is called.

   * Afterwards, the futex_q must not be accessed. Callers
   * must ensure to later call wake_up_q() for the actual
   * wakeups to occur.

   */

  static void mark_wake_futex(struct wake_q_head *wake_q, struct futex_q *q)

  {

  	struct task_struct *p = q->task;

  	if (WARN(q->pi_state || q->rt_waiter, "refusing to wake PI futex
  "))
  		return;

  	get_task_struct(p);

  	__unqueue_futex(q);

  	/*

  	 * The waiting task can free the futex_q as soon as q->lock_ptr = NULL
  	 * is written, without taking any locks. This is possible in the event
  	 * of a spurious wakeup, for example. A memory barrier is required here
  	 * to prevent the following store to lock_ptr from getting ahead of the
  	 * plist_del in __unqueue_futex().

  	 */

  	smp_store_release(&q->lock_ptr, NULL);

  
  	/*
  	 * Queue the task for later wakeup for after we've released

  	 * the hb->lock.

  	 */

  	wake_q_add_safe(wake_q, p);

  }

  /*
   * Caller must hold a reference on @pi_state.
   */
  static int wake_futex_pi(u32 __user *uaddr, u32 uval, struct futex_pi_state *pi_state)

  {

  	u32 curval, newval;

  	struct task_struct *new_owner;

  	bool postunlock = false;

  	DEFINE_WAKE_Q(wake_q);

  	int ret = 0;

  	new_owner = rt_mutex_next_owner(&pi_state->pi_mutex);

  	if (WARN_ON_ONCE(!new_owner)) {

  		/*

  		 * As per the comment in futex_unlock_pi() this should not happen.

  		 *
  		 * When this happens, give up our locks and try again, giving
  		 * the futex_lock_pi() instance time to complete, either by
  		 * waiting on the rtmutex or removing itself from the futex
  		 * queue.
  		 */
  		ret = -EAGAIN;
  		goto out_unlock;

  	}

  
  	/*

  	 * We pass it to the next owner. The WAITERS bit is always kept
  	 * enabled while there is PI state around. We cleanup the owner
  	 * died bit, because we are the owner.

  	 */

  	newval = FUTEX_WAITERS | task_pid_vnr(new_owner);

  	if (unlikely(should_fail_futex(true))) {

  		ret = -EFAULT;

  		goto out_unlock;
  	}

  	ret = cmpxchg_futex_value_locked(&curval, uaddr, uval, newval);
  	if (!ret && (curval != uval)) {

  		/*
  		 * If a unconditional UNLOCK_PI operation (user space did not
  		 * try the TID->0 transition) raced with a waiter setting the
  		 * FUTEX_WAITERS flag between get_user() and locking the hash
  		 * bucket lock, retry the operation.
  		 */
  		if ((FUTEX_TID_MASK & curval) == uval)
  			ret = -EAGAIN;
  		else
  			ret = -EINVAL;
  	}

  	if (ret)
  		goto out_unlock;

  	/*
  	 * This is a point of no return; once we modify the uval there is no
  	 * going back and subsequent operations must not fail.
  	 */

  	raw_spin_lock(&pi_state->owner->pi_lock);

  	WARN_ON(list_empty(&pi_state->list));
  	list_del_init(&pi_state->list);

  	raw_spin_unlock(&pi_state->owner->pi_lock);

  	raw_spin_lock(&new_owner->pi_lock);

  	WARN_ON(!list_empty(&pi_state->list));

  	list_add(&pi_state->list, &new_owner->pi_state_list);
  	pi_state->owner = new_owner;

  	raw_spin_unlock(&new_owner->pi_lock);

  	postunlock = __rt_mutex_futex_unlock(&pi_state->pi_mutex, &wake_q);

  out_unlock:

  	raw_spin_unlock_irq(&pi_state->pi_mutex.wait_lock);

  	if (postunlock)
  		rt_mutex_postunlock(&wake_q);

  	return ret;

  }

  /*

   * Express the locking dependencies for lockdep:
   */
  static inline void
  double_lock_hb(struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2)
  {
  	if (hb1 <= hb2) {
  		spin_lock(&hb1->lock);
  		if (hb1 < hb2)
  			spin_lock_nested(&hb2->lock, SINGLE_DEPTH_NESTING);
  	} else { /* hb1 > hb2 */
  		spin_lock(&hb2->lock);
  		spin_lock_nested(&hb1->lock, SINGLE_DEPTH_NESTING);
  	}
  }

  static inline void
  double_unlock_hb(struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2)
  {

  	spin_unlock(&hb1->lock);

  	if (hb1 != hb2)
  		spin_unlock(&hb2->lock);

  }

  /*

   * Wake up waiters matching bitset queued on this futex (uaddr).

   */

  static int
  futex_wake(u32 __user *uaddr, unsigned int flags, int nr_wake, u32 bitset)

  {

  	struct futex_hash_bucket *hb;

  	struct futex_q *this, *next;

  	union futex_key key = FUTEX_KEY_INIT;

  	int ret;

  	DEFINE_WAKE_Q(wake_q);

  	if (!bitset)
  		return -EINVAL;

  	ret = get_futex_key(uaddr, flags & FLAGS_SHARED, &key, FUTEX_READ);

  	if (unlikely(ret != 0))

  		return ret;

  	hb = hash_futex(&key);

  
  	/* Make sure we really have tasks to wakeup */
  	if (!hb_waiters_pending(hb))

  		return ret;

  	spin_lock(&hb->lock);

  	plist_for_each_entry_safe(this, next, &hb->chain, list) {

  		if (match_futex (&this->key, &key)) {

  			if (this->pi_state || this->rt_waiter) {

  				ret = -EINVAL;
  				break;
  			}

  
  			/* Check if one of the bits is set in both bitsets */
  			if (!(this->bitset & bitset))
  				continue;

  			mark_wake_futex(&wake_q, this);

  			if (++ret >= nr_wake)
  				break;
  		}
  	}

  	spin_unlock(&hb->lock);

  	wake_up_q(&wake_q);

  	return ret;
  }

  static int futex_atomic_op_inuser(unsigned int encoded_op, u32 __user *uaddr)
  {
  	unsigned int op =	  (encoded_op & 0x70000000) >> 28;
  	unsigned int cmp =	  (encoded_op & 0x0f000000) >> 24;

  	int oparg = sign_extend32((encoded_op & 0x00fff000) >> 12, 11);
  	int cmparg = sign_extend32(encoded_op & 0x00000fff, 11);

  	int oldval, ret;
  
  	if (encoded_op & (FUTEX_OP_OPARG_SHIFT << 28)) {

  		if (oparg < 0 || oparg > 31) {
  			char comm[sizeof(current->comm)];
  			/*
  			 * kill this print and return -EINVAL when userspace
  			 * is sane again
  			 */
  			pr_info_ratelimited("futex_wake_op: %s tries to shift op by %d; fix this program
  ",
  					get_task_comm(comm, current), oparg);
  			oparg &= 31;
  		}

  		oparg = 1 << oparg;
  	}

  	pagefault_disable();

  	ret = arch_futex_atomic_op_inuser(op, oparg, &oldval, uaddr);

  	pagefault_enable();

  	if (ret)
  		return ret;
  
  	switch (cmp) {
  	case FUTEX_OP_CMP_EQ:
  		return oldval == cmparg;
  	case FUTEX_OP_CMP_NE:
  		return oldval != cmparg;
  	case FUTEX_OP_CMP_LT:
  		return oldval < cmparg;
  	case FUTEX_OP_CMP_GE:
  		return oldval >= cmparg;
  	case FUTEX_OP_CMP_LE:
  		return oldval <= cmparg;
  	case FUTEX_OP_CMP_GT:
  		return oldval > cmparg;
  	default:
  		return -ENOSYS;
  	}
  }

  /*

   * Wake up all waiters hashed on the physical page that is mapped
   * to this virtual address:
   */

  static int

  futex_wake_op(u32 __user *uaddr1, unsigned int flags, u32 __user *uaddr2,

  	      int nr_wake, int nr_wake2, int op)

  {

  	union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT;

  	struct futex_hash_bucket *hb1, *hb2;

  	struct futex_q *this, *next;

  	int ret, op_ret;

  	DEFINE_WAKE_Q(wake_q);

  retry:

  	ret = get_futex_key(uaddr1, flags & FLAGS_SHARED, &key1, FUTEX_READ);

  	if (unlikely(ret != 0))

  		return ret;

  	ret = get_futex_key(uaddr2, flags & FLAGS_SHARED, &key2, FUTEX_WRITE);

  	if (unlikely(ret != 0))

  		return ret;

  	hb1 = hash_futex(&key1);
  	hb2 = hash_futex(&key2);

  retry_private:

  	double_lock_hb(hb1, hb2);

  	op_ret = futex_atomic_op_inuser(op, uaddr2);

  	if (unlikely(op_ret < 0)) {

  		double_unlock_hb(hb1, hb2);

  		if (!IS_ENABLED(CONFIG_MMU) ||
  		    unlikely(op_ret != -EFAULT && op_ret != -EAGAIN)) {
  			/*
  			 * we don't get EFAULT from MMU faults if we don't have
  			 * an MMU, but we might get them from range checking
  			 */

  			ret = op_ret;

  			return ret;

  		}

  		if (op_ret == -EFAULT) {
  			ret = fault_in_user_writeable(uaddr2);
  			if (ret)

  				return ret;

  		}