1 // SPDX-License-Identifier: GPL-2.0
3 * Shared application/kernel submission and completion ring pairs, for
4 * supporting fast/efficient IO.
6 * A note on the read/write ordering memory barriers that are matched between
7 * the application and kernel side.
9 * After the application reads the CQ ring tail, it must use an
10 * appropriate smp_rmb() to pair with the smp_wmb() the kernel uses
11 * before writing the tail (using smp_load_acquire to read the tail will
12 * do). It also needs a smp_mb() before updating CQ head (ordering the
13 * entry load(s) with the head store), pairing with an implicit barrier
14 * through a control-dependency in io_get_cqe (smp_store_release to
15 * store head will do). Failure to do so could lead to reading invalid
18 * Likewise, the application must use an appropriate smp_wmb() before
19 * writing the SQ tail (ordering SQ entry stores with the tail store),
20 * which pairs with smp_load_acquire in io_get_sqring (smp_store_release
21 * to store the tail will do). And it needs a barrier ordering the SQ
22 * head load before writing new SQ entries (smp_load_acquire to read
25 * When using the SQ poll thread (IORING_SETUP_SQPOLL), the application
26 * needs to check the SQ flags for IORING_SQ_NEED_WAKEUP *after*
27 * updating the SQ tail; a full memory barrier smp_mb() is needed
30 * Also see the examples in the liburing library:
32 * git://git.kernel.dk/liburing
34 * io_uring also uses READ/WRITE_ONCE() for _any_ store or load that happens
35 * from data shared between the kernel and application. This is done both
36 * for ordering purposes, but also to ensure that once a value is loaded from
37 * data that the application could potentially modify, it remains stable.
39 * Copyright (C) 2018-2019 Jens Axboe
40 * Copyright (c) 2018-2019 Christoph Hellwig
42 #include <linux/kernel.h>
43 #include <linux/init.h>
44 #include <linux/errno.h>
45 #include <linux/syscalls.h>
46 #include <net/compat.h>
47 #include <linux/refcount.h>
48 #include <linux/uio.h>
49 #include <linux/bits.h>
51 #include <linux/sched/signal.h>
53 #include <linux/file.h>
54 #include <linux/fdtable.h>
56 #include <linux/mman.h>
57 #include <linux/percpu.h>
58 #include <linux/slab.h>
59 #include <linux/bvec.h>
60 #include <linux/net.h>
62 #include <net/af_unix.h>
64 #include <linux/anon_inodes.h>
65 #include <linux/sched/mm.h>
66 #include <linux/uaccess.h>
67 #include <linux/nospec.h>
68 #include <linux/highmem.h>
69 #include <linux/fsnotify.h>
70 #include <linux/fadvise.h>
71 #include <linux/task_work.h>
72 #include <linux/io_uring.h>
73 #include <linux/audit.h>
74 #include <linux/security.h>
76 #define CREATE_TRACE_POINTS
77 #include <trace/events/io_uring.h>
79 #include <uapi/linux/io_uring.h>
97 #include "alloc_cache.h"
99 #define IORING_MAX_ENTRIES 32768
100 #define IORING_MAX_CQ_ENTRIES (2 * IORING_MAX_ENTRIES)
102 #define IORING_MAX_RESTRICTIONS (IORING_RESTRICTION_LAST + \
103 IORING_REGISTER_LAST + IORING_OP_LAST)
105 #define SQE_COMMON_FLAGS (IOSQE_FIXED_FILE | IOSQE_IO_LINK | \
106 IOSQE_IO_HARDLINK | IOSQE_ASYNC)
108 #define SQE_VALID_FLAGS (SQE_COMMON_FLAGS | IOSQE_BUFFER_SELECT | \
109 IOSQE_IO_DRAIN | IOSQE_CQE_SKIP_SUCCESS)
111 #define IO_REQ_CLEAN_FLAGS (REQ_F_BUFFER_SELECTED | REQ_F_NEED_CLEANUP | \
112 REQ_F_POLLED | REQ_F_INFLIGHT | REQ_F_CREDS | \
115 #define IO_REQ_CLEAN_SLOW_FLAGS (REQ_F_REFCOUNT | REQ_F_LINK | REQ_F_HARDLINK |\
118 #define IO_TCTX_REFS_CACHE_NR (1U << 10)
120 #define IO_COMPL_BATCH 32
121 #define IO_REQ_ALLOC_BATCH 8
124 IO_CHECK_CQ_OVERFLOW_BIT,
125 IO_CHECK_CQ_DROPPED_BIT,
129 IO_EVENTFD_OP_SIGNAL_BIT,
130 IO_EVENTFD_OP_FREE_BIT,
133 struct io_defer_entry {
134 struct list_head list;
135 struct io_kiocb *req;
139 /* requests with any of those set should undergo io_disarm_next() */
140 #define IO_DISARM_MASK (REQ_F_ARM_LTIMEOUT | REQ_F_LINK_TIMEOUT | REQ_F_FAIL)
141 #define IO_REQ_LINK_FLAGS (REQ_F_LINK | REQ_F_HARDLINK)
143 static bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
144 struct task_struct *task,
147 static void io_dismantle_req(struct io_kiocb *req);
148 static void io_clean_op(struct io_kiocb *req);
149 static void io_queue_sqe(struct io_kiocb *req);
150 static void io_move_task_work_from_local(struct io_ring_ctx *ctx);
151 static void __io_submit_flush_completions(struct io_ring_ctx *ctx);
153 static struct kmem_cache *req_cachep;
155 struct sock *io_uring_get_socket(struct file *file)
157 #if defined(CONFIG_UNIX)
158 if (io_is_uring_fops(file)) {
159 struct io_ring_ctx *ctx = file->private_data;
161 return ctx->ring_sock->sk;
166 EXPORT_SYMBOL(io_uring_get_socket);
168 static inline void io_submit_flush_completions(struct io_ring_ctx *ctx)
170 if (!wq_list_empty(&ctx->submit_state.compl_reqs))
171 __io_submit_flush_completions(ctx);
174 static inline unsigned int __io_cqring_events(struct io_ring_ctx *ctx)
176 return ctx->cached_cq_tail - READ_ONCE(ctx->rings->cq.head);
179 static bool io_match_linked(struct io_kiocb *head)
181 struct io_kiocb *req;
183 io_for_each_link(req, head) {
184 if (req->flags & REQ_F_INFLIGHT)
191 * As io_match_task() but protected against racing with linked timeouts.
192 * User must not hold timeout_lock.
194 bool io_match_task_safe(struct io_kiocb *head, struct task_struct *task,
199 if (task && head->task != task)
204 if (head->flags & REQ_F_LINK_TIMEOUT) {
205 struct io_ring_ctx *ctx = head->ctx;
207 /* protect against races with linked timeouts */
208 spin_lock_irq(&ctx->timeout_lock);
209 matched = io_match_linked(head);
210 spin_unlock_irq(&ctx->timeout_lock);
212 matched = io_match_linked(head);
217 static inline void req_fail_link_node(struct io_kiocb *req, int res)
220 io_req_set_res(req, res, 0);
223 static inline void io_req_add_to_cache(struct io_kiocb *req, struct io_ring_ctx *ctx)
225 wq_stack_add_head(&req->comp_list, &ctx->submit_state.free_list);
228 static __cold void io_ring_ctx_ref_free(struct percpu_ref *ref)
230 struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs);
232 complete(&ctx->ref_comp);
235 static __cold void io_fallback_req_func(struct work_struct *work)
237 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx,
239 struct llist_node *node = llist_del_all(&ctx->fallback_llist);
240 struct io_kiocb *req, *tmp;
243 percpu_ref_get(&ctx->refs);
244 llist_for_each_entry_safe(req, tmp, node, io_task_work.node)
245 req->io_task_work.func(req, &locked);
248 io_submit_flush_completions(ctx);
249 mutex_unlock(&ctx->uring_lock);
251 percpu_ref_put(&ctx->refs);
254 static int io_alloc_hash_table(struct io_hash_table *table, unsigned bits)
256 unsigned hash_buckets = 1U << bits;
257 size_t hash_size = hash_buckets * sizeof(table->hbs[0]);
259 table->hbs = kmalloc(hash_size, GFP_KERNEL);
263 table->hash_bits = bits;
264 init_hash_table(table, hash_buckets);
268 static __cold struct io_ring_ctx *io_ring_ctx_alloc(struct io_uring_params *p)
270 struct io_ring_ctx *ctx;
273 ctx = kzalloc(sizeof(*ctx), GFP_KERNEL);
277 xa_init(&ctx->io_bl_xa);
280 * Use 5 bits less than the max cq entries, that should give us around
281 * 32 entries per hash list if totally full and uniformly spread, but
282 * don't keep too many buckets to not overconsume memory.
284 hash_bits = ilog2(p->cq_entries) - 5;
285 hash_bits = clamp(hash_bits, 1, 8);
286 if (io_alloc_hash_table(&ctx->cancel_table, hash_bits))
288 if (io_alloc_hash_table(&ctx->cancel_table_locked, hash_bits))
291 ctx->dummy_ubuf = kzalloc(sizeof(*ctx->dummy_ubuf), GFP_KERNEL);
292 if (!ctx->dummy_ubuf)
294 /* set invalid range, so io_import_fixed() fails meeting it */
295 ctx->dummy_ubuf->ubuf = -1UL;
297 if (percpu_ref_init(&ctx->refs, io_ring_ctx_ref_free,
301 ctx->flags = p->flags;
302 init_waitqueue_head(&ctx->sqo_sq_wait);
303 INIT_LIST_HEAD(&ctx->sqd_list);
304 INIT_LIST_HEAD(&ctx->cq_overflow_list);
305 INIT_LIST_HEAD(&ctx->io_buffers_cache);
306 io_alloc_cache_init(&ctx->apoll_cache);
307 io_alloc_cache_init(&ctx->netmsg_cache);
308 init_completion(&ctx->ref_comp);
309 xa_init_flags(&ctx->personalities, XA_FLAGS_ALLOC1);
310 mutex_init(&ctx->uring_lock);
311 init_waitqueue_head(&ctx->cq_wait);
312 spin_lock_init(&ctx->completion_lock);
313 spin_lock_init(&ctx->timeout_lock);
314 INIT_WQ_LIST(&ctx->iopoll_list);
315 INIT_LIST_HEAD(&ctx->io_buffers_pages);
316 INIT_LIST_HEAD(&ctx->io_buffers_comp);
317 INIT_LIST_HEAD(&ctx->defer_list);
318 INIT_LIST_HEAD(&ctx->timeout_list);
319 INIT_LIST_HEAD(&ctx->ltimeout_list);
320 spin_lock_init(&ctx->rsrc_ref_lock);
321 INIT_LIST_HEAD(&ctx->rsrc_ref_list);
322 INIT_DELAYED_WORK(&ctx->rsrc_put_work, io_rsrc_put_work);
323 init_llist_head(&ctx->rsrc_put_llist);
324 init_llist_head(&ctx->work_llist);
325 INIT_LIST_HEAD(&ctx->tctx_list);
326 ctx->submit_state.free_list.next = NULL;
327 INIT_WQ_LIST(&ctx->locked_free_list);
328 INIT_DELAYED_WORK(&ctx->fallback_work, io_fallback_req_func);
329 INIT_WQ_LIST(&ctx->submit_state.compl_reqs);
332 kfree(ctx->dummy_ubuf);
333 kfree(ctx->cancel_table.hbs);
334 kfree(ctx->cancel_table_locked.hbs);
336 xa_destroy(&ctx->io_bl_xa);
341 static void io_account_cq_overflow(struct io_ring_ctx *ctx)
343 struct io_rings *r = ctx->rings;
345 WRITE_ONCE(r->cq_overflow, READ_ONCE(r->cq_overflow) + 1);
349 static bool req_need_defer(struct io_kiocb *req, u32 seq)
351 if (unlikely(req->flags & REQ_F_IO_DRAIN)) {
352 struct io_ring_ctx *ctx = req->ctx;
354 return seq + READ_ONCE(ctx->cq_extra) != ctx->cached_cq_tail;
360 static inline void io_req_track_inflight(struct io_kiocb *req)
362 if (!(req->flags & REQ_F_INFLIGHT)) {
363 req->flags |= REQ_F_INFLIGHT;
364 atomic_inc(&req->task->io_uring->inflight_tracked);
368 static struct io_kiocb *__io_prep_linked_timeout(struct io_kiocb *req)
370 if (WARN_ON_ONCE(!req->link))
373 req->flags &= ~REQ_F_ARM_LTIMEOUT;
374 req->flags |= REQ_F_LINK_TIMEOUT;
376 /* linked timeouts should have two refs once prep'ed */
377 io_req_set_refcount(req);
378 __io_req_set_refcount(req->link, 2);
382 static inline struct io_kiocb *io_prep_linked_timeout(struct io_kiocb *req)
384 if (likely(!(req->flags & REQ_F_ARM_LTIMEOUT)))
386 return __io_prep_linked_timeout(req);
389 static noinline void __io_arm_ltimeout(struct io_kiocb *req)
391 io_queue_linked_timeout(__io_prep_linked_timeout(req));
394 static inline void io_arm_ltimeout(struct io_kiocb *req)
396 if (unlikely(req->flags & REQ_F_ARM_LTIMEOUT))
397 __io_arm_ltimeout(req);
400 static void io_prep_async_work(struct io_kiocb *req)
402 const struct io_op_def *def = &io_op_defs[req->opcode];
403 struct io_ring_ctx *ctx = req->ctx;
405 if (!(req->flags & REQ_F_CREDS)) {
406 req->flags |= REQ_F_CREDS;
407 req->creds = get_current_cred();
410 req->work.list.next = NULL;
412 req->work.cancel_seq = atomic_read(&ctx->cancel_seq);
413 if (req->flags & REQ_F_FORCE_ASYNC)
414 req->work.flags |= IO_WQ_WORK_CONCURRENT;
416 if (req->file && !io_req_ffs_set(req))
417 req->flags |= io_file_get_flags(req->file) << REQ_F_SUPPORT_NOWAIT_BIT;
419 if (req->flags & REQ_F_ISREG) {
420 if (def->hash_reg_file || (ctx->flags & IORING_SETUP_IOPOLL))
421 io_wq_hash_work(&req->work, file_inode(req->file));
422 } else if (!req->file || !S_ISBLK(file_inode(req->file)->i_mode)) {
423 if (def->unbound_nonreg_file)
424 req->work.flags |= IO_WQ_WORK_UNBOUND;
428 static void io_prep_async_link(struct io_kiocb *req)
430 struct io_kiocb *cur;
432 if (req->flags & REQ_F_LINK_TIMEOUT) {
433 struct io_ring_ctx *ctx = req->ctx;
435 spin_lock_irq(&ctx->timeout_lock);
436 io_for_each_link(cur, req)
437 io_prep_async_work(cur);
438 spin_unlock_irq(&ctx->timeout_lock);
440 io_for_each_link(cur, req)
441 io_prep_async_work(cur);
445 void io_queue_iowq(struct io_kiocb *req, bool *dont_use)
447 struct io_kiocb *link = io_prep_linked_timeout(req);
448 struct io_uring_task *tctx = req->task->io_uring;
451 BUG_ON(!tctx->io_wq);
453 /* init ->work of the whole link before punting */
454 io_prep_async_link(req);
457 * Not expected to happen, but if we do have a bug where this _can_
458 * happen, catch it here and ensure the request is marked as
459 * canceled. That will make io-wq go through the usual work cancel
460 * procedure rather than attempt to run this request (or create a new
463 if (WARN_ON_ONCE(!same_thread_group(req->task, current)))
464 req->work.flags |= IO_WQ_WORK_CANCEL;
466 trace_io_uring_queue_async_work(req, io_wq_is_hashed(&req->work));
467 io_wq_enqueue(tctx->io_wq, &req->work);
469 io_queue_linked_timeout(link);
472 static __cold void io_queue_deferred(struct io_ring_ctx *ctx)
474 while (!list_empty(&ctx->defer_list)) {
475 struct io_defer_entry *de = list_first_entry(&ctx->defer_list,
476 struct io_defer_entry, list);
478 if (req_need_defer(de->req, de->seq))
480 list_del_init(&de->list);
481 io_req_task_queue(de->req);
487 static void io_eventfd_ops(struct rcu_head *rcu)
489 struct io_ev_fd *ev_fd = container_of(rcu, struct io_ev_fd, rcu);
490 int ops = atomic_xchg(&ev_fd->ops, 0);
492 if (ops & BIT(IO_EVENTFD_OP_SIGNAL_BIT))
493 eventfd_signal(ev_fd->cq_ev_fd, 1);
495 /* IO_EVENTFD_OP_FREE_BIT may not be set here depending on callback
496 * ordering in a race but if references are 0 we know we have to free
499 if (atomic_dec_and_test(&ev_fd->refs)) {
500 eventfd_ctx_put(ev_fd->cq_ev_fd);
505 static void io_eventfd_signal(struct io_ring_ctx *ctx)
507 struct io_ev_fd *ev_fd = NULL;
511 * rcu_dereference ctx->io_ev_fd once and use it for both for checking
514 ev_fd = rcu_dereference(ctx->io_ev_fd);
517 * Check again if ev_fd exists incase an io_eventfd_unregister call
518 * completed between the NULL check of ctx->io_ev_fd at the start of
519 * the function and rcu_read_lock.
521 if (unlikely(!ev_fd))
523 if (READ_ONCE(ctx->rings->cq_flags) & IORING_CQ_EVENTFD_DISABLED)
525 if (ev_fd->eventfd_async && !io_wq_current_is_worker())
528 if (likely(eventfd_signal_allowed())) {
529 eventfd_signal(ev_fd->cq_ev_fd, 1);
531 atomic_inc(&ev_fd->refs);
532 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_SIGNAL_BIT), &ev_fd->ops))
533 call_rcu(&ev_fd->rcu, io_eventfd_ops);
535 atomic_dec(&ev_fd->refs);
542 static void io_eventfd_flush_signal(struct io_ring_ctx *ctx)
546 spin_lock(&ctx->completion_lock);
549 * Eventfd should only get triggered when at least one event has been
550 * posted. Some applications rely on the eventfd notification count
551 * only changing IFF a new CQE has been added to the CQ ring. There's
552 * no depedency on 1:1 relationship between how many times this
553 * function is called (and hence the eventfd count) and number of CQEs
554 * posted to the CQ ring.
556 skip = ctx->cached_cq_tail == ctx->evfd_last_cq_tail;
557 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
558 spin_unlock(&ctx->completion_lock);
562 io_eventfd_signal(ctx);
565 void __io_commit_cqring_flush(struct io_ring_ctx *ctx)
567 if (ctx->off_timeout_used || ctx->drain_active) {
568 spin_lock(&ctx->completion_lock);
569 if (ctx->off_timeout_used)
570 io_flush_timeouts(ctx);
571 if (ctx->drain_active)
572 io_queue_deferred(ctx);
573 spin_unlock(&ctx->completion_lock);
576 io_eventfd_flush_signal(ctx);
579 static inline void io_cqring_ev_posted(struct io_ring_ctx *ctx)
581 io_commit_cqring_flush(ctx);
585 static inline void __io_cq_unlock_post(struct io_ring_ctx *ctx)
586 __releases(ctx->completion_lock)
588 io_commit_cqring(ctx);
589 spin_unlock(&ctx->completion_lock);
590 io_cqring_ev_posted(ctx);
593 void io_cq_unlock_post(struct io_ring_ctx *ctx)
595 __io_cq_unlock_post(ctx);
598 /* Returns true if there are no backlogged entries after the flush */
599 static bool __io_cqring_overflow_flush(struct io_ring_ctx *ctx, bool force)
602 size_t cqe_size = sizeof(struct io_uring_cqe);
604 if (!force && __io_cqring_events(ctx) == ctx->cq_entries)
607 if (ctx->flags & IORING_SETUP_CQE32)
611 while (!list_empty(&ctx->cq_overflow_list)) {
612 struct io_uring_cqe *cqe = io_get_cqe_overflow(ctx, true);
613 struct io_overflow_cqe *ocqe;
617 ocqe = list_first_entry(&ctx->cq_overflow_list,
618 struct io_overflow_cqe, list);
620 memcpy(cqe, &ocqe->cqe, cqe_size);
622 io_account_cq_overflow(ctx);
624 list_del(&ocqe->list);
628 all_flushed = list_empty(&ctx->cq_overflow_list);
630 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
631 atomic_andnot(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
634 io_cq_unlock_post(ctx);
638 static bool io_cqring_overflow_flush(struct io_ring_ctx *ctx)
642 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) {
643 /* iopoll syncs against uring_lock, not completion_lock */
644 if (ctx->flags & IORING_SETUP_IOPOLL)
645 mutex_lock(&ctx->uring_lock);
646 ret = __io_cqring_overflow_flush(ctx, false);
647 if (ctx->flags & IORING_SETUP_IOPOLL)
648 mutex_unlock(&ctx->uring_lock);
654 void __io_put_task(struct task_struct *task, int nr)
656 struct io_uring_task *tctx = task->io_uring;
658 percpu_counter_sub(&tctx->inflight, nr);
659 if (unlikely(atomic_read(&tctx->in_idle)))
660 wake_up(&tctx->wait);
661 put_task_struct_many(task, nr);
664 void io_task_refs_refill(struct io_uring_task *tctx)
666 unsigned int refill = -tctx->cached_refs + IO_TCTX_REFS_CACHE_NR;
668 percpu_counter_add(&tctx->inflight, refill);
669 refcount_add(refill, ¤t->usage);
670 tctx->cached_refs += refill;
673 static __cold void io_uring_drop_tctx_refs(struct task_struct *task)
675 struct io_uring_task *tctx = task->io_uring;
676 unsigned int refs = tctx->cached_refs;
679 tctx->cached_refs = 0;
680 percpu_counter_sub(&tctx->inflight, refs);
681 put_task_struct_many(task, refs);
685 static bool io_cqring_event_overflow(struct io_ring_ctx *ctx, u64 user_data,
686 s32 res, u32 cflags, u64 extra1, u64 extra2)
688 struct io_overflow_cqe *ocqe;
689 size_t ocq_size = sizeof(struct io_overflow_cqe);
690 bool is_cqe32 = (ctx->flags & IORING_SETUP_CQE32);
693 ocq_size += sizeof(struct io_uring_cqe);
695 ocqe = kmalloc(ocq_size, GFP_ATOMIC | __GFP_ACCOUNT);
696 trace_io_uring_cqe_overflow(ctx, user_data, res, cflags, ocqe);
699 * If we're in ring overflow flush mode, or in task cancel mode,
700 * or cannot allocate an overflow entry, then we need to drop it
703 io_account_cq_overflow(ctx);
704 set_bit(IO_CHECK_CQ_DROPPED_BIT, &ctx->check_cq);
707 if (list_empty(&ctx->cq_overflow_list)) {
708 set_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
709 atomic_or(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
712 ocqe->cqe.user_data = user_data;
714 ocqe->cqe.flags = cflags;
716 ocqe->cqe.big_cqe[0] = extra1;
717 ocqe->cqe.big_cqe[1] = extra2;
719 list_add_tail(&ocqe->list, &ctx->cq_overflow_list);
723 bool io_req_cqe_overflow(struct io_kiocb *req)
725 if (!(req->flags & REQ_F_CQE32_INIT)) {
729 return io_cqring_event_overflow(req->ctx, req->cqe.user_data,
730 req->cqe.res, req->cqe.flags,
731 req->extra1, req->extra2);
735 * writes to the cq entry need to come after reading head; the
736 * control dependency is enough as we're using WRITE_ONCE to
739 struct io_uring_cqe *__io_get_cqe(struct io_ring_ctx *ctx, bool overflow)
741 struct io_rings *rings = ctx->rings;
742 unsigned int off = ctx->cached_cq_tail & (ctx->cq_entries - 1);
743 unsigned int free, queued, len;
746 * Posting into the CQ when there are pending overflowed CQEs may break
747 * ordering guarantees, which will affect links, F_MORE users and more.
748 * Force overflow the completion.
750 if (!overflow && (ctx->check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)))
753 /* userspace may cheat modifying the tail, be safe and do min */
754 queued = min(__io_cqring_events(ctx), ctx->cq_entries);
755 free = ctx->cq_entries - queued;
756 /* we need a contiguous range, limit based on the current array offset */
757 len = min(free, ctx->cq_entries - off);
761 if (ctx->flags & IORING_SETUP_CQE32) {
766 ctx->cqe_cached = &rings->cqes[off];
767 ctx->cqe_sentinel = ctx->cqe_cached + len;
769 ctx->cached_cq_tail++;
771 if (ctx->flags & IORING_SETUP_CQE32)
773 return &rings->cqes[off];
776 bool io_fill_cqe_aux(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags,
779 struct io_uring_cqe *cqe;
784 * If we can't get a cq entry, userspace overflowed the
785 * submission (by quite a lot). Increment the overflow count in
788 cqe = io_get_cqe(ctx);
790 trace_io_uring_complete(ctx, NULL, user_data, res, cflags, 0, 0);
792 WRITE_ONCE(cqe->user_data, user_data);
793 WRITE_ONCE(cqe->res, res);
794 WRITE_ONCE(cqe->flags, cflags);
796 if (ctx->flags & IORING_SETUP_CQE32) {
797 WRITE_ONCE(cqe->big_cqe[0], 0);
798 WRITE_ONCE(cqe->big_cqe[1], 0);
804 return io_cqring_event_overflow(ctx, user_data, res, cflags, 0, 0);
809 bool io_post_aux_cqe(struct io_ring_ctx *ctx,
810 u64 user_data, s32 res, u32 cflags,
816 filled = io_fill_cqe_aux(ctx, user_data, res, cflags, allow_overflow);
817 io_cq_unlock_post(ctx);
821 static void __io_req_complete_put(struct io_kiocb *req)
824 * If we're the last reference to this request, add to our locked
827 if (req_ref_put_and_test(req)) {
828 struct io_ring_ctx *ctx = req->ctx;
830 if (req->flags & IO_REQ_LINK_FLAGS) {
831 if (req->flags & IO_DISARM_MASK)
834 io_req_task_queue(req->link);
838 io_req_put_rsrc(req);
840 * Selected buffer deallocation in io_clean_op() assumes that
841 * we don't hold ->completion_lock. Clean them here to avoid
844 io_put_kbuf_comp(req);
845 io_dismantle_req(req);
846 io_put_task(req->task, 1);
847 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
848 ctx->locked_free_nr++;
852 void __io_req_complete_post(struct io_kiocb *req)
854 if (!(req->flags & REQ_F_CQE_SKIP))
855 __io_fill_cqe_req(req->ctx, req);
856 __io_req_complete_put(req);
859 void io_req_complete_post(struct io_kiocb *req)
861 struct io_ring_ctx *ctx = req->ctx;
864 __io_req_complete_post(req);
865 io_cq_unlock_post(ctx);
868 inline void __io_req_complete(struct io_kiocb *req, unsigned issue_flags)
870 io_req_complete_post(req);
873 void io_req_complete_failed(struct io_kiocb *req, s32 res)
875 const struct io_op_def *def = &io_op_defs[req->opcode];
878 io_req_set_res(req, res, io_put_kbuf(req, IO_URING_F_UNLOCKED));
881 io_req_complete_post(req);
885 * Don't initialise the fields below on every allocation, but do that in
886 * advance and keep them valid across allocations.
888 static void io_preinit_req(struct io_kiocb *req, struct io_ring_ctx *ctx)
892 req->async_data = NULL;
893 /* not necessary, but safer to zero */
897 static void io_flush_cached_locked_reqs(struct io_ring_ctx *ctx,
898 struct io_submit_state *state)
900 spin_lock(&ctx->completion_lock);
901 wq_list_splice(&ctx->locked_free_list, &state->free_list);
902 ctx->locked_free_nr = 0;
903 spin_unlock(&ctx->completion_lock);
907 * A request might get retired back into the request caches even before opcode
908 * handlers and io_issue_sqe() are done with it, e.g. inline completion path.
909 * Because of that, io_alloc_req() should be called only under ->uring_lock
910 * and with extra caution to not get a request that is still worked on.
912 __cold bool __io_alloc_req_refill(struct io_ring_ctx *ctx)
913 __must_hold(&ctx->uring_lock)
915 gfp_t gfp = GFP_KERNEL | __GFP_NOWARN;
916 void *reqs[IO_REQ_ALLOC_BATCH];
920 * If we have more than a batch's worth of requests in our IRQ side
921 * locked cache, grab the lock and move them over to our submission
924 if (data_race(ctx->locked_free_nr) > IO_COMPL_BATCH) {
925 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
926 if (!io_req_cache_empty(ctx))
930 ret = kmem_cache_alloc_bulk(req_cachep, gfp, ARRAY_SIZE(reqs), reqs);
933 * Bulk alloc is all-or-nothing. If we fail to get a batch,
934 * retry single alloc to be on the safe side.
936 if (unlikely(ret <= 0)) {
937 reqs[0] = kmem_cache_alloc(req_cachep, gfp);
943 percpu_ref_get_many(&ctx->refs, ret);
944 for (i = 0; i < ret; i++) {
945 struct io_kiocb *req = reqs[i];
947 io_preinit_req(req, ctx);
948 io_req_add_to_cache(req, ctx);
953 static inline void io_dismantle_req(struct io_kiocb *req)
955 unsigned int flags = req->flags;
957 if (unlikely(flags & IO_REQ_CLEAN_FLAGS))
959 if (!(flags & REQ_F_FIXED_FILE))
960 io_put_file(req->file);
963 __cold void io_free_req(struct io_kiocb *req)
965 struct io_ring_ctx *ctx = req->ctx;
967 io_req_put_rsrc(req);
968 io_dismantle_req(req);
969 io_put_task(req->task, 1);
971 spin_lock(&ctx->completion_lock);
972 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
973 ctx->locked_free_nr++;
974 spin_unlock(&ctx->completion_lock);
977 static void __io_req_find_next_prep(struct io_kiocb *req)
979 struct io_ring_ctx *ctx = req->ctx;
983 io_cq_unlock_post(ctx);
986 static inline struct io_kiocb *io_req_find_next(struct io_kiocb *req)
988 struct io_kiocb *nxt;
991 * If LINK is set, we have dependent requests in this chain. If we
992 * didn't fail this request, queue the first one up, moving any other
993 * dependencies to the next request. In case of failure, fail the rest
996 if (unlikely(req->flags & IO_DISARM_MASK))
997 __io_req_find_next_prep(req);
1003 static void ctx_flush_and_put(struct io_ring_ctx *ctx, bool *locked)
1007 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1008 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1010 io_submit_flush_completions(ctx);
1011 mutex_unlock(&ctx->uring_lock);
1014 percpu_ref_put(&ctx->refs);
1017 static unsigned int handle_tw_list(struct llist_node *node,
1018 struct io_ring_ctx **ctx, bool *locked,
1019 struct llist_node *last)
1021 unsigned int count = 0;
1023 while (node != last) {
1024 struct llist_node *next = node->next;
1025 struct io_kiocb *req = container_of(node, struct io_kiocb,
1028 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1030 if (req->ctx != *ctx) {
1031 ctx_flush_and_put(*ctx, locked);
1033 /* if not contended, grab and improve batching */
1034 *locked = mutex_trylock(&(*ctx)->uring_lock);
1035 percpu_ref_get(&(*ctx)->refs);
1037 req->io_task_work.func(req, locked);
1046 * io_llist_xchg - swap all entries in a lock-less list
1047 * @head: the head of lock-less list to delete all entries
1048 * @new: new entry as the head of the list
1050 * If list is empty, return NULL, otherwise, return the pointer to the first entry.
1051 * The order of entries returned is from the newest to the oldest added one.
1053 static inline struct llist_node *io_llist_xchg(struct llist_head *head,
1054 struct llist_node *new)
1056 return xchg(&head->first, new);
1060 * io_llist_cmpxchg - possibly swap all entries in a lock-less list
1061 * @head: the head of lock-less list to delete all entries
1062 * @old: expected old value of the first entry of the list
1063 * @new: new entry as the head of the list
1065 * perform a cmpxchg on the first entry of the list.
1068 static inline struct llist_node *io_llist_cmpxchg(struct llist_head *head,
1069 struct llist_node *old,
1070 struct llist_node *new)
1072 return cmpxchg(&head->first, old, new);
1075 void tctx_task_work(struct callback_head *cb)
1077 bool uring_locked = false;
1078 struct io_ring_ctx *ctx = NULL;
1079 struct io_uring_task *tctx = container_of(cb, struct io_uring_task,
1081 struct llist_node fake = {};
1082 struct llist_node *node = io_llist_xchg(&tctx->task_list, &fake);
1083 unsigned int loops = 1;
1084 unsigned int count = handle_tw_list(node, &ctx, &uring_locked, NULL);
1086 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1087 while (node != &fake) {
1089 node = io_llist_xchg(&tctx->task_list, &fake);
1090 count += handle_tw_list(node, &ctx, &uring_locked, &fake);
1091 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1094 ctx_flush_and_put(ctx, &uring_locked);
1096 /* relaxed read is enough as only the task itself sets ->in_idle */
1097 if (unlikely(atomic_read(&tctx->in_idle)))
1098 io_uring_drop_tctx_refs(current);
1100 trace_io_uring_task_work_run(tctx, count, loops);
1103 static void io_req_local_work_add(struct io_kiocb *req)
1105 struct io_ring_ctx *ctx = req->ctx;
1107 if (!llist_add(&req->io_task_work.node, &ctx->work_llist))
1109 /* need it for the following io_cqring_wake() */
1110 smp_mb__after_atomic();
1112 if (unlikely(atomic_read(&req->task->io_uring->in_idle))) {
1113 io_move_task_work_from_local(ctx);
1117 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1118 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1121 io_eventfd_signal(ctx);
1122 __io_cqring_wake(ctx);
1125 static inline void __io_req_task_work_add(struct io_kiocb *req, bool allow_local)
1127 struct io_uring_task *tctx = req->task->io_uring;
1128 struct io_ring_ctx *ctx = req->ctx;
1129 struct llist_node *node;
1131 if (allow_local && ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
1132 io_req_local_work_add(req);
1136 /* task_work already pending, we're done */
1137 if (!llist_add(&req->io_task_work.node, &tctx->task_list))
1140 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1141 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1143 if (likely(!task_work_add(req->task, &tctx->task_work, ctx->notify_method)))
1146 node = llist_del_all(&tctx->task_list);
1149 req = container_of(node, struct io_kiocb, io_task_work.node);
1151 if (llist_add(&req->io_task_work.node,
1152 &req->ctx->fallback_llist))
1153 schedule_delayed_work(&req->ctx->fallback_work, 1);
1157 void io_req_task_work_add(struct io_kiocb *req)
1159 __io_req_task_work_add(req, true);
1162 static void __cold io_move_task_work_from_local(struct io_ring_ctx *ctx)
1164 struct llist_node *node;
1166 node = llist_del_all(&ctx->work_llist);
1168 struct io_kiocb *req = container_of(node, struct io_kiocb,
1172 __io_req_task_work_add(req, false);
1176 int __io_run_local_work(struct io_ring_ctx *ctx, bool *locked)
1178 struct llist_node *node;
1179 struct llist_node fake;
1180 struct llist_node *current_final = NULL;
1182 unsigned int loops = 1;
1184 if (unlikely(ctx->submitter_task != current))
1187 node = io_llist_xchg(&ctx->work_llist, &fake);
1190 while (node != current_final) {
1191 struct llist_node *next = node->next;
1192 struct io_kiocb *req = container_of(node, struct io_kiocb,
1194 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1195 req->io_task_work.func(req, locked);
1200 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1201 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1203 node = io_llist_cmpxchg(&ctx->work_llist, &fake, NULL);
1204 if (node != &fake) {
1206 current_final = &fake;
1207 node = io_llist_xchg(&ctx->work_llist, &fake);
1212 io_submit_flush_completions(ctx);
1213 trace_io_uring_local_work_run(ctx, ret, loops);
1218 int io_run_local_work(struct io_ring_ctx *ctx)
1223 if (llist_empty(&ctx->work_llist))
1226 __set_current_state(TASK_RUNNING);
1227 locked = mutex_trylock(&ctx->uring_lock);
1228 ret = __io_run_local_work(ctx, &locked);
1230 mutex_unlock(&ctx->uring_lock);
1235 static void io_req_tw_post(struct io_kiocb *req, bool *locked)
1237 io_req_complete_post(req);
1240 void io_req_tw_post_queue(struct io_kiocb *req, s32 res, u32 cflags)
1242 io_req_set_res(req, res, cflags);
1243 req->io_task_work.func = io_req_tw_post;
1244 io_req_task_work_add(req);
1247 static void io_req_task_cancel(struct io_kiocb *req, bool *locked)
1249 /* not needed for normal modes, but SQPOLL depends on it */
1250 io_tw_lock(req->ctx, locked);
1251 io_req_complete_failed(req, req->cqe.res);
1254 void io_req_task_submit(struct io_kiocb *req, bool *locked)
1256 io_tw_lock(req->ctx, locked);
1257 /* req->task == current here, checking PF_EXITING is safe */
1258 if (likely(!(req->task->flags & PF_EXITING)))
1261 io_req_complete_failed(req, -EFAULT);
1264 void io_req_task_queue_fail(struct io_kiocb *req, int ret)
1266 io_req_set_res(req, ret, 0);
1267 req->io_task_work.func = io_req_task_cancel;
1268 io_req_task_work_add(req);
1271 void io_req_task_queue(struct io_kiocb *req)
1273 req->io_task_work.func = io_req_task_submit;
1274 io_req_task_work_add(req);
1277 void io_queue_next(struct io_kiocb *req)
1279 struct io_kiocb *nxt = io_req_find_next(req);
1282 io_req_task_queue(nxt);
1285 void io_free_batch_list(struct io_ring_ctx *ctx, struct io_wq_work_node *node)
1286 __must_hold(&ctx->uring_lock)
1288 struct task_struct *task = NULL;
1292 struct io_kiocb *req = container_of(node, struct io_kiocb,
1295 if (unlikely(req->flags & IO_REQ_CLEAN_SLOW_FLAGS)) {
1296 if (req->flags & REQ_F_REFCOUNT) {
1297 node = req->comp_list.next;
1298 if (!req_ref_put_and_test(req))
1301 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1302 struct async_poll *apoll = req->apoll;
1304 if (apoll->double_poll)
1305 kfree(apoll->double_poll);
1306 if (!io_alloc_cache_put(&ctx->apoll_cache, &apoll->cache))
1308 req->flags &= ~REQ_F_POLLED;
1310 if (req->flags & IO_REQ_LINK_FLAGS)
1312 if (unlikely(req->flags & IO_REQ_CLEAN_FLAGS))
1315 if (!(req->flags & REQ_F_FIXED_FILE))
1316 io_put_file(req->file);
1318 io_req_put_rsrc_locked(req, ctx);
1320 if (req->task != task) {
1322 io_put_task(task, task_refs);
1327 node = req->comp_list.next;
1328 io_req_add_to_cache(req, ctx);
1332 io_put_task(task, task_refs);
1335 static void __io_submit_flush_completions(struct io_ring_ctx *ctx)
1336 __must_hold(&ctx->uring_lock)
1338 struct io_wq_work_node *node, *prev;
1339 struct io_submit_state *state = &ctx->submit_state;
1342 wq_list_for_each(node, prev, &state->compl_reqs) {
1343 struct io_kiocb *req = container_of(node, struct io_kiocb,
1346 if (!(req->flags & REQ_F_CQE_SKIP))
1347 __io_fill_cqe_req(ctx, req);
1349 __io_cq_unlock_post(ctx);
1351 io_free_batch_list(ctx, state->compl_reqs.first);
1352 INIT_WQ_LIST(&state->compl_reqs);
1356 * Drop reference to request, return next in chain (if there is one) if this
1357 * was the last reference to this request.
1359 static inline struct io_kiocb *io_put_req_find_next(struct io_kiocb *req)
1361 struct io_kiocb *nxt = NULL;
1363 if (req_ref_put_and_test(req)) {
1364 if (unlikely(req->flags & IO_REQ_LINK_FLAGS))
1365 nxt = io_req_find_next(req);
1371 static unsigned io_cqring_events(struct io_ring_ctx *ctx)
1373 /* See comment at the top of this file */
1375 return __io_cqring_events(ctx);
1379 * We can't just wait for polled events to come to us, we have to actively
1380 * find and complete them.
1382 static __cold void io_iopoll_try_reap_events(struct io_ring_ctx *ctx)
1384 if (!(ctx->flags & IORING_SETUP_IOPOLL))
1387 mutex_lock(&ctx->uring_lock);
1388 while (!wq_list_empty(&ctx->iopoll_list)) {
1389 /* let it sleep and repeat later if can't complete a request */
1390 if (io_do_iopoll(ctx, true) == 0)
1393 * Ensure we allow local-to-the-cpu processing to take place,
1394 * in this case we need to ensure that we reap all events.
1395 * Also let task_work, etc. to progress by releasing the mutex
1397 if (need_resched()) {
1398 mutex_unlock(&ctx->uring_lock);
1400 mutex_lock(&ctx->uring_lock);
1403 mutex_unlock(&ctx->uring_lock);
1406 static int io_iopoll_check(struct io_ring_ctx *ctx, long min)
1408 unsigned int nr_events = 0;
1410 unsigned long check_cq;
1412 if (!io_allowed_run_tw(ctx))
1415 check_cq = READ_ONCE(ctx->check_cq);
1416 if (unlikely(check_cq)) {
1417 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
1418 __io_cqring_overflow_flush(ctx, false);
1420 * Similarly do not spin if we have not informed the user of any
1423 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT))
1427 * Don't enter poll loop if we already have events pending.
1428 * If we do, we can potentially be spinning for commands that
1429 * already triggered a CQE (eg in error).
1431 if (io_cqring_events(ctx))
1436 * If a submit got punted to a workqueue, we can have the
1437 * application entering polling for a command before it gets
1438 * issued. That app will hold the uring_lock for the duration
1439 * of the poll right here, so we need to take a breather every
1440 * now and then to ensure that the issue has a chance to add
1441 * the poll to the issued list. Otherwise we can spin here
1442 * forever, while the workqueue is stuck trying to acquire the
1445 if (wq_list_empty(&ctx->iopoll_list) ||
1446 io_task_work_pending(ctx)) {
1447 u32 tail = ctx->cached_cq_tail;
1449 (void) io_run_local_work_locked(ctx);
1451 if (task_work_pending(current) ||
1452 wq_list_empty(&ctx->iopoll_list)) {
1453 mutex_unlock(&ctx->uring_lock);
1455 mutex_lock(&ctx->uring_lock);
1457 /* some requests don't go through iopoll_list */
1458 if (tail != ctx->cached_cq_tail ||
1459 wq_list_empty(&ctx->iopoll_list))
1462 ret = io_do_iopoll(ctx, !min);
1467 } while (nr_events < min && !need_resched());
1472 void io_req_task_complete(struct io_kiocb *req, bool *locked)
1474 if (req->flags & (REQ_F_BUFFER_SELECTED|REQ_F_BUFFER_RING)) {
1475 unsigned issue_flags = *locked ? 0 : IO_URING_F_UNLOCKED;
1477 req->cqe.flags |= io_put_kbuf(req, issue_flags);
1481 io_req_complete_defer(req);
1483 io_req_complete_post(req);
1487 * After the iocb has been issued, it's safe to be found on the poll list.
1488 * Adding the kiocb to the list AFTER submission ensures that we don't
1489 * find it from a io_do_iopoll() thread before the issuer is done
1490 * accessing the kiocb cookie.
1492 static void io_iopoll_req_issued(struct io_kiocb *req, unsigned int issue_flags)
1494 struct io_ring_ctx *ctx = req->ctx;
1495 const bool needs_lock = issue_flags & IO_URING_F_UNLOCKED;
1497 /* workqueue context doesn't hold uring_lock, grab it now */
1498 if (unlikely(needs_lock))
1499 mutex_lock(&ctx->uring_lock);
1502 * Track whether we have multiple files in our lists. This will impact
1503 * how we do polling eventually, not spinning if we're on potentially
1504 * different devices.
1506 if (wq_list_empty(&ctx->iopoll_list)) {
1507 ctx->poll_multi_queue = false;
1508 } else if (!ctx->poll_multi_queue) {
1509 struct io_kiocb *list_req;
1511 list_req = container_of(ctx->iopoll_list.first, struct io_kiocb,
1513 if (list_req->file != req->file)
1514 ctx->poll_multi_queue = true;
1518 * For fast devices, IO may have already completed. If it has, add
1519 * it to the front so we find it first.
1521 if (READ_ONCE(req->iopoll_completed))
1522 wq_list_add_head(&req->comp_list, &ctx->iopoll_list);
1524 wq_list_add_tail(&req->comp_list, &ctx->iopoll_list);
1526 if (unlikely(needs_lock)) {
1528 * If IORING_SETUP_SQPOLL is enabled, sqes are either handle
1529 * in sq thread task context or in io worker task context. If
1530 * current task context is sq thread, we don't need to check
1531 * whether should wake up sq thread.
1533 if ((ctx->flags & IORING_SETUP_SQPOLL) &&
1534 wq_has_sleeper(&ctx->sq_data->wait))
1535 wake_up(&ctx->sq_data->wait);
1537 mutex_unlock(&ctx->uring_lock);
1541 static bool io_bdev_nowait(struct block_device *bdev)
1543 return !bdev || bdev_nowait(bdev);
1547 * If we tracked the file through the SCM inflight mechanism, we could support
1548 * any file. For now, just ensure that anything potentially problematic is done
1551 static bool __io_file_supports_nowait(struct file *file, umode_t mode)
1553 if (S_ISBLK(mode)) {
1554 if (IS_ENABLED(CONFIG_BLOCK) &&
1555 io_bdev_nowait(I_BDEV(file->f_mapping->host)))
1561 if (S_ISREG(mode)) {
1562 if (IS_ENABLED(CONFIG_BLOCK) &&
1563 io_bdev_nowait(file->f_inode->i_sb->s_bdev) &&
1564 !io_is_uring_fops(file))
1569 /* any ->read/write should understand O_NONBLOCK */
1570 if (file->f_flags & O_NONBLOCK)
1572 return file->f_mode & FMODE_NOWAIT;
1576 * If we tracked the file through the SCM inflight mechanism, we could support
1577 * any file. For now, just ensure that anything potentially problematic is done
1580 unsigned int io_file_get_flags(struct file *file)
1582 umode_t mode = file_inode(file)->i_mode;
1583 unsigned int res = 0;
1587 if (__io_file_supports_nowait(file, mode))
1592 bool io_alloc_async_data(struct io_kiocb *req)
1594 WARN_ON_ONCE(!io_op_defs[req->opcode].async_size);
1595 req->async_data = kmalloc(io_op_defs[req->opcode].async_size, GFP_KERNEL);
1596 if (req->async_data) {
1597 req->flags |= REQ_F_ASYNC_DATA;
1603 int io_req_prep_async(struct io_kiocb *req)
1605 const struct io_op_def *def = &io_op_defs[req->opcode];
1607 /* assign early for deferred execution for non-fixed file */
1608 if (def->needs_file && !(req->flags & REQ_F_FIXED_FILE))
1609 req->file = io_file_get_normal(req, req->cqe.fd);
1610 if (!def->prep_async)
1612 if (WARN_ON_ONCE(req_has_async_data(req)))
1614 if (!io_op_defs[req->opcode].manual_alloc) {
1615 if (io_alloc_async_data(req))
1618 return def->prep_async(req);
1621 static u32 io_get_sequence(struct io_kiocb *req)
1623 u32 seq = req->ctx->cached_sq_head;
1624 struct io_kiocb *cur;
1626 /* need original cached_sq_head, but it was increased for each req */
1627 io_for_each_link(cur, req)
1632 static __cold void io_drain_req(struct io_kiocb *req)
1634 struct io_ring_ctx *ctx = req->ctx;
1635 struct io_defer_entry *de;
1637 u32 seq = io_get_sequence(req);
1639 /* Still need defer if there is pending req in defer list. */
1640 spin_lock(&ctx->completion_lock);
1641 if (!req_need_defer(req, seq) && list_empty_careful(&ctx->defer_list)) {
1642 spin_unlock(&ctx->completion_lock);
1644 ctx->drain_active = false;
1645 io_req_task_queue(req);
1648 spin_unlock(&ctx->completion_lock);
1650 ret = io_req_prep_async(req);
1653 io_req_complete_failed(req, ret);
1656 io_prep_async_link(req);
1657 de = kmalloc(sizeof(*de), GFP_KERNEL);
1663 spin_lock(&ctx->completion_lock);
1664 if (!req_need_defer(req, seq) && list_empty(&ctx->defer_list)) {
1665 spin_unlock(&ctx->completion_lock);
1670 trace_io_uring_defer(req);
1673 list_add_tail(&de->list, &ctx->defer_list);
1674 spin_unlock(&ctx->completion_lock);
1677 static void io_clean_op(struct io_kiocb *req)
1679 if (req->flags & REQ_F_BUFFER_SELECTED) {
1680 spin_lock(&req->ctx->completion_lock);
1681 io_put_kbuf_comp(req);
1682 spin_unlock(&req->ctx->completion_lock);
1685 if (req->flags & REQ_F_NEED_CLEANUP) {
1686 const struct io_op_def *def = &io_op_defs[req->opcode];
1691 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1692 kfree(req->apoll->double_poll);
1696 if (req->flags & REQ_F_INFLIGHT) {
1697 struct io_uring_task *tctx = req->task->io_uring;
1699 atomic_dec(&tctx->inflight_tracked);
1701 if (req->flags & REQ_F_CREDS)
1702 put_cred(req->creds);
1703 if (req->flags & REQ_F_ASYNC_DATA) {
1704 kfree(req->async_data);
1705 req->async_data = NULL;
1707 req->flags &= ~IO_REQ_CLEAN_FLAGS;
1710 static bool io_assign_file(struct io_kiocb *req, unsigned int issue_flags)
1712 if (req->file || !io_op_defs[req->opcode].needs_file)
1715 if (req->flags & REQ_F_FIXED_FILE)
1716 req->file = io_file_get_fixed(req, req->cqe.fd, issue_flags);
1718 req->file = io_file_get_normal(req, req->cqe.fd);
1723 static int io_issue_sqe(struct io_kiocb *req, unsigned int issue_flags)
1725 const struct io_op_def *def = &io_op_defs[req->opcode];
1726 const struct cred *creds = NULL;
1729 if (unlikely(!io_assign_file(req, issue_flags)))
1732 if (unlikely((req->flags & REQ_F_CREDS) && req->creds != current_cred()))
1733 creds = override_creds(req->creds);
1735 if (!def->audit_skip)
1736 audit_uring_entry(req->opcode);
1738 ret = def->issue(req, issue_flags);
1740 if (!def->audit_skip)
1741 audit_uring_exit(!ret, ret);
1744 revert_creds(creds);
1746 if (ret == IOU_OK) {
1747 if (issue_flags & IO_URING_F_COMPLETE_DEFER)
1748 io_req_complete_defer(req);
1750 io_req_complete_post(req);
1751 } else if (ret != IOU_ISSUE_SKIP_COMPLETE)
1754 /* If the op doesn't have a file, we're not polling for it */
1755 if ((req->ctx->flags & IORING_SETUP_IOPOLL) && req->file)
1756 io_iopoll_req_issued(req, issue_flags);
1761 int io_poll_issue(struct io_kiocb *req, bool *locked)
1763 io_tw_lock(req->ctx, locked);
1764 if (unlikely(req->task->flags & PF_EXITING))
1766 return io_issue_sqe(req, IO_URING_F_NONBLOCK);
1769 struct io_wq_work *io_wq_free_work(struct io_wq_work *work)
1771 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1773 req = io_put_req_find_next(req);
1774 return req ? &req->work : NULL;
1777 void io_wq_submit_work(struct io_wq_work *work)
1779 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1780 const struct io_op_def *def = &io_op_defs[req->opcode];
1781 unsigned int issue_flags = IO_URING_F_UNLOCKED;
1782 bool needs_poll = false;
1783 int ret = 0, err = -ECANCELED;
1785 /* one will be dropped by ->io_free_work() after returning to io-wq */
1786 if (!(req->flags & REQ_F_REFCOUNT))
1787 __io_req_set_refcount(req, 2);
1791 io_arm_ltimeout(req);
1793 /* either cancelled or io-wq is dying, so don't touch tctx->iowq */
1794 if (work->flags & IO_WQ_WORK_CANCEL) {
1796 io_req_task_queue_fail(req, err);
1799 if (!io_assign_file(req, issue_flags)) {
1801 work->flags |= IO_WQ_WORK_CANCEL;
1805 if (req->flags & REQ_F_FORCE_ASYNC) {
1806 bool opcode_poll = def->pollin || def->pollout;
1808 if (opcode_poll && file_can_poll(req->file)) {
1810 issue_flags |= IO_URING_F_NONBLOCK;
1815 ret = io_issue_sqe(req, issue_flags);
1819 * We can get EAGAIN for iopolled IO even though we're
1820 * forcing a sync submission from here, since we can't
1821 * wait for request slots on the block side.
1824 if (!(req->ctx->flags & IORING_SETUP_IOPOLL))
1830 if (io_arm_poll_handler(req, issue_flags) == IO_APOLL_OK)
1832 /* aborted or ready, in either case retry blocking */
1834 issue_flags &= ~IO_URING_F_NONBLOCK;
1837 /* avoid locking problems by failing it from a clean context */
1839 io_req_task_queue_fail(req, ret);
1842 inline struct file *io_file_get_fixed(struct io_kiocb *req, int fd,
1843 unsigned int issue_flags)
1845 struct io_ring_ctx *ctx = req->ctx;
1846 struct file *file = NULL;
1847 unsigned long file_ptr;
1849 io_ring_submit_lock(ctx, issue_flags);
1851 if (unlikely((unsigned int)fd >= ctx->nr_user_files))
1853 fd = array_index_nospec(fd, ctx->nr_user_files);
1854 file_ptr = io_fixed_file_slot(&ctx->file_table, fd)->file_ptr;
1855 file = (struct file *) (file_ptr & FFS_MASK);
1856 file_ptr &= ~FFS_MASK;
1857 /* mask in overlapping REQ_F and FFS bits */
1858 req->flags |= (file_ptr << REQ_F_SUPPORT_NOWAIT_BIT);
1859 io_req_set_rsrc_node(req, ctx, 0);
1861 io_ring_submit_unlock(ctx, issue_flags);
1865 struct file *io_file_get_normal(struct io_kiocb *req, int fd)
1867 struct file *file = fget(fd);
1869 trace_io_uring_file_get(req, fd);
1871 /* we don't allow fixed io_uring files */
1872 if (file && io_is_uring_fops(file))
1873 io_req_track_inflight(req);
1877 static void io_queue_async(struct io_kiocb *req, int ret)
1878 __must_hold(&req->ctx->uring_lock)
1880 struct io_kiocb *linked_timeout;
1882 if (ret != -EAGAIN || (req->flags & REQ_F_NOWAIT)) {
1883 io_req_complete_failed(req, ret);
1887 linked_timeout = io_prep_linked_timeout(req);
1889 switch (io_arm_poll_handler(req, 0)) {
1890 case IO_APOLL_READY:
1891 io_kbuf_recycle(req, 0);
1892 io_req_task_queue(req);
1894 case IO_APOLL_ABORTED:
1895 io_kbuf_recycle(req, 0);
1896 io_queue_iowq(req, NULL);
1903 io_queue_linked_timeout(linked_timeout);
1906 static inline void io_queue_sqe(struct io_kiocb *req)
1907 __must_hold(&req->ctx->uring_lock)
1911 ret = io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_COMPLETE_DEFER);
1914 * We async punt it if the file wasn't marked NOWAIT, or if the file
1915 * doesn't support non-blocking read/write attempts
1918 io_arm_ltimeout(req);
1920 io_queue_async(req, ret);
1923 static void io_queue_sqe_fallback(struct io_kiocb *req)
1924 __must_hold(&req->ctx->uring_lock)
1926 if (unlikely(req->flags & REQ_F_FAIL)) {
1928 * We don't submit, fail them all, for that replace hardlinks
1929 * with normal links. Extra REQ_F_LINK is tolerated.
1931 req->flags &= ~REQ_F_HARDLINK;
1932 req->flags |= REQ_F_LINK;
1933 io_req_complete_failed(req, req->cqe.res);
1934 } else if (unlikely(req->ctx->drain_active)) {
1937 int ret = io_req_prep_async(req);
1940 io_req_complete_failed(req, ret);
1942 io_queue_iowq(req, NULL);
1947 * Check SQE restrictions (opcode and flags).
1949 * Returns 'true' if SQE is allowed, 'false' otherwise.
1951 static inline bool io_check_restriction(struct io_ring_ctx *ctx,
1952 struct io_kiocb *req,
1953 unsigned int sqe_flags)
1955 if (!test_bit(req->opcode, ctx->restrictions.sqe_op))
1958 if ((sqe_flags & ctx->restrictions.sqe_flags_required) !=
1959 ctx->restrictions.sqe_flags_required)
1962 if (sqe_flags & ~(ctx->restrictions.sqe_flags_allowed |
1963 ctx->restrictions.sqe_flags_required))
1969 static void io_init_req_drain(struct io_kiocb *req)
1971 struct io_ring_ctx *ctx = req->ctx;
1972 struct io_kiocb *head = ctx->submit_state.link.head;
1974 ctx->drain_active = true;
1977 * If we need to drain a request in the middle of a link, drain
1978 * the head request and the next request/link after the current
1979 * link. Considering sequential execution of links,
1980 * REQ_F_IO_DRAIN will be maintained for every request of our
1983 head->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
1984 ctx->drain_next = true;
1988 static int io_init_req(struct io_ring_ctx *ctx, struct io_kiocb *req,
1989 const struct io_uring_sqe *sqe)
1990 __must_hold(&ctx->uring_lock)
1992 const struct io_op_def *def;
1993 unsigned int sqe_flags;
1997 /* req is partially pre-initialised, see io_preinit_req() */
1998 req->opcode = opcode = READ_ONCE(sqe->opcode);
1999 /* same numerical values with corresponding REQ_F_*, safe to copy */
2000 req->flags = sqe_flags = READ_ONCE(sqe->flags);
2001 req->cqe.user_data = READ_ONCE(sqe->user_data);
2003 req->rsrc_node = NULL;
2004 req->task = current;
2006 if (unlikely(opcode >= IORING_OP_LAST)) {
2010 def = &io_op_defs[opcode];
2011 if (unlikely(sqe_flags & ~SQE_COMMON_FLAGS)) {
2012 /* enforce forwards compatibility on users */
2013 if (sqe_flags & ~SQE_VALID_FLAGS)
2015 if (sqe_flags & IOSQE_BUFFER_SELECT) {
2016 if (!def->buffer_select)
2018 req->buf_index = READ_ONCE(sqe->buf_group);
2020 if (sqe_flags & IOSQE_CQE_SKIP_SUCCESS)
2021 ctx->drain_disabled = true;
2022 if (sqe_flags & IOSQE_IO_DRAIN) {
2023 if (ctx->drain_disabled)
2025 io_init_req_drain(req);
2028 if (unlikely(ctx->restricted || ctx->drain_active || ctx->drain_next)) {
2029 if (ctx->restricted && !io_check_restriction(ctx, req, sqe_flags))
2031 /* knock it to the slow queue path, will be drained there */
2032 if (ctx->drain_active)
2033 req->flags |= REQ_F_FORCE_ASYNC;
2034 /* if there is no link, we're at "next" request and need to drain */
2035 if (unlikely(ctx->drain_next) && !ctx->submit_state.link.head) {
2036 ctx->drain_next = false;
2037 ctx->drain_active = true;
2038 req->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2042 if (!def->ioprio && sqe->ioprio)
2044 if (!def->iopoll && (ctx->flags & IORING_SETUP_IOPOLL))
2047 if (def->needs_file) {
2048 struct io_submit_state *state = &ctx->submit_state;
2050 req->cqe.fd = READ_ONCE(sqe->fd);
2053 * Plug now if we have more than 2 IO left after this, and the
2054 * target is potentially a read/write to block based storage.
2056 if (state->need_plug && def->plug) {
2057 state->plug_started = true;
2058 state->need_plug = false;
2059 blk_start_plug_nr_ios(&state->plug, state->submit_nr);
2063 personality = READ_ONCE(sqe->personality);
2067 req->creds = xa_load(&ctx->personalities, personality);
2070 get_cred(req->creds);
2071 ret = security_uring_override_creds(req->creds);
2073 put_cred(req->creds);
2076 req->flags |= REQ_F_CREDS;
2079 return def->prep(req, sqe);
2082 static __cold int io_submit_fail_init(const struct io_uring_sqe *sqe,
2083 struct io_kiocb *req, int ret)
2085 struct io_ring_ctx *ctx = req->ctx;
2086 struct io_submit_link *link = &ctx->submit_state.link;
2087 struct io_kiocb *head = link->head;
2089 trace_io_uring_req_failed(sqe, req, ret);
2092 * Avoid breaking links in the middle as it renders links with SQPOLL
2093 * unusable. Instead of failing eagerly, continue assembling the link if
2094 * applicable and mark the head with REQ_F_FAIL. The link flushing code
2095 * should find the flag and handle the rest.
2097 req_fail_link_node(req, ret);
2098 if (head && !(head->flags & REQ_F_FAIL))
2099 req_fail_link_node(head, -ECANCELED);
2101 if (!(req->flags & IO_REQ_LINK_FLAGS)) {
2103 link->last->link = req;
2107 io_queue_sqe_fallback(req);
2112 link->last->link = req;
2119 static inline int io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req,
2120 const struct io_uring_sqe *sqe)
2121 __must_hold(&ctx->uring_lock)
2123 struct io_submit_link *link = &ctx->submit_state.link;
2126 ret = io_init_req(ctx, req, sqe);
2128 return io_submit_fail_init(sqe, req, ret);
2130 /* don't need @sqe from now on */
2131 trace_io_uring_submit_sqe(req, true);
2134 * If we already have a head request, queue this one for async
2135 * submittal once the head completes. If we don't have a head but
2136 * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be
2137 * submitted sync once the chain is complete. If none of those
2138 * conditions are true (normal request), then just queue it.
2140 if (unlikely(link->head)) {
2141 ret = io_req_prep_async(req);
2143 return io_submit_fail_init(sqe, req, ret);
2145 trace_io_uring_link(req, link->head);
2146 link->last->link = req;
2149 if (req->flags & IO_REQ_LINK_FLAGS)
2151 /* last request of the link, flush it */
2154 if (req->flags & (REQ_F_FORCE_ASYNC | REQ_F_FAIL))
2157 } else if (unlikely(req->flags & (IO_REQ_LINK_FLAGS |
2158 REQ_F_FORCE_ASYNC | REQ_F_FAIL))) {
2159 if (req->flags & IO_REQ_LINK_FLAGS) {
2164 io_queue_sqe_fallback(req);
2174 * Batched submission is done, ensure local IO is flushed out.
2176 static void io_submit_state_end(struct io_ring_ctx *ctx)
2178 struct io_submit_state *state = &ctx->submit_state;
2180 if (unlikely(state->link.head))
2181 io_queue_sqe_fallback(state->link.head);
2182 /* flush only after queuing links as they can generate completions */
2183 io_submit_flush_completions(ctx);
2184 if (state->plug_started)
2185 blk_finish_plug(&state->plug);
2189 * Start submission side cache.
2191 static void io_submit_state_start(struct io_submit_state *state,
2192 unsigned int max_ios)
2194 state->plug_started = false;
2195 state->need_plug = max_ios > 2;
2196 state->submit_nr = max_ios;
2197 /* set only head, no need to init link_last in advance */
2198 state->link.head = NULL;
2201 static void io_commit_sqring(struct io_ring_ctx *ctx)
2203 struct io_rings *rings = ctx->rings;
2206 * Ensure any loads from the SQEs are done at this point,
2207 * since once we write the new head, the application could
2208 * write new data to them.
2210 smp_store_release(&rings->sq.head, ctx->cached_sq_head);
2214 * Fetch an sqe, if one is available. Note this returns a pointer to memory
2215 * that is mapped by userspace. This means that care needs to be taken to
2216 * ensure that reads are stable, as we cannot rely on userspace always
2217 * being a good citizen. If members of the sqe are validated and then later
2218 * used, it's important that those reads are done through READ_ONCE() to
2219 * prevent a re-load down the line.
2221 static const struct io_uring_sqe *io_get_sqe(struct io_ring_ctx *ctx)
2223 unsigned head, mask = ctx->sq_entries - 1;
2224 unsigned sq_idx = ctx->cached_sq_head++ & mask;
2227 * The cached sq head (or cq tail) serves two purposes:
2229 * 1) allows us to batch the cost of updating the user visible
2231 * 2) allows the kernel side to track the head on its own, even
2232 * though the application is the one updating it.
2234 head = READ_ONCE(ctx->sq_array[sq_idx]);
2235 if (likely(head < ctx->sq_entries)) {
2236 /* double index for 128-byte SQEs, twice as long */
2237 if (ctx->flags & IORING_SETUP_SQE128)
2239 return &ctx->sq_sqes[head];
2242 /* drop invalid entries */
2244 WRITE_ONCE(ctx->rings->sq_dropped,
2245 READ_ONCE(ctx->rings->sq_dropped) + 1);
2249 int io_submit_sqes(struct io_ring_ctx *ctx, unsigned int nr)
2250 __must_hold(&ctx->uring_lock)
2252 unsigned int entries = io_sqring_entries(ctx);
2256 if (unlikely(!entries))
2258 /* make sure SQ entry isn't read before tail */
2259 ret = left = min3(nr, ctx->sq_entries, entries);
2260 io_get_task_refs(left);
2261 io_submit_state_start(&ctx->submit_state, left);
2264 const struct io_uring_sqe *sqe;
2265 struct io_kiocb *req;
2267 if (unlikely(!io_alloc_req_refill(ctx)))
2269 req = io_alloc_req(ctx);
2270 sqe = io_get_sqe(ctx);
2271 if (unlikely(!sqe)) {
2272 io_req_add_to_cache(req, ctx);
2277 * Continue submitting even for sqe failure if the
2278 * ring was setup with IORING_SETUP_SUBMIT_ALL
2280 if (unlikely(io_submit_sqe(ctx, req, sqe)) &&
2281 !(ctx->flags & IORING_SETUP_SUBMIT_ALL)) {
2287 if (unlikely(left)) {
2289 /* try again if it submitted nothing and can't allocate a req */
2290 if (!ret && io_req_cache_empty(ctx))
2292 current->io_uring->cached_refs += left;
2295 io_submit_state_end(ctx);
2296 /* Commit SQ ring head once we've consumed and submitted all SQEs */
2297 io_commit_sqring(ctx);
2301 struct io_wait_queue {
2302 struct wait_queue_entry wq;
2303 struct io_ring_ctx *ctx;
2305 unsigned nr_timeouts;
2308 static inline bool io_has_work(struct io_ring_ctx *ctx)
2310 return test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq) ||
2311 ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
2312 !llist_empty(&ctx->work_llist));
2315 static inline bool io_should_wake(struct io_wait_queue *iowq)
2317 struct io_ring_ctx *ctx = iowq->ctx;
2318 int dist = ctx->cached_cq_tail - (int) iowq->cq_tail;
2321 * Wake up if we have enough events, or if a timeout occurred since we
2322 * started waiting. For timeouts, we always want to return to userspace,
2323 * regardless of event count.
2325 return dist >= 0 || atomic_read(&ctx->cq_timeouts) != iowq->nr_timeouts;
2328 static int io_wake_function(struct wait_queue_entry *curr, unsigned int mode,
2329 int wake_flags, void *key)
2331 struct io_wait_queue *iowq = container_of(curr, struct io_wait_queue,
2333 struct io_ring_ctx *ctx = iowq->ctx;
2336 * Cannot safely flush overflowed CQEs from here, ensure we wake up
2337 * the task, and the next invocation will do it.
2339 if (io_should_wake(iowq) || io_has_work(ctx))
2340 return autoremove_wake_function(curr, mode, wake_flags, key);
2344 int io_run_task_work_sig(struct io_ring_ctx *ctx)
2346 if (io_run_task_work_ctx(ctx) > 0)
2348 if (task_sigpending(current))
2353 /* when returns >0, the caller should retry */
2354 static inline int io_cqring_wait_schedule(struct io_ring_ctx *ctx,
2355 struct io_wait_queue *iowq,
2359 unsigned long check_cq;
2361 /* make sure we run task_work before checking for signals */
2362 ret = io_run_task_work_sig(ctx);
2363 if (ret || io_should_wake(iowq))
2366 check_cq = READ_ONCE(ctx->check_cq);
2367 if (unlikely(check_cq)) {
2368 /* let the caller flush overflows, retry */
2369 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
2371 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT))
2374 if (!schedule_hrtimeout(&timeout, HRTIMER_MODE_ABS))
2380 * Wait until events become available, if we don't already have some. The
2381 * application must reap them itself, as they reside on the shared cq ring.
2383 static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events,
2384 const sigset_t __user *sig, size_t sigsz,
2385 struct __kernel_timespec __user *uts)
2387 struct io_wait_queue iowq;
2388 struct io_rings *rings = ctx->rings;
2389 ktime_t timeout = KTIME_MAX;
2392 if (!io_allowed_run_tw(ctx))
2396 /* always run at least 1 task work to process local work */
2397 ret = io_run_task_work_ctx(ctx);
2400 io_cqring_overflow_flush(ctx);
2402 if (io_cqring_events(ctx) >= min_events)
2407 #ifdef CONFIG_COMPAT
2408 if (in_compat_syscall())
2409 ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig,
2413 ret = set_user_sigmask(sig, sigsz);
2420 struct timespec64 ts;
2422 if (get_timespec64(&ts, uts))
2424 timeout = ktime_add_ns(timespec64_to_ktime(ts), ktime_get_ns());
2427 init_waitqueue_func_entry(&iowq.wq, io_wake_function);
2428 iowq.wq.private = current;
2429 INIT_LIST_HEAD(&iowq.wq.entry);
2431 iowq.nr_timeouts = atomic_read(&ctx->cq_timeouts);
2432 iowq.cq_tail = READ_ONCE(ctx->rings->cq.head) + min_events;
2434 trace_io_uring_cqring_wait(ctx, min_events);
2436 /* if we can't even flush overflow, don't wait for more */
2437 if (!io_cqring_overflow_flush(ctx)) {
2441 prepare_to_wait_exclusive(&ctx->cq_wait, &iowq.wq,
2442 TASK_INTERRUPTIBLE);
2443 ret = io_cqring_wait_schedule(ctx, &iowq, timeout);
2447 finish_wait(&ctx->cq_wait, &iowq.wq);
2448 restore_saved_sigmask_unless(ret == -EINTR);
2450 return READ_ONCE(rings->cq.head) == READ_ONCE(rings->cq.tail) ? ret : 0;
2453 static void io_mem_free(void *ptr)
2460 page = virt_to_head_page(ptr);
2461 if (put_page_testzero(page))
2462 free_compound_page(page);
2465 static void *io_mem_alloc(size_t size)
2467 gfp_t gfp = GFP_KERNEL_ACCOUNT | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP;
2469 return (void *) __get_free_pages(gfp, get_order(size));
2472 static unsigned long rings_size(struct io_ring_ctx *ctx, unsigned int sq_entries,
2473 unsigned int cq_entries, size_t *sq_offset)
2475 struct io_rings *rings;
2476 size_t off, sq_array_size;
2478 off = struct_size(rings, cqes, cq_entries);
2479 if (off == SIZE_MAX)
2481 if (ctx->flags & IORING_SETUP_CQE32) {
2482 if (check_shl_overflow(off, 1, &off))
2487 off = ALIGN(off, SMP_CACHE_BYTES);
2495 sq_array_size = array_size(sizeof(u32), sq_entries);
2496 if (sq_array_size == SIZE_MAX)
2499 if (check_add_overflow(off, sq_array_size, &off))
2505 static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg,
2506 unsigned int eventfd_async)
2508 struct io_ev_fd *ev_fd;
2509 __s32 __user *fds = arg;
2512 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2513 lockdep_is_held(&ctx->uring_lock));
2517 if (copy_from_user(&fd, fds, sizeof(*fds)))
2520 ev_fd = kmalloc(sizeof(*ev_fd), GFP_KERNEL);
2524 ev_fd->cq_ev_fd = eventfd_ctx_fdget(fd);
2525 if (IS_ERR(ev_fd->cq_ev_fd)) {
2526 int ret = PTR_ERR(ev_fd->cq_ev_fd);
2531 spin_lock(&ctx->completion_lock);
2532 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
2533 spin_unlock(&ctx->completion_lock);
2535 ev_fd->eventfd_async = eventfd_async;
2536 ctx->has_evfd = true;
2537 rcu_assign_pointer(ctx->io_ev_fd, ev_fd);
2538 atomic_set(&ev_fd->refs, 1);
2539 atomic_set(&ev_fd->ops, 0);
2543 static int io_eventfd_unregister(struct io_ring_ctx *ctx)
2545 struct io_ev_fd *ev_fd;
2547 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2548 lockdep_is_held(&ctx->uring_lock));
2550 ctx->has_evfd = false;
2551 rcu_assign_pointer(ctx->io_ev_fd, NULL);
2552 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_FREE_BIT), &ev_fd->ops))
2553 call_rcu(&ev_fd->rcu, io_eventfd_ops);
2560 static void io_req_caches_free(struct io_ring_ctx *ctx)
2564 mutex_lock(&ctx->uring_lock);
2565 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
2567 while (!io_req_cache_empty(ctx)) {
2568 struct io_kiocb *req = io_alloc_req(ctx);
2570 kmem_cache_free(req_cachep, req);
2574 percpu_ref_put_many(&ctx->refs, nr);
2575 mutex_unlock(&ctx->uring_lock);
2578 static __cold void io_ring_ctx_free(struct io_ring_ctx *ctx)
2580 io_sq_thread_finish(ctx);
2581 io_rsrc_refs_drop(ctx);
2582 /* __io_rsrc_put_work() may need uring_lock to progress, wait w/o it */
2583 io_wait_rsrc_data(ctx->buf_data);
2584 io_wait_rsrc_data(ctx->file_data);
2586 mutex_lock(&ctx->uring_lock);
2588 __io_sqe_buffers_unregister(ctx);
2590 __io_sqe_files_unregister(ctx);
2592 __io_cqring_overflow_flush(ctx, true);
2593 io_eventfd_unregister(ctx);
2594 io_alloc_cache_free(&ctx->apoll_cache, io_apoll_cache_free);
2595 io_alloc_cache_free(&ctx->netmsg_cache, io_netmsg_cache_free);
2596 mutex_unlock(&ctx->uring_lock);
2597 io_destroy_buffers(ctx);
2599 put_cred(ctx->sq_creds);
2600 if (ctx->submitter_task)
2601 put_task_struct(ctx->submitter_task);
2603 /* there are no registered resources left, nobody uses it */
2605 io_rsrc_node_destroy(ctx->rsrc_node);
2606 if (ctx->rsrc_backup_node)
2607 io_rsrc_node_destroy(ctx->rsrc_backup_node);
2608 flush_delayed_work(&ctx->rsrc_put_work);
2609 flush_delayed_work(&ctx->fallback_work);
2611 WARN_ON_ONCE(!list_empty(&ctx->rsrc_ref_list));
2612 WARN_ON_ONCE(!llist_empty(&ctx->rsrc_put_llist));
2614 #if defined(CONFIG_UNIX)
2615 if (ctx->ring_sock) {
2616 ctx->ring_sock->file = NULL; /* so that iput() is called */
2617 sock_release(ctx->ring_sock);
2620 WARN_ON_ONCE(!list_empty(&ctx->ltimeout_list));
2622 if (ctx->mm_account) {
2623 mmdrop(ctx->mm_account);
2624 ctx->mm_account = NULL;
2626 io_mem_free(ctx->rings);
2627 io_mem_free(ctx->sq_sqes);
2629 percpu_ref_exit(&ctx->refs);
2630 free_uid(ctx->user);
2631 io_req_caches_free(ctx);
2633 io_wq_put_hash(ctx->hash_map);
2634 kfree(ctx->cancel_table.hbs);
2635 kfree(ctx->cancel_table_locked.hbs);
2636 kfree(ctx->dummy_ubuf);
2638 xa_destroy(&ctx->io_bl_xa);
2642 static __poll_t io_uring_poll(struct file *file, poll_table *wait)
2644 struct io_ring_ctx *ctx = file->private_data;
2647 poll_wait(file, &ctx->cq_wait, wait);
2649 * synchronizes with barrier from wq_has_sleeper call in
2653 if (!io_sqring_full(ctx))
2654 mask |= EPOLLOUT | EPOLLWRNORM;
2657 * Don't flush cqring overflow list here, just do a simple check.
2658 * Otherwise there could possible be ABBA deadlock:
2661 * lock(&ctx->uring_lock);
2663 * lock(&ctx->uring_lock);
2666 * Users may get EPOLLIN meanwhile seeing nothing in cqring, this
2667 * pushs them to do the flush.
2670 if (io_cqring_events(ctx) || io_has_work(ctx))
2671 mask |= EPOLLIN | EPOLLRDNORM;
2676 static int io_unregister_personality(struct io_ring_ctx *ctx, unsigned id)
2678 const struct cred *creds;
2680 creds = xa_erase(&ctx->personalities, id);
2689 struct io_tctx_exit {
2690 struct callback_head task_work;
2691 struct completion completion;
2692 struct io_ring_ctx *ctx;
2695 static __cold void io_tctx_exit_cb(struct callback_head *cb)
2697 struct io_uring_task *tctx = current->io_uring;
2698 struct io_tctx_exit *work;
2700 work = container_of(cb, struct io_tctx_exit, task_work);
2702 * When @in_idle, we're in cancellation and it's racy to remove the
2703 * node. It'll be removed by the end of cancellation, just ignore it.
2705 if (!atomic_read(&tctx->in_idle))
2706 io_uring_del_tctx_node((unsigned long)work->ctx);
2707 complete(&work->completion);
2710 static __cold bool io_cancel_ctx_cb(struct io_wq_work *work, void *data)
2712 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
2714 return req->ctx == data;
2717 static __cold void io_ring_exit_work(struct work_struct *work)
2719 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, exit_work);
2720 unsigned long timeout = jiffies + HZ * 60 * 5;
2721 unsigned long interval = HZ / 20;
2722 struct io_tctx_exit exit;
2723 struct io_tctx_node *node;
2727 * If we're doing polled IO and end up having requests being
2728 * submitted async (out-of-line), then completions can come in while
2729 * we're waiting for refs to drop. We need to reap these manually,
2730 * as nobody else will be looking for them.
2733 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
2734 io_move_task_work_from_local(ctx);
2736 while (io_uring_try_cancel_requests(ctx, NULL, true))
2740 struct io_sq_data *sqd = ctx->sq_data;
2741 struct task_struct *tsk;
2743 io_sq_thread_park(sqd);
2745 if (tsk && tsk->io_uring && tsk->io_uring->io_wq)
2746 io_wq_cancel_cb(tsk->io_uring->io_wq,
2747 io_cancel_ctx_cb, ctx, true);
2748 io_sq_thread_unpark(sqd);
2751 io_req_caches_free(ctx);
2753 if (WARN_ON_ONCE(time_after(jiffies, timeout))) {
2754 /* there is little hope left, don't run it too often */
2757 } while (!wait_for_completion_timeout(&ctx->ref_comp, interval));
2759 init_completion(&exit.completion);
2760 init_task_work(&exit.task_work, io_tctx_exit_cb);
2763 * Some may use context even when all refs and requests have been put,
2764 * and they are free to do so while still holding uring_lock or
2765 * completion_lock, see io_req_task_submit(). Apart from other work,
2766 * this lock/unlock section also waits them to finish.
2768 mutex_lock(&ctx->uring_lock);
2769 while (!list_empty(&ctx->tctx_list)) {
2770 WARN_ON_ONCE(time_after(jiffies, timeout));
2772 node = list_first_entry(&ctx->tctx_list, struct io_tctx_node,
2774 /* don't spin on a single task if cancellation failed */
2775 list_rotate_left(&ctx->tctx_list);
2776 ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL);
2777 if (WARN_ON_ONCE(ret))
2780 mutex_unlock(&ctx->uring_lock);
2781 wait_for_completion(&exit.completion);
2782 mutex_lock(&ctx->uring_lock);
2784 mutex_unlock(&ctx->uring_lock);
2785 spin_lock(&ctx->completion_lock);
2786 spin_unlock(&ctx->completion_lock);
2788 io_ring_ctx_free(ctx);
2791 static __cold void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx)
2793 unsigned long index;
2794 struct creds *creds;
2796 mutex_lock(&ctx->uring_lock);
2797 percpu_ref_kill(&ctx->refs);
2799 __io_cqring_overflow_flush(ctx, true);
2800 xa_for_each(&ctx->personalities, index, creds)
2801 io_unregister_personality(ctx, index);
2803 io_poll_remove_all(ctx, NULL, true);
2804 mutex_unlock(&ctx->uring_lock);
2807 * If we failed setting up the ctx, we might not have any rings
2808 * and therefore did not submit any requests
2811 io_kill_timeouts(ctx, NULL, true);
2813 INIT_WORK(&ctx->exit_work, io_ring_exit_work);
2815 * Use system_unbound_wq to avoid spawning tons of event kworkers
2816 * if we're exiting a ton of rings at the same time. It just adds
2817 * noise and overhead, there's no discernable change in runtime
2818 * over using system_wq.
2820 queue_work(system_unbound_wq, &ctx->exit_work);
2823 static int io_uring_release(struct inode *inode, struct file *file)
2825 struct io_ring_ctx *ctx = file->private_data;
2827 file->private_data = NULL;
2828 io_ring_ctx_wait_and_kill(ctx);
2832 struct io_task_cancel {
2833 struct task_struct *task;
2837 static bool io_cancel_task_cb(struct io_wq_work *work, void *data)
2839 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
2840 struct io_task_cancel *cancel = data;
2842 return io_match_task_safe(req, cancel->task, cancel->all);
2845 static __cold bool io_cancel_defer_files(struct io_ring_ctx *ctx,
2846 struct task_struct *task,
2849 struct io_defer_entry *de;
2852 spin_lock(&ctx->completion_lock);
2853 list_for_each_entry_reverse(de, &ctx->defer_list, list) {
2854 if (io_match_task_safe(de->req, task, cancel_all)) {
2855 list_cut_position(&list, &ctx->defer_list, &de->list);
2859 spin_unlock(&ctx->completion_lock);
2860 if (list_empty(&list))
2863 while (!list_empty(&list)) {
2864 de = list_first_entry(&list, struct io_defer_entry, list);
2865 list_del_init(&de->list);
2866 io_req_complete_failed(de->req, -ECANCELED);
2872 static __cold bool io_uring_try_cancel_iowq(struct io_ring_ctx *ctx)
2874 struct io_tctx_node *node;
2875 enum io_wq_cancel cret;
2878 mutex_lock(&ctx->uring_lock);
2879 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
2880 struct io_uring_task *tctx = node->task->io_uring;
2883 * io_wq will stay alive while we hold uring_lock, because it's
2884 * killed after ctx nodes, which requires to take the lock.
2886 if (!tctx || !tctx->io_wq)
2888 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_ctx_cb, ctx, true);
2889 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
2891 mutex_unlock(&ctx->uring_lock);
2896 static __cold bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
2897 struct task_struct *task,
2900 struct io_task_cancel cancel = { .task = task, .all = cancel_all, };
2901 struct io_uring_task *tctx = task ? task->io_uring : NULL;
2902 enum io_wq_cancel cret;
2905 /* failed during ring init, it couldn't have issued any requests */
2910 ret |= io_uring_try_cancel_iowq(ctx);
2911 } else if (tctx && tctx->io_wq) {
2913 * Cancels requests of all rings, not only @ctx, but
2914 * it's fine as the task is in exit/exec.
2916 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_task_cb,
2918 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
2921 /* SQPOLL thread does its own polling */
2922 if ((!(ctx->flags & IORING_SETUP_SQPOLL) && cancel_all) ||
2923 (ctx->sq_data && ctx->sq_data->thread == current)) {
2924 while (!wq_list_empty(&ctx->iopoll_list)) {
2925 io_iopoll_try_reap_events(ctx);
2930 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
2931 ret |= io_run_local_work(ctx) > 0;
2932 ret |= io_cancel_defer_files(ctx, task, cancel_all);
2933 mutex_lock(&ctx->uring_lock);
2934 ret |= io_poll_remove_all(ctx, task, cancel_all);
2935 mutex_unlock(&ctx->uring_lock);
2936 ret |= io_kill_timeouts(ctx, task, cancel_all);
2938 ret |= io_run_task_work() > 0;
2942 static s64 tctx_inflight(struct io_uring_task *tctx, bool tracked)
2945 return atomic_read(&tctx->inflight_tracked);
2946 return percpu_counter_sum(&tctx->inflight);
2950 * Find any io_uring ctx that this task has registered or done IO on, and cancel
2951 * requests. @sqd should be not-null IFF it's an SQPOLL thread cancellation.
2953 __cold void io_uring_cancel_generic(bool cancel_all, struct io_sq_data *sqd)
2955 struct io_uring_task *tctx = current->io_uring;
2956 struct io_ring_ctx *ctx;
2960 WARN_ON_ONCE(sqd && sqd->thread != current);
2962 if (!current->io_uring)
2965 io_wq_exit_start(tctx->io_wq);
2967 atomic_inc(&tctx->in_idle);
2971 io_uring_drop_tctx_refs(current);
2972 /* read completions before cancelations */
2973 inflight = tctx_inflight(tctx, !cancel_all);
2978 struct io_tctx_node *node;
2979 unsigned long index;
2981 xa_for_each(&tctx->xa, index, node) {
2982 /* sqpoll task will cancel all its requests */
2983 if (node->ctx->sq_data)
2985 loop |= io_uring_try_cancel_requests(node->ctx,
2986 current, cancel_all);
2989 list_for_each_entry(ctx, &sqd->ctx_list, sqd_list)
2990 loop |= io_uring_try_cancel_requests(ctx,
3000 prepare_to_wait(&tctx->wait, &wait, TASK_INTERRUPTIBLE);
3002 io_uring_drop_tctx_refs(current);
3005 * If we've seen completions, retry without waiting. This
3006 * avoids a race where a completion comes in before we did
3007 * prepare_to_wait().
3009 if (inflight == tctx_inflight(tctx, !cancel_all))
3011 finish_wait(&tctx->wait, &wait);
3014 io_uring_clean_tctx(tctx);
3017 * We shouldn't run task_works after cancel, so just leave
3018 * ->in_idle set for normal exit.
3020 atomic_dec(&tctx->in_idle);
3021 /* for exec all current's requests should be gone, kill tctx */
3022 __io_uring_free(current);
3026 void __io_uring_cancel(bool cancel_all)
3028 io_uring_cancel_generic(cancel_all, NULL);
3031 static void *io_uring_validate_mmap_request(struct file *file,
3032 loff_t pgoff, size_t sz)
3034 struct io_ring_ctx *ctx = file->private_data;
3035 loff_t offset = pgoff << PAGE_SHIFT;
3040 case IORING_OFF_SQ_RING:
3041 case IORING_OFF_CQ_RING:
3044 case IORING_OFF_SQES:
3048 return ERR_PTR(-EINVAL);
3051 page = virt_to_head_page(ptr);
3052 if (sz > page_size(page))
3053 return ERR_PTR(-EINVAL);
3060 static __cold int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3062 size_t sz = vma->vm_end - vma->vm_start;
3066 ptr = io_uring_validate_mmap_request(file, vma->vm_pgoff, sz);
3068 return PTR_ERR(ptr);
3070 pfn = virt_to_phys(ptr) >> PAGE_SHIFT;
3071 return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot);
3074 #else /* !CONFIG_MMU */
3076 static int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3078 return vma->vm_flags & (VM_SHARED | VM_MAYSHARE) ? 0 : -EINVAL;
3081 static unsigned int io_uring_nommu_mmap_capabilities(struct file *file)
3083 return NOMMU_MAP_DIRECT | NOMMU_MAP_READ | NOMMU_MAP_WRITE;
3086 static unsigned long io_uring_nommu_get_unmapped_area(struct file *file,
3087 unsigned long addr, unsigned long len,
3088 unsigned long pgoff, unsigned long flags)
3092 ptr = io_uring_validate_mmap_request(file, pgoff, len);
3094 return PTR_ERR(ptr);
3096 return (unsigned long) ptr;
3099 #endif /* !CONFIG_MMU */
3101 static int io_validate_ext_arg(unsigned flags, const void __user *argp, size_t argsz)
3103 if (flags & IORING_ENTER_EXT_ARG) {
3104 struct io_uring_getevents_arg arg;
3106 if (argsz != sizeof(arg))
3108 if (copy_from_user(&arg, argp, sizeof(arg)))
3114 static int io_get_ext_arg(unsigned flags, const void __user *argp, size_t *argsz,
3115 struct __kernel_timespec __user **ts,
3116 const sigset_t __user **sig)
3118 struct io_uring_getevents_arg arg;
3121 * If EXT_ARG isn't set, then we have no timespec and the argp pointer
3122 * is just a pointer to the sigset_t.
3124 if (!(flags & IORING_ENTER_EXT_ARG)) {
3125 *sig = (const sigset_t __user *) argp;
3131 * EXT_ARG is set - ensure we agree on the size of it and copy in our
3132 * timespec and sigset_t pointers if good.
3134 if (*argsz != sizeof(arg))
3136 if (copy_from_user(&arg, argp, sizeof(arg)))
3140 *sig = u64_to_user_ptr(arg.sigmask);
3141 *argsz = arg.sigmask_sz;
3142 *ts = u64_to_user_ptr(arg.ts);
3146 SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit,
3147 u32, min_complete, u32, flags, const void __user *, argp,
3150 struct io_ring_ctx *ctx;
3154 if (unlikely(flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP |
3155 IORING_ENTER_SQ_WAIT | IORING_ENTER_EXT_ARG |
3156 IORING_ENTER_REGISTERED_RING)))
3160 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
3161 * need only dereference our task private array to find it.
3163 if (flags & IORING_ENTER_REGISTERED_RING) {
3164 struct io_uring_task *tctx = current->io_uring;
3166 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
3168 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
3169 f.file = tctx->registered_rings[fd];
3171 if (unlikely(!f.file))
3175 if (unlikely(!f.file))
3178 if (unlikely(!io_is_uring_fops(f.file)))
3182 ctx = f.file->private_data;
3184 if (unlikely(ctx->flags & IORING_SETUP_R_DISABLED))
3188 * For SQ polling, the thread will do all submissions and completions.
3189 * Just return the requested submit count, and wake the thread if
3193 if (ctx->flags & IORING_SETUP_SQPOLL) {
3194 io_cqring_overflow_flush(ctx);
3196 if (unlikely(ctx->sq_data->thread == NULL)) {
3200 if (flags & IORING_ENTER_SQ_WAKEUP)
3201 wake_up(&ctx->sq_data->wait);
3202 if (flags & IORING_ENTER_SQ_WAIT) {
3203 ret = io_sqpoll_wait_sq(ctx);
3208 } else if (to_submit) {
3209 ret = io_uring_add_tctx_node(ctx);
3213 mutex_lock(&ctx->uring_lock);
3214 ret = io_submit_sqes(ctx, to_submit);
3215 if (ret != to_submit) {
3216 mutex_unlock(&ctx->uring_lock);
3219 if (flags & IORING_ENTER_GETEVENTS) {
3220 if (ctx->syscall_iopoll)
3223 * Ignore errors, we'll soon call io_cqring_wait() and
3224 * it should handle ownership problems if any.
3226 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
3227 (void)io_run_local_work_locked(ctx);
3229 mutex_unlock(&ctx->uring_lock);
3232 if (flags & IORING_ENTER_GETEVENTS) {
3235 if (ctx->syscall_iopoll) {
3237 * We disallow the app entering submit/complete with
3238 * polling, but we still need to lock the ring to
3239 * prevent racing with polled issue that got punted to
3242 mutex_lock(&ctx->uring_lock);
3244 ret2 = io_validate_ext_arg(flags, argp, argsz);
3245 if (likely(!ret2)) {
3246 min_complete = min(min_complete,
3248 ret2 = io_iopoll_check(ctx, min_complete);
3250 mutex_unlock(&ctx->uring_lock);
3252 const sigset_t __user *sig;
3253 struct __kernel_timespec __user *ts;
3255 ret2 = io_get_ext_arg(flags, argp, &argsz, &ts, &sig);
3256 if (likely(!ret2)) {
3257 min_complete = min(min_complete,
3259 ret2 = io_cqring_wait(ctx, min_complete, sig,
3268 * EBADR indicates that one or more CQE were dropped.
3269 * Once the user has been informed we can clear the bit
3270 * as they are obviously ok with those drops.
3272 if (unlikely(ret2 == -EBADR))
3273 clear_bit(IO_CHECK_CQ_DROPPED_BIT,
3282 static const struct file_operations io_uring_fops = {
3283 .release = io_uring_release,
3284 .mmap = io_uring_mmap,
3286 .get_unmapped_area = io_uring_nommu_get_unmapped_area,
3287 .mmap_capabilities = io_uring_nommu_mmap_capabilities,
3289 .poll = io_uring_poll,
3290 #ifdef CONFIG_PROC_FS
3291 .show_fdinfo = io_uring_show_fdinfo,
3295 bool io_is_uring_fops(struct file *file)
3297 return file->f_op == &io_uring_fops;
3300 static __cold int io_allocate_scq_urings(struct io_ring_ctx *ctx,
3301 struct io_uring_params *p)
3303 struct io_rings *rings;
3304 size_t size, sq_array_offset;
3306 /* make sure these are sane, as we already accounted them */
3307 ctx->sq_entries = p->sq_entries;
3308 ctx->cq_entries = p->cq_entries;
3310 size = rings_size(ctx, p->sq_entries, p->cq_entries, &sq_array_offset);
3311 if (size == SIZE_MAX)
3314 rings = io_mem_alloc(size);
3319 ctx->sq_array = (u32 *)((char *)rings + sq_array_offset);
3320 rings->sq_ring_mask = p->sq_entries - 1;
3321 rings->cq_ring_mask = p->cq_entries - 1;
3322 rings->sq_ring_entries = p->sq_entries;
3323 rings->cq_ring_entries = p->cq_entries;
3325 if (p->flags & IORING_SETUP_SQE128)
3326 size = array_size(2 * sizeof(struct io_uring_sqe), p->sq_entries);
3328 size = array_size(sizeof(struct io_uring_sqe), p->sq_entries);
3329 if (size == SIZE_MAX) {
3330 io_mem_free(ctx->rings);
3335 ctx->sq_sqes = io_mem_alloc(size);
3336 if (!ctx->sq_sqes) {
3337 io_mem_free(ctx->rings);
3345 static int io_uring_install_fd(struct io_ring_ctx *ctx, struct file *file)
3349 fd = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
3353 ret = __io_uring_add_tctx_node(ctx);
3358 fd_install(fd, file);
3363 * Allocate an anonymous fd, this is what constitutes the application
3364 * visible backing of an io_uring instance. The application mmaps this
3365 * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled,
3366 * we have to tie this fd to a socket for file garbage collection purposes.
3368 static struct file *io_uring_get_file(struct io_ring_ctx *ctx)
3371 #if defined(CONFIG_UNIX)
3374 ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP,
3377 return ERR_PTR(ret);
3380 file = anon_inode_getfile_secure("[io_uring]", &io_uring_fops, ctx,
3381 O_RDWR | O_CLOEXEC, NULL);
3382 #if defined(CONFIG_UNIX)
3384 sock_release(ctx->ring_sock);
3385 ctx->ring_sock = NULL;
3387 ctx->ring_sock->file = file;
3393 static __cold int io_uring_create(unsigned entries, struct io_uring_params *p,
3394 struct io_uring_params __user *params)
3396 struct io_ring_ctx *ctx;
3402 if (entries > IORING_MAX_ENTRIES) {
3403 if (!(p->flags & IORING_SETUP_CLAMP))
3405 entries = IORING_MAX_ENTRIES;
3409 * Use twice as many entries for the CQ ring. It's possible for the
3410 * application to drive a higher depth than the size of the SQ ring,
3411 * since the sqes are only used at submission time. This allows for
3412 * some flexibility in overcommitting a bit. If the application has
3413 * set IORING_SETUP_CQSIZE, it will have passed in the desired number
3414 * of CQ ring entries manually.
3416 p->sq_entries = roundup_pow_of_two(entries);
3417 if (p->flags & IORING_SETUP_CQSIZE) {
3419 * If IORING_SETUP_CQSIZE is set, we do the same roundup
3420 * to a power-of-two, if it isn't already. We do NOT impose
3421 * any cq vs sq ring sizing.
3425 if (p->cq_entries > IORING_MAX_CQ_ENTRIES) {
3426 if (!(p->flags & IORING_SETUP_CLAMP))
3428 p->cq_entries = IORING_MAX_CQ_ENTRIES;
3430 p->cq_entries = roundup_pow_of_two(p->cq_entries);
3431 if (p->cq_entries < p->sq_entries)
3434 p->cq_entries = 2 * p->sq_entries;
3437 ctx = io_ring_ctx_alloc(p);
3442 * When SETUP_IOPOLL and SETUP_SQPOLL are both enabled, user
3443 * space applications don't need to do io completion events
3444 * polling again, they can rely on io_sq_thread to do polling
3445 * work, which can reduce cpu usage and uring_lock contention.
3447 if (ctx->flags & IORING_SETUP_IOPOLL &&
3448 !(ctx->flags & IORING_SETUP_SQPOLL))
3449 ctx->syscall_iopoll = 1;
3451 ctx->compat = in_compat_syscall();
3452 if (!capable(CAP_IPC_LOCK))
3453 ctx->user = get_uid(current_user());
3456 * For SQPOLL, we just need a wakeup, always. For !SQPOLL, if
3457 * COOP_TASKRUN is set, then IPIs are never needed by the app.
3460 if (ctx->flags & IORING_SETUP_SQPOLL) {
3461 /* IPI related flags don't make sense with SQPOLL */
3462 if (ctx->flags & (IORING_SETUP_COOP_TASKRUN |
3463 IORING_SETUP_TASKRUN_FLAG |
3464 IORING_SETUP_DEFER_TASKRUN))
3466 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3467 } else if (ctx->flags & IORING_SETUP_COOP_TASKRUN) {
3468 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3470 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG &&
3471 !(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
3473 ctx->notify_method = TWA_SIGNAL;
3477 * For DEFER_TASKRUN we require the completion task to be the same as the
3478 * submission task. This implies that there is only one submitter, so enforce
3481 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN &&
3482 !(ctx->flags & IORING_SETUP_SINGLE_ISSUER)) {
3487 * This is just grabbed for accounting purposes. When a process exits,
3488 * the mm is exited and dropped before the files, hence we need to hang
3489 * on to this mm purely for the purposes of being able to unaccount
3490 * memory (locked/pinned vm). It's not used for anything else.
3492 mmgrab(current->mm);
3493 ctx->mm_account = current->mm;
3495 ret = io_allocate_scq_urings(ctx, p);
3499 ret = io_sq_offload_create(ctx, p);
3502 /* always set a rsrc node */
3503 ret = io_rsrc_node_switch_start(ctx);
3506 io_rsrc_node_switch(ctx, NULL);
3508 memset(&p->sq_off, 0, sizeof(p->sq_off));
3509 p->sq_off.head = offsetof(struct io_rings, sq.head);
3510 p->sq_off.tail = offsetof(struct io_rings, sq.tail);
3511 p->sq_off.ring_mask = offsetof(struct io_rings, sq_ring_mask);
3512 p->sq_off.ring_entries = offsetof(struct io_rings, sq_ring_entries);
3513 p->sq_off.flags = offsetof(struct io_rings, sq_flags);
3514 p->sq_off.dropped = offsetof(struct io_rings, sq_dropped);
3515 p->sq_off.array = (char *)ctx->sq_array - (char *)ctx->rings;
3517 memset(&p->cq_off, 0, sizeof(p->cq_off));
3518 p->cq_off.head = offsetof(struct io_rings, cq.head);
3519 p->cq_off.tail = offsetof(struct io_rings, cq.tail);
3520 p->cq_off.ring_mask = offsetof(struct io_rings, cq_ring_mask);
3521 p->cq_off.ring_entries = offsetof(struct io_rings, cq_ring_entries);
3522 p->cq_off.overflow = offsetof(struct io_rings, cq_overflow);
3523 p->cq_off.cqes = offsetof(struct io_rings, cqes);
3524 p->cq_off.flags = offsetof(struct io_rings, cq_flags);
3526 p->features = IORING_FEAT_SINGLE_MMAP | IORING_FEAT_NODROP |
3527 IORING_FEAT_SUBMIT_STABLE | IORING_FEAT_RW_CUR_POS |
3528 IORING_FEAT_CUR_PERSONALITY | IORING_FEAT_FAST_POLL |
3529 IORING_FEAT_POLL_32BITS | IORING_FEAT_SQPOLL_NONFIXED |
3530 IORING_FEAT_EXT_ARG | IORING_FEAT_NATIVE_WORKERS |
3531 IORING_FEAT_RSRC_TAGS | IORING_FEAT_CQE_SKIP |
3532 IORING_FEAT_LINKED_FILE;
3534 if (copy_to_user(params, p, sizeof(*p))) {
3539 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER
3540 && !(ctx->flags & IORING_SETUP_R_DISABLED))
3541 ctx->submitter_task = get_task_struct(current);
3543 file = io_uring_get_file(ctx);
3545 ret = PTR_ERR(file);
3550 * Install ring fd as the very last thing, so we don't risk someone
3551 * having closed it before we finish setup
3553 ret = io_uring_install_fd(ctx, file);
3555 /* fput will clean it up */
3560 trace_io_uring_create(ret, ctx, p->sq_entries, p->cq_entries, p->flags);
3563 io_ring_ctx_wait_and_kill(ctx);
3568 * Sets up an aio uring context, and returns the fd. Applications asks for a
3569 * ring size, we return the actual sq/cq ring sizes (among other things) in the
3570 * params structure passed in.
3572 static long io_uring_setup(u32 entries, struct io_uring_params __user *params)
3574 struct io_uring_params p;
3577 if (copy_from_user(&p, params, sizeof(p)))
3579 for (i = 0; i < ARRAY_SIZE(p.resv); i++) {
3584 if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL |
3585 IORING_SETUP_SQ_AFF | IORING_SETUP_CQSIZE |
3586 IORING_SETUP_CLAMP | IORING_SETUP_ATTACH_WQ |
3587 IORING_SETUP_R_DISABLED | IORING_SETUP_SUBMIT_ALL |
3588 IORING_SETUP_COOP_TASKRUN | IORING_SETUP_TASKRUN_FLAG |
3589 IORING_SETUP_SQE128 | IORING_SETUP_CQE32 |
3590 IORING_SETUP_SINGLE_ISSUER | IORING_SETUP_DEFER_TASKRUN))
3593 return io_uring_create(entries, &p, params);
3596 SYSCALL_DEFINE2(io_uring_setup, u32, entries,
3597 struct io_uring_params __user *, params)
3599 return io_uring_setup(entries, params);
3602 static __cold int io_probe(struct io_ring_ctx *ctx, void __user *arg,
3605 struct io_uring_probe *p;
3609 size = struct_size(p, ops, nr_args);
3610 if (size == SIZE_MAX)
3612 p = kzalloc(size, GFP_KERNEL);
3617 if (copy_from_user(p, arg, size))
3620 if (memchr_inv(p, 0, size))
3623 p->last_op = IORING_OP_LAST - 1;
3624 if (nr_args > IORING_OP_LAST)
3625 nr_args = IORING_OP_LAST;
3627 for (i = 0; i < nr_args; i++) {
3629 if (!io_op_defs[i].not_supported)
3630 p->ops[i].flags = IO_URING_OP_SUPPORTED;
3635 if (copy_to_user(arg, p, size))
3642 static int io_register_personality(struct io_ring_ctx *ctx)
3644 const struct cred *creds;
3648 creds = get_current_cred();
3650 ret = xa_alloc_cyclic(&ctx->personalities, &id, (void *)creds,
3651 XA_LIMIT(0, USHRT_MAX), &ctx->pers_next, GFP_KERNEL);
3659 static __cold int io_register_restrictions(struct io_ring_ctx *ctx,
3660 void __user *arg, unsigned int nr_args)
3662 struct io_uring_restriction *res;
3666 /* Restrictions allowed only if rings started disabled */
3667 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
3670 /* We allow only a single restrictions registration */
3671 if (ctx->restrictions.registered)
3674 if (!arg || nr_args > IORING_MAX_RESTRICTIONS)
3677 size = array_size(nr_args, sizeof(*res));
3678 if (size == SIZE_MAX)
3681 res = memdup_user(arg, size);
3683 return PTR_ERR(res);
3687 for (i = 0; i < nr_args; i++) {
3688 switch (res[i].opcode) {
3689 case IORING_RESTRICTION_REGISTER_OP:
3690 if (res[i].register_op >= IORING_REGISTER_LAST) {
3695 __set_bit(res[i].register_op,
3696 ctx->restrictions.register_op);
3698 case IORING_RESTRICTION_SQE_OP:
3699 if (res[i].sqe_op >= IORING_OP_LAST) {
3704 __set_bit(res[i].sqe_op, ctx->restrictions.sqe_op);
3706 case IORING_RESTRICTION_SQE_FLAGS_ALLOWED:
3707 ctx->restrictions.sqe_flags_allowed = res[i].sqe_flags;
3709 case IORING_RESTRICTION_SQE_FLAGS_REQUIRED:
3710 ctx->restrictions.sqe_flags_required = res[i].sqe_flags;
3719 /* Reset all restrictions if an error happened */
3721 memset(&ctx->restrictions, 0, sizeof(ctx->restrictions));
3723 ctx->restrictions.registered = true;
3729 static int io_register_enable_rings(struct io_ring_ctx *ctx)
3731 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
3734 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER && !ctx->submitter_task)
3735 ctx->submitter_task = get_task_struct(current);
3737 if (ctx->restrictions.registered)
3738 ctx->restricted = 1;
3740 ctx->flags &= ~IORING_SETUP_R_DISABLED;
3741 if (ctx->sq_data && wq_has_sleeper(&ctx->sq_data->wait))
3742 wake_up(&ctx->sq_data->wait);
3746 static __cold int io_register_iowq_aff(struct io_ring_ctx *ctx,
3747 void __user *arg, unsigned len)
3749 struct io_uring_task *tctx = current->io_uring;
3750 cpumask_var_t new_mask;
3753 if (!tctx || !tctx->io_wq)
3756 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
3759 cpumask_clear(new_mask);
3760 if (len > cpumask_size())
3761 len = cpumask_size();
3763 if (in_compat_syscall()) {
3764 ret = compat_get_bitmap(cpumask_bits(new_mask),
3765 (const compat_ulong_t __user *)arg,
3766 len * 8 /* CHAR_BIT */);
3768 ret = copy_from_user(new_mask, arg, len);
3772 free_cpumask_var(new_mask);
3776 ret = io_wq_cpu_affinity(tctx->io_wq, new_mask);
3777 free_cpumask_var(new_mask);
3781 static __cold int io_unregister_iowq_aff(struct io_ring_ctx *ctx)
3783 struct io_uring_task *tctx = current->io_uring;
3785 if (!tctx || !tctx->io_wq)
3788 return io_wq_cpu_affinity(tctx->io_wq, NULL);
3791 static __cold int io_register_iowq_max_workers(struct io_ring_ctx *ctx,
3793 __must_hold(&ctx->uring_lock)
3795 struct io_tctx_node *node;
3796 struct io_uring_task *tctx = NULL;
3797 struct io_sq_data *sqd = NULL;
3801 if (copy_from_user(new_count, arg, sizeof(new_count)))
3803 for (i = 0; i < ARRAY_SIZE(new_count); i++)
3804 if (new_count[i] > INT_MAX)
3807 if (ctx->flags & IORING_SETUP_SQPOLL) {
3811 * Observe the correct sqd->lock -> ctx->uring_lock
3812 * ordering. Fine to drop uring_lock here, we hold
3815 refcount_inc(&sqd->refs);
3816 mutex_unlock(&ctx->uring_lock);
3817 mutex_lock(&sqd->lock);
3818 mutex_lock(&ctx->uring_lock);
3820 tctx = sqd->thread->io_uring;
3823 tctx = current->io_uring;
3826 BUILD_BUG_ON(sizeof(new_count) != sizeof(ctx->iowq_limits));
3828 for (i = 0; i < ARRAY_SIZE(new_count); i++)
3830 ctx->iowq_limits[i] = new_count[i];
3831 ctx->iowq_limits_set = true;
3833 if (tctx && tctx->io_wq) {
3834 ret = io_wq_max_workers(tctx->io_wq, new_count);
3838 memset(new_count, 0, sizeof(new_count));
3842 mutex_unlock(&sqd->lock);
3843 io_put_sq_data(sqd);
3846 if (copy_to_user(arg, new_count, sizeof(new_count)))
3849 /* that's it for SQPOLL, only the SQPOLL task creates requests */
3853 /* now propagate the restriction to all registered users */
3854 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
3855 struct io_uring_task *tctx = node->task->io_uring;
3857 if (WARN_ON_ONCE(!tctx->io_wq))
3860 for (i = 0; i < ARRAY_SIZE(new_count); i++)
3861 new_count[i] = ctx->iowq_limits[i];
3862 /* ignore errors, it always returns zero anyway */
3863 (void)io_wq_max_workers(tctx->io_wq, new_count);
3868 mutex_unlock(&sqd->lock);
3869 io_put_sq_data(sqd);
3874 static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode,
3875 void __user *arg, unsigned nr_args)
3876 __releases(ctx->uring_lock)
3877 __acquires(ctx->uring_lock)
3882 * We don't quiesce the refs for register anymore and so it can't be
3883 * dying as we're holding a file ref here.
3885 if (WARN_ON_ONCE(percpu_ref_is_dying(&ctx->refs)))
3888 if (ctx->submitter_task && ctx->submitter_task != current)
3891 if (ctx->restricted) {
3892 if (opcode >= IORING_REGISTER_LAST)
3894 opcode = array_index_nospec(opcode, IORING_REGISTER_LAST);
3895 if (!test_bit(opcode, ctx->restrictions.register_op))
3900 case IORING_REGISTER_BUFFERS:
3904 ret = io_sqe_buffers_register(ctx, arg, nr_args, NULL);
3906 case IORING_UNREGISTER_BUFFERS:
3910 ret = io_sqe_buffers_unregister(ctx);
3912 case IORING_REGISTER_FILES:
3916 ret = io_sqe_files_register(ctx, arg, nr_args, NULL);
3918 case IORING_UNREGISTER_FILES:
3922 ret = io_sqe_files_unregister(ctx);
3924 case IORING_REGISTER_FILES_UPDATE:
3925 ret = io_register_files_update(ctx, arg, nr_args);
3927 case IORING_REGISTER_EVENTFD:
3931 ret = io_eventfd_register(ctx, arg, 0);
3933 case IORING_REGISTER_EVENTFD_ASYNC:
3937 ret = io_eventfd_register(ctx, arg, 1);
3939 case IORING_UNREGISTER_EVENTFD:
3943 ret = io_eventfd_unregister(ctx);
3945 case IORING_REGISTER_PROBE:
3947 if (!arg || nr_args > 256)
3949 ret = io_probe(ctx, arg, nr_args);
3951 case IORING_REGISTER_PERSONALITY:
3955 ret = io_register_personality(ctx);
3957 case IORING_UNREGISTER_PERSONALITY:
3961 ret = io_unregister_personality(ctx, nr_args);
3963 case IORING_REGISTER_ENABLE_RINGS:
3967 ret = io_register_enable_rings(ctx);
3969 case IORING_REGISTER_RESTRICTIONS:
3970 ret = io_register_restrictions(ctx, arg, nr_args);
3972 case IORING_REGISTER_FILES2:
3973 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_FILE);
3975 case IORING_REGISTER_FILES_UPDATE2:
3976 ret = io_register_rsrc_update(ctx, arg, nr_args,
3979 case IORING_REGISTER_BUFFERS2:
3980 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_BUFFER);
3982 case IORING_REGISTER_BUFFERS_UPDATE:
3983 ret = io_register_rsrc_update(ctx, arg, nr_args,
3984 IORING_RSRC_BUFFER);
3986 case IORING_REGISTER_IOWQ_AFF:
3988 if (!arg || !nr_args)
3990 ret = io_register_iowq_aff(ctx, arg, nr_args);
3992 case IORING_UNREGISTER_IOWQ_AFF:
3996 ret = io_unregister_iowq_aff(ctx);
3998 case IORING_REGISTER_IOWQ_MAX_WORKERS:
4000 if (!arg || nr_args != 2)
4002 ret = io_register_iowq_max_workers(ctx, arg);
4004 case IORING_REGISTER_RING_FDS:
4005 ret = io_ringfd_register(ctx, arg, nr_args);
4007 case IORING_UNREGISTER_RING_FDS:
4008 ret = io_ringfd_unregister(ctx, arg, nr_args);
4010 case IORING_REGISTER_PBUF_RING:
4012 if (!arg || nr_args != 1)
4014 ret = io_register_pbuf_ring(ctx, arg);
4016 case IORING_UNREGISTER_PBUF_RING:
4018 if (!arg || nr_args != 1)
4020 ret = io_unregister_pbuf_ring(ctx, arg);
4022 case IORING_REGISTER_SYNC_CANCEL:
4024 if (!arg || nr_args != 1)
4026 ret = io_sync_cancel(ctx, arg);
4028 case IORING_REGISTER_FILE_ALLOC_RANGE:
4030 if (!arg || nr_args)
4032 ret = io_register_file_alloc_range(ctx, arg);
4042 SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode,
4043 void __user *, arg, unsigned int, nr_args)
4045 struct io_ring_ctx *ctx;
4054 if (!io_is_uring_fops(f.file))
4057 ctx = f.file->private_data;
4059 io_run_task_work_ctx(ctx);
4061 mutex_lock(&ctx->uring_lock);
4062 ret = __io_uring_register(ctx, opcode, arg, nr_args);
4063 mutex_unlock(&ctx->uring_lock);
4064 trace_io_uring_register(ctx, opcode, ctx->nr_user_files, ctx->nr_user_bufs, ret);
4070 static int __init io_uring_init(void)
4072 #define __BUILD_BUG_VERIFY_OFFSET_SIZE(stype, eoffset, esize, ename) do { \
4073 BUILD_BUG_ON(offsetof(stype, ename) != eoffset); \
4074 BUILD_BUG_ON(sizeof_field(stype, ename) != esize); \
4077 #define BUILD_BUG_SQE_ELEM(eoffset, etype, ename) \
4078 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, sizeof(etype), ename)
4079 #define BUILD_BUG_SQE_ELEM_SIZE(eoffset, esize, ename) \
4080 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, esize, ename)
4081 BUILD_BUG_ON(sizeof(struct io_uring_sqe) != 64);
4082 BUILD_BUG_SQE_ELEM(0, __u8, opcode);
4083 BUILD_BUG_SQE_ELEM(1, __u8, flags);
4084 BUILD_BUG_SQE_ELEM(2, __u16, ioprio);
4085 BUILD_BUG_SQE_ELEM(4, __s32, fd);
4086 BUILD_BUG_SQE_ELEM(8, __u64, off);
4087 BUILD_BUG_SQE_ELEM(8, __u64, addr2);
4088 BUILD_BUG_SQE_ELEM(8, __u32, cmd_op);
4089 BUILD_BUG_SQE_ELEM(12, __u32, __pad1);
4090 BUILD_BUG_SQE_ELEM(16, __u64, addr);
4091 BUILD_BUG_SQE_ELEM(16, __u64, splice_off_in);
4092 BUILD_BUG_SQE_ELEM(24, __u32, len);
4093 BUILD_BUG_SQE_ELEM(28, __kernel_rwf_t, rw_flags);
4094 BUILD_BUG_SQE_ELEM(28, /* compat */ int, rw_flags);
4095 BUILD_BUG_SQE_ELEM(28, /* compat */ __u32, rw_flags);
4096 BUILD_BUG_SQE_ELEM(28, __u32, fsync_flags);
4097 BUILD_BUG_SQE_ELEM(28, /* compat */ __u16, poll_events);
4098 BUILD_BUG_SQE_ELEM(28, __u32, poll32_events);
4099 BUILD_BUG_SQE_ELEM(28, __u32, sync_range_flags);
4100 BUILD_BUG_SQE_ELEM(28, __u32, msg_flags);
4101 BUILD_BUG_SQE_ELEM(28, __u32, timeout_flags);
4102 BUILD_BUG_SQE_ELEM(28, __u32, accept_flags);
4103 BUILD_BUG_SQE_ELEM(28, __u32, cancel_flags);
4104 BUILD_BUG_SQE_ELEM(28, __u32, open_flags);
4105 BUILD_BUG_SQE_ELEM(28, __u32, statx_flags);
4106 BUILD_BUG_SQE_ELEM(28, __u32, fadvise_advice);
4107 BUILD_BUG_SQE_ELEM(28, __u32, splice_flags);
4108 BUILD_BUG_SQE_ELEM(28, __u32, rename_flags);
4109 BUILD_BUG_SQE_ELEM(28, __u32, unlink_flags);
4110 BUILD_BUG_SQE_ELEM(28, __u32, hardlink_flags);
4111 BUILD_BUG_SQE_ELEM(28, __u32, xattr_flags);
4112 BUILD_BUG_SQE_ELEM(28, __u32, msg_ring_flags);
4113 BUILD_BUG_SQE_ELEM(32, __u64, user_data);
4114 BUILD_BUG_SQE_ELEM(40, __u16, buf_index);
4115 BUILD_BUG_SQE_ELEM(40, __u16, buf_group);
4116 BUILD_BUG_SQE_ELEM(42, __u16, personality);
4117 BUILD_BUG_SQE_ELEM(44, __s32, splice_fd_in);
4118 BUILD_BUG_SQE_ELEM(44, __u32, file_index);
4119 BUILD_BUG_SQE_ELEM(44, __u16, addr_len);
4120 BUILD_BUG_SQE_ELEM(46, __u16, __pad3[0]);
4121 BUILD_BUG_SQE_ELEM(48, __u64, addr3);
4122 BUILD_BUG_SQE_ELEM_SIZE(48, 0, cmd);
4123 BUILD_BUG_SQE_ELEM(56, __u64, __pad2);
4125 BUILD_BUG_ON(sizeof(struct io_uring_files_update) !=
4126 sizeof(struct io_uring_rsrc_update));
4127 BUILD_BUG_ON(sizeof(struct io_uring_rsrc_update) >
4128 sizeof(struct io_uring_rsrc_update2));
4130 /* ->buf_index is u16 */
4131 BUILD_BUG_ON(offsetof(struct io_uring_buf_ring, bufs) != 0);
4132 BUILD_BUG_ON(offsetof(struct io_uring_buf, resv) !=
4133 offsetof(struct io_uring_buf_ring, tail));
4135 /* should fit into one byte */
4136 BUILD_BUG_ON(SQE_VALID_FLAGS >= (1 << 8));
4137 BUILD_BUG_ON(SQE_COMMON_FLAGS >= (1 << 8));
4138 BUILD_BUG_ON((SQE_VALID_FLAGS | SQE_COMMON_FLAGS) != SQE_VALID_FLAGS);
4140 BUILD_BUG_ON(__REQ_F_LAST_BIT > 8 * sizeof(int));
4142 BUILD_BUG_ON(sizeof(atomic_t) != sizeof(u32));
4144 io_uring_optable_init();
4146 req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC |
4150 __initcall(io_uring_init);