Commit | Line | Data |
---|---|---|
2b188cc1 JA |
1 | // SPDX-License-Identifier: GPL-2.0 |
2 | /* | |
3 | * Shared application/kernel submission and completion ring pairs, for | |
4 | * supporting fast/efficient IO. | |
5 | * | |
6 | * A note on the read/write ordering memory barriers that are matched between | |
1e84b97b SB |
7 | * the application and kernel side. |
8 | * | |
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 | |
d068b506 | 14 | * through a control-dependency in io_get_cqe (smp_store_release to |
1e84b97b SB |
15 | * store head will do). Failure to do so could lead to reading invalid |
16 | * CQ entries. | |
17 | * | |
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 | |
23 | * head will do). | |
24 | * | |
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 | |
28 | * between. | |
2b188cc1 JA |
29 | * |
30 | * Also see the examples in the liburing library: | |
31 | * | |
32 | * git://git.kernel.dk/liburing | |
33 | * | |
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. | |
38 | * | |
39 | * Copyright (C) 2018-2019 Jens Axboe | |
c992fe29 | 40 | * Copyright (c) 2018-2019 Christoph Hellwig |
2b188cc1 JA |
41 | */ |
42 | #include <linux/kernel.h> | |
43 | #include <linux/init.h> | |
44 | #include <linux/errno.h> | |
45 | #include <linux/syscalls.h> | |
52de1fe1 | 46 | #include <net/compat.h> |
2b188cc1 JA |
47 | #include <linux/refcount.h> |
48 | #include <linux/uio.h> | |
6b47ee6e | 49 | #include <linux/bits.h> |
2b188cc1 JA |
50 | |
51 | #include <linux/sched/signal.h> | |
52 | #include <linux/fs.h> | |
53 | #include <linux/file.h> | |
54 | #include <linux/fdtable.h> | |
55 | #include <linux/mm.h> | |
56 | #include <linux/mman.h> | |
2b188cc1 JA |
57 | #include <linux/percpu.h> |
58 | #include <linux/slab.h> | |
edafccee | 59 | #include <linux/bvec.h> |
2b188cc1 JA |
60 | #include <linux/net.h> |
61 | #include <net/sock.h> | |
62 | #include <net/af_unix.h> | |
6b06314c | 63 | #include <net/scm.h> |
2b188cc1 JA |
64 | #include <linux/anon_inodes.h> |
65 | #include <linux/sched/mm.h> | |
66 | #include <linux/uaccess.h> | |
67 | #include <linux/nospec.h> | |
aa4c3967 | 68 | #include <linux/highmem.h> |
15b71abe | 69 | #include <linux/fsnotify.h> |
4840e418 | 70 | #include <linux/fadvise.h> |
b41e9852 | 71 | #include <linux/task_work.h> |
0f212204 | 72 | #include <linux/io_uring.h> |
5bd2182d | 73 | #include <linux/audit.h> |
cdc1404a | 74 | #include <linux/security.h> |
2b188cc1 | 75 | |
c826bd7a DD |
76 | #define CREATE_TRACE_POINTS |
77 | #include <trace/events/io_uring.h> | |
78 | ||
2b188cc1 JA |
79 | #include <uapi/linux/io_uring.h> |
80 | ||
561fb04a | 81 | #include "io-wq.h" |
2b188cc1 | 82 | |
de23077e | 83 | #include "io_uring.h" |
329061d3 | 84 | #include "opdef.h" |
e418bbc9 | 85 | #include "refs.h" |
c9f06aa7 | 86 | #include "tctx.h" |
17437f31 | 87 | #include "sqpoll.h" |
a4ad4f74 | 88 | #include "fdinfo.h" |
3b77495a | 89 | #include "kbuf.h" |
73572984 | 90 | #include "rsrc.h" |
38513c46 | 91 | #include "cancel.h" |
e27f928e | 92 | |
59915143 | 93 | #include "timeout.h" |
329061d3 | 94 | #include "poll.h" |
5e2a18d9 | 95 | |
5277deaa | 96 | #define IORING_MAX_ENTRIES 32768 |
33a107f0 | 97 | #define IORING_MAX_CQ_ENTRIES (2 * IORING_MAX_ENTRIES) |
65e19f54 | 98 | |
21b55dbc SG |
99 | #define IORING_MAX_RESTRICTIONS (IORING_RESTRICTION_LAST + \ |
100 | IORING_REGISTER_LAST + IORING_OP_LAST) | |
2b188cc1 | 101 | |
68fe256a PB |
102 | #define SQE_COMMON_FLAGS (IOSQE_FIXED_FILE | IOSQE_IO_LINK | \ |
103 | IOSQE_IO_HARDLINK | IOSQE_ASYNC) | |
104 | ||
5562a8d7 PB |
105 | #define SQE_VALID_FLAGS (SQE_COMMON_FLAGS | IOSQE_BUFFER_SELECT | \ |
106 | IOSQE_IO_DRAIN | IOSQE_CQE_SKIP_SUCCESS) | |
68fe256a | 107 | |
c854357b | 108 | #define IO_REQ_CLEAN_FLAGS (REQ_F_BUFFER_SELECTED | REQ_F_NEED_CLEANUP | \ |
9cae36a0 JA |
109 | REQ_F_POLLED | REQ_F_INFLIGHT | REQ_F_CREDS | \ |
110 | REQ_F_ASYNC_DATA) | |
b16fed66 | 111 | |
a538be5b PB |
112 | #define IO_REQ_CLEAN_SLOW_FLAGS (REQ_F_REFCOUNT | REQ_F_LINK | REQ_F_HARDLINK |\ |
113 | IO_REQ_CLEAN_FLAGS) | |
114 | ||
09899b19 PB |
115 | #define IO_TCTX_REFS_CACHE_NR (1U << 10) |
116 | ||
6dd0be1e | 117 | #define IO_COMPL_BATCH 32 |
bf019da7 | 118 | #define IO_REQ_ALLOC_BATCH 8 |
258b29a9 | 119 | |
10988a0a DY |
120 | enum { |
121 | IO_CHECK_CQ_OVERFLOW_BIT, | |
155bc950 | 122 | IO_CHECK_CQ_DROPPED_BIT, |
10988a0a DY |
123 | }; |
124 | ||
27dc8338 PB |
125 | struct io_defer_entry { |
126 | struct list_head list; | |
127 | struct io_kiocb *req; | |
9cf7c104 | 128 | u32 seq; |
2b188cc1 JA |
129 | }; |
130 | ||
0756a869 PB |
131 | /* requests with any of those set should undergo io_disarm_next() */ |
132 | #define IO_DISARM_MASK (REQ_F_ARM_LTIMEOUT | REQ_F_LINK_TIMEOUT | REQ_F_FAIL) | |
da1a08c5 | 133 | #define IO_REQ_LINK_FLAGS (REQ_F_LINK | REQ_F_HARDLINK) |
0756a869 | 134 | |
affa87db | 135 | static bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx, |
9936c7c2 | 136 | struct task_struct *task, |
3dd0c97a | 137 | bool cancel_all); |
1ffc5422 | 138 | |
c7dae4ba | 139 | static void io_dismantle_req(struct io_kiocb *req); |
68fb8979 | 140 | static void io_clean_op(struct io_kiocb *req); |
cbc2e203 | 141 | static void io_queue_sqe(struct io_kiocb *req); |
de0617e4 | 142 | |
c450178d | 143 | static void __io_submit_flush_completions(struct io_ring_ctx *ctx); |
de0617e4 | 144 | |
2b188cc1 JA |
145 | static struct kmem_cache *req_cachep; |
146 | ||
2b188cc1 JA |
147 | struct sock *io_uring_get_socket(struct file *file) |
148 | { | |
149 | #if defined(CONFIG_UNIX) | |
cd40cae2 | 150 | if (io_is_uring_fops(file)) { |
2b188cc1 JA |
151 | struct io_ring_ctx *ctx = file->private_data; |
152 | ||
153 | return ctx->ring_sock->sk; | |
154 | } | |
155 | #endif | |
156 | return NULL; | |
157 | } | |
158 | EXPORT_SYMBOL(io_uring_get_socket); | |
159 | ||
c450178d PB |
160 | static inline void io_submit_flush_completions(struct io_ring_ctx *ctx) |
161 | { | |
6f33b0bc | 162 | if (!wq_list_empty(&ctx->submit_state.compl_reqs)) |
c450178d PB |
163 | __io_submit_flush_completions(ctx); |
164 | } | |
165 | ||
faf88dde PB |
166 | static inline unsigned int __io_cqring_events(struct io_ring_ctx *ctx) |
167 | { | |
168 | return ctx->cached_cq_tail - READ_ONCE(ctx->rings->cq.head); | |
169 | } | |
170 | ||
9cae36a0 JA |
171 | static bool io_match_linked(struct io_kiocb *head) |
172 | { | |
173 | struct io_kiocb *req; | |
174 | ||
175 | io_for_each_link(req, head) { | |
176 | if (req->flags & REQ_F_INFLIGHT) | |
177 | return true; | |
178 | } | |
179 | return false; | |
6af3f48b PB |
180 | } |
181 | ||
182 | /* | |
183 | * As io_match_task() but protected against racing with linked timeouts. | |
184 | * User must not hold timeout_lock. | |
185 | */ | |
329061d3 JA |
186 | bool io_match_task_safe(struct io_kiocb *head, struct task_struct *task, |
187 | bool cancel_all) | |
6af3f48b | 188 | { |
9cae36a0 JA |
189 | bool matched; |
190 | ||
6af3f48b PB |
191 | if (task && head->task != task) |
192 | return false; | |
9cae36a0 JA |
193 | if (cancel_all) |
194 | return true; | |
195 | ||
196 | if (head->flags & REQ_F_LINK_TIMEOUT) { | |
197 | struct io_ring_ctx *ctx = head->ctx; | |
198 | ||
199 | /* protect against races with linked timeouts */ | |
200 | spin_lock_irq(&ctx->timeout_lock); | |
201 | matched = io_match_linked(head); | |
202 | spin_unlock_irq(&ctx->timeout_lock); | |
203 | } else { | |
204 | matched = io_match_linked(head); | |
205 | } | |
206 | return matched; | |
6af3f48b PB |
207 | } |
208 | ||
a8295b98 HX |
209 | static inline void req_fail_link_node(struct io_kiocb *req, int res) |
210 | { | |
211 | req_set_fail(req); | |
97b388d7 | 212 | io_req_set_res(req, res, 0); |
a8295b98 HX |
213 | } |
214 | ||
fa05457a PB |
215 | static inline void io_req_add_to_cache(struct io_kiocb *req, struct io_ring_ctx *ctx) |
216 | { | |
217 | wq_stack_add_head(&req->comp_list, &ctx->submit_state.free_list); | |
a8295b98 HX |
218 | } |
219 | ||
c072481d | 220 | static __cold void io_ring_ctx_ref_free(struct percpu_ref *ref) |
2b188cc1 JA |
221 | { |
222 | struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs); | |
223 | ||
0f158b4c | 224 | complete(&ctx->ref_comp); |
2b188cc1 JA |
225 | } |
226 | ||
c072481d | 227 | static __cold void io_fallback_req_func(struct work_struct *work) |
f56165e6 PB |
228 | { |
229 | struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, | |
230 | fallback_work.work); | |
231 | struct llist_node *node = llist_del_all(&ctx->fallback_llist); | |
232 | struct io_kiocb *req, *tmp; | |
f237c30a | 233 | bool locked = false; |
f56165e6 PB |
234 | |
235 | percpu_ref_get(&ctx->refs); | |
3218e5d3 | 236 | llist_for_each_entry_safe(req, tmp, node, io_task_work.node) |
f237c30a | 237 | req->io_task_work.func(req, &locked); |
5636c00d | 238 | |
f237c30a | 239 | if (locked) { |
c450178d | 240 | io_submit_flush_completions(ctx); |
f237c30a PB |
241 | mutex_unlock(&ctx->uring_lock); |
242 | } | |
f56165e6 PB |
243 | percpu_ref_put(&ctx->refs); |
244 | } | |
245 | ||
e6f89be6 PB |
246 | static int io_alloc_hash_table(struct io_hash_table *table, unsigned bits) |
247 | { | |
248 | unsigned hash_buckets = 1U << bits; | |
249 | size_t hash_size = hash_buckets * sizeof(table->hbs[0]); | |
250 | ||
251 | table->hbs = kmalloc(hash_size, GFP_KERNEL); | |
252 | if (!table->hbs) | |
253 | return -ENOMEM; | |
254 | ||
255 | table->hash_bits = bits; | |
256 | init_hash_table(table, hash_buckets); | |
257 | return 0; | |
258 | } | |
259 | ||
c072481d | 260 | static __cold struct io_ring_ctx *io_ring_ctx_alloc(struct io_uring_params *p) |
2b188cc1 JA |
261 | { |
262 | struct io_ring_ctx *ctx; | |
9cfc7e94 | 263 | int hash_bits; |
2b188cc1 JA |
264 | |
265 | ctx = kzalloc(sizeof(*ctx), GFP_KERNEL); | |
266 | if (!ctx) | |
267 | return NULL; | |
268 | ||
9cfc7e94 JA |
269 | xa_init(&ctx->io_bl_xa); |
270 | ||
78076bb6 JA |
271 | /* |
272 | * Use 5 bits less than the max cq entries, that should give us around | |
4a07723f PB |
273 | * 32 entries per hash list if totally full and uniformly spread, but |
274 | * don't keep too many buckets to not overconsume memory. | |
78076bb6 | 275 | */ |
4a07723f PB |
276 | hash_bits = ilog2(p->cq_entries) - 5; |
277 | hash_bits = clamp(hash_bits, 1, 8); | |
e6f89be6 | 278 | if (io_alloc_hash_table(&ctx->cancel_table, hash_bits)) |
78076bb6 | 279 | goto err; |
9ca9fb24 PB |
280 | if (io_alloc_hash_table(&ctx->cancel_table_locked, hash_bits)) |
281 | goto err; | |
38513c46 | 282 | |
6224843d PB |
283 | ctx->dummy_ubuf = kzalloc(sizeof(*ctx->dummy_ubuf), GFP_KERNEL); |
284 | if (!ctx->dummy_ubuf) | |
285 | goto err; | |
286 | /* set invalid range, so io_import_fixed() fails meeting it */ | |
287 | ctx->dummy_ubuf->ubuf = -1UL; | |
288 | ||
21482896 | 289 | if (percpu_ref_init(&ctx->refs, io_ring_ctx_ref_free, |
206aefde JA |
290 | PERCPU_REF_ALLOW_REINIT, GFP_KERNEL)) |
291 | goto err; | |
2b188cc1 JA |
292 | |
293 | ctx->flags = p->flags; | |
90554200 | 294 | init_waitqueue_head(&ctx->sqo_sq_wait); |
69fb2131 | 295 | INIT_LIST_HEAD(&ctx->sqd_list); |
1d7bb1d5 | 296 | INIT_LIST_HEAD(&ctx->cq_overflow_list); |
cc3cec83 | 297 | INIT_LIST_HEAD(&ctx->io_buffers_cache); |
4d9237e3 | 298 | INIT_LIST_HEAD(&ctx->apoll_cache); |
0f158b4c | 299 | init_completion(&ctx->ref_comp); |
61cf9370 | 300 | xa_init_flags(&ctx->personalities, XA_FLAGS_ALLOC1); |
2b188cc1 | 301 | mutex_init(&ctx->uring_lock); |
311997b3 | 302 | init_waitqueue_head(&ctx->cq_wait); |
2b188cc1 | 303 | spin_lock_init(&ctx->completion_lock); |
89850fce | 304 | spin_lock_init(&ctx->timeout_lock); |
5eef4e87 | 305 | INIT_WQ_LIST(&ctx->iopoll_list); |
cc3cec83 JA |
306 | INIT_LIST_HEAD(&ctx->io_buffers_pages); |
307 | INIT_LIST_HEAD(&ctx->io_buffers_comp); | |
de0617e4 | 308 | INIT_LIST_HEAD(&ctx->defer_list); |
5262f567 | 309 | INIT_LIST_HEAD(&ctx->timeout_list); |
ef9dd637 | 310 | INIT_LIST_HEAD(&ctx->ltimeout_list); |
d67d2263 BM |
311 | spin_lock_init(&ctx->rsrc_ref_lock); |
312 | INIT_LIST_HEAD(&ctx->rsrc_ref_list); | |
269bbe5f BM |
313 | INIT_DELAYED_WORK(&ctx->rsrc_put_work, io_rsrc_put_work); |
314 | init_llist_head(&ctx->rsrc_put_llist); | |
13bf43f5 | 315 | INIT_LIST_HEAD(&ctx->tctx_list); |
c2b6c6bc PB |
316 | ctx->submit_state.free_list.next = NULL; |
317 | INIT_WQ_LIST(&ctx->locked_free_list); | |
9011bf9a | 318 | INIT_DELAYED_WORK(&ctx->fallback_work, io_fallback_req_func); |
6f33b0bc | 319 | INIT_WQ_LIST(&ctx->submit_state.compl_reqs); |
2b188cc1 | 320 | return ctx; |
206aefde | 321 | err: |
6224843d | 322 | kfree(ctx->dummy_ubuf); |
e6f89be6 | 323 | kfree(ctx->cancel_table.hbs); |
9ca9fb24 | 324 | kfree(ctx->cancel_table_locked.hbs); |
9cfc7e94 JA |
325 | kfree(ctx->io_bl); |
326 | xa_destroy(&ctx->io_bl_xa); | |
206aefde JA |
327 | kfree(ctx); |
328 | return NULL; | |
2b188cc1 JA |
329 | } |
330 | ||
8f6ed49a PB |
331 | static void io_account_cq_overflow(struct io_ring_ctx *ctx) |
332 | { | |
333 | struct io_rings *r = ctx->rings; | |
334 | ||
335 | WRITE_ONCE(r->cq_overflow, READ_ONCE(r->cq_overflow) + 1); | |
336 | ctx->cq_extra--; | |
337 | } | |
338 | ||
9cf7c104 | 339 | static bool req_need_defer(struct io_kiocb *req, u32 seq) |
7adf4eaf | 340 | { |
2bc9930e JA |
341 | if (unlikely(req->flags & REQ_F_IO_DRAIN)) { |
342 | struct io_ring_ctx *ctx = req->ctx; | |
a197f664 | 343 | |
8f6ed49a | 344 | return seq + READ_ONCE(ctx->cq_extra) != ctx->cached_cq_tail; |
2bc9930e | 345 | } |
de0617e4 | 346 | |
9d858b21 | 347 | return false; |
de0617e4 JA |
348 | } |
349 | ||
9cae36a0 JA |
350 | static inline void io_req_track_inflight(struct io_kiocb *req) |
351 | { | |
352 | if (!(req->flags & REQ_F_INFLIGHT)) { | |
353 | req->flags |= REQ_F_INFLIGHT; | |
386e4fb6 | 354 | atomic_inc(&req->task->io_uring->inflight_tracked); |
9cae36a0 JA |
355 | } |
356 | } | |
357 | ||
fd08e530 PB |
358 | static struct io_kiocb *__io_prep_linked_timeout(struct io_kiocb *req) |
359 | { | |
906c6caa PB |
360 | if (WARN_ON_ONCE(!req->link)) |
361 | return NULL; | |
362 | ||
4d13d1a4 PB |
363 | req->flags &= ~REQ_F_ARM_LTIMEOUT; |
364 | req->flags |= REQ_F_LINK_TIMEOUT; | |
fd08e530 PB |
365 | |
366 | /* linked timeouts should have two refs once prep'ed */ | |
48dcd38d | 367 | io_req_set_refcount(req); |
4d13d1a4 PB |
368 | __io_req_set_refcount(req->link, 2); |
369 | return req->link; | |
fd08e530 PB |
370 | } |
371 | ||
372 | static inline struct io_kiocb *io_prep_linked_timeout(struct io_kiocb *req) | |
373 | { | |
4d13d1a4 | 374 | if (likely(!(req->flags & REQ_F_ARM_LTIMEOUT))) |
fd08e530 PB |
375 | return NULL; |
376 | return __io_prep_linked_timeout(req); | |
377 | } | |
378 | ||
cb2d344c PB |
379 | static noinline void __io_arm_ltimeout(struct io_kiocb *req) |
380 | { | |
381 | io_queue_linked_timeout(__io_prep_linked_timeout(req)); | |
382 | } | |
383 | ||
384 | static inline void io_arm_ltimeout(struct io_kiocb *req) | |
385 | { | |
386 | if (unlikely(req->flags & REQ_F_ARM_LTIMEOUT)) | |
387 | __io_arm_ltimeout(req); | |
388 | } | |
389 | ||
1e6fa521 JA |
390 | static void io_prep_async_work(struct io_kiocb *req) |
391 | { | |
392 | const struct io_op_def *def = &io_op_defs[req->opcode]; | |
1e6fa521 JA |
393 | struct io_ring_ctx *ctx = req->ctx; |
394 | ||
b8e64b53 PB |
395 | if (!(req->flags & REQ_F_CREDS)) { |
396 | req->flags |= REQ_F_CREDS; | |
c10d1f98 | 397 | req->creds = get_current_cred(); |
b8e64b53 | 398 | } |
003e8dcc | 399 | |
e1d675df PB |
400 | req->work.list.next = NULL; |
401 | req->work.flags = 0; | |
8e29da69 | 402 | req->work.cancel_seq = atomic_read(&ctx->cancel_seq); |
feaadc4f PB |
403 | if (req->flags & REQ_F_FORCE_ASYNC) |
404 | req->work.flags |= IO_WQ_WORK_CONCURRENT; | |
405 | ||
1e6fa521 JA |
406 | if (req->flags & REQ_F_ISREG) { |
407 | if (def->hash_reg_file || (ctx->flags & IORING_SETUP_IOPOLL)) | |
408 | io_wq_hash_work(&req->work, file_inode(req->file)); | |
4b982bd0 | 409 | } else if (!req->file || !S_ISBLK(file_inode(req->file)->i_mode)) { |
1e6fa521 JA |
410 | if (def->unbound_nonreg_file) |
411 | req->work.flags |= IO_WQ_WORK_UNBOUND; | |
412 | } | |
561fb04a | 413 | } |
cccf0ee8 | 414 | |
cbdcb435 | 415 | static void io_prep_async_link(struct io_kiocb *req) |
561fb04a | 416 | { |
cbdcb435 | 417 | struct io_kiocb *cur; |
54a91f3b | 418 | |
44eff40a PB |
419 | if (req->flags & REQ_F_LINK_TIMEOUT) { |
420 | struct io_ring_ctx *ctx = req->ctx; | |
421 | ||
674ee8e1 | 422 | spin_lock_irq(&ctx->timeout_lock); |
44eff40a PB |
423 | io_for_each_link(cur, req) |
424 | io_prep_async_work(cur); | |
674ee8e1 | 425 | spin_unlock_irq(&ctx->timeout_lock); |
44eff40a PB |
426 | } else { |
427 | io_for_each_link(cur, req) | |
428 | io_prep_async_work(cur); | |
429 | } | |
561fb04a JA |
430 | } |
431 | ||
f3b44f92 | 432 | void io_queue_iowq(struct io_kiocb *req, bool *dont_use) |
561fb04a | 433 | { |
cbdcb435 | 434 | struct io_kiocb *link = io_prep_linked_timeout(req); |
5aa75ed5 | 435 | struct io_uring_task *tctx = req->task->io_uring; |
561fb04a | 436 | |
3bfe6106 JA |
437 | BUG_ON(!tctx); |
438 | BUG_ON(!tctx->io_wq); | |
561fb04a | 439 | |
cbdcb435 PB |
440 | /* init ->work of the whole link before punting */ |
441 | io_prep_async_link(req); | |
991468dc JA |
442 | |
443 | /* | |
444 | * Not expected to happen, but if we do have a bug where this _can_ | |
445 | * happen, catch it here and ensure the request is marked as | |
446 | * canceled. That will make io-wq go through the usual work cancel | |
447 | * procedure rather than attempt to run this request (or create a new | |
448 | * worker for it). | |
449 | */ | |
450 | if (WARN_ON_ONCE(!same_thread_group(req->task, current))) | |
451 | req->work.flags |= IO_WQ_WORK_CANCEL; | |
452 | ||
48863ffd | 453 | trace_io_uring_queue_async_work(req, io_wq_is_hashed(&req->work)); |
ebf93667 | 454 | io_wq_enqueue(tctx->io_wq, &req->work); |
7271ef3a JA |
455 | if (link) |
456 | io_queue_linked_timeout(link); | |
cbdcb435 PB |
457 | } |
458 | ||
c072481d | 459 | static __cold void io_queue_deferred(struct io_ring_ctx *ctx) |
de0617e4 | 460 | { |
441b8a78 | 461 | while (!list_empty(&ctx->defer_list)) { |
27dc8338 PB |
462 | struct io_defer_entry *de = list_first_entry(&ctx->defer_list, |
463 | struct io_defer_entry, list); | |
de0617e4 | 464 | |
9cf7c104 | 465 | if (req_need_defer(de->req, de->seq)) |
04518945 | 466 | break; |
27dc8338 | 467 | list_del_init(&de->list); |
907d1df3 | 468 | io_req_task_queue(de->req); |
27dc8338 | 469 | kfree(de); |
441b8a78 | 470 | } |
04518945 PB |
471 | } |
472 | ||
77bc59b4 | 473 | static void io_eventfd_signal(struct io_ring_ctx *ctx) |
f2842ab5 | 474 | { |
77bc59b4 | 475 | struct io_ev_fd *ev_fd; |
305bef98 PB |
476 | bool skip; |
477 | ||
478 | spin_lock(&ctx->completion_lock); | |
479 | /* | |
480 | * Eventfd should only get triggered when at least one event has been | |
481 | * posted. Some applications rely on the eventfd notification count only | |
482 | * changing IFF a new CQE has been added to the CQ ring. There's no | |
483 | * depedency on 1:1 relationship between how many times this function is | |
484 | * called (and hence the eventfd count) and number of CQEs posted to the | |
485 | * CQ ring. | |
486 | */ | |
487 | skip = ctx->cached_cq_tail == ctx->evfd_last_cq_tail; | |
488 | ctx->evfd_last_cq_tail = ctx->cached_cq_tail; | |
489 | spin_unlock(&ctx->completion_lock); | |
490 | if (skip) | |
491 | return; | |
77bc59b4 | 492 | |
77bc59b4 UA |
493 | rcu_read_lock(); |
494 | /* | |
495 | * rcu_dereference ctx->io_ev_fd once and use it for both for checking | |
496 | * and eventfd_signal | |
497 | */ | |
498 | ev_fd = rcu_dereference(ctx->io_ev_fd); | |
499 | ||
500 | /* | |
501 | * Check again if ev_fd exists incase an io_eventfd_unregister call | |
502 | * completed between the NULL check of ctx->io_ev_fd at the start of | |
503 | * the function and rcu_read_lock. | |
504 | */ | |
505 | if (unlikely(!ev_fd)) | |
506 | goto out; | |
7e55a19c | 507 | if (READ_ONCE(ctx->rings->cq_flags) & IORING_CQ_EVENTFD_DISABLED) |
77bc59b4 UA |
508 | goto out; |
509 | ||
c75312dd | 510 | if (!ev_fd->eventfd_async || io_wq_current_is_worker()) |
77bc59b4 | 511 | eventfd_signal(ev_fd->cq_ev_fd, 1); |
77bc59b4 UA |
512 | out: |
513 | rcu_read_unlock(); | |
f2842ab5 JA |
514 | } |
515 | ||
a830ffd2 PB |
516 | void __io_commit_cqring_flush(struct io_ring_ctx *ctx) |
517 | { | |
518 | if (ctx->off_timeout_used || ctx->drain_active) { | |
519 | spin_lock(&ctx->completion_lock); | |
520 | if (ctx->off_timeout_used) | |
521 | io_flush_timeouts(ctx); | |
522 | if (ctx->drain_active) | |
523 | io_queue_deferred(ctx); | |
524 | spin_unlock(&ctx->completion_lock); | |
525 | } | |
526 | if (ctx->has_evfd) | |
527 | io_eventfd_signal(ctx); | |
528 | } | |
529 | ||
25399321 | 530 | static inline void io_cqring_ev_posted(struct io_ring_ctx *ctx) |
1d7bb1d5 | 531 | { |
46929b08 | 532 | io_commit_cqring_flush(ctx); |
9aa8dfde | 533 | io_cqring_wake(ctx); |
1d7bb1d5 JA |
534 | } |
535 | ||
25399321 PB |
536 | static inline void __io_cq_unlock_post(struct io_ring_ctx *ctx) |
537 | __releases(ctx->completion_lock) | |
538 | { | |
539 | io_commit_cqring(ctx); | |
540 | spin_unlock(&ctx->completion_lock); | |
541 | io_cqring_ev_posted(ctx); | |
542 | } | |
543 | ||
544 | void io_cq_unlock_post(struct io_ring_ctx *ctx) | |
545 | { | |
546 | __io_cq_unlock_post(ctx); | |
547 | } | |
548 | ||
c4a2ed72 | 549 | /* Returns true if there are no backlogged entries after the flush */ |
6c2450ae | 550 | static bool __io_cqring_overflow_flush(struct io_ring_ctx *ctx, bool force) |
1d7bb1d5 | 551 | { |
305bef98 | 552 | bool all_flushed; |
e45a3e05 | 553 | size_t cqe_size = sizeof(struct io_uring_cqe); |
1d7bb1d5 | 554 | |
a566c556 | 555 | if (!force && __io_cqring_events(ctx) == ctx->cq_entries) |
e23de15f | 556 | return false; |
1d7bb1d5 | 557 | |
e45a3e05 SR |
558 | if (ctx->flags & IORING_SETUP_CQE32) |
559 | cqe_size <<= 1; | |
560 | ||
25399321 | 561 | io_cq_lock(ctx); |
6c2450ae | 562 | while (!list_empty(&ctx->cq_overflow_list)) { |
d068b506 | 563 | struct io_uring_cqe *cqe = io_get_cqe(ctx); |
6c2450ae | 564 | struct io_overflow_cqe *ocqe; |
e6c8aa9a | 565 | |
1d7bb1d5 JA |
566 | if (!cqe && !force) |
567 | break; | |
6c2450ae PB |
568 | ocqe = list_first_entry(&ctx->cq_overflow_list, |
569 | struct io_overflow_cqe, list); | |
570 | if (cqe) | |
e45a3e05 | 571 | memcpy(cqe, &ocqe->cqe, cqe_size); |
6c2450ae | 572 | else |
8f6ed49a PB |
573 | io_account_cq_overflow(ctx); |
574 | ||
6c2450ae PB |
575 | list_del(&ocqe->list); |
576 | kfree(ocqe); | |
1d7bb1d5 JA |
577 | } |
578 | ||
09e88404 PB |
579 | all_flushed = list_empty(&ctx->cq_overflow_list); |
580 | if (all_flushed) { | |
10988a0a | 581 | clear_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq); |
3a4b89a2 | 582 | atomic_andnot(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags); |
09e88404 | 583 | } |
46930143 | 584 | |
25399321 | 585 | io_cq_unlock_post(ctx); |
09e88404 | 586 | return all_flushed; |
1d7bb1d5 JA |
587 | } |
588 | ||
90f67366 | 589 | static bool io_cqring_overflow_flush(struct io_ring_ctx *ctx) |
6c503150 | 590 | { |
ca0a2651 JA |
591 | bool ret = true; |
592 | ||
10988a0a | 593 | if (test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) { |
6c503150 PB |
594 | /* iopoll syncs against uring_lock, not completion_lock */ |
595 | if (ctx->flags & IORING_SETUP_IOPOLL) | |
596 | mutex_lock(&ctx->uring_lock); | |
90f67366 | 597 | ret = __io_cqring_overflow_flush(ctx, false); |
6c503150 PB |
598 | if (ctx->flags & IORING_SETUP_IOPOLL) |
599 | mutex_unlock(&ctx->uring_lock); | |
600 | } | |
ca0a2651 JA |
601 | |
602 | return ret; | |
6c503150 PB |
603 | } |
604 | ||
9d170164 | 605 | static void __io_put_task(struct task_struct *task, int nr) |
6a290a14 PB |
606 | { |
607 | struct io_uring_task *tctx = task->io_uring; | |
608 | ||
9d170164 PB |
609 | percpu_counter_sub(&tctx->inflight, nr); |
610 | if (unlikely(atomic_read(&tctx->in_idle))) | |
611 | wake_up(&tctx->wait); | |
612 | put_task_struct_many(task, nr); | |
613 | } | |
614 | ||
615 | /* must to be called somewhat shortly after putting a request */ | |
616 | static inline void io_put_task(struct task_struct *task, int nr) | |
617 | { | |
618 | if (likely(task == current)) | |
619 | task->io_uring->cached_refs += nr; | |
620 | else | |
621 | __io_put_task(task, nr); | |
6a290a14 PB |
622 | } |
623 | ||
9a10867a PB |
624 | static void io_task_refs_refill(struct io_uring_task *tctx) |
625 | { | |
626 | unsigned int refill = -tctx->cached_refs + IO_TCTX_REFS_CACHE_NR; | |
627 | ||
628 | percpu_counter_add(&tctx->inflight, refill); | |
629 | refcount_add(refill, ¤t->usage); | |
630 | tctx->cached_refs += refill; | |
631 | } | |
632 | ||
633 | static inline void io_get_task_refs(int nr) | |
634 | { | |
635 | struct io_uring_task *tctx = current->io_uring; | |
636 | ||
637 | tctx->cached_refs -= nr; | |
638 | if (unlikely(tctx->cached_refs < 0)) | |
639 | io_task_refs_refill(tctx); | |
640 | } | |
641 | ||
3cc7fdb9 PB |
642 | static __cold void io_uring_drop_tctx_refs(struct task_struct *task) |
643 | { | |
644 | struct io_uring_task *tctx = task->io_uring; | |
645 | unsigned int refs = tctx->cached_refs; | |
646 | ||
647 | if (refs) { | |
648 | tctx->cached_refs = 0; | |
649 | percpu_counter_sub(&tctx->inflight, refs); | |
650 | put_task_struct_many(task, refs); | |
651 | } | |
652 | } | |
653 | ||
68494a65 PB |
654 | static bool io_cqring_event_overflow(struct io_ring_ctx *ctx, u64 user_data, |
655 | s32 res, u32 cflags, u64 extra1, u64 extra2) | |
2b188cc1 | 656 | { |
cce4b8b0 | 657 | struct io_overflow_cqe *ocqe; |
e45a3e05 SR |
658 | size_t ocq_size = sizeof(struct io_overflow_cqe); |
659 | bool is_cqe32 = (ctx->flags & IORING_SETUP_CQE32); | |
2b188cc1 | 660 | |
e45a3e05 SR |
661 | if (is_cqe32) |
662 | ocq_size += sizeof(struct io_uring_cqe); | |
2b188cc1 | 663 | |
e45a3e05 | 664 | ocqe = kmalloc(ocq_size, GFP_ATOMIC | __GFP_ACCOUNT); |
08dcd028 | 665 | trace_io_uring_cqe_overflow(ctx, user_data, res, cflags, ocqe); |
cce4b8b0 PB |
666 | if (!ocqe) { |
667 | /* | |
668 | * If we're in ring overflow flush mode, or in task cancel mode, | |
669 | * or cannot allocate an overflow entry, then we need to drop it | |
670 | * on the floor. | |
671 | */ | |
8f6ed49a | 672 | io_account_cq_overflow(ctx); |
155bc950 | 673 | set_bit(IO_CHECK_CQ_DROPPED_BIT, &ctx->check_cq); |
cce4b8b0 | 674 | return false; |
2b188cc1 | 675 | } |
cce4b8b0 | 676 | if (list_empty(&ctx->cq_overflow_list)) { |
10988a0a | 677 | set_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq); |
3a4b89a2 | 678 | atomic_or(IORING_SQ_CQ_OVERFLOW, &ctx->rings->sq_flags); |
20c0b380 | 679 | |
cce4b8b0 | 680 | } |
d4d19c19 | 681 | ocqe->cqe.user_data = user_data; |
cce4b8b0 PB |
682 | ocqe->cqe.res = res; |
683 | ocqe->cqe.flags = cflags; | |
e45a3e05 SR |
684 | if (is_cqe32) { |
685 | ocqe->cqe.big_cqe[0] = extra1; | |
686 | ocqe->cqe.big_cqe[1] = extra2; | |
687 | } | |
cce4b8b0 PB |
688 | list_add_tail(&ocqe->list, &ctx->cq_overflow_list); |
689 | return true; | |
2b188cc1 JA |
690 | } |
691 | ||
68494a65 PB |
692 | bool io_req_cqe_overflow(struct io_kiocb *req) |
693 | { | |
694 | if (!(req->flags & REQ_F_CQE32_INIT)) { | |
695 | req->extra1 = 0; | |
696 | req->extra2 = 0; | |
697 | } | |
698 | return io_cqring_event_overflow(req->ctx, req->cqe.user_data, | |
699 | req->cqe.res, req->cqe.flags, | |
700 | req->extra1, req->extra2); | |
701 | } | |
702 | ||
faf88dde PB |
703 | /* |
704 | * writes to the cq entry need to come after reading head; the | |
705 | * control dependency is enough as we're using WRITE_ONCE to | |
706 | * fill the cq entry | |
707 | */ | |
708 | struct io_uring_cqe *__io_get_cqe(struct io_ring_ctx *ctx) | |
709 | { | |
710 | struct io_rings *rings = ctx->rings; | |
711 | unsigned int off = ctx->cached_cq_tail & (ctx->cq_entries - 1); | |
faf88dde PB |
712 | unsigned int free, queued, len; |
713 | ||
faf88dde PB |
714 | |
715 | /* userspace may cheat modifying the tail, be safe and do min */ | |
716 | queued = min(__io_cqring_events(ctx), ctx->cq_entries); | |
717 | free = ctx->cq_entries - queued; | |
718 | /* we need a contiguous range, limit based on the current array offset */ | |
719 | len = min(free, ctx->cq_entries - off); | |
720 | if (!len) | |
721 | return NULL; | |
722 | ||
b3659a65 PB |
723 | if (ctx->flags & IORING_SETUP_CQE32) { |
724 | off <<= 1; | |
725 | len <<= 1; | |
726 | } | |
727 | ||
faf88dde PB |
728 | ctx->cqe_cached = &rings->cqes[off]; |
729 | ctx->cqe_sentinel = ctx->cqe_cached + len; | |
b3659a65 PB |
730 | |
731 | ctx->cached_cq_tail++; | |
faf88dde | 732 | ctx->cqe_cached++; |
b3659a65 PB |
733 | if (ctx->flags & IORING_SETUP_CQE32) |
734 | ctx->cqe_cached++; | |
735 | return &rings->cqes[off]; | |
faf88dde PB |
736 | } |
737 | ||
d245bca6 PB |
738 | static bool io_fill_cqe_aux(struct io_ring_ctx *ctx, |
739 | u64 user_data, s32 res, u32 cflags) | |
bcda7baa | 740 | { |
cd94903d PB |
741 | struct io_uring_cqe *cqe; |
742 | ||
913a571a | 743 | ctx->cq_extra++; |
c4bb964f | 744 | trace_io_uring_complete(ctx, NULL, user_data, res, cflags, 0, 0); |
cd94903d PB |
745 | |
746 | /* | |
747 | * If we can't get a cq entry, userspace overflowed the | |
748 | * submission (by quite a lot). Increment the overflow count in | |
749 | * the ring. | |
750 | */ | |
751 | cqe = io_get_cqe(ctx); | |
752 | if (likely(cqe)) { | |
753 | WRITE_ONCE(cqe->user_data, user_data); | |
754 | WRITE_ONCE(cqe->res, res); | |
755 | WRITE_ONCE(cqe->flags, cflags); | |
c5595975 PB |
756 | |
757 | if (ctx->flags & IORING_SETUP_CQE32) { | |
758 | WRITE_ONCE(cqe->big_cqe[0], 0); | |
759 | WRITE_ONCE(cqe->big_cqe[1], 0); | |
760 | } | |
cd94903d PB |
761 | return true; |
762 | } | |
763 | return io_cqring_event_overflow(ctx, user_data, res, cflags, 0, 0); | |
bcda7baa JA |
764 | } |
765 | ||
d245bca6 PB |
766 | bool io_post_aux_cqe(struct io_ring_ctx *ctx, |
767 | u64 user_data, s32 res, u32 cflags) | |
768 | { | |
769 | bool filled; | |
770 | ||
25399321 | 771 | io_cq_lock(ctx); |
d245bca6 | 772 | filled = io_fill_cqe_aux(ctx, user_data, res, cflags); |
25399321 | 773 | io_cq_unlock_post(ctx); |
d245bca6 PB |
774 | return filled; |
775 | } | |
776 | ||
effcf8bd | 777 | static void __io_req_complete_put(struct io_kiocb *req) |
2b188cc1 | 778 | { |
c7dae4ba JA |
779 | /* |
780 | * If we're the last reference to this request, add to our locked | |
781 | * free_list cache. | |
782 | */ | |
de9b4cca | 783 | if (req_ref_put_and_test(req)) { |
effcf8bd SR |
784 | struct io_ring_ctx *ctx = req->ctx; |
785 | ||
da1a08c5 | 786 | if (req->flags & IO_REQ_LINK_FLAGS) { |
0756a869 | 787 | if (req->flags & IO_DISARM_MASK) |
7a612350 PB |
788 | io_disarm_next(req); |
789 | if (req->link) { | |
790 | io_req_task_queue(req->link); | |
791 | req->link = NULL; | |
792 | } | |
793 | } | |
7ac1edc4 | 794 | io_req_put_rsrc(req); |
8197b053 PB |
795 | /* |
796 | * Selected buffer deallocation in io_clean_op() assumes that | |
797 | * we don't hold ->completion_lock. Clean them here to avoid | |
798 | * deadlocks. | |
799 | */ | |
800 | io_put_kbuf_comp(req); | |
c7dae4ba JA |
801 | io_dismantle_req(req); |
802 | io_put_task(req->task, 1); | |
c2b6c6bc | 803 | wq_list_add_head(&req->comp_list, &ctx->locked_free_list); |
d0acdee2 | 804 | ctx->locked_free_nr++; |
180f829f | 805 | } |
a37fae8a HX |
806 | } |
807 | ||
59915143 | 808 | void __io_req_complete_post(struct io_kiocb *req) |
effcf8bd | 809 | { |
97b388d7 | 810 | if (!(req->flags & REQ_F_CQE_SKIP)) |
91ef75a7 | 811 | __io_fill_cqe_req(req->ctx, req); |
effcf8bd SR |
812 | __io_req_complete_put(req); |
813 | } | |
814 | ||
59915143 | 815 | void io_req_complete_post(struct io_kiocb *req) |
a37fae8a HX |
816 | { |
817 | struct io_ring_ctx *ctx = req->ctx; | |
818 | ||
25399321 | 819 | io_cq_lock(ctx); |
97b388d7 | 820 | __io_req_complete_post(req); |
25399321 | 821 | io_cq_unlock_post(ctx); |
4e3d9ff9 JA |
822 | } |
823 | ||
99f15d8d | 824 | inline void __io_req_complete(struct io_kiocb *req, unsigned issue_flags) |
bcda7baa | 825 | { |
75d7b3ae | 826 | io_req_complete_post(req); |
0ddf92e8 JA |
827 | } |
828 | ||
329061d3 | 829 | void io_req_complete_failed(struct io_kiocb *req, s32 res) |
f41db273 | 830 | { |
93d2bcd2 | 831 | req_set_fail(req); |
97b388d7 JA |
832 | io_req_set_res(req, res, io_put_kbuf(req, IO_URING_F_UNLOCKED)); |
833 | io_req_complete_post(req); | |
f41db273 PB |
834 | } |
835 | ||
864ea921 PB |
836 | /* |
837 | * Don't initialise the fields below on every allocation, but do that in | |
838 | * advance and keep them valid across allocations. | |
839 | */ | |
840 | static void io_preinit_req(struct io_kiocb *req, struct io_ring_ctx *ctx) | |
841 | { | |
842 | req->ctx = ctx; | |
843 | req->link = NULL; | |
844 | req->async_data = NULL; | |
845 | /* not necessary, but safer to zero */ | |
cef216fc | 846 | req->cqe.res = 0; |
864ea921 PB |
847 | } |
848 | ||
dac7a098 | 849 | static void io_flush_cached_locked_reqs(struct io_ring_ctx *ctx, |
cd0ca2e0 | 850 | struct io_submit_state *state) |
dac7a098 | 851 | { |
79ebeaee | 852 | spin_lock(&ctx->completion_lock); |
c2b6c6bc | 853 | wq_list_splice(&ctx->locked_free_list, &state->free_list); |
d0acdee2 | 854 | ctx->locked_free_nr = 0; |
79ebeaee | 855 | spin_unlock(&ctx->completion_lock); |
dac7a098 PB |
856 | } |
857 | ||
88ab95be | 858 | static inline bool io_req_cache_empty(struct io_ring_ctx *ctx) |
0ddf92e8 | 859 | { |
88ab95be | 860 | return !ctx->submit_state.free_list.next; |
0ddf92e8 JA |
861 | } |
862 | ||
5d5901a3 PB |
863 | /* |
864 | * A request might get retired back into the request caches even before opcode | |
865 | * handlers and io_issue_sqe() are done with it, e.g. inline completion path. | |
866 | * Because of that, io_alloc_req() should be called only under ->uring_lock | |
867 | * and with extra caution to not get a request that is still worked on. | |
868 | */ | |
c072481d | 869 | static __cold bool __io_alloc_req_refill(struct io_ring_ctx *ctx) |
5d5901a3 | 870 | __must_hold(&ctx->uring_lock) |
2b188cc1 | 871 | { |
864ea921 | 872 | gfp_t gfp = GFP_KERNEL | __GFP_NOWARN; |
3ab665b7 | 873 | void *reqs[IO_REQ_ALLOC_BATCH]; |
864ea921 | 874 | int ret, i; |
e5d1bc0a | 875 | |
23a5c43b PB |
876 | /* |
877 | * If we have more than a batch's worth of requests in our IRQ side | |
878 | * locked cache, grab the lock and move them over to our submission | |
879 | * side cache. | |
880 | */ | |
a6d97a8a | 881 | if (data_race(ctx->locked_free_nr) > IO_COMPL_BATCH) { |
23a5c43b | 882 | io_flush_cached_locked_reqs(ctx, &ctx->submit_state); |
88ab95be | 883 | if (!io_req_cache_empty(ctx)) |
23a5c43b PB |
884 | return true; |
885 | } | |
e5d1bc0a | 886 | |
3ab665b7 | 887 | ret = kmem_cache_alloc_bulk(req_cachep, gfp, ARRAY_SIZE(reqs), reqs); |
fd6fab2c | 888 | |
864ea921 PB |
889 | /* |
890 | * Bulk alloc is all-or-nothing. If we fail to get a batch, | |
891 | * retry single alloc to be on the safe side. | |
892 | */ | |
893 | if (unlikely(ret <= 0)) { | |
3ab665b7 PB |
894 | reqs[0] = kmem_cache_alloc(req_cachep, gfp); |
895 | if (!reqs[0]) | |
a33ae9ce | 896 | return false; |
864ea921 | 897 | ret = 1; |
2b188cc1 | 898 | } |
864ea921 | 899 | |
37f0e767 | 900 | percpu_ref_get_many(&ctx->refs, ret); |
3ab665b7 | 901 | for (i = 0; i < ret; i++) { |
23a5c43b | 902 | struct io_kiocb *req = reqs[i]; |
3ab665b7 PB |
903 | |
904 | io_preinit_req(req, ctx); | |
fa05457a | 905 | io_req_add_to_cache(req, ctx); |
3ab665b7 | 906 | } |
a33ae9ce PB |
907 | return true; |
908 | } | |
909 | ||
910 | static inline bool io_alloc_req_refill(struct io_ring_ctx *ctx) | |
911 | { | |
88ab95be | 912 | if (unlikely(io_req_cache_empty(ctx))) |
a33ae9ce PB |
913 | return __io_alloc_req_refill(ctx); |
914 | return true; | |
915 | } | |
916 | ||
917 | static inline struct io_kiocb *io_alloc_req(struct io_ring_ctx *ctx) | |
918 | { | |
919 | struct io_wq_work_node *node; | |
920 | ||
921 | node = wq_stack_extract(&ctx->submit_state.free_list); | |
c2b6c6bc | 922 | return container_of(node, struct io_kiocb, comp_list); |
2b188cc1 JA |
923 | } |
924 | ||
6b639522 | 925 | static inline void io_dismantle_req(struct io_kiocb *req) |
2b188cc1 | 926 | { |
094bae49 | 927 | unsigned int flags = req->flags; |
929a3af9 | 928 | |
867f8fa5 | 929 | if (unlikely(flags & IO_REQ_CLEAN_FLAGS)) |
3a0a6902 | 930 | io_clean_op(req); |
e1d767f0 PB |
931 | if (!(flags & REQ_F_FIXED_FILE)) |
932 | io_put_file(req->file); | |
e65ef56d JA |
933 | } |
934 | ||
59915143 | 935 | __cold void io_free_req(struct io_kiocb *req) |
c6ca97b3 | 936 | { |
51a4cc11 | 937 | struct io_ring_ctx *ctx = req->ctx; |
c6ca97b3 | 938 | |
7ac1edc4 | 939 | io_req_put_rsrc(req); |
216578e5 | 940 | io_dismantle_req(req); |
7c660731 | 941 | io_put_task(req->task, 1); |
c6ca97b3 | 942 | |
79ebeaee | 943 | spin_lock(&ctx->completion_lock); |
c2b6c6bc | 944 | wq_list_add_head(&req->comp_list, &ctx->locked_free_list); |
c34b025f | 945 | ctx->locked_free_nr++; |
79ebeaee | 946 | spin_unlock(&ctx->completion_lock); |
e65ef56d JA |
947 | } |
948 | ||
d81499bf PB |
949 | static void __io_req_find_next_prep(struct io_kiocb *req) |
950 | { | |
951 | struct io_ring_ctx *ctx = req->ctx; | |
d81499bf | 952 | |
25399321 | 953 | io_cq_lock(ctx); |
305bef98 | 954 | io_disarm_next(req); |
25399321 | 955 | io_cq_unlock_post(ctx); |
d81499bf PB |
956 | } |
957 | ||
958 | static inline struct io_kiocb *io_req_find_next(struct io_kiocb *req) | |
c69f8dbe | 959 | { |
33cc89a9 | 960 | struct io_kiocb *nxt; |
944e58bf | 961 | |
9e645e11 JA |
962 | /* |
963 | * If LINK is set, we have dependent requests in this chain. If we | |
964 | * didn't fail this request, queue the first one up, moving any other | |
965 | * dependencies to the next request. In case of failure, fail the rest | |
966 | * of the chain. | |
967 | */ | |
d81499bf PB |
968 | if (unlikely(req->flags & IO_DISARM_MASK)) |
969 | __io_req_find_next_prep(req); | |
33cc89a9 PB |
970 | nxt = req->link; |
971 | req->link = NULL; | |
972 | return nxt; | |
4d7dd462 | 973 | } |
9e645e11 | 974 | |
f237c30a | 975 | static void ctx_flush_and_put(struct io_ring_ctx *ctx, bool *locked) |
2c32395d PB |
976 | { |
977 | if (!ctx) | |
978 | return; | |
ef060ea9 JA |
979 | if (ctx->flags & IORING_SETUP_TASKRUN_FLAG) |
980 | atomic_andnot(IORING_SQ_TASKRUN, &ctx->rings->sq_flags); | |
f237c30a | 981 | if (*locked) { |
c450178d | 982 | io_submit_flush_completions(ctx); |
2c32395d | 983 | mutex_unlock(&ctx->uring_lock); |
f237c30a | 984 | *locked = false; |
2c32395d PB |
985 | } |
986 | percpu_ref_put(&ctx->refs); | |
987 | } | |
988 | ||
c6dd763c DY |
989 | static unsigned int handle_tw_list(struct llist_node *node, |
990 | struct io_ring_ctx **ctx, bool *locked, | |
991 | struct llist_node *last) | |
9f8d032a | 992 | { |
c6dd763c DY |
993 | unsigned int count = 0; |
994 | ||
3a0c037b | 995 | while (node != last) { |
f88262e6 | 996 | struct llist_node *next = node->next; |
9f8d032a HX |
997 | struct io_kiocb *req = container_of(node, struct io_kiocb, |
998 | io_task_work.node); | |
999 | ||
34d2bfe7 JA |
1000 | prefetch(container_of(next, struct io_kiocb, io_task_work.node)); |
1001 | ||
9f8d032a HX |
1002 | if (req->ctx != *ctx) { |
1003 | ctx_flush_and_put(*ctx, locked); | |
1004 | *ctx = req->ctx; | |
1005 | /* if not contended, grab and improve batching */ | |
1006 | *locked = mutex_trylock(&(*ctx)->uring_lock); | |
1007 | percpu_ref_get(&(*ctx)->refs); | |
1008 | } | |
1009 | req->io_task_work.func(req, locked); | |
1010 | node = next; | |
c6dd763c | 1011 | count++; |
3a0c037b | 1012 | } |
c6dd763c DY |
1013 | |
1014 | return count; | |
9f8d032a HX |
1015 | } |
1016 | ||
923d1592 DY |
1017 | /** |
1018 | * io_llist_xchg - swap all entries in a lock-less list | |
1019 | * @head: the head of lock-less list to delete all entries | |
1020 | * @new: new entry as the head of the list | |
1021 | * | |
1022 | * If list is empty, return NULL, otherwise, return the pointer to the first entry. | |
1023 | * The order of entries returned is from the newest to the oldest added one. | |
1024 | */ | |
1025 | static inline struct llist_node *io_llist_xchg(struct llist_head *head, | |
1026 | struct llist_node *new) | |
1027 | { | |
1028 | return xchg(&head->first, new); | |
1029 | } | |
1030 | ||
1031 | /** | |
1032 | * io_llist_cmpxchg - possibly swap all entries in a lock-less list | |
1033 | * @head: the head of lock-less list to delete all entries | |
1034 | * @old: expected old value of the first entry of the list | |
1035 | * @new: new entry as the head of the list | |
1036 | * | |
1037 | * perform a cmpxchg on the first entry of the list. | |
1038 | */ | |
1039 | ||
1040 | static inline struct llist_node *io_llist_cmpxchg(struct llist_head *head, | |
1041 | struct llist_node *old, | |
1042 | struct llist_node *new) | |
1043 | { | |
1044 | return cmpxchg(&head->first, old, new); | |
1045 | } | |
1046 | ||
c9f06aa7 | 1047 | void tctx_task_work(struct callback_head *cb) |
c40f6379 | 1048 | { |
f28c240e | 1049 | bool uring_locked = false; |
ebd0df2e | 1050 | struct io_ring_ctx *ctx = NULL; |
3f18407d PB |
1051 | struct io_uring_task *tctx = container_of(cb, struct io_uring_task, |
1052 | task_work); | |
3a0c037b DY |
1053 | struct llist_node fake = {}; |
1054 | struct llist_node *node = io_llist_xchg(&tctx->task_list, &fake); | |
c6dd763c DY |
1055 | unsigned int loops = 1; |
1056 | unsigned int count = handle_tw_list(node, &ctx, &uring_locked, NULL); | |
3a0c037b | 1057 | |
3a0c037b DY |
1058 | node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL); |
1059 | while (node != &fake) { | |
c6dd763c | 1060 | loops++; |
3a0c037b | 1061 | node = io_llist_xchg(&tctx->task_list, &fake); |
c6dd763c | 1062 | count += handle_tw_list(node, &ctx, &uring_locked, &fake); |
3a0c037b | 1063 | node = io_llist_cmpxchg(&tctx->task_list, &fake, NULL); |
3f18407d | 1064 | } |
ebd0df2e | 1065 | |
f28c240e | 1066 | ctx_flush_and_put(ctx, &uring_locked); |
3cc7fdb9 PB |
1067 | |
1068 | /* relaxed read is enough as only the task itself sets ->in_idle */ | |
1069 | if (unlikely(atomic_read(&tctx->in_idle))) | |
1070 | io_uring_drop_tctx_refs(current); | |
c6dd763c DY |
1071 | |
1072 | trace_io_uring_task_work_run(tctx, count, loops); | |
7cbf1722 JA |
1073 | } |
1074 | ||
c34398a8 | 1075 | void io_req_task_work_add(struct io_kiocb *req) |
7cbf1722 | 1076 | { |
c34398a8 | 1077 | struct io_uring_task *tctx = req->task->io_uring; |
9f010507 | 1078 | struct io_ring_ctx *ctx = req->ctx; |
f88262e6 | 1079 | struct llist_node *node; |
6294f368 | 1080 | bool running; |
7cbf1722 | 1081 | |
f88262e6 | 1082 | running = !llist_add(&req->io_task_work.node, &tctx->task_list); |
7cbf1722 JA |
1083 | |
1084 | /* task_work already pending, we're done */ | |
6294f368 | 1085 | if (running) |
e09ee510 | 1086 | return; |
7cbf1722 | 1087 | |
ef060ea9 JA |
1088 | if (ctx->flags & IORING_SETUP_TASKRUN_FLAG) |
1089 | atomic_or(IORING_SQ_TASKRUN, &ctx->rings->sq_flags); | |
1090 | ||
3fe07bcd | 1091 | if (likely(!task_work_add(req->task, &tctx->task_work, ctx->notify_method))) |
e09ee510 | 1092 | return; |
2215bed9 | 1093 | |
f88262e6 | 1094 | node = llist_del_all(&tctx->task_list); |
7cbf1722 | 1095 | |
e09ee510 PB |
1096 | while (node) { |
1097 | req = container_of(node, struct io_kiocb, io_task_work.node); | |
1098 | node = node->next; | |
3218e5d3 | 1099 | if (llist_add(&req->io_task_work.node, |
e09ee510 PB |
1100 | &req->ctx->fallback_llist)) |
1101 | schedule_delayed_work(&req->ctx->fallback_work, 1); | |
1102 | } | |
eab30c4d PB |
1103 | } |
1104 | ||
4e118cd9 | 1105 | static void io_req_tw_post(struct io_kiocb *req, bool *locked) |
c40f6379 | 1106 | { |
97b388d7 | 1107 | io_req_complete_post(req); |
4e118cd9 | 1108 | } |
c40f6379 | 1109 | |
59915143 | 1110 | void io_req_tw_post_queue(struct io_kiocb *req, s32 res, u32 cflags) |
4e118cd9 | 1111 | { |
97b388d7 | 1112 | io_req_set_res(req, res, cflags); |
4e118cd9 | 1113 | req->io_task_work.func = io_req_tw_post; |
3fe07bcd | 1114 | io_req_task_work_add(req); |
4e118cd9 PB |
1115 | } |
1116 | ||
f237c30a | 1117 | static void io_req_task_cancel(struct io_kiocb *req, bool *locked) |
c40f6379 | 1118 | { |
b18a1a45 | 1119 | /* not needed for normal modes, but SQPOLL depends on it */ |
971cf9c1 | 1120 | io_tw_lock(req->ctx, locked); |
cef216fc | 1121 | io_req_complete_failed(req, req->cqe.res); |
c40f6379 JA |
1122 | } |
1123 | ||
329061d3 | 1124 | void io_req_task_submit(struct io_kiocb *req, bool *locked) |
c40f6379 | 1125 | { |
971cf9c1 | 1126 | io_tw_lock(req->ctx, locked); |
316319e8 | 1127 | /* req->task == current here, checking PF_EXITING is safe */ |
af066f31 | 1128 | if (likely(!(req->task->flags & PF_EXITING))) |
cbc2e203 | 1129 | io_queue_sqe(req); |
81b6d05c | 1130 | else |
2593553a | 1131 | io_req_complete_failed(req, -EFAULT); |
c40f6379 JA |
1132 | } |
1133 | ||
59915143 | 1134 | void io_req_task_queue_fail(struct io_kiocb *req, int ret) |
c40f6379 | 1135 | { |
97b388d7 | 1136 | io_req_set_res(req, ret, 0); |
5b0a6acc | 1137 | req->io_task_work.func = io_req_task_cancel; |
3fe07bcd | 1138 | io_req_task_work_add(req); |
c40f6379 JA |
1139 | } |
1140 | ||
f3b44f92 | 1141 | void io_req_task_queue(struct io_kiocb *req) |
a3df7698 | 1142 | { |
5b0a6acc | 1143 | req->io_task_work.func = io_req_task_submit; |
3fe07bcd | 1144 | io_req_task_work_add(req); |
a3df7698 PB |
1145 | } |
1146 | ||
59915143 | 1147 | void io_queue_next(struct io_kiocb *req) |
c69f8dbe | 1148 | { |
9b5f7bd9 | 1149 | struct io_kiocb *nxt = io_req_find_next(req); |
944e58bf PB |
1150 | |
1151 | if (nxt) | |
906a8c3f | 1152 | io_req_task_queue(nxt); |
c69f8dbe JL |
1153 | } |
1154 | ||
f3b44f92 | 1155 | void io_free_batch_list(struct io_ring_ctx *ctx, struct io_wq_work_node *node) |
3aa83bfb | 1156 | __must_hold(&ctx->uring_lock) |
5af1d13e | 1157 | { |
d4b7a5ef | 1158 | struct task_struct *task = NULL; |
37f0e767 | 1159 | int task_refs = 0; |
5af1d13e | 1160 | |
3aa83bfb PB |
1161 | do { |
1162 | struct io_kiocb *req = container_of(node, struct io_kiocb, | |
1163 | comp_list); | |
2d6500d4 | 1164 | |
a538be5b PB |
1165 | if (unlikely(req->flags & IO_REQ_CLEAN_SLOW_FLAGS)) { |
1166 | if (req->flags & REQ_F_REFCOUNT) { | |
1167 | node = req->comp_list.next; | |
1168 | if (!req_ref_put_and_test(req)) | |
1169 | continue; | |
1170 | } | |
b605a7fa PB |
1171 | if ((req->flags & REQ_F_POLLED) && req->apoll) { |
1172 | struct async_poll *apoll = req->apoll; | |
1173 | ||
1174 | if (apoll->double_poll) | |
1175 | kfree(apoll->double_poll); | |
1176 | list_add(&apoll->poll.wait.entry, | |
1177 | &ctx->apoll_cache); | |
1178 | req->flags &= ~REQ_F_POLLED; | |
1179 | } | |
da1a08c5 | 1180 | if (req->flags & IO_REQ_LINK_FLAGS) |
57859f4d | 1181 | io_queue_next(req); |
a538be5b PB |
1182 | if (unlikely(req->flags & IO_REQ_CLEAN_FLAGS)) |
1183 | io_clean_op(req); | |
c1e53a69 | 1184 | } |
a538be5b PB |
1185 | if (!(req->flags & REQ_F_FIXED_FILE)) |
1186 | io_put_file(req->file); | |
2d6500d4 | 1187 | |
ab409402 | 1188 | io_req_put_rsrc_locked(req, ctx); |
5af1d13e | 1189 | |
d4b7a5ef PB |
1190 | if (req->task != task) { |
1191 | if (task) | |
1192 | io_put_task(task, task_refs); | |
1193 | task = req->task; | |
1194 | task_refs = 0; | |
1195 | } | |
1196 | task_refs++; | |
c1e53a69 | 1197 | node = req->comp_list.next; |
fa05457a | 1198 | io_req_add_to_cache(req, ctx); |
3aa83bfb | 1199 | } while (node); |
d4b7a5ef | 1200 | |
d4b7a5ef PB |
1201 | if (task) |
1202 | io_put_task(task, task_refs); | |
7a743e22 PB |
1203 | } |
1204 | ||
c450178d | 1205 | static void __io_submit_flush_completions(struct io_ring_ctx *ctx) |
a141dd89 | 1206 | __must_hold(&ctx->uring_lock) |
905c172f | 1207 | { |
6f33b0bc | 1208 | struct io_wq_work_node *node, *prev; |
cd0ca2e0 | 1209 | struct io_submit_state *state = &ctx->submit_state; |
905c172f | 1210 | |
d9dee430 PB |
1211 | spin_lock(&ctx->completion_lock); |
1212 | wq_list_for_each(node, prev, &state->compl_reqs) { | |
1213 | struct io_kiocb *req = container_of(node, struct io_kiocb, | |
1214 | comp_list); | |
3d4aeb9f | 1215 | |
d9dee430 PB |
1216 | if (!(req->flags & REQ_F_CQE_SKIP)) |
1217 | __io_fill_cqe_req(ctx, req); | |
905c172f | 1218 | } |
25399321 | 1219 | __io_cq_unlock_post(ctx); |
d9dee430 | 1220 | |
1cce17ac | 1221 | io_free_batch_list(ctx, state->compl_reqs.first); |
6f33b0bc | 1222 | INIT_WQ_LIST(&state->compl_reqs); |
7a743e22 PB |
1223 | } |
1224 | ||
ba816ad6 JA |
1225 | /* |
1226 | * Drop reference to request, return next in chain (if there is one) if this | |
1227 | * was the last reference to this request. | |
1228 | */ | |
0d85035a | 1229 | static inline struct io_kiocb *io_put_req_find_next(struct io_kiocb *req) |
e65ef56d | 1230 | { |
9b5f7bd9 PB |
1231 | struct io_kiocb *nxt = NULL; |
1232 | ||
de9b4cca | 1233 | if (req_ref_put_and_test(req)) { |
da1a08c5 | 1234 | if (unlikely(req->flags & IO_REQ_LINK_FLAGS)) |
7819a1f6 | 1235 | nxt = io_req_find_next(req); |
f5c6cf2a | 1236 | io_free_req(req); |
2a44f467 | 1237 | } |
9b5f7bd9 | 1238 | return nxt; |
2b188cc1 JA |
1239 | } |
1240 | ||
6c503150 | 1241 | static unsigned io_cqring_events(struct io_ring_ctx *ctx) |
a3a0e43f JA |
1242 | { |
1243 | /* See comment at the top of this file */ | |
1244 | smp_rmb(); | |
e23de15f | 1245 | return __io_cqring_events(ctx); |
a3a0e43f JA |
1246 | } |
1247 | ||
def596e9 JA |
1248 | /* |
1249 | * We can't just wait for polled events to come to us, we have to actively | |
1250 | * find and complete them. | |
1251 | */ | |
c072481d | 1252 | static __cold void io_iopoll_try_reap_events(struct io_ring_ctx *ctx) |
def596e9 JA |
1253 | { |
1254 | if (!(ctx->flags & IORING_SETUP_IOPOLL)) | |
1255 | return; | |
1256 | ||
1257 | mutex_lock(&ctx->uring_lock); | |
5eef4e87 | 1258 | while (!wq_list_empty(&ctx->iopoll_list)) { |
b2edc0a7 | 1259 | /* let it sleep and repeat later if can't complete a request */ |
5ba3c874 | 1260 | if (io_do_iopoll(ctx, true) == 0) |
b2edc0a7 | 1261 | break; |
08f5439f JA |
1262 | /* |
1263 | * Ensure we allow local-to-the-cpu processing to take place, | |
1264 | * in this case we need to ensure that we reap all events. | |
3fcee5a6 | 1265 | * Also let task_work, etc. to progress by releasing the mutex |
08f5439f | 1266 | */ |
3fcee5a6 PB |
1267 | if (need_resched()) { |
1268 | mutex_unlock(&ctx->uring_lock); | |
1269 | cond_resched(); | |
1270 | mutex_lock(&ctx->uring_lock); | |
1271 | } | |
def596e9 JA |
1272 | } |
1273 | mutex_unlock(&ctx->uring_lock); | |
1274 | } | |
1275 | ||
7668b92a | 1276 | static int io_iopoll_check(struct io_ring_ctx *ctx, long min) |
def596e9 | 1277 | { |
7668b92a | 1278 | unsigned int nr_events = 0; |
e9979b36 | 1279 | int ret = 0; |
155bc950 | 1280 | unsigned long check_cq; |
500f9fba | 1281 | |
3a08576b PB |
1282 | check_cq = READ_ONCE(ctx->check_cq); |
1283 | if (unlikely(check_cq)) { | |
1284 | if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)) | |
1285 | __io_cqring_overflow_flush(ctx, false); | |
1286 | /* | |
1287 | * Similarly do not spin if we have not informed the user of any | |
1288 | * dropped CQE. | |
1289 | */ | |
1290 | if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT)) | |
1291 | return -EBADR; | |
1292 | } | |
f39c8a5b PB |
1293 | /* |
1294 | * Don't enter poll loop if we already have events pending. | |
1295 | * If we do, we can potentially be spinning for commands that | |
1296 | * already triggered a CQE (eg in error). | |
1297 | */ | |
f39c8a5b | 1298 | if (io_cqring_events(ctx)) |
d487b43c | 1299 | return 0; |
155bc950 | 1300 | |
def596e9 | 1301 | do { |
500f9fba JA |
1302 | /* |
1303 | * If a submit got punted to a workqueue, we can have the | |
1304 | * application entering polling for a command before it gets | |
1305 | * issued. That app will hold the uring_lock for the duration | |
1306 | * of the poll right here, so we need to take a breather every | |
1307 | * now and then to ensure that the issue has a chance to add | |
1308 | * the poll to the issued list. Otherwise we can spin here | |
1309 | * forever, while the workqueue is stuck trying to acquire the | |
1310 | * very same mutex. | |
1311 | */ | |
5eef4e87 | 1312 | if (wq_list_empty(&ctx->iopoll_list)) { |
8f487ef2 PB |
1313 | u32 tail = ctx->cached_cq_tail; |
1314 | ||
500f9fba | 1315 | mutex_unlock(&ctx->uring_lock); |
4c6e277c | 1316 | io_run_task_work(); |
500f9fba | 1317 | mutex_lock(&ctx->uring_lock); |
def596e9 | 1318 | |
8f487ef2 PB |
1319 | /* some requests don't go through iopoll_list */ |
1320 | if (tail != ctx->cached_cq_tail || | |
5eef4e87 | 1321 | wq_list_empty(&ctx->iopoll_list)) |
e9979b36 | 1322 | break; |
500f9fba | 1323 | } |
5ba3c874 PB |
1324 | ret = io_do_iopoll(ctx, !min); |
1325 | if (ret < 0) | |
1326 | break; | |
1327 | nr_events += ret; | |
1328 | ret = 0; | |
1329 | } while (nr_events < min && !need_resched()); | |
d487b43c | 1330 | |
def596e9 JA |
1331 | return ret; |
1332 | } | |
7012c815 PB |
1333 | |
1334 | void io_req_task_complete(struct io_kiocb *req, bool *locked) | |
8ef12efe | 1335 | { |
7012c815 PB |
1336 | if (req->flags & (REQ_F_BUFFER_SELECTED|REQ_F_BUFFER_RING)) { |
1337 | unsigned issue_flags = *locked ? 0 : IO_URING_F_UNLOCKED; | |
1338 | ||
1339 | req->cqe.flags |= io_put_kbuf(req, issue_flags); | |
1340 | } | |
1341 | ||
1342 | if (*locked) | |
9da070b1 | 1343 | io_req_complete_defer(req); |
7012c815 | 1344 | else |
97b388d7 | 1345 | io_req_complete_post(req); |
8ef12efe JA |
1346 | } |
1347 | ||
def596e9 JA |
1348 | /* |
1349 | * After the iocb has been issued, it's safe to be found on the poll list. | |
1350 | * Adding the kiocb to the list AFTER submission ensures that we don't | |
f39c8a5b | 1351 | * find it from a io_do_iopoll() thread before the issuer is done |
def596e9 JA |
1352 | * accessing the kiocb cookie. |
1353 | */ | |
9882131c | 1354 | static void io_iopoll_req_issued(struct io_kiocb *req, unsigned int issue_flags) |
def596e9 JA |
1355 | { |
1356 | struct io_ring_ctx *ctx = req->ctx; | |
3b44b371 | 1357 | const bool needs_lock = issue_flags & IO_URING_F_UNLOCKED; |
cb3d8972 PB |
1358 | |
1359 | /* workqueue context doesn't hold uring_lock, grab it now */ | |
3b44b371 | 1360 | if (unlikely(needs_lock)) |
cb3d8972 | 1361 | mutex_lock(&ctx->uring_lock); |
def596e9 JA |
1362 | |
1363 | /* | |
1364 | * Track whether we have multiple files in our lists. This will impact | |
1365 | * how we do polling eventually, not spinning if we're on potentially | |
1366 | * different devices. | |
1367 | */ | |
5eef4e87 | 1368 | if (wq_list_empty(&ctx->iopoll_list)) { |
915b3dde HX |
1369 | ctx->poll_multi_queue = false; |
1370 | } else if (!ctx->poll_multi_queue) { | |
def596e9 JA |
1371 | struct io_kiocb *list_req; |
1372 | ||
5eef4e87 PB |
1373 | list_req = container_of(ctx->iopoll_list.first, struct io_kiocb, |
1374 | comp_list); | |
30da1b45 | 1375 | if (list_req->file != req->file) |
915b3dde | 1376 | ctx->poll_multi_queue = true; |
def596e9 JA |
1377 | } |
1378 | ||
1379 | /* | |
1380 | * For fast devices, IO may have already completed. If it has, add | |
1381 | * it to the front so we find it first. | |
1382 | */ | |
65a6543d | 1383 | if (READ_ONCE(req->iopoll_completed)) |
5eef4e87 | 1384 | wq_list_add_head(&req->comp_list, &ctx->iopoll_list); |
def596e9 | 1385 | else |
5eef4e87 | 1386 | wq_list_add_tail(&req->comp_list, &ctx->iopoll_list); |
bdcd3eab | 1387 | |
3b44b371 | 1388 | if (unlikely(needs_lock)) { |
cb3d8972 PB |
1389 | /* |
1390 | * If IORING_SETUP_SQPOLL is enabled, sqes are either handle | |
1391 | * in sq thread task context or in io worker task context. If | |
1392 | * current task context is sq thread, we don't need to check | |
1393 | * whether should wake up sq thread. | |
1394 | */ | |
1395 | if ((ctx->flags & IORING_SETUP_SQPOLL) && | |
1396 | wq_has_sleeper(&ctx->sq_data->wait)) | |
1397 | wake_up(&ctx->sq_data->wait); | |
1398 | ||
1399 | mutex_unlock(&ctx->uring_lock); | |
1400 | } | |
def596e9 JA |
1401 | } |
1402 | ||
4503b767 JA |
1403 | static bool io_bdev_nowait(struct block_device *bdev) |
1404 | { | |
9ba0d0c8 | 1405 | return !bdev || blk_queue_nowait(bdev_get_queue(bdev)); |
4503b767 JA |
1406 | } |
1407 | ||
2b188cc1 JA |
1408 | /* |
1409 | * If we tracked the file through the SCM inflight mechanism, we could support | |
1410 | * any file. For now, just ensure that anything potentially problematic is done | |
1411 | * inline. | |
1412 | */ | |
88459b50 | 1413 | static bool __io_file_supports_nowait(struct file *file, umode_t mode) |
2b188cc1 | 1414 | { |
4503b767 | 1415 | if (S_ISBLK(mode)) { |
4e7b5671 CH |
1416 | if (IS_ENABLED(CONFIG_BLOCK) && |
1417 | io_bdev_nowait(I_BDEV(file->f_mapping->host))) | |
4503b767 JA |
1418 | return true; |
1419 | return false; | |
1420 | } | |
976517f1 | 1421 | if (S_ISSOCK(mode)) |
2b188cc1 | 1422 | return true; |
4503b767 | 1423 | if (S_ISREG(mode)) { |
4e7b5671 CH |
1424 | if (IS_ENABLED(CONFIG_BLOCK) && |
1425 | io_bdev_nowait(file->f_inode->i_sb->s_bdev) && | |
e5550a14 | 1426 | !io_is_uring_fops(file)) |
4503b767 JA |
1427 | return true; |
1428 | return false; | |
1429 | } | |
2b188cc1 | 1430 | |
c5b85625 JA |
1431 | /* any ->read/write should understand O_NONBLOCK */ |
1432 | if (file->f_flags & O_NONBLOCK) | |
1433 | return true; | |
35645ac3 | 1434 | return file->f_mode & FMODE_NOWAIT; |
2b188cc1 | 1435 | } |
c5b85625 | 1436 | |
88459b50 PB |
1437 | /* |
1438 | * If we tracked the file through the SCM inflight mechanism, we could support | |
1439 | * any file. For now, just ensure that anything potentially problematic is done | |
1440 | * inline. | |
1441 | */ | |
a4ad4f74 | 1442 | unsigned int io_file_get_flags(struct file *file) |
88459b50 PB |
1443 | { |
1444 | umode_t mode = file_inode(file)->i_mode; | |
1445 | unsigned int res = 0; | |
af197f50 | 1446 | |
88459b50 PB |
1447 | if (S_ISREG(mode)) |
1448 | res |= FFS_ISREG; | |
1449 | if (__io_file_supports_nowait(file, mode)) | |
1450 | res |= FFS_NOWAIT; | |
5e45690a JA |
1451 | if (io_file_need_scm(file)) |
1452 | res |= FFS_SCM; | |
88459b50 | 1453 | return res; |
2b188cc1 JA |
1454 | } |
1455 | ||
99f15d8d | 1456 | bool io_alloc_async_data(struct io_kiocb *req) |
3d9932a8 | 1457 | { |
e8c2bc1f JA |
1458 | WARN_ON_ONCE(!io_op_defs[req->opcode].async_size); |
1459 | req->async_data = kmalloc(io_op_defs[req->opcode].async_size, GFP_KERNEL); | |
d886e185 PB |
1460 | if (req->async_data) { |
1461 | req->flags |= REQ_F_ASYNC_DATA; | |
1462 | return false; | |
1463 | } | |
1464 | return true; | |
3d9932a8 XW |
1465 | } |
1466 | ||
f3b44f92 | 1467 | int io_req_prep_async(struct io_kiocb *req) |
f67676d1 | 1468 | { |
0702e536 JA |
1469 | const struct io_op_def *def = &io_op_defs[req->opcode]; |
1470 | ||
1471 | /* assign early for deferred execution for non-fixed file */ | |
1472 | if (def->needs_file && !(req->flags & REQ_F_FIXED_FILE)) | |
1473 | req->file = io_file_get_normal(req, req->cqe.fd); | |
dc919caf | 1474 | if (!def->prep_async) |
0702e536 JA |
1475 | return 0; |
1476 | if (WARN_ON_ONCE(req_has_async_data(req))) | |
1477 | return -EFAULT; | |
1478 | if (io_alloc_async_data(req)) | |
1479 | return -EAGAIN; | |
1480 | ||
dc919caf | 1481 | return def->prep_async(req); |
bfe76559 PB |
1482 | } |
1483 | ||
9cf7c104 PB |
1484 | static u32 io_get_sequence(struct io_kiocb *req) |
1485 | { | |
a3dbdf54 | 1486 | u32 seq = req->ctx->cached_sq_head; |
963c6abb | 1487 | struct io_kiocb *cur; |
9cf7c104 | 1488 | |
a3dbdf54 | 1489 | /* need original cached_sq_head, but it was increased for each req */ |
963c6abb | 1490 | io_for_each_link(cur, req) |
a3dbdf54 PB |
1491 | seq--; |
1492 | return seq; | |
9cf7c104 PB |
1493 | } |
1494 | ||
c072481d | 1495 | static __cold void io_drain_req(struct io_kiocb *req) |
de0617e4 | 1496 | { |
a197f664 | 1497 | struct io_ring_ctx *ctx = req->ctx; |
27dc8338 | 1498 | struct io_defer_entry *de; |
f67676d1 | 1499 | int ret; |
e0eb71dc | 1500 | u32 seq = io_get_sequence(req); |
3c19966d | 1501 | |
9d858b21 | 1502 | /* Still need defer if there is pending req in defer list. */ |
e302f104 | 1503 | spin_lock(&ctx->completion_lock); |
5e371265 | 1504 | if (!req_need_defer(req, seq) && list_empty_careful(&ctx->defer_list)) { |
e302f104 | 1505 | spin_unlock(&ctx->completion_lock); |
e0eb71dc | 1506 | queue: |
10c66904 | 1507 | ctx->drain_active = false; |
e0eb71dc PB |
1508 | io_req_task_queue(req); |
1509 | return; | |
10c66904 | 1510 | } |
e302f104 | 1511 | spin_unlock(&ctx->completion_lock); |
9cf7c104 | 1512 | |
b7e298d2 | 1513 | ret = io_req_prep_async(req); |
e0eb71dc PB |
1514 | if (ret) { |
1515 | fail: | |
1516 | io_req_complete_failed(req, ret); | |
1517 | return; | |
1518 | } | |
cbdcb435 | 1519 | io_prep_async_link(req); |
27dc8338 | 1520 | de = kmalloc(sizeof(*de), GFP_KERNEL); |
76cc33d7 | 1521 | if (!de) { |
1b48773f | 1522 | ret = -ENOMEM; |
e0eb71dc | 1523 | goto fail; |
76cc33d7 | 1524 | } |
2d28390a | 1525 | |
79ebeaee | 1526 | spin_lock(&ctx->completion_lock); |
9cf7c104 | 1527 | if (!req_need_defer(req, seq) && list_empty(&ctx->defer_list)) { |
79ebeaee | 1528 | spin_unlock(&ctx->completion_lock); |
27dc8338 | 1529 | kfree(de); |
e0eb71dc | 1530 | goto queue; |
de0617e4 JA |
1531 | } |
1532 | ||
48863ffd | 1533 | trace_io_uring_defer(req); |
27dc8338 | 1534 | de->req = req; |
9cf7c104 | 1535 | de->seq = seq; |
27dc8338 | 1536 | list_add_tail(&de->list, &ctx->defer_list); |
79ebeaee | 1537 | spin_unlock(&ctx->completion_lock); |
de0617e4 JA |
1538 | } |
1539 | ||
68fb8979 | 1540 | static void io_clean_op(struct io_kiocb *req) |
99bc4c38 | 1541 | { |
8197b053 PB |
1542 | if (req->flags & REQ_F_BUFFER_SELECTED) { |
1543 | spin_lock(&req->ctx->completion_lock); | |
cc3cec83 | 1544 | io_put_kbuf_comp(req); |
8197b053 PB |
1545 | spin_unlock(&req->ctx->completion_lock); |
1546 | } | |
99bc4c38 | 1547 | |
0e1b6fe3 | 1548 | if (req->flags & REQ_F_NEED_CLEANUP) { |
4d4c9cff | 1549 | const struct io_op_def *def = &io_op_defs[req->opcode]; |
bb040a21 | 1550 | |
4d4c9cff JA |
1551 | if (def->cleanup) |
1552 | def->cleanup(req); | |
99bc4c38 | 1553 | } |
75652a30 JA |
1554 | if ((req->flags & REQ_F_POLLED) && req->apoll) { |
1555 | kfree(req->apoll->double_poll); | |
1556 | kfree(req->apoll); | |
1557 | req->apoll = NULL; | |
1558 | } | |
9cae36a0 JA |
1559 | if (req->flags & REQ_F_INFLIGHT) { |
1560 | struct io_uring_task *tctx = req->task->io_uring; | |
1561 | ||
1562 | atomic_dec(&tctx->inflight_tracked); | |
1563 | } | |
c854357b | 1564 | if (req->flags & REQ_F_CREDS) |
b8e64b53 | 1565 | put_cred(req->creds); |
d886e185 PB |
1566 | if (req->flags & REQ_F_ASYNC_DATA) { |
1567 | kfree(req->async_data); | |
1568 | req->async_data = NULL; | |
1569 | } | |
c854357b | 1570 | req->flags &= ~IO_REQ_CLEAN_FLAGS; |
99bc4c38 PB |
1571 | } |
1572 | ||
6bf9c47a JA |
1573 | static bool io_assign_file(struct io_kiocb *req, unsigned int issue_flags) |
1574 | { | |
1575 | if (req->file || !io_op_defs[req->opcode].needs_file) | |
1576 | return true; | |
1577 | ||
1578 | if (req->flags & REQ_F_FIXED_FILE) | |
cef216fc | 1579 | req->file = io_file_get_fixed(req, req->cqe.fd, issue_flags); |
6bf9c47a | 1580 | else |
cef216fc | 1581 | req->file = io_file_get_normal(req, req->cqe.fd); |
6bf9c47a | 1582 | |
772f5e00 | 1583 | return !!req->file; |
6bf9c47a JA |
1584 | } |
1585 | ||
889fca73 | 1586 | static int io_issue_sqe(struct io_kiocb *req, unsigned int issue_flags) |
2b188cc1 | 1587 | { |
fcde59fe | 1588 | const struct io_op_def *def = &io_op_defs[req->opcode]; |
5730b27e | 1589 | const struct cred *creds = NULL; |
d625c6ee | 1590 | int ret; |
2b188cc1 | 1591 | |
70152140 JA |
1592 | if (unlikely(!io_assign_file(req, issue_flags))) |
1593 | return -EBADF; | |
1594 | ||
6878b40e | 1595 | if (unlikely((req->flags & REQ_F_CREDS) && req->creds != current_cred())) |
c10d1f98 | 1596 | creds = override_creds(req->creds); |
5730b27e | 1597 | |
fcde59fe | 1598 | if (!def->audit_skip) |
5bd2182d PM |
1599 | audit_uring_entry(req->opcode); |
1600 | ||
0702e536 | 1601 | ret = def->issue(req, issue_flags); |
2b188cc1 | 1602 | |
fcde59fe | 1603 | if (!def->audit_skip) |
5bd2182d PM |
1604 | audit_uring_exit(!ret, ret); |
1605 | ||
5730b27e JA |
1606 | if (creds) |
1607 | revert_creds(creds); | |
97b388d7 | 1608 | |
75d7b3ae PB |
1609 | if (ret == IOU_OK) { |
1610 | if (issue_flags & IO_URING_F_COMPLETE_DEFER) | |
9da070b1 | 1611 | io_req_complete_defer(req); |
75d7b3ae PB |
1612 | else |
1613 | io_req_complete_post(req); | |
1614 | } else if (ret != IOU_ISSUE_SKIP_COMPLETE) | |
def596e9 | 1615 | return ret; |
97b388d7 | 1616 | |
b532576e | 1617 | /* If the op doesn't have a file, we're not polling for it */ |
9983028e | 1618 | if ((req->ctx->flags & IORING_SETUP_IOPOLL) && req->file) |
9882131c | 1619 | io_iopoll_req_issued(req, issue_flags); |
def596e9 JA |
1620 | |
1621 | return 0; | |
2b188cc1 JA |
1622 | } |
1623 | ||
329061d3 JA |
1624 | int io_poll_issue(struct io_kiocb *req, bool *locked) |
1625 | { | |
1626 | io_tw_lock(req->ctx, locked); | |
1627 | if (unlikely(req->task->flags & PF_EXITING)) | |
1628 | return -EFAULT; | |
aeaa72c6 | 1629 | return io_issue_sqe(req, IO_URING_F_NONBLOCK); |
329061d3 JA |
1630 | } |
1631 | ||
c9f06aa7 | 1632 | struct io_wq_work *io_wq_free_work(struct io_wq_work *work) |
ebc11b6c PB |
1633 | { |
1634 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); | |
1635 | ||
1636 | req = io_put_req_find_next(req); | |
1637 | return req ? &req->work : NULL; | |
1638 | } | |
1639 | ||
c9f06aa7 | 1640 | void io_wq_submit_work(struct io_wq_work *work) |
2b188cc1 JA |
1641 | { |
1642 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); | |
6bf9c47a | 1643 | const struct io_op_def *def = &io_op_defs[req->opcode]; |
d01905db PB |
1644 | unsigned int issue_flags = IO_URING_F_UNLOCKED; |
1645 | bool needs_poll = false; | |
6bf9c47a | 1646 | int ret = 0, err = -ECANCELED; |
2b188cc1 | 1647 | |
48dcd38d PB |
1648 | /* one will be dropped by ->io_free_work() after returning to io-wq */ |
1649 | if (!(req->flags & REQ_F_REFCOUNT)) | |
1650 | __io_req_set_refcount(req, 2); | |
1651 | else | |
1652 | req_ref_get(req); | |
5d5901a3 | 1653 | |
cb2d344c | 1654 | io_arm_ltimeout(req); |
6bf9c47a | 1655 | |
dadebc35 | 1656 | /* either cancelled or io-wq is dying, so don't touch tctx->iowq */ |
d01905db | 1657 | if (work->flags & IO_WQ_WORK_CANCEL) { |
0f8da75b | 1658 | fail: |
6bf9c47a | 1659 | io_req_task_queue_fail(req, err); |
d01905db PB |
1660 | return; |
1661 | } | |
0f8da75b PB |
1662 | if (!io_assign_file(req, issue_flags)) { |
1663 | err = -EBADF; | |
1664 | work->flags |= IO_WQ_WORK_CANCEL; | |
1665 | goto fail; | |
1666 | } | |
31b51510 | 1667 | |
d01905db | 1668 | if (req->flags & REQ_F_FORCE_ASYNC) { |
afb7f56f PB |
1669 | bool opcode_poll = def->pollin || def->pollout; |
1670 | ||
1671 | if (opcode_poll && file_can_poll(req->file)) { | |
1672 | needs_poll = true; | |
d01905db | 1673 | issue_flags |= IO_URING_F_NONBLOCK; |
afb7f56f | 1674 | } |
561fb04a | 1675 | } |
31b51510 | 1676 | |
d01905db PB |
1677 | do { |
1678 | ret = io_issue_sqe(req, issue_flags); | |
1679 | if (ret != -EAGAIN) | |
1680 | break; | |
1681 | /* | |
1682 | * We can get EAGAIN for iopolled IO even though we're | |
1683 | * forcing a sync submission from here, since we can't | |
1684 | * wait for request slots on the block side. | |
1685 | */ | |
1686 | if (!needs_poll) { | |
e0deb6a0 PB |
1687 | if (!(req->ctx->flags & IORING_SETUP_IOPOLL)) |
1688 | break; | |
d01905db PB |
1689 | cond_resched(); |
1690 | continue; | |
90fa0288 HX |
1691 | } |
1692 | ||
4d9237e3 | 1693 | if (io_arm_poll_handler(req, issue_flags) == IO_APOLL_OK) |
d01905db PB |
1694 | return; |
1695 | /* aborted or ready, in either case retry blocking */ | |
1696 | needs_poll = false; | |
1697 | issue_flags &= ~IO_URING_F_NONBLOCK; | |
1698 | } while (1); | |
31b51510 | 1699 | |
a3df7698 | 1700 | /* avoid locking problems by failing it from a clean context */ |
97b388d7 | 1701 | if (ret < 0) |
a3df7698 | 1702 | io_req_task_queue_fail(req, ret); |
2b188cc1 JA |
1703 | } |
1704 | ||
531113bb JA |
1705 | inline struct file *io_file_get_fixed(struct io_kiocb *req, int fd, |
1706 | unsigned int issue_flags) | |
09bb8394 | 1707 | { |
5106dd6e JA |
1708 | struct io_ring_ctx *ctx = req->ctx; |
1709 | struct file *file = NULL; | |
ac177053 | 1710 | unsigned long file_ptr; |
09bb8394 | 1711 | |
93f052cb | 1712 | io_ring_submit_lock(ctx, issue_flags); |
5106dd6e | 1713 | |
ac177053 | 1714 | if (unlikely((unsigned int)fd >= ctx->nr_user_files)) |
5106dd6e | 1715 | goto out; |
ac177053 PB |
1716 | fd = array_index_nospec(fd, ctx->nr_user_files); |
1717 | file_ptr = io_fixed_file_slot(&ctx->file_table, fd)->file_ptr; | |
1718 | file = (struct file *) (file_ptr & FFS_MASK); | |
1719 | file_ptr &= ~FFS_MASK; | |
1720 | /* mask in overlapping REQ_F and FFS bits */ | |
35645ac3 | 1721 | req->flags |= (file_ptr << REQ_F_SUPPORT_NOWAIT_BIT); |
5106dd6e | 1722 | io_req_set_rsrc_node(req, ctx, 0); |
d78bd8ad | 1723 | WARN_ON_ONCE(file && !test_bit(fd, ctx->file_table.bitmap)); |
5106dd6e | 1724 | out: |
93f052cb | 1725 | io_ring_submit_unlock(ctx, issue_flags); |
ac177053 PB |
1726 | return file; |
1727 | } | |
d44f554e | 1728 | |
531113bb | 1729 | struct file *io_file_get_normal(struct io_kiocb *req, int fd) |
ac177053 | 1730 | { |
62906e89 | 1731 | struct file *file = fget(fd); |
ac177053 | 1732 | |
48863ffd | 1733 | trace_io_uring_file_get(req, fd); |
09bb8394 | 1734 | |
ac177053 | 1735 | /* we don't allow fixed io_uring files */ |
e5550a14 | 1736 | if (file && io_is_uring_fops(file)) |
9cae36a0 | 1737 | io_req_track_inflight(req); |
8371adf5 | 1738 | return file; |
09bb8394 JA |
1739 | } |
1740 | ||
7bfa9bad | 1741 | static void io_queue_async(struct io_kiocb *req, int ret) |
d475a9a6 PB |
1742 | __must_hold(&req->ctx->uring_lock) |
1743 | { | |
7bfa9bad PB |
1744 | struct io_kiocb *linked_timeout; |
1745 | ||
1746 | if (ret != -EAGAIN || (req->flags & REQ_F_NOWAIT)) { | |
1747 | io_req_complete_failed(req, ret); | |
1748 | return; | |
1749 | } | |
1750 | ||
1751 | linked_timeout = io_prep_linked_timeout(req); | |
d475a9a6 | 1752 | |
4d9237e3 | 1753 | switch (io_arm_poll_handler(req, 0)) { |
d475a9a6 | 1754 | case IO_APOLL_READY: |
d475a9a6 PB |
1755 | io_req_task_queue(req); |
1756 | break; | |
1757 | case IO_APOLL_ABORTED: | |
1758 | /* | |
1759 | * Queued up for async execution, worker will release | |
1760 | * submit reference when the iocb is actually submitted. | |
1761 | */ | |
6436c770 | 1762 | io_kbuf_recycle(req, 0); |
77955efb | 1763 | io_queue_iowq(req, NULL); |
d475a9a6 | 1764 | break; |
b1c62645 | 1765 | case IO_APOLL_OK: |
b1c62645 | 1766 | break; |
d475a9a6 PB |
1767 | } |
1768 | ||
1769 | if (linked_timeout) | |
1770 | io_queue_linked_timeout(linked_timeout); | |
1771 | } | |
1772 | ||
cbc2e203 | 1773 | static inline void io_queue_sqe(struct io_kiocb *req) |
282cdc86 | 1774 | __must_hold(&req->ctx->uring_lock) |
2b188cc1 | 1775 | { |
e0c5c576 | 1776 | int ret; |
2b188cc1 | 1777 | |
c5eef2b9 | 1778 | ret = io_issue_sqe(req, IO_URING_F_NONBLOCK|IO_URING_F_COMPLETE_DEFER); |
193155c8 | 1779 | |
491381ce JA |
1780 | /* |
1781 | * We async punt it if the file wasn't marked NOWAIT, or if the file | |
1782 | * doesn't support non-blocking read/write attempts | |
1783 | */ | |
7bfa9bad | 1784 | if (likely(!ret)) |
cb2d344c | 1785 | io_arm_ltimeout(req); |
7bfa9bad PB |
1786 | else |
1787 | io_queue_async(req, ret); | |
2b188cc1 JA |
1788 | } |
1789 | ||
4652fe3f | 1790 | static void io_queue_sqe_fallback(struct io_kiocb *req) |
282cdc86 | 1791 | __must_hold(&req->ctx->uring_lock) |
4fe2c963 | 1792 | { |
17b147f6 PB |
1793 | if (unlikely(req->flags & REQ_F_FAIL)) { |
1794 | /* | |
1795 | * We don't submit, fail them all, for that replace hardlinks | |
1796 | * with normal links. Extra REQ_F_LINK is tolerated. | |
1797 | */ | |
1798 | req->flags &= ~REQ_F_HARDLINK; | |
1799 | req->flags |= REQ_F_LINK; | |
1800 | io_req_complete_failed(req, req->cqe.res); | |
e0eb71dc PB |
1801 | } else if (unlikely(req->ctx->drain_active)) { |
1802 | io_drain_req(req); | |
76cc33d7 PB |
1803 | } else { |
1804 | int ret = io_req_prep_async(req); | |
1805 | ||
1806 | if (unlikely(ret)) | |
1807 | io_req_complete_failed(req, ret); | |
1808 | else | |
77955efb | 1809 | io_queue_iowq(req, NULL); |
ce35a47a | 1810 | } |
4fe2c963 JL |
1811 | } |
1812 | ||
b16fed66 PB |
1813 | /* |
1814 | * Check SQE restrictions (opcode and flags). | |
1815 | * | |
1816 | * Returns 'true' if SQE is allowed, 'false' otherwise. | |
1817 | */ | |
1818 | static inline bool io_check_restriction(struct io_ring_ctx *ctx, | |
1819 | struct io_kiocb *req, | |
1820 | unsigned int sqe_flags) | |
4fe2c963 | 1821 | { |
b16fed66 PB |
1822 | if (!test_bit(req->opcode, ctx->restrictions.sqe_op)) |
1823 | return false; | |
1824 | ||
1825 | if ((sqe_flags & ctx->restrictions.sqe_flags_required) != | |
1826 | ctx->restrictions.sqe_flags_required) | |
1827 | return false; | |
1828 | ||
1829 | if (sqe_flags & ~(ctx->restrictions.sqe_flags_allowed | | |
1830 | ctx->restrictions.sqe_flags_required)) | |
1831 | return false; | |
1832 | ||
1833 | return true; | |
4fe2c963 JL |
1834 | } |
1835 | ||
22b2ca31 PB |
1836 | static void io_init_req_drain(struct io_kiocb *req) |
1837 | { | |
1838 | struct io_ring_ctx *ctx = req->ctx; | |
1839 | struct io_kiocb *head = ctx->submit_state.link.head; | |
1840 | ||
1841 | ctx->drain_active = true; | |
1842 | if (head) { | |
1843 | /* | |
1844 | * If we need to drain a request in the middle of a link, drain | |
1845 | * the head request and the next request/link after the current | |
1846 | * link. Considering sequential execution of links, | |
b6c7db32 | 1847 | * REQ_F_IO_DRAIN will be maintained for every request of our |
22b2ca31 PB |
1848 | * link. |
1849 | */ | |
b6c7db32 | 1850 | head->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC; |
22b2ca31 PB |
1851 | ctx->drain_next = true; |
1852 | } | |
1853 | } | |
1854 | ||
b16fed66 PB |
1855 | static int io_init_req(struct io_ring_ctx *ctx, struct io_kiocb *req, |
1856 | const struct io_uring_sqe *sqe) | |
282cdc86 | 1857 | __must_hold(&ctx->uring_lock) |
b16fed66 | 1858 | { |
fcde59fe | 1859 | const struct io_op_def *def; |
b16fed66 | 1860 | unsigned int sqe_flags; |
fc0ae024 | 1861 | int personality; |
4a04d1d1 | 1862 | u8 opcode; |
b16fed66 | 1863 | |
864ea921 | 1864 | /* req is partially pre-initialised, see io_preinit_req() */ |
4a04d1d1 | 1865 | req->opcode = opcode = READ_ONCE(sqe->opcode); |
b16fed66 PB |
1866 | /* same numerical values with corresponding REQ_F_*, safe to copy */ |
1867 | req->flags = sqe_flags = READ_ONCE(sqe->flags); | |
cef216fc | 1868 | req->cqe.user_data = READ_ONCE(sqe->user_data); |
b16fed66 | 1869 | req->file = NULL; |
c1bdf8ed | 1870 | req->rsrc_node = NULL; |
b16fed66 | 1871 | req->task = current; |
b16fed66 | 1872 | |
4a04d1d1 PB |
1873 | if (unlikely(opcode >= IORING_OP_LAST)) { |
1874 | req->opcode = 0; | |
b16fed66 | 1875 | return -EINVAL; |
4a04d1d1 | 1876 | } |
fcde59fe | 1877 | def = &io_op_defs[opcode]; |
68fe256a PB |
1878 | if (unlikely(sqe_flags & ~SQE_COMMON_FLAGS)) { |
1879 | /* enforce forwards compatibility on users */ | |
1880 | if (sqe_flags & ~SQE_VALID_FLAGS) | |
1881 | return -EINVAL; | |
4e906702 | 1882 | if (sqe_flags & IOSQE_BUFFER_SELECT) { |
fcde59fe | 1883 | if (!def->buffer_select) |
4e906702 JA |
1884 | return -EOPNOTSUPP; |
1885 | req->buf_index = READ_ONCE(sqe->buf_group); | |
1886 | } | |
5562a8d7 PB |
1887 | if (sqe_flags & IOSQE_CQE_SKIP_SUCCESS) |
1888 | ctx->drain_disabled = true; | |
1889 | if (sqe_flags & IOSQE_IO_DRAIN) { | |
1890 | if (ctx->drain_disabled) | |
1891 | return -EOPNOTSUPP; | |
22b2ca31 | 1892 | io_init_req_drain(req); |
5562a8d7 | 1893 | } |
2a56a9bd PB |
1894 | } |
1895 | if (unlikely(ctx->restricted || ctx->drain_active || ctx->drain_next)) { | |
1896 | if (ctx->restricted && !io_check_restriction(ctx, req, sqe_flags)) | |
1897 | return -EACCES; | |
1898 | /* knock it to the slow queue path, will be drained there */ | |
1899 | if (ctx->drain_active) | |
1900 | req->flags |= REQ_F_FORCE_ASYNC; | |
1901 | /* if there is no link, we're at "next" request and need to drain */ | |
1902 | if (unlikely(ctx->drain_next) && !ctx->submit_state.link.head) { | |
1903 | ctx->drain_next = false; | |
1904 | ctx->drain_active = true; | |
b6c7db32 | 1905 | req->flags |= REQ_F_IO_DRAIN | REQ_F_FORCE_ASYNC; |
2a56a9bd | 1906 | } |
68fe256a | 1907 | } |
b16fed66 | 1908 | |
fcde59fe | 1909 | if (!def->ioprio && sqe->ioprio) |
73911426 | 1910 | return -EINVAL; |
fcde59fe | 1911 | if (!def->iopoll && (ctx->flags & IORING_SETUP_IOPOLL)) |
73911426 JA |
1912 | return -EINVAL; |
1913 | ||
fcde59fe | 1914 | if (def->needs_file) { |
6d63416d PB |
1915 | struct io_submit_state *state = &ctx->submit_state; |
1916 | ||
cef216fc | 1917 | req->cqe.fd = READ_ONCE(sqe->fd); |
6bf9c47a | 1918 | |
6d63416d PB |
1919 | /* |
1920 | * Plug now if we have more than 2 IO left after this, and the | |
1921 | * target is potentially a read/write to block based storage. | |
1922 | */ | |
fcde59fe | 1923 | if (state->need_plug && def->plug) { |
6d63416d PB |
1924 | state->plug_started = true; |
1925 | state->need_plug = false; | |
5ca7a8b3 | 1926 | blk_start_plug_nr_ios(&state->plug, state->submit_nr); |
6d63416d | 1927 | } |
b16fed66 | 1928 | } |
863e0560 | 1929 | |
003e8dcc JA |
1930 | personality = READ_ONCE(sqe->personality); |
1931 | if (personality) { | |
cdab10bf LT |
1932 | int ret; |
1933 | ||
c10d1f98 PB |
1934 | req->creds = xa_load(&ctx->personalities, personality); |
1935 | if (!req->creds) | |
003e8dcc | 1936 | return -EINVAL; |
c10d1f98 | 1937 | get_cred(req->creds); |
cdc1404a PM |
1938 | ret = security_uring_override_creds(req->creds); |
1939 | if (ret) { | |
1940 | put_cred(req->creds); | |
1941 | return ret; | |
1942 | } | |
b8e64b53 | 1943 | req->flags |= REQ_F_CREDS; |
003e8dcc | 1944 | } |
b16fed66 | 1945 | |
0702e536 | 1946 | return def->prep(req, sqe); |
b16fed66 PB |
1947 | } |
1948 | ||
df3becde PB |
1949 | static __cold int io_submit_fail_init(const struct io_uring_sqe *sqe, |
1950 | struct io_kiocb *req, int ret) | |
1951 | { | |
1952 | struct io_ring_ctx *ctx = req->ctx; | |
1953 | struct io_submit_link *link = &ctx->submit_state.link; | |
1954 | struct io_kiocb *head = link->head; | |
1955 | ||
48863ffd | 1956 | trace_io_uring_req_failed(sqe, req, ret); |
df3becde PB |
1957 | |
1958 | /* | |
1959 | * Avoid breaking links in the middle as it renders links with SQPOLL | |
1960 | * unusable. Instead of failing eagerly, continue assembling the link if | |
1961 | * applicable and mark the head with REQ_F_FAIL. The link flushing code | |
1962 | * should find the flag and handle the rest. | |
1963 | */ | |
1964 | req_fail_link_node(req, ret); | |
1965 | if (head && !(head->flags & REQ_F_FAIL)) | |
1966 | req_fail_link_node(head, -ECANCELED); | |
1967 | ||
1968 | if (!(req->flags & IO_REQ_LINK_FLAGS)) { | |
1969 | if (head) { | |
1970 | link->last->link = req; | |
1971 | link->head = NULL; | |
1972 | req = head; | |
1973 | } | |
1974 | io_queue_sqe_fallback(req); | |
1975 | return ret; | |
1976 | } | |
1977 | ||
1978 | if (head) | |
1979 | link->last->link = req; | |
1980 | else | |
1981 | link->head = req; | |
1982 | link->last = req; | |
1983 | return 0; | |
1984 | } | |
1985 | ||
1986 | static inline int io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req, | |
a1ab7b35 | 1987 | const struct io_uring_sqe *sqe) |
282cdc86 | 1988 | __must_hold(&ctx->uring_lock) |
9e645e11 | 1989 | { |
a1ab7b35 | 1990 | struct io_submit_link *link = &ctx->submit_state.link; |
ef4ff581 | 1991 | int ret; |
9e645e11 | 1992 | |
a6b8cadc | 1993 | ret = io_init_req(ctx, req, sqe); |
df3becde PB |
1994 | if (unlikely(ret)) |
1995 | return io_submit_fail_init(sqe, req, ret); | |
441b8a78 | 1996 | |
be7053b7 | 1997 | /* don't need @sqe from now on */ |
48863ffd | 1998 | trace_io_uring_submit_sqe(req, true); |
a6b8cadc | 1999 | |
9e645e11 JA |
2000 | /* |
2001 | * If we already have a head request, queue this one for async | |
2002 | * submittal once the head completes. If we don't have a head but | |
2003 | * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be | |
2004 | * submitted sync once the chain is complete. If none of those | |
2005 | * conditions are true (normal request), then just queue it. | |
2006 | */ | |
924a07e4 | 2007 | if (unlikely(link->head)) { |
df3becde PB |
2008 | ret = io_req_prep_async(req); |
2009 | if (unlikely(ret)) | |
2010 | return io_submit_fail_init(sqe, req, ret); | |
2011 | ||
48863ffd | 2012 | trace_io_uring_link(req, link->head); |
f2f87370 | 2013 | link->last->link = req; |
863e0560 | 2014 | link->last = req; |
32fe525b | 2015 | |
da1a08c5 | 2016 | if (req->flags & IO_REQ_LINK_FLAGS) |
f15a3431 | 2017 | return 0; |
df3becde PB |
2018 | /* last request of the link, flush it */ |
2019 | req = link->head; | |
f15a3431 | 2020 | link->head = NULL; |
924a07e4 PB |
2021 | if (req->flags & (REQ_F_FORCE_ASYNC | REQ_F_FAIL)) |
2022 | goto fallback; | |
2023 | ||
2024 | } else if (unlikely(req->flags & (IO_REQ_LINK_FLAGS | | |
2025 | REQ_F_FORCE_ASYNC | REQ_F_FAIL))) { | |
2026 | if (req->flags & IO_REQ_LINK_FLAGS) { | |
2027 | link->head = req; | |
2028 | link->last = req; | |
2029 | } else { | |
2030 | fallback: | |
2031 | io_queue_sqe_fallback(req); | |
2032 | } | |
f15a3431 | 2033 | return 0; |
9e645e11 | 2034 | } |
2e6e1fde | 2035 | |
f15a3431 | 2036 | io_queue_sqe(req); |
1d4240cc | 2037 | return 0; |
9e645e11 JA |
2038 | } |
2039 | ||
9a56a232 JA |
2040 | /* |
2041 | * Batched submission is done, ensure local IO is flushed out. | |
2042 | */ | |
553deffd | 2043 | static void io_submit_state_end(struct io_ring_ctx *ctx) |
9a56a232 | 2044 | { |
553deffd PB |
2045 | struct io_submit_state *state = &ctx->submit_state; |
2046 | ||
e126391c PB |
2047 | if (unlikely(state->link.head)) |
2048 | io_queue_sqe_fallback(state->link.head); | |
553deffd | 2049 | /* flush only after queuing links as they can generate completions */ |
c450178d | 2050 | io_submit_flush_completions(ctx); |
27926b68 JA |
2051 | if (state->plug_started) |
2052 | blk_finish_plug(&state->plug); | |
9a56a232 JA |
2053 | } |
2054 | ||
2055 | /* | |
2056 | * Start submission side cache. | |
2057 | */ | |
2058 | static void io_submit_state_start(struct io_submit_state *state, | |
ba88ff11 | 2059 | unsigned int max_ios) |
9a56a232 | 2060 | { |
27926b68 | 2061 | state->plug_started = false; |
4b628aeb | 2062 | state->need_plug = max_ios > 2; |
5ca7a8b3 | 2063 | state->submit_nr = max_ios; |
a1ab7b35 PB |
2064 | /* set only head, no need to init link_last in advance */ |
2065 | state->link.head = NULL; | |
9a56a232 JA |
2066 | } |
2067 | ||
2b188cc1 JA |
2068 | static void io_commit_sqring(struct io_ring_ctx *ctx) |
2069 | { | |
75b28aff | 2070 | struct io_rings *rings = ctx->rings; |
2b188cc1 | 2071 | |
caf582c6 PB |
2072 | /* |
2073 | * Ensure any loads from the SQEs are done at this point, | |
2074 | * since once we write the new head, the application could | |
2075 | * write new data to them. | |
2076 | */ | |
2077 | smp_store_release(&rings->sq.head, ctx->cached_sq_head); | |
2b188cc1 JA |
2078 | } |
2079 | ||
2b188cc1 | 2080 | /* |
dd9ae8a0 | 2081 | * Fetch an sqe, if one is available. Note this returns a pointer to memory |
2b188cc1 JA |
2082 | * that is mapped by userspace. This means that care needs to be taken to |
2083 | * ensure that reads are stable, as we cannot rely on userspace always | |
2084 | * being a good citizen. If members of the sqe are validated and then later | |
2085 | * used, it's important that those reads are done through READ_ONCE() to | |
2086 | * prevent a re-load down the line. | |
2087 | */ | |
709b302f | 2088 | static const struct io_uring_sqe *io_get_sqe(struct io_ring_ctx *ctx) |
2b188cc1 | 2089 | { |
ea5ab3b5 | 2090 | unsigned head, mask = ctx->sq_entries - 1; |
17d3aeb3 | 2091 | unsigned sq_idx = ctx->cached_sq_head++ & mask; |
2b188cc1 JA |
2092 | |
2093 | /* | |
2094 | * The cached sq head (or cq tail) serves two purposes: | |
2095 | * | |
2096 | * 1) allows us to batch the cost of updating the user visible | |
2097 | * head updates. | |
2098 | * 2) allows the kernel side to track the head on its own, even | |
2099 | * though the application is the one updating it. | |
2100 | */ | |
17d3aeb3 | 2101 | head = READ_ONCE(ctx->sq_array[sq_idx]); |
ebdeb7c0 JA |
2102 | if (likely(head < ctx->sq_entries)) { |
2103 | /* double index for 128-byte SQEs, twice as long */ | |
2104 | if (ctx->flags & IORING_SETUP_SQE128) | |
2105 | head <<= 1; | |
709b302f | 2106 | return &ctx->sq_sqes[head]; |
ebdeb7c0 | 2107 | } |
2b188cc1 JA |
2108 | |
2109 | /* drop invalid entries */ | |
15641e42 PB |
2110 | ctx->cq_extra--; |
2111 | WRITE_ONCE(ctx->rings->sq_dropped, | |
2112 | READ_ONCE(ctx->rings->sq_dropped) + 1); | |
709b302f PB |
2113 | return NULL; |
2114 | } | |
2115 | ||
17437f31 | 2116 | int io_submit_sqes(struct io_ring_ctx *ctx, unsigned int nr) |
282cdc86 | 2117 | __must_hold(&ctx->uring_lock) |
6c271ce2 | 2118 | { |
69629809 | 2119 | unsigned int entries = io_sqring_entries(ctx); |
8e6971a8 PB |
2120 | unsigned int left; |
2121 | int ret; | |
6c271ce2 | 2122 | |
51d48dab | 2123 | if (unlikely(!entries)) |
69629809 | 2124 | return 0; |
ee7d46d9 | 2125 | /* make sure SQ entry isn't read before tail */ |
8e6971a8 PB |
2126 | ret = left = min3(nr, ctx->sq_entries, entries); |
2127 | io_get_task_refs(left); | |
2128 | io_submit_state_start(&ctx->submit_state, left); | |
6c271ce2 | 2129 | |
69629809 | 2130 | do { |
3529d8c2 | 2131 | const struct io_uring_sqe *sqe; |
196be95c | 2132 | struct io_kiocb *req; |
fb5ccc98 | 2133 | |
8e6971a8 | 2134 | if (unlikely(!io_alloc_req_refill(ctx))) |
fb5ccc98 | 2135 | break; |
a33ae9ce | 2136 | req = io_alloc_req(ctx); |
4fccfcbb PB |
2137 | sqe = io_get_sqe(ctx); |
2138 | if (unlikely(!sqe)) { | |
fa05457a | 2139 | io_req_add_to_cache(req, ctx); |
4fccfcbb PB |
2140 | break; |
2141 | } | |
6c271ce2 | 2142 | |
1cd15904 PB |
2143 | /* |
2144 | * Continue submitting even for sqe failure if the | |
2145 | * ring was setup with IORING_SETUP_SUBMIT_ALL | |
2146 | */ | |
2147 | if (unlikely(io_submit_sqe(ctx, req, sqe)) && | |
2148 | !(ctx->flags & IORING_SETUP_SUBMIT_ALL)) { | |
2149 | left--; | |
2150 | break; | |
bcbb7bf6 | 2151 | } |
1cd15904 | 2152 | } while (--left); |
9466f437 | 2153 | |
8e6971a8 PB |
2154 | if (unlikely(left)) { |
2155 | ret -= left; | |
2156 | /* try again if it submitted nothing and can't allocate a req */ | |
2157 | if (!ret && io_req_cache_empty(ctx)) | |
2158 | ret = -EAGAIN; | |
2159 | current->io_uring->cached_refs += left; | |
9466f437 | 2160 | } |
6c271ce2 | 2161 | |
553deffd | 2162 | io_submit_state_end(ctx); |
ae9428ca PB |
2163 | /* Commit SQ ring head once we've consumed and submitted all SQEs */ |
2164 | io_commit_sqring(ctx); | |
8e6971a8 | 2165 | return ret; |
6c271ce2 JA |
2166 | } |
2167 | ||
bda52162 JA |
2168 | struct io_wait_queue { |
2169 | struct wait_queue_entry wq; | |
2170 | struct io_ring_ctx *ctx; | |
5fd46178 | 2171 | unsigned cq_tail; |
bda52162 JA |
2172 | unsigned nr_timeouts; |
2173 | }; | |
2174 | ||
6c503150 | 2175 | static inline bool io_should_wake(struct io_wait_queue *iowq) |
bda52162 JA |
2176 | { |
2177 | struct io_ring_ctx *ctx = iowq->ctx; | |
5fd46178 | 2178 | int dist = ctx->cached_cq_tail - (int) iowq->cq_tail; |
bda52162 JA |
2179 | |
2180 | /* | |
d195a66e | 2181 | * Wake up if we have enough events, or if a timeout occurred since we |
bda52162 JA |
2182 | * started waiting. For timeouts, we always want to return to userspace, |
2183 | * regardless of event count. | |
2184 | */ | |
5fd46178 | 2185 | return dist >= 0 || atomic_read(&ctx->cq_timeouts) != iowq->nr_timeouts; |
bda52162 JA |
2186 | } |
2187 | ||
2188 | static int io_wake_function(struct wait_queue_entry *curr, unsigned int mode, | |
2189 | int wake_flags, void *key) | |
2190 | { | |
2191 | struct io_wait_queue *iowq = container_of(curr, struct io_wait_queue, | |
2192 | wq); | |
2193 | ||
6c503150 PB |
2194 | /* |
2195 | * Cannot safely flush overflowed CQEs from here, ensure we wake up | |
2196 | * the task, and the next invocation will do it. | |
2197 | */ | |
10988a0a DY |
2198 | if (io_should_wake(iowq) || |
2199 | test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &iowq->ctx->check_cq)) | |
6c503150 PB |
2200 | return autoremove_wake_function(curr, mode, wake_flags, key); |
2201 | return -1; | |
bda52162 JA |
2202 | } |
2203 | ||
73572984 | 2204 | int io_run_task_work_sig(void) |
af9c1a44 JA |
2205 | { |
2206 | if (io_run_task_work()) | |
2207 | return 1; | |
c5020bc8 OL |
2208 | if (task_sigpending(current)) |
2209 | return -EINTR; | |
2210 | return 0; | |
af9c1a44 JA |
2211 | } |
2212 | ||
eeb60b9a PB |
2213 | /* when returns >0, the caller should retry */ |
2214 | static inline int io_cqring_wait_schedule(struct io_ring_ctx *ctx, | |
2215 | struct io_wait_queue *iowq, | |
22833966 | 2216 | ktime_t timeout) |
eeb60b9a PB |
2217 | { |
2218 | int ret; | |
155bc950 | 2219 | unsigned long check_cq; |
eeb60b9a PB |
2220 | |
2221 | /* make sure we run task_work before checking for signals */ | |
2222 | ret = io_run_task_work_sig(); | |
2223 | if (ret || io_should_wake(iowq)) | |
2224 | return ret; | |
3a08576b | 2225 | |
155bc950 | 2226 | check_cq = READ_ONCE(ctx->check_cq); |
3a08576b PB |
2227 | if (unlikely(check_cq)) { |
2228 | /* let the caller flush overflows, retry */ | |
2229 | if (check_cq & BIT(IO_CHECK_CQ_OVERFLOW_BIT)) | |
2230 | return 1; | |
2231 | if (check_cq & BIT(IO_CHECK_CQ_DROPPED_BIT)) | |
2232 | return -EBADR; | |
2233 | } | |
22833966 JA |
2234 | if (!schedule_hrtimeout(&timeout, HRTIMER_MODE_ABS)) |
2235 | return -ETIME; | |
2236 | return 1; | |
eeb60b9a PB |
2237 | } |
2238 | ||
2b188cc1 JA |
2239 | /* |
2240 | * Wait until events become available, if we don't already have some. The | |
2241 | * application must reap them itself, as they reside on the shared cq ring. | |
2242 | */ | |
2243 | static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events, | |
c73ebb68 HX |
2244 | const sigset_t __user *sig, size_t sigsz, |
2245 | struct __kernel_timespec __user *uts) | |
2b188cc1 | 2246 | { |
90291099 | 2247 | struct io_wait_queue iowq; |
75b28aff | 2248 | struct io_rings *rings = ctx->rings; |
22833966 | 2249 | ktime_t timeout = KTIME_MAX; |
c1d5a224 | 2250 | int ret; |
2b188cc1 | 2251 | |
b41e9852 | 2252 | do { |
90f67366 | 2253 | io_cqring_overflow_flush(ctx); |
6c503150 | 2254 | if (io_cqring_events(ctx) >= min_events) |
b41e9852 | 2255 | return 0; |
4c6e277c | 2256 | if (!io_run_task_work()) |
b41e9852 | 2257 | break; |
b41e9852 | 2258 | } while (1); |
2b188cc1 JA |
2259 | |
2260 | if (sig) { | |
9e75ad5d AB |
2261 | #ifdef CONFIG_COMPAT |
2262 | if (in_compat_syscall()) | |
2263 | ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig, | |
b772434b | 2264 | sigsz); |
9e75ad5d AB |
2265 | else |
2266 | #endif | |
b772434b | 2267 | ret = set_user_sigmask(sig, sigsz); |
9e75ad5d | 2268 | |
2b188cc1 JA |
2269 | if (ret) |
2270 | return ret; | |
2271 | } | |
2272 | ||
950e79dd OL |
2273 | if (uts) { |
2274 | struct timespec64 ts; | |
2275 | ||
2276 | if (get_timespec64(&ts, uts)) | |
2277 | return -EFAULT; | |
2278 | timeout = ktime_add_ns(timespec64_to_ktime(ts), ktime_get_ns()); | |
2279 | } | |
2280 | ||
90291099 PB |
2281 | init_waitqueue_func_entry(&iowq.wq, io_wake_function); |
2282 | iowq.wq.private = current; | |
2283 | INIT_LIST_HEAD(&iowq.wq.entry); | |
2284 | iowq.ctx = ctx; | |
bda52162 | 2285 | iowq.nr_timeouts = atomic_read(&ctx->cq_timeouts); |
5fd46178 | 2286 | iowq.cq_tail = READ_ONCE(ctx->rings->cq.head) + min_events; |
90291099 | 2287 | |
c826bd7a | 2288 | trace_io_uring_cqring_wait(ctx, min_events); |
bda52162 | 2289 | do { |
ca0a2651 | 2290 | /* if we can't even flush overflow, don't wait for more */ |
90f67366 | 2291 | if (!io_cqring_overflow_flush(ctx)) { |
ca0a2651 JA |
2292 | ret = -EBUSY; |
2293 | break; | |
2294 | } | |
311997b3 | 2295 | prepare_to_wait_exclusive(&ctx->cq_wait, &iowq.wq, |
bda52162 | 2296 | TASK_INTERRUPTIBLE); |
22833966 | 2297 | ret = io_cqring_wait_schedule(ctx, &iowq, timeout); |
ca0a2651 | 2298 | cond_resched(); |
eeb60b9a | 2299 | } while (ret > 0); |
bda52162 | 2300 | |
b4f20bb4 | 2301 | finish_wait(&ctx->cq_wait, &iowq.wq); |
b7db41c9 | 2302 | restore_saved_sigmask_unless(ret == -EINTR); |
2b188cc1 | 2303 | |
75b28aff | 2304 | return READ_ONCE(rings->cq.head) == READ_ONCE(rings->cq.tail) ? ret : 0; |
2b188cc1 JA |
2305 | } |
2306 | ||
73572984 | 2307 | static void io_mem_free(void *ptr) |
b9bd2bea | 2308 | { |
73572984 | 2309 | struct page *page; |
b36a2050 | 2310 | |
73572984 JA |
2311 | if (!ptr) |
2312 | return; | |
b9bd2bea | 2313 | |
73572984 JA |
2314 | page = virt_to_head_page(ptr); |
2315 | if (put_page_testzero(page)) | |
2316 | free_compound_page(page); | |
b9bd2bea PB |
2317 | } |
2318 | ||
73572984 | 2319 | static void *io_mem_alloc(size_t size) |
b9bd2bea | 2320 | { |
73572984 | 2321 | gfp_t gfp = GFP_KERNEL_ACCOUNT | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP; |
b9bd2bea | 2322 | |
73572984 | 2323 | return (void *) __get_free_pages(gfp, get_order(size)); |
b9bd2bea PB |
2324 | } |
2325 | ||
73572984 JA |
2326 | static unsigned long rings_size(struct io_ring_ctx *ctx, unsigned int sq_entries, |
2327 | unsigned int cq_entries, size_t *sq_offset) | |
6b06314c | 2328 | { |
73572984 JA |
2329 | struct io_rings *rings; |
2330 | size_t off, sq_array_size; | |
6b06314c | 2331 | |
73572984 JA |
2332 | off = struct_size(rings, cqes, cq_entries); |
2333 | if (off == SIZE_MAX) | |
2334 | return SIZE_MAX; | |
2335 | if (ctx->flags & IORING_SETUP_CQE32) { | |
2336 | if (check_shl_overflow(off, 1, &off)) | |
2337 | return SIZE_MAX; | |
2338 | } | |
ab409402 | 2339 | |
73572984 JA |
2340 | #ifdef CONFIG_SMP |
2341 | off = ALIGN(off, SMP_CACHE_BYTES); | |
2342 | if (off == 0) | |
2343 | return SIZE_MAX; | |
2344 | #endif | |
82fbcfa9 | 2345 | |
73572984 JA |
2346 | if (sq_offset) |
2347 | *sq_offset = off; | |
82fbcfa9 | 2348 | |
73572984 JA |
2349 | sq_array_size = array_size(sizeof(u32), sq_entries); |
2350 | if (sq_array_size == SIZE_MAX) | |
2351 | return SIZE_MAX; | |
6b06314c | 2352 | |
73572984 JA |
2353 | if (check_add_overflow(off, sq_array_size, &off)) |
2354 | return SIZE_MAX; | |
8bad28d8 | 2355 | |
73572984 | 2356 | return off; |
8bad28d8 HX |
2357 | } |
2358 | ||
73572984 JA |
2359 | static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg, |
2360 | unsigned int eventfd_async) | |
8bad28d8 | 2361 | { |
73572984 JA |
2362 | struct io_ev_fd *ev_fd; |
2363 | __s32 __user *fds = arg; | |
2364 | int fd; | |
f2303b1f | 2365 | |
73572984 JA |
2366 | ev_fd = rcu_dereference_protected(ctx->io_ev_fd, |
2367 | lockdep_is_held(&ctx->uring_lock)); | |
2368 | if (ev_fd) | |
2369 | return -EBUSY; | |
8bad28d8 | 2370 | |
73572984 JA |
2371 | if (copy_from_user(&fd, fds, sizeof(*fds))) |
2372 | return -EFAULT; | |
8dd03afe | 2373 | |
73572984 JA |
2374 | ev_fd = kmalloc(sizeof(*ev_fd), GFP_KERNEL); |
2375 | if (!ev_fd) | |
2376 | return -ENOMEM; | |
05f3fb3c | 2377 | |
73572984 JA |
2378 | ev_fd->cq_ev_fd = eventfd_ctx_fdget(fd); |
2379 | if (IS_ERR(ev_fd->cq_ev_fd)) { | |
2380 | int ret = PTR_ERR(ev_fd->cq_ev_fd); | |
2381 | kfree(ev_fd); | |
2382 | return ret; | |
2383 | } | |
305bef98 PB |
2384 | |
2385 | spin_lock(&ctx->completion_lock); | |
2386 | ctx->evfd_last_cq_tail = ctx->cached_cq_tail; | |
2387 | spin_unlock(&ctx->completion_lock); | |
2388 | ||
73572984 JA |
2389 | ev_fd->eventfd_async = eventfd_async; |
2390 | ctx->has_evfd = true; | |
2391 | rcu_assign_pointer(ctx->io_ev_fd, ev_fd); | |
2392 | return 0; | |
d7954b2b BM |
2393 | } |
2394 | ||
73572984 | 2395 | static void io_eventfd_put(struct rcu_head *rcu) |
2d091d62 | 2396 | { |
73572984 | 2397 | struct io_ev_fd *ev_fd = container_of(rcu, struct io_ev_fd, rcu); |
2d091d62 | 2398 | |
73572984 JA |
2399 | eventfd_ctx_put(ev_fd->cq_ev_fd); |
2400 | kfree(ev_fd); | |
2d091d62 PB |
2401 | } |
2402 | ||
73572984 | 2403 | static int io_eventfd_unregister(struct io_ring_ctx *ctx) |
1ad555c6 | 2404 | { |
73572984 JA |
2405 | struct io_ev_fd *ev_fd; |
2406 | ||
2407 | ev_fd = rcu_dereference_protected(ctx->io_ev_fd, | |
2408 | lockdep_is_held(&ctx->uring_lock)); | |
2409 | if (ev_fd) { | |
2410 | ctx->has_evfd = false; | |
2411 | rcu_assign_pointer(ctx->io_ev_fd, NULL); | |
2412 | call_rcu(&ev_fd->rcu, io_eventfd_put); | |
2413 | return 0; | |
2414 | } | |
2d091d62 | 2415 | |
73572984 | 2416 | return -ENXIO; |
44b31f2f PB |
2417 | } |
2418 | ||
73572984 | 2419 | static void io_req_caches_free(struct io_ring_ctx *ctx) |
2b188cc1 | 2420 | { |
cd0ca2e0 | 2421 | struct io_submit_state *state = &ctx->submit_state; |
37f0e767 | 2422 | int nr = 0; |
bf019da7 | 2423 | |
9a4fdbd8 | 2424 | mutex_lock(&ctx->uring_lock); |
cd0ca2e0 | 2425 | io_flush_cached_locked_reqs(ctx, state); |
9a4fdbd8 | 2426 | |
88ab95be | 2427 | while (!io_req_cache_empty(ctx)) { |
c2b6c6bc PB |
2428 | struct io_wq_work_node *node; |
2429 | struct io_kiocb *req; | |
9a4fdbd8 | 2430 | |
c2b6c6bc PB |
2431 | node = wq_stack_extract(&state->free_list); |
2432 | req = container_of(node, struct io_kiocb, comp_list); | |
2433 | kmem_cache_free(req_cachep, req); | |
37f0e767 | 2434 | nr++; |
c2b6c6bc | 2435 | } |
37f0e767 PB |
2436 | if (nr) |
2437 | percpu_ref_put_many(&ctx->refs, nr); | |
9a4fdbd8 JA |
2438 | mutex_unlock(&ctx->uring_lock); |
2439 | } | |
2440 | ||
4d9237e3 JA |
2441 | static void io_flush_apoll_cache(struct io_ring_ctx *ctx) |
2442 | { | |
2443 | struct async_poll *apoll; | |
2444 | ||
2445 | while (!list_empty(&ctx->apoll_cache)) { | |
2446 | apoll = list_first_entry(&ctx->apoll_cache, struct async_poll, | |
2447 | poll.wait.entry); | |
2448 | list_del(&apoll->poll.wait.entry); | |
2449 | kfree(apoll); | |
2450 | } | |
2451 | } | |
2452 | ||
c072481d | 2453 | static __cold void io_ring_ctx_free(struct io_ring_ctx *ctx) |
2b188cc1 | 2454 | { |
37d1e2e3 | 2455 | io_sq_thread_finish(ctx); |
2aede0e4 | 2456 | |
37d1e2e3 | 2457 | if (ctx->mm_account) { |
2aede0e4 JA |
2458 | mmdrop(ctx->mm_account); |
2459 | ctx->mm_account = NULL; | |
30975825 | 2460 | } |
def596e9 | 2461 | |
ab409402 | 2462 | io_rsrc_refs_drop(ctx); |
43597aac PB |
2463 | /* __io_rsrc_put_work() may need uring_lock to progress, wait w/o it */ |
2464 | io_wait_rsrc_data(ctx->buf_data); | |
2465 | io_wait_rsrc_data(ctx->file_data); | |
2466 | ||
8bad28d8 | 2467 | mutex_lock(&ctx->uring_lock); |
43597aac | 2468 | if (ctx->buf_data) |
bd54b6fe | 2469 | __io_sqe_buffers_unregister(ctx); |
43597aac | 2470 | if (ctx->file_data) |
08480400 | 2471 | __io_sqe_files_unregister(ctx); |
c4ea060e PB |
2472 | if (ctx->rings) |
2473 | __io_cqring_overflow_flush(ctx, true); | |
9b402849 | 2474 | io_eventfd_unregister(ctx); |
4d9237e3 | 2475 | io_flush_apoll_cache(ctx); |
77bc59b4 | 2476 | mutex_unlock(&ctx->uring_lock); |
5a2e745d | 2477 | io_destroy_buffers(ctx); |
07db298a PB |
2478 | if (ctx->sq_creds) |
2479 | put_cred(ctx->sq_creds); | |
97bbdc06 PB |
2480 | if (ctx->submitter_task) |
2481 | put_task_struct(ctx->submitter_task); | |
def596e9 | 2482 | |
a7f0ed5a PB |
2483 | /* there are no registered resources left, nobody uses it */ |
2484 | if (ctx->rsrc_node) | |
2485 | io_rsrc_node_destroy(ctx->rsrc_node); | |
8dd03afe | 2486 | if (ctx->rsrc_backup_node) |
b895c9a6 | 2487 | io_rsrc_node_destroy(ctx->rsrc_backup_node); |
a7f0ed5a | 2488 | flush_delayed_work(&ctx->rsrc_put_work); |
756ab7c0 | 2489 | flush_delayed_work(&ctx->fallback_work); |
a7f0ed5a PB |
2490 | |
2491 | WARN_ON_ONCE(!list_empty(&ctx->rsrc_ref_list)); | |
2492 | WARN_ON_ONCE(!llist_empty(&ctx->rsrc_put_llist)); | |
def596e9 | 2493 | |
2b188cc1 | 2494 | #if defined(CONFIG_UNIX) |
355e8d26 EB |
2495 | if (ctx->ring_sock) { |
2496 | ctx->ring_sock->file = NULL; /* so that iput() is called */ | |
2b188cc1 | 2497 | sock_release(ctx->ring_sock); |
355e8d26 | 2498 | } |
2b188cc1 | 2499 | #endif |
ef9dd637 | 2500 | WARN_ON_ONCE(!list_empty(&ctx->ltimeout_list)); |
2b188cc1 | 2501 | |
75b28aff | 2502 | io_mem_free(ctx->rings); |
2b188cc1 | 2503 | io_mem_free(ctx->sq_sqes); |
2b188cc1 JA |
2504 | |
2505 | percpu_ref_exit(&ctx->refs); | |
2b188cc1 | 2506 | free_uid(ctx->user); |
4010fec4 | 2507 | io_req_caches_free(ctx); |
e941894e JA |
2508 | if (ctx->hash_map) |
2509 | io_wq_put_hash(ctx->hash_map); | |
e6f89be6 | 2510 | kfree(ctx->cancel_table.hbs); |
9ca9fb24 | 2511 | kfree(ctx->cancel_table_locked.hbs); |
6224843d | 2512 | kfree(ctx->dummy_ubuf); |
9cfc7e94 JA |
2513 | kfree(ctx->io_bl); |
2514 | xa_destroy(&ctx->io_bl_xa); | |
2b188cc1 JA |
2515 | kfree(ctx); |
2516 | } | |
2517 | ||
2518 | static __poll_t io_uring_poll(struct file *file, poll_table *wait) | |
2519 | { | |
2520 | struct io_ring_ctx *ctx = file->private_data; | |
2521 | __poll_t mask = 0; | |
2522 | ||
d60aa65b | 2523 | poll_wait(file, &ctx->cq_wait, wait); |
4f7067c3 SB |
2524 | /* |
2525 | * synchronizes with barrier from wq_has_sleeper call in | |
2526 | * io_commit_cqring | |
2527 | */ | |
2b188cc1 | 2528 | smp_rmb(); |
90554200 | 2529 | if (!io_sqring_full(ctx)) |
2b188cc1 | 2530 | mask |= EPOLLOUT | EPOLLWRNORM; |
ed670c3f HX |
2531 | |
2532 | /* | |
2533 | * Don't flush cqring overflow list here, just do a simple check. | |
2534 | * Otherwise there could possible be ABBA deadlock: | |
2535 | * CPU0 CPU1 | |
2536 | * ---- ---- | |
2537 | * lock(&ctx->uring_lock); | |
2538 | * lock(&ep->mtx); | |
2539 | * lock(&ctx->uring_lock); | |
2540 | * lock(&ep->mtx); | |
2541 | * | |
2542 | * Users may get EPOLLIN meanwhile seeing nothing in cqring, this | |
2543 | * pushs them to do the flush. | |
2544 | */ | |
10988a0a DY |
2545 | if (io_cqring_events(ctx) || |
2546 | test_bit(IO_CHECK_CQ_OVERFLOW_BIT, &ctx->check_cq)) | |
2b188cc1 JA |
2547 | mask |= EPOLLIN | EPOLLRDNORM; |
2548 | ||
2549 | return mask; | |
2550 | } | |
2551 | ||
0bead8cd | 2552 | static int io_unregister_personality(struct io_ring_ctx *ctx, unsigned id) |
071698e1 | 2553 | { |
4379bf8b | 2554 | const struct cred *creds; |
071698e1 | 2555 | |
61cf9370 | 2556 | creds = xa_erase(&ctx->personalities, id); |
4379bf8b JA |
2557 | if (creds) { |
2558 | put_cred(creds); | |
0bead8cd | 2559 | return 0; |
1e6fa521 | 2560 | } |
0bead8cd YD |
2561 | |
2562 | return -EINVAL; | |
2563 | } | |
2564 | ||
d56d938b PB |
2565 | struct io_tctx_exit { |
2566 | struct callback_head task_work; | |
2567 | struct completion completion; | |
baf186c4 | 2568 | struct io_ring_ctx *ctx; |
d56d938b PB |
2569 | }; |
2570 | ||
c072481d | 2571 | static __cold void io_tctx_exit_cb(struct callback_head *cb) |
d56d938b PB |
2572 | { |
2573 | struct io_uring_task *tctx = current->io_uring; | |
2574 | struct io_tctx_exit *work; | |
2575 | ||
2576 | work = container_of(cb, struct io_tctx_exit, task_work); | |
2577 | /* | |
2578 | * When @in_idle, we're in cancellation and it's racy to remove the | |
2579 | * node. It'll be removed by the end of cancellation, just ignore it. | |
2580 | */ | |
2581 | if (!atomic_read(&tctx->in_idle)) | |
eef51daa | 2582 | io_uring_del_tctx_node((unsigned long)work->ctx); |
d56d938b PB |
2583 | complete(&work->completion); |
2584 | } | |
2585 | ||
c072481d | 2586 | static __cold bool io_cancel_ctx_cb(struct io_wq_work *work, void *data) |
28090c13 PB |
2587 | { |
2588 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); | |
2589 | ||
2590 | return req->ctx == data; | |
2591 | } | |
2592 | ||
c072481d | 2593 | static __cold void io_ring_exit_work(struct work_struct *work) |
85faa7b8 | 2594 | { |
d56d938b | 2595 | struct io_ring_ctx *ctx = container_of(work, struct io_ring_ctx, exit_work); |
b5bb3a24 | 2596 | unsigned long timeout = jiffies + HZ * 60 * 5; |
58d3be2c | 2597 | unsigned long interval = HZ / 20; |
d56d938b PB |
2598 | struct io_tctx_exit exit; |
2599 | struct io_tctx_node *node; | |
2600 | int ret; | |
85faa7b8 | 2601 | |
56952e91 JA |
2602 | /* |
2603 | * If we're doing polled IO and end up having requests being | |
2604 | * submitted async (out-of-line), then completions can come in while | |
2605 | * we're waiting for refs to drop. We need to reap these manually, | |
2606 | * as nobody else will be looking for them. | |
2607 | */ | |
b2edc0a7 | 2608 | do { |
affa87db PB |
2609 | while (io_uring_try_cancel_requests(ctx, NULL, true)) |
2610 | cond_resched(); | |
2611 | ||
28090c13 PB |
2612 | if (ctx->sq_data) { |
2613 | struct io_sq_data *sqd = ctx->sq_data; | |
2614 | struct task_struct *tsk; | |
2615 | ||
2616 | io_sq_thread_park(sqd); | |
2617 | tsk = sqd->thread; | |
2618 | if (tsk && tsk->io_uring && tsk->io_uring->io_wq) | |
2619 | io_wq_cancel_cb(tsk->io_uring->io_wq, | |
2620 | io_cancel_ctx_cb, ctx, true); | |
2621 | io_sq_thread_unpark(sqd); | |
2622 | } | |
b5bb3a24 | 2623 | |
37f0e767 PB |
2624 | io_req_caches_free(ctx); |
2625 | ||
58d3be2c PB |
2626 | if (WARN_ON_ONCE(time_after(jiffies, timeout))) { |
2627 | /* there is little hope left, don't run it too often */ | |
2628 | interval = HZ * 60; | |
2629 | } | |
2630 | } while (!wait_for_completion_timeout(&ctx->ref_comp, interval)); | |
d56d938b | 2631 | |
7f00651a PB |
2632 | init_completion(&exit.completion); |
2633 | init_task_work(&exit.task_work, io_tctx_exit_cb); | |
2634 | exit.ctx = ctx; | |
89b5066e PB |
2635 | /* |
2636 | * Some may use context even when all refs and requests have been put, | |
2637 | * and they are free to do so while still holding uring_lock or | |
5b0a6acc | 2638 | * completion_lock, see io_req_task_submit(). Apart from other work, |
89b5066e PB |
2639 | * this lock/unlock section also waits them to finish. |
2640 | */ | |
d56d938b PB |
2641 | mutex_lock(&ctx->uring_lock); |
2642 | while (!list_empty(&ctx->tctx_list)) { | |
b5bb3a24 PB |
2643 | WARN_ON_ONCE(time_after(jiffies, timeout)); |
2644 | ||
d56d938b PB |
2645 | node = list_first_entry(&ctx->tctx_list, struct io_tctx_node, |
2646 | ctx_node); | |
7f00651a PB |
2647 | /* don't spin on a single task if cancellation failed */ |
2648 | list_rotate_left(&ctx->tctx_list); | |
d56d938b PB |
2649 | ret = task_work_add(node->task, &exit.task_work, TWA_SIGNAL); |
2650 | if (WARN_ON_ONCE(ret)) | |
2651 | continue; | |
d56d938b PB |
2652 | |
2653 | mutex_unlock(&ctx->uring_lock); | |
2654 | wait_for_completion(&exit.completion); | |
d56d938b PB |
2655 | mutex_lock(&ctx->uring_lock); |
2656 | } | |
2657 | mutex_unlock(&ctx->uring_lock); | |
79ebeaee JA |
2658 | spin_lock(&ctx->completion_lock); |
2659 | spin_unlock(&ctx->completion_lock); | |
d56d938b | 2660 | |
85faa7b8 JA |
2661 | io_ring_ctx_free(ctx); |
2662 | } | |
2663 | ||
c072481d | 2664 | static __cold void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx) |
2b188cc1 | 2665 | { |
61cf9370 MWO |
2666 | unsigned long index; |
2667 | struct creds *creds; | |
2668 | ||
2b188cc1 JA |
2669 | mutex_lock(&ctx->uring_lock); |
2670 | percpu_ref_kill(&ctx->refs); | |
634578f8 | 2671 | if (ctx->rings) |
6c2450ae | 2672 | __io_cqring_overflow_flush(ctx, true); |
61cf9370 MWO |
2673 | xa_for_each(&ctx->personalities, index, creds) |
2674 | io_unregister_personality(ctx, index); | |
9ca9fb24 PB |
2675 | if (ctx->rings) |
2676 | io_poll_remove_all(ctx, NULL, true); | |
2b188cc1 JA |
2677 | mutex_unlock(&ctx->uring_lock); |
2678 | ||
60053be8 PB |
2679 | /* failed during ring init, it couldn't have issued any requests */ |
2680 | if (ctx->rings) { | |
2681 | io_kill_timeouts(ctx, NULL, true); | |
60053be8 PB |
2682 | /* if we failed setting up the ctx, we might not have any rings */ |
2683 | io_iopoll_try_reap_events(ctx); | |
2684 | } | |
309fc03a | 2685 | |
85faa7b8 | 2686 | INIT_WORK(&ctx->exit_work, io_ring_exit_work); |
fc666777 JA |
2687 | /* |
2688 | * Use system_unbound_wq to avoid spawning tons of event kworkers | |
2689 | * if we're exiting a ton of rings at the same time. It just adds | |
2690 | * noise and overhead, there's no discernable change in runtime | |
2691 | * over using system_wq. | |
2692 | */ | |
2693 | queue_work(system_unbound_wq, &ctx->exit_work); | |
2b188cc1 JA |
2694 | } |
2695 | ||
2696 | static int io_uring_release(struct inode *inode, struct file *file) | |
2697 | { | |
2698 | struct io_ring_ctx *ctx = file->private_data; | |
2699 | ||
2700 | file->private_data = NULL; | |
2701 | io_ring_ctx_wait_and_kill(ctx); | |
2702 | return 0; | |
2703 | } | |
2704 | ||
f6edbabb PB |
2705 | struct io_task_cancel { |
2706 | struct task_struct *task; | |
3dd0c97a | 2707 | bool all; |
f6edbabb | 2708 | }; |
f254ac04 | 2709 | |
f6edbabb | 2710 | static bool io_cancel_task_cb(struct io_wq_work *work, void *data) |
b711d4ea | 2711 | { |
9a472ef7 | 2712 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); |
f6edbabb | 2713 | struct io_task_cancel *cancel = data; |
9a472ef7 | 2714 | |
6af3f48b | 2715 | return io_match_task_safe(req, cancel->task, cancel->all); |
b711d4ea JA |
2716 | } |
2717 | ||
c072481d PB |
2718 | static __cold bool io_cancel_defer_files(struct io_ring_ctx *ctx, |
2719 | struct task_struct *task, | |
2720 | bool cancel_all) | |
b7ddce3c | 2721 | { |
e1915f76 | 2722 | struct io_defer_entry *de; |
b7ddce3c PB |
2723 | LIST_HEAD(list); |
2724 | ||
79ebeaee | 2725 | spin_lock(&ctx->completion_lock); |
b7ddce3c | 2726 | list_for_each_entry_reverse(de, &ctx->defer_list, list) { |
6af3f48b | 2727 | if (io_match_task_safe(de->req, task, cancel_all)) { |
b7ddce3c PB |
2728 | list_cut_position(&list, &ctx->defer_list, &de->list); |
2729 | break; | |
2730 | } | |
2731 | } | |
79ebeaee | 2732 | spin_unlock(&ctx->completion_lock); |
e1915f76 PB |
2733 | if (list_empty(&list)) |
2734 | return false; | |
b7ddce3c PB |
2735 | |
2736 | while (!list_empty(&list)) { | |
2737 | de = list_first_entry(&list, struct io_defer_entry, list); | |
2738 | list_del_init(&de->list); | |
f41db273 | 2739 | io_req_complete_failed(de->req, -ECANCELED); |
b7ddce3c PB |
2740 | kfree(de); |
2741 | } | |
e1915f76 | 2742 | return true; |
b7ddce3c PB |
2743 | } |
2744 | ||
c072481d | 2745 | static __cold bool io_uring_try_cancel_iowq(struct io_ring_ctx *ctx) |
1b00764f PB |
2746 | { |
2747 | struct io_tctx_node *node; | |
2748 | enum io_wq_cancel cret; | |
2749 | bool ret = false; | |
2750 | ||
2751 | mutex_lock(&ctx->uring_lock); | |
2752 | list_for_each_entry(node, &ctx->tctx_list, ctx_node) { | |
2753 | struct io_uring_task *tctx = node->task->io_uring; | |
2754 | ||
2755 | /* | |
2756 | * io_wq will stay alive while we hold uring_lock, because it's | |
2757 | * killed after ctx nodes, which requires to take the lock. | |
2758 | */ | |
2759 | if (!tctx || !tctx->io_wq) | |
2760 | continue; | |
2761 | cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_ctx_cb, ctx, true); | |
2762 | ret |= (cret != IO_WQ_CANCEL_NOTFOUND); | |
2763 | } | |
2764 | mutex_unlock(&ctx->uring_lock); | |
2765 | ||
2766 | return ret; | |
2767 | } | |
2768 | ||
affa87db | 2769 | static __cold bool io_uring_try_cancel_requests(struct io_ring_ctx *ctx, |
c072481d PB |
2770 | struct task_struct *task, |
2771 | bool cancel_all) | |
9936c7c2 | 2772 | { |
3dd0c97a | 2773 | struct io_task_cancel cancel = { .task = task, .all = cancel_all, }; |
1b00764f | 2774 | struct io_uring_task *tctx = task ? task->io_uring : NULL; |
affa87db PB |
2775 | enum io_wq_cancel cret; |
2776 | bool ret = false; | |
9936c7c2 | 2777 | |
60053be8 PB |
2778 | /* failed during ring init, it couldn't have issued any requests */ |
2779 | if (!ctx->rings) | |
affa87db | 2780 | return false; |
60053be8 | 2781 | |
affa87db PB |
2782 | if (!task) { |
2783 | ret |= io_uring_try_cancel_iowq(ctx); | |
2784 | } else if (tctx && tctx->io_wq) { | |
2785 | /* | |
2786 | * Cancels requests of all rings, not only @ctx, but | |
2787 | * it's fine as the task is in exit/exec. | |
2788 | */ | |
2789 | cret = io_wq_cancel_cb(tctx->io_wq, io_cancel_task_cb, | |
2790 | &cancel, true); | |
2791 | ret |= (cret != IO_WQ_CANCEL_NOTFOUND); | |
2792 | } | |
9936c7c2 | 2793 | |
affa87db PB |
2794 | /* SQPOLL thread does its own polling */ |
2795 | if ((!(ctx->flags & IORING_SETUP_SQPOLL) && cancel_all) || | |
2796 | (ctx->sq_data && ctx->sq_data->thread == current)) { | |
2797 | while (!wq_list_empty(&ctx->iopoll_list)) { | |
2798 | io_iopoll_try_reap_events(ctx); | |
2799 | ret = true; | |
9936c7c2 | 2800 | } |
9936c7c2 | 2801 | } |
affa87db PB |
2802 | |
2803 | ret |= io_cancel_defer_files(ctx, task, cancel_all); | |
2804 | mutex_lock(&ctx->uring_lock); | |
2805 | ret |= io_poll_remove_all(ctx, task, cancel_all); | |
2806 | mutex_unlock(&ctx->uring_lock); | |
2807 | ret |= io_kill_timeouts(ctx, task, cancel_all); | |
2808 | if (task) | |
2809 | ret |= io_run_task_work(); | |
2810 | return ret; | |
9936c7c2 PB |
2811 | } |
2812 | ||
3f48cf18 | 2813 | static s64 tctx_inflight(struct io_uring_task *tctx, bool tracked) |
521d6a73 | 2814 | { |
3f48cf18 | 2815 | if (tracked) |
9cae36a0 | 2816 | return atomic_read(&tctx->inflight_tracked); |
521d6a73 PB |
2817 | return percpu_counter_sum(&tctx->inflight); |
2818 | } | |
2819 | ||
78cc687b PB |
2820 | /* |
2821 | * Find any io_uring ctx that this task has registered or done IO on, and cancel | |
78a78060 | 2822 | * requests. @sqd should be not-null IFF it's an SQPOLL thread cancellation. |
78cc687b | 2823 | */ |
17437f31 | 2824 | __cold void io_uring_cancel_generic(bool cancel_all, struct io_sq_data *sqd) |
0e9ddb39 | 2825 | { |
521d6a73 | 2826 | struct io_uring_task *tctx = current->io_uring; |
734551df | 2827 | struct io_ring_ctx *ctx; |
0e9ddb39 PB |
2828 | s64 inflight; |
2829 | DEFINE_WAIT(wait); | |
fdaf083c | 2830 | |
78cc687b PB |
2831 | WARN_ON_ONCE(sqd && sqd->thread != current); |
2832 | ||
6d042ffb PO |
2833 | if (!current->io_uring) |
2834 | return; | |
17a91051 PB |
2835 | if (tctx->io_wq) |
2836 | io_wq_exit_start(tctx->io_wq); | |
2837 | ||
0e9ddb39 PB |
2838 | atomic_inc(&tctx->in_idle); |
2839 | do { | |
affa87db PB |
2840 | bool loop = false; |
2841 | ||
e9dbe221 | 2842 | io_uring_drop_tctx_refs(current); |
0e9ddb39 | 2843 | /* read completions before cancelations */ |
78cc687b | 2844 | inflight = tctx_inflight(tctx, !cancel_all); |
0e9ddb39 PB |
2845 | if (!inflight) |
2846 | break; | |
fdaf083c | 2847 | |
78cc687b PB |
2848 | if (!sqd) { |
2849 | struct io_tctx_node *node; | |
2850 | unsigned long index; | |
0f212204 | 2851 | |
78cc687b PB |
2852 | xa_for_each(&tctx->xa, index, node) { |
2853 | /* sqpoll task will cancel all its requests */ | |
2854 | if (node->ctx->sq_data) | |
2855 | continue; | |
affa87db PB |
2856 | loop |= io_uring_try_cancel_requests(node->ctx, |
2857 | current, cancel_all); | |
78cc687b PB |
2858 | } |
2859 | } else { | |
2860 | list_for_each_entry(ctx, &sqd->ctx_list, sqd_list) | |
affa87db PB |
2861 | loop |= io_uring_try_cancel_requests(ctx, |
2862 | current, | |
2863 | cancel_all); | |
2864 | } | |
2865 | ||
2866 | if (loop) { | |
2867 | cond_resched(); | |
2868 | continue; | |
78cc687b | 2869 | } |
17a91051 | 2870 | |
78a78060 JA |
2871 | prepare_to_wait(&tctx->wait, &wait, TASK_INTERRUPTIBLE); |
2872 | io_run_task_work(); | |
e9dbe221 | 2873 | io_uring_drop_tctx_refs(current); |
78a78060 | 2874 | |
0f212204 | 2875 | /* |
a1bb3cd5 PB |
2876 | * If we've seen completions, retry without waiting. This |
2877 | * avoids a race where a completion comes in before we did | |
2878 | * prepare_to_wait(). | |
0f212204 | 2879 | */ |
3dd0c97a | 2880 | if (inflight == tctx_inflight(tctx, !cancel_all)) |
a1bb3cd5 | 2881 | schedule(); |
f57555ed | 2882 | finish_wait(&tctx->wait, &wait); |
d8a6df10 | 2883 | } while (1); |
de7f1d9e | 2884 | |
8452d4a6 | 2885 | io_uring_clean_tctx(tctx); |
3dd0c97a | 2886 | if (cancel_all) { |
3cc7fdb9 PB |
2887 | /* |
2888 | * We shouldn't run task_works after cancel, so just leave | |
2889 | * ->in_idle set for normal exit. | |
2890 | */ | |
2891 | atomic_dec(&tctx->in_idle); | |
3f48cf18 PB |
2892 | /* for exec all current's requests should be gone, kill tctx */ |
2893 | __io_uring_free(current); | |
2894 | } | |
44e728b8 PB |
2895 | } |
2896 | ||
f552a27a | 2897 | void __io_uring_cancel(bool cancel_all) |
78cc687b | 2898 | { |
f552a27a | 2899 | io_uring_cancel_generic(cancel_all, NULL); |
78cc687b PB |
2900 | } |
2901 | ||
6c5c240e RP |
2902 | static void *io_uring_validate_mmap_request(struct file *file, |
2903 | loff_t pgoff, size_t sz) | |
2b188cc1 | 2904 | { |
2b188cc1 | 2905 | struct io_ring_ctx *ctx = file->private_data; |
6c5c240e | 2906 | loff_t offset = pgoff << PAGE_SHIFT; |
2b188cc1 JA |
2907 | struct page *page; |
2908 | void *ptr; | |
2909 | ||
2910 | switch (offset) { | |
2911 | case IORING_OFF_SQ_RING: | |
75b28aff HV |
2912 | case IORING_OFF_CQ_RING: |
2913 | ptr = ctx->rings; | |
2b188cc1 JA |
2914 | break; |
2915 | case IORING_OFF_SQES: | |
2916 | ptr = ctx->sq_sqes; | |
2917 | break; | |
2b188cc1 | 2918 | default: |
6c5c240e | 2919 | return ERR_PTR(-EINVAL); |
2b188cc1 JA |
2920 | } |
2921 | ||
2922 | page = virt_to_head_page(ptr); | |
a50b854e | 2923 | if (sz > page_size(page)) |
6c5c240e RP |
2924 | return ERR_PTR(-EINVAL); |
2925 | ||
2926 | return ptr; | |
2927 | } | |
2928 | ||
2929 | #ifdef CONFIG_MMU | |
2930 | ||
c072481d | 2931 | static __cold int io_uring_mmap(struct file *file, struct vm_area_struct *vma) |
6c5c240e RP |
2932 | { |
2933 | size_t sz = vma->vm_end - vma->vm_start; | |
2934 | unsigned long pfn; | |
2935 | void *ptr; | |
2936 | ||
2937 | ptr = io_uring_validate_mmap_request(file, vma->vm_pgoff, sz); | |
2938 | if (IS_ERR(ptr)) | |
2939 | return PTR_ERR(ptr); | |
2b188cc1 JA |
2940 | |
2941 | pfn = virt_to_phys(ptr) >> PAGE_SHIFT; | |
2942 | return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot); | |
2943 | } | |
2944 | ||
6c5c240e RP |
2945 | #else /* !CONFIG_MMU */ |
2946 | ||
2947 | static int io_uring_mmap(struct file *file, struct vm_area_struct *vma) | |
2948 | { | |
2949 | return vma->vm_flags & (VM_SHARED | VM_MAYSHARE) ? 0 : -EINVAL; | |
2950 | } | |
2951 | ||
2952 | static unsigned int io_uring_nommu_mmap_capabilities(struct file *file) | |
2953 | { | |
2954 | return NOMMU_MAP_DIRECT | NOMMU_MAP_READ | NOMMU_MAP_WRITE; | |
2955 | } | |
2956 | ||
2957 | static unsigned long io_uring_nommu_get_unmapped_area(struct file *file, | |
2958 | unsigned long addr, unsigned long len, | |
2959 | unsigned long pgoff, unsigned long flags) | |
2960 | { | |
2961 | void *ptr; | |
2962 | ||
2963 | ptr = io_uring_validate_mmap_request(file, pgoff, len); | |
2964 | if (IS_ERR(ptr)) | |
2965 | return PTR_ERR(ptr); | |
2966 | ||
2967 | return (unsigned long) ptr; | |
2968 | } | |
2969 | ||
2970 | #endif /* !CONFIG_MMU */ | |
2971 | ||
f81440d3 PB |
2972 | static int io_validate_ext_arg(unsigned flags, const void __user *argp, size_t argsz) |
2973 | { | |
2974 | if (flags & IORING_ENTER_EXT_ARG) { | |
2975 | struct io_uring_getevents_arg arg; | |
2976 | ||
2977 | if (argsz != sizeof(arg)) | |
2978 | return -EINVAL; | |
2979 | if (copy_from_user(&arg, argp, sizeof(arg))) | |
2980 | return -EFAULT; | |
2981 | } | |
2982 | return 0; | |
2983 | } | |
2984 | ||
c73ebb68 HX |
2985 | static int io_get_ext_arg(unsigned flags, const void __user *argp, size_t *argsz, |
2986 | struct __kernel_timespec __user **ts, | |
2987 | const sigset_t __user **sig) | |
2988 | { | |
2989 | struct io_uring_getevents_arg arg; | |
2990 | ||
2991 | /* | |
2992 | * If EXT_ARG isn't set, then we have no timespec and the argp pointer | |
2993 | * is just a pointer to the sigset_t. | |
2994 | */ | |
2995 | if (!(flags & IORING_ENTER_EXT_ARG)) { | |
2996 | *sig = (const sigset_t __user *) argp; | |
2997 | *ts = NULL; | |
2998 | return 0; | |
2999 | } | |
3000 | ||
3001 | /* | |
3002 | * EXT_ARG is set - ensure we agree on the size of it and copy in our | |
3003 | * timespec and sigset_t pointers if good. | |
3004 | */ | |
3005 | if (*argsz != sizeof(arg)) | |
3006 | return -EINVAL; | |
3007 | if (copy_from_user(&arg, argp, sizeof(arg))) | |
3008 | return -EFAULT; | |
d2347b96 DY |
3009 | if (arg.pad) |
3010 | return -EINVAL; | |
c73ebb68 HX |
3011 | *sig = u64_to_user_ptr(arg.sigmask); |
3012 | *argsz = arg.sigmask_sz; | |
3013 | *ts = u64_to_user_ptr(arg.ts); | |
3014 | return 0; | |
3015 | } | |
3016 | ||
2b188cc1 | 3017 | SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit, |
c73ebb68 HX |
3018 | u32, min_complete, u32, flags, const void __user *, argp, |
3019 | size_t, argsz) | |
2b188cc1 JA |
3020 | { |
3021 | struct io_ring_ctx *ctx; | |
2b188cc1 | 3022 | struct fd f; |
33f993da | 3023 | long ret; |
2b188cc1 | 3024 | |
4c6e277c | 3025 | io_run_task_work(); |
b41e9852 | 3026 | |
33f993da | 3027 | if (unlikely(flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP | |
e7a6c00d JA |
3028 | IORING_ENTER_SQ_WAIT | IORING_ENTER_EXT_ARG | |
3029 | IORING_ENTER_REGISTERED_RING))) | |
2b188cc1 JA |
3030 | return -EINVAL; |
3031 | ||
e7a6c00d JA |
3032 | /* |
3033 | * Ring fd has been registered via IORING_REGISTER_RING_FDS, we | |
3034 | * need only dereference our task private array to find it. | |
3035 | */ | |
3036 | if (flags & IORING_ENTER_REGISTERED_RING) { | |
3037 | struct io_uring_task *tctx = current->io_uring; | |
3038 | ||
3039 | if (!tctx || fd >= IO_RINGFD_REG_MAX) | |
3040 | return -EINVAL; | |
3041 | fd = array_index_nospec(fd, IO_RINGFD_REG_MAX); | |
3042 | f.file = tctx->registered_rings[fd]; | |
4329490a | 3043 | f.flags = 0; |
e7a6c00d JA |
3044 | } else { |
3045 | f = fdget(fd); | |
e7a6c00d | 3046 | } |
2b188cc1 | 3047 | |
4329490a AV |
3048 | if (unlikely(!f.file)) |
3049 | return -EBADF; | |
3050 | ||
2b188cc1 | 3051 | ret = -EOPNOTSUPP; |
e5550a14 | 3052 | if (unlikely(!io_is_uring_fops(f.file))) |
2b188cc1 JA |
3053 | goto out_fput; |
3054 | ||
3055 | ret = -ENXIO; | |
3056 | ctx = f.file->private_data; | |
33f993da | 3057 | if (unlikely(!percpu_ref_tryget(&ctx->refs))) |
2b188cc1 JA |
3058 | goto out_fput; |
3059 | ||
7e84e1c7 | 3060 | ret = -EBADFD; |
33f993da | 3061 | if (unlikely(ctx->flags & IORING_SETUP_R_DISABLED)) |
7e84e1c7 SG |
3062 | goto out; |
3063 | ||
6c271ce2 JA |
3064 | /* |
3065 | * For SQ polling, the thread will do all submissions and completions. | |
3066 | * Just return the requested submit count, and wake the thread if | |
3067 | * we were asked to. | |
3068 | */ | |
b2a9eada | 3069 | ret = 0; |
6c271ce2 | 3070 | if (ctx->flags & IORING_SETUP_SQPOLL) { |
90f67366 | 3071 | io_cqring_overflow_flush(ctx); |
89448c47 | 3072 | |
21f96522 JA |
3073 | if (unlikely(ctx->sq_data->thread == NULL)) { |
3074 | ret = -EOWNERDEAD; | |
04147488 | 3075 | goto out; |
21f96522 | 3076 | } |
6c271ce2 | 3077 | if (flags & IORING_ENTER_SQ_WAKEUP) |
534ca6d6 | 3078 | wake_up(&ctx->sq_data->wait); |
d9d05217 PB |
3079 | if (flags & IORING_ENTER_SQ_WAIT) { |
3080 | ret = io_sqpoll_wait_sq(ctx); | |
3081 | if (ret) | |
3082 | goto out; | |
3083 | } | |
3e813c90 | 3084 | ret = to_submit; |
b2a9eada | 3085 | } else if (to_submit) { |
eef51daa | 3086 | ret = io_uring_add_tctx_node(ctx); |
0f212204 JA |
3087 | if (unlikely(ret)) |
3088 | goto out; | |
7c504e65 | 3089 | |
2b188cc1 | 3090 | mutex_lock(&ctx->uring_lock); |
3e813c90 DY |
3091 | ret = io_submit_sqes(ctx, to_submit); |
3092 | if (ret != to_submit) { | |
d487b43c | 3093 | mutex_unlock(&ctx->uring_lock); |
7c504e65 | 3094 | goto out; |
d487b43c PB |
3095 | } |
3096 | if ((flags & IORING_ENTER_GETEVENTS) && ctx->syscall_iopoll) | |
3097 | goto iopoll_locked; | |
3098 | mutex_unlock(&ctx->uring_lock); | |
2b188cc1 JA |
3099 | } |
3100 | if (flags & IORING_ENTER_GETEVENTS) { | |
3e813c90 | 3101 | int ret2; |
773697b6 | 3102 | if (ctx->syscall_iopoll) { |
d487b43c PB |
3103 | /* |
3104 | * We disallow the app entering submit/complete with | |
3105 | * polling, but we still need to lock the ring to | |
3106 | * prevent racing with polled issue that got punted to | |
3107 | * a workqueue. | |
3108 | */ | |
3109 | mutex_lock(&ctx->uring_lock); | |
3110 | iopoll_locked: | |
3e813c90 DY |
3111 | ret2 = io_validate_ext_arg(flags, argp, argsz); |
3112 | if (likely(!ret2)) { | |
3113 | min_complete = min(min_complete, | |
3114 | ctx->cq_entries); | |
3115 | ret2 = io_iopoll_check(ctx, min_complete); | |
d487b43c PB |
3116 | } |
3117 | mutex_unlock(&ctx->uring_lock); | |
def596e9 | 3118 | } else { |
f81440d3 PB |
3119 | const sigset_t __user *sig; |
3120 | struct __kernel_timespec __user *ts; | |
3121 | ||
3e813c90 DY |
3122 | ret2 = io_get_ext_arg(flags, argp, &argsz, &ts, &sig); |
3123 | if (likely(!ret2)) { | |
3124 | min_complete = min(min_complete, | |
3125 | ctx->cq_entries); | |
3126 | ret2 = io_cqring_wait(ctx, min_complete, sig, | |
3127 | argsz, ts); | |
3128 | } | |
def596e9 | 3129 | } |
c73ebb68 | 3130 | |
155bc950 | 3131 | if (!ret) { |
3e813c90 | 3132 | ret = ret2; |
2b188cc1 | 3133 | |
155bc950 DY |
3134 | /* |
3135 | * EBADR indicates that one or more CQE were dropped. | |
3136 | * Once the user has been informed we can clear the bit | |
3137 | * as they are obviously ok with those drops. | |
3138 | */ | |
3139 | if (unlikely(ret2 == -EBADR)) | |
3140 | clear_bit(IO_CHECK_CQ_DROPPED_BIT, | |
3141 | &ctx->check_cq); | |
def596e9 | 3142 | } |
2b188cc1 JA |
3143 | } |
3144 | ||
7c504e65 | 3145 | out: |
6805b32e | 3146 | percpu_ref_put(&ctx->refs); |
2b188cc1 | 3147 | out_fput: |
4329490a | 3148 | fdput(f); |
3e813c90 | 3149 | return ret; |
2b188cc1 JA |
3150 | } |
3151 | ||
3152 | static const struct file_operations io_uring_fops = { | |
3153 | .release = io_uring_release, | |
3154 | .mmap = io_uring_mmap, | |
6c5c240e RP |
3155 | #ifndef CONFIG_MMU |
3156 | .get_unmapped_area = io_uring_nommu_get_unmapped_area, | |
3157 | .mmap_capabilities = io_uring_nommu_mmap_capabilities, | |
3158 | #endif | |
2b188cc1 | 3159 | .poll = io_uring_poll, |
bebdb65e | 3160 | #ifdef CONFIG_PROC_FS |
87ce955b | 3161 | .show_fdinfo = io_uring_show_fdinfo, |
bebdb65e | 3162 | #endif |
2b188cc1 JA |
3163 | }; |
3164 | ||
92ac8bea JA |
3165 | bool io_is_uring_fops(struct file *file) |
3166 | { | |
3167 | return file->f_op == &io_uring_fops; | |
3168 | } | |
3169 | ||
c072481d PB |
3170 | static __cold int io_allocate_scq_urings(struct io_ring_ctx *ctx, |
3171 | struct io_uring_params *p) | |
2b188cc1 | 3172 | { |
75b28aff HV |
3173 | struct io_rings *rings; |
3174 | size_t size, sq_array_offset; | |
2b188cc1 | 3175 | |
bd740481 JA |
3176 | /* make sure these are sane, as we already accounted them */ |
3177 | ctx->sq_entries = p->sq_entries; | |
3178 | ctx->cq_entries = p->cq_entries; | |
3179 | ||
baf9cb64 | 3180 | size = rings_size(ctx, p->sq_entries, p->cq_entries, &sq_array_offset); |
75b28aff HV |
3181 | if (size == SIZE_MAX) |
3182 | return -EOVERFLOW; | |
3183 | ||
3184 | rings = io_mem_alloc(size); | |
3185 | if (!rings) | |
2b188cc1 JA |
3186 | return -ENOMEM; |
3187 | ||
75b28aff HV |
3188 | ctx->rings = rings; |
3189 | ctx->sq_array = (u32 *)((char *)rings + sq_array_offset); | |
3190 | rings->sq_ring_mask = p->sq_entries - 1; | |
3191 | rings->cq_ring_mask = p->cq_entries - 1; | |
3192 | rings->sq_ring_entries = p->sq_entries; | |
3193 | rings->cq_ring_entries = p->cq_entries; | |
2b188cc1 | 3194 | |
ebdeb7c0 JA |
3195 | if (p->flags & IORING_SETUP_SQE128) |
3196 | size = array_size(2 * sizeof(struct io_uring_sqe), p->sq_entries); | |
3197 | else | |
3198 | size = array_size(sizeof(struct io_uring_sqe), p->sq_entries); | |
eb065d30 JA |
3199 | if (size == SIZE_MAX) { |
3200 | io_mem_free(ctx->rings); | |
3201 | ctx->rings = NULL; | |
2b188cc1 | 3202 | return -EOVERFLOW; |
eb065d30 | 3203 | } |
2b188cc1 JA |
3204 | |
3205 | ctx->sq_sqes = io_mem_alloc(size); | |
eb065d30 JA |
3206 | if (!ctx->sq_sqes) { |
3207 | io_mem_free(ctx->rings); | |
3208 | ctx->rings = NULL; | |
2b188cc1 | 3209 | return -ENOMEM; |
eb065d30 | 3210 | } |
2b188cc1 | 3211 | |
2b188cc1 JA |
3212 | return 0; |
3213 | } | |
3214 | ||
9faadcc8 PB |
3215 | static int io_uring_install_fd(struct io_ring_ctx *ctx, struct file *file) |
3216 | { | |
3217 | int ret, fd; | |
3218 | ||
3219 | fd = get_unused_fd_flags(O_RDWR | O_CLOEXEC); | |
3220 | if (fd < 0) | |
3221 | return fd; | |
3222 | ||
97bbdc06 | 3223 | ret = __io_uring_add_tctx_node(ctx, false); |
9faadcc8 PB |
3224 | if (ret) { |
3225 | put_unused_fd(fd); | |
3226 | return ret; | |
3227 | } | |
3228 | fd_install(fd, file); | |
3229 | return fd; | |
3230 | } | |
3231 | ||
2b188cc1 JA |
3232 | /* |
3233 | * Allocate an anonymous fd, this is what constitutes the application | |
3234 | * visible backing of an io_uring instance. The application mmaps this | |
3235 | * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled, | |
3236 | * we have to tie this fd to a socket for file garbage collection purposes. | |
3237 | */ | |
9faadcc8 | 3238 | static struct file *io_uring_get_file(struct io_ring_ctx *ctx) |
2b188cc1 JA |
3239 | { |
3240 | struct file *file; | |
9faadcc8 | 3241 | #if defined(CONFIG_UNIX) |
2b188cc1 JA |
3242 | int ret; |
3243 | ||
2b188cc1 JA |
3244 | ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP, |
3245 | &ctx->ring_sock); | |
3246 | if (ret) | |
9faadcc8 | 3247 | return ERR_PTR(ret); |
2b188cc1 JA |
3248 | #endif |
3249 | ||
91a9ab7c PM |
3250 | file = anon_inode_getfile_secure("[io_uring]", &io_uring_fops, ctx, |
3251 | O_RDWR | O_CLOEXEC, NULL); | |
2b188cc1 | 3252 | #if defined(CONFIG_UNIX) |
9faadcc8 PB |
3253 | if (IS_ERR(file)) { |
3254 | sock_release(ctx->ring_sock); | |
3255 | ctx->ring_sock = NULL; | |
3256 | } else { | |
3257 | ctx->ring_sock->file = file; | |
0f212204 | 3258 | } |
2b188cc1 | 3259 | #endif |
9faadcc8 | 3260 | return file; |
2b188cc1 JA |
3261 | } |
3262 | ||
c072481d PB |
3263 | static __cold int io_uring_create(unsigned entries, struct io_uring_params *p, |
3264 | struct io_uring_params __user *params) | |
2b188cc1 | 3265 | { |
2b188cc1 | 3266 | struct io_ring_ctx *ctx; |
9faadcc8 | 3267 | struct file *file; |
2b188cc1 JA |
3268 | int ret; |
3269 | ||
8110c1a6 | 3270 | if (!entries) |
2b188cc1 | 3271 | return -EINVAL; |
8110c1a6 JA |
3272 | if (entries > IORING_MAX_ENTRIES) { |
3273 | if (!(p->flags & IORING_SETUP_CLAMP)) | |
3274 | return -EINVAL; | |
3275 | entries = IORING_MAX_ENTRIES; | |
3276 | } | |
2b188cc1 JA |
3277 | |
3278 | /* | |
3279 | * Use twice as many entries for the CQ ring. It's possible for the | |
3280 | * application to drive a higher depth than the size of the SQ ring, | |
3281 | * since the sqes are only used at submission time. This allows for | |
33a107f0 JA |
3282 | * some flexibility in overcommitting a bit. If the application has |
3283 | * set IORING_SETUP_CQSIZE, it will have passed in the desired number | |
3284 | * of CQ ring entries manually. | |
2b188cc1 JA |
3285 | */ |
3286 | p->sq_entries = roundup_pow_of_two(entries); | |
33a107f0 JA |
3287 | if (p->flags & IORING_SETUP_CQSIZE) { |
3288 | /* | |
3289 | * If IORING_SETUP_CQSIZE is set, we do the same roundup | |
3290 | * to a power-of-two, if it isn't already. We do NOT impose | |
3291 | * any cq vs sq ring sizing. | |
3292 | */ | |
eb2667b3 | 3293 | if (!p->cq_entries) |
33a107f0 | 3294 | return -EINVAL; |
8110c1a6 JA |
3295 | if (p->cq_entries > IORING_MAX_CQ_ENTRIES) { |
3296 | if (!(p->flags & IORING_SETUP_CLAMP)) | |
3297 | return -EINVAL; | |
3298 | p->cq_entries = IORING_MAX_CQ_ENTRIES; | |
3299 | } | |
eb2667b3 JQ |
3300 | p->cq_entries = roundup_pow_of_two(p->cq_entries); |
3301 | if (p->cq_entries < p->sq_entries) | |
3302 | return -EINVAL; | |
33a107f0 JA |
3303 | } else { |
3304 | p->cq_entries = 2 * p->sq_entries; | |
3305 | } | |
2b188cc1 | 3306 | |
2b188cc1 | 3307 | ctx = io_ring_ctx_alloc(p); |
62e398be | 3308 | if (!ctx) |
2b188cc1 | 3309 | return -ENOMEM; |
773697b6 PB |
3310 | |
3311 | /* | |
3312 | * When SETUP_IOPOLL and SETUP_SQPOLL are both enabled, user | |
3313 | * space applications don't need to do io completion events | |
3314 | * polling again, they can rely on io_sq_thread to do polling | |
3315 | * work, which can reduce cpu usage and uring_lock contention. | |
3316 | */ | |
3317 | if (ctx->flags & IORING_SETUP_IOPOLL && | |
3318 | !(ctx->flags & IORING_SETUP_SQPOLL)) | |
3319 | ctx->syscall_iopoll = 1; | |
3320 | ||
2b188cc1 | 3321 | ctx->compat = in_compat_syscall(); |
62e398be JA |
3322 | if (!capable(CAP_IPC_LOCK)) |
3323 | ctx->user = get_uid(current_user()); | |
2aede0e4 | 3324 | |
9f010507 | 3325 | /* |
e1169f06 JA |
3326 | * For SQPOLL, we just need a wakeup, always. For !SQPOLL, if |
3327 | * COOP_TASKRUN is set, then IPIs are never needed by the app. | |
9f010507 | 3328 | */ |
e1169f06 JA |
3329 | ret = -EINVAL; |
3330 | if (ctx->flags & IORING_SETUP_SQPOLL) { | |
3331 | /* IPI related flags don't make sense with SQPOLL */ | |
ef060ea9 JA |
3332 | if (ctx->flags & (IORING_SETUP_COOP_TASKRUN | |
3333 | IORING_SETUP_TASKRUN_FLAG)) | |
e1169f06 | 3334 | goto err; |
9f010507 | 3335 | ctx->notify_method = TWA_SIGNAL_NO_IPI; |
e1169f06 JA |
3336 | } else if (ctx->flags & IORING_SETUP_COOP_TASKRUN) { |
3337 | ctx->notify_method = TWA_SIGNAL_NO_IPI; | |
3338 | } else { | |
ef060ea9 JA |
3339 | if (ctx->flags & IORING_SETUP_TASKRUN_FLAG) |
3340 | goto err; | |
9f010507 | 3341 | ctx->notify_method = TWA_SIGNAL; |
e1169f06 | 3342 | } |
9f010507 | 3343 | |
2aede0e4 JA |
3344 | /* |
3345 | * This is just grabbed for accounting purposes. When a process exits, | |
3346 | * the mm is exited and dropped before the files, hence we need to hang | |
3347 | * on to this mm purely for the purposes of being able to unaccount | |
3348 | * memory (locked/pinned vm). It's not used for anything else. | |
3349 | */ | |
6b7898eb | 3350 | mmgrab(current->mm); |
2aede0e4 | 3351 | ctx->mm_account = current->mm; |
6b7898eb | 3352 | |
2b188cc1 JA |
3353 | ret = io_allocate_scq_urings(ctx, p); |
3354 | if (ret) | |
3355 | goto err; | |
3356 | ||
7e84e1c7 | 3357 | ret = io_sq_offload_create(ctx, p); |
2b188cc1 JA |
3358 | if (ret) |
3359 | goto err; | |
eae071c9 | 3360 | /* always set a rsrc node */ |
47b228ce PB |
3361 | ret = io_rsrc_node_switch_start(ctx); |
3362 | if (ret) | |
3363 | goto err; | |
eae071c9 | 3364 | io_rsrc_node_switch(ctx, NULL); |
2b188cc1 | 3365 | |
2b188cc1 | 3366 | memset(&p->sq_off, 0, sizeof(p->sq_off)); |
75b28aff HV |
3367 | p->sq_off.head = offsetof(struct io_rings, sq.head); |
3368 | p->sq_off.tail = offsetof(struct io_rings, sq.tail); | |
3369 | p->sq_off.ring_mask = offsetof(struct io_rings, sq_ring_mask); | |
3370 | p->sq_off.ring_entries = offsetof(struct io_rings, sq_ring_entries); | |
3371 | p->sq_off.flags = offsetof(struct io_rings, sq_flags); | |
3372 | p->sq_off.dropped = offsetof(struct io_rings, sq_dropped); | |
3373 | p->sq_off.array = (char *)ctx->sq_array - (char *)ctx->rings; | |
2b188cc1 JA |
3374 | |
3375 | memset(&p->cq_off, 0, sizeof(p->cq_off)); | |
75b28aff HV |
3376 | p->cq_off.head = offsetof(struct io_rings, cq.head); |
3377 | p->cq_off.tail = offsetof(struct io_rings, cq.tail); | |
3378 | p->cq_off.ring_mask = offsetof(struct io_rings, cq_ring_mask); | |
3379 | p->cq_off.ring_entries = offsetof(struct io_rings, cq_ring_entries); | |
3380 | p->cq_off.overflow = offsetof(struct io_rings, cq_overflow); | |
3381 | p->cq_off.cqes = offsetof(struct io_rings, cqes); | |
0d9b5b3a | 3382 | p->cq_off.flags = offsetof(struct io_rings, cq_flags); |
ac90f249 | 3383 | |
7f13657d XW |
3384 | p->features = IORING_FEAT_SINGLE_MMAP | IORING_FEAT_NODROP | |
3385 | IORING_FEAT_SUBMIT_STABLE | IORING_FEAT_RW_CUR_POS | | |
5769a351 | 3386 | IORING_FEAT_CUR_PERSONALITY | IORING_FEAT_FAST_POLL | |
c73ebb68 | 3387 | IORING_FEAT_POLL_32BITS | IORING_FEAT_SQPOLL_NONFIXED | |
9690557e | 3388 | IORING_FEAT_EXT_ARG | IORING_FEAT_NATIVE_WORKERS | |
c4212f3e JA |
3389 | IORING_FEAT_RSRC_TAGS | IORING_FEAT_CQE_SKIP | |
3390 | IORING_FEAT_LINKED_FILE; | |
7f13657d XW |
3391 | |
3392 | if (copy_to_user(params, p, sizeof(*p))) { | |
3393 | ret = -EFAULT; | |
3394 | goto err; | |
3395 | } | |
d1719f70 | 3396 | |
9faadcc8 PB |
3397 | file = io_uring_get_file(ctx); |
3398 | if (IS_ERR(file)) { | |
3399 | ret = PTR_ERR(file); | |
3400 | goto err; | |
3401 | } | |
3402 | ||
044c1ab3 JA |
3403 | /* |
3404 | * Install ring fd as the very last thing, so we don't risk someone | |
3405 | * having closed it before we finish setup | |
3406 | */ | |
9faadcc8 PB |
3407 | ret = io_uring_install_fd(ctx, file); |
3408 | if (ret < 0) { | |
3409 | /* fput will clean it up */ | |
3410 | fput(file); | |
3411 | return ret; | |
3412 | } | |
044c1ab3 | 3413 | |
c826bd7a | 3414 | trace_io_uring_create(ret, ctx, p->sq_entries, p->cq_entries, p->flags); |
2b188cc1 JA |
3415 | return ret; |
3416 | err: | |
3417 | io_ring_ctx_wait_and_kill(ctx); | |
3418 | return ret; | |
3419 | } | |
3420 | ||
3421 | /* | |
3422 | * Sets up an aio uring context, and returns the fd. Applications asks for a | |
3423 | * ring size, we return the actual sq/cq ring sizes (among other things) in the | |
3424 | * params structure passed in. | |
3425 | */ | |
3426 | static long io_uring_setup(u32 entries, struct io_uring_params __user *params) | |
3427 | { | |
3428 | struct io_uring_params p; | |
2b188cc1 JA |
3429 | int i; |
3430 | ||
3431 | if (copy_from_user(&p, params, sizeof(p))) | |
3432 | return -EFAULT; | |
3433 | for (i = 0; i < ARRAY_SIZE(p.resv); i++) { | |
3434 | if (p.resv[i]) | |
3435 | return -EINVAL; | |
3436 | } | |
3437 | ||
6c271ce2 | 3438 | if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL | |
8110c1a6 | 3439 | IORING_SETUP_SQ_AFF | IORING_SETUP_CQSIZE | |
7e84e1c7 | 3440 | IORING_SETUP_CLAMP | IORING_SETUP_ATTACH_WQ | |
e1169f06 | 3441 | IORING_SETUP_R_DISABLED | IORING_SETUP_SUBMIT_ALL | |
ebdeb7c0 | 3442 | IORING_SETUP_COOP_TASKRUN | IORING_SETUP_TASKRUN_FLAG | |
97bbdc06 PB |
3443 | IORING_SETUP_SQE128 | IORING_SETUP_CQE32 | |
3444 | IORING_SETUP_SINGLE_ISSUER)) | |
2b188cc1 JA |
3445 | return -EINVAL; |
3446 | ||
ef060ea9 | 3447 | return io_uring_create(entries, &p, params); |
2b188cc1 JA |
3448 | } |
3449 | ||
3450 | SYSCALL_DEFINE2(io_uring_setup, u32, entries, | |
3451 | struct io_uring_params __user *, params) | |
3452 | { | |
3453 | return io_uring_setup(entries, params); | |
3454 | } | |
3455 | ||
c072481d PB |
3456 | static __cold int io_probe(struct io_ring_ctx *ctx, void __user *arg, |
3457 | unsigned nr_args) | |
66f4af93 JA |
3458 | { |
3459 | struct io_uring_probe *p; | |
3460 | size_t size; | |
3461 | int i, ret; | |
3462 | ||
3463 | size = struct_size(p, ops, nr_args); | |
3464 | if (size == SIZE_MAX) | |
3465 | return -EOVERFLOW; | |
3466 | p = kzalloc(size, GFP_KERNEL); | |
3467 | if (!p) | |
3468 | return -ENOMEM; | |
3469 | ||
3470 | ret = -EFAULT; | |
3471 | if (copy_from_user(p, arg, size)) | |
3472 | goto out; | |
3473 | ret = -EINVAL; | |
3474 | if (memchr_inv(p, 0, size)) | |
3475 | goto out; | |
3476 | ||
3477 | p->last_op = IORING_OP_LAST - 1; | |
3478 | if (nr_args > IORING_OP_LAST) | |
3479 | nr_args = IORING_OP_LAST; | |
3480 | ||
3481 | for (i = 0; i < nr_args; i++) { | |
3482 | p->ops[i].op = i; | |
3483 | if (!io_op_defs[i].not_supported) | |
3484 | p->ops[i].flags = IO_URING_OP_SUPPORTED; | |
3485 | } | |
3486 | p->ops_len = i; | |
3487 | ||
3488 | ret = 0; | |
3489 | if (copy_to_user(arg, p, size)) | |
3490 | ret = -EFAULT; | |
3491 | out: | |
3492 | kfree(p); | |
3493 | return ret; | |
3494 | } | |
3495 | ||
071698e1 JA |
3496 | static int io_register_personality(struct io_ring_ctx *ctx) |
3497 | { | |
4379bf8b | 3498 | const struct cred *creds; |
61cf9370 | 3499 | u32 id; |
1e6fa521 | 3500 | int ret; |
071698e1 | 3501 | |
4379bf8b | 3502 | creds = get_current_cred(); |
1e6fa521 | 3503 | |
61cf9370 MWO |
3504 | ret = xa_alloc_cyclic(&ctx->personalities, &id, (void *)creds, |
3505 | XA_LIMIT(0, USHRT_MAX), &ctx->pers_next, GFP_KERNEL); | |
a30f895a JA |
3506 | if (ret < 0) { |
3507 | put_cred(creds); | |
3508 | return ret; | |
3509 | } | |
3510 | return id; | |
071698e1 JA |
3511 | } |
3512 | ||
c072481d PB |
3513 | static __cold int io_register_restrictions(struct io_ring_ctx *ctx, |
3514 | void __user *arg, unsigned int nr_args) | |
21b55dbc SG |
3515 | { |
3516 | struct io_uring_restriction *res; | |
3517 | size_t size; | |
3518 | int i, ret; | |
3519 | ||
7e84e1c7 SG |
3520 | /* Restrictions allowed only if rings started disabled */ |
3521 | if (!(ctx->flags & IORING_SETUP_R_DISABLED)) | |
3522 | return -EBADFD; | |
3523 | ||
21b55dbc | 3524 | /* We allow only a single restrictions registration */ |
7e84e1c7 | 3525 | if (ctx->restrictions.registered) |
21b55dbc SG |
3526 | return -EBUSY; |
3527 | ||
3528 | if (!arg || nr_args > IORING_MAX_RESTRICTIONS) | |
3529 | return -EINVAL; | |
3530 | ||
3531 | size = array_size(nr_args, sizeof(*res)); | |
3532 | if (size == SIZE_MAX) | |
3533 | return -EOVERFLOW; | |
3534 | ||
3535 | res = memdup_user(arg, size); | |
3536 | if (IS_ERR(res)) | |
3537 | return PTR_ERR(res); | |
3538 | ||
3539 | ret = 0; | |
3540 | ||
3541 | for (i = 0; i < nr_args; i++) { | |
3542 | switch (res[i].opcode) { | |
3543 | case IORING_RESTRICTION_REGISTER_OP: | |
3544 | if (res[i].register_op >= IORING_REGISTER_LAST) { | |
3545 | ret = -EINVAL; | |
3546 | goto out; | |
3547 | } | |
3548 | ||
3549 | __set_bit(res[i].register_op, | |
3550 | ctx->restrictions.register_op); | |
3551 | break; | |
3552 | case IORING_RESTRICTION_SQE_OP: | |
3553 | if (res[i].sqe_op >= IORING_OP_LAST) { | |
3554 | ret = -EINVAL; | |
3555 | goto out; | |
3556 | } | |
3557 | ||
3558 | __set_bit(res[i].sqe_op, ctx->restrictions.sqe_op); | |
3559 | break; | |
3560 | case IORING_RESTRICTION_SQE_FLAGS_ALLOWED: | |
3561 | ctx->restrictions.sqe_flags_allowed = res[i].sqe_flags; | |
3562 | break; | |
3563 | case IORING_RESTRICTION_SQE_FLAGS_REQUIRED: | |
3564 | ctx->restrictions.sqe_flags_required = res[i].sqe_flags; | |
3565 | break; | |
3566 | default: | |
3567 | ret = -EINVAL; | |
3568 | goto out; | |
3569 | } | |
3570 | } | |
3571 | ||
3572 | out: | |
3573 | /* Reset all restrictions if an error happened */ | |
3574 | if (ret != 0) | |
3575 | memset(&ctx->restrictions, 0, sizeof(ctx->restrictions)); | |
3576 | else | |
7e84e1c7 | 3577 | ctx->restrictions.registered = true; |
21b55dbc SG |
3578 | |
3579 | kfree(res); | |
3580 | return ret; | |
3581 | } | |
3582 | ||
7e84e1c7 SG |
3583 | static int io_register_enable_rings(struct io_ring_ctx *ctx) |
3584 | { | |
3585 | if (!(ctx->flags & IORING_SETUP_R_DISABLED)) | |
3586 | return -EBADFD; | |
3587 | ||
3588 | if (ctx->restrictions.registered) | |
3589 | ctx->restricted = 1; | |
3590 | ||
0298ef96 PB |
3591 | ctx->flags &= ~IORING_SETUP_R_DISABLED; |
3592 | if (ctx->sq_data && wq_has_sleeper(&ctx->sq_data->wait)) | |
3593 | wake_up(&ctx->sq_data->wait); | |
7e84e1c7 SG |
3594 | return 0; |
3595 | } | |
3596 | ||
c072481d PB |
3597 | static __cold int io_register_iowq_aff(struct io_ring_ctx *ctx, |
3598 | void __user *arg, unsigned len) | |
fe76421d JA |
3599 | { |
3600 | struct io_uring_task *tctx = current->io_uring; | |
3601 | cpumask_var_t new_mask; | |
3602 | int ret; | |
3603 | ||
3604 | if (!tctx || !tctx->io_wq) | |
3605 | return -EINVAL; | |
3606 | ||
3607 | if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) | |
3608 | return -ENOMEM; | |
3609 | ||
3610 | cpumask_clear(new_mask); | |
3611 | if (len > cpumask_size()) | |
3612 | len = cpumask_size(); | |
3613 | ||
0f5e4b83 ES |
3614 | if (in_compat_syscall()) { |
3615 | ret = compat_get_bitmap(cpumask_bits(new_mask), | |
3616 | (const compat_ulong_t __user *)arg, | |
3617 | len * 8 /* CHAR_BIT */); | |
3618 | } else { | |
3619 | ret = copy_from_user(new_mask, arg, len); | |
3620 | } | |
3621 | ||
3622 | if (ret) { | |
fe76421d JA |
3623 | free_cpumask_var(new_mask); |
3624 | return -EFAULT; | |
3625 | } | |
3626 | ||
3627 | ret = io_wq_cpu_affinity(tctx->io_wq, new_mask); | |
3628 | free_cpumask_var(new_mask); | |
3629 | return ret; | |
3630 | } | |
3631 | ||
c072481d | 3632 | static __cold int io_unregister_iowq_aff(struct io_ring_ctx *ctx) |
fe76421d JA |
3633 | { |
3634 | struct io_uring_task *tctx = current->io_uring; | |
3635 | ||
3636 | if (!tctx || !tctx->io_wq) | |
3637 | return -EINVAL; | |
3638 | ||
3639 | return io_wq_cpu_affinity(tctx->io_wq, NULL); | |
3640 | } | |
3641 | ||
c072481d PB |
3642 | static __cold int io_register_iowq_max_workers(struct io_ring_ctx *ctx, |
3643 | void __user *arg) | |
b22fa62a | 3644 | __must_hold(&ctx->uring_lock) |
2e480058 | 3645 | { |
b22fa62a | 3646 | struct io_tctx_node *node; |
fa84693b JA |
3647 | struct io_uring_task *tctx = NULL; |
3648 | struct io_sq_data *sqd = NULL; | |
2e480058 JA |
3649 | __u32 new_count[2]; |
3650 | int i, ret; | |
3651 | ||
2e480058 JA |
3652 | if (copy_from_user(new_count, arg, sizeof(new_count))) |
3653 | return -EFAULT; | |
3654 | for (i = 0; i < ARRAY_SIZE(new_count); i++) | |
3655 | if (new_count[i] > INT_MAX) | |
3656 | return -EINVAL; | |
3657 | ||
fa84693b JA |
3658 | if (ctx->flags & IORING_SETUP_SQPOLL) { |
3659 | sqd = ctx->sq_data; | |
3660 | if (sqd) { | |
009ad9f0 JA |
3661 | /* |
3662 | * Observe the correct sqd->lock -> ctx->uring_lock | |
3663 | * ordering. Fine to drop uring_lock here, we hold | |
3664 | * a ref to the ctx. | |
3665 | */ | |
41d3a6bd | 3666 | refcount_inc(&sqd->refs); |
009ad9f0 | 3667 | mutex_unlock(&ctx->uring_lock); |
fa84693b | 3668 | mutex_lock(&sqd->lock); |
009ad9f0 | 3669 | mutex_lock(&ctx->uring_lock); |
41d3a6bd JA |
3670 | if (sqd->thread) |
3671 | tctx = sqd->thread->io_uring; | |
fa84693b JA |
3672 | } |
3673 | } else { | |
3674 | tctx = current->io_uring; | |
3675 | } | |
3676 | ||
e139a1ec | 3677 | BUILD_BUG_ON(sizeof(new_count) != sizeof(ctx->iowq_limits)); |
fa84693b | 3678 | |
bad119b9 PB |
3679 | for (i = 0; i < ARRAY_SIZE(new_count); i++) |
3680 | if (new_count[i]) | |
3681 | ctx->iowq_limits[i] = new_count[i]; | |
e139a1ec PB |
3682 | ctx->iowq_limits_set = true; |
3683 | ||
e139a1ec PB |
3684 | if (tctx && tctx->io_wq) { |
3685 | ret = io_wq_max_workers(tctx->io_wq, new_count); | |
3686 | if (ret) | |
3687 | goto err; | |
3688 | } else { | |
3689 | memset(new_count, 0, sizeof(new_count)); | |
3690 | } | |
fa84693b | 3691 | |
41d3a6bd | 3692 | if (sqd) { |
fa84693b | 3693 | mutex_unlock(&sqd->lock); |
41d3a6bd JA |
3694 | io_put_sq_data(sqd); |
3695 | } | |
2e480058 JA |
3696 | |
3697 | if (copy_to_user(arg, new_count, sizeof(new_count))) | |
3698 | return -EFAULT; | |
3699 | ||
b22fa62a PB |
3700 | /* that's it for SQPOLL, only the SQPOLL task creates requests */ |
3701 | if (sqd) | |
3702 | return 0; | |
3703 | ||
3704 | /* now propagate the restriction to all registered users */ | |
3705 | list_for_each_entry(node, &ctx->tctx_list, ctx_node) { | |
3706 | struct io_uring_task *tctx = node->task->io_uring; | |
3707 | ||
3708 | if (WARN_ON_ONCE(!tctx->io_wq)) | |
3709 | continue; | |
3710 | ||
3711 | for (i = 0; i < ARRAY_SIZE(new_count); i++) | |
3712 | new_count[i] = ctx->iowq_limits[i]; | |
3713 | /* ignore errors, it always returns zero anyway */ | |
3714 | (void)io_wq_max_workers(tctx->io_wq, new_count); | |
3715 | } | |
2e480058 | 3716 | return 0; |
fa84693b | 3717 | err: |
41d3a6bd | 3718 | if (sqd) { |
fa84693b | 3719 | mutex_unlock(&sqd->lock); |
41d3a6bd JA |
3720 | io_put_sq_data(sqd); |
3721 | } | |
fa84693b | 3722 | return ret; |
2e480058 JA |
3723 | } |
3724 | ||
edafccee JA |
3725 | static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode, |
3726 | void __user *arg, unsigned nr_args) | |
b19062a5 JA |
3727 | __releases(ctx->uring_lock) |
3728 | __acquires(ctx->uring_lock) | |
edafccee JA |
3729 | { |
3730 | int ret; | |
3731 | ||
35fa71a0 JA |
3732 | /* |
3733 | * We're inside the ring mutex, if the ref is already dying, then | |
3734 | * someone else killed the ctx or is already going through | |
3735 | * io_uring_register(). | |
3736 | */ | |
3737 | if (percpu_ref_is_dying(&ctx->refs)) | |
3738 | return -ENXIO; | |
3739 | ||
75c4021a PB |
3740 | if (ctx->restricted) { |
3741 | if (opcode >= IORING_REGISTER_LAST) | |
3742 | return -EINVAL; | |
3743 | opcode = array_index_nospec(opcode, IORING_REGISTER_LAST); | |
3744 | if (!test_bit(opcode, ctx->restrictions.register_op)) | |
3745 | return -EACCES; | |
3746 | } | |
3747 | ||
edafccee JA |
3748 | switch (opcode) { |
3749 | case IORING_REGISTER_BUFFERS: | |
0184f08e PB |
3750 | ret = -EFAULT; |
3751 | if (!arg) | |
3752 | break; | |
634d00df | 3753 | ret = io_sqe_buffers_register(ctx, arg, nr_args, NULL); |
edafccee JA |
3754 | break; |
3755 | case IORING_UNREGISTER_BUFFERS: | |
3756 | ret = -EINVAL; | |
3757 | if (arg || nr_args) | |
3758 | break; | |
0a96bbe4 | 3759 | ret = io_sqe_buffers_unregister(ctx); |
edafccee | 3760 | break; |
6b06314c | 3761 | case IORING_REGISTER_FILES: |
a8da73a3 JA |
3762 | ret = -EFAULT; |
3763 | if (!arg) | |
3764 | break; | |
792e3582 | 3765 | ret = io_sqe_files_register(ctx, arg, nr_args, NULL); |
6b06314c JA |
3766 | break; |
3767 | case IORING_UNREGISTER_FILES: | |
3768 | ret = -EINVAL; | |
3769 | if (arg || nr_args) | |
3770 | break; | |
3771 | ret = io_sqe_files_unregister(ctx); | |
3772 | break; | |
c3a31e60 | 3773 | case IORING_REGISTER_FILES_UPDATE: |
c3bdad02 | 3774 | ret = io_register_files_update(ctx, arg, nr_args); |
c3a31e60 | 3775 | break; |
9b402849 JA |
3776 | case IORING_REGISTER_EVENTFD: |
3777 | ret = -EINVAL; | |
3778 | if (nr_args != 1) | |
3779 | break; | |
c75312dd UA |
3780 | ret = io_eventfd_register(ctx, arg, 0); |
3781 | break; | |
3782 | case IORING_REGISTER_EVENTFD_ASYNC: | |
3783 | ret = -EINVAL; | |
3784 | if (nr_args != 1) | |
f2842ab5 | 3785 | break; |
c75312dd | 3786 | ret = io_eventfd_register(ctx, arg, 1); |
9b402849 JA |
3787 | break; |
3788 | case IORING_UNREGISTER_EVENTFD: | |
3789 | ret = -EINVAL; | |
3790 | if (arg || nr_args) | |
3791 | break; | |
3792 | ret = io_eventfd_unregister(ctx); | |
3793 | break; | |
66f4af93 JA |
3794 | case IORING_REGISTER_PROBE: |
3795 | ret = -EINVAL; | |
3796 | if (!arg || nr_args > 256) | |
3797 | break; | |
3798 | ret = io_probe(ctx, arg, nr_args); | |
3799 | break; | |
071698e1 JA |
3800 | case IORING_REGISTER_PERSONALITY: |
3801 | ret = -EINVAL; | |
3802 | if (arg || nr_args) | |
3803 | break; | |
3804 | ret = io_register_personality(ctx); | |
3805 | break; | |
3806 | case IORING_UNREGISTER_PERSONALITY: | |
3807 | ret = -EINVAL; | |
3808 | if (arg) | |
3809 | break; | |
3810 | ret = io_unregister_personality(ctx, nr_args); | |
3811 | break; | |
7e84e1c7 SG |
3812 | case IORING_REGISTER_ENABLE_RINGS: |
3813 | ret = -EINVAL; | |
3814 | if (arg || nr_args) | |
3815 | break; | |
3816 | ret = io_register_enable_rings(ctx); | |
3817 | break; | |
21b55dbc SG |
3818 | case IORING_REGISTER_RESTRICTIONS: |
3819 | ret = io_register_restrictions(ctx, arg, nr_args); | |
3820 | break; | |
992da01a PB |
3821 | case IORING_REGISTER_FILES2: |
3822 | ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_FILE); | |
3823 | break; | |
3824 | case IORING_REGISTER_FILES_UPDATE2: | |
3825 | ret = io_register_rsrc_update(ctx, arg, nr_args, | |
3826 | IORING_RSRC_FILE); | |
3827 | break; | |
3828 | case IORING_REGISTER_BUFFERS2: | |
3829 | ret = io_register_rsrc(ctx, arg, nr_args, IORING_RSRC_BUFFER); | |
792e3582 | 3830 | break; |
992da01a PB |
3831 | case IORING_REGISTER_BUFFERS_UPDATE: |
3832 | ret = io_register_rsrc_update(ctx, arg, nr_args, | |
3833 | IORING_RSRC_BUFFER); | |
c3bdad02 | 3834 | break; |
fe76421d JA |
3835 | case IORING_REGISTER_IOWQ_AFF: |
3836 | ret = -EINVAL; | |
3837 | if (!arg || !nr_args) | |
3838 | break; | |
3839 | ret = io_register_iowq_aff(ctx, arg, nr_args); | |
3840 | break; | |
3841 | case IORING_UNREGISTER_IOWQ_AFF: | |
3842 | ret = -EINVAL; | |
3843 | if (arg || nr_args) | |
3844 | break; | |
3845 | ret = io_unregister_iowq_aff(ctx); | |
3846 | break; | |
2e480058 JA |
3847 | case IORING_REGISTER_IOWQ_MAX_WORKERS: |
3848 | ret = -EINVAL; | |
3849 | if (!arg || nr_args != 2) | |
3850 | break; | |
3851 | ret = io_register_iowq_max_workers(ctx, arg); | |
3852 | break; | |
e7a6c00d JA |
3853 | case IORING_REGISTER_RING_FDS: |
3854 | ret = io_ringfd_register(ctx, arg, nr_args); | |
3855 | break; | |
3856 | case IORING_UNREGISTER_RING_FDS: | |
3857 | ret = io_ringfd_unregister(ctx, arg, nr_args); | |
3858 | break; | |
c7fb1942 JA |
3859 | case IORING_REGISTER_PBUF_RING: |
3860 | ret = -EINVAL; | |
3861 | if (!arg || nr_args != 1) | |
3862 | break; | |
3863 | ret = io_register_pbuf_ring(ctx, arg); | |
3864 | break; | |
3865 | case IORING_UNREGISTER_PBUF_RING: | |
3866 | ret = -EINVAL; | |
3867 | if (!arg || nr_args != 1) | |
3868 | break; | |
3869 | ret = io_unregister_pbuf_ring(ctx, arg); | |
3870 | break; | |
78a861b9 JA |
3871 | case IORING_REGISTER_SYNC_CANCEL: |
3872 | ret = -EINVAL; | |
3873 | if (!arg || nr_args != 1) | |
3874 | break; | |
3875 | ret = io_sync_cancel(ctx, arg); | |
3876 | break; | |
edafccee JA |
3877 | default: |
3878 | ret = -EINVAL; | |
3879 | break; | |
3880 | } | |
3881 | ||
edafccee JA |
3882 | return ret; |
3883 | } | |
3884 | ||
3885 | SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode, | |
3886 | void __user *, arg, unsigned int, nr_args) | |
3887 | { | |
3888 | struct io_ring_ctx *ctx; | |
3889 | long ret = -EBADF; | |
3890 | struct fd f; | |
3891 | ||
3892 | f = fdget(fd); | |
3893 | if (!f.file) | |
3894 | return -EBADF; | |
3895 | ||
3896 | ret = -EOPNOTSUPP; | |
e5550a14 | 3897 | if (!io_is_uring_fops(f.file)) |
edafccee JA |
3898 | goto out_fput; |
3899 | ||
3900 | ctx = f.file->private_data; | |
3901 | ||
b6c23dd5 PB |
3902 | io_run_task_work(); |
3903 | ||
edafccee JA |
3904 | mutex_lock(&ctx->uring_lock); |
3905 | ret = __io_uring_register(ctx, opcode, arg, nr_args); | |
3906 | mutex_unlock(&ctx->uring_lock); | |
2757be22 | 3907 | trace_io_uring_register(ctx, opcode, ctx->nr_user_files, ctx->nr_user_bufs, ret); |
edafccee JA |
3908 | out_fput: |
3909 | fdput(f); | |
3910 | return ret; | |
3911 | } | |
3912 | ||
2b188cc1 JA |
3913 | static int __init io_uring_init(void) |
3914 | { | |
d7f62e82 SM |
3915 | #define __BUILD_BUG_VERIFY_ELEMENT(stype, eoffset, etype, ename) do { \ |
3916 | BUILD_BUG_ON(offsetof(stype, ename) != eoffset); \ | |
3917 | BUILD_BUG_ON(sizeof(etype) != sizeof_field(stype, ename)); \ | |
3918 | } while (0) | |
3919 | ||
3920 | #define BUILD_BUG_SQE_ELEM(eoffset, etype, ename) \ | |
3921 | __BUILD_BUG_VERIFY_ELEMENT(struct io_uring_sqe, eoffset, etype, ename) | |
3922 | BUILD_BUG_ON(sizeof(struct io_uring_sqe) != 64); | |
3923 | BUILD_BUG_SQE_ELEM(0, __u8, opcode); | |
3924 | BUILD_BUG_SQE_ELEM(1, __u8, flags); | |
3925 | BUILD_BUG_SQE_ELEM(2, __u16, ioprio); | |
3926 | BUILD_BUG_SQE_ELEM(4, __s32, fd); | |
3927 | BUILD_BUG_SQE_ELEM(8, __u64, off); | |
3928 | BUILD_BUG_SQE_ELEM(8, __u64, addr2); | |
3929 | BUILD_BUG_SQE_ELEM(16, __u64, addr); | |
7d67af2c | 3930 | BUILD_BUG_SQE_ELEM(16, __u64, splice_off_in); |
d7f62e82 SM |
3931 | BUILD_BUG_SQE_ELEM(24, __u32, len); |
3932 | BUILD_BUG_SQE_ELEM(28, __kernel_rwf_t, rw_flags); | |
3933 | BUILD_BUG_SQE_ELEM(28, /* compat */ int, rw_flags); | |
3934 | BUILD_BUG_SQE_ELEM(28, /* compat */ __u32, rw_flags); | |
3935 | BUILD_BUG_SQE_ELEM(28, __u32, fsync_flags); | |
5769a351 JX |
3936 | BUILD_BUG_SQE_ELEM(28, /* compat */ __u16, poll_events); |
3937 | BUILD_BUG_SQE_ELEM(28, __u32, poll32_events); | |
d7f62e82 SM |
3938 | BUILD_BUG_SQE_ELEM(28, __u32, sync_range_flags); |
3939 | BUILD_BUG_SQE_ELEM(28, __u32, msg_flags); | |
3940 | BUILD_BUG_SQE_ELEM(28, __u32, timeout_flags); | |
3941 | BUILD_BUG_SQE_ELEM(28, __u32, accept_flags); | |
3942 | BUILD_BUG_SQE_ELEM(28, __u32, cancel_flags); | |
3943 | BUILD_BUG_SQE_ELEM(28, __u32, open_flags); | |
3944 | BUILD_BUG_SQE_ELEM(28, __u32, statx_flags); | |
3945 | BUILD_BUG_SQE_ELEM(28, __u32, fadvise_advice); | |
7d67af2c | 3946 | BUILD_BUG_SQE_ELEM(28, __u32, splice_flags); |
d7f62e82 SM |
3947 | BUILD_BUG_SQE_ELEM(32, __u64, user_data); |
3948 | BUILD_BUG_SQE_ELEM(40, __u16, buf_index); | |
16340eab | 3949 | BUILD_BUG_SQE_ELEM(40, __u16, buf_group); |
d7f62e82 | 3950 | BUILD_BUG_SQE_ELEM(42, __u16, personality); |
7d67af2c | 3951 | BUILD_BUG_SQE_ELEM(44, __s32, splice_fd_in); |
b9445598 | 3952 | BUILD_BUG_SQE_ELEM(44, __u32, file_index); |
e9621e2b | 3953 | BUILD_BUG_SQE_ELEM(48, __u64, addr3); |
d7f62e82 | 3954 | |
b0d658ec PB |
3955 | BUILD_BUG_ON(sizeof(struct io_uring_files_update) != |
3956 | sizeof(struct io_uring_rsrc_update)); | |
3957 | BUILD_BUG_ON(sizeof(struct io_uring_rsrc_update) > | |
3958 | sizeof(struct io_uring_rsrc_update2)); | |
90499ad0 PB |
3959 | |
3960 | /* ->buf_index is u16 */ | |
c7fb1942 JA |
3961 | BUILD_BUG_ON(offsetof(struct io_uring_buf_ring, bufs) != 0); |
3962 | BUILD_BUG_ON(offsetof(struct io_uring_buf, resv) != | |
3963 | offsetof(struct io_uring_buf_ring, tail)); | |
90499ad0 | 3964 | |
b0d658ec PB |
3965 | /* should fit into one byte */ |
3966 | BUILD_BUG_ON(SQE_VALID_FLAGS >= (1 << 8)); | |
68fe256a PB |
3967 | BUILD_BUG_ON(SQE_COMMON_FLAGS >= (1 << 8)); |
3968 | BUILD_BUG_ON((SQE_VALID_FLAGS | SQE_COMMON_FLAGS) != SQE_VALID_FLAGS); | |
b0d658ec | 3969 | |
32c2d33e | 3970 | BUILD_BUG_ON(__REQ_F_LAST_BIT > 8 * sizeof(int)); |
16340eab | 3971 | |
3a4b89a2 JA |
3972 | BUILD_BUG_ON(sizeof(atomic_t) != sizeof(u32)); |
3973 | ||
d9b57aa3 | 3974 | io_uring_optable_init(); |
0702e536 | 3975 | |
91f245d5 JA |
3976 | req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC | |
3977 | SLAB_ACCOUNT); | |
2b188cc1 JA |
3978 | return 0; |
3979 | }; | |
3980 | __initcall(io_uring_init); |