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