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>
75 #include <asm/shmparam.h>
77 #define CREATE_TRACE_POINTS
78 #include <trace/events/io_uring.h>
80 #include <uapi/linux/io_uring.h>
98 #include "alloc_cache.h"
100 #define IORING_MAX_ENTRIES 32768
101 #define IORING_MAX_CQ_ENTRIES (2 * IORING_MAX_ENTRIES)
103 #define IORING_MAX_RESTRICTIONS (IORING_RESTRICTION_LAST + \
104 IORING_REGISTER_LAST + IORING_OP_LAST)
106 #define SQE_COMMON_FLAGS (IOSQE_FIXED_FILE | IOSQE_IO_LINK | \
107 IOSQE_IO_HARDLINK | IOSQE_ASYNC)
109 #define SQE_VALID_FLAGS (SQE_COMMON_FLAGS | IOSQE_BUFFER_SELECT | \
110 IOSQE_IO_DRAIN | IOSQE_CQE_SKIP_SUCCESS)
112 #define IO_REQ_CLEAN_FLAGS (REQ_F_BUFFER_SELECTED | REQ_F_NEED_CLEANUP | \
113 REQ_F_POLLED | REQ_F_INFLIGHT | REQ_F_CREDS | \
116 #define IO_REQ_CLEAN_SLOW_FLAGS (REQ_F_REFCOUNT | REQ_F_LINK | REQ_F_HARDLINK |\
119 #define IO_TCTX_REFS_CACHE_NR (1U << 10)
121 #define IO_COMPL_BATCH 32
122 #define IO_REQ_ALLOC_BATCH 8
125 IO_CHECK_CQ_OVERFLOW_BIT,
126 IO_CHECK_CQ_DROPPED_BIT,
130 IO_EVENTFD_OP_SIGNAL_BIT,
131 IO_EVENTFD_OP_FREE_BIT,
134 struct io_defer_entry {
135 struct list_head list;
136 struct io_kiocb *req;
140 /* requests with any of those set should undergo io_disarm_next() */
141 #define IO_DISARM_MASK (REQ_F_ARM_LTIMEOUT | REQ_F_LINK_TIMEOUT | REQ_F_FAIL)
142 #define IO_REQ_LINK_FLAGS (REQ_F_LINK | REQ_F_HARDLINK)
144 static bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
145 struct task_struct *task,
148 static void io_dismantle_req(struct io_kiocb *req);
149 static void io_clean_op(struct io_kiocb *req);
150 static void io_queue_sqe(struct io_kiocb *req);
151 static void io_move_task_work_from_local(struct io_ring_ctx *ctx);
152 static void __io_submit_flush_completions(struct io_ring_ctx *ctx);
153 static __cold void io_fallback_tw(struct io_uring_task *tctx);
155 struct kmem_cache *req_cachep;
157 struct sock *io_uring_get_socket(struct file *file)
159 #if defined(CONFIG_UNIX)
160 if (io_is_uring_fops(file)) {
161 struct io_ring_ctx *ctx = file->private_data;
163 return ctx->ring_sock->sk;
168 EXPORT_SYMBOL(io_uring_get_socket);
170 static inline void io_submit_flush_completions(struct io_ring_ctx *ctx)
172 if (!wq_list_empty(&ctx->submit_state.compl_reqs) ||
173 ctx->submit_state.cqes_count)
174 __io_submit_flush_completions(ctx);
177 static inline unsigned int __io_cqring_events(struct io_ring_ctx *ctx)
179 return ctx->cached_cq_tail - READ_ONCE(ctx->rings->cq.head);
182 static inline unsigned int __io_cqring_events_user(struct io_ring_ctx *ctx)
184 return READ_ONCE(ctx->rings->cq.tail) - READ_ONCE(ctx->rings->cq.head);
187 static bool io_match_linked(struct io_kiocb *head)
189 struct io_kiocb *req;
191 io_for_each_link(req, head) {
192 if (req->flags & REQ_F_INFLIGHT)
199 * As io_match_task() but protected against racing with linked timeouts.
200 * User must not hold timeout_lock.
202 bool io_match_task_safe(struct io_kiocb *head, struct task_struct *task,
207 if (task && head->task != task)
212 if (head->flags & REQ_F_LINK_TIMEOUT) {
213 struct io_ring_ctx *ctx = head->ctx;
215 /* protect against races with linked timeouts */
216 spin_lock_irq(&ctx->timeout_lock);
217 matched = io_match_linked(head);
218 spin_unlock_irq(&ctx->timeout_lock);
220 matched = io_match_linked(head);
225 static inline void req_fail_link_node(struct io_kiocb *req, int res)
228 io_req_set_res(req, res, 0);
231 static inline void io_req_add_to_cache(struct io_kiocb *req, struct io_ring_ctx *ctx)
233 wq_stack_add_head(&req->comp_list, &ctx->submit_state.free_list);
234 kasan_poison_object_data(req_cachep, req);
237 static __cold void io_ring_ctx_ref_free(struct percpu_ref *ref)
239 struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs);
241 complete(&ctx->ref_comp);
244 static __cold void io_fallback_req_func(struct work_struct *work)
246 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx,
248 struct llist_node *node = llist_del_all(&ctx->fallback_llist);
249 struct io_kiocb *req, *tmp;
250 struct io_tw_state ts = { .locked = true, };
252 mutex_lock(&ctx->uring_lock);
253 llist_for_each_entry_safe(req, tmp, node, io_task_work.node)
254 req->io_task_work.func(req, &ts);
255 if (WARN_ON_ONCE(!ts.locked))
257 io_submit_flush_completions(ctx);
258 mutex_unlock(&ctx->uring_lock);
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->rsrc_node_cache, IO_NODE_ALLOC_CACHE_MAX,
314 sizeof(struct io_rsrc_node));
315 io_alloc_cache_init(&ctx->apoll_cache, IO_ALLOC_CACHE_MAX,
316 sizeof(struct async_poll));
317 io_alloc_cache_init(&ctx->netmsg_cache, IO_ALLOC_CACHE_MAX,
318 sizeof(struct io_async_msghdr));
319 init_completion(&ctx->ref_comp);
320 xa_init_flags(&ctx->personalities, XA_FLAGS_ALLOC1);
321 mutex_init(&ctx->uring_lock);
322 init_waitqueue_head(&ctx->cq_wait);
323 init_waitqueue_head(&ctx->poll_wq);
324 spin_lock_init(&ctx->completion_lock);
325 spin_lock_init(&ctx->timeout_lock);
326 INIT_WQ_LIST(&ctx->iopoll_list);
327 INIT_LIST_HEAD(&ctx->io_buffers_pages);
328 INIT_LIST_HEAD(&ctx->io_buffers_comp);
329 INIT_LIST_HEAD(&ctx->defer_list);
330 INIT_LIST_HEAD(&ctx->timeout_list);
331 INIT_LIST_HEAD(&ctx->ltimeout_list);
332 INIT_LIST_HEAD(&ctx->rsrc_ref_list);
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_issue_def *def = &io_issue_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 bool should_hash = def->hash_reg_file;
431 /* don't serialize this request if the fs doesn't need it */
432 if (should_hash && (req->file->f_flags & O_DIRECT) &&
433 (req->file->f_mode & FMODE_DIO_PARALLEL_WRITE))
435 if (should_hash || (ctx->flags & IORING_SETUP_IOPOLL))
436 io_wq_hash_work(&req->work, file_inode(req->file));
437 } else if (!req->file || !S_ISBLK(file_inode(req->file)->i_mode)) {
438 if (def->unbound_nonreg_file)
439 req->work.flags |= IO_WQ_WORK_UNBOUND;
443 static void io_prep_async_link(struct io_kiocb *req)
445 struct io_kiocb *cur;
447 if (req->flags & REQ_F_LINK_TIMEOUT) {
448 struct io_ring_ctx *ctx = req->ctx;
450 spin_lock_irq(&ctx->timeout_lock);
451 io_for_each_link(cur, req)
452 io_prep_async_work(cur);
453 spin_unlock_irq(&ctx->timeout_lock);
455 io_for_each_link(cur, req)
456 io_prep_async_work(cur);
460 void io_queue_iowq(struct io_kiocb *req, struct io_tw_state *ts_dont_use)
462 struct io_kiocb *link = io_prep_linked_timeout(req);
463 struct io_uring_task *tctx = req->task->io_uring;
466 BUG_ON(!tctx->io_wq);
468 /* init ->work of the whole link before punting */
469 io_prep_async_link(req);
472 * Not expected to happen, but if we do have a bug where this _can_
473 * happen, catch it here and ensure the request is marked as
474 * canceled. That will make io-wq go through the usual work cancel
475 * procedure rather than attempt to run this request (or create a new
478 if (WARN_ON_ONCE(!same_thread_group(req->task, current)))
479 req->work.flags |= IO_WQ_WORK_CANCEL;
481 trace_io_uring_queue_async_work(req, io_wq_is_hashed(&req->work));
482 io_wq_enqueue(tctx->io_wq, &req->work);
484 io_queue_linked_timeout(link);
487 static __cold void io_queue_deferred(struct io_ring_ctx *ctx)
489 while (!list_empty(&ctx->defer_list)) {
490 struct io_defer_entry *de = list_first_entry(&ctx->defer_list,
491 struct io_defer_entry, list);
493 if (req_need_defer(de->req, de->seq))
495 list_del_init(&de->list);
496 io_req_task_queue(de->req);
502 static void io_eventfd_ops(struct rcu_head *rcu)
504 struct io_ev_fd *ev_fd = container_of(rcu, struct io_ev_fd, rcu);
505 int ops = atomic_xchg(&ev_fd->ops, 0);
507 if (ops & BIT(IO_EVENTFD_OP_SIGNAL_BIT))
508 eventfd_signal_mask(ev_fd->cq_ev_fd, 1, EPOLL_URING_WAKE);
510 /* IO_EVENTFD_OP_FREE_BIT may not be set here depending on callback
511 * ordering in a race but if references are 0 we know we have to free
514 if (atomic_dec_and_test(&ev_fd->refs)) {
515 eventfd_ctx_put(ev_fd->cq_ev_fd);
520 static void io_eventfd_signal(struct io_ring_ctx *ctx)
522 struct io_ev_fd *ev_fd = NULL;
526 * rcu_dereference ctx->io_ev_fd once and use it for both for checking
529 ev_fd = rcu_dereference(ctx->io_ev_fd);
532 * Check again if ev_fd exists incase an io_eventfd_unregister call
533 * completed between the NULL check of ctx->io_ev_fd at the start of
534 * the function and rcu_read_lock.
536 if (unlikely(!ev_fd))
538 if (READ_ONCE(ctx->rings->cq_flags) & IORING_CQ_EVENTFD_DISABLED)
540 if (ev_fd->eventfd_async && !io_wq_current_is_worker())
543 if (likely(eventfd_signal_allowed())) {
544 eventfd_signal_mask(ev_fd->cq_ev_fd, 1, EPOLL_URING_WAKE);
546 atomic_inc(&ev_fd->refs);
547 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_SIGNAL_BIT), &ev_fd->ops))
548 call_rcu_hurry(&ev_fd->rcu, io_eventfd_ops);
550 atomic_dec(&ev_fd->refs);
557 static void io_eventfd_flush_signal(struct io_ring_ctx *ctx)
561 spin_lock(&ctx->completion_lock);
564 * Eventfd should only get triggered when at least one event has been
565 * posted. Some applications rely on the eventfd notification count
566 * only changing IFF a new CQE has been added to the CQ ring. There's
567 * no depedency on 1:1 relationship between how many times this
568 * function is called (and hence the eventfd count) and number of CQEs
569 * posted to the CQ ring.
571 skip = ctx->cached_cq_tail == ctx->evfd_last_cq_tail;
572 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
573 spin_unlock(&ctx->completion_lock);
577 io_eventfd_signal(ctx);
580 void __io_commit_cqring_flush(struct io_ring_ctx *ctx)
582 if (ctx->poll_activated)
583 io_poll_wq_wake(ctx);
584 if (ctx->off_timeout_used)
585 io_flush_timeouts(ctx);
586 if (ctx->drain_active) {
587 spin_lock(&ctx->completion_lock);
588 io_queue_deferred(ctx);
589 spin_unlock(&ctx->completion_lock);
592 io_eventfd_flush_signal(ctx);
595 static inline void __io_cq_lock(struct io_ring_ctx *ctx)
596 __acquires(ctx->completion_lock)
598 if (!ctx->task_complete)
599 spin_lock(&ctx->completion_lock);
602 static inline void __io_cq_unlock(struct io_ring_ctx *ctx)
604 if (!ctx->task_complete)
605 spin_unlock(&ctx->completion_lock);
608 static inline void io_cq_lock(struct io_ring_ctx *ctx)
609 __acquires(ctx->completion_lock)
611 spin_lock(&ctx->completion_lock);
614 static inline void io_cq_unlock(struct io_ring_ctx *ctx)
615 __releases(ctx->completion_lock)
617 spin_unlock(&ctx->completion_lock);
620 /* keep it inlined for io_submit_flush_completions() */
621 static inline void __io_cq_unlock_post(struct io_ring_ctx *ctx)
622 __releases(ctx->completion_lock)
624 io_commit_cqring(ctx);
626 io_commit_cqring_flush(ctx);
630 static inline void __io_cq_unlock_post_flush(struct io_ring_ctx *ctx)
631 __releases(ctx->completion_lock)
633 io_commit_cqring(ctx);
635 io_commit_cqring_flush(ctx);
638 * As ->task_complete implies that the ring is single tasked, cq_wait
639 * may only be waited on by the current in io_cqring_wait(), but since
640 * it will re-check the wakeup conditions once we return we can safely
643 if (!(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
647 void io_cq_unlock_post(struct io_ring_ctx *ctx)
648 __releases(ctx->completion_lock)
650 io_commit_cqring(ctx);
651 spin_unlock(&ctx->completion_lock);
652 io_commit_cqring_flush(ctx);
656 /* Returns true if there are no backlogged entries after the flush */
657 static void io_cqring_overflow_kill(struct io_ring_ctx *ctx)
659 struct io_overflow_cqe *ocqe;
663 list_splice_init(&ctx->cq_overflow_list, &list);
664 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
667 while (!list_empty(&list)) {
668 ocqe = list_first_entry(&list, struct io_overflow_cqe, list);
669 list_del(&ocqe->list);
674 static void __io_cqring_overflow_flush(struct io_ring_ctx *ctx)
676 size_t cqe_size = sizeof(struct io_uring_cqe);
678 if (__io_cqring_events(ctx) == ctx->cq_entries)
681 if (ctx->flags & IORING_SETUP_CQE32)
685 while (!list_empty(&ctx->cq_overflow_list)) {
686 struct io_uring_cqe *cqe = io_get_cqe_overflow(ctx, true);
687 struct io_overflow_cqe *ocqe;
691 ocqe = list_first_entry(&ctx->cq_overflow_list,
692 struct io_overflow_cqe, list);
693 memcpy(cqe, &ocqe->cqe, cqe_size);
694 list_del(&ocqe->list);
698 if (list_empty(&ctx->cq_overflow_list)) {
699 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
700 atomic_andnot(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
702 io_cq_unlock_post(ctx);
705 static void io_cqring_do_overflow_flush(struct io_ring_ctx *ctx)
707 /* iopoll syncs against uring_lock, not completion_lock */
708 if (ctx->flags & IORING_SETUP_IOPOLL)
709 mutex_lock(&ctx->uring_lock);
710 __io_cqring_overflow_flush(ctx);
711 if (ctx->flags & IORING_SETUP_IOPOLL)
712 mutex_unlock(&ctx->uring_lock);
715 static void io_cqring_overflow_flush(struct io_ring_ctx *ctx)
717 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
718 io_cqring_do_overflow_flush(ctx);
721 /* can be called by any task */
722 static void io_put_task_remote(struct task_struct *task, int nr)
724 struct io_uring_task *tctx = task->io_uring;
726 percpu_counter_sub(&tctx->inflight, nr);
727 if (unlikely(atomic_read(&tctx->in_cancel)))
728 wake_up(&tctx->wait);
729 put_task_struct_many(task, nr);
732 /* used by a task to put its own references */
733 static void io_put_task_local(struct task_struct *task, int nr)
735 task->io_uring->cached_refs += nr;
738 /* must to be called somewhat shortly after putting a request */
739 static inline void io_put_task(struct task_struct *task, int nr)
741 if (likely(task == current))
742 io_put_task_local(task, nr);
744 io_put_task_remote(task, nr);
747 void io_task_refs_refill(struct io_uring_task *tctx)
749 unsigned int refill = -tctx->cached_refs + IO_TCTX_REFS_CACHE_NR;
751 percpu_counter_add(&tctx->inflight, refill);
752 refcount_add(refill, ¤t->usage);
753 tctx->cached_refs += refill;
756 static __cold void io_uring_drop_tctx_refs(struct task_struct *task)
758 struct io_uring_task *tctx = task->io_uring;
759 unsigned int refs = tctx->cached_refs;
762 tctx->cached_refs = 0;
763 percpu_counter_sub(&tctx->inflight, refs);
764 put_task_struct_many(task, refs);
768 static bool io_cqring_event_overflow(struct io_ring_ctx *ctx, u64 user_data,
769 s32 res, u32 cflags, u64 extra1, u64 extra2)
771 struct io_overflow_cqe *ocqe;
772 size_t ocq_size = sizeof(struct io_overflow_cqe);
773 bool is_cqe32 = (ctx->flags & IORING_SETUP_CQE32);
775 lockdep_assert_held(&ctx->completion_lock);
778 ocq_size += sizeof(struct io_uring_cqe);
780 ocqe = kmalloc(ocq_size, GFP_ATOMIC | __GFP_ACCOUNT);
781 trace_io_uring_cqe_overflow(ctx, user_data, res, cflags, ocqe);
784 * If we're in ring overflow flush mode, or in task cancel mode,
785 * or cannot allocate an overflow entry, then we need to drop it
788 io_account_cq_overflow(ctx);
789 set_bit(IO_CHECK_CQ_DROPPED_BIT, &ctx->check_cq);
792 if (list_empty(&ctx->cq_overflow_list)) {
793 set_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
794 atomic_or(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
797 ocqe->cqe.user_data = user_data;
799 ocqe->cqe.flags = cflags;
801 ocqe->cqe.big_cqe[0] = extra1;
802 ocqe->cqe.big_cqe[1] = extra2;
804 list_add_tail(&ocqe->list, &ctx->cq_overflow_list);
808 bool io_req_cqe_overflow(struct io_kiocb *req)
810 if (!(req->flags & REQ_F_CQE32_INIT)) {
814 return io_cqring_event_overflow(req->ctx, req->cqe.user_data,
815 req->cqe.res, req->cqe.flags,
816 req->extra1, req->extra2);
820 * writes to the cq entry need to come after reading head; the
821 * control dependency is enough as we're using WRITE_ONCE to
824 struct io_uring_cqe *__io_get_cqe(struct io_ring_ctx *ctx, bool overflow)
826 struct io_rings *rings = ctx->rings;
827 unsigned int off = ctx->cached_cq_tail & (ctx->cq_entries - 1);
828 unsigned int free, queued, len;
831 * Posting into the CQ when there are pending overflowed CQEs may break
832 * ordering guarantees, which will affect links, F_MORE users and more.
833 * Force overflow the completion.
835 if (!overflow && (ctx->check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)))
838 /* userspace may cheat modifying the tail, be safe and do min */
839 queued = min(__io_cqring_events(ctx), ctx->cq_entries);
840 free = ctx->cq_entries - queued;
841 /* we need a contiguous range, limit based on the current array offset */
842 len = min(free, ctx->cq_entries - off);
846 if (ctx->flags & IORING_SETUP_CQE32) {
851 ctx->cqe_cached = &rings->cqes[off];
852 ctx->cqe_sentinel = ctx->cqe_cached + len;
854 ctx->cached_cq_tail++;
856 if (ctx->flags & IORING_SETUP_CQE32)
858 return &rings->cqes[off];
861 static bool io_fill_cqe_aux(struct io_ring_ctx *ctx, u64 user_data, s32 res,
864 struct io_uring_cqe *cqe;
869 * If we can't get a cq entry, userspace overflowed the
870 * submission (by quite a lot). Increment the overflow count in
873 cqe = io_get_cqe(ctx);
875 trace_io_uring_complete(ctx, NULL, user_data, res, cflags, 0, 0);
877 WRITE_ONCE(cqe->user_data, user_data);
878 WRITE_ONCE(cqe->res, res);
879 WRITE_ONCE(cqe->flags, cflags);
881 if (ctx->flags & IORING_SETUP_CQE32) {
882 WRITE_ONCE(cqe->big_cqe[0], 0);
883 WRITE_ONCE(cqe->big_cqe[1], 0);
890 static void __io_flush_post_cqes(struct io_ring_ctx *ctx)
891 __must_hold(&ctx->uring_lock)
893 struct io_submit_state *state = &ctx->submit_state;
896 lockdep_assert_held(&ctx->uring_lock);
897 for (i = 0; i < state->cqes_count; i++) {
898 struct io_uring_cqe *cqe = &state->cqes[i];
900 if (!io_fill_cqe_aux(ctx, cqe->user_data, cqe->res, cqe->flags)) {
901 if (ctx->task_complete) {
902 spin_lock(&ctx->completion_lock);
903 io_cqring_event_overflow(ctx, cqe->user_data,
904 cqe->res, cqe->flags, 0, 0);
905 spin_unlock(&ctx->completion_lock);
907 io_cqring_event_overflow(ctx, cqe->user_data,
908 cqe->res, cqe->flags, 0, 0);
912 state->cqes_count = 0;
915 static bool __io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags,
921 filled = io_fill_cqe_aux(ctx, user_data, res, cflags);
922 if (!filled && allow_overflow)
923 filled = io_cqring_event_overflow(ctx, user_data, res, cflags, 0, 0);
925 io_cq_unlock_post(ctx);
929 bool io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags)
931 return __io_post_aux_cqe(ctx, user_data, res, cflags, true);
934 bool io_aux_cqe(struct io_ring_ctx *ctx, bool defer, u64 user_data, s32 res, u32 cflags,
937 struct io_uring_cqe *cqe;
941 return __io_post_aux_cqe(ctx, user_data, res, cflags, allow_overflow);
943 length = ARRAY_SIZE(ctx->submit_state.cqes);
945 lockdep_assert_held(&ctx->uring_lock);
947 if (ctx->submit_state.cqes_count == length) {
949 __io_flush_post_cqes(ctx);
950 /* no need to flush - flush is deferred */
951 __io_cq_unlock_post(ctx);
954 /* For defered completions this is not as strict as it is otherwise,
955 * however it's main job is to prevent unbounded posted completions,
956 * and in that it works just as well.
958 if (!allow_overflow && test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
961 cqe = &ctx->submit_state.cqes[ctx->submit_state.cqes_count++];
962 cqe->user_data = user_data;
968 static void __io_req_complete_post(struct io_kiocb *req, unsigned issue_flags)
970 struct io_ring_ctx *ctx = req->ctx;
971 struct io_rsrc_node *rsrc_node = NULL;
974 if (!(req->flags & REQ_F_CQE_SKIP))
975 io_fill_cqe_req(ctx, req);
978 * If we're the last reference to this request, add to our locked
981 if (req_ref_put_and_test(req)) {
982 if (req->flags & IO_REQ_LINK_FLAGS) {
983 if (req->flags & IO_DISARM_MASK)
986 io_req_task_queue(req->link);
990 io_put_kbuf_comp(req);
991 io_dismantle_req(req);
992 rsrc_node = req->rsrc_node;
994 * Selected buffer deallocation in io_clean_op() assumes that
995 * we don't hold ->completion_lock. Clean them here to avoid
998 io_put_task_remote(req->task, 1);
999 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
1000 ctx->locked_free_nr++;
1002 io_cq_unlock_post(ctx);
1005 io_ring_submit_lock(ctx, issue_flags);
1006 io_put_rsrc_node(ctx, rsrc_node);
1007 io_ring_submit_unlock(ctx, issue_flags);
1011 void io_req_complete_post(struct io_kiocb *req, unsigned issue_flags)
1013 if (req->ctx->task_complete && (issue_flags & IO_URING_F_IOWQ)) {
1014 req->io_task_work.func = io_req_task_complete;
1015 io_req_task_work_add(req);
1016 } else if (!(issue_flags & IO_URING_F_UNLOCKED) ||
1017 !(req->ctx->flags & IORING_SETUP_IOPOLL)) {
1018 __io_req_complete_post(req, issue_flags);
1020 struct io_ring_ctx *ctx = req->ctx;
1022 mutex_lock(&ctx->uring_lock);
1023 __io_req_complete_post(req, issue_flags & ~IO_URING_F_UNLOCKED);
1024 mutex_unlock(&ctx->uring_lock);
1028 void io_req_defer_failed(struct io_kiocb *req, s32 res)
1029 __must_hold(&ctx->uring_lock)
1031 const struct io_cold_def *def = &io_cold_defs[req->opcode];
1033 lockdep_assert_held(&req->ctx->uring_lock);
1036 io_req_set_res(req, res, io_put_kbuf(req, IO_URING_F_UNLOCKED));
1039 io_req_complete_defer(req);
1043 * Don't initialise the fields below on every allocation, but do that in
1044 * advance and keep them valid across allocations.
1046 static void io_preinit_req(struct io_kiocb *req, struct io_ring_ctx *ctx)
1050 req->async_data = NULL;
1051 /* not necessary, but safer to zero */
1055 static void io_flush_cached_locked_reqs(struct io_ring_ctx *ctx,
1056 struct io_submit_state *state)
1058 spin_lock(&ctx->completion_lock);
1059 wq_list_splice(&ctx->locked_free_list, &state->free_list);
1060 ctx->locked_free_nr = 0;
1061 spin_unlock(&ctx->completion_lock);
1065 * A request might get retired back into the request caches even before opcode
1066 * handlers and io_issue_sqe() are done with it, e.g. inline completion path.
1067 * Because of that, io_alloc_req() should be called only under ->uring_lock
1068 * and with extra caution to not get a request that is still worked on.
1070 __cold bool __io_alloc_req_refill(struct io_ring_ctx *ctx)
1071 __must_hold(&ctx->uring_lock)
1073 gfp_t gfp = GFP_KERNEL | __GFP_NOWARN;
1074 void *reqs[IO_REQ_ALLOC_BATCH];
1078 * If we have more than a batch's worth of requests in our IRQ side
1079 * locked cache, grab the lock and move them over to our submission
1082 if (data_race(ctx->locked_free_nr) > IO_COMPL_BATCH) {
1083 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
1084 if (!io_req_cache_empty(ctx))
1088 ret = kmem_cache_alloc_bulk(req_cachep, gfp, ARRAY_SIZE(reqs), reqs);
1091 * Bulk alloc is all-or-nothing. If we fail to get a batch,
1092 * retry single alloc to be on the safe side.
1094 if (unlikely(ret <= 0)) {
1095 reqs[0] = kmem_cache_alloc(req_cachep, gfp);
1101 percpu_ref_get_many(&ctx->refs, ret);
1102 for (i = 0; i < ret; i++) {
1103 struct io_kiocb *req = reqs[i];
1105 io_preinit_req(req, ctx);
1106 io_req_add_to_cache(req, ctx);
1111 static inline void io_dismantle_req(struct io_kiocb *req)
1113 unsigned int flags = req->flags;
1115 if (unlikely(flags & IO_REQ_CLEAN_FLAGS))
1117 if (!(flags & REQ_F_FIXED_FILE))
1118 io_put_file(req->file);
1121 static __cold void io_free_req_tw(struct io_kiocb *req, struct io_tw_state *ts)
1123 struct io_ring_ctx *ctx = req->ctx;
1125 if (req->rsrc_node) {
1126 io_tw_lock(ctx, ts);
1127 io_put_rsrc_node(ctx, req->rsrc_node);
1129 io_dismantle_req(req);
1130 io_put_task_remote(req->task, 1);
1132 spin_lock(&ctx->completion_lock);
1133 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
1134 ctx->locked_free_nr++;
1135 spin_unlock(&ctx->completion_lock);
1138 __cold void io_free_req(struct io_kiocb *req)
1140 req->io_task_work.func = io_free_req_tw;
1141 io_req_task_work_add(req);
1144 static void __io_req_find_next_prep(struct io_kiocb *req)
1146 struct io_ring_ctx *ctx = req->ctx;
1148 spin_lock(&ctx->completion_lock);
1149 io_disarm_next(req);
1150 spin_unlock(&ctx->completion_lock);
1153 static inline struct io_kiocb *io_req_find_next(struct io_kiocb *req)
1155 struct io_kiocb *nxt;
1158 * If LINK is set, we have dependent requests in this chain. If we
1159 * didn't fail this request, queue the first one up, moving any other
1160 * dependencies to the next request. In case of failure, fail the rest
1163 if (unlikely(req->flags & IO_DISARM_MASK))
1164 __io_req_find_next_prep(req);
1170 static void ctx_flush_and_put(struct io_ring_ctx *ctx, struct io_tw_state *ts)
1174 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1175 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1177 io_submit_flush_completions(ctx);
1178 mutex_unlock(&ctx->uring_lock);
1181 percpu_ref_put(&ctx->refs);
1184 static unsigned int handle_tw_list(struct llist_node *node,
1185 struct io_ring_ctx **ctx,
1186 struct io_tw_state *ts,
1187 struct llist_node *last)
1189 unsigned int count = 0;
1191 while (node && node != last) {
1192 struct llist_node *next = node->next;
1193 struct io_kiocb *req = container_of(node, struct io_kiocb,
1196 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1198 if (req->ctx != *ctx) {
1199 ctx_flush_and_put(*ctx, ts);
1201 /* if not contended, grab and improve batching */
1202 ts->locked = mutex_trylock(&(*ctx)->uring_lock);
1203 percpu_ref_get(&(*ctx)->refs);
1205 req->io_task_work.func(req, ts);
1208 if (unlikely(need_resched())) {
1209 ctx_flush_and_put(*ctx, ts);
1219 * io_llist_xchg - swap all entries in a lock-less list
1220 * @head: the head of lock-less list to delete all entries
1221 * @new: new entry as the head of the list
1223 * If list is empty, return NULL, otherwise, return the pointer to the first entry.
1224 * The order of entries returned is from the newest to the oldest added one.
1226 static inline struct llist_node *io_llist_xchg(struct llist_head *head,
1227 struct llist_node *new)
1229 return xchg(&head->first, new);
1233 * io_llist_cmpxchg - possibly swap all entries in a lock-less list
1234 * @head: the head of lock-less list to delete all entries
1235 * @old: expected old value of the first entry of the list
1236 * @new: new entry as the head of the list
1238 * perform a cmpxchg on the first entry of the list.
1241 static inline struct llist_node *io_llist_cmpxchg(struct llist_head *head,
1242 struct llist_node *old,
1243 struct llist_node *new)
1245 return cmpxchg(&head->first, old, new);
1248 void tctx_task_work(struct callback_head *cb)
1250 struct io_tw_state ts = {};
1251 struct io_ring_ctx *ctx = NULL;
1252 struct io_uring_task *tctx = container_of(cb, struct io_uring_task,
1254 struct llist_node fake = {};
1255 struct llist_node *node;
1256 unsigned int loops = 0;
1257 unsigned int count = 0;
1259 if (unlikely(current->flags & PF_EXITING)) {
1260 io_fallback_tw(tctx);
1266 node = io_llist_xchg(&tctx->task_list, &fake);
1267 count += handle_tw_list(node, &ctx, &ts, &fake);
1269 /* skip expensive cmpxchg if there are items in the list */
1270 if (READ_ONCE(tctx->task_list.first) != &fake)
1272 if (ts.locked && !wq_list_empty(&ctx->submit_state.compl_reqs)) {
1273 io_submit_flush_completions(ctx);
1274 if (READ_ONCE(tctx->task_list.first) != &fake)
1277 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1278 } while (node != &fake);
1280 ctx_flush_and_put(ctx, &ts);
1282 /* relaxed read is enough as only the task itself sets ->in_cancel */
1283 if (unlikely(atomic_read(&tctx->in_cancel)))
1284 io_uring_drop_tctx_refs(current);
1286 trace_io_uring_task_work_run(tctx, count, loops);
1289 static __cold void io_fallback_tw(struct io_uring_task *tctx)
1291 struct llist_node *node = llist_del_all(&tctx->task_list);
1292 struct io_kiocb *req;
1295 req = container_of(node, struct io_kiocb, io_task_work.node);
1297 if (llist_add(&req->io_task_work.node,
1298 &req->ctx->fallback_llist))
1299 schedule_delayed_work(&req->ctx->fallback_work, 1);
1303 static void io_req_local_work_add(struct io_kiocb *req)
1305 struct io_ring_ctx *ctx = req->ctx;
1307 if (!llist_add(&req->io_task_work.node, &ctx->work_llist))
1310 /* needed for the following wake up */
1311 smp_mb__after_atomic();
1313 if (unlikely(atomic_read(&req->task->io_uring->in_cancel))) {
1314 io_move_task_work_from_local(ctx);
1318 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1319 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1321 io_eventfd_signal(ctx);
1323 if (READ_ONCE(ctx->cq_waiting))
1324 wake_up_state(ctx->submitter_task, TASK_INTERRUPTIBLE);
1327 void __io_req_task_work_add(struct io_kiocb *req, bool allow_local)
1329 struct io_uring_task *tctx = req->task->io_uring;
1330 struct io_ring_ctx *ctx = req->ctx;
1332 if (allow_local && ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
1334 io_req_local_work_add(req);
1339 /* task_work already pending, we're done */
1340 if (!llist_add(&req->io_task_work.node, &tctx->task_list))
1343 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1344 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1346 if (likely(!task_work_add(req->task, &tctx->task_work, ctx->notify_method)))
1349 io_fallback_tw(tctx);
1352 static void __cold io_move_task_work_from_local(struct io_ring_ctx *ctx)
1354 struct llist_node *node;
1356 node = llist_del_all(&ctx->work_llist);
1358 struct io_kiocb *req = container_of(node, struct io_kiocb,
1362 __io_req_task_work_add(req, false);
1366 static int __io_run_local_work(struct io_ring_ctx *ctx, struct io_tw_state *ts)
1368 struct llist_node *node;
1369 unsigned int loops = 0;
1372 if (WARN_ON_ONCE(ctx->submitter_task != current))
1374 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1375 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1377 node = io_llist_xchg(&ctx->work_llist, NULL);
1379 struct llist_node *next = node->next;
1380 struct io_kiocb *req = container_of(node, struct io_kiocb,
1382 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1383 req->io_task_work.func(req, ts);
1389 if (!llist_empty(&ctx->work_llist))
1392 io_submit_flush_completions(ctx);
1393 if (!llist_empty(&ctx->work_llist))
1396 trace_io_uring_local_work_run(ctx, ret, loops);
1400 static inline int io_run_local_work_locked(struct io_ring_ctx *ctx)
1402 struct io_tw_state ts = { .locked = true, };
1405 if (llist_empty(&ctx->work_llist))
1408 ret = __io_run_local_work(ctx, &ts);
1409 /* shouldn't happen! */
1410 if (WARN_ON_ONCE(!ts.locked))
1411 mutex_lock(&ctx->uring_lock);
1415 static int io_run_local_work(struct io_ring_ctx *ctx)
1417 struct io_tw_state ts = {};
1420 ts.locked = mutex_trylock(&ctx->uring_lock);
1421 ret = __io_run_local_work(ctx, &ts);
1423 mutex_unlock(&ctx->uring_lock);
1428 static void io_req_task_cancel(struct io_kiocb *req, struct io_tw_state *ts)
1430 io_tw_lock(req->ctx, ts);
1431 io_req_defer_failed(req, req->cqe.res);
1434 void io_req_task_submit(struct io_kiocb *req, struct io_tw_state *ts)
1436 io_tw_lock(req->ctx, ts);
1437 /* req->task == current here, checking PF_EXITING is safe */
1438 if (unlikely(req->task->flags & PF_EXITING))
1439 io_req_defer_failed(req, -EFAULT);
1440 else if (req->flags & REQ_F_FORCE_ASYNC)
1441 io_queue_iowq(req, ts);
1446 void io_req_task_queue_fail(struct io_kiocb *req, int ret)
1448 io_req_set_res(req, ret, 0);
1449 req->io_task_work.func = io_req_task_cancel;
1450 io_req_task_work_add(req);
1453 void io_req_task_queue(struct io_kiocb *req)
1455 req->io_task_work.func = io_req_task_submit;
1456 io_req_task_work_add(req);
1459 void io_queue_next(struct io_kiocb *req)
1461 struct io_kiocb *nxt = io_req_find_next(req);
1464 io_req_task_queue(nxt);
1467 void io_free_batch_list(struct io_ring_ctx *ctx, struct io_wq_work_node *node)
1468 __must_hold(&ctx->uring_lock)
1470 struct task_struct *task = NULL;
1474 struct io_kiocb *req = container_of(node, struct io_kiocb,
1477 if (unlikely(req->flags & IO_REQ_CLEAN_SLOW_FLAGS)) {
1478 if (req->flags & REQ_F_REFCOUNT) {
1479 node = req->comp_list.next;
1480 if (!req_ref_put_and_test(req))
1483 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1484 struct async_poll *apoll = req->apoll;
1486 if (apoll->double_poll)
1487 kfree(apoll->double_poll);
1488 if (!io_alloc_cache_put(&ctx->apoll_cache, &apoll->cache))
1490 req->flags &= ~REQ_F_POLLED;
1492 if (req->flags & IO_REQ_LINK_FLAGS)
1494 if (unlikely(req->flags & IO_REQ_CLEAN_FLAGS))
1497 if (!(req->flags & REQ_F_FIXED_FILE))
1498 io_put_file(req->file);
1500 io_req_put_rsrc_locked(req, ctx);
1502 if (req->task != task) {
1504 io_put_task(task, task_refs);
1509 node = req->comp_list.next;
1510 io_req_add_to_cache(req, ctx);
1514 io_put_task(task, task_refs);
1517 static void __io_submit_flush_completions(struct io_ring_ctx *ctx)
1518 __must_hold(&ctx->uring_lock)
1520 struct io_submit_state *state = &ctx->submit_state;
1521 struct io_wq_work_node *node;
1524 /* must come first to preserve CQE ordering in failure cases */
1525 if (state->cqes_count)
1526 __io_flush_post_cqes(ctx);
1527 __wq_list_for_each(node, &state->compl_reqs) {
1528 struct io_kiocb *req = container_of(node, struct io_kiocb,
1531 if (!(req->flags & REQ_F_CQE_SKIP) &&
1532 unlikely(!__io_fill_cqe_req(ctx, req))) {
1533 if (ctx->task_complete) {
1534 spin_lock(&ctx->completion_lock);
1535 io_req_cqe_overflow(req);
1536 spin_unlock(&ctx->completion_lock);
1538 io_req_cqe_overflow(req);
1542 __io_cq_unlock_post_flush(ctx);
1544 if (!wq_list_empty(&ctx->submit_state.compl_reqs)) {
1545 io_free_batch_list(ctx, state->compl_reqs.first);
1546 INIT_WQ_LIST(&state->compl_reqs);
1551 * Drop reference to request, return next in chain (if there is one) if this
1552 * was the last reference to this request.
1554 static inline struct io_kiocb *io_put_req_find_next(struct io_kiocb *req)
1556 struct io_kiocb *nxt = NULL;
1558 if (req_ref_put_and_test(req)) {
1559 if (unlikely(req->flags & IO_REQ_LINK_FLAGS))
1560 nxt = io_req_find_next(req);
1566 static unsigned io_cqring_events(struct io_ring_ctx *ctx)
1568 /* See comment at the top of this file */
1570 return __io_cqring_events(ctx);
1574 * We can't just wait for polled events to come to us, we have to actively
1575 * find and complete them.
1577 static __cold void io_iopoll_try_reap_events(struct io_ring_ctx *ctx)
1579 if (!(ctx->flags & IORING_SETUP_IOPOLL))
1582 mutex_lock(&ctx->uring_lock);
1583 while (!wq_list_empty(&ctx->iopoll_list)) {
1584 /* let it sleep and repeat later if can't complete a request */
1585 if (io_do_iopoll(ctx, true) == 0)
1588 * Ensure we allow local-to-the-cpu processing to take place,
1589 * in this case we need to ensure that we reap all events.
1590 * Also let task_work, etc. to progress by releasing the mutex
1592 if (need_resched()) {
1593 mutex_unlock(&ctx->uring_lock);
1595 mutex_lock(&ctx->uring_lock);
1598 mutex_unlock(&ctx->uring_lock);
1601 static int io_iopoll_check(struct io_ring_ctx *ctx, long min)
1603 unsigned int nr_events = 0;
1605 unsigned long check_cq;
1607 if (!io_allowed_run_tw(ctx))
1610 check_cq = READ_ONCE(ctx->check_cq);
1611 if (unlikely(check_cq)) {
1612 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
1613 __io_cqring_overflow_flush(ctx);
1615 * Similarly do not spin if we have not informed the user of any
1618 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT))
1622 * Don't enter poll loop if we already have events pending.
1623 * If we do, we can potentially be spinning for commands that
1624 * already triggered a CQE (eg in error).
1626 if (io_cqring_events(ctx))
1631 * If a submit got punted to a workqueue, we can have the
1632 * application entering polling for a command before it gets
1633 * issued. That app will hold the uring_lock for the duration
1634 * of the poll right here, so we need to take a breather every
1635 * now and then to ensure that the issue has a chance to add
1636 * the poll to the issued list. Otherwise we can spin here
1637 * forever, while the workqueue is stuck trying to acquire the
1640 if (wq_list_empty(&ctx->iopoll_list) ||
1641 io_task_work_pending(ctx)) {
1642 u32 tail = ctx->cached_cq_tail;
1644 (void) io_run_local_work_locked(ctx);
1646 if (task_work_pending(current) ||
1647 wq_list_empty(&ctx->iopoll_list)) {
1648 mutex_unlock(&ctx->uring_lock);
1650 mutex_lock(&ctx->uring_lock);
1652 /* some requests don't go through iopoll_list */
1653 if (tail != ctx->cached_cq_tail ||
1654 wq_list_empty(&ctx->iopoll_list))
1657 ret = io_do_iopoll(ctx, !min);
1662 } while (nr_events < min && !need_resched());
1667 void io_req_task_complete(struct io_kiocb *req, struct io_tw_state *ts)
1670 io_req_complete_defer(req);
1672 io_req_complete_post(req, IO_URING_F_UNLOCKED);
1676 * After the iocb has been issued, it's safe to be found on the poll list.
1677 * Adding the kiocb to the list AFTER submission ensures that we don't
1678 * find it from a io_do_iopoll() thread before the issuer is done
1679 * accessing the kiocb cookie.
1681 static void io_iopoll_req_issued(struct io_kiocb *req, unsigned int issue_flags)
1683 struct io_ring_ctx *ctx = req->ctx;
1684 const bool needs_lock = issue_flags & IO_URING_F_UNLOCKED;
1686 /* workqueue context doesn't hold uring_lock, grab it now */
1687 if (unlikely(needs_lock))
1688 mutex_lock(&ctx->uring_lock);
1691 * Track whether we have multiple files in our lists. This will impact
1692 * how we do polling eventually, not spinning if we're on potentially
1693 * different devices.
1695 if (wq_list_empty(&ctx->iopoll_list)) {
1696 ctx->poll_multi_queue = false;
1697 } else if (!ctx->poll_multi_queue) {
1698 struct io_kiocb *list_req;
1700 list_req = container_of(ctx->iopoll_list.first, struct io_kiocb,
1702 if (list_req->file != req->file)
1703 ctx->poll_multi_queue = true;
1707 * For fast devices, IO may have already completed. If it has, add
1708 * it to the front so we find it first.
1710 if (READ_ONCE(req->iopoll_completed))
1711 wq_list_add_head(&req->comp_list, &ctx->iopoll_list);
1713 wq_list_add_tail(&req->comp_list, &ctx->iopoll_list);
1715 if (unlikely(needs_lock)) {
1717 * If IORING_SETUP_SQPOLL is enabled, sqes are either handle
1718 * in sq thread task context or in io worker task context. If
1719 * current task context is sq thread, we don't need to check
1720 * whether should wake up sq thread.
1722 if ((ctx->flags & IORING_SETUP_SQPOLL) &&
1723 wq_has_sleeper(&ctx->sq_data->wait))
1724 wake_up(&ctx->sq_data->wait);
1726 mutex_unlock(&ctx->uring_lock);
1730 static bool io_bdev_nowait(struct block_device *bdev)
1732 return !bdev || bdev_nowait(bdev);
1736 * If we tracked the file through the SCM inflight mechanism, we could support
1737 * any file. For now, just ensure that anything potentially problematic is done
1740 static bool __io_file_supports_nowait(struct file *file, umode_t mode)
1742 if (S_ISBLK(mode)) {
1743 if (IS_ENABLED(CONFIG_BLOCK) &&
1744 io_bdev_nowait(I_BDEV(file->f_mapping->host)))
1750 if (S_ISREG(mode)) {
1751 if (IS_ENABLED(CONFIG_BLOCK) &&
1752 io_bdev_nowait(file->f_inode->i_sb->s_bdev) &&
1753 !io_is_uring_fops(file))
1758 /* any ->read/write should understand O_NONBLOCK */
1759 if (file->f_flags & O_NONBLOCK)
1761 return file->f_mode & FMODE_NOWAIT;
1765 * If we tracked the file through the SCM inflight mechanism, we could support
1766 * any file. For now, just ensure that anything potentially problematic is done
1769 unsigned int io_file_get_flags(struct file *file)
1771 umode_t mode = file_inode(file)->i_mode;
1772 unsigned int res = 0;
1776 if (__io_file_supports_nowait(file, mode))
1781 bool io_alloc_async_data(struct io_kiocb *req)
1783 WARN_ON_ONCE(!io_cold_defs[req->opcode].async_size);
1784 req->async_data = kmalloc(io_cold_defs[req->opcode].async_size, GFP_KERNEL);
1785 if (req->async_data) {
1786 req->flags |= REQ_F_ASYNC_DATA;
1792 int io_req_prep_async(struct io_kiocb *req)
1794 const struct io_cold_def *cdef = &io_cold_defs[req->opcode];
1795 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1797 /* assign early for deferred execution for non-fixed file */
1798 if (def->needs_file && !(req->flags & REQ_F_FIXED_FILE) && !req->file)
1799 req->file = io_file_get_normal(req, req->cqe.fd);
1800 if (!cdef->prep_async)
1802 if (WARN_ON_ONCE(req_has_async_data(req)))
1804 if (!def->manual_alloc) {
1805 if (io_alloc_async_data(req))
1808 return cdef->prep_async(req);
1811 static u32 io_get_sequence(struct io_kiocb *req)
1813 u32 seq = req->ctx->cached_sq_head;
1814 struct io_kiocb *cur;
1816 /* need original cached_sq_head, but it was increased for each req */
1817 io_for_each_link(cur, req)
1822 static __cold void io_drain_req(struct io_kiocb *req)
1823 __must_hold(&ctx->uring_lock)
1825 struct io_ring_ctx *ctx = req->ctx;
1826 struct io_defer_entry *de;
1828 u32 seq = io_get_sequence(req);
1830 /* Still need defer if there is pending req in defer list. */
1831 spin_lock(&ctx->completion_lock);
1832 if (!req_need_defer(req, seq) && list_empty_careful(&ctx->defer_list)) {
1833 spin_unlock(&ctx->completion_lock);
1835 ctx->drain_active = false;
1836 io_req_task_queue(req);
1839 spin_unlock(&ctx->completion_lock);
1841 io_prep_async_link(req);
1842 de = kmalloc(sizeof(*de), GFP_KERNEL);
1845 io_req_defer_failed(req, ret);
1849 spin_lock(&ctx->completion_lock);
1850 if (!req_need_defer(req, seq) && list_empty(&ctx->defer_list)) {
1851 spin_unlock(&ctx->completion_lock);
1856 trace_io_uring_defer(req);
1859 list_add_tail(&de->list, &ctx->defer_list);
1860 spin_unlock(&ctx->completion_lock);
1863 static void io_clean_op(struct io_kiocb *req)
1865 if (req->flags & REQ_F_BUFFER_SELECTED) {
1866 spin_lock(&req->ctx->completion_lock);
1867 io_put_kbuf_comp(req);
1868 spin_unlock(&req->ctx->completion_lock);
1871 if (req->flags & REQ_F_NEED_CLEANUP) {
1872 const struct io_cold_def *def = &io_cold_defs[req->opcode];
1877 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1878 kfree(req->apoll->double_poll);
1882 if (req->flags & REQ_F_INFLIGHT) {
1883 struct io_uring_task *tctx = req->task->io_uring;
1885 atomic_dec(&tctx->inflight_tracked);
1887 if (req->flags & REQ_F_CREDS)
1888 put_cred(req->creds);
1889 if (req->flags & REQ_F_ASYNC_DATA) {
1890 kfree(req->async_data);
1891 req->async_data = NULL;
1893 req->flags &= ~IO_REQ_CLEAN_FLAGS;
1896 static bool io_assign_file(struct io_kiocb *req, const struct io_issue_def *def,
1897 unsigned int issue_flags)
1899 if (req->file || !def->needs_file)
1902 if (req->flags & REQ_F_FIXED_FILE)
1903 req->file = io_file_get_fixed(req, req->cqe.fd, issue_flags);
1905 req->file = io_file_get_normal(req, req->cqe.fd);
1910 static int io_issue_sqe(struct io_kiocb *req, unsigned int issue_flags)
1912 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1913 const struct cred *creds = NULL;
1916 if (unlikely(!io_assign_file(req, def, issue_flags)))
1919 if (unlikely((req->flags & REQ_F_CREDS) && req->creds != current_cred()))
1920 creds = override_creds(req->creds);
1922 if (!def->audit_skip)
1923 audit_uring_entry(req->opcode);
1925 ret = def->issue(req, issue_flags);
1927 if (!def->audit_skip)
1928 audit_uring_exit(!ret, ret);
1931 revert_creds(creds);
1933 if (ret == IOU_OK) {
1934 if (issue_flags & IO_URING_F_COMPLETE_DEFER)
1935 io_req_complete_defer(req);
1937 io_req_complete_post(req, issue_flags);
1938 } else if (ret != IOU_ISSUE_SKIP_COMPLETE)
1941 /* If the op doesn't have a file, we're not polling for it */
1942 if ((req->ctx->flags & IORING_SETUP_IOPOLL) && def->iopoll_queue)
1943 io_iopoll_req_issued(req, issue_flags);
1948 int io_poll_issue(struct io_kiocb *req, struct io_tw_state *ts)
1950 io_tw_lock(req->ctx, ts);
1951 return io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_MULTISHOT|
1952 IO_URING_F_COMPLETE_DEFER);
1955 struct io_wq_work *io_wq_free_work(struct io_wq_work *work)
1957 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1959 req = io_put_req_find_next(req);
1960 return req ? &req->work : NULL;
1963 void io_wq_submit_work(struct io_wq_work *work)
1965 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1966 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1967 unsigned int issue_flags = IO_URING_F_UNLOCKED | IO_URING_F_IOWQ;
1968 bool needs_poll = false;
1969 int ret = 0, err = -ECANCELED;
1971 /* one will be dropped by ->io_wq_free_work() after returning to io-wq */
1972 if (!(req->flags & REQ_F_REFCOUNT))
1973 __io_req_set_refcount(req, 2);
1977 io_arm_ltimeout(req);
1979 /* either cancelled or io-wq is dying, so don't touch tctx->iowq */
1980 if (work->flags & IO_WQ_WORK_CANCEL) {
1982 io_req_task_queue_fail(req, err);
1985 if (!io_assign_file(req, def, issue_flags)) {
1987 work->flags |= IO_WQ_WORK_CANCEL;
1991 if (req->flags & REQ_F_FORCE_ASYNC) {
1992 bool opcode_poll = def->pollin || def->pollout;
1994 if (opcode_poll && file_can_poll(req->file)) {
1996 issue_flags |= IO_URING_F_NONBLOCK;
2001 ret = io_issue_sqe(req, issue_flags);
2005 * We can get EAGAIN for iopolled IO even though we're
2006 * forcing a sync submission from here, since we can't
2007 * wait for request slots on the block side.
2010 if (!(req->ctx->flags & IORING_SETUP_IOPOLL))
2016 if (io_arm_poll_handler(req, issue_flags) == IO_APOLL_OK)
2018 /* aborted or ready, in either case retry blocking */
2020 issue_flags &= ~IO_URING_F_NONBLOCK;
2023 /* avoid locking problems by failing it from a clean context */
2025 io_req_task_queue_fail(req, ret);
2028 inline struct file *io_file_get_fixed(struct io_kiocb *req, int fd,
2029 unsigned int issue_flags)
2031 struct io_ring_ctx *ctx = req->ctx;
2032 struct file *file = NULL;
2033 unsigned long file_ptr;
2035 io_ring_submit_lock(ctx, issue_flags);
2037 if (unlikely((unsigned int)fd >= ctx->nr_user_files))
2039 fd = array_index_nospec(fd, ctx->nr_user_files);
2040 file_ptr = io_fixed_file_slot(&ctx->file_table, fd)->file_ptr;
2041 file = (struct file *) (file_ptr & FFS_MASK);
2042 file_ptr &= ~FFS_MASK;
2043 /* mask in overlapping REQ_F and FFS bits */
2044 req->flags |= (file_ptr << REQ_F_SUPPORT_NOWAIT_BIT);
2045 io_req_set_rsrc_node(req, ctx, 0);
2047 io_ring_submit_unlock(ctx, issue_flags);
2051 struct file *io_file_get_normal(struct io_kiocb *req, int fd)
2053 struct file *file = fget(fd);
2055 trace_io_uring_file_get(req, fd);
2057 /* we don't allow fixed io_uring files */
2058 if (file && io_is_uring_fops(file))
2059 io_req_track_inflight(req);
2063 static void io_queue_async(struct io_kiocb *req, int ret)
2064 __must_hold(&req->ctx->uring_lock)
2066 struct io_kiocb *linked_timeout;
2068 if (ret != -EAGAIN || (req->flags & REQ_F_NOWAIT)) {
2069 io_req_defer_failed(req, ret);
2073 linked_timeout = io_prep_linked_timeout(req);
2075 switch (io_arm_poll_handler(req, 0)) {
2076 case IO_APOLL_READY:
2077 io_kbuf_recycle(req, 0);
2078 io_req_task_queue(req);
2080 case IO_APOLL_ABORTED:
2081 io_kbuf_recycle(req, 0);
2082 io_queue_iowq(req, NULL);
2089 io_queue_linked_timeout(linked_timeout);
2092 static inline void io_queue_sqe(struct io_kiocb *req)
2093 __must_hold(&req->ctx->uring_lock)
2097 ret = io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_COMPLETE_DEFER);
2100 * We async punt it if the file wasn't marked NOWAIT, or if the file
2101 * doesn't support non-blocking read/write attempts
2104 io_arm_ltimeout(req);
2106 io_queue_async(req, ret);
2109 static void io_queue_sqe_fallback(struct io_kiocb *req)
2110 __must_hold(&req->ctx->uring_lock)
2112 if (unlikely(req->flags & REQ_F_FAIL)) {
2114 * We don't submit, fail them all, for that replace hardlinks
2115 * with normal links. Extra REQ_F_LINK is tolerated.
2117 req->flags &= ~REQ_F_HARDLINK;
2118 req->flags |= REQ_F_LINK;
2119 io_req_defer_failed(req, req->cqe.res);
2121 int ret = io_req_prep_async(req);
2123 if (unlikely(ret)) {
2124 io_req_defer_failed(req, ret);
2128 if (unlikely(req->ctx->drain_active))
2131 io_queue_iowq(req, NULL);
2136 * Check SQE restrictions (opcode and flags).
2138 * Returns 'true' if SQE is allowed, 'false' otherwise.
2140 static inline bool io_check_restriction(struct io_ring_ctx *ctx,
2141 struct io_kiocb *req,
2142 unsigned int sqe_flags)
2144 if (!test_bit(req->opcode, ctx->restrictions.sqe_op))
2147 if ((sqe_flags & ctx->restrictions.sqe_flags_required) !=
2148 ctx->restrictions.sqe_flags_required)
2151 if (sqe_flags & ~(ctx->restrictions.sqe_flags_allowed |
2152 ctx->restrictions.sqe_flags_required))
2158 static void io_init_req_drain(struct io_kiocb *req)
2160 struct io_ring_ctx *ctx = req->ctx;
2161 struct io_kiocb *head = ctx->submit_state.link.head;
2163 ctx->drain_active = true;
2166 * If we need to drain a request in the middle of a link, drain
2167 * the head request and the next request/link after the current
2168 * link. Considering sequential execution of links,
2169 * REQ_F_IO_DRAIN will be maintained for every request of our
2172 head->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2173 ctx->drain_next = true;
2177 static int io_init_req(struct io_ring_ctx *ctx, struct io_kiocb *req,
2178 const struct io_uring_sqe *sqe)
2179 __must_hold(&ctx->uring_lock)
2181 const struct io_issue_def *def;
2182 unsigned int sqe_flags;
2186 /* req is partially pre-initialised, see io_preinit_req() */
2187 req->opcode = opcode = READ_ONCE(sqe->opcode);
2188 /* same numerical values with corresponding REQ_F_*, safe to copy */
2189 req->flags = sqe_flags = READ_ONCE(sqe->flags);
2190 req->cqe.user_data = READ_ONCE(sqe->user_data);
2192 req->rsrc_node = NULL;
2193 req->task = current;
2195 if (unlikely(opcode >= IORING_OP_LAST)) {
2199 def = &io_issue_defs[opcode];
2200 if (unlikely(sqe_flags & ~SQE_COMMON_FLAGS)) {
2201 /* enforce forwards compatibility on users */
2202 if (sqe_flags & ~SQE_VALID_FLAGS)
2204 if (sqe_flags & IOSQE_BUFFER_SELECT) {
2205 if (!def->buffer_select)
2207 req->buf_index = READ_ONCE(sqe->buf_group);
2209 if (sqe_flags & IOSQE_CQE_SKIP_SUCCESS)
2210 ctx->drain_disabled = true;
2211 if (sqe_flags & IOSQE_IO_DRAIN) {
2212 if (ctx->drain_disabled)
2214 io_init_req_drain(req);
2217 if (unlikely(ctx->restricted || ctx->drain_active || ctx->drain_next)) {
2218 if (ctx->restricted && !io_check_restriction(ctx, req, sqe_flags))
2220 /* knock it to the slow queue path, will be drained there */
2221 if (ctx->drain_active)
2222 req->flags |= REQ_F_FORCE_ASYNC;
2223 /* if there is no link, we're at "next" request and need to drain */
2224 if (unlikely(ctx->drain_next) && !ctx->submit_state.link.head) {
2225 ctx->drain_next = false;
2226 ctx->drain_active = true;
2227 req->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2231 if (!def->ioprio && sqe->ioprio)
2233 if (!def->iopoll && (ctx->flags & IORING_SETUP_IOPOLL))
2236 if (def->needs_file) {
2237 struct io_submit_state *state = &ctx->submit_state;
2239 req->cqe.fd = READ_ONCE(sqe->fd);
2242 * Plug now if we have more than 2 IO left after this, and the
2243 * target is potentially a read/write to block based storage.
2245 if (state->need_plug && def->plug) {
2246 state->plug_started = true;
2247 state->need_plug = false;
2248 blk_start_plug_nr_ios(&state->plug, state->submit_nr);
2252 personality = READ_ONCE(sqe->personality);
2256 req->creds = xa_load(&ctx->personalities, personality);
2259 get_cred(req->creds);
2260 ret = security_uring_override_creds(req->creds);
2262 put_cred(req->creds);
2265 req->flags |= REQ_F_CREDS;
2268 return def->prep(req, sqe);
2271 static __cold int io_submit_fail_init(const struct io_uring_sqe *sqe,
2272 struct io_kiocb *req, int ret)
2274 struct io_ring_ctx *ctx = req->ctx;
2275 struct io_submit_link *link = &ctx->submit_state.link;
2276 struct io_kiocb *head = link->head;
2278 trace_io_uring_req_failed(sqe, req, ret);
2281 * Avoid breaking links in the middle as it renders links with SQPOLL
2282 * unusable. Instead of failing eagerly, continue assembling the link if
2283 * applicable and mark the head with REQ_F_FAIL. The link flushing code
2284 * should find the flag and handle the rest.
2286 req_fail_link_node(req, ret);
2287 if (head && !(head->flags & REQ_F_FAIL))
2288 req_fail_link_node(head, -ECANCELED);
2290 if (!(req->flags & IO_REQ_LINK_FLAGS)) {
2292 link->last->link = req;
2296 io_queue_sqe_fallback(req);
2301 link->last->link = req;
2308 static inline int io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req,
2309 const struct io_uring_sqe *sqe)
2310 __must_hold(&ctx->uring_lock)
2312 struct io_submit_link *link = &ctx->submit_state.link;
2315 ret = io_init_req(ctx, req, sqe);
2317 return io_submit_fail_init(sqe, req, ret);
2319 trace_io_uring_submit_req(req);
2322 * If we already have a head request, queue this one for async
2323 * submittal once the head completes. If we don't have a head but
2324 * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be
2325 * submitted sync once the chain is complete. If none of those
2326 * conditions are true (normal request), then just queue it.
2328 if (unlikely(link->head)) {
2329 ret = io_req_prep_async(req);
2331 return io_submit_fail_init(sqe, req, ret);
2333 trace_io_uring_link(req, link->head);
2334 link->last->link = req;
2337 if (req->flags & IO_REQ_LINK_FLAGS)
2339 /* last request of the link, flush it */
2342 if (req->flags & (REQ_F_FORCE_ASYNC | REQ_F_FAIL))
2345 } else if (unlikely(req->flags & (IO_REQ_LINK_FLAGS |
2346 REQ_F_FORCE_ASYNC | REQ_F_FAIL))) {
2347 if (req->flags & IO_REQ_LINK_FLAGS) {
2352 io_queue_sqe_fallback(req);
2362 * Batched submission is done, ensure local IO is flushed out.
2364 static void io_submit_state_end(struct io_ring_ctx *ctx)
2366 struct io_submit_state *state = &ctx->submit_state;
2368 if (unlikely(state->link.head))
2369 io_queue_sqe_fallback(state->link.head);
2370 /* flush only after queuing links as they can generate completions */
2371 io_submit_flush_completions(ctx);
2372 if (state->plug_started)
2373 blk_finish_plug(&state->plug);
2377 * Start submission side cache.
2379 static void io_submit_state_start(struct io_submit_state *state,
2380 unsigned int max_ios)
2382 state->plug_started = false;
2383 state->need_plug = max_ios > 2;
2384 state->submit_nr = max_ios;
2385 /* set only head, no need to init link_last in advance */
2386 state->link.head = NULL;
2389 static void io_commit_sqring(struct io_ring_ctx *ctx)
2391 struct io_rings *rings = ctx->rings;
2394 * Ensure any loads from the SQEs are done at this point,
2395 * since once we write the new head, the application could
2396 * write new data to them.
2398 smp_store_release(&rings->sq.head, ctx->cached_sq_head);
2402 * Fetch an sqe, if one is available. Note this returns a pointer to memory
2403 * that is mapped by userspace. This means that care needs to be taken to
2404 * ensure that reads are stable, as we cannot rely on userspace always
2405 * being a good citizen. If members of the sqe are validated and then later
2406 * used, it's important that those reads are done through READ_ONCE() to
2407 * prevent a re-load down the line.
2409 static bool io_get_sqe(struct io_ring_ctx *ctx, const struct io_uring_sqe **sqe)
2411 unsigned head, mask = ctx->sq_entries - 1;
2412 unsigned sq_idx = ctx->cached_sq_head++ & mask;
2415 * The cached sq head (or cq tail) serves two purposes:
2417 * 1) allows us to batch the cost of updating the user visible
2419 * 2) allows the kernel side to track the head on its own, even
2420 * though the application is the one updating it.
2422 head = READ_ONCE(ctx->sq_array[sq_idx]);
2423 if (likely(head < ctx->sq_entries)) {
2424 /* double index for 128-byte SQEs, twice as long */
2425 if (ctx->flags & IORING_SETUP_SQE128)
2427 *sqe = &ctx->sq_sqes[head];
2431 /* drop invalid entries */
2433 WRITE_ONCE(ctx->rings->sq_dropped,
2434 READ_ONCE(ctx->rings->sq_dropped) + 1);
2438 int io_submit_sqes(struct io_ring_ctx *ctx, unsigned int nr)
2439 __must_hold(&ctx->uring_lock)
2441 unsigned int entries = io_sqring_entries(ctx);
2445 if (unlikely(!entries))
2447 /* make sure SQ entry isn't read before tail */
2448 ret = left = min(nr, entries);
2449 io_get_task_refs(left);
2450 io_submit_state_start(&ctx->submit_state, left);
2453 const struct io_uring_sqe *sqe;
2454 struct io_kiocb *req;
2456 if (unlikely(!io_alloc_req(ctx, &req)))
2458 if (unlikely(!io_get_sqe(ctx, &sqe))) {
2459 io_req_add_to_cache(req, ctx);
2464 * Continue submitting even for sqe failure if the
2465 * ring was setup with IORING_SETUP_SUBMIT_ALL
2467 if (unlikely(io_submit_sqe(ctx, req, sqe)) &&
2468 !(ctx->flags & IORING_SETUP_SUBMIT_ALL)) {
2474 if (unlikely(left)) {
2476 /* try again if it submitted nothing and can't allocate a req */
2477 if (!ret && io_req_cache_empty(ctx))
2479 current->io_uring->cached_refs += left;
2482 io_submit_state_end(ctx);
2483 /* Commit SQ ring head once we've consumed and submitted all SQEs */
2484 io_commit_sqring(ctx);
2488 struct io_wait_queue {
2489 struct wait_queue_entry wq;
2490 struct io_ring_ctx *ctx;
2492 unsigned nr_timeouts;
2496 static inline bool io_has_work(struct io_ring_ctx *ctx)
2498 return test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq) ||
2499 !llist_empty(&ctx->work_llist);
2502 static inline bool io_should_wake(struct io_wait_queue *iowq)
2504 struct io_ring_ctx *ctx = iowq->ctx;
2505 int dist = READ_ONCE(ctx->rings->cq.tail) - (int) iowq->cq_tail;
2508 * Wake up if we have enough events, or if a timeout occurred since we
2509 * started waiting. For timeouts, we always want to return to userspace,
2510 * regardless of event count.
2512 return dist >= 0 || atomic_read(&ctx->cq_timeouts) != iowq->nr_timeouts;
2515 static int io_wake_function(struct wait_queue_entry *curr, unsigned int mode,
2516 int wake_flags, void *key)
2518 struct io_wait_queue *iowq = container_of(curr, struct io_wait_queue, wq);
2521 * Cannot safely flush overflowed CQEs from here, ensure we wake up
2522 * the task, and the next invocation will do it.
2524 if (io_should_wake(iowq) || io_has_work(iowq->ctx))
2525 return autoremove_wake_function(curr, mode, wake_flags, key);
2529 int io_run_task_work_sig(struct io_ring_ctx *ctx)
2531 if (!llist_empty(&ctx->work_llist)) {
2532 __set_current_state(TASK_RUNNING);
2533 if (io_run_local_work(ctx) > 0)
2536 if (io_run_task_work() > 0)
2538 if (task_sigpending(current))
2543 /* when returns >0, the caller should retry */
2544 static inline int io_cqring_wait_schedule(struct io_ring_ctx *ctx,
2545 struct io_wait_queue *iowq)
2547 if (unlikely(READ_ONCE(ctx->check_cq)))
2549 if (unlikely(!llist_empty(&ctx->work_llist)))
2551 if (unlikely(test_thread_flag(TIF_NOTIFY_SIGNAL)))
2553 if (unlikely(task_sigpending(current)))
2555 if (unlikely(io_should_wake(iowq)))
2557 if (iowq->timeout == KTIME_MAX)
2559 else if (!schedule_hrtimeout(&iowq->timeout, HRTIMER_MODE_ABS))
2565 * Wait until events become available, if we don't already have some. The
2566 * application must reap them itself, as they reside on the shared cq ring.
2568 static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events,
2569 const sigset_t __user *sig, size_t sigsz,
2570 struct __kernel_timespec __user *uts)
2572 struct io_wait_queue iowq;
2573 struct io_rings *rings = ctx->rings;
2576 if (!io_allowed_run_tw(ctx))
2578 if (!llist_empty(&ctx->work_llist))
2579 io_run_local_work(ctx);
2581 io_cqring_overflow_flush(ctx);
2582 /* if user messes with these they will just get an early return */
2583 if (__io_cqring_events_user(ctx) >= min_events)
2587 #ifdef CONFIG_COMPAT
2588 if (in_compat_syscall())
2589 ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig,
2593 ret = set_user_sigmask(sig, sigsz);
2599 init_waitqueue_func_entry(&iowq.wq, io_wake_function);
2600 iowq.wq.private = current;
2601 INIT_LIST_HEAD(&iowq.wq.entry);
2603 iowq.nr_timeouts = atomic_read(&ctx->cq_timeouts);
2604 iowq.cq_tail = READ_ONCE(ctx->rings->cq.head) + min_events;
2605 iowq.timeout = KTIME_MAX;
2608 struct timespec64 ts;
2610 if (get_timespec64(&ts, uts))
2612 iowq.timeout = ktime_add_ns(timespec64_to_ktime(ts), ktime_get_ns());
2615 trace_io_uring_cqring_wait(ctx, min_events);
2617 unsigned long check_cq;
2619 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
2620 WRITE_ONCE(ctx->cq_waiting, 1);
2621 set_current_state(TASK_INTERRUPTIBLE);
2623 prepare_to_wait_exclusive(&ctx->cq_wait, &iowq.wq,
2624 TASK_INTERRUPTIBLE);
2627 ret = io_cqring_wait_schedule(ctx, &iowq);
2628 __set_current_state(TASK_RUNNING);
2629 WRITE_ONCE(ctx->cq_waiting, 0);
2634 * Run task_work after scheduling and before io_should_wake().
2635 * If we got woken because of task_work being processed, run it
2636 * now rather than let the caller do another wait loop.
2639 if (!llist_empty(&ctx->work_llist))
2640 io_run_local_work(ctx);
2642 check_cq = READ_ONCE(ctx->check_cq);
2643 if (unlikely(check_cq)) {
2644 /* let the caller flush overflows, retry */
2645 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
2646 io_cqring_do_overflow_flush(ctx);
2647 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT)) {
2653 if (io_should_wake(&iowq)) {
2660 if (!(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
2661 finish_wait(&ctx->cq_wait, &iowq.wq);
2662 restore_saved_sigmask_unless(ret == -EINTR);
2664 return READ_ONCE(rings->cq.head) == READ_ONCE(rings->cq.tail) ? ret : 0;
2667 static void io_mem_free(void *ptr)
2674 page = virt_to_head_page(ptr);
2675 if (put_page_testzero(page))
2676 free_compound_page(page);
2679 static void *io_mem_alloc(size_t size)
2681 gfp_t gfp = GFP_KERNEL_ACCOUNT | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP;
2683 return (void *) __get_free_pages(gfp, get_order(size));
2686 static unsigned long rings_size(struct io_ring_ctx *ctx, unsigned int sq_entries,
2687 unsigned int cq_entries, size_t *sq_offset)
2689 struct io_rings *rings;
2690 size_t off, sq_array_size;
2692 off = struct_size(rings, cqes, cq_entries);
2693 if (off == SIZE_MAX)
2695 if (ctx->flags & IORING_SETUP_CQE32) {
2696 if (check_shl_overflow(off, 1, &off))
2701 off = ALIGN(off, SMP_CACHE_BYTES);
2709 sq_array_size = array_size(sizeof(u32), sq_entries);
2710 if (sq_array_size == SIZE_MAX)
2713 if (check_add_overflow(off, sq_array_size, &off))
2719 static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg,
2720 unsigned int eventfd_async)
2722 struct io_ev_fd *ev_fd;
2723 __s32 __user *fds = arg;
2726 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2727 lockdep_is_held(&ctx->uring_lock));
2731 if (copy_from_user(&fd, fds, sizeof(*fds)))
2734 ev_fd = kmalloc(sizeof(*ev_fd), GFP_KERNEL);
2738 ev_fd->cq_ev_fd = eventfd_ctx_fdget(fd);
2739 if (IS_ERR(ev_fd->cq_ev_fd)) {
2740 int ret = PTR_ERR(ev_fd->cq_ev_fd);
2745 spin_lock(&ctx->completion_lock);
2746 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
2747 spin_unlock(&ctx->completion_lock);
2749 ev_fd->eventfd_async = eventfd_async;
2750 ctx->has_evfd = true;
2751 rcu_assign_pointer(ctx->io_ev_fd, ev_fd);
2752 atomic_set(&ev_fd->refs, 1);
2753 atomic_set(&ev_fd->ops, 0);
2757 static int io_eventfd_unregister(struct io_ring_ctx *ctx)
2759 struct io_ev_fd *ev_fd;
2761 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2762 lockdep_is_held(&ctx->uring_lock));
2764 ctx->has_evfd = false;
2765 rcu_assign_pointer(ctx->io_ev_fd, NULL);
2766 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_FREE_BIT), &ev_fd->ops))
2767 call_rcu(&ev_fd->rcu, io_eventfd_ops);
2774 static void io_req_caches_free(struct io_ring_ctx *ctx)
2776 struct io_kiocb *req;
2779 mutex_lock(&ctx->uring_lock);
2780 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
2782 while (!io_req_cache_empty(ctx)) {
2783 req = io_extract_req(ctx);
2784 kmem_cache_free(req_cachep, req);
2788 percpu_ref_put_many(&ctx->refs, nr);
2789 mutex_unlock(&ctx->uring_lock);
2792 static void io_rsrc_node_cache_free(struct io_cache_entry *entry)
2794 kfree(container_of(entry, struct io_rsrc_node, cache));
2797 static __cold void io_ring_ctx_free(struct io_ring_ctx *ctx)
2799 io_sq_thread_finish(ctx);
2800 /* __io_rsrc_put_work() may need uring_lock to progress, wait w/o it */
2801 io_wait_rsrc_data(ctx->buf_data);
2802 io_wait_rsrc_data(ctx->file_data);
2804 mutex_lock(&ctx->uring_lock);
2806 __io_sqe_buffers_unregister(ctx);
2808 __io_sqe_files_unregister(ctx);
2809 io_cqring_overflow_kill(ctx);
2810 io_eventfd_unregister(ctx);
2811 io_alloc_cache_free(&ctx->apoll_cache, io_apoll_cache_free);
2812 io_alloc_cache_free(&ctx->netmsg_cache, io_netmsg_cache_free);
2813 mutex_unlock(&ctx->uring_lock);
2814 io_destroy_buffers(ctx);
2816 put_cred(ctx->sq_creds);
2817 if (ctx->submitter_task)
2818 put_task_struct(ctx->submitter_task);
2820 /* there are no registered resources left, nobody uses it */
2822 io_rsrc_node_destroy(ctx, ctx->rsrc_node);
2823 if (ctx->rsrc_backup_node)
2824 io_rsrc_node_destroy(ctx, ctx->rsrc_backup_node);
2826 WARN_ON_ONCE(!list_empty(&ctx->rsrc_ref_list));
2828 #if defined(CONFIG_UNIX)
2829 if (ctx->ring_sock) {
2830 ctx->ring_sock->file = NULL; /* so that iput() is called */
2831 sock_release(ctx->ring_sock);
2834 WARN_ON_ONCE(!list_empty(&ctx->ltimeout_list));
2836 io_alloc_cache_free(&ctx->rsrc_node_cache, io_rsrc_node_cache_free);
2837 if (ctx->mm_account) {
2838 mmdrop(ctx->mm_account);
2839 ctx->mm_account = NULL;
2841 io_mem_free(ctx->rings);
2842 io_mem_free(ctx->sq_sqes);
2844 percpu_ref_exit(&ctx->refs);
2845 free_uid(ctx->user);
2846 io_req_caches_free(ctx);
2848 io_wq_put_hash(ctx->hash_map);
2849 kfree(ctx->cancel_table.hbs);
2850 kfree(ctx->cancel_table_locked.hbs);
2851 kfree(ctx->dummy_ubuf);
2853 xa_destroy(&ctx->io_bl_xa);
2857 static __cold void io_activate_pollwq_cb(struct callback_head *cb)
2859 struct io_ring_ctx *ctx = container_of(cb, struct io_ring_ctx,
2862 mutex_lock(&ctx->uring_lock);
2863 ctx->poll_activated = true;
2864 mutex_unlock(&ctx->uring_lock);
2867 * Wake ups for some events between start of polling and activation
2868 * might've been lost due to loose synchronisation.
2870 wake_up_all(&ctx->poll_wq);
2871 percpu_ref_put(&ctx->refs);
2874 static __cold void io_activate_pollwq(struct io_ring_ctx *ctx)
2876 spin_lock(&ctx->completion_lock);
2877 /* already activated or in progress */
2878 if (ctx->poll_activated || ctx->poll_wq_task_work.func)
2880 if (WARN_ON_ONCE(!ctx->task_complete))
2882 if (!ctx->submitter_task)
2885 * with ->submitter_task only the submitter task completes requests, we
2886 * only need to sync with it, which is done by injecting a tw
2888 init_task_work(&ctx->poll_wq_task_work, io_activate_pollwq_cb);
2889 percpu_ref_get(&ctx->refs);
2890 if (task_work_add(ctx->submitter_task, &ctx->poll_wq_task_work, TWA_SIGNAL))
2891 percpu_ref_put(&ctx->refs);
2893 spin_unlock(&ctx->completion_lock);
2896 static __poll_t io_uring_poll(struct file *file, poll_table *wait)
2898 struct io_ring_ctx *ctx = file->private_data;
2901 if (unlikely(!ctx->poll_activated))
2902 io_activate_pollwq(ctx);
2904 poll_wait(file, &ctx->poll_wq, wait);
2906 * synchronizes with barrier from wq_has_sleeper call in
2910 if (!io_sqring_full(ctx))
2911 mask |= EPOLLOUT | EPOLLWRNORM;
2914 * Don't flush cqring overflow list here, just do a simple check.
2915 * Otherwise there could possible be ABBA deadlock:
2918 * lock(&ctx->uring_lock);
2920 * lock(&ctx->uring_lock);
2923 * Users may get EPOLLIN meanwhile seeing nothing in cqring, this
2924 * pushes them to do the flush.
2927 if (__io_cqring_events_user(ctx) || io_has_work(ctx))
2928 mask |= EPOLLIN | EPOLLRDNORM;
2933 static int io_unregister_personality(struct io_ring_ctx *ctx, unsigned id)
2935 const struct cred *creds;
2937 creds = xa_erase(&ctx->personalities, id);
2946 struct io_tctx_exit {
2947 struct callback_head task_work;
2948 struct completion completion;
2949 struct io_ring_ctx *ctx;
2952 static __cold void io_tctx_exit_cb(struct callback_head *cb)
2954 struct io_uring_task *tctx = current->io_uring;
2955 struct io_tctx_exit *work;
2957 work = container_of(cb, struct io_tctx_exit, task_work);
2959 * When @in_cancel, we're in cancellation and it's racy to remove the
2960 * node. It'll be removed by the end of cancellation, just ignore it.
2961 * tctx can be NULL if the queueing of this task_work raced with
2962 * work cancelation off the exec path.
2964 if (tctx && !atomic_read(&tctx->in_cancel))
2965 io_uring_del_tctx_node((unsigned long)work->ctx);
2966 complete(&work->completion);
2969 static __cold bool io_cancel_ctx_cb(struct io_wq_work *work, void *data)
2971 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
2973 return req->ctx == data;
2976 static __cold void io_ring_exit_work(struct work_struct *work)
2978 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, exit_work);
2979 unsigned long timeout = jiffies + HZ * 60 * 5;
2980 unsigned long interval = HZ / 20;
2981 struct io_tctx_exit exit;
2982 struct io_tctx_node *node;
2986 * If we're doing polled IO and end up having requests being
2987 * submitted async (out-of-line), then completions can come in while
2988 * we're waiting for refs to drop. We need to reap these manually,
2989 * as nobody else will be looking for them.
2992 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) {
2993 mutex_lock(&ctx->uring_lock);
2994 io_cqring_overflow_kill(ctx);
2995 mutex_unlock(&ctx->uring_lock);
2998 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
2999 io_move_task_work_from_local(ctx);
3001 while (io_uring_try_cancel_requests(ctx, NULL, true))
3005 struct io_sq_data *sqd = ctx->sq_data;
3006 struct task_struct *tsk;
3008 io_sq_thread_park(sqd);
3010 if (tsk && tsk->io_uring && tsk->io_uring->io_wq)
3011 io_wq_cancel_cb(tsk->io_uring->io_wq,
3012 io_cancel_ctx_cb, ctx, true);
3013 io_sq_thread_unpark(sqd);
3016 io_req_caches_free(ctx);
3018 if (WARN_ON_ONCE(time_after(jiffies, timeout))) {
3019 /* there is little hope left, don't run it too often */
3022 } while (!wait_for_completion_timeout(&ctx->ref_comp, interval));
3024 init_completion(&exit.completion);
3025 init_task_work(&exit.task_work, io_tctx_exit_cb);
3028 * Some may use context even when all refs and requests have been put,
3029 * and they are free to do so while still holding uring_lock or
3030 * completion_lock, see io_req_task_submit(). Apart from other work,
3031 * this lock/unlock section also waits them to finish.
3033 mutex_lock(&ctx->uring_lock);
3034 while (!list_empty(&ctx->tctx_list)) {
3035 WARN_ON_ONCE(time_after(jiffies, timeout));
3037 node = list_first_entry(&ctx->tctx_list, struct io_tctx_node,
3039 /* don't spin on a single task if cancellation failed */
3040 list_rotate_left(&ctx->tctx_list);
3041 ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL);
3042 if (WARN_ON_ONCE(ret))
3045 mutex_unlock(&ctx->uring_lock);
3046 wait_for_completion(&exit.completion);
3047 mutex_lock(&ctx->uring_lock);
3049 mutex_unlock(&ctx->uring_lock);
3050 spin_lock(&ctx->completion_lock);
3051 spin_unlock(&ctx->completion_lock);
3053 /* pairs with RCU read section in io_req_local_work_add() */
3054 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
3057 io_ring_ctx_free(ctx);
3060 static __cold void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx)
3062 unsigned long index;
3063 struct creds *creds;
3065 mutex_lock(&ctx->uring_lock);
3066 percpu_ref_kill(&ctx->refs);
3067 xa_for_each(&ctx->personalities, index, creds)
3068 io_unregister_personality(ctx, index);
3070 io_poll_remove_all(ctx, NULL, true);
3071 mutex_unlock(&ctx->uring_lock);
3074 * If we failed setting up the ctx, we might not have any rings
3075 * and therefore did not submit any requests
3078 io_kill_timeouts(ctx, NULL, true);
3080 INIT_WORK(&ctx->exit_work, io_ring_exit_work);
3082 * Use system_unbound_wq to avoid spawning tons of event kworkers
3083 * if we're exiting a ton of rings at the same time. It just adds
3084 * noise and overhead, there's no discernable change in runtime
3085 * over using system_wq.
3087 queue_work(system_unbound_wq, &ctx->exit_work);
3090 static int io_uring_release(struct inode *inode, struct file *file)
3092 struct io_ring_ctx *ctx = file->private_data;
3094 file->private_data = NULL;
3095 io_ring_ctx_wait_and_kill(ctx);
3099 struct io_task_cancel {
3100 struct task_struct *task;
3104 static bool io_cancel_task_cb(struct io_wq_work *work, void *data)
3106 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
3107 struct io_task_cancel *cancel = data;
3109 return io_match_task_safe(req, cancel->task, cancel->all);
3112 static __cold bool io_cancel_defer_files(struct io_ring_ctx *ctx,
3113 struct task_struct *task,
3116 struct io_defer_entry *de;
3119 spin_lock(&ctx->completion_lock);
3120 list_for_each_entry_reverse(de, &ctx->defer_list, list) {
3121 if (io_match_task_safe(de->req, task, cancel_all)) {
3122 list_cut_position(&list, &ctx->defer_list, &de->list);
3126 spin_unlock(&ctx->completion_lock);
3127 if (list_empty(&list))
3130 while (!list_empty(&list)) {
3131 de = list_first_entry(&list, struct io_defer_entry, list);
3132 list_del_init(&de->list);
3133 io_req_task_queue_fail(de->req, -ECANCELED);
3139 static __cold bool io_uring_try_cancel_iowq(struct io_ring_ctx *ctx)
3141 struct io_tctx_node *node;
3142 enum io_wq_cancel cret;
3145 mutex_lock(&ctx->uring_lock);
3146 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
3147 struct io_uring_task *tctx = node->task->io_uring;
3150 * io_wq will stay alive while we hold uring_lock, because it's
3151 * killed after ctx nodes, which requires to take the lock.
3153 if (!tctx || !tctx->io_wq)
3155 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_ctx_cb, ctx, true);
3156 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3158 mutex_unlock(&ctx->uring_lock);
3163 static __cold bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
3164 struct task_struct *task,
3167 struct io_task_cancel cancel = { .task = task, .all = cancel_all, };
3168 struct io_uring_task *tctx = task ? task->io_uring : NULL;
3169 enum io_wq_cancel cret;
3172 /* failed during ring init, it couldn't have issued any requests */
3177 ret |= io_uring_try_cancel_iowq(ctx);
3178 } else if (tctx && tctx->io_wq) {
3180 * Cancels requests of all rings, not only @ctx, but
3181 * it's fine as the task is in exit/exec.
3183 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_task_cb,
3185 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3188 /* SQPOLL thread does its own polling */
3189 if ((!(ctx->flags & IORING_SETUP_SQPOLL) && cancel_all) ||
3190 (ctx->sq_data && ctx->sq_data->thread == current)) {
3191 while (!wq_list_empty(&ctx->iopoll_list)) {
3192 io_iopoll_try_reap_events(ctx);
3198 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3199 io_allowed_defer_tw_run(ctx))
3200 ret |= io_run_local_work(ctx) > 0;
3201 ret |= io_cancel_defer_files(ctx, task, cancel_all);
3202 mutex_lock(&ctx->uring_lock);
3203 ret |= io_poll_remove_all(ctx, task, cancel_all);
3204 mutex_unlock(&ctx->uring_lock);
3205 ret |= io_kill_timeouts(ctx, task, cancel_all);
3207 ret |= io_run_task_work() > 0;
3211 static s64 tctx_inflight(struct io_uring_task *tctx, bool tracked)
3214 return atomic_read(&tctx->inflight_tracked);
3215 return percpu_counter_sum(&tctx->inflight);
3219 * Find any io_uring ctx that this task has registered or done IO on, and cancel
3220 * requests. @sqd should be not-null IFF it's an SQPOLL thread cancellation.
3222 __cold void io_uring_cancel_generic(bool cancel_all, struct io_sq_data *sqd)
3224 struct io_uring_task *tctx = current->io_uring;
3225 struct io_ring_ctx *ctx;
3229 WARN_ON_ONCE(sqd && sqd->thread != current);
3231 if (!current->io_uring)
3234 io_wq_exit_start(tctx->io_wq);
3236 atomic_inc(&tctx->in_cancel);
3240 io_uring_drop_tctx_refs(current);
3241 /* read completions before cancelations */
3242 inflight = tctx_inflight(tctx, !cancel_all);
3247 struct io_tctx_node *node;
3248 unsigned long index;
3250 xa_for_each(&tctx->xa, index, node) {
3251 /* sqpoll task will cancel all its requests */
3252 if (node->ctx->sq_data)
3254 loop |= io_uring_try_cancel_requests(node->ctx,
3255 current, cancel_all);
3258 list_for_each_entry(ctx, &sqd->ctx_list, sqd_list)
3259 loop |= io_uring_try_cancel_requests(ctx,
3269 prepare_to_wait(&tctx->wait, &wait, TASK_INTERRUPTIBLE);
3271 io_uring_drop_tctx_refs(current);
3274 * If we've seen completions, retry without waiting. This
3275 * avoids a race where a completion comes in before we did
3276 * prepare_to_wait().
3278 if (inflight == tctx_inflight(tctx, !cancel_all))
3280 finish_wait(&tctx->wait, &wait);
3283 io_uring_clean_tctx(tctx);
3286 * We shouldn't run task_works after cancel, so just leave
3287 * ->in_cancel set for normal exit.
3289 atomic_dec(&tctx->in_cancel);
3290 /* for exec all current's requests should be gone, kill tctx */
3291 __io_uring_free(current);
3295 void __io_uring_cancel(bool cancel_all)
3297 io_uring_cancel_generic(cancel_all, NULL);
3300 static void *io_uring_validate_mmap_request(struct file *file,
3301 loff_t pgoff, size_t sz)
3303 struct io_ring_ctx *ctx = file->private_data;
3304 loff_t offset = pgoff << PAGE_SHIFT;
3308 switch (offset & IORING_OFF_MMAP_MASK) {
3309 case IORING_OFF_SQ_RING:
3310 case IORING_OFF_CQ_RING:
3313 case IORING_OFF_SQES:
3316 case IORING_OFF_PBUF_RING: {
3319 bgid = (offset & ~IORING_OFF_MMAP_MASK) >> IORING_OFF_PBUF_SHIFT;
3320 mutex_lock(&ctx->uring_lock);
3321 ptr = io_pbuf_get_address(ctx, bgid);
3322 mutex_unlock(&ctx->uring_lock);
3324 return ERR_PTR(-EINVAL);
3328 return ERR_PTR(-EINVAL);
3331 page = virt_to_head_page(ptr);
3332 if (sz > page_size(page))
3333 return ERR_PTR(-EINVAL);
3340 static __cold int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3342 size_t sz = vma->vm_end - vma->vm_start;
3346 ptr = io_uring_validate_mmap_request(file, vma->vm_pgoff, sz);
3348 return PTR_ERR(ptr);
3350 pfn = virt_to_phys(ptr) >> PAGE_SHIFT;
3351 return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot);
3354 static unsigned long io_uring_mmu_get_unmapped_area(struct file *filp,
3355 unsigned long addr, unsigned long len,
3356 unsigned long pgoff, unsigned long flags)
3358 const unsigned long mmap_end = arch_get_mmap_end(addr, len, flags);
3359 struct vm_unmapped_area_info info;
3363 * Do not allow to map to user-provided address to avoid breaking the
3364 * aliasing rules. Userspace is not able to guess the offset address of
3365 * kernel kmalloc()ed memory area.
3370 ptr = io_uring_validate_mmap_request(filp, pgoff, len);
3374 info.flags = VM_UNMAPPED_AREA_TOPDOWN;
3376 info.low_limit = max(PAGE_SIZE, mmap_min_addr);
3377 info.high_limit = arch_get_mmap_base(addr, current->mm->mmap_base);
3379 info.align_mask = PAGE_MASK & (SHM_COLOUR - 1UL);
3381 info.align_mask = PAGE_MASK & (SHMLBA - 1UL);
3383 info.align_offset = (unsigned long) ptr;
3386 * A failed mmap() very likely causes application failure,
3387 * so fall back to the bottom-up function here. This scenario
3388 * can happen with large stack limits and large mmap()
3391 addr = vm_unmapped_area(&info);
3392 if (offset_in_page(addr)) {
3394 info.low_limit = TASK_UNMAPPED_BASE;
3395 info.high_limit = mmap_end;
3396 addr = vm_unmapped_area(&info);
3402 #else /* !CONFIG_MMU */
3404 static int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3406 return is_nommu_shared_mapping(vma->vm_flags) ? 0 : -EINVAL;
3409 static unsigned int io_uring_nommu_mmap_capabilities(struct file *file)
3411 return NOMMU_MAP_DIRECT | NOMMU_MAP_READ | NOMMU_MAP_WRITE;
3414 static unsigned long io_uring_nommu_get_unmapped_area(struct file *file,
3415 unsigned long addr, unsigned long len,
3416 unsigned long pgoff, unsigned long flags)
3420 ptr = io_uring_validate_mmap_request(file, pgoff, len);
3422 return PTR_ERR(ptr);
3424 return (unsigned long) ptr;
3427 #endif /* !CONFIG_MMU */
3429 static int io_validate_ext_arg(unsigned flags, const void __user *argp, size_t argsz)
3431 if (flags & IORING_ENTER_EXT_ARG) {
3432 struct io_uring_getevents_arg arg;
3434 if (argsz != sizeof(arg))
3436 if (copy_from_user(&arg, argp, sizeof(arg)))
3442 static int io_get_ext_arg(unsigned flags, const void __user *argp, size_t *argsz,
3443 struct __kernel_timespec __user **ts,
3444 const sigset_t __user **sig)
3446 struct io_uring_getevents_arg arg;
3449 * If EXT_ARG isn't set, then we have no timespec and the argp pointer
3450 * is just a pointer to the sigset_t.
3452 if (!(flags & IORING_ENTER_EXT_ARG)) {
3453 *sig = (const sigset_t __user *) argp;
3459 * EXT_ARG is set - ensure we agree on the size of it and copy in our
3460 * timespec and sigset_t pointers if good.
3462 if (*argsz != sizeof(arg))
3464 if (copy_from_user(&arg, argp, sizeof(arg)))
3468 *sig = u64_to_user_ptr(arg.sigmask);
3469 *argsz = arg.sigmask_sz;
3470 *ts = u64_to_user_ptr(arg.ts);
3474 SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit,
3475 u32, min_complete, u32, flags, const void __user *, argp,
3478 struct io_ring_ctx *ctx;
3482 if (unlikely(flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP |
3483 IORING_ENTER_SQ_WAIT | IORING_ENTER_EXT_ARG |
3484 IORING_ENTER_REGISTERED_RING)))
3488 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
3489 * need only dereference our task private array to find it.
3491 if (flags & IORING_ENTER_REGISTERED_RING) {
3492 struct io_uring_task *tctx = current->io_uring;
3494 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
3496 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
3497 f.file = tctx->registered_rings[fd];
3499 if (unlikely(!f.file))
3503 if (unlikely(!f.file))
3506 if (unlikely(!io_is_uring_fops(f.file)))
3510 ctx = f.file->private_data;
3512 if (unlikely(ctx->flags & IORING_SETUP_R_DISABLED))
3516 * For SQ polling, the thread will do all submissions and completions.
3517 * Just return the requested submit count, and wake the thread if
3521 if (ctx->flags & IORING_SETUP_SQPOLL) {
3522 io_cqring_overflow_flush(ctx);
3524 if (unlikely(ctx->sq_data->thread == NULL)) {
3528 if (flags & IORING_ENTER_SQ_WAKEUP)
3529 wake_up(&ctx->sq_data->wait);
3530 if (flags & IORING_ENTER_SQ_WAIT)
3531 io_sqpoll_wait_sq(ctx);
3534 } else if (to_submit) {
3535 ret = io_uring_add_tctx_node(ctx);
3539 mutex_lock(&ctx->uring_lock);
3540 ret = io_submit_sqes(ctx, to_submit);
3541 if (ret != to_submit) {
3542 mutex_unlock(&ctx->uring_lock);
3545 if (flags & IORING_ENTER_GETEVENTS) {
3546 if (ctx->syscall_iopoll)
3549 * Ignore errors, we'll soon call io_cqring_wait() and
3550 * it should handle ownership problems if any.
3552 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
3553 (void)io_run_local_work_locked(ctx);
3555 mutex_unlock(&ctx->uring_lock);
3558 if (flags & IORING_ENTER_GETEVENTS) {
3561 if (ctx->syscall_iopoll) {
3563 * We disallow the app entering submit/complete with
3564 * polling, but we still need to lock the ring to
3565 * prevent racing with polled issue that got punted to
3568 mutex_lock(&ctx->uring_lock);
3570 ret2 = io_validate_ext_arg(flags, argp, argsz);
3571 if (likely(!ret2)) {
3572 min_complete = min(min_complete,
3574 ret2 = io_iopoll_check(ctx, min_complete);
3576 mutex_unlock(&ctx->uring_lock);
3578 const sigset_t __user *sig;
3579 struct __kernel_timespec __user *ts;
3581 ret2 = io_get_ext_arg(flags, argp, &argsz, &ts, &sig);
3582 if (likely(!ret2)) {
3583 min_complete = min(min_complete,
3585 ret2 = io_cqring_wait(ctx, min_complete, sig,
3594 * EBADR indicates that one or more CQE were dropped.
3595 * Once the user has been informed we can clear the bit
3596 * as they are obviously ok with those drops.
3598 if (unlikely(ret2 == -EBADR))
3599 clear_bit(IO_CHECK_CQ_DROPPED_BIT,
3608 static const struct file_operations io_uring_fops = {
3609 .release = io_uring_release,
3610 .mmap = io_uring_mmap,
3612 .get_unmapped_area = io_uring_nommu_get_unmapped_area,
3613 .mmap_capabilities = io_uring_nommu_mmap_capabilities,
3615 .get_unmapped_area = io_uring_mmu_get_unmapped_area,
3617 .poll = io_uring_poll,
3618 #ifdef CONFIG_PROC_FS
3619 .show_fdinfo = io_uring_show_fdinfo,
3623 bool io_is_uring_fops(struct file *file)
3625 return file->f_op == &io_uring_fops;
3628 static __cold int io_allocate_scq_urings(struct io_ring_ctx *ctx,
3629 struct io_uring_params *p)
3631 struct io_rings *rings;
3632 size_t size, sq_array_offset;
3634 /* make sure these are sane, as we already accounted them */
3635 ctx->sq_entries = p->sq_entries;
3636 ctx->cq_entries = p->cq_entries;
3638 size = rings_size(ctx, p->sq_entries, p->cq_entries, &sq_array_offset);
3639 if (size == SIZE_MAX)
3642 rings = io_mem_alloc(size);
3647 ctx->sq_array = (u32 *)((char *)rings + sq_array_offset);
3648 rings->sq_ring_mask = p->sq_entries - 1;
3649 rings->cq_ring_mask = p->cq_entries - 1;
3650 rings->sq_ring_entries = p->sq_entries;
3651 rings->cq_ring_entries = p->cq_entries;
3653 if (p->flags & IORING_SETUP_SQE128)
3654 size = array_size(2 * sizeof(struct io_uring_sqe), p->sq_entries);
3656 size = array_size(sizeof(struct io_uring_sqe), p->sq_entries);
3657 if (size == SIZE_MAX) {
3658 io_mem_free(ctx->rings);
3663 ctx->sq_sqes = io_mem_alloc(size);
3664 if (!ctx->sq_sqes) {
3665 io_mem_free(ctx->rings);
3673 static int io_uring_install_fd(struct io_ring_ctx *ctx, struct file *file)
3677 fd = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
3681 ret = __io_uring_add_tctx_node(ctx);
3686 fd_install(fd, file);
3691 * Allocate an anonymous fd, this is what constitutes the application
3692 * visible backing of an io_uring instance. The application mmaps this
3693 * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled,
3694 * we have to tie this fd to a socket for file garbage collection purposes.
3696 static struct file *io_uring_get_file(struct io_ring_ctx *ctx)
3699 #if defined(CONFIG_UNIX)
3702 ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP,
3705 return ERR_PTR(ret);
3708 file = anon_inode_getfile_secure("[io_uring]", &io_uring_fops, ctx,
3709 O_RDWR | O_CLOEXEC, NULL);
3710 #if defined(CONFIG_UNIX)
3712 sock_release(ctx->ring_sock);
3713 ctx->ring_sock = NULL;
3715 ctx->ring_sock->file = file;
3721 static __cold int io_uring_create(unsigned entries, struct io_uring_params *p,
3722 struct io_uring_params __user *params)
3724 struct io_ring_ctx *ctx;
3730 if (entries > IORING_MAX_ENTRIES) {
3731 if (!(p->flags & IORING_SETUP_CLAMP))
3733 entries = IORING_MAX_ENTRIES;
3737 * Use twice as many entries for the CQ ring. It's possible for the
3738 * application to drive a higher depth than the size of the SQ ring,
3739 * since the sqes are only used at submission time. This allows for
3740 * some flexibility in overcommitting a bit. If the application has
3741 * set IORING_SETUP_CQSIZE, it will have passed in the desired number
3742 * of CQ ring entries manually.
3744 p->sq_entries = roundup_pow_of_two(entries);
3745 if (p->flags & IORING_SETUP_CQSIZE) {
3747 * If IORING_SETUP_CQSIZE is set, we do the same roundup
3748 * to a power-of-two, if it isn't already. We do NOT impose
3749 * any cq vs sq ring sizing.
3753 if (p->cq_entries > IORING_MAX_CQ_ENTRIES) {
3754 if (!(p->flags & IORING_SETUP_CLAMP))
3756 p->cq_entries = IORING_MAX_CQ_ENTRIES;
3758 p->cq_entries = roundup_pow_of_two(p->cq_entries);
3759 if (p->cq_entries < p->sq_entries)
3762 p->cq_entries = 2 * p->sq_entries;
3765 ctx = io_ring_ctx_alloc(p);
3769 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3770 !(ctx->flags & IORING_SETUP_IOPOLL) &&
3771 !(ctx->flags & IORING_SETUP_SQPOLL))
3772 ctx->task_complete = true;
3775 * lazy poll_wq activation relies on ->task_complete for synchronisation
3776 * purposes, see io_activate_pollwq()
3778 if (!ctx->task_complete)
3779 ctx->poll_activated = true;
3782 * When SETUP_IOPOLL and SETUP_SQPOLL are both enabled, user
3783 * space applications don't need to do io completion events
3784 * polling again, they can rely on io_sq_thread to do polling
3785 * work, which can reduce cpu usage and uring_lock contention.
3787 if (ctx->flags & IORING_SETUP_IOPOLL &&
3788 !(ctx->flags & IORING_SETUP_SQPOLL))
3789 ctx->syscall_iopoll = 1;
3791 ctx->compat = in_compat_syscall();
3792 if (!capable(CAP_IPC_LOCK))
3793 ctx->user = get_uid(current_user());
3796 * For SQPOLL, we just need a wakeup, always. For !SQPOLL, if
3797 * COOP_TASKRUN is set, then IPIs are never needed by the app.
3800 if (ctx->flags & IORING_SETUP_SQPOLL) {
3801 /* IPI related flags don't make sense with SQPOLL */
3802 if (ctx->flags & (IORING_SETUP_COOP_TASKRUN |
3803 IORING_SETUP_TASKRUN_FLAG |
3804 IORING_SETUP_DEFER_TASKRUN))
3806 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3807 } else if (ctx->flags & IORING_SETUP_COOP_TASKRUN) {
3808 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3810 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG &&
3811 !(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
3813 ctx->notify_method = TWA_SIGNAL;
3817 * For DEFER_TASKRUN we require the completion task to be the same as the
3818 * submission task. This implies that there is only one submitter, so enforce
3821 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN &&
3822 !(ctx->flags & IORING_SETUP_SINGLE_ISSUER)) {
3827 * This is just grabbed for accounting purposes. When a process exits,
3828 * the mm is exited and dropped before the files, hence we need to hang
3829 * on to this mm purely for the purposes of being able to unaccount
3830 * memory (locked/pinned vm). It's not used for anything else.
3832 mmgrab(current->mm);
3833 ctx->mm_account = current->mm;
3835 ret = io_allocate_scq_urings(ctx, p);
3839 ret = io_sq_offload_create(ctx, p);
3842 /* always set a rsrc node */
3843 ret = io_rsrc_node_switch_start(ctx);
3846 io_rsrc_node_switch(ctx, NULL);
3848 memset(&p->sq_off, 0, sizeof(p->sq_off));
3849 p->sq_off.head = offsetof(struct io_rings, sq.head);
3850 p->sq_off.tail = offsetof(struct io_rings, sq.tail);
3851 p->sq_off.ring_mask = offsetof(struct io_rings, sq_ring_mask);
3852 p->sq_off.ring_entries = offsetof(struct io_rings, sq_ring_entries);
3853 p->sq_off.flags = offsetof(struct io_rings, sq_flags);
3854 p->sq_off.dropped = offsetof(struct io_rings, sq_dropped);
3855 p->sq_off.array = (char *)ctx->sq_array - (char *)ctx->rings;
3857 memset(&p->cq_off, 0, sizeof(p->cq_off));
3858 p->cq_off.head = offsetof(struct io_rings, cq.head);
3859 p->cq_off.tail = offsetof(struct io_rings, cq.tail);
3860 p->cq_off.ring_mask = offsetof(struct io_rings, cq_ring_mask);
3861 p->cq_off.ring_entries = offsetof(struct io_rings, cq_ring_entries);
3862 p->cq_off.overflow = offsetof(struct io_rings, cq_overflow);
3863 p->cq_off.cqes = offsetof(struct io_rings, cqes);
3864 p->cq_off.flags = offsetof(struct io_rings, cq_flags);
3866 p->features = IORING_FEAT_SINGLE_MMAP | IORING_FEAT_NODROP |
3867 IORING_FEAT_SUBMIT_STABLE | IORING_FEAT_RW_CUR_POS |
3868 IORING_FEAT_CUR_PERSONALITY | IORING_FEAT_FAST_POLL |
3869 IORING_FEAT_POLL_32BITS | IORING_FEAT_SQPOLL_NONFIXED |
3870 IORING_FEAT_EXT_ARG | IORING_FEAT_NATIVE_WORKERS |
3871 IORING_FEAT_RSRC_TAGS | IORING_FEAT_CQE_SKIP |
3872 IORING_FEAT_LINKED_FILE | IORING_FEAT_REG_REG_RING;
3874 if (copy_to_user(params, p, sizeof(*p))) {
3879 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER
3880 && !(ctx->flags & IORING_SETUP_R_DISABLED))
3881 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
3883 file = io_uring_get_file(ctx);
3885 ret = PTR_ERR(file);
3890 * Install ring fd as the very last thing, so we don't risk someone
3891 * having closed it before we finish setup
3893 ret = io_uring_install_fd(ctx, file);
3895 /* fput will clean it up */
3900 trace_io_uring_create(ret, ctx, p->sq_entries, p->cq_entries, p->flags);
3903 io_ring_ctx_wait_and_kill(ctx);
3908 * Sets up an aio uring context, and returns the fd. Applications asks for a
3909 * ring size, we return the actual sq/cq ring sizes (among other things) in the
3910 * params structure passed in.
3912 static long io_uring_setup(u32 entries, struct io_uring_params __user *params)
3914 struct io_uring_params p;
3917 if (copy_from_user(&p, params, sizeof(p)))
3919 for (i = 0; i < ARRAY_SIZE(p.resv); i++) {
3924 if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL |
3925 IORING_SETUP_SQ_AFF | IORING_SETUP_CQSIZE |
3926 IORING_SETUP_CLAMP | IORING_SETUP_ATTACH_WQ |
3927 IORING_SETUP_R_DISABLED | IORING_SETUP_SUBMIT_ALL |
3928 IORING_SETUP_COOP_TASKRUN | IORING_SETUP_TASKRUN_FLAG |
3929 IORING_SETUP_SQE128 | IORING_SETUP_CQE32 |
3930 IORING_SETUP_SINGLE_ISSUER | IORING_SETUP_DEFER_TASKRUN))
3933 return io_uring_create(entries, &p, params);
3936 SYSCALL_DEFINE2(io_uring_setup, u32, entries,
3937 struct io_uring_params __user *, params)
3939 return io_uring_setup(entries, params);
3942 static __cold int io_probe(struct io_ring_ctx *ctx, void __user *arg,
3945 struct io_uring_probe *p;
3949 size = struct_size(p, ops, nr_args);
3950 if (size == SIZE_MAX)
3952 p = kzalloc(size, GFP_KERNEL);
3957 if (copy_from_user(p, arg, size))
3960 if (memchr_inv(p, 0, size))
3963 p->last_op = IORING_OP_LAST - 1;
3964 if (nr_args > IORING_OP_LAST)
3965 nr_args = IORING_OP_LAST;
3967 for (i = 0; i < nr_args; i++) {
3969 if (!io_issue_defs[i].not_supported)
3970 p->ops[i].flags = IO_URING_OP_SUPPORTED;
3975 if (copy_to_user(arg, p, size))
3982 static int io_register_personality(struct io_ring_ctx *ctx)
3984 const struct cred *creds;
3988 creds = get_current_cred();
3990 ret = xa_alloc_cyclic(&ctx->personalities, &id, (void *)creds,
3991 XA_LIMIT(0, USHRT_MAX), &ctx->pers_next, GFP_KERNEL);
3999 static __cold int io_register_restrictions(struct io_ring_ctx *ctx,
4000 void __user *arg, unsigned int nr_args)
4002 struct io_uring_restriction *res;
4006 /* Restrictions allowed only if rings started disabled */
4007 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
4010 /* We allow only a single restrictions registration */
4011 if (ctx->restrictions.registered)
4014 if (!arg || nr_args > IORING_MAX_RESTRICTIONS)
4017 size = array_size(nr_args, sizeof(*res));
4018 if (size == SIZE_MAX)
4021 res = memdup_user(arg, size);
4023 return PTR_ERR(res);
4027 for (i = 0; i < nr_args; i++) {
4028 switch (res[i].opcode) {
4029 case IORING_RESTRICTION_REGISTER_OP:
4030 if (res[i].register_op >= IORING_REGISTER_LAST) {
4035 __set_bit(res[i].register_op,
4036 ctx->restrictions.register_op);
4038 case IORING_RESTRICTION_SQE_OP:
4039 if (res[i].sqe_op >= IORING_OP_LAST) {
4044 __set_bit(res[i].sqe_op, ctx->restrictions.sqe_op);
4046 case IORING_RESTRICTION_SQE_FLAGS_ALLOWED:
4047 ctx->restrictions.sqe_flags_allowed = res[i].sqe_flags;
4049 case IORING_RESTRICTION_SQE_FLAGS_REQUIRED:
4050 ctx->restrictions.sqe_flags_required = res[i].sqe_flags;
4059 /* Reset all restrictions if an error happened */
4061 memset(&ctx->restrictions, 0, sizeof(ctx->restrictions));
4063 ctx->restrictions.registered = true;
4069 static int io_register_enable_rings(struct io_ring_ctx *ctx)
4071 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
4074 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER && !ctx->submitter_task) {
4075 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
4077 * Lazy activation attempts would fail if it was polled before
4078 * submitter_task is set.
4080 if (wq_has_sleeper(&ctx->poll_wq))
4081 io_activate_pollwq(ctx);
4084 if (ctx->restrictions.registered)
4085 ctx->restricted = 1;
4087 ctx->flags &= ~IORING_SETUP_R_DISABLED;
4088 if (ctx->sq_data && wq_has_sleeper(&ctx->sq_data->wait))
4089 wake_up(&ctx->sq_data->wait);
4093 static __cold int io_register_iowq_aff(struct io_ring_ctx *ctx,
4094 void __user *arg, unsigned len)
4096 struct io_uring_task *tctx = current->io_uring;
4097 cpumask_var_t new_mask;
4100 if (!tctx || !tctx->io_wq)
4103 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4106 cpumask_clear(new_mask);
4107 if (len > cpumask_size())
4108 len = cpumask_size();
4110 if (in_compat_syscall()) {
4111 ret = compat_get_bitmap(cpumask_bits(new_mask),
4112 (const compat_ulong_t __user *)arg,
4113 len * 8 /* CHAR_BIT */);
4115 ret = copy_from_user(new_mask, arg, len);
4119 free_cpumask_var(new_mask);
4123 ret = io_wq_cpu_affinity(tctx->io_wq, new_mask);
4124 free_cpumask_var(new_mask);
4128 static __cold int io_unregister_iowq_aff(struct io_ring_ctx *ctx)
4130 struct io_uring_task *tctx = current->io_uring;
4132 if (!tctx || !tctx->io_wq)
4135 return io_wq_cpu_affinity(tctx->io_wq, NULL);
4138 static __cold int io_register_iowq_max_workers(struct io_ring_ctx *ctx,
4140 __must_hold(&ctx->uring_lock)
4142 struct io_tctx_node *node;
4143 struct io_uring_task *tctx = NULL;
4144 struct io_sq_data *sqd = NULL;
4148 if (copy_from_user(new_count, arg, sizeof(new_count)))
4150 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4151 if (new_count[i] > INT_MAX)
4154 if (ctx->flags & IORING_SETUP_SQPOLL) {
4158 * Observe the correct sqd->lock -> ctx->uring_lock
4159 * ordering. Fine to drop uring_lock here, we hold
4162 refcount_inc(&sqd->refs);
4163 mutex_unlock(&ctx->uring_lock);
4164 mutex_lock(&sqd->lock);
4165 mutex_lock(&ctx->uring_lock);
4167 tctx = sqd->thread->io_uring;
4170 tctx = current->io_uring;
4173 BUILD_BUG_ON(sizeof(new_count) != sizeof(ctx->iowq_limits));
4175 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4177 ctx->iowq_limits[i] = new_count[i];
4178 ctx->iowq_limits_set = true;
4180 if (tctx && tctx->io_wq) {
4181 ret = io_wq_max_workers(tctx->io_wq, new_count);
4185 memset(new_count, 0, sizeof(new_count));
4189 mutex_unlock(&sqd->lock);
4190 io_put_sq_data(sqd);
4193 if (copy_to_user(arg, new_count, sizeof(new_count)))
4196 /* that's it for SQPOLL, only the SQPOLL task creates requests */
4200 /* now propagate the restriction to all registered users */
4201 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
4202 struct io_uring_task *tctx = node->task->io_uring;
4204 if (WARN_ON_ONCE(!tctx->io_wq))
4207 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4208 new_count[i] = ctx->iowq_limits[i];
4209 /* ignore errors, it always returns zero anyway */
4210 (void)io_wq_max_workers(tctx->io_wq, new_count);
4215 mutex_unlock(&sqd->lock);
4216 io_put_sq_data(sqd);
4221 static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode,
4222 void __user *arg, unsigned nr_args)
4223 __releases(ctx->uring_lock)
4224 __acquires(ctx->uring_lock)
4229 * We don't quiesce the refs for register anymore and so it can't be
4230 * dying as we're holding a file ref here.
4232 if (WARN_ON_ONCE(percpu_ref_is_dying(&ctx->refs)))
4235 if (ctx->submitter_task && ctx->submitter_task != current)
4238 if (ctx->restricted) {
4239 opcode = array_index_nospec(opcode, IORING_REGISTER_LAST);
4240 if (!test_bit(opcode, ctx->restrictions.register_op))
4245 case IORING_REGISTER_BUFFERS:
4249 ret = io_sqe_buffers_register(ctx, arg, nr_args, NULL);
4251 case IORING_UNREGISTER_BUFFERS:
4255 ret = io_sqe_buffers_unregister(ctx);
4257 case IORING_REGISTER_FILES:
4261 ret = io_sqe_files_register(ctx, arg, nr_args, NULL);
4263 case IORING_UNREGISTER_FILES:
4267 ret = io_sqe_files_unregister(ctx);
4269 case IORING_REGISTER_FILES_UPDATE:
4270 ret = io_register_files_update(ctx, arg, nr_args);
4272 case IORING_REGISTER_EVENTFD:
4276 ret = io_eventfd_register(ctx, arg, 0);
4278 case IORING_REGISTER_EVENTFD_ASYNC:
4282 ret = io_eventfd_register(ctx, arg, 1);
4284 case IORING_UNREGISTER_EVENTFD:
4288 ret = io_eventfd_unregister(ctx);
4290 case IORING_REGISTER_PROBE:
4292 if (!arg || nr_args > 256)
4294 ret = io_probe(ctx, arg, nr_args);
4296 case IORING_REGISTER_PERSONALITY:
4300 ret = io_register_personality(ctx);
4302 case IORING_UNREGISTER_PERSONALITY:
4306 ret = io_unregister_personality(ctx, nr_args);
4308 case IORING_REGISTER_ENABLE_RINGS:
4312 ret = io_register_enable_rings(ctx);
4314 case IORING_REGISTER_RESTRICTIONS:
4315 ret = io_register_restrictions(ctx, arg, nr_args);
4317 case IORING_REGISTER_FILES2:
4318 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_FILE);
4320 case IORING_REGISTER_FILES_UPDATE2:
4321 ret = io_register_rsrc_update(ctx, arg, nr_args,
4324 case IORING_REGISTER_BUFFERS2:
4325 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_BUFFER);
4327 case IORING_REGISTER_BUFFERS_UPDATE:
4328 ret = io_register_rsrc_update(ctx, arg, nr_args,
4329 IORING_RSRC_BUFFER);
4331 case IORING_REGISTER_IOWQ_AFF:
4333 if (!arg || !nr_args)
4335 ret = io_register_iowq_aff(ctx, arg, nr_args);
4337 case IORING_UNREGISTER_IOWQ_AFF:
4341 ret = io_unregister_iowq_aff(ctx);
4343 case IORING_REGISTER_IOWQ_MAX_WORKERS:
4345 if (!arg || nr_args != 2)
4347 ret = io_register_iowq_max_workers(ctx, arg);
4349 case IORING_REGISTER_RING_FDS:
4350 ret = io_ringfd_register(ctx, arg, nr_args);
4352 case IORING_UNREGISTER_RING_FDS:
4353 ret = io_ringfd_unregister(ctx, arg, nr_args);
4355 case IORING_REGISTER_PBUF_RING:
4357 if (!arg || nr_args != 1)
4359 ret = io_register_pbuf_ring(ctx, arg);
4361 case IORING_UNREGISTER_PBUF_RING:
4363 if (!arg || nr_args != 1)
4365 ret = io_unregister_pbuf_ring(ctx, arg);
4367 case IORING_REGISTER_SYNC_CANCEL:
4369 if (!arg || nr_args != 1)
4371 ret = io_sync_cancel(ctx, arg);
4373 case IORING_REGISTER_FILE_ALLOC_RANGE:
4375 if (!arg || nr_args)
4377 ret = io_register_file_alloc_range(ctx, arg);
4387 SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode,
4388 void __user *, arg, unsigned int, nr_args)
4390 struct io_ring_ctx *ctx;
4393 bool use_registered_ring;
4395 use_registered_ring = !!(opcode & IORING_REGISTER_USE_REGISTERED_RING);
4396 opcode &= ~IORING_REGISTER_USE_REGISTERED_RING;
4398 if (opcode >= IORING_REGISTER_LAST)
4401 if (use_registered_ring) {
4403 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
4404 * need only dereference our task private array to find it.
4406 struct io_uring_task *tctx = current->io_uring;
4408 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
4410 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
4411 f.file = tctx->registered_rings[fd];
4413 if (unlikely(!f.file))
4417 if (unlikely(!f.file))
4420 if (!io_is_uring_fops(f.file))
4424 ctx = f.file->private_data;
4426 mutex_lock(&ctx->uring_lock);
4427 ret = __io_uring_register(ctx, opcode, arg, nr_args);
4428 mutex_unlock(&ctx->uring_lock);
4429 trace_io_uring_register(ctx, opcode, ctx->nr_user_files, ctx->nr_user_bufs, ret);
4435 static int __init io_uring_init(void)
4437 #define __BUILD_BUG_VERIFY_OFFSET_SIZE(stype, eoffset, esize, ename) do { \
4438 BUILD_BUG_ON(offsetof(stype, ename) != eoffset); \
4439 BUILD_BUG_ON(sizeof_field(stype, ename) != esize); \
4442 #define BUILD_BUG_SQE_ELEM(eoffset, etype, ename) \
4443 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, sizeof(etype), ename)
4444 #define BUILD_BUG_SQE_ELEM_SIZE(eoffset, esize, ename) \
4445 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, esize, ename)
4446 BUILD_BUG_ON(sizeof(struct io_uring_sqe) != 64);
4447 BUILD_BUG_SQE_ELEM(0, __u8, opcode);
4448 BUILD_BUG_SQE_ELEM(1, __u8, flags);
4449 BUILD_BUG_SQE_ELEM(2, __u16, ioprio);
4450 BUILD_BUG_SQE_ELEM(4, __s32, fd);
4451 BUILD_BUG_SQE_ELEM(8, __u64, off);
4452 BUILD_BUG_SQE_ELEM(8, __u64, addr2);
4453 BUILD_BUG_SQE_ELEM(8, __u32, cmd_op);
4454 BUILD_BUG_SQE_ELEM(12, __u32, __pad1);
4455 BUILD_BUG_SQE_ELEM(16, __u64, addr);
4456 BUILD_BUG_SQE_ELEM(16, __u64, splice_off_in);
4457 BUILD_BUG_SQE_ELEM(24, __u32, len);
4458 BUILD_BUG_SQE_ELEM(28, __kernel_rwf_t, rw_flags);
4459 BUILD_BUG_SQE_ELEM(28, /* compat */ int, rw_flags);
4460 BUILD_BUG_SQE_ELEM(28, /* compat */ __u32, rw_flags);
4461 BUILD_BUG_SQE_ELEM(28, __u32, fsync_flags);
4462 BUILD_BUG_SQE_ELEM(28, /* compat */ __u16, poll_events);
4463 BUILD_BUG_SQE_ELEM(28, __u32, poll32_events);
4464 BUILD_BUG_SQE_ELEM(28, __u32, sync_range_flags);
4465 BUILD_BUG_SQE_ELEM(28, __u32, msg_flags);
4466 BUILD_BUG_SQE_ELEM(28, __u32, timeout_flags);
4467 BUILD_BUG_SQE_ELEM(28, __u32, accept_flags);
4468 BUILD_BUG_SQE_ELEM(28, __u32, cancel_flags);
4469 BUILD_BUG_SQE_ELEM(28, __u32, open_flags);
4470 BUILD_BUG_SQE_ELEM(28, __u32, statx_flags);
4471 BUILD_BUG_SQE_ELEM(28, __u32, fadvise_advice);
4472 BUILD_BUG_SQE_ELEM(28, __u32, splice_flags);
4473 BUILD_BUG_SQE_ELEM(28, __u32, rename_flags);
4474 BUILD_BUG_SQE_ELEM(28, __u32, unlink_flags);
4475 BUILD_BUG_SQE_ELEM(28, __u32, hardlink_flags);
4476 BUILD_BUG_SQE_ELEM(28, __u32, xattr_flags);
4477 BUILD_BUG_SQE_ELEM(28, __u32, msg_ring_flags);
4478 BUILD_BUG_SQE_ELEM(32, __u64, user_data);
4479 BUILD_BUG_SQE_ELEM(40, __u16, buf_index);
4480 BUILD_BUG_SQE_ELEM(40, __u16, buf_group);
4481 BUILD_BUG_SQE_ELEM(42, __u16, personality);
4482 BUILD_BUG_SQE_ELEM(44, __s32, splice_fd_in);
4483 BUILD_BUG_SQE_ELEM(44, __u32, file_index);
4484 BUILD_BUG_SQE_ELEM(44, __u16, addr_len);
4485 BUILD_BUG_SQE_ELEM(46, __u16, __pad3[0]);
4486 BUILD_BUG_SQE_ELEM(48, __u64, addr3);
4487 BUILD_BUG_SQE_ELEM_SIZE(48, 0, cmd);
4488 BUILD_BUG_SQE_ELEM(56, __u64, __pad2);
4490 BUILD_BUG_ON(sizeof(struct io_uring_files_update) !=
4491 sizeof(struct io_uring_rsrc_update));
4492 BUILD_BUG_ON(sizeof(struct io_uring_rsrc_update) >
4493 sizeof(struct io_uring_rsrc_update2));
4495 /* ->buf_index is u16 */
4496 BUILD_BUG_ON(offsetof(struct io_uring_buf_ring, bufs) != 0);
4497 BUILD_BUG_ON(offsetof(struct io_uring_buf, resv) !=
4498 offsetof(struct io_uring_buf_ring, tail));
4500 /* should fit into one byte */
4501 BUILD_BUG_ON(SQE_VALID_FLAGS >= (1 << 8));
4502 BUILD_BUG_ON(SQE_COMMON_FLAGS >= (1 << 8));
4503 BUILD_BUG_ON((SQE_VALID_FLAGS | SQE_COMMON_FLAGS) != SQE_VALID_FLAGS);
4505 BUILD_BUG_ON(__REQ_F_LAST_BIT > 8 * sizeof(int));
4507 BUILD_BUG_ON(sizeof(atomic_t) != sizeof(u32));
4509 io_uring_optable_init();
4511 req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC |
4515 __initcall(io_uring_init);