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;
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, &locked);
255 if (WARN_ON_ONCE(!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->apoll_cache, sizeof(struct async_poll));
314 io_alloc_cache_init(&ctx->netmsg_cache, sizeof(struct io_async_msghdr));
315 init_completion(&ctx->ref_comp);
316 xa_init_flags(&ctx->personalities, XA_FLAGS_ALLOC1);
317 mutex_init(&ctx->uring_lock);
318 init_waitqueue_head(&ctx->cq_wait);
319 init_waitqueue_head(&ctx->poll_wq);
320 spin_lock_init(&ctx->completion_lock);
321 spin_lock_init(&ctx->timeout_lock);
322 INIT_WQ_LIST(&ctx->iopoll_list);
323 INIT_LIST_HEAD(&ctx->io_buffers_pages);
324 INIT_LIST_HEAD(&ctx->io_buffers_comp);
325 INIT_LIST_HEAD(&ctx->defer_list);
326 INIT_LIST_HEAD(&ctx->timeout_list);
327 INIT_LIST_HEAD(&ctx->ltimeout_list);
328 spin_lock_init(&ctx->rsrc_ref_lock);
329 INIT_LIST_HEAD(&ctx->rsrc_ref_list);
330 INIT_DELAYED_WORK(&ctx->rsrc_put_work, io_rsrc_put_work);
331 init_task_work(&ctx->rsrc_put_tw, io_rsrc_put_tw);
332 init_llist_head(&ctx->rsrc_put_llist);
333 init_llist_head(&ctx->work_llist);
334 INIT_LIST_HEAD(&ctx->tctx_list);
335 ctx->submit_state.free_list.next = NULL;
336 INIT_WQ_LIST(&ctx->locked_free_list);
337 INIT_DELAYED_WORK(&ctx->fallback_work, io_fallback_req_func);
338 INIT_WQ_LIST(&ctx->submit_state.compl_reqs);
341 kfree(ctx->dummy_ubuf);
342 kfree(ctx->cancel_table.hbs);
343 kfree(ctx->cancel_table_locked.hbs);
345 xa_destroy(&ctx->io_bl_xa);
350 static void io_account_cq_overflow(struct io_ring_ctx *ctx)
352 struct io_rings *r = ctx->rings;
354 WRITE_ONCE(r->cq_overflow, READ_ONCE(r->cq_overflow) + 1);
358 static bool req_need_defer(struct io_kiocb *req, u32 seq)
360 if (unlikely(req->flags & REQ_F_IO_DRAIN)) {
361 struct io_ring_ctx *ctx = req->ctx;
363 return seq + READ_ONCE(ctx->cq_extra) != ctx->cached_cq_tail;
369 static inline void io_req_track_inflight(struct io_kiocb *req)
371 if (!(req->flags & REQ_F_INFLIGHT)) {
372 req->flags |= REQ_F_INFLIGHT;
373 atomic_inc(&req->task->io_uring->inflight_tracked);
377 static struct io_kiocb *__io_prep_linked_timeout(struct io_kiocb *req)
379 if (WARN_ON_ONCE(!req->link))
382 req->flags &= ~REQ_F_ARM_LTIMEOUT;
383 req->flags |= REQ_F_LINK_TIMEOUT;
385 /* linked timeouts should have two refs once prep'ed */
386 io_req_set_refcount(req);
387 __io_req_set_refcount(req->link, 2);
391 static inline struct io_kiocb *io_prep_linked_timeout(struct io_kiocb *req)
393 if (likely(!(req->flags & REQ_F_ARM_LTIMEOUT)))
395 return __io_prep_linked_timeout(req);
398 static noinline void __io_arm_ltimeout(struct io_kiocb *req)
400 io_queue_linked_timeout(__io_prep_linked_timeout(req));
403 static inline void io_arm_ltimeout(struct io_kiocb *req)
405 if (unlikely(req->flags & REQ_F_ARM_LTIMEOUT))
406 __io_arm_ltimeout(req);
409 static void io_prep_async_work(struct io_kiocb *req)
411 const struct io_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, bool *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)) {
645 __io_cqring_wake(ctx);
649 void io_cq_unlock_post(struct io_ring_ctx *ctx)
650 __releases(ctx->completion_lock)
652 io_commit_cqring(ctx);
653 spin_unlock(&ctx->completion_lock);
654 io_commit_cqring_flush(ctx);
658 /* Returns true if there are no backlogged entries after the flush */
659 static void io_cqring_overflow_kill(struct io_ring_ctx *ctx)
661 struct io_overflow_cqe *ocqe;
665 list_splice_init(&ctx->cq_overflow_list, &list);
666 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
669 while (!list_empty(&list)) {
670 ocqe = list_first_entry(&list, struct io_overflow_cqe, list);
671 list_del(&ocqe->list);
676 static void __io_cqring_overflow_flush(struct io_ring_ctx *ctx)
678 size_t cqe_size = sizeof(struct io_uring_cqe);
680 if (__io_cqring_events(ctx) == ctx->cq_entries)
683 if (ctx->flags & IORING_SETUP_CQE32)
687 while (!list_empty(&ctx->cq_overflow_list)) {
688 struct io_uring_cqe *cqe = io_get_cqe_overflow(ctx, true);
689 struct io_overflow_cqe *ocqe;
693 ocqe = list_first_entry(&ctx->cq_overflow_list,
694 struct io_overflow_cqe, list);
695 memcpy(cqe, &ocqe->cqe, cqe_size);
696 list_del(&ocqe->list);
700 if (list_empty(&ctx->cq_overflow_list)) {
701 clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
702 atomic_andnot(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
704 io_cq_unlock_post(ctx);
707 static void io_cqring_do_overflow_flush(struct io_ring_ctx *ctx)
709 /* iopoll syncs against uring_lock, not completion_lock */
710 if (ctx->flags & IORING_SETUP_IOPOLL)
711 mutex_lock(&ctx->uring_lock);
712 __io_cqring_overflow_flush(ctx);
713 if (ctx->flags & IORING_SETUP_IOPOLL)
714 mutex_unlock(&ctx->uring_lock);
717 static void io_cqring_overflow_flush(struct io_ring_ctx *ctx)
719 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
720 io_cqring_do_overflow_flush(ctx);
723 /* can be called by any task */
724 static void io_put_task_remote(struct task_struct *task, int nr)
726 struct io_uring_task *tctx = task->io_uring;
728 percpu_counter_sub(&tctx->inflight, nr);
729 if (unlikely(atomic_read(&tctx->in_cancel)))
730 wake_up(&tctx->wait);
731 put_task_struct_many(task, nr);
734 /* used by a task to put its own references */
735 static void io_put_task_local(struct task_struct *task, int nr)
737 task->io_uring->cached_refs += nr;
740 /* must to be called somewhat shortly after putting a request */
741 static inline void io_put_task(struct task_struct *task, int nr)
743 if (likely(task == current))
744 io_put_task_local(task, nr);
746 io_put_task_remote(task, nr);
749 void io_task_refs_refill(struct io_uring_task *tctx)
751 unsigned int refill = -tctx->cached_refs + IO_TCTX_REFS_CACHE_NR;
753 percpu_counter_add(&tctx->inflight, refill);
754 refcount_add(refill, ¤t->usage);
755 tctx->cached_refs += refill;
758 static __cold void io_uring_drop_tctx_refs(struct task_struct *task)
760 struct io_uring_task *tctx = task->io_uring;
761 unsigned int refs = tctx->cached_refs;
764 tctx->cached_refs = 0;
765 percpu_counter_sub(&tctx->inflight, refs);
766 put_task_struct_many(task, refs);
770 static bool io_cqring_event_overflow(struct io_ring_ctx *ctx, u64 user_data,
771 s32 res, u32 cflags, u64 extra1, u64 extra2)
773 struct io_overflow_cqe *ocqe;
774 size_t ocq_size = sizeof(struct io_overflow_cqe);
775 bool is_cqe32 = (ctx->flags & IORING_SETUP_CQE32);
777 lockdep_assert_held(&ctx->completion_lock);
780 ocq_size += sizeof(struct io_uring_cqe);
782 ocqe = kmalloc(ocq_size, GFP_ATOMIC | __GFP_ACCOUNT);
783 trace_io_uring_cqe_overflow(ctx, user_data, res, cflags, ocqe);
786 * If we're in ring overflow flush mode, or in task cancel mode,
787 * or cannot allocate an overflow entry, then we need to drop it
790 io_account_cq_overflow(ctx);
791 set_bit(IO_CHECK_CQ_DROPPED_BIT, &ctx->check_cq);
794 if (list_empty(&ctx->cq_overflow_list)) {
795 set_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq);
796 atomic_or(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags);
799 ocqe->cqe.user_data = user_data;
801 ocqe->cqe.flags = cflags;
803 ocqe->cqe.big_cqe[0] = extra1;
804 ocqe->cqe.big_cqe[1] = extra2;
806 list_add_tail(&ocqe->list, &ctx->cq_overflow_list);
810 bool io_req_cqe_overflow(struct io_kiocb *req)
812 if (!(req->flags & REQ_F_CQE32_INIT)) {
816 return io_cqring_event_overflow(req->ctx, req->cqe.user_data,
817 req->cqe.res, req->cqe.flags,
818 req->extra1, req->extra2);
822 * writes to the cq entry need to come after reading head; the
823 * control dependency is enough as we're using WRITE_ONCE to
826 struct io_uring_cqe *__io_get_cqe(struct io_ring_ctx *ctx, bool overflow)
828 struct io_rings *rings = ctx->rings;
829 unsigned int off = ctx->cached_cq_tail & (ctx->cq_entries - 1);
830 unsigned int free, queued, len;
833 * Posting into the CQ when there are pending overflowed CQEs may break
834 * ordering guarantees, which will affect links, F_MORE users and more.
835 * Force overflow the completion.
837 if (!overflow && (ctx->check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)))
840 /* userspace may cheat modifying the tail, be safe and do min */
841 queued = min(__io_cqring_events(ctx), ctx->cq_entries);
842 free = ctx->cq_entries - queued;
843 /* we need a contiguous range, limit based on the current array offset */
844 len = min(free, ctx->cq_entries - off);
848 if (ctx->flags & IORING_SETUP_CQE32) {
853 ctx->cqe_cached = &rings->cqes[off];
854 ctx->cqe_sentinel = ctx->cqe_cached + len;
856 ctx->cached_cq_tail++;
858 if (ctx->flags & IORING_SETUP_CQE32)
860 return &rings->cqes[off];
863 static bool io_fill_cqe_aux(struct io_ring_ctx *ctx, u64 user_data, s32 res,
866 struct io_uring_cqe *cqe;
871 * If we can't get a cq entry, userspace overflowed the
872 * submission (by quite a lot). Increment the overflow count in
875 cqe = io_get_cqe(ctx);
877 trace_io_uring_complete(ctx, NULL, user_data, res, cflags, 0, 0);
879 WRITE_ONCE(cqe->user_data, user_data);
880 WRITE_ONCE(cqe->res, res);
881 WRITE_ONCE(cqe->flags, cflags);
883 if (ctx->flags & IORING_SETUP_CQE32) {
884 WRITE_ONCE(cqe->big_cqe[0], 0);
885 WRITE_ONCE(cqe->big_cqe[1], 0);
892 static void __io_flush_post_cqes(struct io_ring_ctx *ctx)
893 __must_hold(&ctx->uring_lock)
895 struct io_submit_state *state = &ctx->submit_state;
898 lockdep_assert_held(&ctx->uring_lock);
899 for (i = 0; i < state->cqes_count; i++) {
900 struct io_uring_cqe *cqe = &state->cqes[i];
902 if (!io_fill_cqe_aux(ctx, cqe->user_data, cqe->res, cqe->flags)) {
903 if (ctx->task_complete) {
904 spin_lock(&ctx->completion_lock);
905 io_cqring_event_overflow(ctx, cqe->user_data,
906 cqe->res, cqe->flags, 0, 0);
907 spin_unlock(&ctx->completion_lock);
909 io_cqring_event_overflow(ctx, cqe->user_data,
910 cqe->res, cqe->flags, 0, 0);
914 state->cqes_count = 0;
917 static bool __io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags,
923 filled = io_fill_cqe_aux(ctx, user_data, res, cflags);
924 if (!filled && allow_overflow)
925 filled = io_cqring_event_overflow(ctx, user_data, res, cflags, 0, 0);
927 io_cq_unlock_post(ctx);
931 bool io_post_aux_cqe(struct io_ring_ctx *ctx, u64 user_data, s32 res, u32 cflags)
933 return __io_post_aux_cqe(ctx, user_data, res, cflags, true);
936 bool io_aux_cqe(struct io_ring_ctx *ctx, bool defer, u64 user_data, s32 res, u32 cflags,
939 struct io_uring_cqe *cqe;
943 return __io_post_aux_cqe(ctx, user_data, res, cflags, allow_overflow);
945 length = ARRAY_SIZE(ctx->submit_state.cqes);
947 lockdep_assert_held(&ctx->uring_lock);
949 if (ctx->submit_state.cqes_count == length) {
951 __io_flush_post_cqes(ctx);
952 /* no need to flush - flush is deferred */
953 __io_cq_unlock_post(ctx);
956 /* For defered completions this is not as strict as it is otherwise,
957 * however it's main job is to prevent unbounded posted completions,
958 * and in that it works just as well.
960 if (!allow_overflow && test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq))
963 cqe = &ctx->submit_state.cqes[ctx->submit_state.cqes_count++];
964 cqe->user_data = user_data;
970 static void __io_req_complete_post(struct io_kiocb *req)
972 struct io_ring_ctx *ctx = req->ctx;
975 if (!(req->flags & REQ_F_CQE_SKIP))
976 io_fill_cqe_req(ctx, req);
979 * If we're the last reference to this request, add to our locked
982 if (req_ref_put_and_test(req)) {
983 if (req->flags & IO_REQ_LINK_FLAGS) {
984 if (req->flags & IO_DISARM_MASK)
987 io_req_task_queue(req->link);
991 io_put_kbuf_comp(req);
992 io_dismantle_req(req);
993 io_req_put_rsrc(req);
995 * Selected buffer deallocation in io_clean_op() assumes that
996 * we don't hold ->completion_lock. Clean them here to avoid
999 io_put_task_remote(req->task, 1);
1000 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
1001 ctx->locked_free_nr++;
1003 io_cq_unlock_post(ctx);
1006 void io_req_complete_post(struct io_kiocb *req, unsigned issue_flags)
1008 if (req->ctx->task_complete && (issue_flags & IO_URING_F_IOWQ)) {
1009 req->io_task_work.func = io_req_task_complete;
1010 io_req_task_work_add(req);
1011 } else if (!(issue_flags & IO_URING_F_UNLOCKED) ||
1012 !(req->ctx->flags & IORING_SETUP_IOPOLL)) {
1013 __io_req_complete_post(req);
1015 struct io_ring_ctx *ctx = req->ctx;
1017 mutex_lock(&ctx->uring_lock);
1018 __io_req_complete_post(req);
1019 mutex_unlock(&ctx->uring_lock);
1023 void io_req_defer_failed(struct io_kiocb *req, s32 res)
1024 __must_hold(&ctx->uring_lock)
1026 const struct io_cold_def *def = &io_cold_defs[req->opcode];
1028 lockdep_assert_held(&req->ctx->uring_lock);
1031 io_req_set_res(req, res, io_put_kbuf(req, IO_URING_F_UNLOCKED));
1034 io_req_complete_defer(req);
1038 * Don't initialise the fields below on every allocation, but do that in
1039 * advance and keep them valid across allocations.
1041 static void io_preinit_req(struct io_kiocb *req, struct io_ring_ctx *ctx)
1045 req->async_data = NULL;
1046 /* not necessary, but safer to zero */
1050 static void io_flush_cached_locked_reqs(struct io_ring_ctx *ctx,
1051 struct io_submit_state *state)
1053 spin_lock(&ctx->completion_lock);
1054 wq_list_splice(&ctx->locked_free_list, &state->free_list);
1055 ctx->locked_free_nr = 0;
1056 spin_unlock(&ctx->completion_lock);
1060 * A request might get retired back into the request caches even before opcode
1061 * handlers and io_issue_sqe() are done with it, e.g. inline completion path.
1062 * Because of that, io_alloc_req() should be called only under ->uring_lock
1063 * and with extra caution to not get a request that is still worked on.
1065 __cold bool __io_alloc_req_refill(struct io_ring_ctx *ctx)
1066 __must_hold(&ctx->uring_lock)
1068 gfp_t gfp = GFP_KERNEL | __GFP_NOWARN;
1069 void *reqs[IO_REQ_ALLOC_BATCH];
1073 * If we have more than a batch's worth of requests in our IRQ side
1074 * locked cache, grab the lock and move them over to our submission
1077 if (data_race(ctx->locked_free_nr) > IO_COMPL_BATCH) {
1078 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
1079 if (!io_req_cache_empty(ctx))
1083 ret = kmem_cache_alloc_bulk(req_cachep, gfp, ARRAY_SIZE(reqs), reqs);
1086 * Bulk alloc is all-or-nothing. If we fail to get a batch,
1087 * retry single alloc to be on the safe side.
1089 if (unlikely(ret <= 0)) {
1090 reqs[0] = kmem_cache_alloc(req_cachep, gfp);
1096 percpu_ref_get_many(&ctx->refs, ret);
1097 for (i = 0; i < ret; i++) {
1098 struct io_kiocb *req = reqs[i];
1100 io_preinit_req(req, ctx);
1101 io_req_add_to_cache(req, ctx);
1106 static inline void io_dismantle_req(struct io_kiocb *req)
1108 unsigned int flags = req->flags;
1110 if (unlikely(flags & IO_REQ_CLEAN_FLAGS))
1112 if (!(flags & REQ_F_FIXED_FILE))
1113 io_put_file(req->file);
1116 __cold void io_free_req(struct io_kiocb *req)
1118 struct io_ring_ctx *ctx = req->ctx;
1120 io_req_put_rsrc(req);
1121 io_dismantle_req(req);
1122 io_put_task_remote(req->task, 1);
1124 spin_lock(&ctx->completion_lock);
1125 wq_list_add_head(&req->comp_list, &ctx->locked_free_list);
1126 ctx->locked_free_nr++;
1127 spin_unlock(&ctx->completion_lock);
1130 static void __io_req_find_next_prep(struct io_kiocb *req)
1132 struct io_ring_ctx *ctx = req->ctx;
1134 spin_lock(&ctx->completion_lock);
1135 io_disarm_next(req);
1136 spin_unlock(&ctx->completion_lock);
1139 static inline struct io_kiocb *io_req_find_next(struct io_kiocb *req)
1141 struct io_kiocb *nxt;
1144 * If LINK is set, we have dependent requests in this chain. If we
1145 * didn't fail this request, queue the first one up, moving any other
1146 * dependencies to the next request. In case of failure, fail the rest
1149 if (unlikely(req->flags & IO_DISARM_MASK))
1150 __io_req_find_next_prep(req);
1156 static void ctx_flush_and_put(struct io_ring_ctx *ctx, bool *locked)
1160 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1161 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1163 io_submit_flush_completions(ctx);
1164 mutex_unlock(&ctx->uring_lock);
1167 percpu_ref_put(&ctx->refs);
1170 static unsigned int handle_tw_list(struct llist_node *node,
1171 struct io_ring_ctx **ctx, bool *locked,
1172 struct llist_node *last)
1174 unsigned int count = 0;
1176 while (node && node != last) {
1177 struct llist_node *next = node->next;
1178 struct io_kiocb *req = container_of(node, struct io_kiocb,
1181 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1183 if (req->ctx != *ctx) {
1184 ctx_flush_and_put(*ctx, locked);
1186 /* if not contended, grab and improve batching */
1187 *locked = mutex_trylock(&(*ctx)->uring_lock);
1188 percpu_ref_get(&(*ctx)->refs);
1189 } else if (!*locked)
1190 *locked = mutex_trylock(&(*ctx)->uring_lock);
1191 req->io_task_work.func(req, locked);
1194 if (unlikely(need_resched())) {
1195 ctx_flush_and_put(*ctx, locked);
1205 * io_llist_xchg - swap all entries in a lock-less list
1206 * @head: the head of lock-less list to delete all entries
1207 * @new: new entry as the head of the list
1209 * If list is empty, return NULL, otherwise, return the pointer to the first entry.
1210 * The order of entries returned is from the newest to the oldest added one.
1212 static inline struct llist_node *io_llist_xchg(struct llist_head *head,
1213 struct llist_node *new)
1215 return xchg(&head->first, new);
1219 * io_llist_cmpxchg - possibly swap all entries in a lock-less list
1220 * @head: the head of lock-less list to delete all entries
1221 * @old: expected old value of the first entry of the list
1222 * @new: new entry as the head of the list
1224 * perform a cmpxchg on the first entry of the list.
1227 static inline struct llist_node *io_llist_cmpxchg(struct llist_head *head,
1228 struct llist_node *old,
1229 struct llist_node *new)
1231 return cmpxchg(&head->first, old, new);
1234 void tctx_task_work(struct callback_head *cb)
1236 bool uring_locked = false;
1237 struct io_ring_ctx *ctx = NULL;
1238 struct io_uring_task *tctx = container_of(cb, struct io_uring_task,
1240 struct llist_node fake = {};
1241 struct llist_node *node;
1242 unsigned int loops = 0;
1243 unsigned int count = 0;
1245 if (unlikely(current->flags & PF_EXITING)) {
1246 io_fallback_tw(tctx);
1252 node = io_llist_xchg(&tctx->task_list, &fake);
1253 count += handle_tw_list(node, &ctx, &uring_locked, &fake);
1255 /* skip expensive cmpxchg if there are items in the list */
1256 if (READ_ONCE(tctx->task_list.first) != &fake)
1258 if (uring_locked && !wq_list_empty(&ctx->submit_state.compl_reqs)) {
1259 io_submit_flush_completions(ctx);
1260 if (READ_ONCE(tctx->task_list.first) != &fake)
1263 node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL);
1264 } while (node != &fake);
1266 ctx_flush_and_put(ctx, &uring_locked);
1268 /* relaxed read is enough as only the task itself sets ->in_cancel */
1269 if (unlikely(atomic_read(&tctx->in_cancel)))
1270 io_uring_drop_tctx_refs(current);
1272 trace_io_uring_task_work_run(tctx, count, loops);
1275 static __cold void io_fallback_tw(struct io_uring_task *tctx)
1277 struct llist_node *node = llist_del_all(&tctx->task_list);
1278 struct io_kiocb *req;
1281 req = container_of(node, struct io_kiocb, io_task_work.node);
1283 if (llist_add(&req->io_task_work.node,
1284 &req->ctx->fallback_llist))
1285 schedule_delayed_work(&req->ctx->fallback_work, 1);
1289 static void io_req_local_work_add(struct io_kiocb *req)
1291 struct io_ring_ctx *ctx = req->ctx;
1293 percpu_ref_get(&ctx->refs);
1295 if (!llist_add(&req->io_task_work.node, &ctx->work_llist))
1298 /* needed for the following wake up */
1299 smp_mb__after_atomic();
1301 if (unlikely(atomic_read(&req->task->io_uring->in_cancel))) {
1302 io_move_task_work_from_local(ctx);
1306 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1307 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1309 io_eventfd_signal(ctx);
1311 if (READ_ONCE(ctx->cq_waiting))
1312 wake_up_state(ctx->submitter_task, TASK_INTERRUPTIBLE);
1315 percpu_ref_put(&ctx->refs);
1318 void __io_req_task_work_add(struct io_kiocb *req, bool allow_local)
1320 struct io_uring_task *tctx = req->task->io_uring;
1321 struct io_ring_ctx *ctx = req->ctx;
1323 if (allow_local && ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
1324 io_req_local_work_add(req);
1328 /* task_work already pending, we're done */
1329 if (!llist_add(&req->io_task_work.node, &tctx->task_list))
1332 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1333 atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1335 if (likely(!task_work_add(req->task, &tctx->task_work, ctx->notify_method)))
1338 io_fallback_tw(tctx);
1341 static void __cold io_move_task_work_from_local(struct io_ring_ctx *ctx)
1343 struct llist_node *node;
1345 node = llist_del_all(&ctx->work_llist);
1347 struct io_kiocb *req = container_of(node, struct io_kiocb,
1351 __io_req_task_work_add(req, false);
1355 static int __io_run_local_work(struct io_ring_ctx *ctx, bool *locked)
1357 struct llist_node *node;
1358 unsigned int loops = 0;
1361 if (WARN_ON_ONCE(ctx->submitter_task != current))
1363 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG)
1364 atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags);
1366 node = io_llist_xchg(&ctx->work_llist, NULL);
1368 struct llist_node *next = node->next;
1369 struct io_kiocb *req = container_of(node, struct io_kiocb,
1371 prefetch(container_of(next, struct io_kiocb, io_task_work.node));
1372 req->io_task_work.func(req, locked);
1378 if (!llist_empty(&ctx->work_llist))
1381 io_submit_flush_completions(ctx);
1382 if (!llist_empty(&ctx->work_llist))
1385 trace_io_uring_local_work_run(ctx, ret, loops);
1389 static inline int io_run_local_work_locked(struct io_ring_ctx *ctx)
1394 if (llist_empty(&ctx->work_llist))
1398 ret = __io_run_local_work(ctx, &locked);
1399 /* shouldn't happen! */
1400 if (WARN_ON_ONCE(!locked))
1401 mutex_lock(&ctx->uring_lock);
1405 static int io_run_local_work(struct io_ring_ctx *ctx)
1407 bool locked = mutex_trylock(&ctx->uring_lock);
1410 ret = __io_run_local_work(ctx, &locked);
1412 mutex_unlock(&ctx->uring_lock);
1417 static void io_req_task_cancel(struct io_kiocb *req, bool *locked)
1419 io_tw_lock(req->ctx, locked);
1420 io_req_defer_failed(req, req->cqe.res);
1423 void io_req_task_submit(struct io_kiocb *req, bool *locked)
1425 io_tw_lock(req->ctx, locked);
1426 /* req->task == current here, checking PF_EXITING is safe */
1427 if (unlikely(req->task->flags & PF_EXITING))
1428 io_req_defer_failed(req, -EFAULT);
1429 else if (req->flags & REQ_F_FORCE_ASYNC)
1430 io_queue_iowq(req, locked);
1435 void io_req_task_queue_fail(struct io_kiocb *req, int ret)
1437 io_req_set_res(req, ret, 0);
1438 req->io_task_work.func = io_req_task_cancel;
1439 io_req_task_work_add(req);
1442 void io_req_task_queue(struct io_kiocb *req)
1444 req->io_task_work.func = io_req_task_submit;
1445 io_req_task_work_add(req);
1448 void io_queue_next(struct io_kiocb *req)
1450 struct io_kiocb *nxt = io_req_find_next(req);
1453 io_req_task_queue(nxt);
1456 void io_free_batch_list(struct io_ring_ctx *ctx, struct io_wq_work_node *node)
1457 __must_hold(&ctx->uring_lock)
1459 struct task_struct *task = NULL;
1463 struct io_kiocb *req = container_of(node, struct io_kiocb,
1466 if (unlikely(req->flags & IO_REQ_CLEAN_SLOW_FLAGS)) {
1467 if (req->flags & REQ_F_REFCOUNT) {
1468 node = req->comp_list.next;
1469 if (!req_ref_put_and_test(req))
1472 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1473 struct async_poll *apoll = req->apoll;
1475 if (apoll->double_poll)
1476 kfree(apoll->double_poll);
1477 if (!io_alloc_cache_put(&ctx->apoll_cache, &apoll->cache))
1479 req->flags &= ~REQ_F_POLLED;
1481 if (req->flags & IO_REQ_LINK_FLAGS)
1483 if (unlikely(req->flags & IO_REQ_CLEAN_FLAGS))
1486 if (!(req->flags & REQ_F_FIXED_FILE))
1487 io_put_file(req->file);
1489 io_req_put_rsrc_locked(req, ctx);
1491 if (req->task != task) {
1493 io_put_task(task, task_refs);
1498 node = req->comp_list.next;
1499 io_req_add_to_cache(req, ctx);
1503 io_put_task(task, task_refs);
1506 static void __io_submit_flush_completions(struct io_ring_ctx *ctx)
1507 __must_hold(&ctx->uring_lock)
1509 struct io_submit_state *state = &ctx->submit_state;
1510 struct io_wq_work_node *node;
1513 /* must come first to preserve CQE ordering in failure cases */
1514 if (state->cqes_count)
1515 __io_flush_post_cqes(ctx);
1516 __wq_list_for_each(node, &state->compl_reqs) {
1517 struct io_kiocb *req = container_of(node, struct io_kiocb,
1520 if (!(req->flags & REQ_F_CQE_SKIP) &&
1521 unlikely(!__io_fill_cqe_req(ctx, req))) {
1522 if (ctx->task_complete) {
1523 spin_lock(&ctx->completion_lock);
1524 io_req_cqe_overflow(req);
1525 spin_unlock(&ctx->completion_lock);
1527 io_req_cqe_overflow(req);
1531 __io_cq_unlock_post_flush(ctx);
1533 if (!wq_list_empty(&ctx->submit_state.compl_reqs)) {
1534 io_free_batch_list(ctx, state->compl_reqs.first);
1535 INIT_WQ_LIST(&state->compl_reqs);
1540 * Drop reference to request, return next in chain (if there is one) if this
1541 * was the last reference to this request.
1543 static inline struct io_kiocb *io_put_req_find_next(struct io_kiocb *req)
1545 struct io_kiocb *nxt = NULL;
1547 if (req_ref_put_and_test(req)) {
1548 if (unlikely(req->flags & IO_REQ_LINK_FLAGS))
1549 nxt = io_req_find_next(req);
1555 static unsigned io_cqring_events(struct io_ring_ctx *ctx)
1557 /* See comment at the top of this file */
1559 return __io_cqring_events(ctx);
1563 * We can't just wait for polled events to come to us, we have to actively
1564 * find and complete them.
1566 static __cold void io_iopoll_try_reap_events(struct io_ring_ctx *ctx)
1568 if (!(ctx->flags & IORING_SETUP_IOPOLL))
1571 mutex_lock(&ctx->uring_lock);
1572 while (!wq_list_empty(&ctx->iopoll_list)) {
1573 /* let it sleep and repeat later if can't complete a request */
1574 if (io_do_iopoll(ctx, true) == 0)
1577 * Ensure we allow local-to-the-cpu processing to take place,
1578 * in this case we need to ensure that we reap all events.
1579 * Also let task_work, etc. to progress by releasing the mutex
1581 if (need_resched()) {
1582 mutex_unlock(&ctx->uring_lock);
1584 mutex_lock(&ctx->uring_lock);
1587 mutex_unlock(&ctx->uring_lock);
1590 static int io_iopoll_check(struct io_ring_ctx *ctx, long min)
1592 unsigned int nr_events = 0;
1594 unsigned long check_cq;
1596 if (!io_allowed_run_tw(ctx))
1599 check_cq = READ_ONCE(ctx->check_cq);
1600 if (unlikely(check_cq)) {
1601 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
1602 __io_cqring_overflow_flush(ctx);
1604 * Similarly do not spin if we have not informed the user of any
1607 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT))
1611 * Don't enter poll loop if we already have events pending.
1612 * If we do, we can potentially be spinning for commands that
1613 * already triggered a CQE (eg in error).
1615 if (io_cqring_events(ctx))
1620 * If a submit got punted to a workqueue, we can have the
1621 * application entering polling for a command before it gets
1622 * issued. That app will hold the uring_lock for the duration
1623 * of the poll right here, so we need to take a breather every
1624 * now and then to ensure that the issue has a chance to add
1625 * the poll to the issued list. Otherwise we can spin here
1626 * forever, while the workqueue is stuck trying to acquire the
1629 if (wq_list_empty(&ctx->iopoll_list) ||
1630 io_task_work_pending(ctx)) {
1631 u32 tail = ctx->cached_cq_tail;
1633 (void) io_run_local_work_locked(ctx);
1635 if (task_work_pending(current) ||
1636 wq_list_empty(&ctx->iopoll_list)) {
1637 mutex_unlock(&ctx->uring_lock);
1639 mutex_lock(&ctx->uring_lock);
1641 /* some requests don't go through iopoll_list */
1642 if (tail != ctx->cached_cq_tail ||
1643 wq_list_empty(&ctx->iopoll_list))
1646 ret = io_do_iopoll(ctx, !min);
1651 } while (nr_events < min && !need_resched());
1656 void io_req_task_complete(struct io_kiocb *req, bool *locked)
1659 io_req_complete_defer(req);
1661 io_req_complete_post(req, IO_URING_F_UNLOCKED);
1665 * After the iocb has been issued, it's safe to be found on the poll list.
1666 * Adding the kiocb to the list AFTER submission ensures that we don't
1667 * find it from a io_do_iopoll() thread before the issuer is done
1668 * accessing the kiocb cookie.
1670 static void io_iopoll_req_issued(struct io_kiocb *req, unsigned int issue_flags)
1672 struct io_ring_ctx *ctx = req->ctx;
1673 const bool needs_lock = issue_flags & IO_URING_F_UNLOCKED;
1675 /* workqueue context doesn't hold uring_lock, grab it now */
1676 if (unlikely(needs_lock))
1677 mutex_lock(&ctx->uring_lock);
1680 * Track whether we have multiple files in our lists. This will impact
1681 * how we do polling eventually, not spinning if we're on potentially
1682 * different devices.
1684 if (wq_list_empty(&ctx->iopoll_list)) {
1685 ctx->poll_multi_queue = false;
1686 } else if (!ctx->poll_multi_queue) {
1687 struct io_kiocb *list_req;
1689 list_req = container_of(ctx->iopoll_list.first, struct io_kiocb,
1691 if (list_req->file != req->file)
1692 ctx->poll_multi_queue = true;
1696 * For fast devices, IO may have already completed. If it has, add
1697 * it to the front so we find it first.
1699 if (READ_ONCE(req->iopoll_completed))
1700 wq_list_add_head(&req->comp_list, &ctx->iopoll_list);
1702 wq_list_add_tail(&req->comp_list, &ctx->iopoll_list);
1704 if (unlikely(needs_lock)) {
1706 * If IORING_SETUP_SQPOLL is enabled, sqes are either handle
1707 * in sq thread task context or in io worker task context. If
1708 * current task context is sq thread, we don't need to check
1709 * whether should wake up sq thread.
1711 if ((ctx->flags & IORING_SETUP_SQPOLL) &&
1712 wq_has_sleeper(&ctx->sq_data->wait))
1713 wake_up(&ctx->sq_data->wait);
1715 mutex_unlock(&ctx->uring_lock);
1719 static bool io_bdev_nowait(struct block_device *bdev)
1721 return !bdev || bdev_nowait(bdev);
1725 * If we tracked the file through the SCM inflight mechanism, we could support
1726 * any file. For now, just ensure that anything potentially problematic is done
1729 static bool __io_file_supports_nowait(struct file *file, umode_t mode)
1731 if (S_ISBLK(mode)) {
1732 if (IS_ENABLED(CONFIG_BLOCK) &&
1733 io_bdev_nowait(I_BDEV(file->f_mapping->host)))
1739 if (S_ISREG(mode)) {
1740 if (IS_ENABLED(CONFIG_BLOCK) &&
1741 io_bdev_nowait(file->f_inode->i_sb->s_bdev) &&
1742 !io_is_uring_fops(file))
1747 /* any ->read/write should understand O_NONBLOCK */
1748 if (file->f_flags & O_NONBLOCK)
1750 return file->f_mode & FMODE_NOWAIT;
1754 * If we tracked the file through the SCM inflight mechanism, we could support
1755 * any file. For now, just ensure that anything potentially problematic is done
1758 unsigned int io_file_get_flags(struct file *file)
1760 umode_t mode = file_inode(file)->i_mode;
1761 unsigned int res = 0;
1765 if (__io_file_supports_nowait(file, mode))
1770 bool io_alloc_async_data(struct io_kiocb *req)
1772 WARN_ON_ONCE(!io_cold_defs[req->opcode].async_size);
1773 req->async_data = kmalloc(io_cold_defs[req->opcode].async_size, GFP_KERNEL);
1774 if (req->async_data) {
1775 req->flags |= REQ_F_ASYNC_DATA;
1781 int io_req_prep_async(struct io_kiocb *req)
1783 const struct io_cold_def *cdef = &io_cold_defs[req->opcode];
1784 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1786 /* assign early for deferred execution for non-fixed file */
1787 if (def->needs_file && !(req->flags & REQ_F_FIXED_FILE) && !req->file)
1788 req->file = io_file_get_normal(req, req->cqe.fd);
1789 if (!cdef->prep_async)
1791 if (WARN_ON_ONCE(req_has_async_data(req)))
1793 if (!def->manual_alloc) {
1794 if (io_alloc_async_data(req))
1797 return cdef->prep_async(req);
1800 static u32 io_get_sequence(struct io_kiocb *req)
1802 u32 seq = req->ctx->cached_sq_head;
1803 struct io_kiocb *cur;
1805 /* need original cached_sq_head, but it was increased for each req */
1806 io_for_each_link(cur, req)
1811 static __cold void io_drain_req(struct io_kiocb *req)
1812 __must_hold(&ctx->uring_lock)
1814 struct io_ring_ctx *ctx = req->ctx;
1815 struct io_defer_entry *de;
1817 u32 seq = io_get_sequence(req);
1819 /* Still need defer if there is pending req in defer list. */
1820 spin_lock(&ctx->completion_lock);
1821 if (!req_need_defer(req, seq) && list_empty_careful(&ctx->defer_list)) {
1822 spin_unlock(&ctx->completion_lock);
1824 ctx->drain_active = false;
1825 io_req_task_queue(req);
1828 spin_unlock(&ctx->completion_lock);
1830 io_prep_async_link(req);
1831 de = kmalloc(sizeof(*de), GFP_KERNEL);
1834 io_req_defer_failed(req, ret);
1838 spin_lock(&ctx->completion_lock);
1839 if (!req_need_defer(req, seq) && list_empty(&ctx->defer_list)) {
1840 spin_unlock(&ctx->completion_lock);
1845 trace_io_uring_defer(req);
1848 list_add_tail(&de->list, &ctx->defer_list);
1849 spin_unlock(&ctx->completion_lock);
1852 static void io_clean_op(struct io_kiocb *req)
1854 if (req->flags & REQ_F_BUFFER_SELECTED) {
1855 spin_lock(&req->ctx->completion_lock);
1856 io_put_kbuf_comp(req);
1857 spin_unlock(&req->ctx->completion_lock);
1860 if (req->flags & REQ_F_NEED_CLEANUP) {
1861 const struct io_cold_def *def = &io_cold_defs[req->opcode];
1866 if ((req->flags & REQ_F_POLLED) && req->apoll) {
1867 kfree(req->apoll->double_poll);
1871 if (req->flags & REQ_F_INFLIGHT) {
1872 struct io_uring_task *tctx = req->task->io_uring;
1874 atomic_dec(&tctx->inflight_tracked);
1876 if (req->flags & REQ_F_CREDS)
1877 put_cred(req->creds);
1878 if (req->flags & REQ_F_ASYNC_DATA) {
1879 kfree(req->async_data);
1880 req->async_data = NULL;
1882 req->flags &= ~IO_REQ_CLEAN_FLAGS;
1885 static bool io_assign_file(struct io_kiocb *req, const struct io_issue_def *def,
1886 unsigned int issue_flags)
1888 if (req->file || !def->needs_file)
1891 if (req->flags & REQ_F_FIXED_FILE)
1892 req->file = io_file_get_fixed(req, req->cqe.fd, issue_flags);
1894 req->file = io_file_get_normal(req, req->cqe.fd);
1899 static int io_issue_sqe(struct io_kiocb *req, unsigned int issue_flags)
1901 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1902 const struct cred *creds = NULL;
1905 if (unlikely(!io_assign_file(req, def, issue_flags)))
1908 if (unlikely((req->flags & REQ_F_CREDS) && req->creds != current_cred()))
1909 creds = override_creds(req->creds);
1911 if (!def->audit_skip)
1912 audit_uring_entry(req->opcode);
1914 ret = def->issue(req, issue_flags);
1916 if (!def->audit_skip)
1917 audit_uring_exit(!ret, ret);
1920 revert_creds(creds);
1922 if (ret == IOU_OK) {
1923 if (issue_flags & IO_URING_F_COMPLETE_DEFER)
1924 io_req_complete_defer(req);
1926 io_req_complete_post(req, issue_flags);
1927 } else if (ret != IOU_ISSUE_SKIP_COMPLETE)
1930 /* If the op doesn't have a file, we're not polling for it */
1931 if ((req->ctx->flags & IORING_SETUP_IOPOLL) && def->iopoll_queue)
1932 io_iopoll_req_issued(req, issue_flags);
1937 int io_poll_issue(struct io_kiocb *req, bool *locked)
1939 io_tw_lock(req->ctx, locked);
1940 return io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_MULTISHOT|
1941 IO_URING_F_COMPLETE_DEFER);
1944 struct io_wq_work *io_wq_free_work(struct io_wq_work *work)
1946 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1948 req = io_put_req_find_next(req);
1949 return req ? &req->work : NULL;
1952 void io_wq_submit_work(struct io_wq_work *work)
1954 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
1955 const struct io_issue_def *def = &io_issue_defs[req->opcode];
1956 unsigned int issue_flags = IO_URING_F_UNLOCKED | IO_URING_F_IOWQ;
1957 bool needs_poll = false;
1958 int ret = 0, err = -ECANCELED;
1960 /* one will be dropped by ->io_wq_free_work() after returning to io-wq */
1961 if (!(req->flags & REQ_F_REFCOUNT))
1962 __io_req_set_refcount(req, 2);
1966 io_arm_ltimeout(req);
1968 /* either cancelled or io-wq is dying, so don't touch tctx->iowq */
1969 if (work->flags & IO_WQ_WORK_CANCEL) {
1971 io_req_task_queue_fail(req, err);
1974 if (!io_assign_file(req, def, issue_flags)) {
1976 work->flags |= IO_WQ_WORK_CANCEL;
1980 if (req->flags & REQ_F_FORCE_ASYNC) {
1981 bool opcode_poll = def->pollin || def->pollout;
1983 if (opcode_poll && file_can_poll(req->file)) {
1985 issue_flags |= IO_URING_F_NONBLOCK;
1990 ret = io_issue_sqe(req, issue_flags);
1994 * We can get EAGAIN for iopolled IO even though we're
1995 * forcing a sync submission from here, since we can't
1996 * wait for request slots on the block side.
1999 if (!(req->ctx->flags & IORING_SETUP_IOPOLL))
2005 if (io_arm_poll_handler(req, issue_flags) == IO_APOLL_OK)
2007 /* aborted or ready, in either case retry blocking */
2009 issue_flags &= ~IO_URING_F_NONBLOCK;
2012 /* avoid locking problems by failing it from a clean context */
2014 io_req_task_queue_fail(req, ret);
2017 inline struct file *io_file_get_fixed(struct io_kiocb *req, int fd,
2018 unsigned int issue_flags)
2020 struct io_ring_ctx *ctx = req->ctx;
2021 struct file *file = NULL;
2022 unsigned long file_ptr;
2024 io_ring_submit_lock(ctx, issue_flags);
2026 if (unlikely((unsigned int)fd >= ctx->nr_user_files))
2028 fd = array_index_nospec(fd, ctx->nr_user_files);
2029 file_ptr = io_fixed_file_slot(&ctx->file_table, fd)->file_ptr;
2030 file = (struct file *) (file_ptr & FFS_MASK);
2031 file_ptr &= ~FFS_MASK;
2032 /* mask in overlapping REQ_F and FFS bits */
2033 req->flags |= (file_ptr << REQ_F_SUPPORT_NOWAIT_BIT);
2034 io_req_set_rsrc_node(req, ctx, 0);
2036 io_ring_submit_unlock(ctx, issue_flags);
2040 struct file *io_file_get_normal(struct io_kiocb *req, int fd)
2042 struct file *file = fget(fd);
2044 trace_io_uring_file_get(req, fd);
2046 /* we don't allow fixed io_uring files */
2047 if (file && io_is_uring_fops(file))
2048 io_req_track_inflight(req);
2052 static void io_queue_async(struct io_kiocb *req, int ret)
2053 __must_hold(&req->ctx->uring_lock)
2055 struct io_kiocb *linked_timeout;
2057 if (ret != -EAGAIN || (req->flags & REQ_F_NOWAIT)) {
2058 io_req_defer_failed(req, ret);
2062 linked_timeout = io_prep_linked_timeout(req);
2064 switch (io_arm_poll_handler(req, 0)) {
2065 case IO_APOLL_READY:
2066 io_kbuf_recycle(req, 0);
2067 io_req_task_queue(req);
2069 case IO_APOLL_ABORTED:
2070 io_kbuf_recycle(req, 0);
2071 io_queue_iowq(req, NULL);
2078 io_queue_linked_timeout(linked_timeout);
2081 static inline void io_queue_sqe(struct io_kiocb *req)
2082 __must_hold(&req->ctx->uring_lock)
2086 ret = io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_COMPLETE_DEFER);
2089 * We async punt it if the file wasn't marked NOWAIT, or if the file
2090 * doesn't support non-blocking read/write attempts
2093 io_arm_ltimeout(req);
2095 io_queue_async(req, ret);
2098 static void io_queue_sqe_fallback(struct io_kiocb *req)
2099 __must_hold(&req->ctx->uring_lock)
2101 if (unlikely(req->flags & REQ_F_FAIL)) {
2103 * We don't submit, fail them all, for that replace hardlinks
2104 * with normal links. Extra REQ_F_LINK is tolerated.
2106 req->flags &= ~REQ_F_HARDLINK;
2107 req->flags |= REQ_F_LINK;
2108 io_req_defer_failed(req, req->cqe.res);
2110 int ret = io_req_prep_async(req);
2112 if (unlikely(ret)) {
2113 io_req_defer_failed(req, ret);
2117 if (unlikely(req->ctx->drain_active))
2120 io_queue_iowq(req, NULL);
2125 * Check SQE restrictions (opcode and flags).
2127 * Returns 'true' if SQE is allowed, 'false' otherwise.
2129 static inline bool io_check_restriction(struct io_ring_ctx *ctx,
2130 struct io_kiocb *req,
2131 unsigned int sqe_flags)
2133 if (!test_bit(req->opcode, ctx->restrictions.sqe_op))
2136 if ((sqe_flags & ctx->restrictions.sqe_flags_required) !=
2137 ctx->restrictions.sqe_flags_required)
2140 if (sqe_flags & ~(ctx->restrictions.sqe_flags_allowed |
2141 ctx->restrictions.sqe_flags_required))
2147 static void io_init_req_drain(struct io_kiocb *req)
2149 struct io_ring_ctx *ctx = req->ctx;
2150 struct io_kiocb *head = ctx->submit_state.link.head;
2152 ctx->drain_active = true;
2155 * If we need to drain a request in the middle of a link, drain
2156 * the head request and the next request/link after the current
2157 * link. Considering sequential execution of links,
2158 * REQ_F_IO_DRAIN will be maintained for every request of our
2161 head->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2162 ctx->drain_next = true;
2166 static int io_init_req(struct io_ring_ctx *ctx, struct io_kiocb *req,
2167 const struct io_uring_sqe *sqe)
2168 __must_hold(&ctx->uring_lock)
2170 const struct io_issue_def *def;
2171 unsigned int sqe_flags;
2175 /* req is partially pre-initialised, see io_preinit_req() */
2176 req->opcode = opcode = READ_ONCE(sqe->opcode);
2177 /* same numerical values with corresponding REQ_F_*, safe to copy */
2178 req->flags = sqe_flags = READ_ONCE(sqe->flags);
2179 req->cqe.user_data = READ_ONCE(sqe->user_data);
2181 req->rsrc_node = NULL;
2182 req->task = current;
2184 if (unlikely(opcode >= IORING_OP_LAST)) {
2188 def = &io_issue_defs[opcode];
2189 if (unlikely(sqe_flags & ~SQE_COMMON_FLAGS)) {
2190 /* enforce forwards compatibility on users */
2191 if (sqe_flags & ~SQE_VALID_FLAGS)
2193 if (sqe_flags & IOSQE_BUFFER_SELECT) {
2194 if (!def->buffer_select)
2196 req->buf_index = READ_ONCE(sqe->buf_group);
2198 if (sqe_flags & IOSQE_CQE_SKIP_SUCCESS)
2199 ctx->drain_disabled = true;
2200 if (sqe_flags & IOSQE_IO_DRAIN) {
2201 if (ctx->drain_disabled)
2203 io_init_req_drain(req);
2206 if (unlikely(ctx->restricted || ctx->drain_active || ctx->drain_next)) {
2207 if (ctx->restricted && !io_check_restriction(ctx, req, sqe_flags))
2209 /* knock it to the slow queue path, will be drained there */
2210 if (ctx->drain_active)
2211 req->flags |= REQ_F_FORCE_ASYNC;
2212 /* if there is no link, we're at "next" request and need to drain */
2213 if (unlikely(ctx->drain_next) && !ctx->submit_state.link.head) {
2214 ctx->drain_next = false;
2215 ctx->drain_active = true;
2216 req->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC;
2220 if (!def->ioprio && sqe->ioprio)
2222 if (!def->iopoll && (ctx->flags & IORING_SETUP_IOPOLL))
2225 if (def->needs_file) {
2226 struct io_submit_state *state = &ctx->submit_state;
2228 req->cqe.fd = READ_ONCE(sqe->fd);
2231 * Plug now if we have more than 2 IO left after this, and the
2232 * target is potentially a read/write to block based storage.
2234 if (state->need_plug && def->plug) {
2235 state->plug_started = true;
2236 state->need_plug = false;
2237 blk_start_plug_nr_ios(&state->plug, state->submit_nr);
2241 personality = READ_ONCE(sqe->personality);
2245 req->creds = xa_load(&ctx->personalities, personality);
2248 get_cred(req->creds);
2249 ret = security_uring_override_creds(req->creds);
2251 put_cred(req->creds);
2254 req->flags |= REQ_F_CREDS;
2257 return def->prep(req, sqe);
2260 static __cold int io_submit_fail_init(const struct io_uring_sqe *sqe,
2261 struct io_kiocb *req, int ret)
2263 struct io_ring_ctx *ctx = req->ctx;
2264 struct io_submit_link *link = &ctx->submit_state.link;
2265 struct io_kiocb *head = link->head;
2267 trace_io_uring_req_failed(sqe, req, ret);
2270 * Avoid breaking links in the middle as it renders links with SQPOLL
2271 * unusable. Instead of failing eagerly, continue assembling the link if
2272 * applicable and mark the head with REQ_F_FAIL. The link flushing code
2273 * should find the flag and handle the rest.
2275 req_fail_link_node(req, ret);
2276 if (head && !(head->flags & REQ_F_FAIL))
2277 req_fail_link_node(head, -ECANCELED);
2279 if (!(req->flags & IO_REQ_LINK_FLAGS)) {
2281 link->last->link = req;
2285 io_queue_sqe_fallback(req);
2290 link->last->link = req;
2297 static inline int io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req,
2298 const struct io_uring_sqe *sqe)
2299 __must_hold(&ctx->uring_lock)
2301 struct io_submit_link *link = &ctx->submit_state.link;
2304 ret = io_init_req(ctx, req, sqe);
2306 return io_submit_fail_init(sqe, req, ret);
2308 /* don't need @sqe from now on */
2309 trace_io_uring_submit_sqe(req, true);
2312 * If we already have a head request, queue this one for async
2313 * submittal once the head completes. If we don't have a head but
2314 * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be
2315 * submitted sync once the chain is complete. If none of those
2316 * conditions are true (normal request), then just queue it.
2318 if (unlikely(link->head)) {
2319 ret = io_req_prep_async(req);
2321 return io_submit_fail_init(sqe, req, ret);
2323 trace_io_uring_link(req, link->head);
2324 link->last->link = req;
2327 if (req->flags & IO_REQ_LINK_FLAGS)
2329 /* last request of the link, flush it */
2332 if (req->flags & (REQ_F_FORCE_ASYNC | REQ_F_FAIL))
2335 } else if (unlikely(req->flags & (IO_REQ_LINK_FLAGS |
2336 REQ_F_FORCE_ASYNC | REQ_F_FAIL))) {
2337 if (req->flags & IO_REQ_LINK_FLAGS) {
2342 io_queue_sqe_fallback(req);
2352 * Batched submission is done, ensure local IO is flushed out.
2354 static void io_submit_state_end(struct io_ring_ctx *ctx)
2356 struct io_submit_state *state = &ctx->submit_state;
2358 if (unlikely(state->link.head))
2359 io_queue_sqe_fallback(state->link.head);
2360 /* flush only after queuing links as they can generate completions */
2361 io_submit_flush_completions(ctx);
2362 if (state->plug_started)
2363 blk_finish_plug(&state->plug);
2367 * Start submission side cache.
2369 static void io_submit_state_start(struct io_submit_state *state,
2370 unsigned int max_ios)
2372 state->plug_started = false;
2373 state->need_plug = max_ios > 2;
2374 state->submit_nr = max_ios;
2375 /* set only head, no need to init link_last in advance */
2376 state->link.head = NULL;
2379 static void io_commit_sqring(struct io_ring_ctx *ctx)
2381 struct io_rings *rings = ctx->rings;
2384 * Ensure any loads from the SQEs are done at this point,
2385 * since once we write the new head, the application could
2386 * write new data to them.
2388 smp_store_release(&rings->sq.head, ctx->cached_sq_head);
2392 * Fetch an sqe, if one is available. Note this returns a pointer to memory
2393 * that is mapped by userspace. This means that care needs to be taken to
2394 * ensure that reads are stable, as we cannot rely on userspace always
2395 * being a good citizen. If members of the sqe are validated and then later
2396 * used, it's important that those reads are done through READ_ONCE() to
2397 * prevent a re-load down the line.
2399 static bool io_get_sqe(struct io_ring_ctx *ctx, const struct io_uring_sqe **sqe)
2401 unsigned head, mask = ctx->sq_entries - 1;
2402 unsigned sq_idx = ctx->cached_sq_head++ & mask;
2405 * The cached sq head (or cq tail) serves two purposes:
2407 * 1) allows us to batch the cost of updating the user visible
2409 * 2) allows the kernel side to track the head on its own, even
2410 * though the application is the one updating it.
2412 head = READ_ONCE(ctx->sq_array[sq_idx]);
2413 if (likely(head < ctx->sq_entries)) {
2414 /* double index for 128-byte SQEs, twice as long */
2415 if (ctx->flags & IORING_SETUP_SQE128)
2417 *sqe = &ctx->sq_sqes[head];
2421 /* drop invalid entries */
2423 WRITE_ONCE(ctx->rings->sq_dropped,
2424 READ_ONCE(ctx->rings->sq_dropped) + 1);
2428 int io_submit_sqes(struct io_ring_ctx *ctx, unsigned int nr)
2429 __must_hold(&ctx->uring_lock)
2431 unsigned int entries = io_sqring_entries(ctx);
2435 if (unlikely(!entries))
2437 /* make sure SQ entry isn't read before tail */
2438 ret = left = min3(nr, ctx->sq_entries, entries);
2439 io_get_task_refs(left);
2440 io_submit_state_start(&ctx->submit_state, left);
2443 const struct io_uring_sqe *sqe;
2444 struct io_kiocb *req;
2446 if (unlikely(!io_alloc_req(ctx, &req)))
2448 if (unlikely(!io_get_sqe(ctx, &sqe))) {
2449 io_req_add_to_cache(req, ctx);
2454 * Continue submitting even for sqe failure if the
2455 * ring was setup with IORING_SETUP_SUBMIT_ALL
2457 if (unlikely(io_submit_sqe(ctx, req, sqe)) &&
2458 !(ctx->flags & IORING_SETUP_SUBMIT_ALL)) {
2464 if (unlikely(left)) {
2466 /* try again if it submitted nothing and can't allocate a req */
2467 if (!ret && io_req_cache_empty(ctx))
2469 current->io_uring->cached_refs += left;
2472 io_submit_state_end(ctx);
2473 /* Commit SQ ring head once we've consumed and submitted all SQEs */
2474 io_commit_sqring(ctx);
2478 struct io_wait_queue {
2479 struct wait_queue_entry wq;
2480 struct io_ring_ctx *ctx;
2482 unsigned nr_timeouts;
2486 static inline bool io_has_work(struct io_ring_ctx *ctx)
2488 return test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq) ||
2489 !llist_empty(&ctx->work_llist);
2492 static inline bool io_should_wake(struct io_wait_queue *iowq)
2494 struct io_ring_ctx *ctx = iowq->ctx;
2495 int dist = READ_ONCE(ctx->rings->cq.tail) - (int) iowq->cq_tail;
2498 * Wake up if we have enough events, or if a timeout occurred since we
2499 * started waiting. For timeouts, we always want to return to userspace,
2500 * regardless of event count.
2502 return dist >= 0 || atomic_read(&ctx->cq_timeouts) != iowq->nr_timeouts;
2505 static int io_wake_function(struct wait_queue_entry *curr, unsigned int mode,
2506 int wake_flags, void *key)
2508 struct io_wait_queue *iowq = container_of(curr, struct io_wait_queue, wq);
2511 * Cannot safely flush overflowed CQEs from here, ensure we wake up
2512 * the task, and the next invocation will do it.
2514 if (io_should_wake(iowq) || io_has_work(iowq->ctx))
2515 return autoremove_wake_function(curr, mode, wake_flags, key);
2519 int io_run_task_work_sig(struct io_ring_ctx *ctx)
2521 if (!llist_empty(&ctx->work_llist)) {
2522 __set_current_state(TASK_RUNNING);
2523 if (io_run_local_work(ctx) > 0)
2526 if (io_run_task_work() > 0)
2528 if (task_sigpending(current))
2533 /* when returns >0, the caller should retry */
2534 static inline int io_cqring_wait_schedule(struct io_ring_ctx *ctx,
2535 struct io_wait_queue *iowq)
2537 if (unlikely(READ_ONCE(ctx->check_cq)))
2539 if (unlikely(!llist_empty(&ctx->work_llist)))
2541 if (unlikely(test_thread_flag(TIF_NOTIFY_SIGNAL)))
2543 if (unlikely(task_sigpending(current)))
2545 if (unlikely(io_should_wake(iowq)))
2547 if (iowq->timeout == KTIME_MAX)
2549 else if (!schedule_hrtimeout(&iowq->timeout, HRTIMER_MODE_ABS))
2555 * Wait until events become available, if we don't already have some. The
2556 * application must reap them itself, as they reside on the shared cq ring.
2558 static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events,
2559 const sigset_t __user *sig, size_t sigsz,
2560 struct __kernel_timespec __user *uts)
2562 struct io_wait_queue iowq;
2563 struct io_rings *rings = ctx->rings;
2566 if (!io_allowed_run_tw(ctx))
2568 if (!llist_empty(&ctx->work_llist))
2569 io_run_local_work(ctx);
2571 io_cqring_overflow_flush(ctx);
2572 /* if user messes with these they will just get an early return */
2573 if (__io_cqring_events_user(ctx) >= min_events)
2577 #ifdef CONFIG_COMPAT
2578 if (in_compat_syscall())
2579 ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig,
2583 ret = set_user_sigmask(sig, sigsz);
2589 init_waitqueue_func_entry(&iowq.wq, io_wake_function);
2590 iowq.wq.private = current;
2591 INIT_LIST_HEAD(&iowq.wq.entry);
2593 iowq.nr_timeouts = atomic_read(&ctx->cq_timeouts);
2594 iowq.cq_tail = READ_ONCE(ctx->rings->cq.head) + min_events;
2595 iowq.timeout = KTIME_MAX;
2598 struct timespec64 ts;
2600 if (get_timespec64(&ts, uts))
2602 iowq.timeout = ktime_add_ns(timespec64_to_ktime(ts), ktime_get_ns());
2605 trace_io_uring_cqring_wait(ctx, min_events);
2607 unsigned long check_cq;
2609 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN) {
2610 WRITE_ONCE(ctx->cq_waiting, 1);
2611 set_current_state(TASK_INTERRUPTIBLE);
2613 prepare_to_wait_exclusive(&ctx->cq_wait, &iowq.wq,
2614 TASK_INTERRUPTIBLE);
2617 ret = io_cqring_wait_schedule(ctx, &iowq);
2618 __set_current_state(TASK_RUNNING);
2619 WRITE_ONCE(ctx->cq_waiting, 0);
2624 * Run task_work after scheduling and before io_should_wake().
2625 * If we got woken because of task_work being processed, run it
2626 * now rather than let the caller do another wait loop.
2629 if (!llist_empty(&ctx->work_llist))
2630 io_run_local_work(ctx);
2632 check_cq = READ_ONCE(ctx->check_cq);
2633 if (unlikely(check_cq)) {
2634 /* let the caller flush overflows, retry */
2635 if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT))
2636 io_cqring_do_overflow_flush(ctx);
2637 if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT)) {
2643 if (io_should_wake(&iowq)) {
2650 if (!(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
2651 finish_wait(&ctx->cq_wait, &iowq.wq);
2652 restore_saved_sigmask_unless(ret == -EINTR);
2654 return READ_ONCE(rings->cq.head) == READ_ONCE(rings->cq.tail) ? ret : 0;
2657 static void io_mem_free(void *ptr)
2664 page = virt_to_head_page(ptr);
2665 if (put_page_testzero(page))
2666 free_compound_page(page);
2669 static void *io_mem_alloc(size_t size)
2671 gfp_t gfp = GFP_KERNEL_ACCOUNT | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP;
2673 return (void *) __get_free_pages(gfp, get_order(size));
2676 static unsigned long rings_size(struct io_ring_ctx *ctx, unsigned int sq_entries,
2677 unsigned int cq_entries, size_t *sq_offset)
2679 struct io_rings *rings;
2680 size_t off, sq_array_size;
2682 off = struct_size(rings, cqes, cq_entries);
2683 if (off == SIZE_MAX)
2685 if (ctx->flags & IORING_SETUP_CQE32) {
2686 if (check_shl_overflow(off, 1, &off))
2691 off = ALIGN(off, SMP_CACHE_BYTES);
2699 sq_array_size = array_size(sizeof(u32), sq_entries);
2700 if (sq_array_size == SIZE_MAX)
2703 if (check_add_overflow(off, sq_array_size, &off))
2709 static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg,
2710 unsigned int eventfd_async)
2712 struct io_ev_fd *ev_fd;
2713 __s32 __user *fds = arg;
2716 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2717 lockdep_is_held(&ctx->uring_lock));
2721 if (copy_from_user(&fd, fds, sizeof(*fds)))
2724 ev_fd = kmalloc(sizeof(*ev_fd), GFP_KERNEL);
2728 ev_fd->cq_ev_fd = eventfd_ctx_fdget(fd);
2729 if (IS_ERR(ev_fd->cq_ev_fd)) {
2730 int ret = PTR_ERR(ev_fd->cq_ev_fd);
2735 spin_lock(&ctx->completion_lock);
2736 ctx->evfd_last_cq_tail = ctx->cached_cq_tail;
2737 spin_unlock(&ctx->completion_lock);
2739 ev_fd->eventfd_async = eventfd_async;
2740 ctx->has_evfd = true;
2741 rcu_assign_pointer(ctx->io_ev_fd, ev_fd);
2742 atomic_set(&ev_fd->refs, 1);
2743 atomic_set(&ev_fd->ops, 0);
2747 static int io_eventfd_unregister(struct io_ring_ctx *ctx)
2749 struct io_ev_fd *ev_fd;
2751 ev_fd = rcu_dereference_protected(ctx->io_ev_fd,
2752 lockdep_is_held(&ctx->uring_lock));
2754 ctx->has_evfd = false;
2755 rcu_assign_pointer(ctx->io_ev_fd, NULL);
2756 if (!atomic_fetch_or(BIT(IO_EVENTFD_OP_FREE_BIT), &ev_fd->ops))
2757 call_rcu(&ev_fd->rcu, io_eventfd_ops);
2764 static void io_req_caches_free(struct io_ring_ctx *ctx)
2766 struct io_kiocb *req;
2769 mutex_lock(&ctx->uring_lock);
2770 io_flush_cached_locked_reqs(ctx, &ctx->submit_state);
2772 while (!io_req_cache_empty(ctx)) {
2773 req = io_extract_req(ctx);
2774 kmem_cache_free(req_cachep, req);
2778 percpu_ref_put_many(&ctx->refs, nr);
2779 mutex_unlock(&ctx->uring_lock);
2782 static __cold void io_ring_ctx_free(struct io_ring_ctx *ctx)
2784 io_sq_thread_finish(ctx);
2785 io_rsrc_refs_drop(ctx);
2786 /* __io_rsrc_put_work() may need uring_lock to progress, wait w/o it */
2787 io_wait_rsrc_data(ctx->buf_data);
2788 io_wait_rsrc_data(ctx->file_data);
2790 mutex_lock(&ctx->uring_lock);
2792 __io_sqe_buffers_unregister(ctx);
2794 __io_sqe_files_unregister(ctx);
2795 io_cqring_overflow_kill(ctx);
2796 io_eventfd_unregister(ctx);
2797 io_alloc_cache_free(&ctx->apoll_cache, io_apoll_cache_free);
2798 io_alloc_cache_free(&ctx->netmsg_cache, io_netmsg_cache_free);
2799 mutex_unlock(&ctx->uring_lock);
2800 io_destroy_buffers(ctx);
2802 put_cred(ctx->sq_creds);
2803 if (ctx->submitter_task)
2804 put_task_struct(ctx->submitter_task);
2806 /* there are no registered resources left, nobody uses it */
2808 io_rsrc_node_destroy(ctx->rsrc_node);
2809 if (ctx->rsrc_backup_node)
2810 io_rsrc_node_destroy(ctx->rsrc_backup_node);
2811 flush_delayed_work(&ctx->rsrc_put_work);
2812 flush_delayed_work(&ctx->fallback_work);
2814 WARN_ON_ONCE(!list_empty(&ctx->rsrc_ref_list));
2815 WARN_ON_ONCE(!llist_empty(&ctx->rsrc_put_llist));
2817 #if defined(CONFIG_UNIX)
2818 if (ctx->ring_sock) {
2819 ctx->ring_sock->file = NULL; /* so that iput() is called */
2820 sock_release(ctx->ring_sock);
2823 WARN_ON_ONCE(!list_empty(&ctx->ltimeout_list));
2825 if (ctx->mm_account) {
2826 mmdrop(ctx->mm_account);
2827 ctx->mm_account = NULL;
2829 io_mem_free(ctx->rings);
2830 io_mem_free(ctx->sq_sqes);
2832 percpu_ref_exit(&ctx->refs);
2833 free_uid(ctx->user);
2834 io_req_caches_free(ctx);
2836 io_wq_put_hash(ctx->hash_map);
2837 kfree(ctx->cancel_table.hbs);
2838 kfree(ctx->cancel_table_locked.hbs);
2839 kfree(ctx->dummy_ubuf);
2841 xa_destroy(&ctx->io_bl_xa);
2845 static __cold void io_activate_pollwq_cb(struct callback_head *cb)
2847 struct io_ring_ctx *ctx = container_of(cb, struct io_ring_ctx,
2850 mutex_lock(&ctx->uring_lock);
2851 ctx->poll_activated = true;
2852 mutex_unlock(&ctx->uring_lock);
2855 * Wake ups for some events between start of polling and activation
2856 * might've been lost due to loose synchronisation.
2858 wake_up_all(&ctx->poll_wq);
2859 percpu_ref_put(&ctx->refs);
2862 static __cold void io_activate_pollwq(struct io_ring_ctx *ctx)
2864 spin_lock(&ctx->completion_lock);
2865 /* already activated or in progress */
2866 if (ctx->poll_activated || ctx->poll_wq_task_work.func)
2868 if (WARN_ON_ONCE(!ctx->task_complete))
2870 if (!ctx->submitter_task)
2873 * with ->submitter_task only the submitter task completes requests, we
2874 * only need to sync with it, which is done by injecting a tw
2876 init_task_work(&ctx->poll_wq_task_work, io_activate_pollwq_cb);
2877 percpu_ref_get(&ctx->refs);
2878 if (task_work_add(ctx->submitter_task, &ctx->poll_wq_task_work, TWA_SIGNAL))
2879 percpu_ref_put(&ctx->refs);
2881 spin_unlock(&ctx->completion_lock);
2884 static __poll_t io_uring_poll(struct file *file, poll_table *wait)
2886 struct io_ring_ctx *ctx = file->private_data;
2889 if (unlikely(!ctx->poll_activated))
2890 io_activate_pollwq(ctx);
2892 poll_wait(file, &ctx->poll_wq, wait);
2894 * synchronizes with barrier from wq_has_sleeper call in
2898 if (!io_sqring_full(ctx))
2899 mask |= EPOLLOUT | EPOLLWRNORM;
2902 * Don't flush cqring overflow list here, just do a simple check.
2903 * Otherwise there could possible be ABBA deadlock:
2906 * lock(&ctx->uring_lock);
2908 * lock(&ctx->uring_lock);
2911 * Users may get EPOLLIN meanwhile seeing nothing in cqring, this
2912 * pushes them to do the flush.
2915 if (__io_cqring_events_user(ctx) || io_has_work(ctx))
2916 mask |= EPOLLIN | EPOLLRDNORM;
2921 static int io_unregister_personality(struct io_ring_ctx *ctx, unsigned id)
2923 const struct cred *creds;
2925 creds = xa_erase(&ctx->personalities, id);
2934 struct io_tctx_exit {
2935 struct callback_head task_work;
2936 struct completion completion;
2937 struct io_ring_ctx *ctx;
2940 static __cold void io_tctx_exit_cb(struct callback_head *cb)
2942 struct io_uring_task *tctx = current->io_uring;
2943 struct io_tctx_exit *work;
2945 work = container_of(cb, struct io_tctx_exit, task_work);
2947 * When @in_cancel, we're in cancellation and it's racy to remove the
2948 * node. It'll be removed by the end of cancellation, just ignore it.
2949 * tctx can be NULL if the queueing of this task_work raced with
2950 * work cancelation off the exec path.
2952 if (tctx && !atomic_read(&tctx->in_cancel))
2953 io_uring_del_tctx_node((unsigned long)work->ctx);
2954 complete(&work->completion);
2957 static __cold bool io_cancel_ctx_cb(struct io_wq_work *work, void *data)
2959 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
2961 return req->ctx == data;
2964 static __cold void io_ring_exit_work(struct work_struct *work)
2966 struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, exit_work);
2967 unsigned long timeout = jiffies + HZ * 60 * 5;
2968 unsigned long interval = HZ / 20;
2969 struct io_tctx_exit exit;
2970 struct io_tctx_node *node;
2974 * If we're doing polled IO and end up having requests being
2975 * submitted async (out-of-line), then completions can come in while
2976 * we're waiting for refs to drop. We need to reap these manually,
2977 * as nobody else will be looking for them.
2980 if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) {
2981 mutex_lock(&ctx->uring_lock);
2982 io_cqring_overflow_kill(ctx);
2983 mutex_unlock(&ctx->uring_lock);
2986 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
2987 io_move_task_work_from_local(ctx);
2989 while (io_uring_try_cancel_requests(ctx, NULL, true))
2993 struct io_sq_data *sqd = ctx->sq_data;
2994 struct task_struct *tsk;
2996 io_sq_thread_park(sqd);
2998 if (tsk && tsk->io_uring && tsk->io_uring->io_wq)
2999 io_wq_cancel_cb(tsk->io_uring->io_wq,
3000 io_cancel_ctx_cb, ctx, true);
3001 io_sq_thread_unpark(sqd);
3004 io_req_caches_free(ctx);
3006 if (WARN_ON_ONCE(time_after(jiffies, timeout))) {
3007 /* there is little hope left, don't run it too often */
3010 } while (!wait_for_completion_timeout(&ctx->ref_comp, interval));
3012 init_completion(&exit.completion);
3013 init_task_work(&exit.task_work, io_tctx_exit_cb);
3016 * Some may use context even when all refs and requests have been put,
3017 * and they are free to do so while still holding uring_lock or
3018 * completion_lock, see io_req_task_submit(). Apart from other work,
3019 * this lock/unlock section also waits them to finish.
3021 mutex_lock(&ctx->uring_lock);
3022 while (!list_empty(&ctx->tctx_list)) {
3023 WARN_ON_ONCE(time_after(jiffies, timeout));
3025 node = list_first_entry(&ctx->tctx_list, struct io_tctx_node,
3027 /* don't spin on a single task if cancellation failed */
3028 list_rotate_left(&ctx->tctx_list);
3029 ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL);
3030 if (WARN_ON_ONCE(ret))
3033 mutex_unlock(&ctx->uring_lock);
3034 wait_for_completion(&exit.completion);
3035 mutex_lock(&ctx->uring_lock);
3037 mutex_unlock(&ctx->uring_lock);
3038 spin_lock(&ctx->completion_lock);
3039 spin_unlock(&ctx->completion_lock);
3041 io_ring_ctx_free(ctx);
3044 static __cold void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx)
3046 unsigned long index;
3047 struct creds *creds;
3049 mutex_lock(&ctx->uring_lock);
3050 percpu_ref_kill(&ctx->refs);
3051 xa_for_each(&ctx->personalities, index, creds)
3052 io_unregister_personality(ctx, index);
3054 io_poll_remove_all(ctx, NULL, true);
3055 mutex_unlock(&ctx->uring_lock);
3058 * If we failed setting up the ctx, we might not have any rings
3059 * and therefore did not submit any requests
3062 io_kill_timeouts(ctx, NULL, true);
3064 INIT_WORK(&ctx->exit_work, io_ring_exit_work);
3066 * Use system_unbound_wq to avoid spawning tons of event kworkers
3067 * if we're exiting a ton of rings at the same time. It just adds
3068 * noise and overhead, there's no discernable change in runtime
3069 * over using system_wq.
3071 queue_work(system_unbound_wq, &ctx->exit_work);
3074 static int io_uring_release(struct inode *inode, struct file *file)
3076 struct io_ring_ctx *ctx = file->private_data;
3078 file->private_data = NULL;
3079 io_ring_ctx_wait_and_kill(ctx);
3083 struct io_task_cancel {
3084 struct task_struct *task;
3088 static bool io_cancel_task_cb(struct io_wq_work *work, void *data)
3090 struct io_kiocb *req = container_of(work, struct io_kiocb, work);
3091 struct io_task_cancel *cancel = data;
3093 return io_match_task_safe(req, cancel->task, cancel->all);
3096 static __cold bool io_cancel_defer_files(struct io_ring_ctx *ctx,
3097 struct task_struct *task,
3100 struct io_defer_entry *de;
3103 spin_lock(&ctx->completion_lock);
3104 list_for_each_entry_reverse(de, &ctx->defer_list, list) {
3105 if (io_match_task_safe(de->req, task, cancel_all)) {
3106 list_cut_position(&list, &ctx->defer_list, &de->list);
3110 spin_unlock(&ctx->completion_lock);
3111 if (list_empty(&list))
3114 while (!list_empty(&list)) {
3115 de = list_first_entry(&list, struct io_defer_entry, list);
3116 list_del_init(&de->list);
3117 io_req_task_queue_fail(de->req, -ECANCELED);
3123 static __cold bool io_uring_try_cancel_iowq(struct io_ring_ctx *ctx)
3125 struct io_tctx_node *node;
3126 enum io_wq_cancel cret;
3129 mutex_lock(&ctx->uring_lock);
3130 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
3131 struct io_uring_task *tctx = node->task->io_uring;
3134 * io_wq will stay alive while we hold uring_lock, because it's
3135 * killed after ctx nodes, which requires to take the lock.
3137 if (!tctx || !tctx->io_wq)
3139 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_ctx_cb, ctx, true);
3140 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3142 mutex_unlock(&ctx->uring_lock);
3147 static __cold bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx,
3148 struct task_struct *task,
3151 struct io_task_cancel cancel = { .task = task, .all = cancel_all, };
3152 struct io_uring_task *tctx = task ? task->io_uring : NULL;
3153 enum io_wq_cancel cret;
3156 /* failed during ring init, it couldn't have issued any requests */
3161 ret |= io_uring_try_cancel_iowq(ctx);
3162 } else if (tctx && tctx->io_wq) {
3164 * Cancels requests of all rings, not only @ctx, but
3165 * it's fine as the task is in exit/exec.
3167 cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_task_cb,
3169 ret |= (cret != IO_WQ_CANCEL_NOTFOUND);
3172 /* SQPOLL thread does its own polling */
3173 if ((!(ctx->flags & IORING_SETUP_SQPOLL) && cancel_all) ||
3174 (ctx->sq_data && ctx->sq_data->thread == current)) {
3175 while (!wq_list_empty(&ctx->iopoll_list)) {
3176 io_iopoll_try_reap_events(ctx);
3182 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3183 io_allowed_defer_tw_run(ctx))
3184 ret |= io_run_local_work(ctx) > 0;
3185 ret |= io_cancel_defer_files(ctx, task, cancel_all);
3186 mutex_lock(&ctx->uring_lock);
3187 ret |= io_poll_remove_all(ctx, task, cancel_all);
3188 mutex_unlock(&ctx->uring_lock);
3189 ret |= io_kill_timeouts(ctx, task, cancel_all);
3191 ret |= io_run_task_work() > 0;
3195 static s64 tctx_inflight(struct io_uring_task *tctx, bool tracked)
3198 return atomic_read(&tctx->inflight_tracked);
3199 return percpu_counter_sum(&tctx->inflight);
3203 * Find any io_uring ctx that this task has registered or done IO on, and cancel
3204 * requests. @sqd should be not-null IFF it's an SQPOLL thread cancellation.
3206 __cold void io_uring_cancel_generic(bool cancel_all, struct io_sq_data *sqd)
3208 struct io_uring_task *tctx = current->io_uring;
3209 struct io_ring_ctx *ctx;
3213 WARN_ON_ONCE(sqd && sqd->thread != current);
3215 if (!current->io_uring)
3218 io_wq_exit_start(tctx->io_wq);
3220 atomic_inc(&tctx->in_cancel);
3224 io_uring_drop_tctx_refs(current);
3225 /* read completions before cancelations */
3226 inflight = tctx_inflight(tctx, !cancel_all);
3231 struct io_tctx_node *node;
3232 unsigned long index;
3234 xa_for_each(&tctx->xa, index, node) {
3235 /* sqpoll task will cancel all its requests */
3236 if (node->ctx->sq_data)
3238 loop |= io_uring_try_cancel_requests(node->ctx,
3239 current, cancel_all);
3242 list_for_each_entry(ctx, &sqd->ctx_list, sqd_list)
3243 loop |= io_uring_try_cancel_requests(ctx,
3253 prepare_to_wait(&tctx->wait, &wait, TASK_INTERRUPTIBLE);
3255 io_uring_drop_tctx_refs(current);
3258 * If we've seen completions, retry without waiting. This
3259 * avoids a race where a completion comes in before we did
3260 * prepare_to_wait().
3262 if (inflight == tctx_inflight(tctx, !cancel_all))
3264 finish_wait(&tctx->wait, &wait);
3267 io_uring_clean_tctx(tctx);
3270 * We shouldn't run task_works after cancel, so just leave
3271 * ->in_cancel set for normal exit.
3273 atomic_dec(&tctx->in_cancel);
3274 /* for exec all current's requests should be gone, kill tctx */
3275 __io_uring_free(current);
3279 void __io_uring_cancel(bool cancel_all)
3281 io_uring_cancel_generic(cancel_all, NULL);
3284 static void *io_uring_validate_mmap_request(struct file *file,
3285 loff_t pgoff, size_t sz)
3287 struct io_ring_ctx *ctx = file->private_data;
3288 loff_t offset = pgoff << PAGE_SHIFT;
3292 switch (offset & IORING_OFF_MMAP_MASK) {
3293 case IORING_OFF_SQ_RING:
3294 case IORING_OFF_CQ_RING:
3297 case IORING_OFF_SQES:
3300 case IORING_OFF_PBUF_RING: {
3303 bgid = (offset & ~IORING_OFF_MMAP_MASK) >> IORING_OFF_PBUF_SHIFT;
3304 mutex_lock(&ctx->uring_lock);
3305 ptr = io_pbuf_get_address(ctx, bgid);
3306 mutex_unlock(&ctx->uring_lock);
3308 return ERR_PTR(-EINVAL);
3312 return ERR_PTR(-EINVAL);
3315 page = virt_to_head_page(ptr);
3316 if (sz > page_size(page))
3317 return ERR_PTR(-EINVAL);
3324 static __cold int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3326 size_t sz = vma->vm_end - vma->vm_start;
3330 ptr = io_uring_validate_mmap_request(file, vma->vm_pgoff, sz);
3332 return PTR_ERR(ptr);
3334 pfn = virt_to_phys(ptr) >> PAGE_SHIFT;
3335 return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot);
3338 static unsigned long io_uring_mmu_get_unmapped_area(struct file *filp,
3339 unsigned long addr, unsigned long len,
3340 unsigned long pgoff, unsigned long flags)
3342 const unsigned long mmap_end = arch_get_mmap_end(addr, len, flags);
3343 struct vm_unmapped_area_info info;
3347 * Do not allow to map to user-provided address to avoid breaking the
3348 * aliasing rules. Userspace is not able to guess the offset address of
3349 * kernel kmalloc()ed memory area.
3354 ptr = io_uring_validate_mmap_request(filp, pgoff, len);
3358 info.flags = VM_UNMAPPED_AREA_TOPDOWN;
3360 info.low_limit = max(PAGE_SIZE, mmap_min_addr);
3361 info.high_limit = arch_get_mmap_base(addr, current->mm->mmap_base);
3363 info.align_mask = PAGE_MASK & (SHM_COLOUR - 1UL);
3365 info.align_mask = PAGE_MASK & (SHMLBA - 1UL);
3367 info.align_offset = (unsigned long) ptr;
3370 * A failed mmap() very likely causes application failure,
3371 * so fall back to the bottom-up function here. This scenario
3372 * can happen with large stack limits and large mmap()
3375 addr = vm_unmapped_area(&info);
3376 if (offset_in_page(addr)) {
3378 info.low_limit = TASK_UNMAPPED_BASE;
3379 info.high_limit = mmap_end;
3380 addr = vm_unmapped_area(&info);
3386 #else /* !CONFIG_MMU */
3388 static int io_uring_mmap(struct file *file, struct vm_area_struct *vma)
3390 return is_nommu_shared_mapping(vma->vm_flags) ? 0 : -EINVAL;
3393 static unsigned int io_uring_nommu_mmap_capabilities(struct file *file)
3395 return NOMMU_MAP_DIRECT | NOMMU_MAP_READ | NOMMU_MAP_WRITE;
3398 static unsigned long io_uring_nommu_get_unmapped_area(struct file *file,
3399 unsigned long addr, unsigned long len,
3400 unsigned long pgoff, unsigned long flags)
3404 ptr = io_uring_validate_mmap_request(file, pgoff, len);
3406 return PTR_ERR(ptr);
3408 return (unsigned long) ptr;
3411 #endif /* !CONFIG_MMU */
3413 static int io_validate_ext_arg(unsigned flags, const void __user *argp, size_t argsz)
3415 if (flags & IORING_ENTER_EXT_ARG) {
3416 struct io_uring_getevents_arg arg;
3418 if (argsz != sizeof(arg))
3420 if (copy_from_user(&arg, argp, sizeof(arg)))
3426 static int io_get_ext_arg(unsigned flags, const void __user *argp, size_t *argsz,
3427 struct __kernel_timespec __user **ts,
3428 const sigset_t __user **sig)
3430 struct io_uring_getevents_arg arg;
3433 * If EXT_ARG isn't set, then we have no timespec and the argp pointer
3434 * is just a pointer to the sigset_t.
3436 if (!(flags & IORING_ENTER_EXT_ARG)) {
3437 *sig = (const sigset_t __user *) argp;
3443 * EXT_ARG is set - ensure we agree on the size of it and copy in our
3444 * timespec and sigset_t pointers if good.
3446 if (*argsz != sizeof(arg))
3448 if (copy_from_user(&arg, argp, sizeof(arg)))
3452 *sig = u64_to_user_ptr(arg.sigmask);
3453 *argsz = arg.sigmask_sz;
3454 *ts = u64_to_user_ptr(arg.ts);
3458 SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit,
3459 u32, min_complete, u32, flags, const void __user *, argp,
3462 struct io_ring_ctx *ctx;
3466 if (unlikely(flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP |
3467 IORING_ENTER_SQ_WAIT | IORING_ENTER_EXT_ARG |
3468 IORING_ENTER_REGISTERED_RING)))
3472 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
3473 * need only dereference our task private array to find it.
3475 if (flags & IORING_ENTER_REGISTERED_RING) {
3476 struct io_uring_task *tctx = current->io_uring;
3478 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
3480 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
3481 f.file = tctx->registered_rings[fd];
3483 if (unlikely(!f.file))
3487 if (unlikely(!f.file))
3490 if (unlikely(!io_is_uring_fops(f.file)))
3494 ctx = f.file->private_data;
3496 if (unlikely(ctx->flags & IORING_SETUP_R_DISABLED))
3500 * For SQ polling, the thread will do all submissions and completions.
3501 * Just return the requested submit count, and wake the thread if
3505 if (ctx->flags & IORING_SETUP_SQPOLL) {
3506 io_cqring_overflow_flush(ctx);
3508 if (unlikely(ctx->sq_data->thread == NULL)) {
3512 if (flags & IORING_ENTER_SQ_WAKEUP)
3513 wake_up(&ctx->sq_data->wait);
3514 if (flags & IORING_ENTER_SQ_WAIT)
3515 io_sqpoll_wait_sq(ctx);
3518 } else if (to_submit) {
3519 ret = io_uring_add_tctx_node(ctx);
3523 mutex_lock(&ctx->uring_lock);
3524 ret = io_submit_sqes(ctx, to_submit);
3525 if (ret != to_submit) {
3526 mutex_unlock(&ctx->uring_lock);
3529 if (flags & IORING_ENTER_GETEVENTS) {
3530 if (ctx->syscall_iopoll)
3533 * Ignore errors, we'll soon call io_cqring_wait() and
3534 * it should handle ownership problems if any.
3536 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN)
3537 (void)io_run_local_work_locked(ctx);
3539 mutex_unlock(&ctx->uring_lock);
3542 if (flags & IORING_ENTER_GETEVENTS) {
3545 if (ctx->syscall_iopoll) {
3547 * We disallow the app entering submit/complete with
3548 * polling, but we still need to lock the ring to
3549 * prevent racing with polled issue that got punted to
3552 mutex_lock(&ctx->uring_lock);
3554 ret2 = io_validate_ext_arg(flags, argp, argsz);
3555 if (likely(!ret2)) {
3556 min_complete = min(min_complete,
3558 ret2 = io_iopoll_check(ctx, min_complete);
3560 mutex_unlock(&ctx->uring_lock);
3562 const sigset_t __user *sig;
3563 struct __kernel_timespec __user *ts;
3565 ret2 = io_get_ext_arg(flags, argp, &argsz, &ts, &sig);
3566 if (likely(!ret2)) {
3567 min_complete = min(min_complete,
3569 ret2 = io_cqring_wait(ctx, min_complete, sig,
3578 * EBADR indicates that one or more CQE were dropped.
3579 * Once the user has been informed we can clear the bit
3580 * as they are obviously ok with those drops.
3582 if (unlikely(ret2 == -EBADR))
3583 clear_bit(IO_CHECK_CQ_DROPPED_BIT,
3592 static const struct file_operations io_uring_fops = {
3593 .release = io_uring_release,
3594 .mmap = io_uring_mmap,
3596 .get_unmapped_area = io_uring_nommu_get_unmapped_area,
3597 .mmap_capabilities = io_uring_nommu_mmap_capabilities,
3599 .get_unmapped_area = io_uring_mmu_get_unmapped_area,
3601 .poll = io_uring_poll,
3602 #ifdef CONFIG_PROC_FS
3603 .show_fdinfo = io_uring_show_fdinfo,
3607 bool io_is_uring_fops(struct file *file)
3609 return file->f_op == &io_uring_fops;
3612 static __cold int io_allocate_scq_urings(struct io_ring_ctx *ctx,
3613 struct io_uring_params *p)
3615 struct io_rings *rings;
3616 size_t size, sq_array_offset;
3618 /* make sure these are sane, as we already accounted them */
3619 ctx->sq_entries = p->sq_entries;
3620 ctx->cq_entries = p->cq_entries;
3622 size = rings_size(ctx, p->sq_entries, p->cq_entries, &sq_array_offset);
3623 if (size == SIZE_MAX)
3626 rings = io_mem_alloc(size);
3631 ctx->sq_array = (u32 *)((char *)rings + sq_array_offset);
3632 rings->sq_ring_mask = p->sq_entries - 1;
3633 rings->cq_ring_mask = p->cq_entries - 1;
3634 rings->sq_ring_entries = p->sq_entries;
3635 rings->cq_ring_entries = p->cq_entries;
3637 if (p->flags & IORING_SETUP_SQE128)
3638 size = array_size(2 * sizeof(struct io_uring_sqe), p->sq_entries);
3640 size = array_size(sizeof(struct io_uring_sqe), p->sq_entries);
3641 if (size == SIZE_MAX) {
3642 io_mem_free(ctx->rings);
3647 ctx->sq_sqes = io_mem_alloc(size);
3648 if (!ctx->sq_sqes) {
3649 io_mem_free(ctx->rings);
3657 static int io_uring_install_fd(struct io_ring_ctx *ctx, struct file *file)
3661 fd = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
3665 ret = __io_uring_add_tctx_node(ctx);
3670 fd_install(fd, file);
3675 * Allocate an anonymous fd, this is what constitutes the application
3676 * visible backing of an io_uring instance. The application mmaps this
3677 * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled,
3678 * we have to tie this fd to a socket for file garbage collection purposes.
3680 static struct file *io_uring_get_file(struct io_ring_ctx *ctx)
3683 #if defined(CONFIG_UNIX)
3686 ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP,
3689 return ERR_PTR(ret);
3692 file = anon_inode_getfile_secure("[io_uring]", &io_uring_fops, ctx,
3693 O_RDWR | O_CLOEXEC, NULL);
3694 #if defined(CONFIG_UNIX)
3696 sock_release(ctx->ring_sock);
3697 ctx->ring_sock = NULL;
3699 ctx->ring_sock->file = file;
3705 static __cold int io_uring_create(unsigned entries, struct io_uring_params *p,
3706 struct io_uring_params __user *params)
3708 struct io_ring_ctx *ctx;
3714 if (entries > IORING_MAX_ENTRIES) {
3715 if (!(p->flags & IORING_SETUP_CLAMP))
3717 entries = IORING_MAX_ENTRIES;
3721 * Use twice as many entries for the CQ ring. It's possible for the
3722 * application to drive a higher depth than the size of the SQ ring,
3723 * since the sqes are only used at submission time. This allows for
3724 * some flexibility in overcommitting a bit. If the application has
3725 * set IORING_SETUP_CQSIZE, it will have passed in the desired number
3726 * of CQ ring entries manually.
3728 p->sq_entries = roundup_pow_of_two(entries);
3729 if (p->flags & IORING_SETUP_CQSIZE) {
3731 * If IORING_SETUP_CQSIZE is set, we do the same roundup
3732 * to a power-of-two, if it isn't already. We do NOT impose
3733 * any cq vs sq ring sizing.
3737 if (p->cq_entries > IORING_MAX_CQ_ENTRIES) {
3738 if (!(p->flags & IORING_SETUP_CLAMP))
3740 p->cq_entries = IORING_MAX_CQ_ENTRIES;
3742 p->cq_entries = roundup_pow_of_two(p->cq_entries);
3743 if (p->cq_entries < p->sq_entries)
3746 p->cq_entries = 2 * p->sq_entries;
3749 ctx = io_ring_ctx_alloc(p);
3753 if ((ctx->flags & IORING_SETUP_DEFER_TASKRUN) &&
3754 !(ctx->flags & IORING_SETUP_IOPOLL) &&
3755 !(ctx->flags & IORING_SETUP_SQPOLL))
3756 ctx->task_complete = true;
3759 * lazy poll_wq activation relies on ->task_complete for synchronisation
3760 * purposes, see io_activate_pollwq()
3762 if (!ctx->task_complete)
3763 ctx->poll_activated = true;
3766 * When SETUP_IOPOLL and SETUP_SQPOLL are both enabled, user
3767 * space applications don't need to do io completion events
3768 * polling again, they can rely on io_sq_thread to do polling
3769 * work, which can reduce cpu usage and uring_lock contention.
3771 if (ctx->flags & IORING_SETUP_IOPOLL &&
3772 !(ctx->flags & IORING_SETUP_SQPOLL))
3773 ctx->syscall_iopoll = 1;
3775 ctx->compat = in_compat_syscall();
3776 if (!capable(CAP_IPC_LOCK))
3777 ctx->user = get_uid(current_user());
3780 * For SQPOLL, we just need a wakeup, always. For !SQPOLL, if
3781 * COOP_TASKRUN is set, then IPIs are never needed by the app.
3784 if (ctx->flags & IORING_SETUP_SQPOLL) {
3785 /* IPI related flags don't make sense with SQPOLL */
3786 if (ctx->flags & (IORING_SETUP_COOP_TASKRUN |
3787 IORING_SETUP_TASKRUN_FLAG |
3788 IORING_SETUP_DEFER_TASKRUN))
3790 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3791 } else if (ctx->flags & IORING_SETUP_COOP_TASKRUN) {
3792 ctx->notify_method = TWA_SIGNAL_NO_IPI;
3794 if (ctx->flags & IORING_SETUP_TASKRUN_FLAG &&
3795 !(ctx->flags & IORING_SETUP_DEFER_TASKRUN))
3797 ctx->notify_method = TWA_SIGNAL;
3801 * For DEFER_TASKRUN we require the completion task to be the same as the
3802 * submission task. This implies that there is only one submitter, so enforce
3805 if (ctx->flags & IORING_SETUP_DEFER_TASKRUN &&
3806 !(ctx->flags & IORING_SETUP_SINGLE_ISSUER)) {
3811 * This is just grabbed for accounting purposes. When a process exits,
3812 * the mm is exited and dropped before the files, hence we need to hang
3813 * on to this mm purely for the purposes of being able to unaccount
3814 * memory (locked/pinned vm). It's not used for anything else.
3816 mmgrab(current->mm);
3817 ctx->mm_account = current->mm;
3819 ret = io_allocate_scq_urings(ctx, p);
3823 ret = io_sq_offload_create(ctx, p);
3826 /* always set a rsrc node */
3827 ret = io_rsrc_node_switch_start(ctx);
3830 io_rsrc_node_switch(ctx, NULL);
3832 memset(&p->sq_off, 0, sizeof(p->sq_off));
3833 p->sq_off.head = offsetof(struct io_rings, sq.head);
3834 p->sq_off.tail = offsetof(struct io_rings, sq.tail);
3835 p->sq_off.ring_mask = offsetof(struct io_rings, sq_ring_mask);
3836 p->sq_off.ring_entries = offsetof(struct io_rings, sq_ring_entries);
3837 p->sq_off.flags = offsetof(struct io_rings, sq_flags);
3838 p->sq_off.dropped = offsetof(struct io_rings, sq_dropped);
3839 p->sq_off.array = (char *)ctx->sq_array - (char *)ctx->rings;
3841 memset(&p->cq_off, 0, sizeof(p->cq_off));
3842 p->cq_off.head = offsetof(struct io_rings, cq.head);
3843 p->cq_off.tail = offsetof(struct io_rings, cq.tail);
3844 p->cq_off.ring_mask = offsetof(struct io_rings, cq_ring_mask);
3845 p->cq_off.ring_entries = offsetof(struct io_rings, cq_ring_entries);
3846 p->cq_off.overflow = offsetof(struct io_rings, cq_overflow);
3847 p->cq_off.cqes = offsetof(struct io_rings, cqes);
3848 p->cq_off.flags = offsetof(struct io_rings, cq_flags);
3850 p->features = IORING_FEAT_SINGLE_MMAP | IORING_FEAT_NODROP |
3851 IORING_FEAT_SUBMIT_STABLE | IORING_FEAT_RW_CUR_POS |
3852 IORING_FEAT_CUR_PERSONALITY | IORING_FEAT_FAST_POLL |
3853 IORING_FEAT_POLL_32BITS | IORING_FEAT_SQPOLL_NONFIXED |
3854 IORING_FEAT_EXT_ARG | IORING_FEAT_NATIVE_WORKERS |
3855 IORING_FEAT_RSRC_TAGS | IORING_FEAT_CQE_SKIP |
3856 IORING_FEAT_LINKED_FILE | IORING_FEAT_REG_REG_RING;
3858 if (copy_to_user(params, p, sizeof(*p))) {
3863 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER
3864 && !(ctx->flags & IORING_SETUP_R_DISABLED))
3865 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
3867 file = io_uring_get_file(ctx);
3869 ret = PTR_ERR(file);
3874 * Install ring fd as the very last thing, so we don't risk someone
3875 * having closed it before we finish setup
3877 ret = io_uring_install_fd(ctx, file);
3879 /* fput will clean it up */
3884 trace_io_uring_create(ret, ctx, p->sq_entries, p->cq_entries, p->flags);
3887 io_ring_ctx_wait_and_kill(ctx);
3892 * Sets up an aio uring context, and returns the fd. Applications asks for a
3893 * ring size, we return the actual sq/cq ring sizes (among other things) in the
3894 * params structure passed in.
3896 static long io_uring_setup(u32 entries, struct io_uring_params __user *params)
3898 struct io_uring_params p;
3901 if (copy_from_user(&p, params, sizeof(p)))
3903 for (i = 0; i < ARRAY_SIZE(p.resv); i++) {
3908 if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL |
3909 IORING_SETUP_SQ_AFF | IORING_SETUP_CQSIZE |
3910 IORING_SETUP_CLAMP | IORING_SETUP_ATTACH_WQ |
3911 IORING_SETUP_R_DISABLED | IORING_SETUP_SUBMIT_ALL |
3912 IORING_SETUP_COOP_TASKRUN | IORING_SETUP_TASKRUN_FLAG |
3913 IORING_SETUP_SQE128 | IORING_SETUP_CQE32 |
3914 IORING_SETUP_SINGLE_ISSUER | IORING_SETUP_DEFER_TASKRUN))
3917 return io_uring_create(entries, &p, params);
3920 SYSCALL_DEFINE2(io_uring_setup, u32, entries,
3921 struct io_uring_params __user *, params)
3923 return io_uring_setup(entries, params);
3926 static __cold int io_probe(struct io_ring_ctx *ctx, void __user *arg,
3929 struct io_uring_probe *p;
3933 size = struct_size(p, ops, nr_args);
3934 if (size == SIZE_MAX)
3936 p = kzalloc(size, GFP_KERNEL);
3941 if (copy_from_user(p, arg, size))
3944 if (memchr_inv(p, 0, size))
3947 p->last_op = IORING_OP_LAST - 1;
3948 if (nr_args > IORING_OP_LAST)
3949 nr_args = IORING_OP_LAST;
3951 for (i = 0; i < nr_args; i++) {
3953 if (!io_issue_defs[i].not_supported)
3954 p->ops[i].flags = IO_URING_OP_SUPPORTED;
3959 if (copy_to_user(arg, p, size))
3966 static int io_register_personality(struct io_ring_ctx *ctx)
3968 const struct cred *creds;
3972 creds = get_current_cred();
3974 ret = xa_alloc_cyclic(&ctx->personalities, &id, (void *)creds,
3975 XA_LIMIT(0, USHRT_MAX), &ctx->pers_next, GFP_KERNEL);
3983 static __cold int io_register_restrictions(struct io_ring_ctx *ctx,
3984 void __user *arg, unsigned int nr_args)
3986 struct io_uring_restriction *res;
3990 /* Restrictions allowed only if rings started disabled */
3991 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
3994 /* We allow only a single restrictions registration */
3995 if (ctx->restrictions.registered)
3998 if (!arg || nr_args > IORING_MAX_RESTRICTIONS)
4001 size = array_size(nr_args, sizeof(*res));
4002 if (size == SIZE_MAX)
4005 res = memdup_user(arg, size);
4007 return PTR_ERR(res);
4011 for (i = 0; i < nr_args; i++) {
4012 switch (res[i].opcode) {
4013 case IORING_RESTRICTION_REGISTER_OP:
4014 if (res[i].register_op >= IORING_REGISTER_LAST) {
4019 __set_bit(res[i].register_op,
4020 ctx->restrictions.register_op);
4022 case IORING_RESTRICTION_SQE_OP:
4023 if (res[i].sqe_op >= IORING_OP_LAST) {
4028 __set_bit(res[i].sqe_op, ctx->restrictions.sqe_op);
4030 case IORING_RESTRICTION_SQE_FLAGS_ALLOWED:
4031 ctx->restrictions.sqe_flags_allowed = res[i].sqe_flags;
4033 case IORING_RESTRICTION_SQE_FLAGS_REQUIRED:
4034 ctx->restrictions.sqe_flags_required = res[i].sqe_flags;
4043 /* Reset all restrictions if an error happened */
4045 memset(&ctx->restrictions, 0, sizeof(ctx->restrictions));
4047 ctx->restrictions.registered = true;
4053 static int io_register_enable_rings(struct io_ring_ctx *ctx)
4055 if (!(ctx->flags & IORING_SETUP_R_DISABLED))
4058 if (ctx->flags & IORING_SETUP_SINGLE_ISSUER && !ctx->submitter_task) {
4059 WRITE_ONCE(ctx->submitter_task, get_task_struct(current));
4061 * Lazy activation attempts would fail if it was polled before
4062 * submitter_task is set.
4064 if (wq_has_sleeper(&ctx->poll_wq))
4065 io_activate_pollwq(ctx);
4068 if (ctx->restrictions.registered)
4069 ctx->restricted = 1;
4071 ctx->flags &= ~IORING_SETUP_R_DISABLED;
4072 if (ctx->sq_data && wq_has_sleeper(&ctx->sq_data->wait))
4073 wake_up(&ctx->sq_data->wait);
4077 static __cold int io_register_iowq_aff(struct io_ring_ctx *ctx,
4078 void __user *arg, unsigned len)
4080 struct io_uring_task *tctx = current->io_uring;
4081 cpumask_var_t new_mask;
4084 if (!tctx || !tctx->io_wq)
4087 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4090 cpumask_clear(new_mask);
4091 if (len > cpumask_size())
4092 len = cpumask_size();
4094 if (in_compat_syscall()) {
4095 ret = compat_get_bitmap(cpumask_bits(new_mask),
4096 (const compat_ulong_t __user *)arg,
4097 len * 8 /* CHAR_BIT */);
4099 ret = copy_from_user(new_mask, arg, len);
4103 free_cpumask_var(new_mask);
4107 ret = io_wq_cpu_affinity(tctx->io_wq, new_mask);
4108 free_cpumask_var(new_mask);
4112 static __cold int io_unregister_iowq_aff(struct io_ring_ctx *ctx)
4114 struct io_uring_task *tctx = current->io_uring;
4116 if (!tctx || !tctx->io_wq)
4119 return io_wq_cpu_affinity(tctx->io_wq, NULL);
4122 static __cold int io_register_iowq_max_workers(struct io_ring_ctx *ctx,
4124 __must_hold(&ctx->uring_lock)
4126 struct io_tctx_node *node;
4127 struct io_uring_task *tctx = NULL;
4128 struct io_sq_data *sqd = NULL;
4132 if (copy_from_user(new_count, arg, sizeof(new_count)))
4134 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4135 if (new_count[i] > INT_MAX)
4138 if (ctx->flags & IORING_SETUP_SQPOLL) {
4142 * Observe the correct sqd->lock -> ctx->uring_lock
4143 * ordering. Fine to drop uring_lock here, we hold
4146 refcount_inc(&sqd->refs);
4147 mutex_unlock(&ctx->uring_lock);
4148 mutex_lock(&sqd->lock);
4149 mutex_lock(&ctx->uring_lock);
4151 tctx = sqd->thread->io_uring;
4154 tctx = current->io_uring;
4157 BUILD_BUG_ON(sizeof(new_count) != sizeof(ctx->iowq_limits));
4159 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4161 ctx->iowq_limits[i] = new_count[i];
4162 ctx->iowq_limits_set = true;
4164 if (tctx && tctx->io_wq) {
4165 ret = io_wq_max_workers(tctx->io_wq, new_count);
4169 memset(new_count, 0, sizeof(new_count));
4173 mutex_unlock(&sqd->lock);
4174 io_put_sq_data(sqd);
4177 if (copy_to_user(arg, new_count, sizeof(new_count)))
4180 /* that's it for SQPOLL, only the SQPOLL task creates requests */
4184 /* now propagate the restriction to all registered users */
4185 list_for_each_entry(node, &ctx->tctx_list, ctx_node) {
4186 struct io_uring_task *tctx = node->task->io_uring;
4188 if (WARN_ON_ONCE(!tctx->io_wq))
4191 for (i = 0; i < ARRAY_SIZE(new_count); i++)
4192 new_count[i] = ctx->iowq_limits[i];
4193 /* ignore errors, it always returns zero anyway */
4194 (void)io_wq_max_workers(tctx->io_wq, new_count);
4199 mutex_unlock(&sqd->lock);
4200 io_put_sq_data(sqd);
4205 static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode,
4206 void __user *arg, unsigned nr_args)
4207 __releases(ctx->uring_lock)
4208 __acquires(ctx->uring_lock)
4213 * We don't quiesce the refs for register anymore and so it can't be
4214 * dying as we're holding a file ref here.
4216 if (WARN_ON_ONCE(percpu_ref_is_dying(&ctx->refs)))
4219 if (ctx->submitter_task && ctx->submitter_task != current)
4222 if (ctx->restricted) {
4223 opcode = array_index_nospec(opcode, IORING_REGISTER_LAST);
4224 if (!test_bit(opcode, ctx->restrictions.register_op))
4229 case IORING_REGISTER_BUFFERS:
4233 ret = io_sqe_buffers_register(ctx, arg, nr_args, NULL);
4235 case IORING_UNREGISTER_BUFFERS:
4239 ret = io_sqe_buffers_unregister(ctx);
4241 case IORING_REGISTER_FILES:
4245 ret = io_sqe_files_register(ctx, arg, nr_args, NULL);
4247 case IORING_UNREGISTER_FILES:
4251 ret = io_sqe_files_unregister(ctx);
4253 case IORING_REGISTER_FILES_UPDATE:
4254 ret = io_register_files_update(ctx, arg, nr_args);
4256 case IORING_REGISTER_EVENTFD:
4260 ret = io_eventfd_register(ctx, arg, 0);
4262 case IORING_REGISTER_EVENTFD_ASYNC:
4266 ret = io_eventfd_register(ctx, arg, 1);
4268 case IORING_UNREGISTER_EVENTFD:
4272 ret = io_eventfd_unregister(ctx);
4274 case IORING_REGISTER_PROBE:
4276 if (!arg || nr_args > 256)
4278 ret = io_probe(ctx, arg, nr_args);
4280 case IORING_REGISTER_PERSONALITY:
4284 ret = io_register_personality(ctx);
4286 case IORING_UNREGISTER_PERSONALITY:
4290 ret = io_unregister_personality(ctx, nr_args);
4292 case IORING_REGISTER_ENABLE_RINGS:
4296 ret = io_register_enable_rings(ctx);
4298 case IORING_REGISTER_RESTRICTIONS:
4299 ret = io_register_restrictions(ctx, arg, nr_args);
4301 case IORING_REGISTER_FILES2:
4302 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_FILE);
4304 case IORING_REGISTER_FILES_UPDATE2:
4305 ret = io_register_rsrc_update(ctx, arg, nr_args,
4308 case IORING_REGISTER_BUFFERS2:
4309 ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_BUFFER);
4311 case IORING_REGISTER_BUFFERS_UPDATE:
4312 ret = io_register_rsrc_update(ctx, arg, nr_args,
4313 IORING_RSRC_BUFFER);
4315 case IORING_REGISTER_IOWQ_AFF:
4317 if (!arg || !nr_args)
4319 ret = io_register_iowq_aff(ctx, arg, nr_args);
4321 case IORING_UNREGISTER_IOWQ_AFF:
4325 ret = io_unregister_iowq_aff(ctx);
4327 case IORING_REGISTER_IOWQ_MAX_WORKERS:
4329 if (!arg || nr_args != 2)
4331 ret = io_register_iowq_max_workers(ctx, arg);
4333 case IORING_REGISTER_RING_FDS:
4334 ret = io_ringfd_register(ctx, arg, nr_args);
4336 case IORING_UNREGISTER_RING_FDS:
4337 ret = io_ringfd_unregister(ctx, arg, nr_args);
4339 case IORING_REGISTER_PBUF_RING:
4341 if (!arg || nr_args != 1)
4343 ret = io_register_pbuf_ring(ctx, arg);
4345 case IORING_UNREGISTER_PBUF_RING:
4347 if (!arg || nr_args != 1)
4349 ret = io_unregister_pbuf_ring(ctx, arg);
4351 case IORING_REGISTER_SYNC_CANCEL:
4353 if (!arg || nr_args != 1)
4355 ret = io_sync_cancel(ctx, arg);
4357 case IORING_REGISTER_FILE_ALLOC_RANGE:
4359 if (!arg || nr_args)
4361 ret = io_register_file_alloc_range(ctx, arg);
4371 SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode,
4372 void __user *, arg, unsigned int, nr_args)
4374 struct io_ring_ctx *ctx;
4377 bool use_registered_ring;
4379 use_registered_ring = !!(opcode & IORING_REGISTER_USE_REGISTERED_RING);
4380 opcode &= ~IORING_REGISTER_USE_REGISTERED_RING;
4382 if (opcode >= IORING_REGISTER_LAST)
4385 if (use_registered_ring) {
4387 * Ring fd has been registered via IORING_REGISTER_RING_FDS, we
4388 * need only dereference our task private array to find it.
4390 struct io_uring_task *tctx = current->io_uring;
4392 if (unlikely(!tctx || fd >= IO_RINGFD_REG_MAX))
4394 fd = array_index_nospec(fd, IO_RINGFD_REG_MAX);
4395 f.file = tctx->registered_rings[fd];
4397 if (unlikely(!f.file))
4401 if (unlikely(!f.file))
4404 if (!io_is_uring_fops(f.file))
4408 ctx = f.file->private_data;
4410 mutex_lock(&ctx->uring_lock);
4411 ret = __io_uring_register(ctx, opcode, arg, nr_args);
4412 mutex_unlock(&ctx->uring_lock);
4413 trace_io_uring_register(ctx, opcode, ctx->nr_user_files, ctx->nr_user_bufs, ret);
4419 static int __init io_uring_init(void)
4421 #define __BUILD_BUG_VERIFY_OFFSET_SIZE(stype, eoffset, esize, ename) do { \
4422 BUILD_BUG_ON(offsetof(stype, ename) != eoffset); \
4423 BUILD_BUG_ON(sizeof_field(stype, ename) != esize); \
4426 #define BUILD_BUG_SQE_ELEM(eoffset, etype, ename) \
4427 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, sizeof(etype), ename)
4428 #define BUILD_BUG_SQE_ELEM_SIZE(eoffset, esize, ename) \
4429 __BUILD_BUG_VERIFY_OFFSET_SIZE(struct io_uring_sqe, eoffset, esize, ename)
4430 BUILD_BUG_ON(sizeof(struct io_uring_sqe) != 64);
4431 BUILD_BUG_SQE_ELEM(0, __u8, opcode);
4432 BUILD_BUG_SQE_ELEM(1, __u8, flags);
4433 BUILD_BUG_SQE_ELEM(2, __u16, ioprio);
4434 BUILD_BUG_SQE_ELEM(4, __s32, fd);
4435 BUILD_BUG_SQE_ELEM(8, __u64, off);
4436 BUILD_BUG_SQE_ELEM(8, __u64, addr2);
4437 BUILD_BUG_SQE_ELEM(8, __u32, cmd_op);
4438 BUILD_BUG_SQE_ELEM(12, __u32, __pad1);
4439 BUILD_BUG_SQE_ELEM(16, __u64, addr);
4440 BUILD_BUG_SQE_ELEM(16, __u64, splice_off_in);
4441 BUILD_BUG_SQE_ELEM(24, __u32, len);
4442 BUILD_BUG_SQE_ELEM(28, __kernel_rwf_t, rw_flags);
4443 BUILD_BUG_SQE_ELEM(28, /* compat */ int, rw_flags);
4444 BUILD_BUG_SQE_ELEM(28, /* compat */ __u32, rw_flags);
4445 BUILD_BUG_SQE_ELEM(28, __u32, fsync_flags);
4446 BUILD_BUG_SQE_ELEM(28, /* compat */ __u16, poll_events);
4447 BUILD_BUG_SQE_ELEM(28, __u32, poll32_events);
4448 BUILD_BUG_SQE_ELEM(28, __u32, sync_range_flags);
4449 BUILD_BUG_SQE_ELEM(28, __u32, msg_flags);
4450 BUILD_BUG_SQE_ELEM(28, __u32, timeout_flags);
4451 BUILD_BUG_SQE_ELEM(28, __u32, accept_flags);
4452 BUILD_BUG_SQE_ELEM(28, __u32, cancel_flags);
4453 BUILD_BUG_SQE_ELEM(28, __u32, open_flags);
4454 BUILD_BUG_SQE_ELEM(28, __u32, statx_flags);
4455 BUILD_BUG_SQE_ELEM(28, __u32, fadvise_advice);
4456 BUILD_BUG_SQE_ELEM(28, __u32, splice_flags);
4457 BUILD_BUG_SQE_ELEM(28, __u32, rename_flags);
4458 BUILD_BUG_SQE_ELEM(28, __u32, unlink_flags);
4459 BUILD_BUG_SQE_ELEM(28, __u32, hardlink_flags);
4460 BUILD_BUG_SQE_ELEM(28, __u32, xattr_flags);
4461 BUILD_BUG_SQE_ELEM(28, __u32, msg_ring_flags);
4462 BUILD_BUG_SQE_ELEM(32, __u64, user_data);
4463 BUILD_BUG_SQE_ELEM(40, __u16, buf_index);
4464 BUILD_BUG_SQE_ELEM(40, __u16, buf_group);
4465 BUILD_BUG_SQE_ELEM(42, __u16, personality);
4466 BUILD_BUG_SQE_ELEM(44, __s32, splice_fd_in);
4467 BUILD_BUG_SQE_ELEM(44, __u32, file_index);
4468 BUILD_BUG_SQE_ELEM(44, __u16, addr_len);
4469 BUILD_BUG_SQE_ELEM(46, __u16, __pad3[0]);
4470 BUILD_BUG_SQE_ELEM(48, __u64, addr3);
4471 BUILD_BUG_SQE_ELEM_SIZE(48, 0, cmd);
4472 BUILD_BUG_SQE_ELEM(56, __u64, __pad2);
4474 BUILD_BUG_ON(sizeof(struct io_uring_files_update) !=
4475 sizeof(struct io_uring_rsrc_update));
4476 BUILD_BUG_ON(sizeof(struct io_uring_rsrc_update) >
4477 sizeof(struct io_uring_rsrc_update2));
4479 /* ->buf_index is u16 */
4480 BUILD_BUG_ON(offsetof(struct io_uring_buf_ring, bufs) != 0);
4481 BUILD_BUG_ON(offsetof(struct io_uring_buf, resv) !=
4482 offsetof(struct io_uring_buf_ring, tail));
4484 /* should fit into one byte */
4485 BUILD_BUG_ON(SQE_VALID_FLAGS >= (1 << 8));
4486 BUILD_BUG_ON(SQE_COMMON_FLAGS >= (1 << 8));
4487 BUILD_BUG_ON((SQE_VALID_FLAGS | SQE_COMMON_FLAGS) != SQE_VALID_FLAGS);
4489 BUILD_BUG_ON(__REQ_F_LAST_BIT > 8 * sizeof(int));
4491 BUILD_BUG_ON(sizeof(atomic_t) != sizeof(u32));
4493 io_uring_optable_init();
4495 req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC |
4499 __initcall(io_uring_init);