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);
152 static __cold void io_fallback_tw(struct io_uring_task *tctx);
154 static struct kmem_cache *req_cachep;
156 struct sock *io_uring_get_socket(struct file *file)
158 #if defined(CONFIG_UNIX)
159 if (io_is_uring_fops(file)) {
160 struct io_ring_ctx *ctx = file->private_data;
162 return ctx->ring_sock->sk;
167 EXPORT_SYMBOL(io_uring_get_socket);
169 static inline void io_submit_flush_completions(struct io_ring_ctx *ctx)
171 if (!wq_list_empty(&ctx->submit_state.compl_reqs) ||
172 ctx->submit_state.cqes_count)
173 __io_submit_flush_completions(ctx);
176 static inline unsigned int __io_cqring_events(struct io_ring_ctx *ctx)
178 return ctx->cached_cq_tail - READ_ONCE(ctx->rings->cq.head);
181 static inline unsigned int __io_cqring_events_user(struct io_ring_ctx *ctx)
183 return READ_ONCE(ctx->rings->cq.tail) - READ_ONCE(ctx->rings->cq.head);
186 static bool io_match_linked(struct io_kiocb *head)
188 struct io_kiocb *req;
190 io_for_each_link(req, head) {
191 if (req->flags & REQ_F_INFLIGHT)
198 * As io_match_task() but protected against racing with linked timeouts.
199 * User must not hold timeout_lock.
201 bool io_match_task_safe(struct io_kiocb *head, struct task_struct *task,
206 if (task && head->task != task)
211 if (head->flags & REQ_F_LINK_TIMEOUT) {
212 struct io_ring_ctx *ctx = head->ctx;
214 /* protect against races with linked timeouts */
215 spin_lock_irq(&ctx->timeout_lock);
216 matched = io_match_linked(head);
217 spin_unlock_irq(&ctx->timeout_lock);
219 matched = io_match_linked(head);
224 static inline void req_fail_link_node(struct io_kiocb *req, int res)
227 io_req_set_res(req, res, 0);
230 static inline void io_req_add_to_cache(struct io_kiocb *req, struct io_ring_ctx *ctx)
232 wq_stack_add_head(&req->comp_list, &ctx->submit_state.free_list);
235 static __cold void io_ring_ctx_ref_free(struct percpu_ref *ref)
237 struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs);
239 complete(&ctx->ref_comp);
242 static __cold void io_fallback_req_func(struct work_struct *work)
244 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx,
246 struct llist_node *node = llist_del_all(&ctx->fallback_llist);
247 struct io_kiocb *req, *tmp;
250 percpu_ref_get(&ctx->refs);
251 llist_for_each_entry_safe(req, tmp, node, io_task_work.node)
252 req->io_task_work.func(req, &locked);
255 io_submit_flush_completions(ctx);
256 mutex_unlock(&ctx->uring_lock);
258 percpu_ref_put(&ctx->refs);
261 static int io_alloc_hash_table(struct io_hash_table *table, unsigned bits)
263 unsigned hash_buckets = 1U << bits;
264 size_t hash_size = hash_buckets * sizeof(table->hbs[0]);
266 table->hbs = kmalloc(hash_size, GFP_KERNEL);
270 table->hash_bits = bits;
271 init_hash_table(table, hash_buckets);
275 static __cold struct io_ring_ctx *io_ring_ctx_alloc(struct io_uring_params *p)
277 struct io_ring_ctx *ctx;
280 ctx = kzalloc(sizeof(*ctx), GFP_KERNEL);
284 xa_init(&ctx->io_bl_xa);
287 * Use 5 bits less than the max cq entries, that should give us around
288 * 32 entries per hash list if totally full and uniformly spread, but
289 * don't keep too many buckets to not overconsume memory.
291 hash_bits = ilog2(p->cq_entries) - 5;
292 hash_bits = clamp(hash_bits, 1, 8);
293 if (io_alloc_hash_table(&ctx->cancel_table, hash_bits))
295 if (io_alloc_hash_table(&ctx->cancel_table_locked, hash_bits))
298 ctx->dummy_ubuf = kzalloc(sizeof(*ctx->dummy_ubuf), GFP_KERNEL);
299 if (!ctx->dummy_ubuf)
301 /* set invalid range, so io_import_fixed() fails meeting it */
302 ctx->dummy_ubuf->ubuf = -1UL;
304 if (percpu_ref_init(&ctx->refs, io_ring_ctx_ref_free,
308 ctx->flags = p->flags;
309 init_waitqueue_head(&ctx->sqo_sq_wait);
310 INIT_LIST_HEAD(&ctx->sqd_list);
311 INIT_LIST_HEAD(&ctx->cq_overflow_list);
312 INIT_LIST_HEAD(&ctx->io_buffers_cache);
313 io_alloc_cache_init(&ctx->apoll_cache);
314 io_alloc_cache_init(&ctx->netmsg_cache);
315 init_completion(&ctx->ref_comp);
316 xa_init_flags(&ctx->personalities, XA_FLAGS_ALLOC1);
317 mutex_init(&ctx->uring_lock);
318 init_waitqueue_head(&ctx->cq_wait);
319 init_waitqueue_head(&ctx->poll_wq);
320 spin_lock_init(&ctx->completion_lock);
321 spin_lock_init(&ctx->timeout_lock);
322 INIT_WQ_LIST(&ctx->iopoll_list);
323 INIT_LIST_HEAD(&ctx->io_buffers_pages);
324 INIT_LIST_HEAD(&ctx->io_buffers_comp);
325 INIT_LIST_HEAD(&ctx->defer_list);
326 INIT_LIST_HEAD(&ctx->timeout_list);
327 INIT_LIST_HEAD(&ctx->ltimeout_list);
328 spin_lock_init(&ctx->rsrc_ref_lock);
329 INIT_LIST_HEAD(&ctx->rsrc_ref_list);
330 INIT_DELAYED_WORK(&ctx->rsrc_put_work, io_rsrc_put_work);
331 init_task_work(&ctx->rsrc_put_tw, io_rsrc_put_tw);
332 init_llist_head(&ctx->rsrc_put_llist);
333 init_llist_head(&ctx->work_llist);
334 INIT_LIST_HEAD(&ctx->tctx_list);
335 ctx->submit_state.free_list.next = NULL;
336 INIT_WQ_LIST(&ctx->locked_free_list);
337 INIT_DELAYED_WORK(&ctx->fallback_work, io_fallback_req_func);
338 INIT_WQ_LIST(&ctx->submit_state.compl_reqs);
341 kfree(ctx->dummy_ubuf);
342 kfree(ctx->cancel_table.hbs);
343 kfree(ctx->cancel_table_locked.hbs);
345 xa_destroy(&ctx->io_bl_xa);
350 static void io_account_cq_overflow(struct io_ring_ctx *ctx)
352 struct io_rings *r = ctx->rings;
354 WRITE_ONCE(r->cq_overflow, READ_ONCE(r->cq_overflow) + 1);
358 static bool req_need_defer(struct io_kiocb *req, u32 seq)
360 if (unlikely(req->flags & REQ_F_IO_DRAIN)) {
361 struct io_ring_ctx *ctx = req->ctx;
363 return seq + READ_ONCE(ctx->cq_extra) != ctx->cached_cq_tail;
369 static inline void io_req_track_inflight(struct io_kiocb *req)
371 if (!(req->flags & REQ_F_INFLIGHT)) {
372 req->flags |= REQ_F_INFLIGHT;
373 atomic_inc(&req->task->io_uring->inflight_tracked);
377 static struct io_kiocb *__io_prep_linked_timeout(struct io_kiocb *req)
379 if (WARN_ON_ONCE(!req->link))
382 req->flags &= ~REQ_F_ARM_LTIMEOUT;
383 req->flags |= REQ_F_LINK_TIMEOUT;
385 /* linked timeouts should have two refs once prep'ed */
386 io_req_set_refcount(req);
387 __io_req_set_refcount(req->link, 2);
391 static inline struct io_kiocb *io_prep_linked_timeout(struct io_kiocb *req)
393 if (likely(!(req->flags & REQ_F_ARM_LTIMEOUT)))
395 return __io_prep_linked_timeout(req);
398 static noinline void __io_arm_ltimeout(struct io_kiocb *req)
400 io_queue_linked_timeout(__io_prep_linked_timeout(req));
403 static inline void io_arm_ltimeout(struct io_kiocb *req)
405 if (unlikely(req->flags & REQ_F_ARM_LTIMEOUT))
406 __io_arm_ltimeout(req);
409 static void io_prep_async_work(struct io_kiocb *req)
411 const struct io_op_def *def = &io_op_defs[req->opcode];
412 struct io_ring_ctx *ctx = req->ctx;
414 if (!(req->flags & REQ_F_CREDS)) {
415 req->flags |= REQ_F_CREDS;
416 req->creds = get_current_cred();
419 req->work.list.next = NULL;
421 req->work.cancel_seq = atomic_read(&ctx->cancel_seq);
422 if (req->flags & REQ_F_FORCE_ASYNC)
423 req->work.flags |= IO_WQ_WORK_CONCURRENT;
425 if (req->file && !io_req_ffs_set(req))
426 req->flags |= io_file_get_flags(req->file) << REQ_F_SUPPORT_NOWAIT_BIT;
428 if (req->flags & REQ_F_ISREG) {
429 if (def->hash_reg_file || (ctx->flags & IORING_SETUP_IOPOLL))
430 io_wq_hash_work(&req->work, file_inode(req->file));
431 } else if (!req->file || !S_ISBLK(file_inode(req->file)->i_mode)) {
432 if (def->unbound_nonreg_file)
433 req->work.flags |= IO_WQ_WORK_UNBOUND;
437 static void io_prep_async_link(struct io_kiocb *req)
439 struct io_kiocb *cur;
441 if (req->flags & REQ_F_LINK_TIMEOUT) {
442 struct io_ring_ctx *ctx = req->ctx;
444 spin_lock_irq(&ctx->timeout_lock);
445 io_for_each_link(cur, req)
446 io_prep_async_work(cur);
447 spin_unlock_irq(&ctx->timeout_lock);
449 io_for_each_link(cur, req)
450 io_prep_async_work(cur);
454 void io_queue_iowq(struct io_kiocb *req, bool *dont_use)
456 struct io_kiocb *link = io_prep_linked_timeout(req);
457 struct io_uring_task *tctx = req->task->io_uring;
460 BUG_ON(!tctx->io_wq);
462 /* init ->work of the whole link before punting */
463 io_prep_async_link(req);
466 * Not expected to happen, but if we do have a bug where this _can_
467 * happen, catch it here and ensure the request is marked as
468 * canceled. That will make io-wq go through the usual work cancel
469 * procedure rather than attempt to run this request (or create a new
472 if (WARN_ON_ONCE(!same_thread_group(req->task, current)))
473 req->work.flags |= IO_WQ_WORK_CANCEL;
475 trace_io_uring_queue_async_work(req, io_wq_is_hashed(&req->work));
476 io_wq_enqueue(tctx->io_wq, &req->work);
478 io_queue_linked_timeout(link);
481 static __cold void io_queue_deferred(struct io_ring_ctx *ctx)
483 while (!list_empty(&ctx->defer_list)) {
484 struct io_defer_entry *de = list_first_entry(&ctx->defer_list,
485 struct io_defer_entry, list);
487 if (req_need_defer(de->req, de->seq))
489 list_del_init(&de->list);
490 io_req_task_queue(de->req);
496 static void io_eventfd_ops(struct rcu_head *rcu)
498 struct io_ev_fd *ev_fd = container_of(rcu, struct io_ev_fd, rcu);
499 int ops = atomic_xchg(&ev_fd->ops, 0);
501 if (ops & BIT(IO_EVENTFD_OP_SIGNAL_BIT))
502 eventfd_signal_mask(ev_fd->cq_ev_fd, 1, EPOLL_URING_WAKE);
504 /* IO_EVENTFD_OP_FREE_BIT may not be set here depending on callback
505 * ordering in a race but if references are 0 we know we have to free
508 if (atomic_dec_and_test(&ev_fd->refs)) {
509 eventfd_ctx_put(ev_fd->cq_ev_fd);
514 static void io_eventfd_signal(struct io_ring_ctx *ctx)
516 struct io_ev_fd *ev_fd = NULL;
520 * rcu_dereference ctx->io_ev_fd once and use it for both for checking
523 ev_fd = rcu_dereference(ctx->io_ev_fd);
526 * Check again if ev_fd exists incase an io_eventfd_unregister call
527 * completed between the NULL check of ctx->io_ev_fd at the start of
528 * the function and rcu_read_lock.
530 if (unlikely(!ev_fd))
532 if (READ_ONCE(ctx->rings->cq_flags) & IORING_CQ_EVENTFD_DISABLED)
534 if (ev_fd->eventfd_async && !io_wq_current_is_worker())
537 if (likely(eventfd_signal_allowed())) {
538 eventfd_signal_mask(ev_fd->cq_ev_fd, 1, EPOLL_URING_WAKE);
540 atomic_inc(&ev_fd->refs);
541 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_SIGNAL_BIT), &ev_fd->ops))
542 call_rcu_hurry(&ev_fd->rcu, io_eventfd_ops);
544 atomic_dec(&ev_fd->refs);
551 static void io_eventfd_flush_signal(struct io_ring_ctx *ctx)
555 spin_lock(&ctx->completion_lock);
558 * Eventfd should only get triggered when at least one event has been
559 * posted. Some applications rely on the eventfd notification count
560 * only changing IFF a new CQE has been added to the CQ ring. There's
561 * no depedency on 1:1 relationship between how many times this
562 * function is called (and hence the eventfd count) and number of CQEs
563 * posted to the CQ ring.
565 skip = ctx->cached_cq_tail == ctx->evfd_last_cq_tail;
566 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
567 spin_unlock(&ctx->completion_lock);
571 io_eventfd_signal(ctx);
574 void __io_commit_cqring_flush(struct io_ring_ctx *ctx)
576 if (ctx->poll_activated)
577 io_poll_wq_wake(ctx);
578 if (ctx->off_timeout_used)
579 io_flush_timeouts(ctx);
580 if (ctx->drain_active) {
581 spin_lock(&ctx->completion_lock);
582 io_queue_deferred(ctx);
583 spin_unlock(&ctx->completion_lock);
586 io_eventfd_flush_signal(ctx);
589 static inline void __io_cq_lock(struct io_ring_ctx *ctx)
590 __acquires(ctx->completion_lock)
592 if (!ctx->task_complete)
593 spin_lock(&ctx->completion_lock);
596 static inline void __io_cq_unlock(struct io_ring_ctx *ctx)
598 if (!ctx->task_complete)
599 spin_unlock(&ctx->completion_lock);
602 static inline void io_cq_lock(struct io_ring_ctx *ctx)
603 __acquires(ctx->completion_lock)
605 spin_lock(&ctx->completion_lock);
608 static inline void io_cq_unlock(struct io_ring_ctx *ctx)
609 __releases(ctx->completion_lock)
611 spin_unlock(&ctx->completion_lock);
614 /* keep it inlined for io_submit_flush_completions() */
615 static inline void __io_cq_unlock_post(struct io_ring_ctx *ctx)
616 __releases(ctx->completion_lock)
618 io_commit_cqring(ctx);
620 io_commit_cqring_flush(ctx);
624 void io_cq_unlock_post(struct io_ring_ctx *ctx)
625 __releases(ctx->completion_lock)
627 io_commit_cqring(ctx);
628 spin_unlock(&ctx->completion_lock);
629 io_commit_cqring_flush(ctx);
633 /* Returns true if there are no backlogged entries after the flush */
634 static void io_cqring_overflow_kill(struct io_ring_ctx *ctx)
636 struct io_overflow_cqe *ocqe;
640 list_splice_init(&ctx->cq_overflow_list, &list);
641 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
644 while (!list_empty(&list)) {
645 ocqe = list_first_entry(&list, struct io_overflow_cqe, list);
646 list_del(&ocqe->list);
651 /* Returns true if there are no backlogged entries after the flush */
652 static void __io_cqring_overflow_flush(struct io_ring_ctx *ctx)
654 size_t cqe_size = sizeof(struct io_uring_cqe);
656 if (__io_cqring_events(ctx) == ctx->cq_entries)
659 if (ctx->flags & IORING_SETUP_CQE32)
663 while (!list_empty(&ctx->cq_overflow_list)) {
664 struct io_uring_cqe *cqe = io_get_cqe_overflow(ctx, true);
665 struct io_overflow_cqe *ocqe;
669 ocqe = list_first_entry(&ctx->cq_overflow_list,
670 struct io_overflow_cqe, list);
671 memcpy(cqe, &ocqe->cqe, cqe_size);
672 list_del(&ocqe->list);
676 if (list_empty(&ctx->cq_overflow_list)) {
677 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
678 atomic_andnot(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
680 io_cq_unlock_post(ctx);
683 static void io_cqring_do_overflow_flush(struct io_ring_ctx *ctx)
685 /* iopoll syncs against uring_lock, not completion_lock */
686 if (ctx->flags & IORING_SETUP_IOPOLL)
687 mutex_lock(&ctx->uring_lock);
688 __io_cqring_overflow_flush(ctx);
689 if (ctx->flags & IORING_SETUP_IOPOLL)
690 mutex_unlock(&ctx->uring_lock);
693 static void io_cqring_overflow_flush(struct io_ring_ctx *ctx)
695 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
696 io_cqring_do_overflow_flush(ctx);
699 void __io_put_task(struct task_struct *task, int nr)
701 struct io_uring_task *tctx = task->io_uring;
703 percpu_counter_sub(&tctx->inflight, nr);
704 if (unlikely(atomic_read(&tctx->in_idle)))
705 wake_up(&tctx->wait);
706 put_task_struct_many(task, nr);
709 void io_task_refs_refill(struct io_uring_task *tctx)
711 unsigned int refill = -tctx->cached_refs + IO_TCTX_REFS_CACHE_NR;
713 percpu_counter_add(&tctx->inflight, refill);
714 refcount_add(refill, ¤t->usage);
715 tctx->cached_refs += refill;
718 static __cold void io_uring_drop_tctx_refs(struct task_struct *task)
720 struct io_uring_task *tctx = task->io_uring;
721 unsigned int refs = tctx->cached_refs;
724 tctx->cached_refs = 0;
725 percpu_counter_sub(&tctx->inflight, refs);
726 put_task_struct_many(task, refs);
730 static bool io_cqring_event_overflow(struct io_ring_ctx *ctx, u64 user_data,
731 s32 res, u32 cflags, u64 extra1, u64 extra2)
733 struct io_overflow_cqe *ocqe;
734 size_t ocq_size = sizeof(struct io_overflow_cqe);
735 bool is_cqe32 = (ctx->flags & IORING_SETUP_CQE32);
737 lockdep_assert_held(&ctx->completion_lock);
740 ocq_size += sizeof(struct io_uring_cqe);
742 ocqe = kmalloc(ocq_size, GFP_ATOMIC | __GFP_ACCOUNT);
743 trace_io_uring_cqe_overflow(ctx, user_data, res, cflags, ocqe);
746 * If we're in ring overflow flush mode, or in task cancel mode,
747 * or cannot allocate an overflow entry, then we need to drop it
750 io_account_cq_overflow(ctx);
751 set_bit(IO_CHECK_CQ_DROPPED_BIT, &ctx->check_cq);
754 if (list_empty(&ctx->cq_overflow_list)) {
755 set_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
756 atomic_or(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
759 ocqe->cqe.user_data = user_data;
761 ocqe->cqe.flags = cflags;
763 ocqe->cqe.big_cqe[0] = extra1;
764 ocqe->cqe.big_cqe[1] = extra2;
766 list_add_tail(&ocqe->list, &ctx->cq_overflow_list);
770 bool io_req_cqe_overflow(struct io_kiocb *req)
772 if (!(req->flags & REQ_F_CQE32_INIT)) {
776 return io_cqring_event_overflow(req->ctx, req->cqe.user_data,
777 req->cqe.res, req->cqe.flags,
778 req->extra1, req->extra2);
782 * writes to the cq entry need to come after reading head; the
783 * control dependency is enough as we're using WRITE_ONCE to
786 struct io_uring_cqe *__io_get_cqe(struct io_ring_ctx *ctx, bool overflow)
788 struct io_rings *rings = ctx->rings;
789 unsigned int off = ctx->cached_cq_tail & (ctx->cq_entries - 1);
790 unsigned int free, queued, len;
793 * Posting into the CQ when there are pending overflowed CQEs may break
794 * ordering guarantees, which will affect links, F_MORE users and more.
795 * Force overflow the completion.
797 if (!overflow && (ctx->check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)))
800 /* userspace may cheat modifying the tail, be safe and do min */
801 queued = min(__io_cqring_events(ctx), ctx->cq_entries);
802 free = ctx->cq_entries - queued;
803 /* we need a contiguous range, limit based on the current array offset */
804 len = min(free, ctx->cq_entries - off);
808 if (ctx->flags & IORING_SETUP_CQE32) {
813 ctx->cqe_cached = &rings->cqes[off];
814 ctx->cqe_sentinel = ctx->cqe_cached + len;
816 ctx->cached_cq_tail++;
818 if (ctx->flags & IORING_SETUP_CQE32)
820 return &rings->cqes[off];
823 static bool io_fill_cqe_aux(struct io_ring_ctx *ctx, u64 user_data, s32 res,
826 struct io_uring_cqe *cqe;
831 * If we can't get a cq entry, userspace overflowed the
832 * submission (by quite a lot). Increment the overflow count in
835 cqe = io_get_cqe(ctx);
837 trace_io_uring_complete(ctx, NULL, user_data, res, cflags, 0, 0);
839 WRITE_ONCE(cqe->user_data, user_data);
840 WRITE_ONCE(cqe->res, res);
841 WRITE_ONCE(cqe->flags, cflags);
843 if (ctx->flags & IORING_SETUP_CQE32) {
844 WRITE_ONCE(cqe->big_cqe[0], 0);
845 WRITE_ONCE(cqe->big_cqe[1], 0);
852 static void __io_flush_post_cqes(struct io_ring_ctx *ctx)
853 __must_hold(&ctx->uring_lock)
855 struct io_submit_state *state = &ctx->submit_state;
858 lockdep_assert_held(&ctx->uring_lock);
859 for (i = 0; i < state->cqes_count; i++) {
860 struct io_uring_cqe *cqe = &state->cqes[i];
862 if (!io_fill_cqe_aux(ctx, cqe->user_data, cqe->res, cqe->flags)) {
863 if (ctx->task_complete) {
864 spin_lock(&ctx->completion_lock);
865 io_cqring_event_overflow(ctx, cqe->user_data,
866 cqe->res, cqe->flags, 0, 0);
867 spin_unlock(&ctx->completion_lock);
869 io_cqring_event_overflow(ctx, cqe->user_data,
870 cqe->res, cqe->flags, 0, 0);
874 state->cqes_count = 0;
877 static bool __io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags,
883 filled = io_fill_cqe_aux(ctx, user_data, res, cflags);
884 if (!filled && allow_overflow)
885 filled = io_cqring_event_overflow(ctx, user_data, res, cflags, 0, 0);
887 io_cq_unlock_post(ctx);
891 bool io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags)
893 return __io_post_aux_cqe(ctx, user_data, res, cflags, true);
896 bool io_aux_cqe(struct io_ring_ctx *ctx, bool defer, u64 user_data, s32 res, u32 cflags,
899 struct io_uring_cqe *cqe;
903 return __io_post_aux_cqe(ctx, user_data, res, cflags, allow_overflow);
905 length = ARRAY_SIZE(ctx->submit_state.cqes);
907 lockdep_assert_held(&ctx->uring_lock);
909 if (ctx->submit_state.cqes_count == length) {
911 __io_flush_post_cqes(ctx);
912 /* no need to flush - flush is deferred */
913 __io_cq_unlock_post(ctx);
916 /* For defered completions this is not as strict as it is otherwise,
917 * however it's main job is to prevent unbounded posted completions,
918 * and in that it works just as well.
920 if (!allow_overflow && test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
923 cqe = &ctx->submit_state.cqes[ctx->submit_state.cqes_count++];
924 cqe->user_data = user_data;
930 static void __io_req_complete_post(struct io_kiocb *req)
932 struct io_ring_ctx *ctx = req->ctx;
935 if (!(req->flags & REQ_F_CQE_SKIP))
936 io_fill_cqe_req(ctx, req);
939 * If we're the last reference to this request, add to our locked
942 if (req_ref_put_and_test(req)) {
943 if (req->flags & IO_REQ_LINK_FLAGS) {
944 if (req->flags & IO_DISARM_MASK)
947 io_req_task_queue(req->link);
951 io_req_put_rsrc(req);
953 * Selected buffer deallocation in io_clean_op() assumes that
954 * we don't hold ->completion_lock. Clean them here to avoid
957 io_put_kbuf_comp(req);
958 io_dismantle_req(req);
959 io_put_task(req->task, 1);
960 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
961 ctx->locked_free_nr++;
963 io_cq_unlock_post(ctx);
966 void io_req_complete_post(struct io_kiocb *req, unsigned issue_flags)
968 if (req->ctx->task_complete && (issue_flags & IO_URING_F_IOWQ)) {
969 req->io_task_work.func = io_req_task_complete;
970 io_req_task_work_add(req);
971 } else if (!(issue_flags & IO_URING_F_UNLOCKED) ||
972 !(req->ctx->flags & IORING_SETUP_IOPOLL)) {
973 __io_req_complete_post(req);
975 struct io_ring_ctx *ctx = req->ctx;
977 mutex_lock(&ctx->uring_lock);
978 __io_req_complete_post(req);
979 mutex_unlock(&ctx->uring_lock);
983 void io_req_defer_failed(struct io_kiocb *req, s32 res)
984 __must_hold(&ctx->uring_lock)
986 const struct io_op_def *def = &io_op_defs[req->opcode];
988 lockdep_assert_held(&req->ctx->uring_lock);
991 io_req_set_res(req, res, io_put_kbuf(req, IO_URING_F_UNLOCKED));
994 io_req_complete_defer(req);
998 * Don't initialise the fields below on every allocation, but do that in
999 * advance and keep them valid across allocations.
1001 static void io_preinit_req(struct io_kiocb *req, struct io_ring_ctx *ctx)
1005 req->async_data = NULL;
1006 /* not necessary, but safer to zero */
1010 static void io_flush_cached_locked_reqs(struct io_ring_ctx *ctx,
1011 struct io_submit_state *state)
1013 spin_lock(&ctx->completion_lock);
1014 wq_list_splice(&ctx->locked_free_list, &state->free_list);
1015 ctx->locked_free_nr = 0;
1016 spin_unlock(&ctx->completion_lock);
1020 * A request might get retired back into the request caches even before opcode
1021 * handlers and io_issue_sqe() are done with it, e.g. inline completion path.
1022 * Because of that, io_alloc_req() should be called only under ->uring_lock
1023 * and with extra caution to not get a request that is still worked on.
1025 __cold bool __io_alloc_req_refill(struct io_ring_ctx *ctx)
1026 __must_hold(&ctx->uring_lock)
1028 gfp_t gfp = GFP_KERNEL | __GFP_NOWARN;
1029 void *reqs[IO_REQ_ALLOC_BATCH];
1033 * If we have more than a batch's worth of requests in our IRQ side
1034 * locked cache, grab the lock and move them over to our submission
1037 if (data_race(ctx->locked_free_nr) > IO_COMPL_BATCH) {
1038 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
1039 if (!io_req_cache_empty(ctx))
1043 ret = kmem_cache_alloc_bulk(req_cachep, gfp, ARRAY_SIZE(reqs), reqs);
1046 * Bulk alloc is all-or-nothing. If we fail to get a batch,
1047 * retry single alloc to be on the safe side.
1049 if (unlikely(ret <= 0)) {
1050 reqs[0] = kmem_cache_alloc(req_cachep, gfp);
1056 percpu_ref_get_many(&ctx->refs, ret);
1057 for (i = 0; i < ret; i++) {
1058 struct io_kiocb *req = reqs[i];
1060 io_preinit_req(req, ctx);
1061 io_req_add_to_cache(req, ctx);
1066 static inline void io_dismantle_req(struct io_kiocb *req)
1068 unsigned int flags = req->flags;
1070 if (unlikely(flags & IO_REQ_CLEAN_FLAGS))
1072 if (!(flags & REQ_F_FIXED_FILE))
1073 io_put_file(req->file);
1076 __cold void io_free_req(struct io_kiocb *req)
1078 struct io_ring_ctx *ctx = req->ctx;
1080 io_req_put_rsrc(req);
1081 io_dismantle_req(req);
1082 io_put_task(req->task, 1);
1084 spin_lock(&ctx->completion_lock);
1085 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
1086 ctx->locked_free_nr++;
1087 spin_unlock(&ctx->completion_lock);
1090 static void __io_req_find_next_prep(struct io_kiocb *req)
1092 struct io_ring_ctx *ctx = req->ctx;
1094 spin_lock(&ctx->completion_lock);
1095 io_disarm_next(req);
1096 spin_unlock(&ctx->completion_lock);
1099 static inline struct io_kiocb *io_req_find_next(struct io_kiocb *req)
1101 struct io_kiocb *nxt;
1104 * If LINK is set, we have dependent requests in this chain. If we
1105 * didn't fail this request, queue the first one up, moving any other
1106 * dependencies to the next request. In case of failure, fail the rest
1109 if (unlikely(req->flags & IO_DISARM_MASK))
1110 __io_req_find_next_prep(req);
1116 static void ctx_flush_and_put(struct io_ring_ctx *ctx, bool *locked)
1120 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1121 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1123 io_submit_flush_completions(ctx);
1124 mutex_unlock(&ctx->uring_lock);
1127 percpu_ref_put(&ctx->refs);
1130 static unsigned int handle_tw_list(struct llist_node *node,
1131 struct io_ring_ctx **ctx, bool *locked,
1132 struct llist_node *last)
1134 unsigned int count = 0;
1136 while (node != last) {
1137 struct llist_node *next = node->next;
1138 struct io_kiocb *req = container_of(node, struct io_kiocb,
1141 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1143 if (req->ctx != *ctx) {
1144 ctx_flush_and_put(*ctx, locked);
1146 /* if not contended, grab and improve batching */
1147 *locked = mutex_trylock(&(*ctx)->uring_lock);
1148 percpu_ref_get(&(*ctx)->refs);
1150 req->io_task_work.func(req, locked);
1159 * io_llist_xchg - swap all entries in a lock-less list
1160 * @head: the head of lock-less list to delete all entries
1161 * @new: new entry as the head of the list
1163 * If list is empty, return NULL, otherwise, return the pointer to the first entry.
1164 * The order of entries returned is from the newest to the oldest added one.
1166 static inline struct llist_node *io_llist_xchg(struct llist_head *head,
1167 struct llist_node *new)
1169 return xchg(&head->first, new);
1173 * io_llist_cmpxchg - possibly swap all entries in a lock-less list
1174 * @head: the head of lock-less list to delete all entries
1175 * @old: expected old value of the first entry of the list
1176 * @new: new entry as the head of the list
1178 * perform a cmpxchg on the first entry of the list.
1181 static inline struct llist_node *io_llist_cmpxchg(struct llist_head *head,
1182 struct llist_node *old,
1183 struct llist_node *new)
1185 return cmpxchg(&head->first, old, new);
1188 void tctx_task_work(struct callback_head *cb)
1190 bool uring_locked = false;
1191 struct io_ring_ctx *ctx = NULL;
1192 struct io_uring_task *tctx = container_of(cb, struct io_uring_task,
1194 struct llist_node fake = {};
1195 struct llist_node *node;
1196 unsigned int loops = 1;
1199 if (unlikely(current->flags & PF_EXITING)) {
1200 io_fallback_tw(tctx);
1204 node = io_llist_xchg(&tctx->task_list, &fake);
1205 count = handle_tw_list(node, &ctx, &uring_locked, NULL);
1206 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1207 while (node != &fake) {
1209 node = io_llist_xchg(&tctx->task_list, &fake);
1210 count += handle_tw_list(node, &ctx, &uring_locked, &fake);
1211 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1214 ctx_flush_and_put(ctx, &uring_locked);
1216 /* relaxed read is enough as only the task itself sets ->in_idle */
1217 if (unlikely(atomic_read(&tctx->in_idle)))
1218 io_uring_drop_tctx_refs(current);
1220 trace_io_uring_task_work_run(tctx, count, loops);
1223 static __cold void io_fallback_tw(struct io_uring_task *tctx)
1225 struct llist_node *node = llist_del_all(&tctx->task_list);
1226 struct io_kiocb *req;
1229 req = container_of(node, struct io_kiocb, io_task_work.node);
1231 if (llist_add(&req->io_task_work.node,
1232 &req->ctx->fallback_llist))
1233 schedule_delayed_work(&req->ctx->fallback_work, 1);
1237 static void io_req_local_work_add(struct io_kiocb *req)
1239 struct io_ring_ctx *ctx = req->ctx;
1241 percpu_ref_get(&ctx->refs);
1243 if (!llist_add(&req->io_task_work.node, &ctx->work_llist)) {
1244 percpu_ref_put(&ctx->refs);
1247 /* need it for the following io_cqring_wake() */
1248 smp_mb__after_atomic();
1250 if (unlikely(atomic_read(&req->task->io_uring->in_idle))) {
1251 io_move_task_work_from_local(ctx);
1252 percpu_ref_put(&ctx->refs);
1256 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1257 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1260 io_eventfd_signal(ctx);
1261 __io_cqring_wake(ctx);
1262 percpu_ref_put(&ctx->refs);
1265 void __io_req_task_work_add(struct io_kiocb *req, bool allow_local)
1267 struct io_uring_task *tctx = req->task->io_uring;
1268 struct io_ring_ctx *ctx = req->ctx;
1270 if (allow_local && ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
1271 io_req_local_work_add(req);
1275 /* task_work already pending, we're done */
1276 if (!llist_add(&req->io_task_work.node, &tctx->task_list))
1279 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1280 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1282 if (likely(!task_work_add(req->task, &tctx->task_work, ctx->notify_method)))
1285 io_fallback_tw(tctx);
1288 static void __cold io_move_task_work_from_local(struct io_ring_ctx *ctx)
1290 struct llist_node *node;
1292 node = llist_del_all(&ctx->work_llist);
1294 struct io_kiocb *req = container_of(node, struct io_kiocb,
1298 __io_req_task_work_add(req, false);
1302 static int __io_run_local_work(struct io_ring_ctx *ctx, bool *locked)
1304 struct llist_node *node;
1305 struct llist_node fake;
1306 struct llist_node *current_final = NULL;
1308 unsigned int loops = 1;
1310 if (WARN_ON_ONCE(ctx->submitter_task != current))
1313 node = io_llist_xchg(&ctx->work_llist, &fake);
1315 while (node != current_final) {
1316 struct llist_node *next = node->next;
1317 struct io_kiocb *req = container_of(node, struct io_kiocb,
1319 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1320 req->io_task_work.func(req, locked);
1325 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1326 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1328 node = io_llist_cmpxchg(&ctx->work_llist, &fake, NULL);
1329 if (node != &fake) {
1331 current_final = &fake;
1332 node = io_llist_xchg(&ctx->work_llist, &fake);
1337 io_submit_flush_completions(ctx);
1338 trace_io_uring_local_work_run(ctx, ret, loops);
1343 static inline int io_run_local_work_locked(struct io_ring_ctx *ctx)
1348 if (llist_empty(&ctx->work_llist))
1352 ret = __io_run_local_work(ctx, &locked);
1353 /* shouldn't happen! */
1354 if (WARN_ON_ONCE(!locked))
1355 mutex_lock(&ctx->uring_lock);
1359 static int io_run_local_work(struct io_ring_ctx *ctx)
1361 bool locked = mutex_trylock(&ctx->uring_lock);
1364 ret = __io_run_local_work(ctx, &locked);
1366 mutex_unlock(&ctx->uring_lock);
1371 static void io_req_task_cancel(struct io_kiocb *req, bool *locked)
1373 io_tw_lock(req->ctx, locked);
1374 io_req_defer_failed(req, req->cqe.res);
1377 void io_req_task_submit(struct io_kiocb *req, bool *locked)
1379 io_tw_lock(req->ctx, locked);
1380 /* req->task == current here, checking PF_EXITING is safe */
1381 if (likely(!(req->task->flags & PF_EXITING)))
1384 io_req_defer_failed(req, -EFAULT);
1387 void io_req_task_queue_fail(struct io_kiocb *req, int ret)
1389 io_req_set_res(req, ret, 0);
1390 req->io_task_work.func = io_req_task_cancel;
1391 io_req_task_work_add(req);
1394 void io_req_task_queue(struct io_kiocb *req)
1396 req->io_task_work.func = io_req_task_submit;
1397 io_req_task_work_add(req);
1400 void io_queue_next(struct io_kiocb *req)
1402 struct io_kiocb *nxt = io_req_find_next(req);
1405 io_req_task_queue(nxt);
1408 void io_free_batch_list(struct io_ring_ctx *ctx, struct io_wq_work_node *node)
1409 __must_hold(&ctx->uring_lock)
1411 struct task_struct *task = NULL;
1415 struct io_kiocb *req = container_of(node, struct io_kiocb,
1418 if (unlikely(req->flags & IO_REQ_CLEAN_SLOW_FLAGS)) {
1419 if (req->flags & REQ_F_REFCOUNT) {
1420 node = req->comp_list.next;
1421 if (!req_ref_put_and_test(req))
1424 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1425 struct async_poll *apoll = req->apoll;
1427 if (apoll->double_poll)
1428 kfree(apoll->double_poll);
1429 if (!io_alloc_cache_put(&ctx->apoll_cache, &apoll->cache))
1431 req->flags &= ~REQ_F_POLLED;
1433 if (req->flags & IO_REQ_LINK_FLAGS)
1435 if (unlikely(req->flags & IO_REQ_CLEAN_FLAGS))
1438 if (!(req->flags & REQ_F_FIXED_FILE))
1439 io_put_file(req->file);
1441 io_req_put_rsrc_locked(req, ctx);
1443 if (req->task != task) {
1445 io_put_task(task, task_refs);
1450 node = req->comp_list.next;
1451 io_req_add_to_cache(req, ctx);
1455 io_put_task(task, task_refs);
1458 static void __io_submit_flush_completions(struct io_ring_ctx *ctx)
1459 __must_hold(&ctx->uring_lock)
1461 struct io_wq_work_node *node, *prev;
1462 struct io_submit_state *state = &ctx->submit_state;
1465 /* must come first to preserve CQE ordering in failure cases */
1466 if (state->cqes_count)
1467 __io_flush_post_cqes(ctx);
1468 wq_list_for_each(node, prev, &state->compl_reqs) {
1469 struct io_kiocb *req = container_of(node, struct io_kiocb,
1472 if (!(req->flags & REQ_F_CQE_SKIP) &&
1473 unlikely(!__io_fill_cqe_req(ctx, req))) {
1474 if (ctx->task_complete) {
1475 spin_lock(&ctx->completion_lock);
1476 io_req_cqe_overflow(req);
1477 spin_unlock(&ctx->completion_lock);
1479 io_req_cqe_overflow(req);
1483 __io_cq_unlock_post(ctx);
1485 if (!wq_list_empty(&ctx->submit_state.compl_reqs)) {
1486 io_free_batch_list(ctx, state->compl_reqs.first);
1487 INIT_WQ_LIST(&state->compl_reqs);
1492 * Drop reference to request, return next in chain (if there is one) if this
1493 * was the last reference to this request.
1495 static inline struct io_kiocb *io_put_req_find_next(struct io_kiocb *req)
1497 struct io_kiocb *nxt = NULL;
1499 if (req_ref_put_and_test(req)) {
1500 if (unlikely(req->flags & IO_REQ_LINK_FLAGS))
1501 nxt = io_req_find_next(req);
1507 static unsigned io_cqring_events(struct io_ring_ctx *ctx)
1509 /* See comment at the top of this file */
1511 return __io_cqring_events(ctx);
1515 * We can't just wait for polled events to come to us, we have to actively
1516 * find and complete them.
1518 static __cold void io_iopoll_try_reap_events(struct io_ring_ctx *ctx)
1520 if (!(ctx->flags & IORING_SETUP_IOPOLL))
1523 mutex_lock(&ctx->uring_lock);
1524 while (!wq_list_empty(&ctx->iopoll_list)) {
1525 /* let it sleep and repeat later if can't complete a request */
1526 if (io_do_iopoll(ctx, true) == 0)
1529 * Ensure we allow local-to-the-cpu processing to take place,
1530 * in this case we need to ensure that we reap all events.
1531 * Also let task_work, etc. to progress by releasing the mutex
1533 if (need_resched()) {
1534 mutex_unlock(&ctx->uring_lock);
1536 mutex_lock(&ctx->uring_lock);
1539 mutex_unlock(&ctx->uring_lock);
1542 static int io_iopoll_check(struct io_ring_ctx *ctx, long min)
1544 unsigned int nr_events = 0;
1546 unsigned long check_cq;
1548 if (!io_allowed_run_tw(ctx))
1551 check_cq = READ_ONCE(ctx->check_cq);
1552 if (unlikely(check_cq)) {
1553 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
1554 __io_cqring_overflow_flush(ctx);
1556 * Similarly do not spin if we have not informed the user of any
1559 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT))
1563 * Don't enter poll loop if we already have events pending.
1564 * If we do, we can potentially be spinning for commands that
1565 * already triggered a CQE (eg in error).
1567 if (io_cqring_events(ctx))
1572 * If a submit got punted to a workqueue, we can have the
1573 * application entering polling for a command before it gets
1574 * issued. That app will hold the uring_lock for the duration
1575 * of the poll right here, so we need to take a breather every
1576 * now and then to ensure that the issue has a chance to add
1577 * the poll to the issued list. Otherwise we can spin here
1578 * forever, while the workqueue is stuck trying to acquire the
1581 if (wq_list_empty(&ctx->iopoll_list) ||
1582 io_task_work_pending(ctx)) {
1583 u32 tail = ctx->cached_cq_tail;
1585 (void) io_run_local_work_locked(ctx);
1587 if (task_work_pending(current) ||
1588 wq_list_empty(&ctx->iopoll_list)) {
1589 mutex_unlock(&ctx->uring_lock);
1591 mutex_lock(&ctx->uring_lock);
1593 /* some requests don't go through iopoll_list */
1594 if (tail != ctx->cached_cq_tail ||
1595 wq_list_empty(&ctx->iopoll_list))
1598 ret = io_do_iopoll(ctx, !min);
1603 } while (nr_events < min && !need_resched());
1608 void io_req_task_complete(struct io_kiocb *req, bool *locked)
1611 io_req_complete_defer(req);
1613 io_req_complete_post(req, IO_URING_F_UNLOCKED);
1617 * After the iocb has been issued, it's safe to be found on the poll list.
1618 * Adding the kiocb to the list AFTER submission ensures that we don't
1619 * find it from a io_do_iopoll() thread before the issuer is done
1620 * accessing the kiocb cookie.
1622 static void io_iopoll_req_issued(struct io_kiocb *req, unsigned int issue_flags)
1624 struct io_ring_ctx *ctx = req->ctx;
1625 const bool needs_lock = issue_flags & IO_URING_F_UNLOCKED;
1627 /* workqueue context doesn't hold uring_lock, grab it now */
1628 if (unlikely(needs_lock))
1629 mutex_lock(&ctx->uring_lock);
1632 * Track whether we have multiple files in our lists. This will impact
1633 * how we do polling eventually, not spinning if we're on potentially
1634 * different devices.
1636 if (wq_list_empty(&ctx->iopoll_list)) {
1637 ctx->poll_multi_queue = false;
1638 } else if (!ctx->poll_multi_queue) {
1639 struct io_kiocb *list_req;
1641 list_req = container_of(ctx->iopoll_list.first, struct io_kiocb,
1643 if (list_req->file != req->file)
1644 ctx->poll_multi_queue = true;
1648 * For fast devices, IO may have already completed. If it has, add
1649 * it to the front so we find it first.
1651 if (READ_ONCE(req->iopoll_completed))
1652 wq_list_add_head(&req->comp_list, &ctx->iopoll_list);
1654 wq_list_add_tail(&req->comp_list, &ctx->iopoll_list);
1656 if (unlikely(needs_lock)) {
1658 * If IORING_SETUP_SQPOLL is enabled, sqes are either handle
1659 * in sq thread task context or in io worker task context. If
1660 * current task context is sq thread, we don't need to check
1661 * whether should wake up sq thread.
1663 if ((ctx->flags & IORING_SETUP_SQPOLL) &&
1664 wq_has_sleeper(&ctx->sq_data->wait))
1665 wake_up(&ctx->sq_data->wait);
1667 mutex_unlock(&ctx->uring_lock);
1671 static bool io_bdev_nowait(struct block_device *bdev)
1673 return !bdev || bdev_nowait(bdev);
1677 * If we tracked the file through the SCM inflight mechanism, we could support
1678 * any file. For now, just ensure that anything potentially problematic is done
1681 static bool __io_file_supports_nowait(struct file *file, umode_t mode)
1683 if (S_ISBLK(mode)) {
1684 if (IS_ENABLED(CONFIG_BLOCK) &&
1685 io_bdev_nowait(I_BDEV(file->f_mapping->host)))
1691 if (S_ISREG(mode)) {
1692 if (IS_ENABLED(CONFIG_BLOCK) &&
1693 io_bdev_nowait(file->f_inode->i_sb->s_bdev) &&
1694 !io_is_uring_fops(file))
1699 /* any ->read/write should understand O_NONBLOCK */
1700 if (file->f_flags & O_NONBLOCK)
1702 return file->f_mode & FMODE_NOWAIT;
1706 * If we tracked the file through the SCM inflight mechanism, we could support
1707 * any file. For now, just ensure that anything potentially problematic is done
1710 unsigned int io_file_get_flags(struct file *file)
1712 umode_t mode = file_inode(file)->i_mode;
1713 unsigned int res = 0;
1717 if (__io_file_supports_nowait(file, mode))
1722 bool io_alloc_async_data(struct io_kiocb *req)
1724 WARN_ON_ONCE(!io_op_defs[req->opcode].async_size);
1725 req->async_data = kmalloc(io_op_defs[req->opcode].async_size, GFP_KERNEL);
1726 if (req->async_data) {
1727 req->flags |= REQ_F_ASYNC_DATA;
1733 int io_req_prep_async(struct io_kiocb *req)
1735 const struct io_op_def *def = &io_op_defs[req->opcode];
1737 /* assign early for deferred execution for non-fixed file */
1738 if (def->needs_file && !(req->flags & REQ_F_FIXED_FILE))
1739 req->file = io_file_get_normal(req, req->cqe.fd);
1740 if (!def->prep_async)
1742 if (WARN_ON_ONCE(req_has_async_data(req)))
1744 if (!io_op_defs[req->opcode].manual_alloc) {
1745 if (io_alloc_async_data(req))
1748 return def->prep_async(req);
1751 static u32 io_get_sequence(struct io_kiocb *req)
1753 u32 seq = req->ctx->cached_sq_head;
1754 struct io_kiocb *cur;
1756 /* need original cached_sq_head, but it was increased for each req */
1757 io_for_each_link(cur, req)
1762 static __cold void io_drain_req(struct io_kiocb *req)
1763 __must_hold(&ctx->uring_lock)
1765 struct io_ring_ctx *ctx = req->ctx;
1766 struct io_defer_entry *de;
1768 u32 seq = io_get_sequence(req);
1770 /* Still need defer if there is pending req in defer list. */
1771 spin_lock(&ctx->completion_lock);
1772 if (!req_need_defer(req, seq) && list_empty_careful(&ctx->defer_list)) {
1773 spin_unlock(&ctx->completion_lock);
1775 ctx->drain_active = false;
1776 io_req_task_queue(req);
1779 spin_unlock(&ctx->completion_lock);
1781 io_prep_async_link(req);
1782 de = kmalloc(sizeof(*de), GFP_KERNEL);
1785 io_req_defer_failed(req, ret);
1789 spin_lock(&ctx->completion_lock);
1790 if (!req_need_defer(req, seq) && list_empty(&ctx->defer_list)) {
1791 spin_unlock(&ctx->completion_lock);
1796 trace_io_uring_defer(req);
1799 list_add_tail(&de->list, &ctx->defer_list);
1800 spin_unlock(&ctx->completion_lock);
1803 static void io_clean_op(struct io_kiocb *req)
1805 if (req->flags & REQ_F_BUFFER_SELECTED) {
1806 spin_lock(&req->ctx->completion_lock);
1807 io_put_kbuf_comp(req);
1808 spin_unlock(&req->ctx->completion_lock);
1811 if (req->flags & REQ_F_NEED_CLEANUP) {
1812 const struct io_op_def *def = &io_op_defs[req->opcode];
1817 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1818 kfree(req->apoll->double_poll);
1822 if (req->flags & REQ_F_INFLIGHT) {
1823 struct io_uring_task *tctx = req->task->io_uring;
1825 atomic_dec(&tctx->inflight_tracked);
1827 if (req->flags & REQ_F_CREDS)
1828 put_cred(req->creds);
1829 if (req->flags & REQ_F_ASYNC_DATA) {
1830 kfree(req->async_data);
1831 req->async_data = NULL;
1833 req->flags &= ~IO_REQ_CLEAN_FLAGS;
1836 static bool io_assign_file(struct io_kiocb *req, unsigned int issue_flags)
1838 if (req->file || !io_op_defs[req->opcode].needs_file)
1841 if (req->flags & REQ_F_FIXED_FILE)
1842 req->file = io_file_get_fixed(req, req->cqe.fd, issue_flags);
1844 req->file = io_file_get_normal(req, req->cqe.fd);
1849 static int io_issue_sqe(struct io_kiocb *req, unsigned int issue_flags)
1851 const struct io_op_def *def = &io_op_defs[req->opcode];
1852 const struct cred *creds = NULL;
1855 if (unlikely(!io_assign_file(req, issue_flags)))
1858 if (unlikely((req->flags & REQ_F_CREDS) && req->creds != current_cred()))
1859 creds = override_creds(req->creds);
1861 if (!def->audit_skip)
1862 audit_uring_entry(req->opcode);
1864 ret = def->issue(req, issue_flags);
1866 if (!def->audit_skip)
1867 audit_uring_exit(!ret, ret);
1870 revert_creds(creds);
1872 if (ret == IOU_OK) {
1873 if (issue_flags & IO_URING_F_COMPLETE_DEFER)
1874 io_req_complete_defer(req);
1876 io_req_complete_post(req, issue_flags);
1877 } else if (ret != IOU_ISSUE_SKIP_COMPLETE)
1880 /* If the op doesn't have a file, we're not polling for it */
1881 if ((req->ctx->flags & IORING_SETUP_IOPOLL) && def->iopoll_queue)
1882 io_iopoll_req_issued(req, issue_flags);
1887 int io_poll_issue(struct io_kiocb *req, bool *locked)
1889 io_tw_lock(req->ctx, locked);
1890 return io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_MULTISHOT|
1891 IO_URING_F_COMPLETE_DEFER);
1894 struct io_wq_work *io_wq_free_work(struct io_wq_work *work)
1896 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1898 req = io_put_req_find_next(req);
1899 return req ? &req->work : NULL;
1902 void io_wq_submit_work(struct io_wq_work *work)
1904 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1905 const struct io_op_def *def = &io_op_defs[req->opcode];
1906 unsigned int issue_flags = IO_URING_F_UNLOCKED | IO_URING_F_IOWQ;
1907 bool needs_poll = false;
1908 int ret = 0, err = -ECANCELED;
1910 /* one will be dropped by ->io_wq_free_work() after returning to io-wq */
1911 if (!(req->flags & REQ_F_REFCOUNT))
1912 __io_req_set_refcount(req, 2);
1916 io_arm_ltimeout(req);
1918 /* either cancelled or io-wq is dying, so don't touch tctx->iowq */
1919 if (work->flags & IO_WQ_WORK_CANCEL) {
1921 io_req_task_queue_fail(req, err);
1924 if (!io_assign_file(req, issue_flags)) {
1926 work->flags |= IO_WQ_WORK_CANCEL;
1930 if (req->flags & REQ_F_FORCE_ASYNC) {
1931 bool opcode_poll = def->pollin || def->pollout;
1933 if (opcode_poll && file_can_poll(req->file)) {
1935 issue_flags |= IO_URING_F_NONBLOCK;
1940 ret = io_issue_sqe(req, issue_flags);
1944 * We can get EAGAIN for iopolled IO even though we're
1945 * forcing a sync submission from here, since we can't
1946 * wait for request slots on the block side.
1949 if (!(req->ctx->flags & IORING_SETUP_IOPOLL))
1955 if (io_arm_poll_handler(req, issue_flags) == IO_APOLL_OK)
1957 /* aborted or ready, in either case retry blocking */
1959 issue_flags &= ~IO_URING_F_NONBLOCK;
1962 /* avoid locking problems by failing it from a clean context */
1964 io_req_task_queue_fail(req, ret);
1967 inline struct file *io_file_get_fixed(struct io_kiocb *req, int fd,
1968 unsigned int issue_flags)
1970 struct io_ring_ctx *ctx = req->ctx;
1971 struct file *file = NULL;
1972 unsigned long file_ptr;
1974 io_ring_submit_lock(ctx, issue_flags);
1976 if (unlikely((unsigned int)fd >= ctx->nr_user_files))
1978 fd = array_index_nospec(fd, ctx->nr_user_files);
1979 file_ptr = io_fixed_file_slot(&ctx->file_table, fd)->file_ptr;
1980 file = (struct file *) (file_ptr & FFS_MASK);
1981 file_ptr &= ~FFS_MASK;
1982 /* mask in overlapping REQ_F and FFS bits */
1983 req->flags |= (file_ptr << REQ_F_SUPPORT_NOWAIT_BIT);
1984 io_req_set_rsrc_node(req, ctx, 0);
1986 io_ring_submit_unlock(ctx, issue_flags);
1990 struct file *io_file_get_normal(struct io_kiocb *req, int fd)
1992 struct file *file = fget(fd);
1994 trace_io_uring_file_get(req, fd);
1996 /* we don't allow fixed io_uring files */
1997 if (file && io_is_uring_fops(file))
1998 io_req_track_inflight(req);
2002 static void io_queue_async(struct io_kiocb *req, int ret)
2003 __must_hold(&req->ctx->uring_lock)
2005 struct io_kiocb *linked_timeout;
2007 if (ret != -EAGAIN || (req->flags & REQ_F_NOWAIT)) {
2008 io_req_defer_failed(req, ret);
2012 linked_timeout = io_prep_linked_timeout(req);
2014 switch (io_arm_poll_handler(req, 0)) {
2015 case IO_APOLL_READY:
2016 io_kbuf_recycle(req, 0);
2017 io_req_task_queue(req);
2019 case IO_APOLL_ABORTED:
2020 io_kbuf_recycle(req, 0);
2021 io_queue_iowq(req, NULL);
2028 io_queue_linked_timeout(linked_timeout);
2031 static inline void io_queue_sqe(struct io_kiocb *req)
2032 __must_hold(&req->ctx->uring_lock)
2036 ret = io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_COMPLETE_DEFER);
2039 * We async punt it if the file wasn't marked NOWAIT, or if the file
2040 * doesn't support non-blocking read/write attempts
2043 io_arm_ltimeout(req);
2045 io_queue_async(req, ret);
2048 static void io_queue_sqe_fallback(struct io_kiocb *req)
2049 __must_hold(&req->ctx->uring_lock)
2051 if (unlikely(req->flags & REQ_F_FAIL)) {
2053 * We don't submit, fail them all, for that replace hardlinks
2054 * with normal links. Extra REQ_F_LINK is tolerated.
2056 req->flags &= ~REQ_F_HARDLINK;
2057 req->flags |= REQ_F_LINK;
2058 io_req_defer_failed(req, req->cqe.res);
2060 int ret = io_req_prep_async(req);
2062 if (unlikely(ret)) {
2063 io_req_defer_failed(req, ret);
2067 if (unlikely(req->ctx->drain_active))
2070 io_queue_iowq(req, NULL);
2075 * Check SQE restrictions (opcode and flags).
2077 * Returns 'true' if SQE is allowed, 'false' otherwise.
2079 static inline bool io_check_restriction(struct io_ring_ctx *ctx,
2080 struct io_kiocb *req,
2081 unsigned int sqe_flags)
2083 if (!test_bit(req->opcode, ctx->restrictions.sqe_op))
2086 if ((sqe_flags & ctx->restrictions.sqe_flags_required) !=
2087 ctx->restrictions.sqe_flags_required)
2090 if (sqe_flags & ~(ctx->restrictions.sqe_flags_allowed |
2091 ctx->restrictions.sqe_flags_required))
2097 static void io_init_req_drain(struct io_kiocb *req)
2099 struct io_ring_ctx *ctx = req->ctx;
2100 struct io_kiocb *head = ctx->submit_state.link.head;
2102 ctx->drain_active = true;
2105 * If we need to drain a request in the middle of a link, drain
2106 * the head request and the next request/link after the current
2107 * link. Considering sequential execution of links,
2108 * REQ_F_IO_DRAIN will be maintained for every request of our
2111 head->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2112 ctx->drain_next = true;
2116 static int io_init_req(struct io_ring_ctx *ctx, struct io_kiocb *req,
2117 const struct io_uring_sqe *sqe)
2118 __must_hold(&ctx->uring_lock)
2120 const struct io_op_def *def;
2121 unsigned int sqe_flags;
2125 /* req is partially pre-initialised, see io_preinit_req() */
2126 req->opcode = opcode = READ_ONCE(sqe->opcode);
2127 /* same numerical values with corresponding REQ_F_*, safe to copy */
2128 req->flags = sqe_flags = READ_ONCE(sqe->flags);
2129 req->cqe.user_data = READ_ONCE(sqe->user_data);
2131 req->rsrc_node = NULL;
2132 req->task = current;
2134 if (unlikely(opcode >= IORING_OP_LAST)) {
2138 def = &io_op_defs[opcode];
2139 if (unlikely(sqe_flags & ~SQE_COMMON_FLAGS)) {
2140 /* enforce forwards compatibility on users */
2141 if (sqe_flags & ~SQE_VALID_FLAGS)
2143 if (sqe_flags & IOSQE_BUFFER_SELECT) {
2144 if (!def->buffer_select)
2146 req->buf_index = READ_ONCE(sqe->buf_group);
2148 if (sqe_flags & IOSQE_CQE_SKIP_SUCCESS)
2149 ctx->drain_disabled = true;
2150 if (sqe_flags & IOSQE_IO_DRAIN) {
2151 if (ctx->drain_disabled)
2153 io_init_req_drain(req);
2156 if (unlikely(ctx->restricted || ctx->drain_active || ctx->drain_next)) {
2157 if (ctx->restricted && !io_check_restriction(ctx, req, sqe_flags))
2159 /* knock it to the slow queue path, will be drained there */
2160 if (ctx->drain_active)
2161 req->flags |= REQ_F_FORCE_ASYNC;
2162 /* if there is no link, we're at "next" request and need to drain */
2163 if (unlikely(ctx->drain_next) && !ctx->submit_state.link.head) {
2164 ctx->drain_next = false;
2165 ctx->drain_active = true;
2166 req->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2170 if (!def->ioprio && sqe->ioprio)
2172 if (!def->iopoll && (ctx->flags & IORING_SETUP_IOPOLL))
2175 if (def->needs_file) {
2176 struct io_submit_state *state = &ctx->submit_state;
2178 req->cqe.fd = READ_ONCE(sqe->fd);
2181 * Plug now if we have more than 2 IO left after this, and the
2182 * target is potentially a read/write to block based storage.
2184 if (state->need_plug && def->plug) {
2185 state->plug_started = true;
2186 state->need_plug = false;
2187 blk_start_plug_nr_ios(&state->plug, state->submit_nr);
2191 personality = READ_ONCE(sqe->personality);
2195 req->creds = xa_load(&ctx->personalities, personality);
2198 get_cred(req->creds);
2199 ret = security_uring_override_creds(req->creds);
2201 put_cred(req->creds);
2204 req->flags |= REQ_F_CREDS;
2207 return def->prep(req, sqe);
2210 static __cold int io_submit_fail_init(const struct io_uring_sqe *sqe,
2211 struct io_kiocb *req, int ret)
2213 struct io_ring_ctx *ctx = req->ctx;
2214 struct io_submit_link *link = &ctx->submit_state.link;
2215 struct io_kiocb *head = link->head;
2217 trace_io_uring_req_failed(sqe, req, ret);
2220 * Avoid breaking links in the middle as it renders links with SQPOLL
2221 * unusable. Instead of failing eagerly, continue assembling the link if
2222 * applicable and mark the head with REQ_F_FAIL. The link flushing code
2223 * should find the flag and handle the rest.
2225 req_fail_link_node(req, ret);
2226 if (head && !(head->flags & REQ_F_FAIL))
2227 req_fail_link_node(head, -ECANCELED);
2229 if (!(req->flags & IO_REQ_LINK_FLAGS)) {
2231 link->last->link = req;
2235 io_queue_sqe_fallback(req);
2240 link->last->link = req;
2247 static inline int io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req,
2248 const struct io_uring_sqe *sqe)
2249 __must_hold(&ctx->uring_lock)
2251 struct io_submit_link *link = &ctx->submit_state.link;
2254 ret = io_init_req(ctx, req, sqe);
2256 return io_submit_fail_init(sqe, req, ret);
2258 /* don't need @sqe from now on */
2259 trace_io_uring_submit_sqe(req, true);
2262 * If we already have a head request, queue this one for async
2263 * submittal once the head completes. If we don't have a head but
2264 * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be
2265 * submitted sync once the chain is complete. If none of those
2266 * conditions are true (normal request), then just queue it.
2268 if (unlikely(link->head)) {
2269 ret = io_req_prep_async(req);
2271 return io_submit_fail_init(sqe, req, ret);
2273 trace_io_uring_link(req, link->head);
2274 link->last->link = req;
2277 if (req->flags & IO_REQ_LINK_FLAGS)
2279 /* last request of the link, flush it */
2282 if (req->flags & (REQ_F_FORCE_ASYNC | REQ_F_FAIL))
2285 } else if (unlikely(req->flags & (IO_REQ_LINK_FLAGS |
2286 REQ_F_FORCE_ASYNC | REQ_F_FAIL))) {
2287 if (req->flags & IO_REQ_LINK_FLAGS) {
2292 io_queue_sqe_fallback(req);
2302 * Batched submission is done, ensure local IO is flushed out.
2304 static void io_submit_state_end(struct io_ring_ctx *ctx)
2306 struct io_submit_state *state = &ctx->submit_state;
2308 if (unlikely(state->link.head))
2309 io_queue_sqe_fallback(state->link.head);
2310 /* flush only after queuing links as they can generate completions */
2311 io_submit_flush_completions(ctx);
2312 if (state->plug_started)
2313 blk_finish_plug(&state->plug);
2317 * Start submission side cache.
2319 static void io_submit_state_start(struct io_submit_state *state,
2320 unsigned int max_ios)
2322 state->plug_started = false;
2323 state->need_plug = max_ios > 2;
2324 state->submit_nr = max_ios;
2325 /* set only head, no need to init link_last in advance */
2326 state->link.head = NULL;
2329 static void io_commit_sqring(struct io_ring_ctx *ctx)
2331 struct io_rings *rings = ctx->rings;
2334 * Ensure any loads from the SQEs are done at this point,
2335 * since once we write the new head, the application could
2336 * write new data to them.
2338 smp_store_release(&rings->sq.head, ctx->cached_sq_head);
2342 * Fetch an sqe, if one is available. Note this returns a pointer to memory
2343 * that is mapped by userspace. This means that care needs to be taken to
2344 * ensure that reads are stable, as we cannot rely on userspace always
2345 * being a good citizen. If members of the sqe are validated and then later
2346 * used, it's important that those reads are done through READ_ONCE() to
2347 * prevent a re-load down the line.
2349 static const struct io_uring_sqe *io_get_sqe(struct io_ring_ctx *ctx)
2351 unsigned head, mask = ctx->sq_entries - 1;
2352 unsigned sq_idx = ctx->cached_sq_head++ & mask;
2355 * The cached sq head (or cq tail) serves two purposes:
2357 * 1) allows us to batch the cost of updating the user visible
2359 * 2) allows the kernel side to track the head on its own, even
2360 * though the application is the one updating it.
2362 head = READ_ONCE(ctx->sq_array[sq_idx]);
2363 if (likely(head < ctx->sq_entries)) {
2364 /* double index for 128-byte SQEs, twice as long */
2365 if (ctx->flags & IORING_SETUP_SQE128)
2367 return &ctx->sq_sqes[head];
2370 /* drop invalid entries */
2372 WRITE_ONCE(ctx->rings->sq_dropped,
2373 READ_ONCE(ctx->rings->sq_dropped) + 1);
2377 int io_submit_sqes(struct io_ring_ctx *ctx, unsigned int nr)
2378 __must_hold(&ctx->uring_lock)
2380 unsigned int entries = io_sqring_entries(ctx);
2384 if (unlikely(!entries))
2386 /* make sure SQ entry isn't read before tail */
2387 ret = left = min3(nr, ctx->sq_entries, entries);
2388 io_get_task_refs(left);
2389 io_submit_state_start(&ctx->submit_state, left);
2392 const struct io_uring_sqe *sqe;
2393 struct io_kiocb *req;
2395 if (unlikely(!io_alloc_req_refill(ctx)))
2397 req = io_alloc_req(ctx);
2398 sqe = io_get_sqe(ctx);
2399 if (unlikely(!sqe)) {
2400 io_req_add_to_cache(req, ctx);
2405 * Continue submitting even for sqe failure if the
2406 * ring was setup with IORING_SETUP_SUBMIT_ALL
2408 if (unlikely(io_submit_sqe(ctx, req, sqe)) &&
2409 !(ctx->flags & IORING_SETUP_SUBMIT_ALL)) {
2415 if (unlikely(left)) {
2417 /* try again if it submitted nothing and can't allocate a req */
2418 if (!ret && io_req_cache_empty(ctx))
2420 current->io_uring->cached_refs += left;
2423 io_submit_state_end(ctx);
2424 /* Commit SQ ring head once we've consumed and submitted all SQEs */
2425 io_commit_sqring(ctx);
2429 struct io_wait_queue {
2430 struct wait_queue_entry wq;
2431 struct io_ring_ctx *ctx;
2433 unsigned nr_timeouts;
2437 static inline bool io_has_work(struct io_ring_ctx *ctx)
2439 return test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq) ||
2440 !llist_empty(&ctx->work_llist);
2443 static inline bool io_should_wake(struct io_wait_queue *iowq)
2445 struct io_ring_ctx *ctx = iowq->ctx;
2446 int dist = READ_ONCE(ctx->rings->cq.tail) - (int) iowq->cq_tail;
2449 * Wake up if we have enough events, or if a timeout occurred since we
2450 * started waiting. For timeouts, we always want to return to userspace,
2451 * regardless of event count.
2453 return dist >= 0 || atomic_read(&ctx->cq_timeouts) != iowq->nr_timeouts;
2456 static int io_wake_function(struct wait_queue_entry *curr, unsigned int mode,
2457 int wake_flags, void *key)
2459 struct io_wait_queue *iowq = container_of(curr, struct io_wait_queue, wq);
2462 * Cannot safely flush overflowed CQEs from here, ensure we wake up
2463 * the task, and the next invocation will do it.
2465 if (io_should_wake(iowq) || io_has_work(iowq->ctx))
2466 return autoremove_wake_function(curr, mode, wake_flags, key);
2470 int io_run_task_work_sig(struct io_ring_ctx *ctx)
2472 if (!llist_empty(&ctx->work_llist)) {
2473 __set_current_state(TASK_RUNNING);
2474 if (io_run_local_work(ctx) > 0)
2477 if (io_run_task_work() > 0)
2479 if (task_sigpending(current))
2484 /* when returns >0, the caller should retry */
2485 static inline int io_cqring_wait_schedule(struct io_ring_ctx *ctx,
2486 struct io_wait_queue *iowq)
2488 if (unlikely(READ_ONCE(ctx->check_cq)))
2490 if (unlikely(!llist_empty(&ctx->work_llist)))
2492 if (unlikely(test_thread_flag(TIF_NOTIFY_SIGNAL)))
2494 if (unlikely(task_sigpending(current)))
2496 if (unlikely(io_should_wake(iowq)))
2498 if (iowq->timeout == KTIME_MAX)
2500 else if (!schedule_hrtimeout(&iowq->timeout, HRTIMER_MODE_ABS))
2506 * Wait until events become available, if we don't already have some. The
2507 * application must reap them itself, as they reside on the shared cq ring.
2509 static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events,
2510 const sigset_t __user *sig, size_t sigsz,
2511 struct __kernel_timespec __user *uts)
2513 struct io_wait_queue iowq;
2514 struct io_rings *rings = ctx->rings;
2517 if (!io_allowed_run_tw(ctx))
2519 if (!llist_empty(&ctx->work_llist))
2520 io_run_local_work(ctx);
2522 io_cqring_overflow_flush(ctx);
2523 /* if user messes with these they will just get an early return */
2524 if (__io_cqring_events_user(ctx) >= min_events)
2528 #ifdef CONFIG_COMPAT
2529 if (in_compat_syscall())
2530 ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig,
2534 ret = set_user_sigmask(sig, sigsz);
2540 init_waitqueue_func_entry(&iowq.wq, io_wake_function);
2541 iowq.wq.private = current;
2542 INIT_LIST_HEAD(&iowq.wq.entry);
2544 iowq.nr_timeouts = atomic_read(&ctx->cq_timeouts);
2545 iowq.cq_tail = READ_ONCE(ctx->rings->cq.head) + min_events;
2546 iowq.timeout = KTIME_MAX;
2549 struct timespec64 ts;
2551 if (get_timespec64(&ts, uts))
2553 iowq.timeout = ktime_add_ns(timespec64_to_ktime(ts), ktime_get_ns());
2556 trace_io_uring_cqring_wait(ctx, min_events);
2558 unsigned long check_cq;
2560 prepare_to_wait_exclusive(&ctx->cq_wait, &iowq.wq,
2561 TASK_INTERRUPTIBLE);
2562 ret = io_cqring_wait_schedule(ctx, &iowq);
2565 __set_current_state(TASK_RUNNING);
2567 * Run task_work after scheduling and before io_should_wake().
2568 * If we got woken because of task_work being processed, run it
2569 * now rather than let the caller do another wait loop.
2572 if (!llist_empty(&ctx->work_llist))
2573 io_run_local_work(ctx);
2575 check_cq = READ_ONCE(ctx->check_cq);
2576 if (unlikely(check_cq)) {
2577 /* let the caller flush overflows, retry */
2578 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
2579 io_cqring_do_overflow_flush(ctx);
2580 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT)) {
2586 if (io_should_wake(&iowq)) {
2593 finish_wait(&ctx->cq_wait, &iowq.wq);
2594 restore_saved_sigmask_unless(ret == -EINTR);
2596 return READ_ONCE(rings->cq.head) == READ_ONCE(rings->cq.tail) ? ret : 0;
2599 static void io_mem_free(void *ptr)
2606 page = virt_to_head_page(ptr);
2607 if (put_page_testzero(page))
2608 free_compound_page(page);
2611 static void *io_mem_alloc(size_t size)
2613 gfp_t gfp = GFP_KERNEL_ACCOUNT | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP;
2615 return (void *) __get_free_pages(gfp, get_order(size));
2618 static unsigned long rings_size(struct io_ring_ctx *ctx, unsigned int sq_entries,
2619 unsigned int cq_entries, size_t *sq_offset)
2621 struct io_rings *rings;
2622 size_t off, sq_array_size;
2624 off = struct_size(rings, cqes, cq_entries);
2625 if (off == SIZE_MAX)
2627 if (ctx->flags & IORING_SETUP_CQE32) {
2628 if (check_shl_overflow(off, 1, &off))
2633 off = ALIGN(off, SMP_CACHE_BYTES);
2641 sq_array_size = array_size(sizeof(u32), sq_entries);
2642 if (sq_array_size == SIZE_MAX)
2645 if (check_add_overflow(off, sq_array_size, &off))
2651 static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg,
2652 unsigned int eventfd_async)
2654 struct io_ev_fd *ev_fd;
2655 __s32 __user *fds = arg;
2658 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2659 lockdep_is_held(&ctx->uring_lock));
2663 if (copy_from_user(&fd, fds, sizeof(*fds)))
2666 ev_fd = kmalloc(sizeof(*ev_fd), GFP_KERNEL);
2670 ev_fd->cq_ev_fd = eventfd_ctx_fdget(fd);
2671 if (IS_ERR(ev_fd->cq_ev_fd)) {
2672 int ret = PTR_ERR(ev_fd->cq_ev_fd);
2677 spin_lock(&ctx->completion_lock);
2678 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
2679 spin_unlock(&ctx->completion_lock);
2681 ev_fd->eventfd_async = eventfd_async;
2682 ctx->has_evfd = true;
2683 rcu_assign_pointer(ctx->io_ev_fd, ev_fd);
2684 atomic_set(&ev_fd->refs, 1);
2685 atomic_set(&ev_fd->ops, 0);
2689 static int io_eventfd_unregister(struct io_ring_ctx *ctx)
2691 struct io_ev_fd *ev_fd;
2693 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2694 lockdep_is_held(&ctx->uring_lock));
2696 ctx->has_evfd = false;
2697 rcu_assign_pointer(ctx->io_ev_fd, NULL);
2698 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_FREE_BIT), &ev_fd->ops))
2699 call_rcu(&ev_fd->rcu, io_eventfd_ops);
2706 static void io_req_caches_free(struct io_ring_ctx *ctx)
2710 mutex_lock(&ctx->uring_lock);
2711 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
2713 while (!io_req_cache_empty(ctx)) {
2714 struct io_kiocb *req = io_alloc_req(ctx);
2716 kmem_cache_free(req_cachep, req);
2720 percpu_ref_put_many(&ctx->refs, nr);
2721 mutex_unlock(&ctx->uring_lock);
2724 static __cold void io_ring_ctx_free(struct io_ring_ctx *ctx)
2726 io_sq_thread_finish(ctx);
2727 io_rsrc_refs_drop(ctx);
2728 /* __io_rsrc_put_work() may need uring_lock to progress, wait w/o it */
2729 io_wait_rsrc_data(ctx->buf_data);
2730 io_wait_rsrc_data(ctx->file_data);
2732 mutex_lock(&ctx->uring_lock);
2734 __io_sqe_buffers_unregister(ctx);
2736 __io_sqe_files_unregister(ctx);
2737 io_cqring_overflow_kill(ctx);
2738 io_eventfd_unregister(ctx);
2739 io_alloc_cache_free(&ctx->apoll_cache, io_apoll_cache_free);
2740 io_alloc_cache_free(&ctx->netmsg_cache, io_netmsg_cache_free);
2741 mutex_unlock(&ctx->uring_lock);
2742 io_destroy_buffers(ctx);
2744 put_cred(ctx->sq_creds);
2745 if (ctx->submitter_task)
2746 put_task_struct(ctx->submitter_task);
2748 /* there are no registered resources left, nobody uses it */
2750 io_rsrc_node_destroy(ctx->rsrc_node);
2751 if (ctx->rsrc_backup_node)
2752 io_rsrc_node_destroy(ctx->rsrc_backup_node);
2753 flush_delayed_work(&ctx->rsrc_put_work);
2754 flush_delayed_work(&ctx->fallback_work);
2756 WARN_ON_ONCE(!list_empty(&ctx->rsrc_ref_list));
2757 WARN_ON_ONCE(!llist_empty(&ctx->rsrc_put_llist));
2759 #if defined(CONFIG_UNIX)
2760 if (ctx->ring_sock) {
2761 ctx->ring_sock->file = NULL; /* so that iput() is called */
2762 sock_release(ctx->ring_sock);
2765 WARN_ON_ONCE(!list_empty(&ctx->ltimeout_list));
2767 if (ctx->mm_account) {
2768 mmdrop(ctx->mm_account);
2769 ctx->mm_account = NULL;
2771 io_mem_free(ctx->rings);
2772 io_mem_free(ctx->sq_sqes);
2774 percpu_ref_exit(&ctx->refs);
2775 free_uid(ctx->user);
2776 io_req_caches_free(ctx);
2778 io_wq_put_hash(ctx->hash_map);
2779 kfree(ctx->cancel_table.hbs);
2780 kfree(ctx->cancel_table_locked.hbs);
2781 kfree(ctx->dummy_ubuf);
2783 xa_destroy(&ctx->io_bl_xa);
2787 static __cold void io_activate_pollwq_cb(struct callback_head *cb)
2789 struct io_ring_ctx *ctx = container_of(cb, struct io_ring_ctx,
2792 mutex_lock(&ctx->uring_lock);
2793 ctx->poll_activated = true;
2794 mutex_unlock(&ctx->uring_lock);
2797 * Wake ups for some events between start of polling and activation
2798 * might've been lost due to loose synchronisation.
2800 wake_up_all(&ctx->poll_wq);
2801 percpu_ref_put(&ctx->refs);
2804 static __cold void io_activate_pollwq(struct io_ring_ctx *ctx)
2806 spin_lock(&ctx->completion_lock);
2807 /* already activated or in progress */
2808 if (ctx->poll_activated || ctx->poll_wq_task_work.func)
2810 if (WARN_ON_ONCE(!ctx->task_complete))
2812 if (!ctx->submitter_task)
2815 * with ->submitter_task only the submitter task completes requests, we
2816 * only need to sync with it, which is done by injecting a tw
2818 init_task_work(&ctx->poll_wq_task_work, io_activate_pollwq_cb);
2819 percpu_ref_get(&ctx->refs);
2820 if (task_work_add(ctx->submitter_task, &ctx->poll_wq_task_work, TWA_SIGNAL))
2821 percpu_ref_put(&ctx->refs);
2823 spin_unlock(&ctx->completion_lock);
2826 static __poll_t io_uring_poll(struct file *file, poll_table *wait)
2828 struct io_ring_ctx *ctx = file->private_data;
2831 if (unlikely(!ctx->poll_activated))
2832 io_activate_pollwq(ctx);
2834 poll_wait(file, &ctx->poll_wq, wait);
2836 * synchronizes with barrier from wq_has_sleeper call in
2840 if (!io_sqring_full(ctx))
2841 mask |= EPOLLOUT | EPOLLWRNORM;
2844 * Don't flush cqring overflow list here, just do a simple check.
2845 * Otherwise there could possible be ABBA deadlock:
2848 * lock(&ctx->uring_lock);
2850 * lock(&ctx->uring_lock);
2853 * Users may get EPOLLIN meanwhile seeing nothing in cqring, this
2854 * pushes them to do the flush.
2857 if (io_cqring_events(ctx) || io_has_work(ctx))
2858 mask |= EPOLLIN | EPOLLRDNORM;
2863 static int io_unregister_personality(struct io_ring_ctx *ctx, unsigned id)
2865 const struct cred *creds;
2867 creds = xa_erase(&ctx->personalities, id);
2876 struct io_tctx_exit {
2877 struct callback_head task_work;
2878 struct completion completion;
2879 struct io_ring_ctx *ctx;
2882 static __cold void io_tctx_exit_cb(struct callback_head *cb)
2884 struct io_uring_task *tctx = current->io_uring;
2885 struct io_tctx_exit *work;
2887 work = container_of(cb, struct io_tctx_exit, task_work);
2889 * When @in_idle, we're in cancellation and it's racy to remove the
2890 * node. It'll be removed by the end of cancellation, just ignore it.
2891 * tctx can be NULL if the queueing of this task_work raced with
2892 * work cancelation off the exec path.
2894 if (tctx && !atomic_read(&tctx->in_idle))
2895 io_uring_del_tctx_node((unsigned long)work->ctx);
2896 complete(&work->completion);
2899 static __cold bool io_cancel_ctx_cb(struct io_wq_work *work, void *data)
2901 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
2903 return req->ctx == data;
2906 static __cold void io_ring_exit_work(struct work_struct *work)
2908 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, exit_work);
2909 unsigned long timeout = jiffies + HZ * 60 * 5;
2910 unsigned long interval = HZ / 20;
2911 struct io_tctx_exit exit;
2912 struct io_tctx_node *node;
2916 * If we're doing polled IO and end up having requests being
2917 * submitted async (out-of-line), then completions can come in while
2918 * we're waiting for refs to drop. We need to reap these manually,
2919 * as nobody else will be looking for them.
2922 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) {
2923 mutex_lock(&ctx->uring_lock);
2924 io_cqring_overflow_kill(ctx);
2925 mutex_unlock(&ctx->uring_lock);
2928 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
2929 io_move_task_work_from_local(ctx);
2931 while (io_uring_try_cancel_requests(ctx, NULL, true))
2935 struct io_sq_data *sqd = ctx->sq_data;
2936 struct task_struct *tsk;
2938 io_sq_thread_park(sqd);
2940 if (tsk && tsk->io_uring && tsk->io_uring->io_wq)
2941 io_wq_cancel_cb(tsk->io_uring->io_wq,
2942 io_cancel_ctx_cb, ctx, true);
2943 io_sq_thread_unpark(sqd);
2946 io_req_caches_free(ctx);
2948 if (WARN_ON_ONCE(time_after(jiffies, timeout))) {
2949 /* there is little hope left, don't run it too often */
2952 } while (!wait_for_completion_timeout(&ctx->ref_comp, interval));
2954 init_completion(&exit.completion);
2955 init_task_work(&exit.task_work, io_tctx_exit_cb);
2958 * Some may use context even when all refs and requests have been put,
2959 * and they are free to do so while still holding uring_lock or
2960 * completion_lock, see io_req_task_submit(). Apart from other work,
2961 * this lock/unlock section also waits them to finish.
2963 mutex_lock(&ctx->uring_lock);
2964 while (!list_empty(&ctx->tctx_list)) {
2965 WARN_ON_ONCE(time_after(jiffies, timeout));
2967 node = list_first_entry(&ctx->tctx_list, struct io_tctx_node,
2969 /* don't spin on a single task if cancellation failed */
2970 list_rotate_left(&ctx->tctx_list);
2971 ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL);
2972 if (WARN_ON_ONCE(ret))
2975 mutex_unlock(&ctx->uring_lock);
2976 wait_for_completion(&exit.completion);
2977 mutex_lock(&ctx->uring_lock);
2979 mutex_unlock(&ctx->uring_lock);
2980 spin_lock(&ctx->completion_lock);
2981 spin_unlock(&ctx->completion_lock);
2983 io_ring_ctx_free(ctx);
2986 static __cold void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx)
2988 unsigned long index;
2989 struct creds *creds;
2991 mutex_lock(&ctx->uring_lock);
2992 percpu_ref_kill(&ctx->refs);
2993 xa_for_each(&ctx->personalities, index, creds)
2994 io_unregister_personality(ctx, index);
2996 io_poll_remove_all(ctx, NULL, true);
2997 mutex_unlock(&ctx->uring_lock);
3000 * If we failed setting up the ctx, we might not have any rings
3001 * and therefore did not submit any requests
3004 io_kill_timeouts(ctx, NULL, true);
3006 INIT_WORK(&ctx->exit_work, io_ring_exit_work);
3008 * Use system_unbound_wq to avoid spawning tons of event kworkers
3009 * if we're exiting a ton of rings at the same time. It just adds
3010 * noise and overhead, there's no discernable change in runtime
3011 * over using system_wq.
3013 queue_work(system_unbound_wq, &ctx->exit_work);
3016 static int io_uring_release(struct inode *inode, struct file *file)
3018 struct io_ring_ctx *ctx = file->private_data;
3020 file->private_data = NULL;
3021 io_ring_ctx_wait_and_kill(ctx);
3025 struct io_task_cancel {
3026 struct task_struct *task;
3030 static bool io_cancel_task_cb(struct io_wq_work *work, void *data)
3032 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
3033 struct io_task_cancel *cancel = data;
3035 return io_match_task_safe(req, cancel->task, cancel->all);
3038 static __cold bool io_cancel_defer_files(struct io_ring_ctx *ctx,
3039 struct task_struct *task,
3042 struct io_defer_entry *de;
3045 spin_lock(&ctx->completion_lock);
3046 list_for_each_entry_reverse(de, &ctx->defer_list, list) {
3047 if (io_match_task_safe(de->req, task, cancel_all)) {
3048 list_cut_position(&list, &ctx->defer_list, &de->list);
3052 spin_unlock(&ctx->completion_lock);
3053 if (list_empty(&list))
3056 while (!list_empty(&list)) {
3057 de = list_first_entry(&list, struct io_defer_entry, list);
3058 list_del_init(&de->list);
3059 io_req_task_queue_fail(de->req, -ECANCELED);
3065 static __cold bool io_uring_try_cancel_iowq(struct io_ring_ctx *ctx)
3067 struct io_tctx_node *node;
3068 enum io_wq_cancel cret;
3071 mutex_lock(&ctx->uring_lock);
3072 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
3073 struct io_uring_task *tctx = node->task->io_uring;
3076 * io_wq will stay alive while we hold uring_lock, because it's
3077 * killed after ctx nodes, which requires to take the lock.
3079 if (!tctx || !tctx->io_wq)
3081 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_ctx_cb, ctx, true);
3082 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3084 mutex_unlock(&ctx->uring_lock);
3089 static __cold bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
3090 struct task_struct *task,
3093 struct io_task_cancel cancel = { .task = task, .all = cancel_all, };
3094 struct io_uring_task *tctx = task ? task->io_uring : NULL;
3095 enum io_wq_cancel cret;
3098 /* failed during ring init, it couldn't have issued any requests */
3103 ret |= io_uring_try_cancel_iowq(ctx);
3104 } else if (tctx && tctx->io_wq) {
3106 * Cancels requests of all rings, not only @ctx, but
3107 * it's fine as the task is in exit/exec.
3109 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_task_cb,
3111 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3114 /* SQPOLL thread does its own polling */
3115 if ((!(ctx->flags & IORING_SETUP_SQPOLL) && cancel_all) ||
3116 (ctx->sq_data && ctx->sq_data->thread == current)) {
3117 while (!wq_list_empty(&ctx->iopoll_list)) {
3118 io_iopoll_try_reap_events(ctx);
3123 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3124 io_allowed_defer_tw_run(ctx))
3125 ret |= io_run_local_work(ctx) > 0;
3126 ret |= io_cancel_defer_files(ctx, task, cancel_all);
3127 mutex_lock(&ctx->uring_lock);
3128 ret |= io_poll_remove_all(ctx, task, cancel_all);
3129 mutex_unlock(&ctx->uring_lock);
3130 ret |= io_kill_timeouts(ctx, task, cancel_all);
3132 ret |= io_run_task_work() > 0;
3136 static s64 tctx_inflight(struct io_uring_task *tctx, bool tracked)
3139 return atomic_read(&tctx->inflight_tracked);
3140 return percpu_counter_sum(&tctx->inflight);
3144 * Find any io_uring ctx that this task has registered or done IO on, and cancel
3145 * requests. @sqd should be not-null IFF it's an SQPOLL thread cancellation.
3147 __cold void io_uring_cancel_generic(bool cancel_all, struct io_sq_data *sqd)
3149 struct io_uring_task *tctx = current->io_uring;
3150 struct io_ring_ctx *ctx;
3154 WARN_ON_ONCE(sqd && sqd->thread != current);
3156 if (!current->io_uring)
3159 io_wq_exit_start(tctx->io_wq);
3161 atomic_inc(&tctx->in_idle);
3165 io_uring_drop_tctx_refs(current);
3166 /* read completions before cancelations */
3167 inflight = tctx_inflight(tctx, !cancel_all);
3172 struct io_tctx_node *node;
3173 unsigned long index;
3175 xa_for_each(&tctx->xa, index, node) {
3176 /* sqpoll task will cancel all its requests */
3177 if (node->ctx->sq_data)
3179 loop |= io_uring_try_cancel_requests(node->ctx,
3180 current, cancel_all);
3183 list_for_each_entry(ctx, &sqd->ctx_list, sqd_list)
3184 loop |= io_uring_try_cancel_requests(ctx,
3194 prepare_to_wait(&tctx->wait, &wait, TASK_INTERRUPTIBLE);
3196 io_uring_drop_tctx_refs(current);
3199 * If we've seen completions, retry without waiting. This
3200 * avoids a race where a completion comes in before we did
3201 * prepare_to_wait().
3203 if (inflight == tctx_inflight(tctx, !cancel_all))
3205 finish_wait(&tctx->wait, &wait);
3208 io_uring_clean_tctx(tctx);
3211 * We shouldn't run task_works after cancel, so just leave
3212 * ->in_idle set for normal exit.
3214 atomic_dec(&tctx->in_idle);
3215 /* for exec all current's requests should be gone, kill tctx */
3216 __io_uring_free(current);
3220 void __io_uring_cancel(bool cancel_all)
3222 io_uring_cancel_generic(cancel_all, NULL);
3225 static void *io_uring_validate_mmap_request(struct file *file,
3226 loff_t pgoff, size_t sz)
3228 struct io_ring_ctx *ctx = file->private_data;
3229 loff_t offset = pgoff << PAGE_SHIFT;
3234 case IORING_OFF_SQ_RING:
3235 case IORING_OFF_CQ_RING:
3238 case IORING_OFF_SQES:
3242 return ERR_PTR(-EINVAL);
3245 page = virt_to_head_page(ptr);
3246 if (sz > page_size(page))
3247 return ERR_PTR(-EINVAL);
3254 static __cold int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3256 size_t sz = vma->vm_end - vma->vm_start;
3260 ptr = io_uring_validate_mmap_request(file, vma->vm_pgoff, sz);
3262 return PTR_ERR(ptr);
3264 pfn = virt_to_phys(ptr) >> PAGE_SHIFT;
3265 return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot);
3268 #else /* !CONFIG_MMU */
3270 static int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3272 return vma->vm_flags & (VM_SHARED | VM_MAYSHARE) ? 0 : -EINVAL;
3275 static unsigned int io_uring_nommu_mmap_capabilities(struct file *file)
3277 return NOMMU_MAP_DIRECT | NOMMU_MAP_READ | NOMMU_MAP_WRITE;
3280 static unsigned long io_uring_nommu_get_unmapped_area(struct file *file,
3281 unsigned long addr, unsigned long len,
3282 unsigned long pgoff, unsigned long flags)
3286 ptr = io_uring_validate_mmap_request(file, pgoff, len);
3288 return PTR_ERR(ptr);
3290 return (unsigned long) ptr;
3293 #endif /* !CONFIG_MMU */
3295 static int io_validate_ext_arg(unsigned flags, const void __user *argp, size_t argsz)
3297 if (flags & IORING_ENTER_EXT_ARG) {
3298 struct io_uring_getevents_arg arg;
3300 if (argsz != sizeof(arg))
3302 if (copy_from_user(&arg, argp, sizeof(arg)))
3308 static int io_get_ext_arg(unsigned flags, const void __user *argp, size_t *argsz,
3309 struct __kernel_timespec __user **ts,
3310 const sigset_t __user **sig)
3312 struct io_uring_getevents_arg arg;
3315 * If EXT_ARG isn't set, then we have no timespec and the argp pointer
3316 * is just a pointer to the sigset_t.
3318 if (!(flags & IORING_ENTER_EXT_ARG)) {
3319 *sig = (const sigset_t __user *) argp;
3325 * EXT_ARG is set - ensure we agree on the size of it and copy in our
3326 * timespec and sigset_t pointers if good.
3328 if (*argsz != sizeof(arg))
3330 if (copy_from_user(&arg, argp, sizeof(arg)))
3334 *sig = u64_to_user_ptr(arg.sigmask);
3335 *argsz = arg.sigmask_sz;
3336 *ts = u64_to_user_ptr(arg.ts);
3340 SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit,
3341 u32, min_complete, u32, flags, const void __user *, argp,
3344 struct io_ring_ctx *ctx;
3348 if (unlikely(flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP |
3349 IORING_ENTER_SQ_WAIT | IORING_ENTER_EXT_ARG |
3350 IORING_ENTER_REGISTERED_RING)))
3354 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
3355 * need only dereference our task private array to find it.
3357 if (flags & IORING_ENTER_REGISTERED_RING) {
3358 struct io_uring_task *tctx = current->io_uring;
3360 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
3362 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
3363 f.file = tctx->registered_rings[fd];
3365 if (unlikely(!f.file))
3369 if (unlikely(!f.file))
3372 if (unlikely(!io_is_uring_fops(f.file)))
3376 ctx = f.file->private_data;
3378 if (unlikely(ctx->flags & IORING_SETUP_R_DISABLED))
3382 * For SQ polling, the thread will do all submissions and completions.
3383 * Just return the requested submit count, and wake the thread if
3387 if (ctx->flags & IORING_SETUP_SQPOLL) {
3388 io_cqring_overflow_flush(ctx);
3390 if (unlikely(ctx->sq_data->thread == NULL)) {
3394 if (flags & IORING_ENTER_SQ_WAKEUP)
3395 wake_up(&ctx->sq_data->wait);
3396 if (flags & IORING_ENTER_SQ_WAIT) {
3397 ret = io_sqpoll_wait_sq(ctx);
3402 } else if (to_submit) {
3403 ret = io_uring_add_tctx_node(ctx);
3407 mutex_lock(&ctx->uring_lock);
3408 ret = io_submit_sqes(ctx, to_submit);
3409 if (ret != to_submit) {
3410 mutex_unlock(&ctx->uring_lock);
3413 if (flags & IORING_ENTER_GETEVENTS) {
3414 if (ctx->syscall_iopoll)
3417 * Ignore errors, we'll soon call io_cqring_wait() and
3418 * it should handle ownership problems if any.
3420 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
3421 (void)io_run_local_work_locked(ctx);
3423 mutex_unlock(&ctx->uring_lock);
3426 if (flags & IORING_ENTER_GETEVENTS) {
3429 if (ctx->syscall_iopoll) {
3431 * We disallow the app entering submit/complete with
3432 * polling, but we still need to lock the ring to
3433 * prevent racing with polled issue that got punted to
3436 mutex_lock(&ctx->uring_lock);
3438 ret2 = io_validate_ext_arg(flags, argp, argsz);
3439 if (likely(!ret2)) {
3440 min_complete = min(min_complete,
3442 ret2 = io_iopoll_check(ctx, min_complete);
3444 mutex_unlock(&ctx->uring_lock);
3446 const sigset_t __user *sig;
3447 struct __kernel_timespec __user *ts;
3449 ret2 = io_get_ext_arg(flags, argp, &argsz, &ts, &sig);
3450 if (likely(!ret2)) {
3451 min_complete = min(min_complete,
3453 ret2 = io_cqring_wait(ctx, min_complete, sig,
3462 * EBADR indicates that one or more CQE were dropped.
3463 * Once the user has been informed we can clear the bit
3464 * as they are obviously ok with those drops.
3466 if (unlikely(ret2 == -EBADR))
3467 clear_bit(IO_CHECK_CQ_DROPPED_BIT,
3476 static const struct file_operations io_uring_fops = {
3477 .release = io_uring_release,
3478 .mmap = io_uring_mmap,
3480 .get_unmapped_area = io_uring_nommu_get_unmapped_area,
3481 .mmap_capabilities = io_uring_nommu_mmap_capabilities,
3483 .poll = io_uring_poll,
3484 #ifdef CONFIG_PROC_FS
3485 .show_fdinfo = io_uring_show_fdinfo,
3489 bool io_is_uring_fops(struct file *file)
3491 return file->f_op == &io_uring_fops;
3494 static __cold int io_allocate_scq_urings(struct io_ring_ctx *ctx,
3495 struct io_uring_params *p)
3497 struct io_rings *rings;
3498 size_t size, sq_array_offset;
3500 /* make sure these are sane, as we already accounted them */
3501 ctx->sq_entries = p->sq_entries;
3502 ctx->cq_entries = p->cq_entries;
3504 size = rings_size(ctx, p->sq_entries, p->cq_entries, &sq_array_offset);
3505 if (size == SIZE_MAX)
3508 rings = io_mem_alloc(size);
3513 ctx->sq_array = (u32 *)((char *)rings + sq_array_offset);
3514 rings->sq_ring_mask = p->sq_entries - 1;
3515 rings->cq_ring_mask = p->cq_entries - 1;
3516 rings->sq_ring_entries = p->sq_entries;
3517 rings->cq_ring_entries = p->cq_entries;
3519 if (p->flags & IORING_SETUP_SQE128)
3520 size = array_size(2 * sizeof(struct io_uring_sqe), p->sq_entries);
3522 size = array_size(sizeof(struct io_uring_sqe), p->sq_entries);
3523 if (size == SIZE_MAX) {
3524 io_mem_free(ctx->rings);
3529 ctx->sq_sqes = io_mem_alloc(size);
3530 if (!ctx->sq_sqes) {
3531 io_mem_free(ctx->rings);
3539 static int io_uring_install_fd(struct io_ring_ctx *ctx, struct file *file)
3543 fd = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
3547 ret = __io_uring_add_tctx_node(ctx);
3552 fd_install(fd, file);
3557 * Allocate an anonymous fd, this is what constitutes the application
3558 * visible backing of an io_uring instance. The application mmaps this
3559 * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled,
3560 * we have to tie this fd to a socket for file garbage collection purposes.
3562 static struct file *io_uring_get_file(struct io_ring_ctx *ctx)
3565 #if defined(CONFIG_UNIX)
3568 ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP,
3571 return ERR_PTR(ret);
3574 file = anon_inode_getfile_secure("[io_uring]", &io_uring_fops, ctx,
3575 O_RDWR | O_CLOEXEC, NULL);
3576 #if defined(CONFIG_UNIX)
3578 sock_release(ctx->ring_sock);
3579 ctx->ring_sock = NULL;
3581 ctx->ring_sock->file = file;
3587 static __cold int io_uring_create(unsigned entries, struct io_uring_params *p,
3588 struct io_uring_params __user *params)
3590 struct io_ring_ctx *ctx;
3596 if (entries > IORING_MAX_ENTRIES) {
3597 if (!(p->flags & IORING_SETUP_CLAMP))
3599 entries = IORING_MAX_ENTRIES;
3603 * Use twice as many entries for the CQ ring. It's possible for the
3604 * application to drive a higher depth than the size of the SQ ring,
3605 * since the sqes are only used at submission time. This allows for
3606 * some flexibility in overcommitting a bit. If the application has
3607 * set IORING_SETUP_CQSIZE, it will have passed in the desired number
3608 * of CQ ring entries manually.
3610 p->sq_entries = roundup_pow_of_two(entries);
3611 if (p->flags & IORING_SETUP_CQSIZE) {
3613 * If IORING_SETUP_CQSIZE is set, we do the same roundup
3614 * to a power-of-two, if it isn't already. We do NOT impose
3615 * any cq vs sq ring sizing.
3619 if (p->cq_entries > IORING_MAX_CQ_ENTRIES) {
3620 if (!(p->flags & IORING_SETUP_CLAMP))
3622 p->cq_entries = IORING_MAX_CQ_ENTRIES;
3624 p->cq_entries = roundup_pow_of_two(p->cq_entries);
3625 if (p->cq_entries < p->sq_entries)
3628 p->cq_entries = 2 * p->sq_entries;
3631 ctx = io_ring_ctx_alloc(p);
3635 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3636 !(ctx->flags & IORING_SETUP_IOPOLL) &&
3637 !(ctx->flags & IORING_SETUP_SQPOLL))
3638 ctx->task_complete = true;
3641 * lazy poll_wq activation relies on ->task_complete for synchronisation
3642 * purposes, see io_activate_pollwq()
3644 if (!ctx->task_complete)
3645 ctx->poll_activated = true;
3648 * When SETUP_IOPOLL and SETUP_SQPOLL are both enabled, user
3649 * space applications don't need to do io completion events
3650 * polling again, they can rely on io_sq_thread to do polling
3651 * work, which can reduce cpu usage and uring_lock contention.
3653 if (ctx->flags & IORING_SETUP_IOPOLL &&
3654 !(ctx->flags & IORING_SETUP_SQPOLL))
3655 ctx->syscall_iopoll = 1;
3657 ctx->compat = in_compat_syscall();
3658 if (!capable(CAP_IPC_LOCK))
3659 ctx->user = get_uid(current_user());
3662 * For SQPOLL, we just need a wakeup, always. For !SQPOLL, if
3663 * COOP_TASKRUN is set, then IPIs are never needed by the app.
3666 if (ctx->flags & IORING_SETUP_SQPOLL) {
3667 /* IPI related flags don't make sense with SQPOLL */
3668 if (ctx->flags & (IORING_SETUP_COOP_TASKRUN |
3669 IORING_SETUP_TASKRUN_FLAG |
3670 IORING_SETUP_DEFER_TASKRUN))
3672 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3673 } else if (ctx->flags & IORING_SETUP_COOP_TASKRUN) {
3674 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3676 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG &&
3677 !(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
3679 ctx->notify_method = TWA_SIGNAL;
3683 * For DEFER_TASKRUN we require the completion task to be the same as the
3684 * submission task. This implies that there is only one submitter, so enforce
3687 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN &&
3688 !(ctx->flags & IORING_SETUP_SINGLE_ISSUER)) {
3693 * This is just grabbed for accounting purposes. When a process exits,
3694 * the mm is exited and dropped before the files, hence we need to hang
3695 * on to this mm purely for the purposes of being able to unaccount
3696 * memory (locked/pinned vm). It's not used for anything else.
3698 mmgrab(current->mm);
3699 ctx->mm_account = current->mm;
3701 ret = io_allocate_scq_urings(ctx, p);
3705 ret = io_sq_offload_create(ctx, p);
3708 /* always set a rsrc node */
3709 ret = io_rsrc_node_switch_start(ctx);
3712 io_rsrc_node_switch(ctx, NULL);
3714 memset(&p->sq_off, 0, sizeof(p->sq_off));
3715 p->sq_off.head = offsetof(struct io_rings, sq.head);
3716 p->sq_off.tail = offsetof(struct io_rings, sq.tail);
3717 p->sq_off.ring_mask = offsetof(struct io_rings, sq_ring_mask);
3718 p->sq_off.ring_entries = offsetof(struct io_rings, sq_ring_entries);
3719 p->sq_off.flags = offsetof(struct io_rings, sq_flags);
3720 p->sq_off.dropped = offsetof(struct io_rings, sq_dropped);
3721 p->sq_off.array = (char *)ctx->sq_array - (char *)ctx->rings;
3723 memset(&p->cq_off, 0, sizeof(p->cq_off));
3724 p->cq_off.head = offsetof(struct io_rings, cq.head);
3725 p->cq_off.tail = offsetof(struct io_rings, cq.tail);
3726 p->cq_off.ring_mask = offsetof(struct io_rings, cq_ring_mask);
3727 p->cq_off.ring_entries = offsetof(struct io_rings, cq_ring_entries);
3728 p->cq_off.overflow = offsetof(struct io_rings, cq_overflow);
3729 p->cq_off.cqes = offsetof(struct io_rings, cqes);
3730 p->cq_off.flags = offsetof(struct io_rings, cq_flags);
3732 p->features = IORING_FEAT_SINGLE_MMAP | IORING_FEAT_NODROP |
3733 IORING_FEAT_SUBMIT_STABLE | IORING_FEAT_RW_CUR_POS |
3734 IORING_FEAT_CUR_PERSONALITY | IORING_FEAT_FAST_POLL |
3735 IORING_FEAT_POLL_32BITS | IORING_FEAT_SQPOLL_NONFIXED |
3736 IORING_FEAT_EXT_ARG | IORING_FEAT_NATIVE_WORKERS |
3737 IORING_FEAT_RSRC_TAGS | IORING_FEAT_CQE_SKIP |
3738 IORING_FEAT_LINKED_FILE;
3740 if (copy_to_user(params, p, sizeof(*p))) {
3745 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER
3746 && !(ctx->flags & IORING_SETUP_R_DISABLED))
3747 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
3749 file = io_uring_get_file(ctx);
3751 ret = PTR_ERR(file);
3756 * Install ring fd as the very last thing, so we don't risk someone
3757 * having closed it before we finish setup
3759 ret = io_uring_install_fd(ctx, file);
3761 /* fput will clean it up */
3766 trace_io_uring_create(ret, ctx, p->sq_entries, p->cq_entries, p->flags);
3769 io_ring_ctx_wait_and_kill(ctx);
3774 * Sets up an aio uring context, and returns the fd. Applications asks for a
3775 * ring size, we return the actual sq/cq ring sizes (among other things) in the
3776 * params structure passed in.
3778 static long io_uring_setup(u32 entries, struct io_uring_params __user *params)
3780 struct io_uring_params p;
3783 if (copy_from_user(&p, params, sizeof(p)))
3785 for (i = 0; i < ARRAY_SIZE(p.resv); i++) {
3790 if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL |
3791 IORING_SETUP_SQ_AFF | IORING_SETUP_CQSIZE |
3792 IORING_SETUP_CLAMP | IORING_SETUP_ATTACH_WQ |
3793 IORING_SETUP_R_DISABLED | IORING_SETUP_SUBMIT_ALL |
3794 IORING_SETUP_COOP_TASKRUN | IORING_SETUP_TASKRUN_FLAG |
3795 IORING_SETUP_SQE128 | IORING_SETUP_CQE32 |
3796 IORING_SETUP_SINGLE_ISSUER | IORING_SETUP_DEFER_TASKRUN))
3799 return io_uring_create(entries, &p, params);
3802 SYSCALL_DEFINE2(io_uring_setup, u32, entries,
3803 struct io_uring_params __user *, params)
3805 return io_uring_setup(entries, params);
3808 static __cold int io_probe(struct io_ring_ctx *ctx, void __user *arg,
3811 struct io_uring_probe *p;
3815 size = struct_size(p, ops, nr_args);
3816 if (size == SIZE_MAX)
3818 p = kzalloc(size, GFP_KERNEL);
3823 if (copy_from_user(p, arg, size))
3826 if (memchr_inv(p, 0, size))
3829 p->last_op = IORING_OP_LAST - 1;
3830 if (nr_args > IORING_OP_LAST)
3831 nr_args = IORING_OP_LAST;
3833 for (i = 0; i < nr_args; i++) {
3835 if (!io_op_defs[i].not_supported)
3836 p->ops[i].flags = IO_URING_OP_SUPPORTED;
3841 if (copy_to_user(arg, p, size))
3848 static int io_register_personality(struct io_ring_ctx *ctx)
3850 const struct cred *creds;
3854 creds = get_current_cred();
3856 ret = xa_alloc_cyclic(&ctx->personalities, &id, (void *)creds,
3857 XA_LIMIT(0, USHRT_MAX), &ctx->pers_next, GFP_KERNEL);
3865 static __cold int io_register_restrictions(struct io_ring_ctx *ctx,
3866 void __user *arg, unsigned int nr_args)
3868 struct io_uring_restriction *res;
3872 /* Restrictions allowed only if rings started disabled */
3873 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
3876 /* We allow only a single restrictions registration */
3877 if (ctx->restrictions.registered)
3880 if (!arg || nr_args > IORING_MAX_RESTRICTIONS)
3883 size = array_size(nr_args, sizeof(*res));
3884 if (size == SIZE_MAX)
3887 res = memdup_user(arg, size);
3889 return PTR_ERR(res);
3893 for (i = 0; i < nr_args; i++) {
3894 switch (res[i].opcode) {
3895 case IORING_RESTRICTION_REGISTER_OP:
3896 if (res[i].register_op >= IORING_REGISTER_LAST) {
3901 __set_bit(res[i].register_op,
3902 ctx->restrictions.register_op);
3904 case IORING_RESTRICTION_SQE_OP:
3905 if (res[i].sqe_op >= IORING_OP_LAST) {
3910 __set_bit(res[i].sqe_op, ctx->restrictions.sqe_op);
3912 case IORING_RESTRICTION_SQE_FLAGS_ALLOWED:
3913 ctx->restrictions.sqe_flags_allowed = res[i].sqe_flags;
3915 case IORING_RESTRICTION_SQE_FLAGS_REQUIRED:
3916 ctx->restrictions.sqe_flags_required = res[i].sqe_flags;
3925 /* Reset all restrictions if an error happened */
3927 memset(&ctx->restrictions, 0, sizeof(ctx->restrictions));
3929 ctx->restrictions.registered = true;
3935 static int io_register_enable_rings(struct io_ring_ctx *ctx)
3937 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
3940 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER && !ctx->submitter_task) {
3941 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
3943 * Lazy activation attempts would fail if it was polled before
3944 * submitter_task is set.
3946 if (wq_has_sleeper(&ctx->poll_wq))
3947 io_activate_pollwq(ctx);
3950 if (ctx->restrictions.registered)
3951 ctx->restricted = 1;
3953 ctx->flags &= ~IORING_SETUP_R_DISABLED;
3954 if (ctx->sq_data && wq_has_sleeper(&ctx->sq_data->wait))
3955 wake_up(&ctx->sq_data->wait);
3959 static __cold int io_register_iowq_aff(struct io_ring_ctx *ctx,
3960 void __user *arg, unsigned len)
3962 struct io_uring_task *tctx = current->io_uring;
3963 cpumask_var_t new_mask;
3966 if (!tctx || !tctx->io_wq)
3969 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
3972 cpumask_clear(new_mask);
3973 if (len > cpumask_size())
3974 len = cpumask_size();
3976 if (in_compat_syscall()) {
3977 ret = compat_get_bitmap(cpumask_bits(new_mask),
3978 (const compat_ulong_t __user *)arg,
3979 len * 8 /* CHAR_BIT */);
3981 ret = copy_from_user(new_mask, arg, len);
3985 free_cpumask_var(new_mask);
3989 ret = io_wq_cpu_affinity(tctx->io_wq, new_mask);
3990 free_cpumask_var(new_mask);
3994 static __cold int io_unregister_iowq_aff(struct io_ring_ctx *ctx)
3996 struct io_uring_task *tctx = current->io_uring;
3998 if (!tctx || !tctx->io_wq)
4001 return io_wq_cpu_affinity(tctx->io_wq, NULL);
4004 static __cold int io_register_iowq_max_workers(struct io_ring_ctx *ctx,
4006 __must_hold(&ctx->uring_lock)
4008 struct io_tctx_node *node;
4009 struct io_uring_task *tctx = NULL;
4010 struct io_sq_data *sqd = NULL;
4014 if (copy_from_user(new_count, arg, sizeof(new_count)))
4016 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4017 if (new_count[i] > INT_MAX)
4020 if (ctx->flags & IORING_SETUP_SQPOLL) {
4024 * Observe the correct sqd->lock -> ctx->uring_lock
4025 * ordering. Fine to drop uring_lock here, we hold
4028 refcount_inc(&sqd->refs);
4029 mutex_unlock(&ctx->uring_lock);
4030 mutex_lock(&sqd->lock);
4031 mutex_lock(&ctx->uring_lock);
4033 tctx = sqd->thread->io_uring;
4036 tctx = current->io_uring;
4039 BUILD_BUG_ON(sizeof(new_count) != sizeof(ctx->iowq_limits));
4041 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4043 ctx->iowq_limits[i] = new_count[i];
4044 ctx->iowq_limits_set = true;
4046 if (tctx && tctx->io_wq) {
4047 ret = io_wq_max_workers(tctx->io_wq, new_count);
4051 memset(new_count, 0, sizeof(new_count));
4055 mutex_unlock(&sqd->lock);
4056 io_put_sq_data(sqd);
4059 if (copy_to_user(arg, new_count, sizeof(new_count)))
4062 /* that's it for SQPOLL, only the SQPOLL task creates requests */
4066 /* now propagate the restriction to all registered users */
4067 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
4068 struct io_uring_task *tctx = node->task->io_uring;
4070 if (WARN_ON_ONCE(!tctx->io_wq))
4073 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4074 new_count[i] = ctx->iowq_limits[i];
4075 /* ignore errors, it always returns zero anyway */
4076 (void)io_wq_max_workers(tctx->io_wq, new_count);
4081 mutex_unlock(&sqd->lock);
4082 io_put_sq_data(sqd);
4087 static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode,
4088 void __user *arg, unsigned nr_args)
4089 __releases(ctx->uring_lock)
4090 __acquires(ctx->uring_lock)
4095 * We don't quiesce the refs for register anymore and so it can't be
4096 * dying as we're holding a file ref here.
4098 if (WARN_ON_ONCE(percpu_ref_is_dying(&ctx->refs)))
4101 if (ctx->submitter_task && ctx->submitter_task != current)
4104 if (ctx->restricted) {
4105 opcode = array_index_nospec(opcode, IORING_REGISTER_LAST);
4106 if (!test_bit(opcode, ctx->restrictions.register_op))
4111 case IORING_REGISTER_BUFFERS:
4115 ret = io_sqe_buffers_register(ctx, arg, nr_args, NULL);
4117 case IORING_UNREGISTER_BUFFERS:
4121 ret = io_sqe_buffers_unregister(ctx);
4123 case IORING_REGISTER_FILES:
4127 ret = io_sqe_files_register(ctx, arg, nr_args, NULL);
4129 case IORING_UNREGISTER_FILES:
4133 ret = io_sqe_files_unregister(ctx);
4135 case IORING_REGISTER_FILES_UPDATE:
4136 ret = io_register_files_update(ctx, arg, nr_args);
4138 case IORING_REGISTER_EVENTFD:
4142 ret = io_eventfd_register(ctx, arg, 0);
4144 case IORING_REGISTER_EVENTFD_ASYNC:
4148 ret = io_eventfd_register(ctx, arg, 1);
4150 case IORING_UNREGISTER_EVENTFD:
4154 ret = io_eventfd_unregister(ctx);
4156 case IORING_REGISTER_PROBE:
4158 if (!arg || nr_args > 256)
4160 ret = io_probe(ctx, arg, nr_args);
4162 case IORING_REGISTER_PERSONALITY:
4166 ret = io_register_personality(ctx);
4168 case IORING_UNREGISTER_PERSONALITY:
4172 ret = io_unregister_personality(ctx, nr_args);
4174 case IORING_REGISTER_ENABLE_RINGS:
4178 ret = io_register_enable_rings(ctx);
4180 case IORING_REGISTER_RESTRICTIONS:
4181 ret = io_register_restrictions(ctx, arg, nr_args);
4183 case IORING_REGISTER_FILES2:
4184 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_FILE);
4186 case IORING_REGISTER_FILES_UPDATE2:
4187 ret = io_register_rsrc_update(ctx, arg, nr_args,
4190 case IORING_REGISTER_BUFFERS2:
4191 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_BUFFER);
4193 case IORING_REGISTER_BUFFERS_UPDATE:
4194 ret = io_register_rsrc_update(ctx, arg, nr_args,
4195 IORING_RSRC_BUFFER);
4197 case IORING_REGISTER_IOWQ_AFF:
4199 if (!arg || !nr_args)
4201 ret = io_register_iowq_aff(ctx, arg, nr_args);
4203 case IORING_UNREGISTER_IOWQ_AFF:
4207 ret = io_unregister_iowq_aff(ctx);
4209 case IORING_REGISTER_IOWQ_MAX_WORKERS:
4211 if (!arg || nr_args != 2)
4213 ret = io_register_iowq_max_workers(ctx, arg);
4215 case IORING_REGISTER_RING_FDS:
4216 ret = io_ringfd_register(ctx, arg, nr_args);
4218 case IORING_UNREGISTER_RING_FDS:
4219 ret = io_ringfd_unregister(ctx, arg, nr_args);
4221 case IORING_REGISTER_PBUF_RING:
4223 if (!arg || nr_args != 1)
4225 ret = io_register_pbuf_ring(ctx, arg);
4227 case IORING_UNREGISTER_PBUF_RING:
4229 if (!arg || nr_args != 1)
4231 ret = io_unregister_pbuf_ring(ctx, arg);
4233 case IORING_REGISTER_SYNC_CANCEL:
4235 if (!arg || nr_args != 1)
4237 ret = io_sync_cancel(ctx, arg);
4239 case IORING_REGISTER_FILE_ALLOC_RANGE:
4241 if (!arg || nr_args)
4243 ret = io_register_file_alloc_range(ctx, arg);
4253 SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode,
4254 void __user *, arg, unsigned int, nr_args)
4256 struct io_ring_ctx *ctx;
4260 if (opcode >= IORING_REGISTER_LAST)
4268 if (!io_is_uring_fops(f.file))
4271 ctx = f.file->private_data;
4273 mutex_lock(&ctx->uring_lock);
4274 ret = __io_uring_register(ctx, opcode, arg, nr_args);
4275 mutex_unlock(&ctx->uring_lock);
4276 trace_io_uring_register(ctx, opcode, ctx->nr_user_files, ctx->nr_user_bufs, ret);
4282 static int __init io_uring_init(void)
4284 #define __BUILD_BUG_VERIFY_OFFSET_SIZE(stype, eoffset, esize, ename) do { \
4285 BUILD_BUG_ON(offsetof(stype, ename) != eoffset); \
4286 BUILD_BUG_ON(sizeof_field(stype, ename) != esize); \
4289 #define BUILD_BUG_SQE_ELEM(eoffset, etype, ename) \
4290 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, sizeof(etype), ename)
4291 #define BUILD_BUG_SQE_ELEM_SIZE(eoffset, esize, ename) \
4292 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, esize, ename)
4293 BUILD_BUG_ON(sizeof(struct io_uring_sqe) != 64);
4294 BUILD_BUG_SQE_ELEM(0, __u8, opcode);
4295 BUILD_BUG_SQE_ELEM(1, __u8, flags);
4296 BUILD_BUG_SQE_ELEM(2, __u16, ioprio);
4297 BUILD_BUG_SQE_ELEM(4, __s32, fd);
4298 BUILD_BUG_SQE_ELEM(8, __u64, off);
4299 BUILD_BUG_SQE_ELEM(8, __u64, addr2);
4300 BUILD_BUG_SQE_ELEM(8, __u32, cmd_op);
4301 BUILD_BUG_SQE_ELEM(12, __u32, __pad1);
4302 BUILD_BUG_SQE_ELEM(16, __u64, addr);
4303 BUILD_BUG_SQE_ELEM(16, __u64, splice_off_in);
4304 BUILD_BUG_SQE_ELEM(24, __u32, len);
4305 BUILD_BUG_SQE_ELEM(28, __kernel_rwf_t, rw_flags);
4306 BUILD_BUG_SQE_ELEM(28, /* compat */ int, rw_flags);
4307 BUILD_BUG_SQE_ELEM(28, /* compat */ __u32, rw_flags);
4308 BUILD_BUG_SQE_ELEM(28, __u32, fsync_flags);
4309 BUILD_BUG_SQE_ELEM(28, /* compat */ __u16, poll_events);
4310 BUILD_BUG_SQE_ELEM(28, __u32, poll32_events);
4311 BUILD_BUG_SQE_ELEM(28, __u32, sync_range_flags);
4312 BUILD_BUG_SQE_ELEM(28, __u32, msg_flags);
4313 BUILD_BUG_SQE_ELEM(28, __u32, timeout_flags);
4314 BUILD_BUG_SQE_ELEM(28, __u32, accept_flags);
4315 BUILD_BUG_SQE_ELEM(28, __u32, cancel_flags);
4316 BUILD_BUG_SQE_ELEM(28, __u32, open_flags);
4317 BUILD_BUG_SQE_ELEM(28, __u32, statx_flags);
4318 BUILD_BUG_SQE_ELEM(28, __u32, fadvise_advice);
4319 BUILD_BUG_SQE_ELEM(28, __u32, splice_flags);
4320 BUILD_BUG_SQE_ELEM(28, __u32, rename_flags);
4321 BUILD_BUG_SQE_ELEM(28, __u32, unlink_flags);
4322 BUILD_BUG_SQE_ELEM(28, __u32, hardlink_flags);
4323 BUILD_BUG_SQE_ELEM(28, __u32, xattr_flags);
4324 BUILD_BUG_SQE_ELEM(28, __u32, msg_ring_flags);
4325 BUILD_BUG_SQE_ELEM(32, __u64, user_data);
4326 BUILD_BUG_SQE_ELEM(40, __u16, buf_index);
4327 BUILD_BUG_SQE_ELEM(40, __u16, buf_group);
4328 BUILD_BUG_SQE_ELEM(42, __u16, personality);
4329 BUILD_BUG_SQE_ELEM(44, __s32, splice_fd_in);
4330 BUILD_BUG_SQE_ELEM(44, __u32, file_index);
4331 BUILD_BUG_SQE_ELEM(44, __u16, addr_len);
4332 BUILD_BUG_SQE_ELEM(46, __u16, __pad3[0]);
4333 BUILD_BUG_SQE_ELEM(48, __u64, addr3);
4334 BUILD_BUG_SQE_ELEM_SIZE(48, 0, cmd);
4335 BUILD_BUG_SQE_ELEM(56, __u64, __pad2);
4337 BUILD_BUG_ON(sizeof(struct io_uring_files_update) !=
4338 sizeof(struct io_uring_rsrc_update));
4339 BUILD_BUG_ON(sizeof(struct io_uring_rsrc_update) >
4340 sizeof(struct io_uring_rsrc_update2));
4342 /* ->buf_index is u16 */
4343 BUILD_BUG_ON(offsetof(struct io_uring_buf_ring, bufs) != 0);
4344 BUILD_BUG_ON(offsetof(struct io_uring_buf, resv) !=
4345 offsetof(struct io_uring_buf_ring, tail));
4347 /* should fit into one byte */
4348 BUILD_BUG_ON(SQE_VALID_FLAGS >= (1 << 8));
4349 BUILD_BUG_ON(SQE_COMMON_FLAGS >= (1 << 8));
4350 BUILD_BUG_ON((SQE_VALID_FLAGS | SQE_COMMON_FLAGS) != SQE_VALID_FLAGS);
4352 BUILD_BUG_ON(__REQ_F_LAST_BIT > 8 * sizeof(int));
4354 BUILD_BUG_ON(sizeof(atomic_t) != sizeof(u32));
4356 io_uring_optable_init();
4358 req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC |
4362 __initcall(io_uring_init);