// SPDX-License-Identifier: GPL-2.0
  /*
   * Shared application/kernel submission and completion ring pairs, for
   * supporting fast/efficient IO.
   *
   * A note on the read/write ordering memory barriers that are matched between

   * the application and kernel side.
   *
   * After the application reads the CQ ring tail, it must use an
   * appropriate smp_rmb() to pair with the smp_wmb() the kernel uses
   * before writing the tail (using smp_load_acquire to read the tail will
   * do). It also needs a smp_mb() before updating CQ head (ordering the
   * entry load(s) with the head store), pairing with an implicit barrier
   * through a control-dependency in io_get_cqring (smp_store_release to
   * store head will do). Failure to do so could lead to reading invalid
   * CQ entries.
   *
   * Likewise, the application must use an appropriate smp_wmb() before
   * writing the SQ tail (ordering SQ entry stores with the tail store),
   * which pairs with smp_load_acquire in io_get_sqring (smp_store_release
   * to store the tail will do). And it needs a barrier ordering the SQ
   * head load before writing new SQ entries (smp_load_acquire to read
   * head will do).
   *
   * When using the SQ poll thread (IORING_SETUP_SQPOLL), the application
   * needs to check the SQ flags for IORING_SQ_NEED_WAKEUP *after*
   * updating the SQ tail; a full memory barrier smp_mb() is needed
   * between.

   *
   * Also see the examples in the liburing library:
   *
   *	git://git.kernel.dk/liburing
   *
   * io_uring also uses READ/WRITE_ONCE() for _any_ store or load that happens
   * from data shared between the kernel and application. This is done both
   * for ordering purposes, but also to ensure that once a value is loaded from
   * data that the application could potentially modify, it remains stable.
   *
   * Copyright (C) 2018-2019 Jens Axboe

   * Copyright (c) 2018-2019 Christoph Hellwig

   */
  #include <linux/kernel.h>
  #include <linux/init.h>
  #include <linux/errno.h>
  #include <linux/syscalls.h>
  #include <linux/compat.h>
  #include <linux/refcount.h>
  #include <linux/uio.h>
  
  #include <linux/sched/signal.h>
  #include <linux/fs.h>
  #include <linux/file.h>
  #include <linux/fdtable.h>
  #include <linux/mm.h>
  #include <linux/mman.h>
  #include <linux/mmu_context.h>
  #include <linux/percpu.h>
  #include <linux/slab.h>
  #include <linux/workqueue.h>

  #include <linux/kthread.h>

  #include <linux/blkdev.h>

  #include <linux/bvec.h>

  #include <linux/net.h>
  #include <net/sock.h>
  #include <net/af_unix.h>

  #include <net/scm.h>

  #include <linux/anon_inodes.h>
  #include <linux/sched/mm.h>
  #include <linux/uaccess.h>
  #include <linux/nospec.h>

  #include <linux/sizes.h>
  #include <linux/hugetlb.h>

  #include <linux/highmem.h>

  #include <linux/fs_struct.h>

  
  #include <uapi/linux/io_uring.h>
  
  #include "internal.h"

  #define IORING_MAX_ENTRIES	32768

  #define IORING_MAX_FIXED_FILES	1024

  
  struct io_uring {
  	u32 head ____cacheline_aligned_in_smp;
  	u32 tail ____cacheline_aligned_in_smp;
  };

  /*

   * This data is shared with the application through the mmap at offsets
   * IORING_OFF_SQ_RING and IORING_OFF_CQ_RING.

   *
   * The offsets to the member fields are published through struct
   * io_sqring_offsets when calling io_uring_setup.
   */

  struct io_rings {

  	/*
  	 * Head and tail offsets into the ring; the offsets need to be
  	 * masked to get valid indices.
  	 *

  	 * The kernel controls head of the sq ring and the tail of the cq ring,
  	 * and the application controls tail of the sq ring and the head of the
  	 * cq ring.

  	 */

  	struct io_uring		sq, cq;

  	/*

  	 * Bitmasks to apply to head and tail offsets (constant, equals

  	 * ring_entries - 1)
  	 */

  	u32			sq_ring_mask, cq_ring_mask;
  	/* Ring sizes (constant, power of 2) */
  	u32			sq_ring_entries, cq_ring_entries;

  	/*
  	 * Number of invalid entries dropped by the kernel due to
  	 * invalid index stored in array
  	 *
  	 * Written by the kernel, shouldn't be modified by the
  	 * application (i.e. get number of "new events" by comparing to
  	 * cached value).
  	 *
  	 * After a new SQ head value was read by the application this
  	 * counter includes all submissions that were dropped reaching
  	 * the new SQ head (and possibly more).
  	 */

  	u32			sq_dropped;

  	/*
  	 * Runtime flags
  	 *
  	 * Written by the kernel, shouldn't be modified by the
  	 * application.
  	 *
  	 * The application needs a full memory barrier before checking
  	 * for IORING_SQ_NEED_WAKEUP after updating the sq tail.
  	 */

  	u32			sq_flags;

  	/*
  	 * Number of completion events lost because the queue was full;
  	 * this should be avoided by the application by making sure
  	 * there are not more requests pending thatn there is space in
  	 * the completion queue.
  	 *
  	 * Written by the kernel, shouldn't be modified by the
  	 * application (i.e. get number of "new events" by comparing to
  	 * cached value).
  	 *
  	 * As completion events come in out of order this counter is not
  	 * ordered with any other data.
  	 */

  	u32			cq_overflow;

  	/*
  	 * Ring buffer of completion events.
  	 *
  	 * The kernel writes completion events fresh every time they are
  	 * produced, so the application is allowed to modify pending
  	 * entries.
  	 */

  	struct io_uring_cqe	cqes[] ____cacheline_aligned_in_smp;

  };

  struct io_mapped_ubuf {
  	u64		ubuf;
  	size_t		len;
  	struct		bio_vec *bvec;
  	unsigned int	nr_bvecs;
  };

  struct async_list {
  	spinlock_t		lock;
  	atomic_t		cnt;
  	struct list_head	list;
  
  	struct file		*file;

  	off_t			io_start;

  	size_t			io_len;

  };

  struct io_ring_ctx {
  	struct {
  		struct percpu_ref	refs;
  	} ____cacheline_aligned_in_smp;
  
  	struct {
  		unsigned int		flags;
  		bool			compat;
  		bool			account_mem;

  		/*
  		 * Ring buffer of indices into array of io_uring_sqe, which is
  		 * mmapped by the application using the IORING_OFF_SQES offset.
  		 *
  		 * This indirection could e.g. be used to assign fixed
  		 * io_uring_sqe entries to operations and only submit them to
  		 * the queue when needed.
  		 *
  		 * The kernel modifies neither the indices array nor the entries
  		 * array.
  		 */
  		u32			*sq_array;

  		unsigned		cached_sq_head;
  		unsigned		sq_entries;
  		unsigned		sq_mask;

  		unsigned		sq_thread_idle;

  		unsigned		cached_sq_dropped;

  		struct io_uring_sqe	*sq_sqes;

  
  		struct list_head	defer_list;

  		struct list_head	timeout_list;

  	} ____cacheline_aligned_in_smp;
  
  	/* IO offload */

  	struct workqueue_struct	*sqo_wq[2];

  	struct task_struct	*sqo_thread;	/* if using sq thread polling */

  	struct mm_struct	*sqo_mm;

  	wait_queue_head_t	sqo_wait;

  	struct completion	sqo_thread_started;

  
  	struct {

  		unsigned		cached_cq_tail;

  		atomic_t		cached_cq_overflow;

  		unsigned		cq_entries;
  		unsigned		cq_mask;
  		struct wait_queue_head	cq_wait;
  		struct fasync_struct	*cq_fasync;

  		struct eventfd_ctx	*cq_ev_fd;

  		atomic_t		cq_timeouts;

  	} ____cacheline_aligned_in_smp;

  	struct io_rings	*rings;

  	/*
  	 * If used, fixed file set. Writers must ensure that ->refs is dead,
  	 * readers must ensure that ->refs is alive as long as the file* is
  	 * used. Only updated through io_uring_register(2).
  	 */
  	struct file		**user_files;
  	unsigned		nr_user_files;

  	/* if used, fixed mapped user buffers */
  	unsigned		nr_user_bufs;
  	struct io_mapped_ubuf	*user_bufs;

  	struct user_struct	*user;

  	const struct cred	*creds;

  	struct completion	ctx_done;
  
  	struct {
  		struct mutex		uring_lock;
  		wait_queue_head_t	wait;
  	} ____cacheline_aligned_in_smp;
  
  	struct {
  		spinlock_t		completion_lock;

  		bool			poll_multi_file;
  		/*
  		 * ->poll_list is protected by the ctx->uring_lock for
  		 * io_uring instances that don't use IORING_SETUP_SQPOLL.
  		 * For SQPOLL, only the single threaded io_sq_thread() will
  		 * manipulate the list, hence no extra locking is needed there.
  		 */
  		struct list_head	poll_list;

  		struct list_head	cancel_list;

  	} ____cacheline_aligned_in_smp;

  	struct async_list	pending_async[2];

  #if defined(CONFIG_UNIX)
  	struct socket		*ring_sock;
  #endif

  
  	struct list_head	task_list;
  	spinlock_t		task_lock;

  };
  
  struct sqe_submit {
  	const struct io_uring_sqe	*sqe;
  	unsigned short			index;

  	u32				sequence;

  	bool				has_user;

  	bool				needs_lock;

  	bool				needs_fixed_file;

  	u8				opcode;

  };

  /*
   * First field must be the file pointer in all the
   * iocb unions! See also 'struct kiocb' in <linux/fs.h>
   */

  struct io_poll_iocb {
  	struct file			*file;
  	struct wait_queue_head		*head;
  	__poll_t			events;

  	bool				done;

  	bool				canceled;
  	struct wait_queue_entry		wait;
  };

  struct io_timeout {
  	struct file			*file;
  	struct hrtimer			timer;
  };

  /*
   * NOTE! Each of the iocb union members has the file pointer
   * as the first entry in their struct definition. So you can
   * access the file pointer through any of the sub-structs,
   * or directly as just 'ki_filp' in this struct.
   */

  struct io_kiocb {

  	union {

  		struct file		*file;

  		struct kiocb		rw;
  		struct io_poll_iocb	poll;

  		struct io_timeout	timeout;

  	};

  
  	struct sqe_submit	submit;
  
  	struct io_ring_ctx	*ctx;
  	struct list_head	list;

  	struct list_head	link_list;

  	unsigned int		flags;

  	refcount_t		refs;

  #define REQ_F_NOWAIT		1	/* must not punt to workers */

  #define REQ_F_IOPOLL_COMPLETED	2	/* polled IO has completed */

  #define REQ_F_FIXED_FILE	4	/* ctx owns file */

  #define REQ_F_SEQ_PREV		8	/* sequential with previous */

  #define REQ_F_IO_DRAIN		16	/* drain existing IO first */
  #define REQ_F_IO_DRAINED	32	/* drain done */

  #define REQ_F_LINK		64	/* linked sqes */

  #define REQ_F_LINK_DONE		128	/* linked sqes done */
  #define REQ_F_FAIL_LINK		256	/* fail rest of links */

  #define REQ_F_SHADOW_DRAIN	512	/* link-drain shadow req */

  #define REQ_F_TIMEOUT		1024	/* timeout request */

  #define REQ_F_ISREG		2048	/* regular file */
  #define REQ_F_MUST_PUNT		4096	/* must be punted even for NONBLOCK */

  #define REQ_F_TIMEOUT_NOSEQ	8192	/* no timeout sequence */

  #define REQ_F_CANCEL		16384	/* cancel request */

  	unsigned long		fsize;

  	u64			user_data;

  	u32			result;

  	u32			sequence;

  	struct task_struct	*task;

  	struct fs_struct	*fs;

  	struct work_struct	work;

  	struct task_struct	*work_task;
  	struct list_head	task_list;

  };
  
  #define IO_PLUG_THRESHOLD		2

  #define IO_IOPOLL_BATCH			8

  struct io_submit_state {
  	struct blk_plug		plug;
  
  	/*

  	 * io_kiocb alloc cache
  	 */
  	void			*reqs[IO_IOPOLL_BATCH];
  	unsigned		int free_reqs;
  	unsigned		int cur_req;
  
  	/*

  	 * File reference cache
  	 */
  	struct file		*file;
  	unsigned int		fd;
  	unsigned int		has_refs;
  	unsigned int		used_refs;
  	unsigned int		ios_left;
  };

  static void io_sq_wq_submit_work(struct work_struct *work);

  static void io_cqring_fill_event(struct io_ring_ctx *ctx, u64 ki_user_data,
  				 long res);

  static void __io_free_req(struct io_kiocb *req);

  static struct kmem_cache *req_cachep;
  
  static const struct file_operations io_uring_fops;
  
  struct sock *io_uring_get_socket(struct file *file)
  {
  #if defined(CONFIG_UNIX)
  	if (file->f_op == &io_uring_fops) {
  		struct io_ring_ctx *ctx = file->private_data;
  
  		return ctx->ring_sock->sk;
  	}
  #endif
  	return NULL;
  }
  EXPORT_SYMBOL(io_uring_get_socket);
  
  static void io_ring_ctx_ref_free(struct percpu_ref *ref)
  {
  	struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs);
  
  	complete(&ctx->ctx_done);
  }
  
  static struct io_ring_ctx *io_ring_ctx_alloc(struct io_uring_params *p)
  {
  	struct io_ring_ctx *ctx;

  	int i;

  
  	ctx = kzalloc(sizeof(*ctx), GFP_KERNEL);
  	if (!ctx)
  		return NULL;

  	if (percpu_ref_init(&ctx->refs, io_ring_ctx_ref_free,
  			    PERCPU_REF_ALLOW_REINIT, GFP_KERNEL)) {

  		kfree(ctx);
  		return NULL;
  	}
  
  	ctx->flags = p->flags;

  	init_waitqueue_head(&ctx->sqo_wait);

  	init_waitqueue_head(&ctx->cq_wait);
  	init_completion(&ctx->ctx_done);

  	init_completion(&ctx->sqo_thread_started);

  	mutex_init(&ctx->uring_lock);
  	init_waitqueue_head(&ctx->wait);

  	for (i = 0; i < ARRAY_SIZE(ctx->pending_async); i++) {
  		spin_lock_init(&ctx->pending_async[i].lock);
  		INIT_LIST_HEAD(&ctx->pending_async[i].list);
  		atomic_set(&ctx->pending_async[i].cnt, 0);
  	}

  	spin_lock_init(&ctx->completion_lock);

  	INIT_LIST_HEAD(&ctx->poll_list);

  	INIT_LIST_HEAD(&ctx->cancel_list);

  	INIT_LIST_HEAD(&ctx->defer_list);

  	INIT_LIST_HEAD(&ctx->timeout_list);

  	INIT_LIST_HEAD(&ctx->task_list);
  	spin_lock_init(&ctx->task_lock);

  	return ctx;
  }

  static inline bool __io_sequence_defer(struct io_ring_ctx *ctx,
  				       struct io_kiocb *req)
  {

  	return req->sequence != ctx->cached_cq_tail + ctx->cached_sq_dropped
  					+ atomic_read(&ctx->cached_cq_overflow);

  }

  static inline bool io_sequence_defer(struct io_ring_ctx *ctx,
  				     struct io_kiocb *req)
  {

  	if ((req->flags & (REQ_F_IO_DRAIN|REQ_F_IO_DRAINED)) != REQ_F_IO_DRAIN)

  		return false;

  	return __io_sequence_defer(ctx, req);

  }

  static struct io_kiocb *io_get_deferred_req(struct io_ring_ctx *ctx)

  {
  	struct io_kiocb *req;

  	req = list_first_entry_or_null(&ctx->defer_list, struct io_kiocb, list);
  	if (req && !io_sequence_defer(ctx, req)) {

  		list_del_init(&req->list);
  		return req;
  	}
  
  	return NULL;
  }

  static struct io_kiocb *io_get_timeout_req(struct io_ring_ctx *ctx)
  {

  	struct io_kiocb *req;
  
  	req = list_first_entry_or_null(&ctx->timeout_list, struct io_kiocb, list);

  	if (req) {
  		if (req->flags & REQ_F_TIMEOUT_NOSEQ)
  			return NULL;
  		if (!__io_sequence_defer(ctx, req)) {
  			list_del_init(&req->list);
  			return req;
  		}

  	}
  
  	return NULL;

  }

  static void __io_commit_cqring(struct io_ring_ctx *ctx)

  {

  	struct io_rings *rings = ctx->rings;

  	if (ctx->cached_cq_tail != READ_ONCE(rings->cq.tail)) {

  		/* order cqe stores with ring update */

  		smp_store_release(&rings->cq.tail, ctx->cached_cq_tail);

  		if (wq_has_sleeper(&ctx->cq_wait)) {
  			wake_up_interruptible(&ctx->cq_wait);
  			kill_fasync(&ctx->cq_fasync, SIGIO, POLL_IN);
  		}
  	}
  }

  static inline void io_queue_async_work(struct io_ring_ctx *ctx,
  				       struct io_kiocb *req)
  {

  	unsigned long flags;

  	int rw = 0;

  	if (req->submit.sqe) {

  		switch (req->submit.opcode) {

  		case IORING_OP_WRITEV:
  		case IORING_OP_WRITE_FIXED:
  			rw = !(req->rw.ki_flags & IOCB_DIRECT);
  			break;
  		}

  	}

  	req->task = current;
  
  	spin_lock_irqsave(&ctx->task_lock, flags);
  	list_add(&req->task_list, &ctx->task_list);
  	req->work_task = NULL;
  	spin_unlock_irqrestore(&ctx->task_lock, flags);

  	queue_work(ctx->sqo_wq[rw], &req->work);

  }

  static void io_kill_timeout(struct io_kiocb *req)
  {
  	int ret;
  
  	ret = hrtimer_try_to_cancel(&req->timeout.timer);
  	if (ret != -1) {
  		atomic_inc(&req->ctx->cq_timeouts);
  		list_del(&req->list);
  		io_cqring_fill_event(req->ctx, req->user_data, 0);
  		__io_free_req(req);
  	}
  }
  
  static void io_kill_timeouts(struct io_ring_ctx *ctx)
  {
  	struct io_kiocb *req, *tmp;
  
  	spin_lock_irq(&ctx->completion_lock);
  	list_for_each_entry_safe(req, tmp, &ctx->timeout_list, list)
  		io_kill_timeout(req);
  	spin_unlock_irq(&ctx->completion_lock);
  }

  static void io_commit_cqring(struct io_ring_ctx *ctx)
  {
  	struct io_kiocb *req;

  	while ((req = io_get_timeout_req(ctx)) != NULL)
  		io_kill_timeout(req);

  	__io_commit_cqring(ctx);
  
  	while ((req = io_get_deferred_req(ctx)) != NULL) {

  		if (req->flags & REQ_F_SHADOW_DRAIN) {
  			/* Just for drain, free it. */
  			__io_free_req(req);
  			continue;
  		}

  		req->flags |= REQ_F_IO_DRAINED;

  		io_queue_async_work(ctx, req);

  	}
  }

  static struct io_uring_cqe *io_get_cqring(struct io_ring_ctx *ctx)
  {

  	struct io_rings *rings = ctx->rings;

  	unsigned tail;
  
  	tail = ctx->cached_cq_tail;

  	/*
  	 * writes to the cq entry need to come after reading head; the
  	 * control dependency is enough as we're using WRITE_ONCE to
  	 * fill the cq entry
  	 */

  	if (tail - READ_ONCE(rings->cq.head) == rings->cq_ring_entries)

  		return NULL;
  
  	ctx->cached_cq_tail++;

  	return &rings->cqes[tail & ctx->cq_mask];

  }
  
  static void io_cqring_fill_event(struct io_ring_ctx *ctx, u64 ki_user_data,

  				 long res)

  {
  	struct io_uring_cqe *cqe;
  
  	/*
  	 * If we can't get a cq entry, userspace overflowed the
  	 * submission (by quite a lot). Increment the overflow count in
  	 * the ring.
  	 */
  	cqe = io_get_cqring(ctx);
  	if (cqe) {
  		WRITE_ONCE(cqe->user_data, ki_user_data);
  		WRITE_ONCE(cqe->res, res);

  		WRITE_ONCE(cqe->flags, 0);

  	} else {

  		WRITE_ONCE(ctx->rings->cq_overflow,
  				atomic_inc_return(&ctx->cached_cq_overflow));

  	}
  }

  static void io_cqring_ev_posted(struct io_ring_ctx *ctx)
  {
  	if (waitqueue_active(&ctx->wait))
  		wake_up(&ctx->wait);
  	if (waitqueue_active(&ctx->sqo_wait))
  		wake_up(&ctx->sqo_wait);

  	if (ctx->cq_ev_fd)
  		eventfd_signal(ctx->cq_ev_fd, 1);

  }
  
  static void io_cqring_add_event(struct io_ring_ctx *ctx, u64 user_data,

  				long res)

  {
  	unsigned long flags;
  
  	spin_lock_irqsave(&ctx->completion_lock, flags);

  	io_cqring_fill_event(ctx, user_data, res);

  	io_commit_cqring(ctx);
  	spin_unlock_irqrestore(&ctx->completion_lock, flags);

  	io_cqring_ev_posted(ctx);

  }

  static struct io_kiocb *io_get_req(struct io_ring_ctx *ctx,
  				   struct io_submit_state *state)

  {

  	gfp_t gfp = GFP_KERNEL | __GFP_NOWARN;

  	struct io_kiocb *req;
  
  	if (!percpu_ref_tryget(&ctx->refs))
  		return NULL;

  	if (!state) {

  		req = kmem_cache_alloc(req_cachep, gfp);

  		if (unlikely(!req))
  			goto out;
  	} else if (!state->free_reqs) {
  		size_t sz;
  		int ret;
  
  		sz = min_t(size_t, state->ios_left, ARRAY_SIZE(state->reqs));

  		ret = kmem_cache_alloc_bulk(req_cachep, gfp, sz, state->reqs);
  
  		/*
  		 * Bulk alloc is all-or-nothing. If we fail to get a batch,
  		 * retry single alloc to be on the safe side.
  		 */
  		if (unlikely(ret <= 0)) {
  			state->reqs[0] = kmem_cache_alloc(req_cachep, gfp);
  			if (!state->reqs[0])
  				goto out;
  			ret = 1;
  		}

  		state->free_reqs = ret - 1;
  		state->cur_req = 1;
  		req = state->reqs[0];
  	} else {
  		req = state->reqs[state->cur_req];
  		state->free_reqs--;
  		state->cur_req++;

  	}

  	req->file = NULL;

  	req->ctx = ctx;
  	req->flags = 0;

  	/* one is dropped after submission, the other at completion */
  	refcount_set(&req->refs, 2);

  	req->result = 0;

  	req->fs = NULL;

  	return req;
  out:

  	percpu_ref_put(&ctx->refs);

  	return NULL;
  }

  static void io_free_req_many(struct io_ring_ctx *ctx, void **reqs, int *nr)
  {
  	if (*nr) {
  		kmem_cache_free_bulk(req_cachep, *nr, reqs);

  		percpu_ref_put_many(&ctx->refs, *nr);

  		*nr = 0;
  	}
  }

  static void __io_free_req(struct io_kiocb *req)

  {

  	if (req->file && !(req->flags & REQ_F_FIXED_FILE))
  		fput(req->file);

  	percpu_ref_put(&req->ctx->refs);

  	kmem_cache_free(req_cachep, req);
  }

  static void io_req_link_next(struct io_kiocb *req)
  {
  	struct io_kiocb *nxt;
  
  	/*
  	 * The list should never be empty when we are called here. But could
  	 * potentially happen if the chain is messed up, check to be on the
  	 * safe side.
  	 */
  	nxt = list_first_entry_or_null(&req->link_list, struct io_kiocb, list);
  	if (nxt) {
  		list_del(&nxt->list);
  		if (!list_empty(&req->link_list)) {
  			INIT_LIST_HEAD(&nxt->link_list);
  			list_splice(&req->link_list, &nxt->link_list);
  			nxt->flags |= REQ_F_LINK;
  		}

  		nxt->flags |= REQ_F_LINK_DONE;

  		INIT_WORK(&nxt->work, io_sq_wq_submit_work);

  		io_queue_async_work(req->ctx, nxt);

  	}
  }
  
  /*
   * Called if REQ_F_LINK is set, and we fail the head request
   */
  static void io_fail_links(struct io_kiocb *req)
  {
  	struct io_kiocb *link;
  
  	while (!list_empty(&req->link_list)) {
  		link = list_first_entry(&req->link_list, struct io_kiocb, list);
  		list_del(&link->list);
  
  		io_cqring_add_event(req->ctx, link->user_data, -ECANCELED);
  		__io_free_req(link);
  	}
  }
  
  static void io_free_req(struct io_kiocb *req)
  {
  	/*
  	 * If LINK is set, we have dependent requests in this chain. If we
  	 * didn't fail this request, queue the first one up, moving any other
  	 * dependencies to the next request. In case of failure, fail the rest
  	 * of the chain.
  	 */
  	if (req->flags & REQ_F_LINK) {
  		if (req->flags & REQ_F_FAIL_LINK)
  			io_fail_links(req);
  		else
  			io_req_link_next(req);
  	}
  
  	__io_free_req(req);
  }

  static void io_put_req(struct io_kiocb *req)
  {
  	if (refcount_dec_and_test(&req->refs))
  		io_free_req(req);

  }

  static unsigned io_cqring_events(struct io_rings *rings)

  {
  	/* See comment at the top of this file */
  	smp_rmb();

  	return READ_ONCE(rings->cq.tail) - READ_ONCE(rings->cq.head);

  }

  static inline unsigned int io_sqring_entries(struct io_ring_ctx *ctx)
  {
  	struct io_rings *rings = ctx->rings;
  
  	/* make sure SQ entry isn't read before tail */
  	return smp_load_acquire(&rings->sq.tail) - ctx->cached_sq_head;
  }

  /*
   * Find and free completed poll iocbs
   */
  static void io_iopoll_complete(struct io_ring_ctx *ctx, unsigned int *nr_events,
  			       struct list_head *done)
  {
  	void *reqs[IO_IOPOLL_BATCH];
  	struct io_kiocb *req;

  	int to_free;

  	to_free = 0;

  	while (!list_empty(done)) {
  		req = list_first_entry(done, struct io_kiocb, list);
  		list_del(&req->list);

  		io_cqring_fill_event(ctx, req->user_data, req->result);

  		(*nr_events)++;

  		if (refcount_dec_and_test(&req->refs)) {
  			/* If we're not using fixed files, we have to pair the
  			 * completion part with the file put. Use regular
  			 * completions for those, only batch free for fixed

  			 * file and non-linked commands.

  			 */

  			if ((req->flags & (REQ_F_FIXED_FILE|REQ_F_LINK)) ==
  			    REQ_F_FIXED_FILE) {

  				reqs[to_free++] = req;
  				if (to_free == ARRAY_SIZE(reqs))
  					io_free_req_many(ctx, reqs, &to_free);

  			} else {

  				io_free_req(req);

  			}

  		}

  	}

  	io_commit_cqring(ctx);

  	io_free_req_many(ctx, reqs, &to_free);
  }
  
  static int io_do_iopoll(struct io_ring_ctx *ctx, unsigned int *nr_events,
  			long min)
  {
  	struct io_kiocb *req, *tmp;
  	LIST_HEAD(done);
  	bool spin;
  	int ret;
  
  	/*
  	 * Only spin for completions if we don't have multiple devices hanging
  	 * off our complete list, and we're under the requested amount.
  	 */
  	spin = !ctx->poll_multi_file && *nr_events < min;
  
  	ret = 0;
  	list_for_each_entry_safe(req, tmp, &ctx->poll_list, list) {
  		struct kiocb *kiocb = &req->rw;
  
  		/*
  		 * Move completed entries to our local list. If we find a
  		 * request that requires polling, break out and complete
  		 * the done list first, if we have entries there.
  		 */
  		if (req->flags & REQ_F_IOPOLL_COMPLETED) {
  			list_move_tail(&req->list, &done);
  			continue;
  		}
  		if (!list_empty(&done))
  			break;
  
  		ret = kiocb->ki_filp->f_op->iopoll(kiocb, spin);
  		if (ret < 0)
  			break;
  
  		if (ret && spin)
  			spin = false;
  		ret = 0;
  	}
  
  	if (!list_empty(&done))
  		io_iopoll_complete(ctx, nr_events, &done);
  
  	return ret;
  }
  
  /*
   * Poll for a mininum of 'min' events. Note that if min == 0 we consider that a
   * non-spinning poll check - we'll still enter the driver poll loop, but only
   * as a non-spinning completion check.
   */
  static int io_iopoll_getevents(struct io_ring_ctx *ctx, unsigned int *nr_events,
  				long min)
  {

  	while (!list_empty(&ctx->poll_list) && !need_resched()) {

  		int ret;
  
  		ret = io_do_iopoll(ctx, nr_events, min);
  		if (ret < 0)
  			return ret;
  		if (!min || *nr_events >= min)
  			return 0;
  	}
  
  	return 1;
  }
  
  /*
   * We can't just wait for polled events to come to us, we have to actively
   * find and complete them.
   */
  static void io_iopoll_reap_events(struct io_ring_ctx *ctx)
  {
  	if (!(ctx->flags & IORING_SETUP_IOPOLL))
  		return;
  
  	mutex_lock(&ctx->uring_lock);
  	while (!list_empty(&ctx->poll_list)) {
  		unsigned int nr_events = 0;
  
  		io_iopoll_getevents(ctx, &nr_events, 1);

  
  		/*
  		 * Ensure we allow local-to-the-cpu processing to take place,
  		 * in this case we need to ensure that we reap all events.
  		 */
  		cond_resched();

  	}
  	mutex_unlock(&ctx->uring_lock);
  }

  static int io_iopoll_check(struct io_ring_ctx *ctx, unsigned *nr_events,
  			   long min)

  {

  	int iters = 0, ret = 0;

  	/*
  	 * We disallow the app entering submit/complete with polling, but we
  	 * still need to lock the ring to prevent racing with polled issue
  	 * that got punted to a workqueue.
  	 */
  	mutex_lock(&ctx->uring_lock);

  	do {
  		int tmin = 0;

  		/*

  		 * Don't enter poll loop if we already have events pending.
  		 * If we do, we can potentially be spinning for commands that
  		 * already triggered a CQE (eg in error).
  		 */

  		if (io_cqring_events(ctx->rings))

  			break;
  
  		/*

  		 * If a submit got punted to a workqueue, we can have the
  		 * application entering polling for a command before it gets
  		 * issued. That app will hold the uring_lock for the duration
  		 * of the poll right here, so we need to take a breather every
  		 * now and then to ensure that the issue has a chance to add
  		 * the poll to the issued list. Otherwise we can spin here
  		 * forever, while the workqueue is stuck trying to acquire the
  		 * very same mutex.
  		 */
  		if (!(++iters & 7)) {
  			mutex_unlock(&ctx->uring_lock);
  			mutex_lock(&ctx->uring_lock);
  		}

  		if (*nr_events < min)
  			tmin = min - *nr_events;
  
  		ret = io_iopoll_getevents(ctx, nr_events, tmin);
  		if (ret <= 0)
  			break;
  		ret = 0;
  	} while (min && !*nr_events && !need_resched());

  	mutex_unlock(&ctx->uring_lock);

  	return ret;
  }

  static void kiocb_end_write(struct io_kiocb *req)

  {

  	/*
  	 * Tell lockdep we inherited freeze protection from submission
  	 * thread.
  	 */
  	if (req->flags & REQ_F_ISREG) {
  		struct inode *inode = file_inode(req->file);

  		__sb_writers_acquired(inode->i_sb, SB_FREEZE_WRITE);

  	}

  	file_end_write(req->file);

  }
  
  static void io_complete_rw(struct kiocb *kiocb, long res, long res2)
  {
  	struct io_kiocb *req = container_of(kiocb, struct io_kiocb, rw);

  	if (kiocb->ki_flags & IOCB_WRITE)
  		kiocb_end_write(req);

  	if ((req->flags & REQ_F_LINK) && res != req->result)
  		req->flags |= REQ_F_FAIL_LINK;

  	io_cqring_add_event(req->ctx, req->user_data, res);

  	io_put_req(req);

  }

  static void io_complete_rw_iopoll(struct kiocb *kiocb, long res, long res2)
  {
  	struct io_kiocb *req = container_of(kiocb, struct io_kiocb, rw);

  	if (kiocb->ki_flags & IOCB_WRITE)
  		kiocb_end_write(req);

  	if ((req->flags & REQ_F_LINK) && res != req->result)
  		req->flags |= REQ_F_FAIL_LINK;
  	req->result = res;

  	if (res != -EAGAIN)
  		req->flags |= REQ_F_IOPOLL_COMPLETED;
  }
  
  /*
   * After the iocb has been issued, it's safe to be found on the poll list.
   * Adding the kiocb to the list AFTER submission ensures that we don't
   * find it from a io_iopoll_getevents() thread before the issuer is done
   * accessing the kiocb cookie.
   */
  static void io_iopoll_req_issued(struct io_kiocb *req)
  {
  	struct io_ring_ctx *ctx = req->ctx;
  
  	/*
  	 * Track whether we have multiple files in our lists. This will impact
  	 * how we do polling eventually, not spinning if we're on potentially
  	 * different devices.
  	 */
  	if (list_empty(&ctx->poll_list)) {
  		ctx->poll_multi_file = false;
  	} else if (!ctx->poll_multi_file) {
  		struct io_kiocb *list_req;
  
  		list_req = list_first_entry(&ctx->poll_list, struct io_kiocb,
  						list);
  		if (list_req->rw.ki_filp != req->rw.ki_filp)
  			ctx->poll_multi_file = true;
  	}
  
  	/*
  	 * For fast devices, IO may have already completed. If it has, add
  	 * it to the front so we find it first.
  	 */
  	if (req->flags & REQ_F_IOPOLL_COMPLETED)
  		list_add(&req->list, &ctx->poll_list);
  	else
  		list_add_tail(&req->list, &ctx->poll_list);
  }

  static void io_file_put(struct io_submit_state *state)

  {

  	if (state->file) {

  		int diff = state->has_refs - state->used_refs;
  
  		if (diff)
  			fput_many(state->file, diff);
  		state->file = NULL;
  	}
  }
  
  /*
   * Get as many references to a file as we have IOs left in this submission,
   * assuming most submissions are for one file, or at least that each file
   * has more than one submission.
   */
  static struct file *io_file_get(struct io_submit_state *state, int fd)
  {
  	if (!state)
  		return fget(fd);
  
  	if (state->file) {
  		if (state->fd == fd) {
  			state->used_refs++;
  			state->ios_left--;
  			return state->file;
  		}

  		io_file_put(state);

  	}
  	state->file = fget_many(fd, state->ios_left);
  	if (!state->file)
  		return NULL;
  
  	state->fd = fd;
  	state->has_refs = state->ios_left;
  	state->used_refs = 1;
  	state->ios_left--;
  	return state->file;
  }

  /*
   * If we tracked the file through the SCM inflight mechanism, we could support
   * any file. For now, just ensure that anything potentially problematic is done
   * inline.
   */
  static bool io_file_supports_async(struct file *file)
  {
  	umode_t mode = file_inode(file)->i_mode;
  
  	if (S_ISBLK(mode) || S_ISCHR(mode))
  		return true;
  	if (S_ISREG(mode) && file->f_op != &io_uring_fops)
  		return true;
  
  	return false;
  }

  static int io_prep_rw(struct io_kiocb *req, const struct sqe_submit *s,

  		      bool force_nonblock)

  {

  	const struct io_uring_sqe *sqe = s->sqe;

  	struct io_ring_ctx *ctx = req->ctx;

  	struct kiocb *kiocb = &req->rw;

  	unsigned ioprio;
  	int ret;

  	if (!req->file)
  		return -EBADF;

  	if (S_ISREG(file_inode(req->file)->i_mode))
  		req->flags |= REQ_F_ISREG;

  	if (force_nonblock)
  		req->fsize = rlimit(RLIMIT_FSIZE);

  	/*
  	 * If the file doesn't support async, mark it as REQ_F_MUST_PUNT so
  	 * we know to async punt it even if it was opened O_NONBLOCK
  	 */
  	if (force_nonblock && !io_file_supports_async(req->file)) {
  		req->flags |= REQ_F_MUST_PUNT;
  		return -EAGAIN;
  	}

  	kiocb->ki_pos = READ_ONCE(sqe->off);
  	kiocb->ki_flags = iocb_flags(kiocb->ki_filp);
  	kiocb->ki_hint = ki_hint_validate(file_write_hint(kiocb->ki_filp));
  
  	ioprio = READ_ONCE(sqe->ioprio);
  	if (ioprio) {
  		ret = ioprio_check_cap(ioprio);
  		if (ret)

  			return ret;

  
  		kiocb->ki_ioprio = ioprio;
  	} else
  		kiocb->ki_ioprio = get_current_ioprio();
  
  	ret = kiocb_set_rw_flags(kiocb, READ_ONCE(sqe->rw_flags));
  	if (unlikely(ret))

  		return ret;

  
  	/* don't allow async punt if RWF_NOWAIT was requested */

  	if ((kiocb->ki_flags & IOCB_NOWAIT) ||
  	    (req->file->f_flags & O_NONBLOCK))

  		req->flags |= REQ_F_NOWAIT;
  
  	if (force_nonblock)

  		kiocb->ki_flags |= IOCB_NOWAIT;

  	if (ctx->flags & IORING_SETUP_IOPOLL) {

  		if (!(kiocb->ki_flags & IOCB_DIRECT) ||
  		    !kiocb->ki_filp->f_op->iopoll)

  			return -EOPNOTSUPP;

  		kiocb->ki_flags |= IOCB_HIPRI;
  		kiocb->ki_complete = io_complete_rw_iopoll;

  		req->result = 0;

  	} else {

  		if (kiocb->ki_flags & IOCB_HIPRI)
  			return -EINVAL;

  		kiocb->ki_complete = io_complete_rw;
  	}

  	return 0;

  }
  
  static inline void io_rw_done(struct kiocb *kiocb, ssize_t ret)
  {
  	switch (ret) {
  	case -EIOCBQUEUED:
  		break;
  	case -ERESTARTSYS:
  	case -ERESTARTNOINTR:
  	case -ERESTARTNOHAND:
  	case -ERESTART_RESTARTBLOCK:
  		/*
  		 * We can't just restart the syscall, since previously
  		 * submitted sqes may already be in progress. Just fail this
  		 * IO with EINTR.
  		 */
  		ret = -EINTR;
  		/* fall through */
  	default:
  		kiocb->ki_complete(kiocb, ret, 0);
  	}
  }

  static int io_import_fixed(struct io_ring_ctx *ctx, int rw,
  			   const struct io_uring_sqe *sqe,
  			   struct iov_iter *iter)
  {
  	size_t len = READ_ONCE(sqe->len);
  	struct io_mapped_ubuf *imu;
  	unsigned index, buf_index;
  	size_t offset;
  	u64 buf_addr;
  
  	/* attempt to use fixed buffers without having provided iovecs */
  	if (unlikely(!ctx->user_bufs))
  		return -EFAULT;
  
  	buf_index = READ_ONCE(sqe->buf_index);
  	if (unlikely(buf_index >= ctx->nr_user_bufs))
  		return -EFAULT;
  
  	index = array_index_nospec(buf_index, ctx->nr_user_bufs);
  	imu = &ctx->user_bufs[index];
  	buf_addr = READ_ONCE(sqe->addr);
  
  	/* overflow */
  	if (buf_addr + len < buf_addr)
  		return -EFAULT;
  	/* not inside the mapped region */
  	if (buf_addr < imu->ubuf || buf_addr + len > imu->ubuf + imu->len)
  		return -EFAULT;
  
  	/*
  	 * May not be a start of buffer, set size appropriately
  	 * and advance us to the beginning.
  	 */
  	offset = buf_addr - imu->ubuf;
  	iov_iter_bvec(iter, rw, imu->bvec, imu->nr_bvecs, offset + len);

  
  	if (offset) {
  		/*
  		 * Don't use iov_iter_advance() here, as it's really slow for
  		 * using the latter parts of a big fixed buffer - it iterates
  		 * over each segment manually. We can cheat a bit here, because
  		 * we know that:
  		 *
  		 * 1) it's a BVEC iter, we set it up
  		 * 2) all bvecs are PAGE_SIZE in size, except potentially the
  		 *    first and last bvec
  		 *
  		 * So just find our index, and adjust the iterator afterwards.
  		 * If the offset is within the first bvec (or the whole first
  		 * bvec, just use iov_iter_advance(). This makes it easier
  		 * since we can just skip the first segment, which may not
  		 * be PAGE_SIZE aligned.
  		 */
  		const struct bio_vec *bvec = imu->bvec;
  
  		if (offset <= bvec->bv_len) {
  			iov_iter_advance(iter, offset);
  		} else {
  			unsigned long seg_skip;
  
  			/* skip first vec */
  			offset -= bvec->bv_len;
  			seg_skip = 1 + (offset >> PAGE_SHIFT);
  
  			iter->bvec = bvec + seg_skip;
  			iter->nr_segs -= seg_skip;

  			iter->count -= bvec->bv_len + offset;

  			iter->iov_offset = offset & ~PAGE_MASK;

  		}
  	}

  	return len;

  }

  static ssize_t io_import_iovec(struct io_ring_ctx *ctx, int rw,

  			       struct io_kiocb *req, struct iovec **iovec,

  			       struct iov_iter *iter)

  {

  	const struct io_uring_sqe *sqe = req->submit.sqe;

  	void __user *buf = u64_to_user_ptr(READ_ONCE(sqe->addr));
  	size_t sqe_len = READ_ONCE(sqe->len);

  	u8 opcode;

  	opcode = req->submit.opcode;

  	if (opcode == IORING_OP_READ_FIXED ||
  	    opcode == IORING_OP_WRITE_FIXED) {

  		ssize_t ret = io_import_fixed(ctx, rw, sqe, iter);

  		*iovec = NULL;
  		return ret;
  	}

  	if (!req->submit.has_user)

  		return -EFAULT;
  
  #ifdef CONFIG_COMPAT
  	if (ctx->compat)
  		return compat_import_iovec(rw, buf, sqe_len, UIO_FASTIOV,
  						iovec, iter);
  #endif
  
  	return import_iovec(rw, buf, sqe_len, UIO_FASTIOV, iovec, iter);
  }

  static inline bool io_should_merge(struct async_list *al, struct kiocb *kiocb)
  {
  	if (al->file == kiocb->ki_filp) {
  		off_t start, end;
  
  		/*
  		 * Allow merging if we're anywhere in the range of the same
  		 * page. Generally this happens for sub-page reads or writes,
  		 * and it's beneficial to allow the first worker to bring the
  		 * page in and the piggy backed work can then work on the
  		 * cached page.
  		 */
  		start = al->io_start & PAGE_MASK;
  		end = (al->io_start + al->io_len + PAGE_SIZE - 1) & PAGE_MASK;
  		if (kiocb->ki_pos >= start && kiocb->ki_pos <= end)
  			return true;
  	}
  
  	al->file = NULL;
  	return false;
  }

  /*
   * Make a note of the last file/offset/direction we punted to async
   * context. We'll use this information to see if we can piggy back a
   * sequential request onto the previous one, if it's still hasn't been
   * completed by the async worker.
   */
  static void io_async_list_note(int rw, struct io_kiocb *req, size_t len)
  {
  	struct async_list *async_list = &req->ctx->pending_async[rw];
  	struct kiocb *kiocb = &req->rw;
  	struct file *filp = kiocb->ki_filp;

  	if (io_should_merge(async_list, kiocb)) {

  		unsigned long max_bytes;

  
  		/* Use 8x RA size as a decent limiter for both reads/writes */

  		max_bytes = filp->f_ra.ra_pages << (PAGE_SHIFT + 3);
  		if (!max_bytes)
  			max_bytes = VM_READAHEAD_PAGES << (PAGE_SHIFT + 3);
  
  		/* If max len are exceeded, reset the state */
  		if (async_list->io_len + len <= max_bytes) {

  			req->flags |= REQ_F_SEQ_PREV;

  			async_list->io_len += len;

  		} else {

  			async_list->file = NULL;

  		}
  	}
  
  	/* New file? Reset state. */
  	if (async_list->file != filp) {

  		async_list->io_start = kiocb->ki_pos;
  		async_list->io_len = len;

  		async_list->file = filp;
  	}

  }

  /*
   * For files that don't have ->read_iter() and ->write_iter(), handle them
   * by looping over ->read() or ->write() manually.
   */
  static ssize_t loop_rw_iter(int rw, struct file *file, struct kiocb *kiocb,
  			   struct iov_iter *iter)
  {
  	ssize_t ret = 0;
  
  	/*
  	 * Don't support polled IO through this interface, and we can't
  	 * support non-blocking either. For the latter, this just causes
  	 * the kiocb to be handled from an async context.
  	 */
  	if (kiocb->ki_flags & IOCB_HIPRI)
  		return -EOPNOTSUPP;
  	if (kiocb->ki_flags & IOCB_NOWAIT)
  		return -EAGAIN;
  
  	while (iov_iter_count(iter)) {

  		struct iovec iovec;

  		ssize_t nr;

  		if (!iov_iter_is_bvec(iter)) {
  			iovec = iov_iter_iovec(iter);
  		} else {
  			/* fixed buffers import bvec */
  			iovec.iov_base = kmap(iter->bvec->bv_page)
  						+ iter->iov_offset;
  			iovec.iov_len = min(iter->count,
  					iter->bvec->bv_len - iter->iov_offset);
  		}

  		if (rw == READ) {
  			nr = file->f_op->read(file, iovec.iov_base,
  					      iovec.iov_len, &kiocb->ki_pos);
  		} else {
  			nr = file->f_op->write(file, iovec.iov_base,
  					       iovec.iov_len, &kiocb->ki_pos);
  		}

  		if (iov_iter_is_bvec(iter))
  			kunmap(iter->bvec->bv_page);

  		if (nr < 0) {
  			if (!ret)
  				ret = nr;
  			break;
  		}
  		ret += nr;
  		if (nr != iovec.iov_len)
  			break;
  		iov_iter_advance(iter, nr);
  	}
  
  	return ret;
  }

  static int io_read(struct io_kiocb *req, const struct sqe_submit *s,

  		   bool force_nonblock)

  {
  	struct iovec inline_vecs[UIO_FASTIOV], *iovec = inline_vecs;
  	struct kiocb *kiocb = &req->rw;
  	struct iov_iter iter;
  	struct file *file;

  	size_t iov_count;

  	ssize_t read_size, ret;

  	ret = io_prep_rw(req, s, force_nonblock);

  	if (ret)
  		return ret;
  	file = kiocb->ki_filp;

  	if (unlikely(!(file->f_mode & FMODE_READ)))

  		return -EBADF;

  	ret = io_import_iovec(req->ctx, READ, req, &iovec, &iter);

  	if (ret < 0)

  		return ret;

  	read_size = ret;

  	if (req->flags & REQ_F_LINK)
  		req->result = read_size;

  	iov_count = iov_iter_count(&iter);
  	ret = rw_verify_area(READ, file, &kiocb->ki_pos, iov_count);

  	if (!ret) {
  		ssize_t ret2;

  		if (file->f_op->read_iter)
  			ret2 = call_read_iter(file, kiocb, &iter);

  		else if (req->file->f_op->read)

  			ret2 = loop_rw_iter(READ, file, kiocb, &iter);

  		else
  			ret2 = -EINVAL;

  		/*
  		 * In case of a short read, punt to async. This can happen
  		 * if we have data partially cached. Alternatively we can
  		 * return the short read, in which case the application will
  		 * need to issue another SQE and wait for it. That SQE will
  		 * need async punt anyway, so it's more efficient to do it
  		 * here.
  		 */

  		if (force_nonblock && !(req->flags & REQ_F_NOWAIT) &&
  		    (req->flags & REQ_F_ISREG) &&
  		    ret2 > 0 && ret2 < read_size)

  			ret2 = -EAGAIN;
  		/* Catch -EAGAIN return for forced non-blocking submission */

  		if (!force_nonblock || ret2 != -EAGAIN) {

  			io_rw_done(kiocb, ret2);

  		} else {
  			/*
  			 * If ->needs_lock is true, we're already in async
  			 * context.
  			 */
  			if (!s->needs_lock)
  				io_async_list_note(READ, req, iov_count);

  			ret = -EAGAIN;

  		}

  	}
  	kfree(iovec);

  	return ret;
  }

  static int io_write(struct io_kiocb *req, const struct sqe_submit *s,

  		    bool force_nonblock)

  {
  	struct iovec inline_vecs[UIO_FASTIOV], *iovec = inline_vecs;
  	struct kiocb *kiocb = &req->rw;
  	struct iov_iter iter;
  	struct file *file;

  	size_t iov_count;

  	ssize_t ret;

  	ret = io_prep_rw(req, s, force_nonblock);

  	if (ret)
  		return ret;

  	file = kiocb->ki_filp;
  	if (unlikely(!(file->f_mode & FMODE_WRITE)))

  		return -EBADF;

  	ret = io_import_iovec(req->ctx, WRITE, req, &iovec, &iter);

  	if (ret < 0)

  		return ret;

  	if (req->flags & REQ_F_LINK)
  		req->result = ret;

  	iov_count = iov_iter_count(&iter);
  
  	ret = -EAGAIN;
  	if (force_nonblock && !(kiocb->ki_flags & IOCB_DIRECT)) {
  		/* If ->needs_lock is true, we're already in async context. */
  		if (!s->needs_lock)
  			io_async_list_note(WRITE, req, iov_count);
  		goto out_free;
  	}
  
  	ret = rw_verify_area(WRITE, file, &kiocb->ki_pos, iov_count);

  	if (!ret) {

  		ssize_t ret2;

  		/*
  		 * Open-code file_start_write here to grab freeze protection,
  		 * which will be released by another thread in
  		 * io_complete_rw().  Fool lockdep by telling it the lock got
  		 * released so that it doesn't complain about the held lock when
  		 * we return to userspace.
  		 */

  		if (req->flags & REQ_F_ISREG) {

  			__sb_start_write(file_inode(file)->i_sb,
  						SB_FREEZE_WRITE, true);
  			__sb_writers_release(file_inode(file)->i_sb,
  						SB_FREEZE_WRITE);
  		}
  		kiocb->ki_flags |= IOCB_WRITE;

  		if (!force_nonblock)
  			current->signal->rlim[RLIMIT_FSIZE].rlim_cur = req->fsize;

  		if (file->f_op->write_iter)
  			ret2 = call_write_iter(file, kiocb, &iter);

  		else if (req->file->f_op->write)

  			ret2 = loop_rw_iter(WRITE, file, kiocb, &iter);

  		else
  			ret2 = -EINVAL;

  
  		if (!force_nonblock)
  			current->signal->rlim[RLIMIT_FSIZE].rlim_cur = RLIM_INFINITY;

  		if (!force_nonblock || ret2 != -EAGAIN) {
  			io_rw_done(kiocb, ret2);
  		} else {
  			/*
  			 * If ->needs_lock is true, we're already in async
  			 * context.
  			 */
  			if (!s->needs_lock)
  				io_async_list_note(WRITE, req, iov_count);
  			ret = -EAGAIN;
  		}

  	}

  out_free:

  	kfree(iovec);

  	return ret;
  }
  
  /*
   * IORING_OP_NOP just posts a completion event, nothing else.
   */
  static int io_nop(struct io_kiocb *req, u64 user_data)
  {
  	struct io_ring_ctx *ctx = req->ctx;
  	long err = 0;

  	if (unlikely(ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;

  	io_cqring_add_event(ctx, user_data, err);

  	io_put_req(req);

  	return 0;
  }

  static int io_prep_fsync(struct io_kiocb *req, const struct io_uring_sqe *sqe)
  {

  	struct io_ring_ctx *ctx = req->ctx;

  	if (!req->file)
  		return -EBADF;

  	if (unlikely(ctx->flags & IORING_SETUP_IOPOLL))

  		return -EINVAL;

  	if (unlikely(sqe->addr || sqe->ioprio || sqe->buf_index))

  		return -EINVAL;

  	return 0;
  }
  
  static int io_fsync(struct io_kiocb *req, const struct io_uring_sqe *sqe,
  		    bool force_nonblock)
  {
  	loff_t sqe_off = READ_ONCE(sqe->off);
  	loff_t sqe_len = READ_ONCE(sqe->len);
  	loff_t end = sqe_off + sqe_len;
  	unsigned fsync_flags;
  	int ret;
  
  	fsync_flags = READ_ONCE(sqe->fsync_flags);
  	if (unlikely(fsync_flags & ~IORING_FSYNC_DATASYNC))
  		return -EINVAL;
  
  	ret = io_prep_fsync(req, sqe);
  	if (ret)
  		return ret;
  
  	/* fsync always requires a blocking context */
  	if (force_nonblock)
  		return -EAGAIN;
  
  	ret = vfs_fsync_range(req->rw.ki_filp, sqe_off,
  				end > 0 ? end : LLONG_MAX,
  				fsync_flags & IORING_FSYNC_DATASYNC);

  	if (ret < 0 && (req->flags & REQ_F_LINK))
  		req->flags |= REQ_F_FAIL_LINK;

  	io_cqring_add_event(req->ctx, sqe->user_data, ret);

  	io_put_req(req);

  	return 0;
  }

  static int io_prep_sfr(struct io_kiocb *req, const struct io_uring_sqe *sqe)
  {
  	struct io_ring_ctx *ctx = req->ctx;
  	int ret = 0;
  
  	if (!req->file)
  		return -EBADF;

  
  	if (unlikely(ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;
  	if (unlikely(sqe->addr || sqe->ioprio || sqe->buf_index))
  		return -EINVAL;

  	return ret;
  }
  
  static int io_sync_file_range(struct io_kiocb *req,
  			      const struct io_uring_sqe *sqe,
  			      bool force_nonblock)
  {
  	loff_t sqe_off;
  	loff_t sqe_len;
  	unsigned flags;
  	int ret;
  
  	ret = io_prep_sfr(req, sqe);
  	if (ret)
  		return ret;
  
  	/* sync_file_range always requires a blocking context */
  	if (force_nonblock)
  		return -EAGAIN;
  
  	sqe_off = READ_ONCE(sqe->off);
  	sqe_len = READ_ONCE(sqe->len);
  	flags = READ_ONCE(sqe->sync_range_flags);
  
  	ret = sync_file_range(req->rw.ki_filp, sqe_off, sqe_len, flags);

  	if (ret < 0 && (req->flags & REQ_F_LINK))
  		req->flags |= REQ_F_FAIL_LINK;

  	io_cqring_add_event(req->ctx, sqe->user_data, ret);

  	io_put_req(req);
  	return 0;
  }

  #if defined(CONFIG_NET)

  static int io_send_recvmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe,
  			   bool force_nonblock,
  		   long (*fn)(struct socket *, struct user_msghdr __user *,
  				unsigned int))
  {

  	struct socket *sock;
  	int ret;
  
  	if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;
  
  	sock = sock_from_file(req->file, &ret);
  	if (sock) {
  		struct user_msghdr __user *msg;
  		unsigned flags;
  
  		flags = READ_ONCE(sqe->msg_flags);
  		if (flags & MSG_DONTWAIT)
  			req->flags |= REQ_F_NOWAIT;
  		else if (force_nonblock)
  			flags |= MSG_DONTWAIT;

  #ifdef CONFIG_COMPAT
  		if (req->ctx->compat)
  			flags |= MSG_CMSG_COMPAT;
  #endif

  		msg = (struct user_msghdr __user *) (unsigned long)
  			READ_ONCE(sqe->addr);

  		ret = fn(sock, msg, flags);

  		if (force_nonblock && ret == -EAGAIN)
  			return ret;

  		if (ret == -ERESTARTSYS)
  			ret = -EINTR;

  	}

  	if (req->fs) {
  		struct fs_struct *fs = req->fs;
  
  		spin_lock(&req->fs->lock);
  		if (--fs->users)
  			fs = NULL;
  		spin_unlock(&req->fs->lock);
  		if (fs)
  			free_fs_struct(fs);
  	}

  	io_cqring_add_event(req->ctx, sqe->user_data, ret);

  	io_put_req(req);
  	return 0;
  }

  #endif
  
  static int io_sendmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe,
  		      bool force_nonblock)
  {
  #if defined(CONFIG_NET)
  	return io_send_recvmsg(req, sqe, force_nonblock, __sys_sendmsg_sock);
  #else
  	return -EOPNOTSUPP;
  #endif
  }
  
  static int io_recvmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe,
  		      bool force_nonblock)
  {
  #if defined(CONFIG_NET)
  	return io_send_recvmsg(req, sqe, force_nonblock, __sys_recvmsg_sock);

  #else
  	return -EOPNOTSUPP;
  #endif
  }

  static void io_poll_remove_one(struct io_kiocb *req)
  {
  	struct io_poll_iocb *poll = &req->poll;
  
  	spin_lock(&poll->head->lock);
  	WRITE_ONCE(poll->canceled, true);
  	if (!list_empty(&poll->wait.entry)) {
  		list_del_init(&poll->wait.entry);

  		io_queue_async_work(req->ctx, req);

  	}
  	spin_unlock(&poll->head->lock);
  
  	list_del_init(&req->list);
  }
  
  static void io_poll_remove_all(struct io_ring_ctx *ctx)
  {
  	struct io_kiocb *req;
  
  	spin_lock_irq(&ctx->completion_lock);
  	while (!list_empty(&ctx->cancel_list)) {
  		req = list_first_entry(&ctx->cancel_list, struct io_kiocb,list);
  		io_poll_remove_one(req);
  	}
  	spin_unlock_irq(&ctx->completion_lock);
  }
  
  /*
   * Find a running poll command that matches one specified in sqe->addr,
   * and remove it if found.
   */
  static int io_poll_remove(struct io_kiocb *req, const struct io_uring_sqe *sqe)
  {
  	struct io_ring_ctx *ctx = req->ctx;
  	struct io_kiocb *poll_req, *next;
  	int ret = -ENOENT;
  
  	if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;
  	if (sqe->ioprio || sqe->off || sqe->len || sqe->buf_index ||
  	    sqe->poll_events)
  		return -EINVAL;
  
  	spin_lock_irq(&ctx->completion_lock);
  	list_for_each_entry_safe(poll_req, next, &ctx->cancel_list, list) {
  		if (READ_ONCE(sqe->addr) == poll_req->user_data) {
  			io_poll_remove_one(poll_req);
  			ret = 0;
  			break;
  		}
  	}
  	spin_unlock_irq(&ctx->completion_lock);

  	io_cqring_add_event(req->ctx, sqe->user_data, ret);

  	io_put_req(req);

  	return 0;
  }

  static void io_poll_complete(struct io_ring_ctx *ctx, struct io_kiocb *req,
  			     __poll_t mask)

  {

  	req->poll.done = true;

  	io_cqring_fill_event(ctx, req->user_data, mangle_poll(mask));

  	io_commit_cqring(ctx);

  }
  
  static void io_poll_complete_work(struct work_struct *work)
  {
  	struct io_kiocb *req = container_of(work, struct io_kiocb, work);
  	struct io_poll_iocb *poll = &req->poll;
  	struct poll_table_struct pt = { ._key = poll->events };
  	struct io_ring_ctx *ctx = req->ctx;

  	const struct cred *old_cred;

  	__poll_t mask = 0;

  	old_cred = override_creds(ctx->creds);

  	if (!READ_ONCE(poll->canceled))
  		mask = vfs_poll(poll->file, &pt) & poll->events;
  
  	/*
  	 * Note that ->ki_cancel callers also delete iocb from active_reqs after
  	 * calling ->ki_cancel.  We need the ctx_lock roundtrip here to
  	 * synchronize with them.  In the cancellation case the list_del_init
  	 * itself is not actually needed, but harmless so we keep it in to
  	 * avoid further branches in the fast path.
  	 */
  	spin_lock_irq(&ctx->completion_lock);
  	if (!mask && !READ_ONCE(poll->canceled)) {
  		add_wait_queue(poll->head, &poll->wait);
  		spin_unlock_irq(&ctx->completion_lock);

  		goto out;

  	}
  	list_del_init(&req->list);

  	io_poll_complete(ctx, req, mask);

  	spin_unlock_irq(&ctx->completion_lock);

  	io_cqring_ev_posted(ctx);
  	io_put_req(req);

  out:
  	revert_creds(old_cred);

  }
  
  static int io_poll_wake(struct wait_queue_entry *wait, unsigned mode, int sync,
  			void *key)
  {
  	struct io_poll_iocb *poll = container_of(wait, struct io_poll_iocb,
  							wait);
  	struct io_kiocb *req = container_of(poll, struct io_kiocb, poll);
  	struct io_ring_ctx *ctx = req->ctx;
  	__poll_t mask = key_to_poll(key);

  	unsigned long flags;

  
  	/* for instances that support it check for an event match first: */

  	if (mask && !(mask & poll->events))
  		return 0;

  	list_del_init(&poll->wait.entry);

  	if (mask && spin_trylock_irqsave(&ctx->completion_lock, flags)) {
  		list_del(&req->list);
  		io_poll_complete(ctx, req, mask);
  		spin_unlock_irqrestore(&ctx->completion_lock, flags);

  		io_cqring_ev_posted(ctx);
  		io_put_req(req);
  	} else {

  		io_queue_async_work(ctx, req);

  	}

  	return 1;
  }
  
  struct io_poll_table {
  	struct poll_table_struct pt;
  	struct io_kiocb *req;
  	int error;
  };
  
  static void io_poll_queue_proc(struct file *file, struct wait_queue_head *head,
  			       struct poll_table_struct *p)
  {
  	struct io_poll_table *pt = container_of(p, struct io_poll_table, pt);
  
  	if (unlikely(pt->req->poll.head)) {
  		pt->error = -EINVAL;
  		return;
  	}
  
  	pt->error = 0;
  	pt->req->poll.head = head;
  	add_wait_queue(head, &pt->req->poll.wait);
  }
  
  static int io_poll_add(struct io_kiocb *req, const struct io_uring_sqe *sqe)
  {
  	struct io_poll_iocb *poll = &req->poll;
  	struct io_ring_ctx *ctx = req->ctx;
  	struct io_poll_table ipt;

  	bool cancel = false;

  	__poll_t mask;
  	u16 events;

  
  	if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;
  	if (sqe->addr || sqe->ioprio || sqe->off || sqe->len || sqe->buf_index)
  		return -EINVAL;

  	if (!poll->file)
  		return -EBADF;

  	req->submit.sqe = NULL;

  	INIT_WORK(&req->work, io_poll_complete_work);
  	events = READ_ONCE(sqe->poll_events);
  	poll->events = demangle_poll(events) | EPOLLERR | EPOLLHUP;

  	poll->head = NULL;

  	poll->done = false;

  	poll->canceled = false;
  
  	ipt.pt._qproc = io_poll_queue_proc;
  	ipt.pt._key = poll->events;
  	ipt.req = req;
  	ipt.error = -EINVAL; /* same as no support for IOCB_CMD_POLL */
  
  	/* initialized the list so that we can do list_empty checks */
  	INIT_LIST_HEAD(&poll->wait.entry);
  	init_waitqueue_func_entry(&poll->wait, io_poll_wake);

  	INIT_LIST_HEAD(&req->list);

  	mask = vfs_poll(poll->file, &ipt.pt) & poll->events;

  
  	spin_lock_irq(&ctx->completion_lock);

  	if (likely(poll->head)) {
  		spin_lock(&poll->head->lock);
  		if (unlikely(list_empty(&poll->wait.entry))) {
  			if (ipt.error)
  				cancel = true;
  			ipt.error = 0;
  			mask = 0;
  		}
  		if (mask || ipt.error)
  			list_del_init(&poll->wait.entry);
  		else if (cancel)
  			WRITE_ONCE(poll->canceled, true);
  		else if (!poll->done) /* actually waiting for an event */
  			list_add_tail(&req->list, &ctx->cancel_list);
  		spin_unlock(&poll->head->lock);
  	}
  	if (mask) { /* no async, we'd stolen it */

  		ipt.error = 0;

  		io_poll_complete(ctx, req, mask);

  	}

  	spin_unlock_irq(&ctx->completion_lock);

  	if (mask) {
  		io_cqring_ev_posted(ctx);

  		io_put_req(req);

  	}

  	return ipt.error;

  }

  static enum hrtimer_restart io_timeout_fn(struct hrtimer *timer)
  {
  	struct io_ring_ctx *ctx;

  	struct io_kiocb *req, *prev;

  	unsigned long flags;
  
  	req = container_of(timer, struct io_kiocb, timeout.timer);
  	ctx = req->ctx;
  	atomic_inc(&ctx->cq_timeouts);
  
  	spin_lock_irqsave(&ctx->completion_lock, flags);

  	/*
  	 * Adjust the reqs sequence before the current one because it
  	 * will consume a slot in the cq_ring and the the cq_tail pointer
  	 * will be increased, otherwise other timeout reqs may return in
  	 * advance without waiting for enough wait_nr.
  	 */
  	prev = req;
  	list_for_each_entry_continue_reverse(prev, &ctx->timeout_list, list)
  		prev->sequence++;

  	list_del(&req->list);
  
  	io_cqring_fill_event(ctx, req->user_data, -ETIME);
  	io_commit_cqring(ctx);
  	spin_unlock_irqrestore(&ctx->completion_lock, flags);
  
  	io_cqring_ev_posted(ctx);
  
  	io_put_req(req);
  	return HRTIMER_NORESTART;
  }
  
  static int io_timeout(struct io_kiocb *req, const struct io_uring_sqe *sqe)
  {

  	unsigned count;

  	struct io_ring_ctx *ctx = req->ctx;
  	struct list_head *entry;

  	struct timespec64 ts;

  	unsigned span = 0;

  
  	if (unlikely(ctx->flags & IORING_SETUP_IOPOLL))
  		return -EINVAL;
  	if (sqe->flags || sqe->ioprio || sqe->buf_index || sqe->timeout_flags ||
  	    sqe->len != 1)
  		return -EINVAL;

  
  	if (get_timespec64(&ts, u64_to_user_ptr(sqe->addr)))

  		return -EFAULT;

  	req->flags |= REQ_F_TIMEOUT;

  	/*
  	 * sqe->off holds how many events that need to occur for this

  	 * timeout event to be satisfied. If it isn't set, then this is
  	 * a pure timeout request, sequence isn't used.

  	 */
  	count = READ_ONCE(sqe->off);

  	if (!count) {
  		req->flags |= REQ_F_TIMEOUT_NOSEQ;
  		spin_lock_irq(&ctx->completion_lock);
  		entry = ctx->timeout_list.prev;
  		goto add;
  	}

  
  	req->sequence = ctx->cached_sq_head + count - 1;

  	/* reuse it to store the count */
  	req->submit.sequence = count;

  
  	/*
  	 * Insertion sort, ensuring the first entry in the list is always
  	 * the one we need first.
  	 */

  	spin_lock_irq(&ctx->completion_lock);
  	list_for_each_prev(entry, &ctx->timeout_list) {
  		struct io_kiocb *nxt = list_entry(entry, struct io_kiocb, list);

  		unsigned nxt_sq_head;
  		long long tmp, tmp_nxt;

  		if (nxt->flags & REQ_F_TIMEOUT_NOSEQ)
  			continue;

  		/*
  		 * Since cached_sq_head + count - 1 can overflow, use type long
  		 * long to store it.
  		 */
  		tmp = (long long)ctx->cached_sq_head + count - 1;
  		nxt_sq_head = nxt->sequence - nxt->submit.sequence + 1;
  		tmp_nxt = (long long)nxt_sq_head + nxt->submit.sequence - 1;
  
  		/*
  		 * cached_sq_head may overflow, and it will never overflow twice
  		 * once there is some timeout req still be valid.
  		 */
  		if (ctx->cached_sq_head < nxt_sq_head)

  			tmp += UINT_MAX;

  		if (tmp > tmp_nxt)

  			break;

  
  		/*
  		 * Sequence of reqs after the insert one and itself should
  		 * be adjusted because each timeout req consumes a slot.
  		 */
  		span++;
  		nxt->sequence++;

  	}

  	req->sequence -= span;

  add:

  	list_add(&req->list, entry);
  	spin_unlock_irq(&ctx->completion_lock);
  
  	hrtimer_init(&req->timeout.timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
  	req->timeout.timer.function = io_timeout_fn;

  	hrtimer_start(&req->timeout.timer, timespec64_to_ktime(ts),

  			HRTIMER_MODE_REL);
  	return 0;
  }

  static int io_req_defer(struct io_ring_ctx *ctx, struct io_kiocb *req,

  			struct sqe_submit *s)

  {
  	struct io_uring_sqe *sqe_copy;
  
  	if (!io_sequence_defer(ctx, req) && list_empty(&ctx->defer_list))
  		return 0;
  
  	sqe_copy = kmalloc(sizeof(*sqe_copy), GFP_KERNEL);
  	if (!sqe_copy)
  		return -EAGAIN;
  
  	spin_lock_irq(&ctx->completion_lock);
  	if (!io_sequence_defer(ctx, req) && list_empty(&ctx->defer_list)) {
  		spin_unlock_irq(&ctx->completion_lock);
  		kfree(sqe_copy);
  		return 0;
  	}

  	memcpy(&req->submit, s, sizeof(*s));
  	memcpy(sqe_copy, s->sqe, sizeof(*sqe_copy));

  	req->submit.sqe = sqe_copy;
  
  	INIT_WORK(&req->work, io_sq_wq_submit_work);
  	list_add_tail(&req->list, &ctx->defer_list);
  	spin_unlock_irq(&ctx->completion_lock);
  	return -EIOCBQUEUED;
  }

  static int __io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req,

  			   const struct sqe_submit *s, bool force_nonblock)

  {

  	int ret;

  	req->user_data = READ_ONCE(s->sqe->user_data);

  	if (unlikely(s->index >= ctx->sq_entries))
  		return -EINVAL;

  	switch (req->submit.opcode) {

  	case IORING_OP_NOP:
  		ret = io_nop(req, req->user_data);
  		break;
  	case IORING_OP_READV:

  		if (unlikely(s->sqe->buf_index))
  			return -EINVAL;

  		ret = io_read(req, s, force_nonblock);

  		break;
  	case IORING_OP_WRITEV:

  		if (unlikely(s->sqe->buf_index))
  			return -EINVAL;

  		ret = io_write(req, s, force_nonblock);

  		break;
  	case IORING_OP_READ_FIXED:

  		ret = io_read(req, s, force_nonblock);

  		break;
  	case IORING_OP_WRITE_FIXED:

  		ret = io_write(req, s, force_nonblock);

  		break;

  	case IORING_OP_FSYNC:
  		ret = io_fsync(req, s->sqe, force_nonblock);
  		break;

  	case IORING_OP_POLL_ADD:
  		ret = io_poll_add(req, s->sqe);
  		break;
  	case IORING_OP_POLL_REMOVE:
  		ret = io_poll_remove(req, s->sqe);
  		break;

  	case IORING_OP_SYNC_FILE_RANGE:
  		ret = io_sync_file_range(req, s->sqe, force_nonblock);
  		break;

  	case IORING_OP_SENDMSG:
  		ret = io_sendmsg(req, s->sqe, force_nonblock);
  		break;

  	case IORING_OP_RECVMSG:
  		ret = io_recvmsg(req, s->sqe, force_nonblock);
  		break;

  	case IORING_OP_TIMEOUT:
  		ret = io_timeout(req, s->sqe);
  		break;

  	default:
  		ret = -EINVAL;
  		break;
  	}

  	if (ret)
  		return ret;
  
  	if (ctx->flags & IORING_SETUP_IOPOLL) {

  		if (req->result == -EAGAIN)

  			return -EAGAIN;
  
  		/* workqueue context doesn't hold uring_lock, grab it now */
  		if (s->needs_lock)
  			mutex_lock(&ctx->uring_lock);
  		io_iopoll_req_issued(req);
  		if (s->needs_lock)
  			mutex_unlock(&ctx->uring_lock);
  	}
  
  	return 0;

  }

  static struct async_list *io_async_list_from_req(struct io_ring_ctx *ctx,
  						 struct io_kiocb *req)

  {

  	switch (req->submit.opcode) {

  	case IORING_OP_READV:
  	case IORING_OP_READ_FIXED:
  		return &ctx->pending_async[READ];
  	case IORING_OP_WRITEV:
  	case IORING_OP_WRITE_FIXED:
  		return &ctx->pending_async[WRITE];
  	default:
  		return NULL;
  	}
  }

  static inline bool io_req_needs_user(struct io_kiocb *req)

  {

  	return !(req->submit.opcode == IORING_OP_READ_FIXED ||
  		req->submit.opcode == IORING_OP_WRITE_FIXED);

  }

  static void io_sq_wq_submit_work(struct work_struct *work)
  {
  	struct io_kiocb *req = container_of(work, struct io_kiocb, work);

  	struct fs_struct *old_fs_struct = current->fs;

  	struct io_ring_ctx *ctx = req->ctx;

  	struct mm_struct *cur_mm = NULL;
  	struct async_list *async_list;

  	const struct cred *old_cred;

  	LIST_HEAD(req_list);

  	mm_segment_t old_fs;

  	int ret;

  	old_cred = override_creds(ctx->creds);

  	async_list = io_async_list_from_req(ctx, req);

  
  	allow_kernel_signal(SIGINT);

  restart:
  	do {
  		struct sqe_submit *s = &req->submit;
  		const struct io_uring_sqe *sqe = s->sqe;

  		unsigned int flags = req->flags;

  		/* Ensure we clear previously set non-block flag */

  		req->rw.ki_flags &= ~IOCB_NOWAIT;

  		if (req->fs != current->fs && current->fs != old_fs_struct) {
  			task_lock(current);
  			if (req->fs)
  				current->fs = req->fs;
  			else
  				current->fs = old_fs_struct;
  			task_unlock(current);
  		}

  		ret = 0;

  		if (io_req_needs_user(req) && !cur_mm) {

  			if (!mmget_not_zero(ctx->sqo_mm)) {
  				ret = -EFAULT;

  				goto end_req;