[linux-2.6-block.git] / include / linux / io_uring_types.h

#ifndef IO_URING_TYPES_H
#define IO_URING_TYPES_H

#include <linux/blkdev.h>
#include <linux/task_work.h>
#include <linux/bitmap.h>
#include <linux/llist.h>
#include <uapi/linux/io_uring.h>

struct io_wq_work_node {
	struct io_wq_work_node *next;
};

struct io_wq_work_list {
	struct io_wq_work_node *first;
	struct io_wq_work_node *last;
};

struct io_wq_work {
	struct io_wq_work_node list;
	unsigned flags;
	/* place it here instead of io_kiocb as it fills padding and saves 4B */
	int cancel_seq;
};

struct io_fixed_file {
	/* file * with additional FFS_* flags */
	unsigned long file_ptr;
};

struct io_file_table {
	struct io_fixed_file *files;
	unsigned long *bitmap;
	unsigned int alloc_hint;
};

struct io_hash_bucket {
	spinlock_t		lock;
	struct hlist_head	list;
} ____cacheline_aligned_in_smp;

struct io_hash_table {
	struct io_hash_bucket	*hbs;
	unsigned		hash_bits;
};

/*
 * Arbitrary limit, can be raised if need be
 */
#define IO_RINGFD_REG_MAX 16

struct io_uring_task {
	/* submission side */
	int				cached_refs;
	const struct io_ring_ctx 	*last;
	struct io_wq			*io_wq;
	struct file			*registered_rings[IO_RINGFD_REG_MAX];

	struct xarray			xa;
	struct wait_queue_head		wait;
	atomic_t			in_idle;
	atomic_t			inflight_tracked;
	struct percpu_counter		inflight;

	struct { /* task_work */
		struct llist_head	task_list;
		struct callback_head	task_work;
	} ____cacheline_aligned_in_smp;
};

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 SQ 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.
	 */
	atomic_t		sq_flags;
	/*
	 * Runtime CQ flags
	 *
	 * Written by the application, shouldn't be modified by the
	 * kernel.
	 */
	u32			cq_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 than 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_restriction {
	DECLARE_BITMAP(register_op, IORING_REGISTER_LAST);
	DECLARE_BITMAP(sqe_op, IORING_OP_LAST);
	u8 sqe_flags_allowed;
	u8 sqe_flags_required;
	bool registered;
};

struct io_submit_link {
	struct io_kiocb		*head;
	struct io_kiocb		*last;
};

struct io_submit_state {
	/* inline/task_work completion list, under ->uring_lock */
	struct io_wq_work_node	free_list;
	/* batch completion logic */
	struct io_wq_work_list	compl_reqs;
	struct io_submit_link	link;

	bool			plug_started;
	bool			need_plug;
	unsigned short		submit_nr;
	unsigned int		cqes_count;
	struct blk_plug		plug;
	struct io_uring_cqe	cqes[16];
};

struct io_ev_fd {
	struct eventfd_ctx	*cq_ev_fd;
	unsigned int		eventfd_async: 1;
	struct rcu_head		rcu;
	atomic_t		refs;
	atomic_t		ops;
};

struct io_alloc_cache {
	struct hlist_head	list;
	unsigned int		nr_cached;
};

struct io_ring_ctx {
	/* const or read-mostly hot data */
	struct {
		unsigned int		flags;
		unsigned int		compat: 1;
		unsigned int		drain_next: 1;
		unsigned int		restricted: 1;
		unsigned int		off_timeout_used: 1;
		unsigned int		drain_active: 1;
		unsigned int		drain_disabled: 1;
		unsigned int		has_evfd: 1;
		unsigned int		syscall_iopoll: 1;
		/* all CQEs should be posted only by the submitter task */
		unsigned int		task_complete: 1;

		enum task_work_notify_mode	notify_method;
		struct io_rings			*rings;
		struct task_struct		*submitter_task;
		struct percpu_ref		refs;
	} ____cacheline_aligned_in_smp;

	/* submission data */
	struct {
		struct mutex		uring_lock;

		/*
		 * 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;
		struct io_uring_sqe	*sq_sqes;
		unsigned		cached_sq_head;
		unsigned		sq_entries;

		/*
		 * Fixed resources fast path, should be accessed only under
		 * uring_lock, and updated through io_uring_register(2)
		 */
		struct io_rsrc_node	*rsrc_node;
		int			rsrc_cached_refs;
		atomic_t		cancel_seq;
		struct io_file_table	file_table;
		unsigned		nr_user_files;
		unsigned		nr_user_bufs;
		struct io_mapped_ubuf	**user_bufs;

		struct io_submit_state	submit_state;

		struct io_buffer_list	*io_bl;
		struct xarray		io_bl_xa;
		struct list_head	io_buffers_cache;

		struct io_hash_table	cancel_table_locked;
		struct list_head	cq_overflow_list;
		struct io_alloc_cache	apoll_cache;
		struct io_alloc_cache	netmsg_cache;
	} ____cacheline_aligned_in_smp;

	/* IRQ completion list, under ->completion_lock */
	struct io_wq_work_list	locked_free_list;
	unsigned int		locked_free_nr;

	const struct cred	*sq_creds;	/* cred used for __io_sq_thread() */
	struct io_sq_data	*sq_data;	/* if using sq thread polling */

	struct wait_queue_head	sqo_sq_wait;
	struct list_head	sqd_list;

	unsigned long		check_cq;

	unsigned int		file_alloc_start;
	unsigned int		file_alloc_end;

	struct xarray		personalities;
	u32			pers_next;

	struct {
		/*
		 * We cache a range of free CQEs we can use, once exhausted it
		 * should go through a slower range setup, see __io_get_cqe()
		 */
		struct io_uring_cqe	*cqe_cached;
		struct io_uring_cqe	*cqe_sentinel;

		unsigned		cached_cq_tail;
		unsigned		cq_entries;
		struct io_ev_fd	__rcu	*io_ev_fd;
		struct wait_queue_head	cq_wait;
		unsigned		cq_extra;
	} ____cacheline_aligned_in_smp;

	struct {
		spinlock_t		completion_lock;

		bool			poll_multi_queue;

		/*
		 * ->iopoll_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 io_wq_work_list	iopoll_list;
		struct io_hash_table	cancel_table;

		struct llist_head	work_llist;

		struct list_head	io_buffers_comp;
	} ____cacheline_aligned_in_smp;

	/* timeouts */
	struct {
		spinlock_t		timeout_lock;
		atomic_t		cq_timeouts;
		struct list_head	timeout_list;
		struct list_head	ltimeout_list;
		unsigned		cq_last_tm_flush;
	} ____cacheline_aligned_in_smp;

	/* Keep this last, we don't need it for the fast path */
	struct wait_queue_head		poll_wq;
	struct io_restriction		restrictions;

	/* slow path rsrc auxilary data, used by update/register */
	struct io_rsrc_node		*rsrc_backup_node;
	struct io_mapped_ubuf		*dummy_ubuf;
	struct io_rsrc_data		*file_data;
	struct io_rsrc_data		*buf_data;

	struct delayed_work		rsrc_put_work;
	struct callback_head		rsrc_put_tw;
	struct llist_head		rsrc_put_llist;
	struct list_head		rsrc_ref_list;
	spinlock_t			rsrc_ref_lock;

	struct list_head		io_buffers_pages;

	#if defined(CONFIG_UNIX)
		struct socket		*ring_sock;
	#endif
	/* hashed buffered write serialization */
	struct io_wq_hash		*hash_map;

	/* Only used for accounting purposes */
	struct user_struct		*user;
	struct mm_struct		*mm_account;

	/* ctx exit and cancelation */
	struct llist_head		fallback_llist;
	struct delayed_work		fallback_work;
	struct work_struct		exit_work;
	struct list_head		tctx_list;
	struct completion		ref_comp;

	/* io-wq management, e.g. thread count */
	u32				iowq_limits[2];
	bool				iowq_limits_set;

	struct list_head		defer_list;
	unsigned			sq_thread_idle;
	/* protected by ->completion_lock */
	unsigned			evfd_last_cq_tail;
};

enum {
	REQ_F_FIXED_FILE_BIT	= IOSQE_FIXED_FILE_BIT,
	REQ_F_IO_DRAIN_BIT	= IOSQE_IO_DRAIN_BIT,
	REQ_F_LINK_BIT		= IOSQE_IO_LINK_BIT,
	REQ_F_HARDLINK_BIT	= IOSQE_IO_HARDLINK_BIT,
	REQ_F_FORCE_ASYNC_BIT	= IOSQE_ASYNC_BIT,
	REQ_F_BUFFER_SELECT_BIT	= IOSQE_BUFFER_SELECT_BIT,
	REQ_F_CQE_SKIP_BIT	= IOSQE_CQE_SKIP_SUCCESS_BIT,

	/* first byte is taken by user flags, shift it to not overlap */
	REQ_F_FAIL_BIT		= 8,
	REQ_F_INFLIGHT_BIT,
	REQ_F_CUR_POS_BIT,
	REQ_F_NOWAIT_BIT,
	REQ_F_LINK_TIMEOUT_BIT,
	REQ_F_NEED_CLEANUP_BIT,
	REQ_F_POLLED_BIT,
	REQ_F_BUFFER_SELECTED_BIT,
	REQ_F_BUFFER_RING_BIT,
	REQ_F_REISSUE_BIT,
	REQ_F_CREDS_BIT,
	REQ_F_REFCOUNT_BIT,
	REQ_F_ARM_LTIMEOUT_BIT,
	REQ_F_ASYNC_DATA_BIT,
	REQ_F_SKIP_LINK_CQES_BIT,
	REQ_F_SINGLE_POLL_BIT,
	REQ_F_DOUBLE_POLL_BIT,
	REQ_F_PARTIAL_IO_BIT,
	REQ_F_CQE32_INIT_BIT,
	REQ_F_APOLL_MULTISHOT_BIT,
	REQ_F_CLEAR_POLLIN_BIT,
	REQ_F_HASH_LOCKED_BIT,
	/* keep async read/write and isreg together and in order */
	REQ_F_SUPPORT_NOWAIT_BIT,
	REQ_F_ISREG_BIT,

	/* not a real bit, just to check we're not overflowing the space */
	__REQ_F_LAST_BIT,
};

enum {
	/* ctx owns file */
	REQ_F_FIXED_FILE	= BIT(REQ_F_FIXED_FILE_BIT),
	/* drain existing IO first */
	REQ_F_IO_DRAIN		= BIT(REQ_F_IO_DRAIN_BIT),
	/* linked sqes */
	REQ_F_LINK		= BIT(REQ_F_LINK_BIT),
	/* doesn't sever on completion < 0 */
	REQ_F_HARDLINK		= BIT(REQ_F_HARDLINK_BIT),
	/* IOSQE_ASYNC */
	REQ_F_FORCE_ASYNC	= BIT(REQ_F_FORCE_ASYNC_BIT),
	/* IOSQE_BUFFER_SELECT */
	REQ_F_BUFFER_SELECT	= BIT(REQ_F_BUFFER_SELECT_BIT),
	/* IOSQE_CQE_SKIP_SUCCESS */
	REQ_F_CQE_SKIP		= BIT(REQ_F_CQE_SKIP_BIT),

	/* fail rest of links */
	REQ_F_FAIL		= BIT(REQ_F_FAIL_BIT),
	/* on inflight list, should be cancelled and waited on exit reliably */
	REQ_F_INFLIGHT		= BIT(REQ_F_INFLIGHT_BIT),
	/* read/write uses file position */
	REQ_F_CUR_POS		= BIT(REQ_F_CUR_POS_BIT),
	/* must not punt to workers */
	REQ_F_NOWAIT		= BIT(REQ_F_NOWAIT_BIT),
	/* has or had linked timeout */
	REQ_F_LINK_TIMEOUT	= BIT(REQ_F_LINK_TIMEOUT_BIT),
	/* needs cleanup */
	REQ_F_NEED_CLEANUP	= BIT(REQ_F_NEED_CLEANUP_BIT),
	/* already went through poll handler */
	REQ_F_POLLED		= BIT(REQ_F_POLLED_BIT),
	/* buffer already selected */
	REQ_F_BUFFER_SELECTED	= BIT(REQ_F_BUFFER_SELECTED_BIT),
	/* buffer selected from ring, needs commit */
	REQ_F_BUFFER_RING	= BIT(REQ_F_BUFFER_RING_BIT),
	/* caller should reissue async */
	REQ_F_REISSUE		= BIT(REQ_F_REISSUE_BIT),
	/* supports async reads/writes */
	REQ_F_SUPPORT_NOWAIT	= BIT(REQ_F_SUPPORT_NOWAIT_BIT),
	/* regular file */
	REQ_F_ISREG		= BIT(REQ_F_ISREG_BIT),
	/* has creds assigned */
	REQ_F_CREDS		= BIT(REQ_F_CREDS_BIT),
	/* skip refcounting if not set */
	REQ_F_REFCOUNT		= BIT(REQ_F_REFCOUNT_BIT),
	/* there is a linked timeout that has to be armed */
	REQ_F_ARM_LTIMEOUT	= BIT(REQ_F_ARM_LTIMEOUT_BIT),
	/* ->async_data allocated */
	REQ_F_ASYNC_DATA	= BIT(REQ_F_ASYNC_DATA_BIT),
	/* don't post CQEs while failing linked requests */
	REQ_F_SKIP_LINK_CQES	= BIT(REQ_F_SKIP_LINK_CQES_BIT),
	/* single poll may be active */
	REQ_F_SINGLE_POLL	= BIT(REQ_F_SINGLE_POLL_BIT),
	/* double poll may active */
	REQ_F_DOUBLE_POLL	= BIT(REQ_F_DOUBLE_POLL_BIT),
	/* request has already done partial IO */
	REQ_F_PARTIAL_IO	= BIT(REQ_F_PARTIAL_IO_BIT),
	/* fast poll multishot mode */
	REQ_F_APOLL_MULTISHOT	= BIT(REQ_F_APOLL_MULTISHOT_BIT),
	/* ->extra1 and ->extra2 are initialised */
	REQ_F_CQE32_INIT	= BIT(REQ_F_CQE32_INIT_BIT),
	/* recvmsg special flag, clear EPOLLIN */
	REQ_F_CLEAR_POLLIN	= BIT(REQ_F_CLEAR_POLLIN_BIT),
	/* hashed into ->cancel_hash_locked, protected by ->uring_lock */
	REQ_F_HASH_LOCKED	= BIT(REQ_F_HASH_LOCKED_BIT),
};

typedef void (*io_req_tw_func_t)(struct io_kiocb *req, bool *locked);

struct io_task_work {
	struct llist_node		node;
	io_req_tw_func_t		func;
};

struct io_cqe {
	__u64	user_data;
	__s32	res;
	/* fd initially, then cflags for completion */
	union {
		__u32	flags;
		int	fd;
	};
};

/*
 * Each request type overlays its private data structure on top of this one.
 * They must not exceed this one in size.
 */
struct io_cmd_data {
	struct file		*file;
	/* each command gets 56 bytes of data */
	__u8			data[56];
};

static inline void io_kiocb_cmd_sz_check(size_t cmd_sz)
{
	BUILD_BUG_ON(cmd_sz > sizeof(struct io_cmd_data));
}
#define io_kiocb_to_cmd(req, cmd_type) ( \
	io_kiocb_cmd_sz_check(sizeof(cmd_type)) , \
	((cmd_type *)&(req)->cmd) \
)
#define cmd_to_io_kiocb(ptr)	((struct io_kiocb *) ptr)

struct io_kiocb {
	union {
		/*
		 * NOTE! Each of the io_kiocb 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 'file' in this struct.
		 */
		struct file		*file;
		struct io_cmd_data	cmd;
	};

	u8				opcode;
	/* polled IO has completed */
	u8				iopoll_completed;
	/*
	 * Can be either a fixed buffer index, or used with provided buffers.
	 * For the latter, before issue it points to the buffer group ID,
	 * and after selection it points to the buffer ID itself.
	 */
	u16				buf_index;
	unsigned int			flags;

	struct io_cqe			cqe;

	struct io_ring_ctx		*ctx;
	struct task_struct		*task;

	struct io_rsrc_node		*rsrc_node;

	union {
		/* store used ubuf, so we can prevent reloading */
		struct io_mapped_ubuf	*imu;

		/* stores selected buf, valid IFF REQ_F_BUFFER_SELECTED is set */
		struct io_buffer	*kbuf;

		/*
		 * stores buffer ID for ring provided buffers, valid IFF
		 * REQ_F_BUFFER_RING is set.
		 */
		struct io_buffer_list	*buf_list;
	};

	union {
		/* used by request caches, completion batching and iopoll */
		struct io_wq_work_node	comp_list;
		/* cache ->apoll->events */
		__poll_t apoll_events;
	};
	atomic_t			refs;
	atomic_t			poll_refs;
	struct io_task_work		io_task_work;
	/* for polled requests, i.e. IORING_OP_POLL_ADD and async armed poll */
	union {
		struct hlist_node	hash_node;
		struct {
			u64		extra1;
			u64		extra2;
		};
	};
	/* internal polling, see IORING_FEAT_FAST_POLL */
	struct async_poll		*apoll;
	/* opcode allocated if it needs to store data for async defer */
	void				*async_data;
	/* linked requests, IFF REQ_F_HARDLINK or REQ_F_LINK are set */
	struct io_kiocb			*link;
	/* custom credentials, valid IFF REQ_F_CREDS is set */
	const struct cred		*creds;
	struct io_wq_work		work;
};

struct io_overflow_cqe {
	struct list_head list;
	struct io_uring_cqe cqe;
};

#endif
Commit	Line	Data
e27f928e JA	1	#ifndef IO_URING_TYPES_H
	2	#define IO_URING_TYPES_H
	3
	4	#include <linux/blkdev.h>
	5	#include <linux/task_work.h>
d9b57aa3	6	#include <linux/bitmap.h>
e70cb608	7	#include <linux/llist.h>
d9b57aa3	8	#include <uapi/linux/io_uring.h>
e27f928e	9
ab1c84d8 PB	10	struct io_wq_work_node {
	11	struct io_wq_work_node *next;
	12	};
	13
	14	struct io_wq_work_list {
	15	struct io_wq_work_node *first;
	16	struct io_wq_work_node *last;
	17	};
	18
	19	struct io_wq_work {
	20	struct io_wq_work_node list;
	21	unsigned flags;
	22	/* place it here instead of io_kiocb as it fills padding and saves 4B */
	23	int cancel_seq;
	24	};
	25
	26	struct io_fixed_file {
	27	/* file * with additional FFS_* flags */
	28	unsigned long file_ptr;
	29	};
	30
	31	struct io_file_table {
	32	struct io_fixed_file *files;
	33	unsigned long *bitmap;
	34	unsigned int alloc_hint;
	35	};
e27f928e	36
e6f89be6 PB	37	struct io_hash_bucket {
	38	spinlock_t lock;
	39	struct hlist_head list;
	40	} ____cacheline_aligned_in_smp;
	41
	42	struct io_hash_table {
	43	struct io_hash_bucket *hbs;
	44	unsigned hash_bits;
	45	};
	46
e70cb608 PB	47	/*
	48	* Arbitrary limit, can be raised if need be
	49	*/
	50	#define IO_RINGFD_REG_MAX 16
	51
	52	struct io_uring_task {
	53	/* submission side */
	54	int cached_refs;
	55	const struct io_ring_ctx *last;
	56	struct io_wq *io_wq;
	57	struct file *registered_rings[IO_RINGFD_REG_MAX];
	58
	59	struct xarray xa;
	60	struct wait_queue_head wait;
	61	atomic_t in_idle;
	62	atomic_t inflight_tracked;
	63	struct percpu_counter inflight;
	64
	65	struct { /* task_work */
	66	struct llist_head task_list;
	67	struct callback_head task_work;
	68	} ____cacheline_aligned_in_smp;
	69	};
	70
e27f928e JA	71	struct io_uring {
	72	u32 head ____cacheline_aligned_in_smp;
	73	u32 tail ____cacheline_aligned_in_smp;
	74	};
	75
	76	/*
	77	* This data is shared with the application through the mmap at offsets
	78	* IORING_OFF_SQ_RING and IORING_OFF_CQ_RING.
	79	*
	80	* The offsets to the member fields are published through struct
	81	* io_sqring_offsets when calling io_uring_setup.
	82	*/
	83	struct io_rings {
	84	/*
	85	* Head and tail offsets into the ring; the offsets need to be
	86	* masked to get valid indices.
	87	*
	88	* The kernel controls head of the sq ring and the tail of the cq ring,
	89	* and the application controls tail of the sq ring and the head of the
	90	* cq ring.
	91	*/
	92	struct io_uring sq, cq;
	93	/*
	94	* Bitmasks to apply to head and tail offsets (constant, equals
	95	* ring_entries - 1)
	96	*/
	97	u32 sq_ring_mask, cq_ring_mask;
	98	/* Ring sizes (constant, power of 2) */
	99	u32 sq_ring_entries, cq_ring_entries;
	100	/*
	101	* Number of invalid entries dropped by the kernel due to
	102	* invalid index stored in array
	103	*
	104	* Written by the kernel, shouldn't be modified by the
	105	* application (i.e. get number of "new events" by comparing to
	106	* cached value).
	107	*
	108	* After a new SQ head value was read by the application this
	109	* counter includes all submissions that were dropped reaching
	110	* the new SQ head (and possibly more).
	111	*/
	112	u32 sq_dropped;
	113	/*
	114	* Runtime SQ flags
	115	*
	116	* Written by the kernel, shouldn't be modified by the
	117	* application.
	118	*
	119	* The application needs a full memory barrier before checking
	120	* for IORING_SQ_NEED_WAKEUP after updating the sq tail.
	121	*/
	122	atomic_t sq_flags;
	123	/*
	124	* Runtime CQ flags
	125	*
	126	* Written by the application, shouldn't be modified by the
	127	* kernel.
	128	*/
	129	u32 cq_flags;
	130	/*
	131	* Number of completion events lost because the queue was full;
	132	* this should be avoided by the application by making sure
	133	* there are not more requests pending than there is space in
	134	* the completion queue.
135	*
136	* Written by the kernel, shouldn't be modified by the
137	* application (i.e. get number of "new events" by comparing to
138	* cached value).
139	*
140	* As completion events come in out of order this counter is not
141	* ordered with any other data.
142	*/
143	u32 cq_overflow;
144	/*
145	* Ring buffer of completion events.
146	*
147	* The kernel writes completion events fresh every time they are
148	* produced, so the application is allowed to modify pending
149	* entries.
150	*/
151	struct io_uring_cqe cqes[] ____cacheline_aligned_in_smp;
152	};
153
154	struct io_restriction {
155	DECLARE_BITMAP(register_op, IORING_REGISTER_LAST);
156	DECLARE_BITMAP(sqe_op, IORING_OP_LAST);
157	u8 sqe_flags_allowed;
158	u8 sqe_flags_required;
159	bool registered;
160	};
161
162	struct io_submit_link {
163	struct io_kiocb *head;
164	struct io_kiocb *last;
165	};
166
167	struct io_submit_state {
168	/* inline/task_work completion list, under ->uring_lock */
169	struct io_wq_work_node free_list;
170	/* batch completion logic */
171	struct io_wq_work_list compl_reqs;
172	struct io_submit_link link;
173
174	bool plug_started;
175	bool need_plug;
e27f928e	176	unsigned short submit_nr;
931147dd	177	unsigned int cqes_count;
e27f928e	178	struct blk_plug plug;
931147dd	179	struct io_uring_cqe cqes[16];
e27f928e JA	180	};
	181
	182	struct io_ev_fd {
	183	struct eventfd_ctx *cq_ev_fd;
	184	unsigned int eventfd_async: 1;
	185	struct rcu_head rcu;
21a091b9 DY	186	atomic_t refs;
21a091b9 DY	187	atomic_t ops;
e27f928e JA	188	};
e27f928e JA	189
9b797a37 JA	190	struct io_alloc_cache {
9b797a37 JA	191	struct hlist_head list;
9731bc98	192	unsigned int nr_cached;
9b797a37 JA	193	};
9b797a37 JA	194
e27f928e JA	195	struct io_ring_ctx {
	196	/* const or read-mostly hot data */
	197	struct {
e27f928e	198	unsigned int flags;
e27f928e JA	199	unsigned int compat: 1;
	200	unsigned int drain_next: 1;
	201	unsigned int restricted: 1;
	202	unsigned int off_timeout_used: 1;
	203	unsigned int drain_active: 1;
	204	unsigned int drain_disabled: 1;
	205	unsigned int has_evfd: 1;
	206	unsigned int syscall_iopoll: 1;
e6aeb272 PB	207	/* all CQEs should be posted only by the submitter task */
e6aeb272 PB	208	unsigned int task_complete: 1;
dde40322 PB	209
	210	enum task_work_notify_mode notify_method;
	211	struct io_rings *rings;
	212	struct task_struct *submitter_task;
	213	struct percpu_ref refs;
e27f928e JA	214	} ____cacheline_aligned_in_smp;
	215
	216	/* submission data */
	217	struct {
	218	struct mutex uring_lock;
	219
	220	/*
	221	* Ring buffer of indices into array of io_uring_sqe, which is
	222	* mmapped by the application using the IORING_OFF_SQES offset.
	223	*
	224	* This indirection could e.g. be used to assign fixed
	225	* io_uring_sqe entries to operations and only submit them to
	226	* the queue when needed.
	227	*
	228	* The kernel modifies neither the indices array nor the entries
	229	* array.
	230	*/
	231	u32 *sq_array;
	232	struct io_uring_sqe *sq_sqes;
	233	unsigned cached_sq_head;
	234	unsigned sq_entries;
e27f928e JA	235
	236	/*
	237	* Fixed resources fast path, should be accessed only under
	238	* uring_lock, and updated through io_uring_register(2)
	239	*/
	240	struct io_rsrc_node *rsrc_node;
	241	int rsrc_cached_refs;
	242	atomic_t cancel_seq;
	243	struct io_file_table file_table;
	244	unsigned nr_user_files;
	245	unsigned nr_user_bufs;
	246	struct io_mapped_ubuf **user_bufs;
	247
	248	struct io_submit_state submit_state;
	249
	250	struct io_buffer_list *io_bl;
	251	struct xarray io_bl_xa;
	252	struct list_head io_buffers_cache;
	253
9ca9fb24	254	struct io_hash_table cancel_table_locked;
e27f928e	255	struct list_head cq_overflow_list;
9b797a37	256	struct io_alloc_cache apoll_cache;
43e0bbbd	257	struct io_alloc_cache netmsg_cache;
e27f928e JA	258	} ____cacheline_aligned_in_smp;
	259
	260	/* IRQ completion list, under ->completion_lock */
	261	struct io_wq_work_list locked_free_list;
	262	unsigned int locked_free_nr;
	263
	264	const struct cred sq_creds; / cred used for __io_sq_thread() */
	265	struct io_sq_data sq_data; / if using sq thread polling */
	266
	267	struct wait_queue_head sqo_sq_wait;
	268	struct list_head sqd_list;
	269
	270	unsigned long check_cq;
	271
6e73dffb PB	272	unsigned int file_alloc_start;
	273	unsigned int file_alloc_end;
	274
43e0bbbd JA	275	struct xarray personalities;
	276	u32 pers_next;
	277
e27f928e JA	278	struct {
	279	/*
	280	* We cache a range of free CQEs we can use, once exhausted it
	281	* should go through a slower range setup, see __io_get_cqe()
	282	*/
	283	struct io_uring_cqe *cqe_cached;
	284	struct io_uring_cqe *cqe_sentinel;
	285
	286	unsigned cached_cq_tail;
	287	unsigned cq_entries;
	288	struct io_ev_fd __rcu *io_ev_fd;
	289	struct wait_queue_head cq_wait;
	290	unsigned cq_extra;
e27f928e JA	291	} ____cacheline_aligned_in_smp;
	292
	293	struct {
	294	spinlock_t completion_lock;
	295
59b745bb JA	296	bool poll_multi_queue;
59b745bb JA	297
e27f928e JA	298	/*
	299	* ->iopoll_list is protected by the ctx->uring_lock for
	300	* io_uring instances that don't use IORING_SETUP_SQPOLL.
	301	* For SQPOLL, only the single threaded io_sq_thread() will
	302	* manipulate the list, hence no extra locking is needed there.
	303	*/
	304	struct io_wq_work_list iopoll_list;
e6f89be6	305	struct io_hash_table cancel_table;
e27f928e	306
c0e0d6ba DY	307	struct llist_head work_llist;
c0e0d6ba DY	308
e27f928e JA	309	struct list_head io_buffers_comp;
	310	} ____cacheline_aligned_in_smp;
	311
aff5b2df PB	312	/* timeouts */
	313	struct {
	314	spinlock_t timeout_lock;
	315	atomic_t cq_timeouts;
	316	struct list_head timeout_list;
	317	struct list_head ltimeout_list;
	318	unsigned cq_last_tm_flush;
	319	} ____cacheline_aligned_in_smp;
	320
e27f928e	321	/* Keep this last, we don't need it for the fast path */
7b235dd8	322	struct wait_queue_head poll_wq;
22eb2a3f PB	323	struct io_restriction restrictions;
	324
	325	/* slow path rsrc auxilary data, used by update/register */
	326	struct io_rsrc_node *rsrc_backup_node;
	327	struct io_mapped_ubuf *dummy_ubuf;
	328	struct io_rsrc_data *file_data;
	329	struct io_rsrc_data *buf_data;
	330
	331	struct delayed_work rsrc_put_work;
d34b1b0b	332	struct callback_head rsrc_put_tw;
22eb2a3f PB	333	struct llist_head rsrc_put_llist;
	334	struct list_head rsrc_ref_list;
	335	spinlock_t rsrc_ref_lock;
	336
	337	struct list_head io_buffers_pages;
	338
	339	#if defined(CONFIG_UNIX)
	340	struct socket *ring_sock;
	341	#endif
	342	/* hashed buffered write serialization */
	343	struct io_wq_hash *hash_map;
	344
	345	/* Only used for accounting purposes */
	346	struct user_struct *user;
	347	struct mm_struct *mm_account;
	348
	349	/* ctx exit and cancelation */
	350	struct llist_head fallback_llist;
	351	struct delayed_work fallback_work;
	352	struct work_struct exit_work;
	353	struct list_head tctx_list;
	354	struct completion ref_comp;
	355
	356	/* io-wq management, e.g. thread count */
	357	u32 iowq_limits[2];
	358	bool iowq_limits_set;
	359
	360	struct list_head defer_list;
	361	unsigned sq_thread_idle;
305bef98 PB	362	/* protected by ->completion_lock */
305bef98 PB	363	unsigned evfd_last_cq_tail;
e27f928e JA	364	};
	365
	366	enum {
	367	REQ_F_FIXED_FILE_BIT = IOSQE_FIXED_FILE_BIT,
	368	REQ_F_IO_DRAIN_BIT = IOSQE_IO_DRAIN_BIT,
	369	REQ_F_LINK_BIT = IOSQE_IO_LINK_BIT,
	370	REQ_F_HARDLINK_BIT = IOSQE_IO_HARDLINK_BIT,
	371	REQ_F_FORCE_ASYNC_BIT = IOSQE_ASYNC_BIT,
	372	REQ_F_BUFFER_SELECT_BIT = IOSQE_BUFFER_SELECT_BIT,
	373	REQ_F_CQE_SKIP_BIT = IOSQE_CQE_SKIP_SUCCESS_BIT,
	374
	375	/* first byte is taken by user flags, shift it to not overlap */
	376	REQ_F_FAIL_BIT = 8,
	377	REQ_F_INFLIGHT_BIT,
	378	REQ_F_CUR_POS_BIT,
	379	REQ_F_NOWAIT_BIT,
	380	REQ_F_LINK_TIMEOUT_BIT,
	381	REQ_F_NEED_CLEANUP_BIT,
	382	REQ_F_POLLED_BIT,
	383	REQ_F_BUFFER_SELECTED_BIT,
	384	REQ_F_BUFFER_RING_BIT,
e27f928e JA	385	REQ_F_REISSUE_BIT,
	386	REQ_F_CREDS_BIT,
	387	REQ_F_REFCOUNT_BIT,
	388	REQ_F_ARM_LTIMEOUT_BIT,
	389	REQ_F_ASYNC_DATA_BIT,
	390	REQ_F_SKIP_LINK_CQES_BIT,
	391	REQ_F_SINGLE_POLL_BIT,
	392	REQ_F_DOUBLE_POLL_BIT,
	393	REQ_F_PARTIAL_IO_BIT,
	394	REQ_F_CQE32_INIT_BIT,
	395	REQ_F_APOLL_MULTISHOT_BIT,
	396	REQ_F_CLEAR_POLLIN_BIT,
9ca9fb24	397	REQ_F_HASH_LOCKED_BIT,
e27f928e JA	398	/* keep async read/write and isreg together and in order */
	399	REQ_F_SUPPORT_NOWAIT_BIT,
	400	REQ_F_ISREG_BIT,
	401
	402	/* not a real bit, just to check we're not overflowing the space */
	403	__REQ_F_LAST_BIT,
	404	};
	405
	406	enum {
	407	/* ctx owns file */
	408	REQ_F_FIXED_FILE = BIT(REQ_F_FIXED_FILE_BIT),
	409	/* drain existing IO first */
	410	REQ_F_IO_DRAIN = BIT(REQ_F_IO_DRAIN_BIT),
	411	/* linked sqes */
	412	REQ_F_LINK = BIT(REQ_F_LINK_BIT),
	413	/* doesn't sever on completion < 0 */
	414	REQ_F_HARDLINK = BIT(REQ_F_HARDLINK_BIT),
	415	/* IOSQE_ASYNC */
	416	REQ_F_FORCE_ASYNC = BIT(REQ_F_FORCE_ASYNC_BIT),
	417	/* IOSQE_BUFFER_SELECT */
	418	REQ_F_BUFFER_SELECT = BIT(REQ_F_BUFFER_SELECT_BIT),
	419	/* IOSQE_CQE_SKIP_SUCCESS */
	420	REQ_F_CQE_SKIP = BIT(REQ_F_CQE_SKIP_BIT),
	421
	422	/* fail rest of links */
	423	REQ_F_FAIL = BIT(REQ_F_FAIL_BIT),
	424	/* on inflight list, should be cancelled and waited on exit reliably */
	425	REQ_F_INFLIGHT = BIT(REQ_F_INFLIGHT_BIT),
	426	/* read/write uses file position */
	427	REQ_F_CUR_POS = BIT(REQ_F_CUR_POS_BIT),
	428	/* must not punt to workers */
	429	REQ_F_NOWAIT = BIT(REQ_F_NOWAIT_BIT),
	430	/* has or had linked timeout */
	431	REQ_F_LINK_TIMEOUT = BIT(REQ_F_LINK_TIMEOUT_BIT),
	432	/* needs cleanup */
	433	REQ_F_NEED_CLEANUP = BIT(REQ_F_NEED_CLEANUP_BIT),
	434	/* already went through poll handler */
	435	REQ_F_POLLED = BIT(REQ_F_POLLED_BIT),
	436	/* buffer already selected */
	437	REQ_F_BUFFER_SELECTED = BIT(REQ_F_BUFFER_SELECTED_BIT),
	438	/* buffer selected from ring, needs commit */
	439	REQ_F_BUFFER_RING = BIT(REQ_F_BUFFER_RING_BIT),
e27f928e JA	440	/* caller should reissue async */
	441	REQ_F_REISSUE = BIT(REQ_F_REISSUE_BIT),
	442	/* supports async reads/writes */
	443	REQ_F_SUPPORT_NOWAIT = BIT(REQ_F_SUPPORT_NOWAIT_BIT),
	444	/* regular file */
	445	REQ_F_ISREG = BIT(REQ_F_ISREG_BIT),
	446	/* has creds assigned */
	447	REQ_F_CREDS = BIT(REQ_F_CREDS_BIT),
	448	/* skip refcounting if not set */
	449	REQ_F_REFCOUNT = BIT(REQ_F_REFCOUNT_BIT),
	450	/* there is a linked timeout that has to be armed */
	451	REQ_F_ARM_LTIMEOUT = BIT(REQ_F_ARM_LTIMEOUT_BIT),
	452	/* ->async_data allocated */
	453	REQ_F_ASYNC_DATA = BIT(REQ_F_ASYNC_DATA_BIT),
	454	/* don't post CQEs while failing linked requests */
	455	REQ_F_SKIP_LINK_CQES = BIT(REQ_F_SKIP_LINK_CQES_BIT),
	456	/* single poll may be active */
	457	REQ_F_SINGLE_POLL = BIT(REQ_F_SINGLE_POLL_BIT),
	458	/* double poll may active */
	459	REQ_F_DOUBLE_POLL = BIT(REQ_F_DOUBLE_POLL_BIT),
	460	/* request has already done partial IO */
	461	REQ_F_PARTIAL_IO = BIT(REQ_F_PARTIAL_IO_BIT),
	462	/* fast poll multishot mode */
	463	REQ_F_APOLL_MULTISHOT = BIT(REQ_F_APOLL_MULTISHOT_BIT),
	464	/* ->extra1 and ->extra2 are initialised */
	465	REQ_F_CQE32_INIT = BIT(REQ_F_CQE32_INIT_BIT),
	466	/* recvmsg special flag, clear EPOLLIN */
	467	REQ_F_CLEAR_POLLIN = BIT(REQ_F_CLEAR_POLLIN_BIT),
9ca9fb24 PB	468	/* hashed into ->cancel_hash_locked, protected by ->uring_lock */
9ca9fb24 PB	469	REQ_F_HASH_LOCKED = BIT(REQ_F_HASH_LOCKED_BIT),
e27f928e JA	470	};
	471
	472	typedef void (io_req_tw_func_t)(struct io_kiocb req, bool *locked);
	473
	474	struct io_task_work {
3218e5d3	475	struct llist_node node;
e27f928e JA	476	io_req_tw_func_t func;
	477	};
	478
	479	struct io_cqe {
	480	__u64 user_data;
	481	__s32 res;
	482	/* fd initially, then cflags for completion */
	483	union {
	484	__u32 flags;
	485	int fd;
	486	};
	487	};
	488
	489	/*
	490	* Each request type overlays its private data structure on top of this one.
	491	* They must not exceed this one in size.
	492	*/
	493	struct io_cmd_data {
	494	struct file *file;
	495	/* each command gets 56 bytes of data */
	496	__u8 data[56];
	497	};
	498
f2ccb5ae SM	499	static inline void io_kiocb_cmd_sz_check(size_t cmd_sz)
	500	{
	501	BUILD_BUG_ON(cmd_sz > sizeof(struct io_cmd_data));
	502	}
	503	#define io_kiocb_to_cmd(req, cmd_type) ( \
	504	io_kiocb_cmd_sz_check(sizeof(cmd_type)) , \
	505	((cmd_type *)&(req)->cmd) \
	506	)
e27f928e JA	507	#define cmd_to_io_kiocb(ptr) ((struct io_kiocb *) ptr)
	508
	509	struct io_kiocb {
	510	union {
	511	/*
	512	* NOTE! Each of the io_kiocb union members has the file pointer
	513	* as the first entry in their struct definition. So you can
	514	* access the file pointer through any of the sub-structs,
	515	* or directly as just 'file' in this struct.
	516	*/
	517	struct file *file;
	518	struct io_cmd_data cmd;
	519	};
	520
	521	u8 opcode;
	522	/* polled IO has completed */
	523	u8 iopoll_completed;
	524	/*
	525	* Can be either a fixed buffer index, or used with provided buffers.
	526	* For the latter, before issue it points to the buffer group ID,
	527	* and after selection it points to the buffer ID itself.
	528	*/
	529	u16 buf_index;
	530	unsigned int flags;
	531
	532	struct io_cqe cqe;
	533
	534	struct io_ring_ctx *ctx;
	535	struct task_struct *task;
	536
	537	struct io_rsrc_node *rsrc_node;
	538
	539	union {
	540	/* store used ubuf, so we can prevent reloading */
	541	struct io_mapped_ubuf *imu;
	542
	543	/* stores selected buf, valid IFF REQ_F_BUFFER_SELECTED is set */
	544	struct io_buffer *kbuf;
	545
	546	/*
	547	* stores buffer ID for ring provided buffers, valid IFF
	548	* REQ_F_BUFFER_RING is set.
	549	*/
	550	struct io_buffer_list *buf_list;
	551	};
	552
	553	union {
	554	/* used by request caches, completion batching and iopoll */
	555	struct io_wq_work_node comp_list;
	556	/* cache ->apoll->events */
	557	__poll_t apoll_events;
	558	};
	559	atomic_t refs;
	560	atomic_t poll_refs;
	561	struct io_task_work io_task_work;
	562	/* for polled requests, i.e. IORING_OP_POLL_ADD and async armed poll */
	563	union {
	564	struct hlist_node hash_node;
	565	struct {
	566	u64 extra1;
	567	u64 extra2;
	568	};
	569	};
	570	/* internal polling, see IORING_FEAT_FAST_POLL */
571	struct async_poll *apoll;
572	/* opcode allocated if it needs to store data for async defer */
573	void *async_data;
574	/* linked requests, IFF REQ_F_HARDLINK or REQ_F_LINK are set */
575	struct io_kiocb *link;
576	/* custom credentials, valid IFF REQ_F_CREDS is set */
577	const struct cred *creds;
578	struct io_wq_work work;
579	};
580
a4ad4f74 JA	581	struct io_overflow_cqe {
	582	struct list_head list;
	583	struct io_uring_cqe cqe;
	584	};
	585
e27f928e	586	#endif