]>
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 | |
14 | * through a control-dependency in io_get_cqring (smp_store_release to | |
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> | |
46 | #include <linux/compat.h> | |
47 | #include <linux/refcount.h> | |
48 | #include <linux/uio.h> | |
49 | ||
50 | #include <linux/sched/signal.h> | |
51 | #include <linux/fs.h> | |
52 | #include <linux/file.h> | |
53 | #include <linux/fdtable.h> | |
54 | #include <linux/mm.h> | |
55 | #include <linux/mman.h> | |
56 | #include <linux/mmu_context.h> | |
57 | #include <linux/percpu.h> | |
58 | #include <linux/slab.h> | |
59 | #include <linux/workqueue.h> | |
6c271ce2 | 60 | #include <linux/kthread.h> |
2b188cc1 | 61 | #include <linux/blkdev.h> |
edafccee | 62 | #include <linux/bvec.h> |
2b188cc1 JA |
63 | #include <linux/net.h> |
64 | #include <net/sock.h> | |
65 | #include <net/af_unix.h> | |
6b06314c | 66 | #include <net/scm.h> |
2b188cc1 JA |
67 | #include <linux/anon_inodes.h> |
68 | #include <linux/sched/mm.h> | |
69 | #include <linux/uaccess.h> | |
70 | #include <linux/nospec.h> | |
edafccee JA |
71 | #include <linux/sizes.h> |
72 | #include <linux/hugetlb.h> | |
2b188cc1 JA |
73 | |
74 | #include <uapi/linux/io_uring.h> | |
75 | ||
76 | #include "internal.h" | |
77 | ||
78 | #define IORING_MAX_ENTRIES 4096 | |
6b06314c | 79 | #define IORING_MAX_FIXED_FILES 1024 |
2b188cc1 JA |
80 | |
81 | struct io_uring { | |
82 | u32 head ____cacheline_aligned_in_smp; | |
83 | u32 tail ____cacheline_aligned_in_smp; | |
84 | }; | |
85 | ||
1e84b97b SB |
86 | /* |
87 | * This data is shared with the application through the mmap at offset | |
88 | * IORING_OFF_SQ_RING. | |
89 | * | |
90 | * The offsets to the member fields are published through struct | |
91 | * io_sqring_offsets when calling io_uring_setup. | |
92 | */ | |
2b188cc1 | 93 | struct io_sq_ring { |
1e84b97b SB |
94 | /* |
95 | * Head and tail offsets into the ring; the offsets need to be | |
96 | * masked to get valid indices. | |
97 | * | |
98 | * The kernel controls head and the application controls tail. | |
99 | */ | |
2b188cc1 | 100 | struct io_uring r; |
1e84b97b SB |
101 | /* |
102 | * Bitmask to apply to head and tail offsets (constant, equals | |
103 | * ring_entries - 1) | |
104 | */ | |
2b188cc1 | 105 | u32 ring_mask; |
1e84b97b | 106 | /* Ring size (constant, power of 2) */ |
2b188cc1 | 107 | u32 ring_entries; |
1e84b97b SB |
108 | /* |
109 | * Number of invalid entries dropped by the kernel due to | |
110 | * invalid index stored in array | |
111 | * | |
112 | * Written by the kernel, shouldn't be modified by the | |
113 | * application (i.e. get number of "new events" by comparing to | |
114 | * cached value). | |
115 | * | |
116 | * After a new SQ head value was read by the application this | |
117 | * counter includes all submissions that were dropped reaching | |
118 | * the new SQ head (and possibly more). | |
119 | */ | |
2b188cc1 | 120 | u32 dropped; |
1e84b97b SB |
121 | /* |
122 | * Runtime flags | |
123 | * | |
124 | * Written by the kernel, shouldn't be modified by the | |
125 | * application. | |
126 | * | |
127 | * The application needs a full memory barrier before checking | |
128 | * for IORING_SQ_NEED_WAKEUP after updating the sq tail. | |
129 | */ | |
2b188cc1 | 130 | u32 flags; |
1e84b97b SB |
131 | /* |
132 | * Ring buffer of indices into array of io_uring_sqe, which is | |
133 | * mmapped by the application using the IORING_OFF_SQES offset. | |
134 | * | |
135 | * This indirection could e.g. be used to assign fixed | |
136 | * io_uring_sqe entries to operations and only submit them to | |
137 | * the queue when needed. | |
138 | * | |
139 | * The kernel modifies neither the indices array nor the entries | |
140 | * array. | |
141 | */ | |
2b188cc1 JA |
142 | u32 array[]; |
143 | }; | |
144 | ||
1e84b97b SB |
145 | /* |
146 | * This data is shared with the application through the mmap at offset | |
147 | * IORING_OFF_CQ_RING. | |
148 | * | |
149 | * The offsets to the member fields are published through struct | |
150 | * io_cqring_offsets when calling io_uring_setup. | |
151 | */ | |
2b188cc1 | 152 | struct io_cq_ring { |
1e84b97b SB |
153 | /* |
154 | * Head and tail offsets into the ring; the offsets need to be | |
155 | * masked to get valid indices. | |
156 | * | |
157 | * The application controls head and the kernel tail. | |
158 | */ | |
2b188cc1 | 159 | struct io_uring r; |
1e84b97b SB |
160 | /* |
161 | * Bitmask to apply to head and tail offsets (constant, equals | |
162 | * ring_entries - 1) | |
163 | */ | |
2b188cc1 | 164 | u32 ring_mask; |
1e84b97b | 165 | /* Ring size (constant, power of 2) */ |
2b188cc1 | 166 | u32 ring_entries; |
1e84b97b SB |
167 | /* |
168 | * Number of completion events lost because the queue was full; | |
169 | * this should be avoided by the application by making sure | |
170 | * there are not more requests pending thatn there is space in | |
171 | * the completion queue. | |
172 | * | |
173 | * Written by the kernel, shouldn't be modified by the | |
174 | * application (i.e. get number of "new events" by comparing to | |
175 | * cached value). | |
176 | * | |
177 | * As completion events come in out of order this counter is not | |
178 | * ordered with any other data. | |
179 | */ | |
2b188cc1 | 180 | u32 overflow; |
1e84b97b SB |
181 | /* |
182 | * Ring buffer of completion events. | |
183 | * | |
184 | * The kernel writes completion events fresh every time they are | |
185 | * produced, so the application is allowed to modify pending | |
186 | * entries. | |
187 | */ | |
2b188cc1 JA |
188 | struct io_uring_cqe cqes[]; |
189 | }; | |
190 | ||
edafccee JA |
191 | struct io_mapped_ubuf { |
192 | u64 ubuf; | |
193 | size_t len; | |
194 | struct bio_vec *bvec; | |
195 | unsigned int nr_bvecs; | |
196 | }; | |
197 | ||
31b51510 JA |
198 | struct async_list { |
199 | spinlock_t lock; | |
200 | atomic_t cnt; | |
201 | struct list_head list; | |
202 | ||
203 | struct file *file; | |
204 | off_t io_end; | |
205 | size_t io_pages; | |
206 | }; | |
207 | ||
2b188cc1 JA |
208 | struct io_ring_ctx { |
209 | struct { | |
210 | struct percpu_ref refs; | |
211 | } ____cacheline_aligned_in_smp; | |
212 | ||
213 | struct { | |
214 | unsigned int flags; | |
215 | bool compat; | |
216 | bool account_mem; | |
217 | ||
218 | /* SQ ring */ | |
219 | struct io_sq_ring *sq_ring; | |
220 | unsigned cached_sq_head; | |
221 | unsigned sq_entries; | |
222 | unsigned sq_mask; | |
6c271ce2 | 223 | unsigned sq_thread_idle; |
2b188cc1 | 224 | struct io_uring_sqe *sq_sqes; |
de0617e4 JA |
225 | |
226 | struct list_head defer_list; | |
2b188cc1 JA |
227 | } ____cacheline_aligned_in_smp; |
228 | ||
229 | /* IO offload */ | |
230 | struct workqueue_struct *sqo_wq; | |
6c271ce2 | 231 | struct task_struct *sqo_thread; /* if using sq thread polling */ |
2b188cc1 | 232 | struct mm_struct *sqo_mm; |
6c271ce2 | 233 | wait_queue_head_t sqo_wait; |
a4c0b3de | 234 | struct completion sqo_thread_started; |
2b188cc1 JA |
235 | |
236 | struct { | |
237 | /* CQ ring */ | |
238 | struct io_cq_ring *cq_ring; | |
239 | unsigned cached_cq_tail; | |
240 | unsigned cq_entries; | |
241 | unsigned cq_mask; | |
242 | struct wait_queue_head cq_wait; | |
243 | struct fasync_struct *cq_fasync; | |
9b402849 | 244 | struct eventfd_ctx *cq_ev_fd; |
2b188cc1 JA |
245 | } ____cacheline_aligned_in_smp; |
246 | ||
6b06314c JA |
247 | /* |
248 | * If used, fixed file set. Writers must ensure that ->refs is dead, | |
249 | * readers must ensure that ->refs is alive as long as the file* is | |
250 | * used. Only updated through io_uring_register(2). | |
251 | */ | |
252 | struct file **user_files; | |
253 | unsigned nr_user_files; | |
254 | ||
edafccee JA |
255 | /* if used, fixed mapped user buffers */ |
256 | unsigned nr_user_bufs; | |
257 | struct io_mapped_ubuf *user_bufs; | |
258 | ||
2b188cc1 JA |
259 | struct user_struct *user; |
260 | ||
261 | struct completion ctx_done; | |
262 | ||
263 | struct { | |
264 | struct mutex uring_lock; | |
265 | wait_queue_head_t wait; | |
266 | } ____cacheline_aligned_in_smp; | |
267 | ||
268 | struct { | |
269 | spinlock_t completion_lock; | |
def596e9 JA |
270 | bool poll_multi_file; |
271 | /* | |
272 | * ->poll_list is protected by the ctx->uring_lock for | |
273 | * io_uring instances that don't use IORING_SETUP_SQPOLL. | |
274 | * For SQPOLL, only the single threaded io_sq_thread() will | |
275 | * manipulate the list, hence no extra locking is needed there. | |
276 | */ | |
277 | struct list_head poll_list; | |
221c5eb2 | 278 | struct list_head cancel_list; |
2b188cc1 JA |
279 | } ____cacheline_aligned_in_smp; |
280 | ||
31b51510 JA |
281 | struct async_list pending_async[2]; |
282 | ||
2b188cc1 JA |
283 | #if defined(CONFIG_UNIX) |
284 | struct socket *ring_sock; | |
285 | #endif | |
286 | }; | |
287 | ||
288 | struct sqe_submit { | |
289 | const struct io_uring_sqe *sqe; | |
290 | unsigned short index; | |
291 | bool has_user; | |
def596e9 | 292 | bool needs_lock; |
6c271ce2 | 293 | bool needs_fixed_file; |
2b188cc1 JA |
294 | }; |
295 | ||
09bb8394 JA |
296 | /* |
297 | * First field must be the file pointer in all the | |
298 | * iocb unions! See also 'struct kiocb' in <linux/fs.h> | |
299 | */ | |
221c5eb2 JA |
300 | struct io_poll_iocb { |
301 | struct file *file; | |
302 | struct wait_queue_head *head; | |
303 | __poll_t events; | |
8c838788 | 304 | bool done; |
221c5eb2 JA |
305 | bool canceled; |
306 | struct wait_queue_entry wait; | |
307 | }; | |
308 | ||
09bb8394 JA |
309 | /* |
310 | * NOTE! Each of the iocb union members has the file pointer | |
311 | * as the first entry in their struct definition. So you can | |
312 | * access the file pointer through any of the sub-structs, | |
313 | * or directly as just 'ki_filp' in this struct. | |
314 | */ | |
2b188cc1 | 315 | struct io_kiocb { |
221c5eb2 | 316 | union { |
09bb8394 | 317 | struct file *file; |
221c5eb2 JA |
318 | struct kiocb rw; |
319 | struct io_poll_iocb poll; | |
320 | }; | |
2b188cc1 JA |
321 | |
322 | struct sqe_submit submit; | |
323 | ||
324 | struct io_ring_ctx *ctx; | |
325 | struct list_head list; | |
9e645e11 | 326 | struct list_head link_list; |
2b188cc1 | 327 | unsigned int flags; |
c16361c1 | 328 | refcount_t refs; |
8449eeda | 329 | #define REQ_F_NOWAIT 1 /* must not punt to workers */ |
def596e9 | 330 | #define REQ_F_IOPOLL_COMPLETED 2 /* polled IO has completed */ |
6b06314c | 331 | #define REQ_F_FIXED_FILE 4 /* ctx owns file */ |
31b51510 | 332 | #define REQ_F_SEQ_PREV 8 /* sequential with previous */ |
e2033e33 SB |
333 | #define REQ_F_IO_DRAIN 16 /* drain existing IO first */ |
334 | #define REQ_F_IO_DRAINED 32 /* drain done */ | |
9e645e11 JA |
335 | #define REQ_F_LINK 64 /* linked sqes */ |
336 | #define REQ_F_FAIL_LINK 128 /* fail rest of links */ | |
2b188cc1 | 337 | u64 user_data; |
9e645e11 | 338 | u32 result; |
de0617e4 | 339 | u32 sequence; |
2b188cc1 JA |
340 | |
341 | struct work_struct work; | |
342 | }; | |
343 | ||
344 | #define IO_PLUG_THRESHOLD 2 | |
def596e9 | 345 | #define IO_IOPOLL_BATCH 8 |
2b188cc1 | 346 | |
9a56a232 JA |
347 | struct io_submit_state { |
348 | struct blk_plug plug; | |
349 | ||
2579f913 JA |
350 | /* |
351 | * io_kiocb alloc cache | |
352 | */ | |
353 | void *reqs[IO_IOPOLL_BATCH]; | |
354 | unsigned int free_reqs; | |
355 | unsigned int cur_req; | |
356 | ||
9a56a232 JA |
357 | /* |
358 | * File reference cache | |
359 | */ | |
360 | struct file *file; | |
361 | unsigned int fd; | |
362 | unsigned int has_refs; | |
363 | unsigned int used_refs; | |
364 | unsigned int ios_left; | |
365 | }; | |
366 | ||
de0617e4 JA |
367 | static void io_sq_wq_submit_work(struct work_struct *work); |
368 | ||
2b188cc1 JA |
369 | static struct kmem_cache *req_cachep; |
370 | ||
371 | static const struct file_operations io_uring_fops; | |
372 | ||
373 | struct sock *io_uring_get_socket(struct file *file) | |
374 | { | |
375 | #if defined(CONFIG_UNIX) | |
376 | if (file->f_op == &io_uring_fops) { | |
377 | struct io_ring_ctx *ctx = file->private_data; | |
378 | ||
379 | return ctx->ring_sock->sk; | |
380 | } | |
381 | #endif | |
382 | return NULL; | |
383 | } | |
384 | EXPORT_SYMBOL(io_uring_get_socket); | |
385 | ||
386 | static void io_ring_ctx_ref_free(struct percpu_ref *ref) | |
387 | { | |
388 | struct io_ring_ctx *ctx = container_of(ref, struct io_ring_ctx, refs); | |
389 | ||
390 | complete(&ctx->ctx_done); | |
391 | } | |
392 | ||
393 | static struct io_ring_ctx *io_ring_ctx_alloc(struct io_uring_params *p) | |
394 | { | |
395 | struct io_ring_ctx *ctx; | |
31b51510 | 396 | int i; |
2b188cc1 JA |
397 | |
398 | ctx = kzalloc(sizeof(*ctx), GFP_KERNEL); | |
399 | if (!ctx) | |
400 | return NULL; | |
401 | ||
21482896 RG |
402 | if (percpu_ref_init(&ctx->refs, io_ring_ctx_ref_free, |
403 | PERCPU_REF_ALLOW_REINIT, GFP_KERNEL)) { | |
2b188cc1 JA |
404 | kfree(ctx); |
405 | return NULL; | |
406 | } | |
407 | ||
408 | ctx->flags = p->flags; | |
409 | init_waitqueue_head(&ctx->cq_wait); | |
410 | init_completion(&ctx->ctx_done); | |
a4c0b3de | 411 | init_completion(&ctx->sqo_thread_started); |
2b188cc1 JA |
412 | mutex_init(&ctx->uring_lock); |
413 | init_waitqueue_head(&ctx->wait); | |
31b51510 JA |
414 | for (i = 0; i < ARRAY_SIZE(ctx->pending_async); i++) { |
415 | spin_lock_init(&ctx->pending_async[i].lock); | |
416 | INIT_LIST_HEAD(&ctx->pending_async[i].list); | |
417 | atomic_set(&ctx->pending_async[i].cnt, 0); | |
418 | } | |
2b188cc1 | 419 | spin_lock_init(&ctx->completion_lock); |
def596e9 | 420 | INIT_LIST_HEAD(&ctx->poll_list); |
221c5eb2 | 421 | INIT_LIST_HEAD(&ctx->cancel_list); |
de0617e4 | 422 | INIT_LIST_HEAD(&ctx->defer_list); |
2b188cc1 JA |
423 | return ctx; |
424 | } | |
425 | ||
de0617e4 JA |
426 | static inline bool io_sequence_defer(struct io_ring_ctx *ctx, |
427 | struct io_kiocb *req) | |
428 | { | |
429 | if ((req->flags & (REQ_F_IO_DRAIN|REQ_F_IO_DRAINED)) != REQ_F_IO_DRAIN) | |
430 | return false; | |
431 | ||
432 | return req->sequence > ctx->cached_cq_tail + ctx->sq_ring->dropped; | |
433 | } | |
434 | ||
435 | static struct io_kiocb *io_get_deferred_req(struct io_ring_ctx *ctx) | |
436 | { | |
437 | struct io_kiocb *req; | |
438 | ||
439 | if (list_empty(&ctx->defer_list)) | |
440 | return NULL; | |
441 | ||
442 | req = list_first_entry(&ctx->defer_list, struct io_kiocb, list); | |
443 | if (!io_sequence_defer(ctx, req)) { | |
444 | list_del_init(&req->list); | |
445 | return req; | |
446 | } | |
447 | ||
448 | return NULL; | |
449 | } | |
450 | ||
451 | static void __io_commit_cqring(struct io_ring_ctx *ctx) | |
2b188cc1 JA |
452 | { |
453 | struct io_cq_ring *ring = ctx->cq_ring; | |
454 | ||
455 | if (ctx->cached_cq_tail != READ_ONCE(ring->r.tail)) { | |
456 | /* order cqe stores with ring update */ | |
457 | smp_store_release(&ring->r.tail, ctx->cached_cq_tail); | |
458 | ||
2b188cc1 JA |
459 | if (wq_has_sleeper(&ctx->cq_wait)) { |
460 | wake_up_interruptible(&ctx->cq_wait); | |
461 | kill_fasync(&ctx->cq_fasync, SIGIO, POLL_IN); | |
462 | } | |
463 | } | |
464 | } | |
465 | ||
de0617e4 JA |
466 | static void io_commit_cqring(struct io_ring_ctx *ctx) |
467 | { | |
468 | struct io_kiocb *req; | |
469 | ||
470 | __io_commit_cqring(ctx); | |
471 | ||
472 | while ((req = io_get_deferred_req(ctx)) != NULL) { | |
473 | req->flags |= REQ_F_IO_DRAINED; | |
474 | queue_work(ctx->sqo_wq, &req->work); | |
475 | } | |
476 | } | |
477 | ||
2b188cc1 JA |
478 | static struct io_uring_cqe *io_get_cqring(struct io_ring_ctx *ctx) |
479 | { | |
480 | struct io_cq_ring *ring = ctx->cq_ring; | |
481 | unsigned tail; | |
482 | ||
483 | tail = ctx->cached_cq_tail; | |
115e12e5 SB |
484 | /* |
485 | * writes to the cq entry need to come after reading head; the | |
486 | * control dependency is enough as we're using WRITE_ONCE to | |
487 | * fill the cq entry | |
488 | */ | |
74f464e9 | 489 | if (tail - READ_ONCE(ring->r.head) == ring->ring_entries) |
2b188cc1 JA |
490 | return NULL; |
491 | ||
492 | ctx->cached_cq_tail++; | |
493 | return &ring->cqes[tail & ctx->cq_mask]; | |
494 | } | |
495 | ||
496 | static void io_cqring_fill_event(struct io_ring_ctx *ctx, u64 ki_user_data, | |
c71ffb67 | 497 | long res) |
2b188cc1 JA |
498 | { |
499 | struct io_uring_cqe *cqe; | |
500 | ||
501 | /* | |
502 | * If we can't get a cq entry, userspace overflowed the | |
503 | * submission (by quite a lot). Increment the overflow count in | |
504 | * the ring. | |
505 | */ | |
506 | cqe = io_get_cqring(ctx); | |
507 | if (cqe) { | |
508 | WRITE_ONCE(cqe->user_data, ki_user_data); | |
509 | WRITE_ONCE(cqe->res, res); | |
c71ffb67 | 510 | WRITE_ONCE(cqe->flags, 0); |
2b188cc1 JA |
511 | } else { |
512 | unsigned overflow = READ_ONCE(ctx->cq_ring->overflow); | |
513 | ||
514 | WRITE_ONCE(ctx->cq_ring->overflow, overflow + 1); | |
515 | } | |
516 | } | |
517 | ||
8c838788 JA |
518 | static void io_cqring_ev_posted(struct io_ring_ctx *ctx) |
519 | { | |
520 | if (waitqueue_active(&ctx->wait)) | |
521 | wake_up(&ctx->wait); | |
522 | if (waitqueue_active(&ctx->sqo_wait)) | |
523 | wake_up(&ctx->sqo_wait); | |
9b402849 JA |
524 | if (ctx->cq_ev_fd) |
525 | eventfd_signal(ctx->cq_ev_fd, 1); | |
8c838788 JA |
526 | } |
527 | ||
528 | static void io_cqring_add_event(struct io_ring_ctx *ctx, u64 user_data, | |
c71ffb67 | 529 | long res) |
2b188cc1 JA |
530 | { |
531 | unsigned long flags; | |
532 | ||
533 | spin_lock_irqsave(&ctx->completion_lock, flags); | |
c71ffb67 | 534 | io_cqring_fill_event(ctx, user_data, res); |
2b188cc1 JA |
535 | io_commit_cqring(ctx); |
536 | spin_unlock_irqrestore(&ctx->completion_lock, flags); | |
537 | ||
8c838788 | 538 | io_cqring_ev_posted(ctx); |
2b188cc1 JA |
539 | } |
540 | ||
541 | static void io_ring_drop_ctx_refs(struct io_ring_ctx *ctx, unsigned refs) | |
542 | { | |
543 | percpu_ref_put_many(&ctx->refs, refs); | |
544 | ||
545 | if (waitqueue_active(&ctx->wait)) | |
546 | wake_up(&ctx->wait); | |
547 | } | |
548 | ||
2579f913 JA |
549 | static struct io_kiocb *io_get_req(struct io_ring_ctx *ctx, |
550 | struct io_submit_state *state) | |
2b188cc1 | 551 | { |
fd6fab2c | 552 | gfp_t gfp = GFP_KERNEL | __GFP_NOWARN; |
2b188cc1 JA |
553 | struct io_kiocb *req; |
554 | ||
555 | if (!percpu_ref_tryget(&ctx->refs)) | |
556 | return NULL; | |
557 | ||
2579f913 | 558 | if (!state) { |
fd6fab2c | 559 | req = kmem_cache_alloc(req_cachep, gfp); |
2579f913 JA |
560 | if (unlikely(!req)) |
561 | goto out; | |
562 | } else if (!state->free_reqs) { | |
563 | size_t sz; | |
564 | int ret; | |
565 | ||
566 | sz = min_t(size_t, state->ios_left, ARRAY_SIZE(state->reqs)); | |
fd6fab2c JA |
567 | ret = kmem_cache_alloc_bulk(req_cachep, gfp, sz, state->reqs); |
568 | ||
569 | /* | |
570 | * Bulk alloc is all-or-nothing. If we fail to get a batch, | |
571 | * retry single alloc to be on the safe side. | |
572 | */ | |
573 | if (unlikely(ret <= 0)) { | |
574 | state->reqs[0] = kmem_cache_alloc(req_cachep, gfp); | |
575 | if (!state->reqs[0]) | |
576 | goto out; | |
577 | ret = 1; | |
578 | } | |
2579f913 JA |
579 | state->free_reqs = ret - 1; |
580 | state->cur_req = 1; | |
581 | req = state->reqs[0]; | |
582 | } else { | |
583 | req = state->reqs[state->cur_req]; | |
584 | state->free_reqs--; | |
585 | state->cur_req++; | |
2b188cc1 JA |
586 | } |
587 | ||
60c112b0 | 588 | req->file = NULL; |
2579f913 JA |
589 | req->ctx = ctx; |
590 | req->flags = 0; | |
e65ef56d JA |
591 | /* one is dropped after submission, the other at completion */ |
592 | refcount_set(&req->refs, 2); | |
9e645e11 | 593 | req->result = 0; |
2579f913 JA |
594 | return req; |
595 | out: | |
2b188cc1 JA |
596 | io_ring_drop_ctx_refs(ctx, 1); |
597 | return NULL; | |
598 | } | |
599 | ||
def596e9 JA |
600 | static void io_free_req_many(struct io_ring_ctx *ctx, void **reqs, int *nr) |
601 | { | |
602 | if (*nr) { | |
603 | kmem_cache_free_bulk(req_cachep, *nr, reqs); | |
604 | io_ring_drop_ctx_refs(ctx, *nr); | |
605 | *nr = 0; | |
606 | } | |
607 | } | |
608 | ||
9e645e11 | 609 | static void __io_free_req(struct io_kiocb *req) |
2b188cc1 | 610 | { |
09bb8394 JA |
611 | if (req->file && !(req->flags & REQ_F_FIXED_FILE)) |
612 | fput(req->file); | |
e65ef56d JA |
613 | io_ring_drop_ctx_refs(req->ctx, 1); |
614 | kmem_cache_free(req_cachep, req); | |
615 | } | |
616 | ||
9e645e11 JA |
617 | static void io_req_link_next(struct io_kiocb *req) |
618 | { | |
619 | struct io_kiocb *nxt; | |
620 | ||
621 | /* | |
622 | * The list should never be empty when we are called here. But could | |
623 | * potentially happen if the chain is messed up, check to be on the | |
624 | * safe side. | |
625 | */ | |
626 | nxt = list_first_entry_or_null(&req->link_list, struct io_kiocb, list); | |
627 | if (nxt) { | |
628 | list_del(&nxt->list); | |
629 | if (!list_empty(&req->link_list)) { | |
630 | INIT_LIST_HEAD(&nxt->link_list); | |
631 | list_splice(&req->link_list, &nxt->link_list); | |
632 | nxt->flags |= REQ_F_LINK; | |
633 | } | |
634 | ||
635 | INIT_WORK(&nxt->work, io_sq_wq_submit_work); | |
636 | queue_work(req->ctx->sqo_wq, &nxt->work); | |
637 | } | |
638 | } | |
639 | ||
640 | /* | |
641 | * Called if REQ_F_LINK is set, and we fail the head request | |
642 | */ | |
643 | static void io_fail_links(struct io_kiocb *req) | |
644 | { | |
645 | struct io_kiocb *link; | |
646 | ||
647 | while (!list_empty(&req->link_list)) { | |
648 | link = list_first_entry(&req->link_list, struct io_kiocb, list); | |
649 | list_del(&link->list); | |
650 | ||
651 | io_cqring_add_event(req->ctx, link->user_data, -ECANCELED); | |
652 | __io_free_req(link); | |
653 | } | |
654 | } | |
655 | ||
656 | static void io_free_req(struct io_kiocb *req) | |
657 | { | |
658 | /* | |
659 | * If LINK is set, we have dependent requests in this chain. If we | |
660 | * didn't fail this request, queue the first one up, moving any other | |
661 | * dependencies to the next request. In case of failure, fail the rest | |
662 | * of the chain. | |
663 | */ | |
664 | if (req->flags & REQ_F_LINK) { | |
665 | if (req->flags & REQ_F_FAIL_LINK) | |
666 | io_fail_links(req); | |
667 | else | |
668 | io_req_link_next(req); | |
669 | } | |
670 | ||
671 | __io_free_req(req); | |
672 | } | |
673 | ||
e65ef56d JA |
674 | static void io_put_req(struct io_kiocb *req) |
675 | { | |
676 | if (refcount_dec_and_test(&req->refs)) | |
677 | io_free_req(req); | |
2b188cc1 JA |
678 | } |
679 | ||
def596e9 JA |
680 | /* |
681 | * Find and free completed poll iocbs | |
682 | */ | |
683 | static void io_iopoll_complete(struct io_ring_ctx *ctx, unsigned int *nr_events, | |
684 | struct list_head *done) | |
685 | { | |
686 | void *reqs[IO_IOPOLL_BATCH]; | |
687 | struct io_kiocb *req; | |
09bb8394 | 688 | int to_free; |
def596e9 | 689 | |
09bb8394 | 690 | to_free = 0; |
def596e9 JA |
691 | while (!list_empty(done)) { |
692 | req = list_first_entry(done, struct io_kiocb, list); | |
693 | list_del(&req->list); | |
694 | ||
9e645e11 | 695 | io_cqring_fill_event(ctx, req->user_data, req->result); |
def596e9 JA |
696 | (*nr_events)++; |
697 | ||
09bb8394 JA |
698 | if (refcount_dec_and_test(&req->refs)) { |
699 | /* If we're not using fixed files, we have to pair the | |
700 | * completion part with the file put. Use regular | |
701 | * completions for those, only batch free for fixed | |
9e645e11 | 702 | * file and non-linked commands. |
09bb8394 | 703 | */ |
9e645e11 JA |
704 | if ((req->flags & (REQ_F_FIXED_FILE|REQ_F_LINK)) == |
705 | REQ_F_FIXED_FILE) { | |
09bb8394 JA |
706 | reqs[to_free++] = req; |
707 | if (to_free == ARRAY_SIZE(reqs)) | |
708 | io_free_req_many(ctx, reqs, &to_free); | |
6b06314c | 709 | } else { |
09bb8394 | 710 | io_free_req(req); |
6b06314c | 711 | } |
9a56a232 | 712 | } |
def596e9 | 713 | } |
def596e9 | 714 | |
09bb8394 | 715 | io_commit_cqring(ctx); |
def596e9 JA |
716 | io_free_req_many(ctx, reqs, &to_free); |
717 | } | |
718 | ||
719 | static int io_do_iopoll(struct io_ring_ctx *ctx, unsigned int *nr_events, | |
720 | long min) | |
721 | { | |
722 | struct io_kiocb *req, *tmp; | |
723 | LIST_HEAD(done); | |
724 | bool spin; | |
725 | int ret; | |
726 | ||
727 | /* | |
728 | * Only spin for completions if we don't have multiple devices hanging | |
729 | * off our complete list, and we're under the requested amount. | |
730 | */ | |
731 | spin = !ctx->poll_multi_file && *nr_events < min; | |
732 | ||
733 | ret = 0; | |
734 | list_for_each_entry_safe(req, tmp, &ctx->poll_list, list) { | |
735 | struct kiocb *kiocb = &req->rw; | |
736 | ||
737 | /* | |
738 | * Move completed entries to our local list. If we find a | |
739 | * request that requires polling, break out and complete | |
740 | * the done list first, if we have entries there. | |
741 | */ | |
742 | if (req->flags & REQ_F_IOPOLL_COMPLETED) { | |
743 | list_move_tail(&req->list, &done); | |
744 | continue; | |
745 | } | |
746 | if (!list_empty(&done)) | |
747 | break; | |
748 | ||
749 | ret = kiocb->ki_filp->f_op->iopoll(kiocb, spin); | |
750 | if (ret < 0) | |
751 | break; | |
752 | ||
753 | if (ret && spin) | |
754 | spin = false; | |
755 | ret = 0; | |
756 | } | |
757 | ||
758 | if (!list_empty(&done)) | |
759 | io_iopoll_complete(ctx, nr_events, &done); | |
760 | ||
761 | return ret; | |
762 | } | |
763 | ||
764 | /* | |
765 | * Poll for a mininum of 'min' events. Note that if min == 0 we consider that a | |
766 | * non-spinning poll check - we'll still enter the driver poll loop, but only | |
767 | * as a non-spinning completion check. | |
768 | */ | |
769 | static int io_iopoll_getevents(struct io_ring_ctx *ctx, unsigned int *nr_events, | |
770 | long min) | |
771 | { | |
772 | while (!list_empty(&ctx->poll_list)) { | |
773 | int ret; | |
774 | ||
775 | ret = io_do_iopoll(ctx, nr_events, min); | |
776 | if (ret < 0) | |
777 | return ret; | |
778 | if (!min || *nr_events >= min) | |
779 | return 0; | |
780 | } | |
781 | ||
782 | return 1; | |
783 | } | |
784 | ||
785 | /* | |
786 | * We can't just wait for polled events to come to us, we have to actively | |
787 | * find and complete them. | |
788 | */ | |
789 | static void io_iopoll_reap_events(struct io_ring_ctx *ctx) | |
790 | { | |
791 | if (!(ctx->flags & IORING_SETUP_IOPOLL)) | |
792 | return; | |
793 | ||
794 | mutex_lock(&ctx->uring_lock); | |
795 | while (!list_empty(&ctx->poll_list)) { | |
796 | unsigned int nr_events = 0; | |
797 | ||
798 | io_iopoll_getevents(ctx, &nr_events, 1); | |
799 | } | |
800 | mutex_unlock(&ctx->uring_lock); | |
801 | } | |
802 | ||
803 | static int io_iopoll_check(struct io_ring_ctx *ctx, unsigned *nr_events, | |
804 | long min) | |
805 | { | |
806 | int ret = 0; | |
807 | ||
808 | do { | |
809 | int tmin = 0; | |
810 | ||
811 | if (*nr_events < min) | |
812 | tmin = min - *nr_events; | |
813 | ||
814 | ret = io_iopoll_getevents(ctx, nr_events, tmin); | |
815 | if (ret <= 0) | |
816 | break; | |
817 | ret = 0; | |
818 | } while (min && !*nr_events && !need_resched()); | |
819 | ||
820 | return ret; | |
821 | } | |
822 | ||
2b188cc1 JA |
823 | static void kiocb_end_write(struct kiocb *kiocb) |
824 | { | |
825 | if (kiocb->ki_flags & IOCB_WRITE) { | |
826 | struct inode *inode = file_inode(kiocb->ki_filp); | |
827 | ||
828 | /* | |
829 | * Tell lockdep we inherited freeze protection from submission | |
830 | * thread. | |
831 | */ | |
832 | if (S_ISREG(inode->i_mode)) | |
833 | __sb_writers_acquired(inode->i_sb, SB_FREEZE_WRITE); | |
834 | file_end_write(kiocb->ki_filp); | |
835 | } | |
836 | } | |
837 | ||
838 | static void io_complete_rw(struct kiocb *kiocb, long res, long res2) | |
839 | { | |
840 | struct io_kiocb *req = container_of(kiocb, struct io_kiocb, rw); | |
841 | ||
842 | kiocb_end_write(kiocb); | |
843 | ||
9e645e11 JA |
844 | if ((req->flags & REQ_F_LINK) && res != req->result) |
845 | req->flags |= REQ_F_FAIL_LINK; | |
c71ffb67 | 846 | io_cqring_add_event(req->ctx, req->user_data, res); |
e65ef56d | 847 | io_put_req(req); |
2b188cc1 JA |
848 | } |
849 | ||
def596e9 JA |
850 | static void io_complete_rw_iopoll(struct kiocb *kiocb, long res, long res2) |
851 | { | |
852 | struct io_kiocb *req = container_of(kiocb, struct io_kiocb, rw); | |
853 | ||
854 | kiocb_end_write(kiocb); | |
855 | ||
9e645e11 JA |
856 | if ((req->flags & REQ_F_LINK) && res != req->result) |
857 | req->flags |= REQ_F_FAIL_LINK; | |
858 | req->result = res; | |
def596e9 JA |
859 | if (res != -EAGAIN) |
860 | req->flags |= REQ_F_IOPOLL_COMPLETED; | |
861 | } | |
862 | ||
863 | /* | |
864 | * After the iocb has been issued, it's safe to be found on the poll list. | |
865 | * Adding the kiocb to the list AFTER submission ensures that we don't | |
866 | * find it from a io_iopoll_getevents() thread before the issuer is done | |
867 | * accessing the kiocb cookie. | |
868 | */ | |
869 | static void io_iopoll_req_issued(struct io_kiocb *req) | |
870 | { | |
871 | struct io_ring_ctx *ctx = req->ctx; | |
872 | ||
873 | /* | |
874 | * Track whether we have multiple files in our lists. This will impact | |
875 | * how we do polling eventually, not spinning if we're on potentially | |
876 | * different devices. | |
877 | */ | |
878 | if (list_empty(&ctx->poll_list)) { | |
879 | ctx->poll_multi_file = false; | |
880 | } else if (!ctx->poll_multi_file) { | |
881 | struct io_kiocb *list_req; | |
882 | ||
883 | list_req = list_first_entry(&ctx->poll_list, struct io_kiocb, | |
884 | list); | |
885 | if (list_req->rw.ki_filp != req->rw.ki_filp) | |
886 | ctx->poll_multi_file = true; | |
887 | } | |
888 | ||
889 | /* | |
890 | * For fast devices, IO may have already completed. If it has, add | |
891 | * it to the front so we find it first. | |
892 | */ | |
893 | if (req->flags & REQ_F_IOPOLL_COMPLETED) | |
894 | list_add(&req->list, &ctx->poll_list); | |
895 | else | |
896 | list_add_tail(&req->list, &ctx->poll_list); | |
897 | } | |
898 | ||
3d6770fb | 899 | static void io_file_put(struct io_submit_state *state) |
9a56a232 | 900 | { |
3d6770fb | 901 | if (state->file) { |
9a56a232 JA |
902 | int diff = state->has_refs - state->used_refs; |
903 | ||
904 | if (diff) | |
905 | fput_many(state->file, diff); | |
906 | state->file = NULL; | |
907 | } | |
908 | } | |
909 | ||
910 | /* | |
911 | * Get as many references to a file as we have IOs left in this submission, | |
912 | * assuming most submissions are for one file, or at least that each file | |
913 | * has more than one submission. | |
914 | */ | |
915 | static struct file *io_file_get(struct io_submit_state *state, int fd) | |
916 | { | |
917 | if (!state) | |
918 | return fget(fd); | |
919 | ||
920 | if (state->file) { | |
921 | if (state->fd == fd) { | |
922 | state->used_refs++; | |
923 | state->ios_left--; | |
924 | return state->file; | |
925 | } | |
3d6770fb | 926 | io_file_put(state); |
9a56a232 JA |
927 | } |
928 | state->file = fget_many(fd, state->ios_left); | |
929 | if (!state->file) | |
930 | return NULL; | |
931 | ||
932 | state->fd = fd; | |
933 | state->has_refs = state->ios_left; | |
934 | state->used_refs = 1; | |
935 | state->ios_left--; | |
936 | return state->file; | |
937 | } | |
938 | ||
2b188cc1 JA |
939 | /* |
940 | * If we tracked the file through the SCM inflight mechanism, we could support | |
941 | * any file. For now, just ensure that anything potentially problematic is done | |
942 | * inline. | |
943 | */ | |
944 | static bool io_file_supports_async(struct file *file) | |
945 | { | |
946 | umode_t mode = file_inode(file)->i_mode; | |
947 | ||
948 | if (S_ISBLK(mode) || S_ISCHR(mode)) | |
949 | return true; | |
950 | if (S_ISREG(mode) && file->f_op != &io_uring_fops) | |
951 | return true; | |
952 | ||
953 | return false; | |
954 | } | |
955 | ||
6c271ce2 | 956 | static int io_prep_rw(struct io_kiocb *req, const struct sqe_submit *s, |
8358e3a8 | 957 | bool force_nonblock) |
2b188cc1 | 958 | { |
6c271ce2 | 959 | const struct io_uring_sqe *sqe = s->sqe; |
def596e9 | 960 | struct io_ring_ctx *ctx = req->ctx; |
2b188cc1 | 961 | struct kiocb *kiocb = &req->rw; |
09bb8394 JA |
962 | unsigned ioprio; |
963 | int ret; | |
2b188cc1 | 964 | |
09bb8394 JA |
965 | if (!req->file) |
966 | return -EBADF; | |
2b188cc1 | 967 | |
09bb8394 JA |
968 | if (force_nonblock && !io_file_supports_async(req->file)) |
969 | force_nonblock = false; | |
6b06314c | 970 | |
2b188cc1 JA |
971 | kiocb->ki_pos = READ_ONCE(sqe->off); |
972 | kiocb->ki_flags = iocb_flags(kiocb->ki_filp); | |
973 | kiocb->ki_hint = ki_hint_validate(file_write_hint(kiocb->ki_filp)); | |
974 | ||
975 | ioprio = READ_ONCE(sqe->ioprio); | |
976 | if (ioprio) { | |
977 | ret = ioprio_check_cap(ioprio); | |
978 | if (ret) | |
09bb8394 | 979 | return ret; |
2b188cc1 JA |
980 | |
981 | kiocb->ki_ioprio = ioprio; | |
982 | } else | |
983 | kiocb->ki_ioprio = get_current_ioprio(); | |
984 | ||
985 | ret = kiocb_set_rw_flags(kiocb, READ_ONCE(sqe->rw_flags)); | |
986 | if (unlikely(ret)) | |
09bb8394 | 987 | return ret; |
8449eeda SB |
988 | |
989 | /* don't allow async punt if RWF_NOWAIT was requested */ | |
990 | if (kiocb->ki_flags & IOCB_NOWAIT) | |
991 | req->flags |= REQ_F_NOWAIT; | |
992 | ||
993 | if (force_nonblock) | |
2b188cc1 | 994 | kiocb->ki_flags |= IOCB_NOWAIT; |
8449eeda | 995 | |
def596e9 | 996 | if (ctx->flags & IORING_SETUP_IOPOLL) { |
def596e9 JA |
997 | if (!(kiocb->ki_flags & IOCB_DIRECT) || |
998 | !kiocb->ki_filp->f_op->iopoll) | |
09bb8394 | 999 | return -EOPNOTSUPP; |
2b188cc1 | 1000 | |
def596e9 JA |
1001 | kiocb->ki_flags |= IOCB_HIPRI; |
1002 | kiocb->ki_complete = io_complete_rw_iopoll; | |
1003 | } else { | |
09bb8394 JA |
1004 | if (kiocb->ki_flags & IOCB_HIPRI) |
1005 | return -EINVAL; | |
def596e9 JA |
1006 | kiocb->ki_complete = io_complete_rw; |
1007 | } | |
2b188cc1 | 1008 | return 0; |
2b188cc1 JA |
1009 | } |
1010 | ||
1011 | static inline void io_rw_done(struct kiocb *kiocb, ssize_t ret) | |
1012 | { | |
1013 | switch (ret) { | |
1014 | case -EIOCBQUEUED: | |
1015 | break; | |
1016 | case -ERESTARTSYS: | |
1017 | case -ERESTARTNOINTR: | |
1018 | case -ERESTARTNOHAND: | |
1019 | case -ERESTART_RESTARTBLOCK: | |
1020 | /* | |
1021 | * We can't just restart the syscall, since previously | |
1022 | * submitted sqes may already be in progress. Just fail this | |
1023 | * IO with EINTR. | |
1024 | */ | |
1025 | ret = -EINTR; | |
1026 | /* fall through */ | |
1027 | default: | |
1028 | kiocb->ki_complete(kiocb, ret, 0); | |
1029 | } | |
1030 | } | |
1031 | ||
edafccee JA |
1032 | static int io_import_fixed(struct io_ring_ctx *ctx, int rw, |
1033 | const struct io_uring_sqe *sqe, | |
1034 | struct iov_iter *iter) | |
1035 | { | |
1036 | size_t len = READ_ONCE(sqe->len); | |
1037 | struct io_mapped_ubuf *imu; | |
1038 | unsigned index, buf_index; | |
1039 | size_t offset; | |
1040 | u64 buf_addr; | |
1041 | ||
1042 | /* attempt to use fixed buffers without having provided iovecs */ | |
1043 | if (unlikely(!ctx->user_bufs)) | |
1044 | return -EFAULT; | |
1045 | ||
1046 | buf_index = READ_ONCE(sqe->buf_index); | |
1047 | if (unlikely(buf_index >= ctx->nr_user_bufs)) | |
1048 | return -EFAULT; | |
1049 | ||
1050 | index = array_index_nospec(buf_index, ctx->nr_user_bufs); | |
1051 | imu = &ctx->user_bufs[index]; | |
1052 | buf_addr = READ_ONCE(sqe->addr); | |
1053 | ||
1054 | /* overflow */ | |
1055 | if (buf_addr + len < buf_addr) | |
1056 | return -EFAULT; | |
1057 | /* not inside the mapped region */ | |
1058 | if (buf_addr < imu->ubuf || buf_addr + len > imu->ubuf + imu->len) | |
1059 | return -EFAULT; | |
1060 | ||
1061 | /* | |
1062 | * May not be a start of buffer, set size appropriately | |
1063 | * and advance us to the beginning. | |
1064 | */ | |
1065 | offset = buf_addr - imu->ubuf; | |
1066 | iov_iter_bvec(iter, rw, imu->bvec, imu->nr_bvecs, offset + len); | |
1067 | if (offset) | |
1068 | iov_iter_advance(iter, offset); | |
1069 | return 0; | |
1070 | } | |
1071 | ||
87e5e6da JA |
1072 | static ssize_t io_import_iovec(struct io_ring_ctx *ctx, int rw, |
1073 | const struct sqe_submit *s, struct iovec **iovec, | |
1074 | struct iov_iter *iter) | |
2b188cc1 JA |
1075 | { |
1076 | const struct io_uring_sqe *sqe = s->sqe; | |
1077 | void __user *buf = u64_to_user_ptr(READ_ONCE(sqe->addr)); | |
1078 | size_t sqe_len = READ_ONCE(sqe->len); | |
edafccee JA |
1079 | u8 opcode; |
1080 | ||
1081 | /* | |
1082 | * We're reading ->opcode for the second time, but the first read | |
1083 | * doesn't care whether it's _FIXED or not, so it doesn't matter | |
1084 | * whether ->opcode changes concurrently. The first read does care | |
1085 | * about whether it is a READ or a WRITE, so we don't trust this read | |
1086 | * for that purpose and instead let the caller pass in the read/write | |
1087 | * flag. | |
1088 | */ | |
1089 | opcode = READ_ONCE(sqe->opcode); | |
1090 | if (opcode == IORING_OP_READ_FIXED || | |
1091 | opcode == IORING_OP_WRITE_FIXED) { | |
87e5e6da | 1092 | ssize_t ret = io_import_fixed(ctx, rw, sqe, iter); |
edafccee JA |
1093 | *iovec = NULL; |
1094 | return ret; | |
1095 | } | |
2b188cc1 JA |
1096 | |
1097 | if (!s->has_user) | |
1098 | return -EFAULT; | |
1099 | ||
1100 | #ifdef CONFIG_COMPAT | |
1101 | if (ctx->compat) | |
1102 | return compat_import_iovec(rw, buf, sqe_len, UIO_FASTIOV, | |
1103 | iovec, iter); | |
1104 | #endif | |
1105 | ||
1106 | return import_iovec(rw, buf, sqe_len, UIO_FASTIOV, iovec, iter); | |
1107 | } | |
1108 | ||
31b51510 JA |
1109 | /* |
1110 | * Make a note of the last file/offset/direction we punted to async | |
1111 | * context. We'll use this information to see if we can piggy back a | |
1112 | * sequential request onto the previous one, if it's still hasn't been | |
1113 | * completed by the async worker. | |
1114 | */ | |
1115 | static void io_async_list_note(int rw, struct io_kiocb *req, size_t len) | |
1116 | { | |
1117 | struct async_list *async_list = &req->ctx->pending_async[rw]; | |
1118 | struct kiocb *kiocb = &req->rw; | |
1119 | struct file *filp = kiocb->ki_filp; | |
1120 | off_t io_end = kiocb->ki_pos + len; | |
1121 | ||
1122 | if (filp == async_list->file && kiocb->ki_pos == async_list->io_end) { | |
1123 | unsigned long max_pages; | |
1124 | ||
1125 | /* Use 8x RA size as a decent limiter for both reads/writes */ | |
1126 | max_pages = filp->f_ra.ra_pages; | |
1127 | if (!max_pages) | |
b5420237 | 1128 | max_pages = VM_READAHEAD_PAGES; |
31b51510 JA |
1129 | max_pages *= 8; |
1130 | ||
1131 | /* If max pages are exceeded, reset the state */ | |
1132 | len >>= PAGE_SHIFT; | |
1133 | if (async_list->io_pages + len <= max_pages) { | |
1134 | req->flags |= REQ_F_SEQ_PREV; | |
1135 | async_list->io_pages += len; | |
1136 | } else { | |
1137 | io_end = 0; | |
1138 | async_list->io_pages = 0; | |
1139 | } | |
1140 | } | |
1141 | ||
1142 | /* New file? Reset state. */ | |
1143 | if (async_list->file != filp) { | |
1144 | async_list->io_pages = 0; | |
1145 | async_list->file = filp; | |
1146 | } | |
1147 | async_list->io_end = io_end; | |
1148 | } | |
1149 | ||
e0c5c576 | 1150 | static int io_read(struct io_kiocb *req, const struct sqe_submit *s, |
8358e3a8 | 1151 | bool force_nonblock) |
2b188cc1 JA |
1152 | { |
1153 | struct iovec inline_vecs[UIO_FASTIOV], *iovec = inline_vecs; | |
1154 | struct kiocb *kiocb = &req->rw; | |
1155 | struct iov_iter iter; | |
1156 | struct file *file; | |
31b51510 | 1157 | size_t iov_count; |
9d93a3f5 | 1158 | ssize_t read_size, ret; |
2b188cc1 | 1159 | |
8358e3a8 | 1160 | ret = io_prep_rw(req, s, force_nonblock); |
2b188cc1 JA |
1161 | if (ret) |
1162 | return ret; | |
1163 | file = kiocb->ki_filp; | |
1164 | ||
2b188cc1 | 1165 | if (unlikely(!(file->f_mode & FMODE_READ))) |
09bb8394 | 1166 | return -EBADF; |
2b188cc1 | 1167 | if (unlikely(!file->f_op->read_iter)) |
09bb8394 | 1168 | return -EINVAL; |
2b188cc1 JA |
1169 | |
1170 | ret = io_import_iovec(req->ctx, READ, s, &iovec, &iter); | |
87e5e6da | 1171 | if (ret < 0) |
09bb8394 | 1172 | return ret; |
2b188cc1 | 1173 | |
9d93a3f5 | 1174 | read_size = ret; |
9e645e11 JA |
1175 | if (req->flags & REQ_F_LINK) |
1176 | req->result = read_size; | |
1177 | ||
31b51510 JA |
1178 | iov_count = iov_iter_count(&iter); |
1179 | ret = rw_verify_area(READ, file, &kiocb->ki_pos, iov_count); | |
2b188cc1 JA |
1180 | if (!ret) { |
1181 | ssize_t ret2; | |
1182 | ||
2b188cc1 | 1183 | ret2 = call_read_iter(file, kiocb, &iter); |
9d93a3f5 JA |
1184 | /* |
1185 | * In case of a short read, punt to async. This can happen | |
1186 | * if we have data partially cached. Alternatively we can | |
1187 | * return the short read, in which case the application will | |
1188 | * need to issue another SQE and wait for it. That SQE will | |
1189 | * need async punt anyway, so it's more efficient to do it | |
1190 | * here. | |
1191 | */ | |
1192 | if (force_nonblock && ret2 > 0 && ret2 < read_size) | |
1193 | ret2 = -EAGAIN; | |
1194 | /* Catch -EAGAIN return for forced non-blocking submission */ | |
31b51510 | 1195 | if (!force_nonblock || ret2 != -EAGAIN) { |
2b188cc1 | 1196 | io_rw_done(kiocb, ret2); |
31b51510 JA |
1197 | } else { |
1198 | /* | |
1199 | * If ->needs_lock is true, we're already in async | |
1200 | * context. | |
1201 | */ | |
1202 | if (!s->needs_lock) | |
1203 | io_async_list_note(READ, req, iov_count); | |
2b188cc1 | 1204 | ret = -EAGAIN; |
31b51510 | 1205 | } |
2b188cc1 JA |
1206 | } |
1207 | kfree(iovec); | |
2b188cc1 JA |
1208 | return ret; |
1209 | } | |
1210 | ||
e0c5c576 | 1211 | static int io_write(struct io_kiocb *req, const struct sqe_submit *s, |
8358e3a8 | 1212 | bool force_nonblock) |
2b188cc1 JA |
1213 | { |
1214 | struct iovec inline_vecs[UIO_FASTIOV], *iovec = inline_vecs; | |
1215 | struct kiocb *kiocb = &req->rw; | |
1216 | struct iov_iter iter; | |
1217 | struct file *file; | |
31b51510 | 1218 | size_t iov_count; |
87e5e6da | 1219 | ssize_t ret; |
2b188cc1 | 1220 | |
8358e3a8 | 1221 | ret = io_prep_rw(req, s, force_nonblock); |
2b188cc1 JA |
1222 | if (ret) |
1223 | return ret; | |
2b188cc1 | 1224 | |
2b188cc1 JA |
1225 | file = kiocb->ki_filp; |
1226 | if (unlikely(!(file->f_mode & FMODE_WRITE))) | |
09bb8394 | 1227 | return -EBADF; |
2b188cc1 | 1228 | if (unlikely(!file->f_op->write_iter)) |
09bb8394 | 1229 | return -EINVAL; |
2b188cc1 JA |
1230 | |
1231 | ret = io_import_iovec(req->ctx, WRITE, s, &iovec, &iter); | |
87e5e6da | 1232 | if (ret < 0) |
09bb8394 | 1233 | return ret; |
2b188cc1 | 1234 | |
9e645e11 JA |
1235 | if (req->flags & REQ_F_LINK) |
1236 | req->result = ret; | |
1237 | ||
31b51510 JA |
1238 | iov_count = iov_iter_count(&iter); |
1239 | ||
1240 | ret = -EAGAIN; | |
1241 | if (force_nonblock && !(kiocb->ki_flags & IOCB_DIRECT)) { | |
1242 | /* If ->needs_lock is true, we're already in async context. */ | |
1243 | if (!s->needs_lock) | |
1244 | io_async_list_note(WRITE, req, iov_count); | |
1245 | goto out_free; | |
1246 | } | |
1247 | ||
1248 | ret = rw_verify_area(WRITE, file, &kiocb->ki_pos, iov_count); | |
2b188cc1 | 1249 | if (!ret) { |
9bf7933f RP |
1250 | ssize_t ret2; |
1251 | ||
2b188cc1 JA |
1252 | /* |
1253 | * Open-code file_start_write here to grab freeze protection, | |
1254 | * which will be released by another thread in | |
1255 | * io_complete_rw(). Fool lockdep by telling it the lock got | |
1256 | * released so that it doesn't complain about the held lock when | |
1257 | * we return to userspace. | |
1258 | */ | |
1259 | if (S_ISREG(file_inode(file)->i_mode)) { | |
1260 | __sb_start_write(file_inode(file)->i_sb, | |
1261 | SB_FREEZE_WRITE, true); | |
1262 | __sb_writers_release(file_inode(file)->i_sb, | |
1263 | SB_FREEZE_WRITE); | |
1264 | } | |
1265 | kiocb->ki_flags |= IOCB_WRITE; | |
9bf7933f RP |
1266 | |
1267 | ret2 = call_write_iter(file, kiocb, &iter); | |
1268 | if (!force_nonblock || ret2 != -EAGAIN) { | |
1269 | io_rw_done(kiocb, ret2); | |
1270 | } else { | |
1271 | /* | |
1272 | * If ->needs_lock is true, we're already in async | |
1273 | * context. | |
1274 | */ | |
1275 | if (!s->needs_lock) | |
1276 | io_async_list_note(WRITE, req, iov_count); | |
1277 | ret = -EAGAIN; | |
1278 | } | |
2b188cc1 | 1279 | } |
31b51510 | 1280 | out_free: |
2b188cc1 | 1281 | kfree(iovec); |
2b188cc1 JA |
1282 | return ret; |
1283 | } | |
1284 | ||
1285 | /* | |
1286 | * IORING_OP_NOP just posts a completion event, nothing else. | |
1287 | */ | |
1288 | static int io_nop(struct io_kiocb *req, u64 user_data) | |
1289 | { | |
1290 | struct io_ring_ctx *ctx = req->ctx; | |
1291 | long err = 0; | |
1292 | ||
def596e9 JA |
1293 | if (unlikely(ctx->flags & IORING_SETUP_IOPOLL)) |
1294 | return -EINVAL; | |
1295 | ||
c71ffb67 | 1296 | io_cqring_add_event(ctx, user_data, err); |
e65ef56d | 1297 | io_put_req(req); |
2b188cc1 JA |
1298 | return 0; |
1299 | } | |
1300 | ||
c992fe29 CH |
1301 | static int io_prep_fsync(struct io_kiocb *req, const struct io_uring_sqe *sqe) |
1302 | { | |
6b06314c | 1303 | struct io_ring_ctx *ctx = req->ctx; |
c992fe29 | 1304 | |
09bb8394 JA |
1305 | if (!req->file) |
1306 | return -EBADF; | |
c992fe29 | 1307 | |
6b06314c | 1308 | if (unlikely(ctx->flags & IORING_SETUP_IOPOLL)) |
def596e9 | 1309 | return -EINVAL; |
edafccee | 1310 | if (unlikely(sqe->addr || sqe->ioprio || sqe->buf_index)) |
c992fe29 CH |
1311 | return -EINVAL; |
1312 | ||
c992fe29 CH |
1313 | return 0; |
1314 | } | |
1315 | ||
1316 | static int io_fsync(struct io_kiocb *req, const struct io_uring_sqe *sqe, | |
1317 | bool force_nonblock) | |
1318 | { | |
1319 | loff_t sqe_off = READ_ONCE(sqe->off); | |
1320 | loff_t sqe_len = READ_ONCE(sqe->len); | |
1321 | loff_t end = sqe_off + sqe_len; | |
1322 | unsigned fsync_flags; | |
1323 | int ret; | |
1324 | ||
1325 | fsync_flags = READ_ONCE(sqe->fsync_flags); | |
1326 | if (unlikely(fsync_flags & ~IORING_FSYNC_DATASYNC)) | |
1327 | return -EINVAL; | |
1328 | ||
1329 | ret = io_prep_fsync(req, sqe); | |
1330 | if (ret) | |
1331 | return ret; | |
1332 | ||
1333 | /* fsync always requires a blocking context */ | |
1334 | if (force_nonblock) | |
1335 | return -EAGAIN; | |
1336 | ||
1337 | ret = vfs_fsync_range(req->rw.ki_filp, sqe_off, | |
1338 | end > 0 ? end : LLONG_MAX, | |
1339 | fsync_flags & IORING_FSYNC_DATASYNC); | |
1340 | ||
9e645e11 JA |
1341 | if (ret < 0 && (req->flags & REQ_F_LINK)) |
1342 | req->flags |= REQ_F_FAIL_LINK; | |
c71ffb67 | 1343 | io_cqring_add_event(req->ctx, sqe->user_data, ret); |
e65ef56d | 1344 | io_put_req(req); |
c992fe29 CH |
1345 | return 0; |
1346 | } | |
1347 | ||
5d17b4a4 JA |
1348 | static int io_prep_sfr(struct io_kiocb *req, const struct io_uring_sqe *sqe) |
1349 | { | |
1350 | struct io_ring_ctx *ctx = req->ctx; | |
1351 | int ret = 0; | |
1352 | ||
1353 | if (!req->file) | |
1354 | return -EBADF; | |
5d17b4a4 JA |
1355 | |
1356 | if (unlikely(ctx->flags & IORING_SETUP_IOPOLL)) | |
1357 | return -EINVAL; | |
1358 | if (unlikely(sqe->addr || sqe->ioprio || sqe->buf_index)) | |
1359 | return -EINVAL; | |
1360 | ||
5d17b4a4 JA |
1361 | return ret; |
1362 | } | |
1363 | ||
1364 | static int io_sync_file_range(struct io_kiocb *req, | |
1365 | const struct io_uring_sqe *sqe, | |
1366 | bool force_nonblock) | |
1367 | { | |
1368 | loff_t sqe_off; | |
1369 | loff_t sqe_len; | |
1370 | unsigned flags; | |
1371 | int ret; | |
1372 | ||
1373 | ret = io_prep_sfr(req, sqe); | |
1374 | if (ret) | |
1375 | return ret; | |
1376 | ||
1377 | /* sync_file_range always requires a blocking context */ | |
1378 | if (force_nonblock) | |
1379 | return -EAGAIN; | |
1380 | ||
1381 | sqe_off = READ_ONCE(sqe->off); | |
1382 | sqe_len = READ_ONCE(sqe->len); | |
1383 | flags = READ_ONCE(sqe->sync_range_flags); | |
1384 | ||
1385 | ret = sync_file_range(req->rw.ki_filp, sqe_off, sqe_len, flags); | |
1386 | ||
9e645e11 JA |
1387 | if (ret < 0 && (req->flags & REQ_F_LINK)) |
1388 | req->flags |= REQ_F_FAIL_LINK; | |
c71ffb67 | 1389 | io_cqring_add_event(req->ctx, sqe->user_data, ret); |
5d17b4a4 JA |
1390 | io_put_req(req); |
1391 | return 0; | |
1392 | } | |
1393 | ||
0fa03c62 | 1394 | #if defined(CONFIG_NET) |
aa1fa28f JA |
1395 | static int io_send_recvmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe, |
1396 | bool force_nonblock, | |
1397 | long (*fn)(struct socket *, struct user_msghdr __user *, | |
1398 | unsigned int)) | |
1399 | { | |
0fa03c62 JA |
1400 | struct socket *sock; |
1401 | int ret; | |
1402 | ||
1403 | if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL)) | |
1404 | return -EINVAL; | |
1405 | ||
1406 | sock = sock_from_file(req->file, &ret); | |
1407 | if (sock) { | |
1408 | struct user_msghdr __user *msg; | |
1409 | unsigned flags; | |
1410 | ||
1411 | flags = READ_ONCE(sqe->msg_flags); | |
1412 | if (flags & MSG_DONTWAIT) | |
1413 | req->flags |= REQ_F_NOWAIT; | |
1414 | else if (force_nonblock) | |
1415 | flags |= MSG_DONTWAIT; | |
1416 | ||
1417 | msg = (struct user_msghdr __user *) (unsigned long) | |
1418 | READ_ONCE(sqe->addr); | |
1419 | ||
aa1fa28f | 1420 | ret = fn(sock, msg, flags); |
0fa03c62 JA |
1421 | if (force_nonblock && ret == -EAGAIN) |
1422 | return ret; | |
1423 | } | |
1424 | ||
c71ffb67 | 1425 | io_cqring_add_event(req->ctx, sqe->user_data, ret); |
5d17b4a4 JA |
1426 | io_put_req(req); |
1427 | return 0; | |
1428 | } | |
aa1fa28f JA |
1429 | #endif |
1430 | ||
1431 | static int io_sendmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe, | |
1432 | bool force_nonblock) | |
1433 | { | |
1434 | #if defined(CONFIG_NET) | |
1435 | return io_send_recvmsg(req, sqe, force_nonblock, __sys_sendmsg_sock); | |
1436 | #else | |
1437 | return -EOPNOTSUPP; | |
1438 | #endif | |
1439 | } | |
1440 | ||
1441 | static int io_recvmsg(struct io_kiocb *req, const struct io_uring_sqe *sqe, | |
1442 | bool force_nonblock) | |
1443 | { | |
1444 | #if defined(CONFIG_NET) | |
1445 | return io_send_recvmsg(req, sqe, force_nonblock, __sys_recvmsg_sock); | |
0fa03c62 JA |
1446 | #else |
1447 | return -EOPNOTSUPP; | |
1448 | #endif | |
1449 | } | |
5d17b4a4 | 1450 | |
221c5eb2 JA |
1451 | static void io_poll_remove_one(struct io_kiocb *req) |
1452 | { | |
1453 | struct io_poll_iocb *poll = &req->poll; | |
1454 | ||
1455 | spin_lock(&poll->head->lock); | |
1456 | WRITE_ONCE(poll->canceled, true); | |
1457 | if (!list_empty(&poll->wait.entry)) { | |
1458 | list_del_init(&poll->wait.entry); | |
1459 | queue_work(req->ctx->sqo_wq, &req->work); | |
1460 | } | |
1461 | spin_unlock(&poll->head->lock); | |
1462 | ||
1463 | list_del_init(&req->list); | |
1464 | } | |
1465 | ||
1466 | static void io_poll_remove_all(struct io_ring_ctx *ctx) | |
1467 | { | |
1468 | struct io_kiocb *req; | |
1469 | ||
1470 | spin_lock_irq(&ctx->completion_lock); | |
1471 | while (!list_empty(&ctx->cancel_list)) { | |
1472 | req = list_first_entry(&ctx->cancel_list, struct io_kiocb,list); | |
1473 | io_poll_remove_one(req); | |
1474 | } | |
1475 | spin_unlock_irq(&ctx->completion_lock); | |
1476 | } | |
1477 | ||
1478 | /* | |
1479 | * Find a running poll command that matches one specified in sqe->addr, | |
1480 | * and remove it if found. | |
1481 | */ | |
1482 | static int io_poll_remove(struct io_kiocb *req, const struct io_uring_sqe *sqe) | |
1483 | { | |
1484 | struct io_ring_ctx *ctx = req->ctx; | |
1485 | struct io_kiocb *poll_req, *next; | |
1486 | int ret = -ENOENT; | |
1487 | ||
1488 | if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL)) | |
1489 | return -EINVAL; | |
1490 | if (sqe->ioprio || sqe->off || sqe->len || sqe->buf_index || | |
1491 | sqe->poll_events) | |
1492 | return -EINVAL; | |
1493 | ||
1494 | spin_lock_irq(&ctx->completion_lock); | |
1495 | list_for_each_entry_safe(poll_req, next, &ctx->cancel_list, list) { | |
1496 | if (READ_ONCE(sqe->addr) == poll_req->user_data) { | |
1497 | io_poll_remove_one(poll_req); | |
1498 | ret = 0; | |
1499 | break; | |
1500 | } | |
1501 | } | |
1502 | spin_unlock_irq(&ctx->completion_lock); | |
1503 | ||
c71ffb67 | 1504 | io_cqring_add_event(req->ctx, sqe->user_data, ret); |
e65ef56d | 1505 | io_put_req(req); |
221c5eb2 JA |
1506 | return 0; |
1507 | } | |
1508 | ||
8c838788 JA |
1509 | static void io_poll_complete(struct io_ring_ctx *ctx, struct io_kiocb *req, |
1510 | __poll_t mask) | |
221c5eb2 | 1511 | { |
8c838788 | 1512 | req->poll.done = true; |
c71ffb67 | 1513 | io_cqring_fill_event(ctx, req->user_data, mangle_poll(mask)); |
8c838788 | 1514 | io_commit_cqring(ctx); |
221c5eb2 JA |
1515 | } |
1516 | ||
1517 | static void io_poll_complete_work(struct work_struct *work) | |
1518 | { | |
1519 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); | |
1520 | struct io_poll_iocb *poll = &req->poll; | |
1521 | struct poll_table_struct pt = { ._key = poll->events }; | |
1522 | struct io_ring_ctx *ctx = req->ctx; | |
1523 | __poll_t mask = 0; | |
1524 | ||
1525 | if (!READ_ONCE(poll->canceled)) | |
1526 | mask = vfs_poll(poll->file, &pt) & poll->events; | |
1527 | ||
1528 | /* | |
1529 | * Note that ->ki_cancel callers also delete iocb from active_reqs after | |
1530 | * calling ->ki_cancel. We need the ctx_lock roundtrip here to | |
1531 | * synchronize with them. In the cancellation case the list_del_init | |
1532 | * itself is not actually needed, but harmless so we keep it in to | |
1533 | * avoid further branches in the fast path. | |
1534 | */ | |
1535 | spin_lock_irq(&ctx->completion_lock); | |
1536 | if (!mask && !READ_ONCE(poll->canceled)) { | |
1537 | add_wait_queue(poll->head, &poll->wait); | |
1538 | spin_unlock_irq(&ctx->completion_lock); | |
1539 | return; | |
1540 | } | |
1541 | list_del_init(&req->list); | |
8c838788 | 1542 | io_poll_complete(ctx, req, mask); |
221c5eb2 JA |
1543 | spin_unlock_irq(&ctx->completion_lock); |
1544 | ||
8c838788 JA |
1545 | io_cqring_ev_posted(ctx); |
1546 | io_put_req(req); | |
221c5eb2 JA |
1547 | } |
1548 | ||
1549 | static int io_poll_wake(struct wait_queue_entry *wait, unsigned mode, int sync, | |
1550 | void *key) | |
1551 | { | |
1552 | struct io_poll_iocb *poll = container_of(wait, struct io_poll_iocb, | |
1553 | wait); | |
1554 | struct io_kiocb *req = container_of(poll, struct io_kiocb, poll); | |
1555 | struct io_ring_ctx *ctx = req->ctx; | |
1556 | __poll_t mask = key_to_poll(key); | |
8c838788 | 1557 | unsigned long flags; |
221c5eb2 JA |
1558 | |
1559 | /* for instances that support it check for an event match first: */ | |
8c838788 JA |
1560 | if (mask && !(mask & poll->events)) |
1561 | return 0; | |
221c5eb2 | 1562 | |
8c838788 | 1563 | list_del_init(&poll->wait.entry); |
221c5eb2 | 1564 | |
8c838788 JA |
1565 | if (mask && spin_trylock_irqsave(&ctx->completion_lock, flags)) { |
1566 | list_del(&req->list); | |
1567 | io_poll_complete(ctx, req, mask); | |
1568 | spin_unlock_irqrestore(&ctx->completion_lock, flags); | |
221c5eb2 | 1569 | |
8c838788 JA |
1570 | io_cqring_ev_posted(ctx); |
1571 | io_put_req(req); | |
1572 | } else { | |
1573 | queue_work(ctx->sqo_wq, &req->work); | |
221c5eb2 JA |
1574 | } |
1575 | ||
221c5eb2 JA |
1576 | return 1; |
1577 | } | |
1578 | ||
1579 | struct io_poll_table { | |
1580 | struct poll_table_struct pt; | |
1581 | struct io_kiocb *req; | |
1582 | int error; | |
1583 | }; | |
1584 | ||
1585 | static void io_poll_queue_proc(struct file *file, struct wait_queue_head *head, | |
1586 | struct poll_table_struct *p) | |
1587 | { | |
1588 | struct io_poll_table *pt = container_of(p, struct io_poll_table, pt); | |
1589 | ||
1590 | if (unlikely(pt->req->poll.head)) { | |
1591 | pt->error = -EINVAL; | |
1592 | return; | |
1593 | } | |
1594 | ||
1595 | pt->error = 0; | |
1596 | pt->req->poll.head = head; | |
1597 | add_wait_queue(head, &pt->req->poll.wait); | |
1598 | } | |
1599 | ||
1600 | static int io_poll_add(struct io_kiocb *req, const struct io_uring_sqe *sqe) | |
1601 | { | |
1602 | struct io_poll_iocb *poll = &req->poll; | |
1603 | struct io_ring_ctx *ctx = req->ctx; | |
1604 | struct io_poll_table ipt; | |
8c838788 | 1605 | bool cancel = false; |
221c5eb2 JA |
1606 | __poll_t mask; |
1607 | u16 events; | |
221c5eb2 JA |
1608 | |
1609 | if (unlikely(req->ctx->flags & IORING_SETUP_IOPOLL)) | |
1610 | return -EINVAL; | |
1611 | if (sqe->addr || sqe->ioprio || sqe->off || sqe->len || sqe->buf_index) | |
1612 | return -EINVAL; | |
09bb8394 JA |
1613 | if (!poll->file) |
1614 | return -EBADF; | |
221c5eb2 JA |
1615 | |
1616 | INIT_WORK(&req->work, io_poll_complete_work); | |
1617 | events = READ_ONCE(sqe->poll_events); | |
1618 | poll->events = demangle_poll(events) | EPOLLERR | EPOLLHUP; | |
1619 | ||
221c5eb2 | 1620 | poll->head = NULL; |
8c838788 | 1621 | poll->done = false; |
221c5eb2 JA |
1622 | poll->canceled = false; |
1623 | ||
1624 | ipt.pt._qproc = io_poll_queue_proc; | |
1625 | ipt.pt._key = poll->events; | |
1626 | ipt.req = req; | |
1627 | ipt.error = -EINVAL; /* same as no support for IOCB_CMD_POLL */ | |
1628 | ||
1629 | /* initialized the list so that we can do list_empty checks */ | |
1630 | INIT_LIST_HEAD(&poll->wait.entry); | |
1631 | init_waitqueue_func_entry(&poll->wait, io_poll_wake); | |
1632 | ||
221c5eb2 | 1633 | mask = vfs_poll(poll->file, &ipt.pt) & poll->events; |
221c5eb2 JA |
1634 | |
1635 | spin_lock_irq(&ctx->completion_lock); | |
8c838788 JA |
1636 | if (likely(poll->head)) { |
1637 | spin_lock(&poll->head->lock); | |
1638 | if (unlikely(list_empty(&poll->wait.entry))) { | |
1639 | if (ipt.error) | |
1640 | cancel = true; | |
1641 | ipt.error = 0; | |
1642 | mask = 0; | |
1643 | } | |
1644 | if (mask || ipt.error) | |
1645 | list_del_init(&poll->wait.entry); | |
1646 | else if (cancel) | |
1647 | WRITE_ONCE(poll->canceled, true); | |
1648 | else if (!poll->done) /* actually waiting for an event */ | |
1649 | list_add_tail(&req->list, &ctx->cancel_list); | |
1650 | spin_unlock(&poll->head->lock); | |
1651 | } | |
1652 | if (mask) { /* no async, we'd stolen it */ | |
221c5eb2 | 1653 | ipt.error = 0; |
8c838788 | 1654 | io_poll_complete(ctx, req, mask); |
221c5eb2 | 1655 | } |
221c5eb2 JA |
1656 | spin_unlock_irq(&ctx->completion_lock); |
1657 | ||
8c838788 JA |
1658 | if (mask) { |
1659 | io_cqring_ev_posted(ctx); | |
e65ef56d | 1660 | io_put_req(req); |
221c5eb2 | 1661 | } |
8c838788 | 1662 | return ipt.error; |
221c5eb2 JA |
1663 | } |
1664 | ||
de0617e4 JA |
1665 | static int io_req_defer(struct io_ring_ctx *ctx, struct io_kiocb *req, |
1666 | const struct io_uring_sqe *sqe) | |
1667 | { | |
1668 | struct io_uring_sqe *sqe_copy; | |
1669 | ||
1670 | if (!io_sequence_defer(ctx, req) && list_empty(&ctx->defer_list)) | |
1671 | return 0; | |
1672 | ||
1673 | sqe_copy = kmalloc(sizeof(*sqe_copy), GFP_KERNEL); | |
1674 | if (!sqe_copy) | |
1675 | return -EAGAIN; | |
1676 | ||
1677 | spin_lock_irq(&ctx->completion_lock); | |
1678 | if (!io_sequence_defer(ctx, req) && list_empty(&ctx->defer_list)) { | |
1679 | spin_unlock_irq(&ctx->completion_lock); | |
1680 | kfree(sqe_copy); | |
1681 | return 0; | |
1682 | } | |
1683 | ||
1684 | memcpy(sqe_copy, sqe, sizeof(*sqe_copy)); | |
1685 | req->submit.sqe = sqe_copy; | |
1686 | ||
1687 | INIT_WORK(&req->work, io_sq_wq_submit_work); | |
1688 | list_add_tail(&req->list, &ctx->defer_list); | |
1689 | spin_unlock_irq(&ctx->completion_lock); | |
1690 | return -EIOCBQUEUED; | |
1691 | } | |
1692 | ||
2b188cc1 | 1693 | static int __io_submit_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req, |
8358e3a8 | 1694 | const struct sqe_submit *s, bool force_nonblock) |
2b188cc1 | 1695 | { |
e0c5c576 | 1696 | int ret, opcode; |
2b188cc1 | 1697 | |
9e645e11 JA |
1698 | req->user_data = READ_ONCE(s->sqe->user_data); |
1699 | ||
2b188cc1 JA |
1700 | if (unlikely(s->index >= ctx->sq_entries)) |
1701 | return -EINVAL; | |
2b188cc1 JA |
1702 | |
1703 | opcode = READ_ONCE(s->sqe->opcode); | |
1704 | switch (opcode) { | |
1705 | case IORING_OP_NOP: | |
1706 | ret = io_nop(req, req->user_data); | |
1707 | break; | |
1708 | case IORING_OP_READV: | |
edafccee JA |
1709 | if (unlikely(s->sqe->buf_index)) |
1710 | return -EINVAL; | |
8358e3a8 | 1711 | ret = io_read(req, s, force_nonblock); |
2b188cc1 JA |
1712 | break; |
1713 | case IORING_OP_WRITEV: | |
edafccee JA |
1714 | if (unlikely(s->sqe->buf_index)) |
1715 | return -EINVAL; | |
8358e3a8 | 1716 | ret = io_write(req, s, force_nonblock); |
edafccee JA |
1717 | break; |
1718 | case IORING_OP_READ_FIXED: | |
8358e3a8 | 1719 | ret = io_read(req, s, force_nonblock); |
edafccee JA |
1720 | break; |
1721 | case IORING_OP_WRITE_FIXED: | |
8358e3a8 | 1722 | ret = io_write(req, s, force_nonblock); |
2b188cc1 | 1723 | break; |
c992fe29 CH |
1724 | case IORING_OP_FSYNC: |
1725 | ret = io_fsync(req, s->sqe, force_nonblock); | |
1726 | break; | |
221c5eb2 JA |
1727 | case IORING_OP_POLL_ADD: |
1728 | ret = io_poll_add(req, s->sqe); | |
1729 | break; | |
1730 | case IORING_OP_POLL_REMOVE: | |
1731 | ret = io_poll_remove(req, s->sqe); | |
1732 | break; | |
5d17b4a4 JA |
1733 | case IORING_OP_SYNC_FILE_RANGE: |
1734 | ret = io_sync_file_range(req, s->sqe, force_nonblock); | |
1735 | break; | |
0fa03c62 JA |
1736 | case IORING_OP_SENDMSG: |
1737 | ret = io_sendmsg(req, s->sqe, force_nonblock); | |
1738 | break; | |
aa1fa28f JA |
1739 | case IORING_OP_RECVMSG: |
1740 | ret = io_recvmsg(req, s->sqe, force_nonblock); | |
1741 | break; | |
2b188cc1 JA |
1742 | default: |
1743 | ret = -EINVAL; | |
1744 | break; | |
1745 | } | |
1746 | ||
def596e9 JA |
1747 | if (ret) |
1748 | return ret; | |
1749 | ||
1750 | if (ctx->flags & IORING_SETUP_IOPOLL) { | |
9e645e11 | 1751 | if (req->result == -EAGAIN) |
def596e9 JA |
1752 | return -EAGAIN; |
1753 | ||
1754 | /* workqueue context doesn't hold uring_lock, grab it now */ | |
1755 | if (s->needs_lock) | |
1756 | mutex_lock(&ctx->uring_lock); | |
1757 | io_iopoll_req_issued(req); | |
1758 | if (s->needs_lock) | |
1759 | mutex_unlock(&ctx->uring_lock); | |
1760 | } | |
1761 | ||
1762 | return 0; | |
2b188cc1 JA |
1763 | } |
1764 | ||
31b51510 JA |
1765 | static struct async_list *io_async_list_from_sqe(struct io_ring_ctx *ctx, |
1766 | const struct io_uring_sqe *sqe) | |
1767 | { | |
1768 | switch (sqe->opcode) { | |
1769 | case IORING_OP_READV: | |
1770 | case IORING_OP_READ_FIXED: | |
1771 | return &ctx->pending_async[READ]; | |
1772 | case IORING_OP_WRITEV: | |
1773 | case IORING_OP_WRITE_FIXED: | |
1774 | return &ctx->pending_async[WRITE]; | |
1775 | default: | |
1776 | return NULL; | |
1777 | } | |
1778 | } | |
1779 | ||
edafccee JA |
1780 | static inline bool io_sqe_needs_user(const struct io_uring_sqe *sqe) |
1781 | { | |
1782 | u8 opcode = READ_ONCE(sqe->opcode); | |
1783 | ||
1784 | return !(opcode == IORING_OP_READ_FIXED || | |
1785 | opcode == IORING_OP_WRITE_FIXED); | |
1786 | } | |
1787 | ||
2b188cc1 JA |
1788 | static void io_sq_wq_submit_work(struct work_struct *work) |
1789 | { | |
1790 | struct io_kiocb *req = container_of(work, struct io_kiocb, work); | |
2b188cc1 | 1791 | struct io_ring_ctx *ctx = req->ctx; |
31b51510 JA |
1792 | struct mm_struct *cur_mm = NULL; |
1793 | struct async_list *async_list; | |
1794 | LIST_HEAD(req_list); | |
edafccee | 1795 | mm_segment_t old_fs; |
2b188cc1 JA |
1796 | int ret; |
1797 | ||
31b51510 JA |
1798 | async_list = io_async_list_from_sqe(ctx, req->submit.sqe); |
1799 | restart: | |
1800 | do { | |
1801 | struct sqe_submit *s = &req->submit; | |
1802 | const struct io_uring_sqe *sqe = s->sqe; | |
2b188cc1 | 1803 | |
8449eeda | 1804 | /* Ensure we clear previously set non-block flag */ |
31b51510 JA |
1805 | req->rw.ki_flags &= ~IOCB_NOWAIT; |
1806 | ||
1807 | ret = 0; | |
1808 | if (io_sqe_needs_user(sqe) && !cur_mm) { | |
1809 | if (!mmget_not_zero(ctx->sqo_mm)) { | |
1810 | ret = -EFAULT; | |
1811 | } else { | |
1812 | cur_mm = ctx->sqo_mm; | |
1813 | use_mm(cur_mm); | |
1814 | old_fs = get_fs(); | |
1815 | set_fs(USER_DS); | |
1816 | } | |
1817 | } | |
1818 | ||
1819 | if (!ret) { | |
1820 | s->has_user = cur_mm != NULL; | |
1821 | s->needs_lock = true; | |
1822 | do { | |
8358e3a8 | 1823 | ret = __io_submit_sqe(ctx, req, s, false); |
31b51510 JA |
1824 | /* |
1825 | * We can get EAGAIN for polled IO even though | |
1826 | * we're forcing a sync submission from here, | |
1827 | * since we can't wait for request slots on the | |
1828 | * block side. | |
1829 | */ | |
1830 | if (ret != -EAGAIN) | |
1831 | break; | |
1832 | cond_resched(); | |
1833 | } while (1); | |
1834 | } | |
817869d2 JA |
1835 | |
1836 | /* drop submission reference */ | |
1837 | io_put_req(req); | |
1838 | ||
31b51510 | 1839 | if (ret) { |
c71ffb67 | 1840 | io_cqring_add_event(ctx, sqe->user_data, ret); |
e65ef56d | 1841 | io_put_req(req); |
31b51510 JA |
1842 | } |
1843 | ||
1844 | /* async context always use a copy of the sqe */ | |
1845 | kfree(sqe); | |
1846 | ||
1847 | if (!async_list) | |
1848 | break; | |
1849 | if (!list_empty(&req_list)) { | |
1850 | req = list_first_entry(&req_list, struct io_kiocb, | |
1851 | list); | |
1852 | list_del(&req->list); | |
1853 | continue; | |
1854 | } | |
1855 | if (list_empty(&async_list->list)) | |
1856 | break; | |
1857 | ||
1858 | req = NULL; | |
1859 | spin_lock(&async_list->lock); | |
1860 | if (list_empty(&async_list->list)) { | |
1861 | spin_unlock(&async_list->lock); | |
1862 | break; | |
1863 | } | |
1864 | list_splice_init(&async_list->list, &req_list); | |
1865 | spin_unlock(&async_list->lock); | |
1866 | ||
1867 | req = list_first_entry(&req_list, struct io_kiocb, list); | |
1868 | list_del(&req->list); | |
1869 | } while (req); | |
edafccee JA |
1870 | |
1871 | /* | |
31b51510 JA |
1872 | * Rare case of racing with a submitter. If we find the count has |
1873 | * dropped to zero AND we have pending work items, then restart | |
1874 | * the processing. This is a tiny race window. | |
edafccee | 1875 | */ |
31b51510 JA |
1876 | if (async_list) { |
1877 | ret = atomic_dec_return(&async_list->cnt); | |
1878 | while (!ret && !list_empty(&async_list->list)) { | |
1879 | spin_lock(&async_list->lock); | |
1880 | atomic_inc(&async_list->cnt); | |
1881 | list_splice_init(&async_list->list, &req_list); | |
1882 | spin_unlock(&async_list->lock); | |
1883 | ||
1884 | if (!list_empty(&req_list)) { | |
1885 | req = list_first_entry(&req_list, | |
1886 | struct io_kiocb, list); | |
1887 | list_del(&req->list); | |
1888 | goto restart; | |
1889 | } | |
1890 | ret = atomic_dec_return(&async_list->cnt); | |
edafccee | 1891 | } |
edafccee | 1892 | } |
2b188cc1 | 1893 | |
31b51510 | 1894 | if (cur_mm) { |
edafccee | 1895 | set_fs(old_fs); |
31b51510 JA |
1896 | unuse_mm(cur_mm); |
1897 | mmput(cur_mm); | |
2b188cc1 | 1898 | } |
31b51510 | 1899 | } |
2b188cc1 | 1900 | |
31b51510 JA |
1901 | /* |
1902 | * See if we can piggy back onto previously submitted work, that is still | |
1903 | * running. We currently only allow this if the new request is sequential | |
1904 | * to the previous one we punted. | |
1905 | */ | |
1906 | static bool io_add_to_prev_work(struct async_list *list, struct io_kiocb *req) | |
1907 | { | |
1908 | bool ret = false; | |
1909 | ||
1910 | if (!list) | |
1911 | return false; | |
1912 | if (!(req->flags & REQ_F_SEQ_PREV)) | |
1913 | return false; | |
1914 | if (!atomic_read(&list->cnt)) | |
1915 | return false; | |
1916 | ||
1917 | ret = true; | |
1918 | spin_lock(&list->lock); | |
1919 | list_add_tail(&req->list, &list->list); | |
1920 | if (!atomic_read(&list->cnt)) { | |
1921 | list_del_init(&req->list); | |
1922 | ret = false; | |
1923 | } | |
1924 | spin_unlock(&list->lock); | |
1925 | return ret; | |
2b188cc1 JA |
1926 | } |
1927 | ||
09bb8394 JA |
1928 | static bool io_op_needs_file(const struct io_uring_sqe *sqe) |
1929 | { | |
1930 | int op = READ_ONCE(sqe->opcode); | |
1931 | ||
1932 | switch (op) { | |
1933 | case IORING_OP_NOP: | |
1934 | case IORING_OP_POLL_REMOVE: | |
1935 | return false; | |
1936 | default: | |
1937 | return true; | |
1938 | } | |
1939 | } | |
1940 | ||
1941 | static int io_req_set_file(struct io_ring_ctx *ctx, const struct sqe_submit *s, | |
1942 | struct io_submit_state *state, struct io_kiocb *req) | |
1943 | { | |
1944 | unsigned flags; | |
1945 | int fd; | |
1946 | ||
1947 | flags = READ_ONCE(s->sqe->flags); | |
1948 | fd = READ_ONCE(s->sqe->fd); | |
1949 | ||
de0617e4 JA |
1950 | if (flags & IOSQE_IO_DRAIN) { |
1951 | req->flags |= REQ_F_IO_DRAIN; | |
1952 | req->sequence = ctx->cached_sq_head - 1; | |
1953 | } | |
1954 | ||
60c112b0 | 1955 | if (!io_op_needs_file(s->sqe)) |
09bb8394 | 1956 | return 0; |
09bb8394 JA |
1957 | |
1958 | if (flags & IOSQE_FIXED_FILE) { | |
1959 | if (unlikely(!ctx->user_files || | |
1960 | (unsigned) fd >= ctx->nr_user_files)) | |
1961 | return -EBADF; | |
1962 | req->file = ctx->user_files[fd]; | |
1963 | req->flags |= REQ_F_FIXED_FILE; | |
1964 | } else { | |
1965 | if (s->needs_fixed_file) | |
1966 | return -EBADF; | |
1967 | req->file = io_file_get(state, fd); | |
1968 | if (unlikely(!req->file)) | |
1969 | return -EBADF; | |
1970 | } | |
1971 | ||
1972 | return 0; | |
1973 | } | |
1974 | ||
9e645e11 JA |
1975 | static int io_queue_sqe(struct io_ring_ctx *ctx, struct io_kiocb *req, |
1976 | struct sqe_submit *s) | |
2b188cc1 | 1977 | { |
e0c5c576 | 1978 | int ret; |
2b188cc1 | 1979 | |
8358e3a8 | 1980 | ret = __io_submit_sqe(ctx, req, s, true); |
8449eeda | 1981 | if (ret == -EAGAIN && !(req->flags & REQ_F_NOWAIT)) { |
2b188cc1 JA |
1982 | struct io_uring_sqe *sqe_copy; |
1983 | ||
1984 | sqe_copy = kmalloc(sizeof(*sqe_copy), GFP_KERNEL); | |
1985 | if (sqe_copy) { | |
31b51510 JA |
1986 | struct async_list *list; |
1987 | ||
2b188cc1 JA |
1988 | memcpy(sqe_copy, s->sqe, sizeof(*sqe_copy)); |
1989 | s->sqe = sqe_copy; | |
1990 | ||
1991 | memcpy(&req->submit, s, sizeof(*s)); | |
31b51510 JA |
1992 | list = io_async_list_from_sqe(ctx, s->sqe); |
1993 | if (!io_add_to_prev_work(list, req)) { | |
1994 | if (list) | |
1995 | atomic_inc(&list->cnt); | |
1996 | INIT_WORK(&req->work, io_sq_wq_submit_work); | |
1997 | queue_work(ctx->sqo_wq, &req->work); | |
1998 | } | |
e65ef56d JA |
1999 | |
2000 | /* | |
2001 | * Queued up for async execution, worker will release | |
9e645e11 | 2002 | * submit reference when the iocb is actually submitted. |
e65ef56d JA |
2003 | */ |
2004 | return 0; | |
2b188cc1 JA |
2005 | } |
2006 | } | |
e65ef56d JA |
2007 | |
2008 | /* drop submission reference */ | |
2009 | io_put_req(req); | |
2010 | ||
2011 | /* and drop final reference, if we failed */ | |
9e645e11 JA |
2012 | if (ret) { |
2013 | io_cqring_add_event(ctx, req->user_data, ret); | |
2014 | if (req->flags & REQ_F_LINK) | |
2015 | req->flags |= REQ_F_FAIL_LINK; | |
e65ef56d | 2016 | io_put_req(req); |
9e645e11 | 2017 | } |
2b188cc1 JA |
2018 | |
2019 | return ret; | |
2020 | } | |
2021 | ||
9e645e11 JA |
2022 | #define SQE_VALID_FLAGS (IOSQE_FIXED_FILE|IOSQE_IO_DRAIN|IOSQE_IO_LINK) |
2023 | ||
2024 | static void io_submit_sqe(struct io_ring_ctx *ctx, struct sqe_submit *s, | |
2025 | struct io_submit_state *state, struct io_kiocb **link) | |
2026 | { | |
2027 | struct io_uring_sqe *sqe_copy; | |
2028 | struct io_kiocb *req; | |
2029 | int ret; | |
2030 | ||
2031 | /* enforce forwards compatibility on users */ | |
2032 | if (unlikely(s->sqe->flags & ~SQE_VALID_FLAGS)) { | |
2033 | ret = -EINVAL; | |
2034 | goto err; | |
2035 | } | |
2036 | ||
2037 | req = io_get_req(ctx, state); | |
2038 | if (unlikely(!req)) { | |
2039 | ret = -EAGAIN; | |
2040 | goto err; | |
2041 | } | |
2042 | ||
2043 | ret = io_req_set_file(ctx, s, state, req); | |
2044 | if (unlikely(ret)) { | |
2045 | err_req: | |
2046 | io_free_req(req); | |
2047 | err: | |
2048 | io_cqring_add_event(ctx, s->sqe->user_data, ret); | |
2049 | return; | |
2050 | } | |
2051 | ||
2052 | ret = io_req_defer(ctx, req, s->sqe); | |
2053 | if (ret) { | |
2054 | if (ret != -EIOCBQUEUED) | |
2055 | goto err_req; | |
2056 | return; | |
2057 | } | |
2058 | ||
2059 | /* | |
2060 | * If we already have a head request, queue this one for async | |
2061 | * submittal once the head completes. If we don't have a head but | |
2062 | * IOSQE_IO_LINK is set in the sqe, start a new head. This one will be | |
2063 | * submitted sync once the chain is complete. If none of those | |
2064 | * conditions are true (normal request), then just queue it. | |
2065 | */ | |
2066 | if (*link) { | |
2067 | struct io_kiocb *prev = *link; | |
2068 | ||
2069 | sqe_copy = kmemdup(s->sqe, sizeof(*sqe_copy), GFP_KERNEL); | |
2070 | if (!sqe_copy) { | |
2071 | ret = -EAGAIN; | |
2072 | goto err_req; | |
2073 | } | |
2074 | ||
2075 | s->sqe = sqe_copy; | |
2076 | memcpy(&req->submit, s, sizeof(*s)); | |
2077 | list_add_tail(&req->list, &prev->link_list); | |
2078 | } else if (s->sqe->flags & IOSQE_IO_LINK) { | |
2079 | req->flags |= REQ_F_LINK; | |
2080 | ||
2081 | memcpy(&req->submit, s, sizeof(*s)); | |
2082 | INIT_LIST_HEAD(&req->link_list); | |
2083 | *link = req; | |
2084 | } else { | |
2085 | io_queue_sqe(ctx, req, s); | |
2086 | } | |
2087 | } | |
2088 | ||
9a56a232 JA |
2089 | /* |
2090 | * Batched submission is done, ensure local IO is flushed out. | |
2091 | */ | |
2092 | static void io_submit_state_end(struct io_submit_state *state) | |
2093 | { | |
2094 | blk_finish_plug(&state->plug); | |
3d6770fb | 2095 | io_file_put(state); |
2579f913 JA |
2096 | if (state->free_reqs) |
2097 | kmem_cache_free_bulk(req_cachep, state->free_reqs, | |
2098 | &state->reqs[state->cur_req]); | |
9a56a232 JA |
2099 | } |
2100 | ||
2101 | /* | |
2102 | * Start submission side cache. | |
2103 | */ | |
2104 | static void io_submit_state_start(struct io_submit_state *state, | |
2105 | struct io_ring_ctx *ctx, unsigned max_ios) | |
2106 | { | |
2107 | blk_start_plug(&state->plug); | |
2579f913 | 2108 | state->free_reqs = 0; |
9a56a232 JA |
2109 | state->file = NULL; |
2110 | state->ios_left = max_ios; | |
2111 | } | |
2112 | ||
2b188cc1 JA |
2113 | static void io_commit_sqring(struct io_ring_ctx *ctx) |
2114 | { | |
2115 | struct io_sq_ring *ring = ctx->sq_ring; | |
2116 | ||
2117 | if (ctx->cached_sq_head != READ_ONCE(ring->r.head)) { | |
2118 | /* | |
2119 | * Ensure any loads from the SQEs are done at this point, | |
2120 | * since once we write the new head, the application could | |
2121 | * write new data to them. | |
2122 | */ | |
2123 | smp_store_release(&ring->r.head, ctx->cached_sq_head); | |
2b188cc1 JA |
2124 | } |
2125 | } | |
2126 | ||
2b188cc1 JA |
2127 | /* |
2128 | * Fetch an sqe, if one is available. Note that s->sqe will point to memory | |
2129 | * that is mapped by userspace. This means that care needs to be taken to | |
2130 | * ensure that reads are stable, as we cannot rely on userspace always | |
2131 | * being a good citizen. If members of the sqe are validated and then later | |
2132 | * used, it's important that those reads are done through READ_ONCE() to | |
2133 | * prevent a re-load down the line. | |
2134 | */ | |
2135 | static bool io_get_sqring(struct io_ring_ctx *ctx, struct sqe_submit *s) | |
2136 | { | |
2137 | struct io_sq_ring *ring = ctx->sq_ring; | |
2138 | unsigned head; | |
2139 | ||
2140 | /* | |
2141 | * The cached sq head (or cq tail) serves two purposes: | |
2142 | * | |
2143 | * 1) allows us to batch the cost of updating the user visible | |
2144 | * head updates. | |
2145 | * 2) allows the kernel side to track the head on its own, even | |
2146 | * though the application is the one updating it. | |
2147 | */ | |
2148 | head = ctx->cached_sq_head; | |
e523a29c SB |
2149 | /* make sure SQ entry isn't read before tail */ |
2150 | if (head == smp_load_acquire(&ring->r.tail)) | |
2b188cc1 JA |
2151 | return false; |
2152 | ||
2153 | head = READ_ONCE(ring->array[head & ctx->sq_mask]); | |
2154 | if (head < ctx->sq_entries) { | |
2155 | s->index = head; | |
2156 | s->sqe = &ctx->sq_sqes[head]; | |
2157 | ctx->cached_sq_head++; | |
2158 | return true; | |
2159 | } | |
2160 | ||
2161 | /* drop invalid entries */ | |
2162 | ctx->cached_sq_head++; | |
2163 | ring->dropped++; | |
2b188cc1 JA |
2164 | return false; |
2165 | } | |
2166 | ||
6c271ce2 JA |
2167 | static int io_submit_sqes(struct io_ring_ctx *ctx, struct sqe_submit *sqes, |
2168 | unsigned int nr, bool has_user, bool mm_fault) | |
2169 | { | |
2170 | struct io_submit_state state, *statep = NULL; | |
9e645e11 JA |
2171 | struct io_kiocb *link = NULL; |
2172 | bool prev_was_link = false; | |
2173 | int i, submitted = 0; | |
6c271ce2 JA |
2174 | |
2175 | if (nr > IO_PLUG_THRESHOLD) { | |
2176 | io_submit_state_start(&state, ctx, nr); | |
2177 | statep = &state; | |
2178 | } | |
2179 | ||
2180 | for (i = 0; i < nr; i++) { | |
9e645e11 JA |
2181 | /* |
2182 | * If previous wasn't linked and we have a linked command, | |
2183 | * that's the end of the chain. Submit the previous link. | |
2184 | */ | |
2185 | if (!prev_was_link && link) { | |
2186 | io_queue_sqe(ctx, link, &link->submit); | |
2187 | link = NULL; | |
2188 | } | |
2189 | prev_was_link = (sqes[i].sqe->flags & IOSQE_IO_LINK) != 0; | |
2190 | ||
6c271ce2 | 2191 | if (unlikely(mm_fault)) { |
9e645e11 JA |
2192 | io_cqring_add_event(ctx, sqes[i].sqe->user_data, |
2193 | -EFAULT); | |
6c271ce2 JA |
2194 | } else { |
2195 | sqes[i].has_user = has_user; | |
2196 | sqes[i].needs_lock = true; | |
2197 | sqes[i].needs_fixed_file = true; | |
9e645e11 | 2198 | io_submit_sqe(ctx, &sqes[i], statep, &link); |
6c271ce2 | 2199 | submitted++; |
6c271ce2 | 2200 | } |
6c271ce2 JA |
2201 | } |
2202 | ||
9e645e11 JA |
2203 | if (link) |
2204 | io_queue_sqe(ctx, link, &link->submit); | |
6c271ce2 JA |
2205 | if (statep) |
2206 | io_submit_state_end(&state); | |
2207 | ||
2208 | return submitted; | |
2209 | } | |
2210 | ||
2211 | static int io_sq_thread(void *data) | |
2212 | { | |
2213 | struct sqe_submit sqes[IO_IOPOLL_BATCH]; | |
2214 | struct io_ring_ctx *ctx = data; | |
2215 | struct mm_struct *cur_mm = NULL; | |
2216 | mm_segment_t old_fs; | |
2217 | DEFINE_WAIT(wait); | |
2218 | unsigned inflight; | |
2219 | unsigned long timeout; | |
2220 | ||
a4c0b3de JL |
2221 | complete(&ctx->sqo_thread_started); |
2222 | ||
6c271ce2 JA |
2223 | old_fs = get_fs(); |
2224 | set_fs(USER_DS); | |
2225 | ||
2226 | timeout = inflight = 0; | |
2bbcd6d3 | 2227 | while (!kthread_should_park()) { |
6c271ce2 JA |
2228 | bool all_fixed, mm_fault = false; |
2229 | int i; | |
2230 | ||
2231 | if (inflight) { | |
2232 | unsigned nr_events = 0; | |
2233 | ||
2234 | if (ctx->flags & IORING_SETUP_IOPOLL) { | |
2235 | /* | |
2236 | * We disallow the app entering submit/complete | |
2237 | * with polling, but we still need to lock the | |
2238 | * ring to prevent racing with polled issue | |
2239 | * that got punted to a workqueue. | |
2240 | */ | |
2241 | mutex_lock(&ctx->uring_lock); | |
2242 | io_iopoll_check(ctx, &nr_events, 0); | |
2243 | mutex_unlock(&ctx->uring_lock); | |
2244 | } else { | |
2245 | /* | |
2246 | * Normal IO, just pretend everything completed. | |
2247 | * We don't have to poll completions for that. | |
2248 | */ | |
2249 | nr_events = inflight; | |
2250 | } | |
2251 | ||
2252 | inflight -= nr_events; | |
2253 | if (!inflight) | |
2254 | timeout = jiffies + ctx->sq_thread_idle; | |
2255 | } | |
2256 | ||
2257 | if (!io_get_sqring(ctx, &sqes[0])) { | |
2258 | /* | |
2259 | * We're polling. If we're within the defined idle | |
2260 | * period, then let us spin without work before going | |
2261 | * to sleep. | |
2262 | */ | |
2263 | if (inflight || !time_after(jiffies, timeout)) { | |
2264 | cpu_relax(); | |
2265 | continue; | |
2266 | } | |
2267 | ||
2268 | /* | |
2269 | * Drop cur_mm before scheduling, we can't hold it for | |
2270 | * long periods (or over schedule()). Do this before | |
2271 | * adding ourselves to the waitqueue, as the unuse/drop | |
2272 | * may sleep. | |
2273 | */ | |
2274 | if (cur_mm) { | |
2275 | unuse_mm(cur_mm); | |
2276 | mmput(cur_mm); | |
2277 | cur_mm = NULL; | |
2278 | } | |
2279 | ||
2280 | prepare_to_wait(&ctx->sqo_wait, &wait, | |
2281 | TASK_INTERRUPTIBLE); | |
2282 | ||
2283 | /* Tell userspace we may need a wakeup call */ | |
2284 | ctx->sq_ring->flags |= IORING_SQ_NEED_WAKEUP; | |
0d7bae69 SB |
2285 | /* make sure to read SQ tail after writing flags */ |
2286 | smp_mb(); | |
6c271ce2 JA |
2287 | |
2288 | if (!io_get_sqring(ctx, &sqes[0])) { | |
2bbcd6d3 | 2289 | if (kthread_should_park()) { |
6c271ce2 JA |
2290 | finish_wait(&ctx->sqo_wait, &wait); |
2291 | break; | |
2292 | } | |
2293 | if (signal_pending(current)) | |
2294 | flush_signals(current); | |
2295 | schedule(); | |
2296 | finish_wait(&ctx->sqo_wait, &wait); | |
2297 | ||
2298 | ctx->sq_ring->flags &= ~IORING_SQ_NEED_WAKEUP; | |
6c271ce2 JA |
2299 | continue; |
2300 | } | |
2301 | finish_wait(&ctx->sqo_wait, &wait); | |
2302 | ||
2303 | ctx->sq_ring->flags &= ~IORING_SQ_NEED_WAKEUP; | |
6c271ce2 JA |
2304 | } |
2305 | ||
2306 | i = 0; | |
2307 | all_fixed = true; | |
2308 | do { | |
2309 | if (all_fixed && io_sqe_needs_user(sqes[i].sqe)) | |
2310 | all_fixed = false; | |
2311 | ||
2312 | i++; | |
2313 | if (i == ARRAY_SIZE(sqes)) | |
2314 | break; | |
2315 | } while (io_get_sqring(ctx, &sqes[i])); | |
2316 | ||
2317 | /* Unless all new commands are FIXED regions, grab mm */ | |
2318 | if (!all_fixed && !cur_mm) { | |
2319 | mm_fault = !mmget_not_zero(ctx->sqo_mm); | |
2320 | if (!mm_fault) { | |
2321 | use_mm(ctx->sqo_mm); | |
2322 | cur_mm = ctx->sqo_mm; | |
2323 | } | |
2324 | } | |
2325 | ||
2326 | inflight += io_submit_sqes(ctx, sqes, i, cur_mm != NULL, | |
2327 | mm_fault); | |
2328 | ||
2329 | /* Commit SQ ring head once we've consumed all SQEs */ | |
2330 | io_commit_sqring(ctx); | |
2331 | } | |
2332 | ||
2333 | set_fs(old_fs); | |
2334 | if (cur_mm) { | |
2335 | unuse_mm(cur_mm); | |
2336 | mmput(cur_mm); | |
2337 | } | |
06058632 | 2338 | |
2bbcd6d3 | 2339 | kthread_parkme(); |
06058632 | 2340 | |
6c271ce2 JA |
2341 | return 0; |
2342 | } | |
2343 | ||
2b188cc1 JA |
2344 | static int io_ring_submit(struct io_ring_ctx *ctx, unsigned int to_submit) |
2345 | { | |
9a56a232 | 2346 | struct io_submit_state state, *statep = NULL; |
9e645e11 JA |
2347 | struct io_kiocb *link = NULL; |
2348 | bool prev_was_link = false; | |
5c8b0b54 | 2349 | int i, submit = 0; |
2b188cc1 | 2350 | |
9a56a232 JA |
2351 | if (to_submit > IO_PLUG_THRESHOLD) { |
2352 | io_submit_state_start(&state, ctx, to_submit); | |
2353 | statep = &state; | |
2354 | } | |
2b188cc1 JA |
2355 | |
2356 | for (i = 0; i < to_submit; i++) { | |
2357 | struct sqe_submit s; | |
2358 | ||
2359 | if (!io_get_sqring(ctx, &s)) | |
2360 | break; | |
2361 | ||
9e645e11 JA |
2362 | /* |
2363 | * If previous wasn't linked and we have a linked command, | |
2364 | * that's the end of the chain. Submit the previous link. | |
2365 | */ | |
2366 | if (!prev_was_link && link) { | |
2367 | io_queue_sqe(ctx, link, &link->submit); | |
2368 | link = NULL; | |
2369 | } | |
2370 | prev_was_link = (s.sqe->flags & IOSQE_IO_LINK) != 0; | |
2371 | ||
2b188cc1 | 2372 | s.has_user = true; |
def596e9 | 2373 | s.needs_lock = false; |
6c271ce2 | 2374 | s.needs_fixed_file = false; |
5c8b0b54 | 2375 | submit++; |
9e645e11 | 2376 | io_submit_sqe(ctx, &s, statep, &link); |
2b188cc1 JA |
2377 | } |
2378 | io_commit_sqring(ctx); | |
2379 | ||
9e645e11 JA |
2380 | if (link) |
2381 | io_queue_sqe(ctx, link, &link->submit); | |
9a56a232 JA |
2382 | if (statep) |
2383 | io_submit_state_end(statep); | |
2b188cc1 | 2384 | |
5c8b0b54 | 2385 | return submit; |
2b188cc1 JA |
2386 | } |
2387 | ||
2388 | static unsigned io_cqring_events(struct io_cq_ring *ring) | |
2389 | { | |
dc6ce4bc JL |
2390 | /* See comment at the top of this file */ |
2391 | smp_rmb(); | |
2b188cc1 JA |
2392 | return READ_ONCE(ring->r.tail) - READ_ONCE(ring->r.head); |
2393 | } | |
2394 | ||
2395 | /* | |
2396 | * Wait until events become available, if we don't already have some. The | |
2397 | * application must reap them itself, as they reside on the shared cq ring. | |
2398 | */ | |
2399 | static int io_cqring_wait(struct io_ring_ctx *ctx, int min_events, | |
2400 | const sigset_t __user *sig, size_t sigsz) | |
2401 | { | |
2402 | struct io_cq_ring *ring = ctx->cq_ring; | |
2403 | sigset_t ksigmask, sigsaved; | |
2b188cc1 JA |
2404 | int ret; |
2405 | ||
2b188cc1 JA |
2406 | if (io_cqring_events(ring) >= min_events) |
2407 | return 0; | |
2408 | ||
2409 | if (sig) { | |
9e75ad5d AB |
2410 | #ifdef CONFIG_COMPAT |
2411 | if (in_compat_syscall()) | |
2412 | ret = set_compat_user_sigmask((const compat_sigset_t __user *)sig, | |
2413 | &ksigmask, &sigsaved, sigsz); | |
2414 | else | |
2415 | #endif | |
2416 | ret = set_user_sigmask(sig, &ksigmask, | |
2417 | &sigsaved, sigsz); | |
2418 | ||
2b188cc1 JA |
2419 | if (ret) |
2420 | return ret; | |
2421 | } | |
2422 | ||
fdb288a6 | 2423 | ret = wait_event_interruptible(ctx->wait, io_cqring_events(ring) >= min_events); |
2b188cc1 JA |
2424 | |
2425 | if (sig) | |
97abc889 ON |
2426 | restore_user_sigmask(sig, &sigsaved, ret == -ERESTARTSYS); |
2427 | ||
2428 | if (ret == -ERESTARTSYS) | |
2429 | ret = -EINTR; | |
2b188cc1 JA |
2430 | |
2431 | return READ_ONCE(ring->r.head) == READ_ONCE(ring->r.tail) ? ret : 0; | |
2432 | } | |
2433 | ||
6b06314c JA |
2434 | static void __io_sqe_files_unregister(struct io_ring_ctx *ctx) |
2435 | { | |
2436 | #if defined(CONFIG_UNIX) | |
2437 | if (ctx->ring_sock) { | |
2438 | struct sock *sock = ctx->ring_sock->sk; | |
2439 | struct sk_buff *skb; | |
2440 | ||
2441 | while ((skb = skb_dequeue(&sock->sk_receive_queue)) != NULL) | |
2442 | kfree_skb(skb); | |
2443 | } | |
2444 | #else | |
2445 | int i; | |
2446 | ||
2447 | for (i = 0; i < ctx->nr_user_files; i++) | |
2448 | fput(ctx->user_files[i]); | |
2449 | #endif | |
2450 | } | |
2451 | ||
2452 | static int io_sqe_files_unregister(struct io_ring_ctx *ctx) | |
2453 | { | |
2454 | if (!ctx->user_files) | |
2455 | return -ENXIO; | |
2456 | ||
2457 | __io_sqe_files_unregister(ctx); | |
2458 | kfree(ctx->user_files); | |
2459 | ctx->user_files = NULL; | |
2460 | ctx->nr_user_files = 0; | |
2461 | return 0; | |
2462 | } | |
2463 | ||
6c271ce2 JA |
2464 | static void io_sq_thread_stop(struct io_ring_ctx *ctx) |
2465 | { | |
2466 | if (ctx->sqo_thread) { | |
a4c0b3de | 2467 | wait_for_completion(&ctx->sqo_thread_started); |
2bbcd6d3 RP |
2468 | /* |
2469 | * The park is a bit of a work-around, without it we get | |
2470 | * warning spews on shutdown with SQPOLL set and affinity | |
2471 | * set to a single CPU. | |
2472 | */ | |
06058632 | 2473 | kthread_park(ctx->sqo_thread); |
6c271ce2 JA |
2474 | kthread_stop(ctx->sqo_thread); |
2475 | ctx->sqo_thread = NULL; | |
2476 | } | |
2477 | } | |
2478 | ||
6b06314c JA |
2479 | static void io_finish_async(struct io_ring_ctx *ctx) |
2480 | { | |
6c271ce2 JA |
2481 | io_sq_thread_stop(ctx); |
2482 | ||
6b06314c JA |
2483 | if (ctx->sqo_wq) { |
2484 | destroy_workqueue(ctx->sqo_wq); | |
2485 | ctx->sqo_wq = NULL; | |
2486 | } | |
2487 | } | |
2488 | ||
2489 | #if defined(CONFIG_UNIX) | |
2490 | static void io_destruct_skb(struct sk_buff *skb) | |
2491 | { | |
2492 | struct io_ring_ctx *ctx = skb->sk->sk_user_data; | |
2493 | ||
2494 | io_finish_async(ctx); | |
2495 | unix_destruct_scm(skb); | |
2496 | } | |
2497 | ||
2498 | /* | |
2499 | * Ensure the UNIX gc is aware of our file set, so we are certain that | |
2500 | * the io_uring can be safely unregistered on process exit, even if we have | |
2501 | * loops in the file referencing. | |
2502 | */ | |
2503 | static int __io_sqe_files_scm(struct io_ring_ctx *ctx, int nr, int offset) | |
2504 | { | |
2505 | struct sock *sk = ctx->ring_sock->sk; | |
2506 | struct scm_fp_list *fpl; | |
2507 | struct sk_buff *skb; | |
2508 | int i; | |
2509 | ||
2510 | if (!capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN)) { | |
2511 | unsigned long inflight = ctx->user->unix_inflight + nr; | |
2512 | ||
2513 | if (inflight > task_rlimit(current, RLIMIT_NOFILE)) | |
2514 | return -EMFILE; | |
2515 | } | |
2516 | ||
2517 | fpl = kzalloc(sizeof(*fpl), GFP_KERNEL); | |
2518 | if (!fpl) | |
2519 | return -ENOMEM; | |
2520 | ||
2521 | skb = alloc_skb(0, GFP_KERNEL); | |
2522 | if (!skb) { | |
2523 | kfree(fpl); | |
2524 | return -ENOMEM; | |
2525 | } | |
2526 | ||
2527 | skb->sk = sk; | |
2528 | skb->destructor = io_destruct_skb; | |
2529 | ||
2530 | fpl->user = get_uid(ctx->user); | |
2531 | for (i = 0; i < nr; i++) { | |
2532 | fpl->fp[i] = get_file(ctx->user_files[i + offset]); | |
2533 | unix_inflight(fpl->user, fpl->fp[i]); | |
2534 | } | |
2535 | ||
2536 | fpl->max = fpl->count = nr; | |
2537 | UNIXCB(skb).fp = fpl; | |
2538 | refcount_add(skb->truesize, &sk->sk_wmem_alloc); | |
2539 | skb_queue_head(&sk->sk_receive_queue, skb); | |
2540 | ||
2541 | for (i = 0; i < nr; i++) | |
2542 | fput(fpl->fp[i]); | |
2543 | ||
2544 | return 0; | |
2545 | } | |
2546 | ||
2547 | /* | |
2548 | * If UNIX sockets are enabled, fd passing can cause a reference cycle which | |
2549 | * causes regular reference counting to break down. We rely on the UNIX | |
2550 | * garbage collection to take care of this problem for us. | |
2551 | */ | |
2552 | static int io_sqe_files_scm(struct io_ring_ctx *ctx) | |
2553 | { | |
2554 | unsigned left, total; | |
2555 | int ret = 0; | |
2556 | ||
2557 | total = 0; | |
2558 | left = ctx->nr_user_files; | |
2559 | while (left) { | |
2560 | unsigned this_files = min_t(unsigned, left, SCM_MAX_FD); | |
6b06314c JA |
2561 | |
2562 | ret = __io_sqe_files_scm(ctx, this_files, total); | |
2563 | if (ret) | |
2564 | break; | |
2565 | left -= this_files; | |
2566 | total += this_files; | |
2567 | } | |
2568 | ||
2569 | if (!ret) | |
2570 | return 0; | |
2571 | ||
2572 | while (total < ctx->nr_user_files) { | |
2573 | fput(ctx->user_files[total]); | |
2574 | total++; | |
2575 | } | |
2576 | ||
2577 | return ret; | |
2578 | } | |
2579 | #else | |
2580 | static int io_sqe_files_scm(struct io_ring_ctx *ctx) | |
2581 | { | |
2582 | return 0; | |
2583 | } | |
2584 | #endif | |
2585 | ||
2586 | static int io_sqe_files_register(struct io_ring_ctx *ctx, void __user *arg, | |
2587 | unsigned nr_args) | |
2588 | { | |
2589 | __s32 __user *fds = (__s32 __user *) arg; | |
2590 | int fd, ret = 0; | |
2591 | unsigned i; | |
2592 | ||
2593 | if (ctx->user_files) | |
2594 | return -EBUSY; | |
2595 | if (!nr_args) | |
2596 | return -EINVAL; | |
2597 | if (nr_args > IORING_MAX_FIXED_FILES) | |
2598 | return -EMFILE; | |
2599 | ||
2600 | ctx->user_files = kcalloc(nr_args, sizeof(struct file *), GFP_KERNEL); | |
2601 | if (!ctx->user_files) | |
2602 | return -ENOMEM; | |
2603 | ||
2604 | for (i = 0; i < nr_args; i++) { | |
2605 | ret = -EFAULT; | |
2606 | if (copy_from_user(&fd, &fds[i], sizeof(fd))) | |
2607 | break; | |
2608 | ||
2609 | ctx->user_files[i] = fget(fd); | |
2610 | ||
2611 | ret = -EBADF; | |
2612 | if (!ctx->user_files[i]) | |
2613 | break; | |
2614 | /* | |
2615 | * Don't allow io_uring instances to be registered. If UNIX | |
2616 | * isn't enabled, then this causes a reference cycle and this | |
2617 | * instance can never get freed. If UNIX is enabled we'll | |
2618 | * handle it just fine, but there's still no point in allowing | |
2619 | * a ring fd as it doesn't support regular read/write anyway. | |
2620 | */ | |
2621 | if (ctx->user_files[i]->f_op == &io_uring_fops) { | |
2622 | fput(ctx->user_files[i]); | |
2623 | break; | |
2624 | } | |
2625 | ctx->nr_user_files++; | |
2626 | ret = 0; | |
2627 | } | |
2628 | ||
2629 | if (ret) { | |
2630 | for (i = 0; i < ctx->nr_user_files; i++) | |
2631 | fput(ctx->user_files[i]); | |
2632 | ||
2633 | kfree(ctx->user_files); | |
25adf50f | 2634 | ctx->user_files = NULL; |
6b06314c JA |
2635 | ctx->nr_user_files = 0; |
2636 | return ret; | |
2637 | } | |
2638 | ||
2639 | ret = io_sqe_files_scm(ctx); | |
2640 | if (ret) | |
2641 | io_sqe_files_unregister(ctx); | |
2642 | ||
2643 | return ret; | |
2644 | } | |
2645 | ||
6c271ce2 JA |
2646 | static int io_sq_offload_start(struct io_ring_ctx *ctx, |
2647 | struct io_uring_params *p) | |
2b188cc1 JA |
2648 | { |
2649 | int ret; | |
2650 | ||
6c271ce2 | 2651 | init_waitqueue_head(&ctx->sqo_wait); |
2b188cc1 JA |
2652 | mmgrab(current->mm); |
2653 | ctx->sqo_mm = current->mm; | |
2654 | ||
6c271ce2 | 2655 | if (ctx->flags & IORING_SETUP_SQPOLL) { |
3ec482d1 JA |
2656 | ret = -EPERM; |
2657 | if (!capable(CAP_SYS_ADMIN)) | |
2658 | goto err; | |
2659 | ||
917257da JA |
2660 | ctx->sq_thread_idle = msecs_to_jiffies(p->sq_thread_idle); |
2661 | if (!ctx->sq_thread_idle) | |
2662 | ctx->sq_thread_idle = HZ; | |
2663 | ||
6c271ce2 | 2664 | if (p->flags & IORING_SETUP_SQ_AFF) { |
44a9bd18 | 2665 | int cpu = p->sq_thread_cpu; |
6c271ce2 | 2666 | |
917257da | 2667 | ret = -EINVAL; |
44a9bd18 JA |
2668 | if (cpu >= nr_cpu_ids) |
2669 | goto err; | |
7889f44d | 2670 | if (!cpu_online(cpu)) |
917257da JA |
2671 | goto err; |
2672 | ||
6c271ce2 JA |
2673 | ctx->sqo_thread = kthread_create_on_cpu(io_sq_thread, |
2674 | ctx, cpu, | |
2675 | "io_uring-sq"); | |
2676 | } else { | |
2677 | ctx->sqo_thread = kthread_create(io_sq_thread, ctx, | |
2678 | "io_uring-sq"); | |
2679 | } | |
2680 | if (IS_ERR(ctx->sqo_thread)) { | |
2681 | ret = PTR_ERR(ctx->sqo_thread); | |
2682 | ctx->sqo_thread = NULL; | |
2683 | goto err; | |
2684 | } | |
2685 | wake_up_process(ctx->sqo_thread); | |
2686 | } else if (p->flags & IORING_SETUP_SQ_AFF) { | |
2687 | /* Can't have SQ_AFF without SQPOLL */ | |
2688 | ret = -EINVAL; | |
2689 | goto err; | |
2690 | } | |
2691 | ||
2b188cc1 JA |
2692 | /* Do QD, or 2 * CPUS, whatever is smallest */ |
2693 | ctx->sqo_wq = alloc_workqueue("io_ring-wq", WQ_UNBOUND | WQ_FREEZABLE, | |
2694 | min(ctx->sq_entries - 1, 2 * num_online_cpus())); | |
2695 | if (!ctx->sqo_wq) { | |
2696 | ret = -ENOMEM; | |
2697 | goto err; | |
2698 | } | |
2699 | ||
2700 | return 0; | |
2701 | err: | |
6c271ce2 | 2702 | io_sq_thread_stop(ctx); |
2b188cc1 JA |
2703 | mmdrop(ctx->sqo_mm); |
2704 | ctx->sqo_mm = NULL; | |
2705 | return ret; | |
2706 | } | |
2707 | ||
2708 | static void io_unaccount_mem(struct user_struct *user, unsigned long nr_pages) | |
2709 | { | |
2710 | atomic_long_sub(nr_pages, &user->locked_vm); | |
2711 | } | |
2712 | ||
2713 | static int io_account_mem(struct user_struct *user, unsigned long nr_pages) | |
2714 | { | |
2715 | unsigned long page_limit, cur_pages, new_pages; | |
2716 | ||
2717 | /* Don't allow more pages than we can safely lock */ | |
2718 | page_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT; | |
2719 | ||
2720 | do { | |
2721 | cur_pages = atomic_long_read(&user->locked_vm); | |
2722 | new_pages = cur_pages + nr_pages; | |
2723 | if (new_pages > page_limit) | |
2724 | return -ENOMEM; | |
2725 | } while (atomic_long_cmpxchg(&user->locked_vm, cur_pages, | |
2726 | new_pages) != cur_pages); | |
2727 | ||
2728 | return 0; | |
2729 | } | |
2730 | ||
2731 | static void io_mem_free(void *ptr) | |
2732 | { | |
52e04ef4 MR |
2733 | struct page *page; |
2734 | ||
2735 | if (!ptr) | |
2736 | return; | |
2b188cc1 | 2737 | |
52e04ef4 | 2738 | page = virt_to_head_page(ptr); |
2b188cc1 JA |
2739 | if (put_page_testzero(page)) |
2740 | free_compound_page(page); | |
2741 | } | |
2742 | ||
2743 | static void *io_mem_alloc(size_t size) | |
2744 | { | |
2745 | gfp_t gfp_flags = GFP_KERNEL | __GFP_ZERO | __GFP_NOWARN | __GFP_COMP | | |
2746 | __GFP_NORETRY; | |
2747 | ||
2748 | return (void *) __get_free_pages(gfp_flags, get_order(size)); | |
2749 | } | |
2750 | ||
2751 | static unsigned long ring_pages(unsigned sq_entries, unsigned cq_entries) | |
2752 | { | |
2753 | struct io_sq_ring *sq_ring; | |
2754 | struct io_cq_ring *cq_ring; | |
2755 | size_t bytes; | |
2756 | ||
2757 | bytes = struct_size(sq_ring, array, sq_entries); | |
2758 | bytes += array_size(sizeof(struct io_uring_sqe), sq_entries); | |
2759 | bytes += struct_size(cq_ring, cqes, cq_entries); | |
2760 | ||
2761 | return (bytes + PAGE_SIZE - 1) / PAGE_SIZE; | |
2762 | } | |
2763 | ||
edafccee JA |
2764 | static int io_sqe_buffer_unregister(struct io_ring_ctx *ctx) |
2765 | { | |
2766 | int i, j; | |
2767 | ||
2768 | if (!ctx->user_bufs) | |
2769 | return -ENXIO; | |
2770 | ||
2771 | for (i = 0; i < ctx->nr_user_bufs; i++) { | |
2772 | struct io_mapped_ubuf *imu = &ctx->user_bufs[i]; | |
2773 | ||
2774 | for (j = 0; j < imu->nr_bvecs; j++) | |
2775 | put_page(imu->bvec[j].bv_page); | |
2776 | ||
2777 | if (ctx->account_mem) | |
2778 | io_unaccount_mem(ctx->user, imu->nr_bvecs); | |
d4ef6475 | 2779 | kvfree(imu->bvec); |
edafccee JA |
2780 | imu->nr_bvecs = 0; |
2781 | } | |
2782 | ||
2783 | kfree(ctx->user_bufs); | |
2784 | ctx->user_bufs = NULL; | |
2785 | ctx->nr_user_bufs = 0; | |
2786 | return 0; | |
2787 | } | |
2788 | ||
2789 | static int io_copy_iov(struct io_ring_ctx *ctx, struct iovec *dst, | |
2790 | void __user *arg, unsigned index) | |
2791 | { | |
2792 | struct iovec __user *src; | |
2793 | ||
2794 | #ifdef CONFIG_COMPAT | |
2795 | if (ctx->compat) { | |
2796 | struct compat_iovec __user *ciovs; | |
2797 | struct compat_iovec ciov; | |
2798 | ||
2799 | ciovs = (struct compat_iovec __user *) arg; | |
2800 | if (copy_from_user(&ciov, &ciovs[index], sizeof(ciov))) | |
2801 | return -EFAULT; | |
2802 | ||
2803 | dst->iov_base = (void __user *) (unsigned long) ciov.iov_base; | |
2804 | dst->iov_len = ciov.iov_len; | |
2805 | return 0; | |
2806 | } | |
2807 | #endif | |
2808 | src = (struct iovec __user *) arg; | |
2809 | if (copy_from_user(dst, &src[index], sizeof(*dst))) | |
2810 | return -EFAULT; | |
2811 | return 0; | |
2812 | } | |
2813 | ||
2814 | static int io_sqe_buffer_register(struct io_ring_ctx *ctx, void __user *arg, | |
2815 | unsigned nr_args) | |
2816 | { | |
2817 | struct vm_area_struct **vmas = NULL; | |
2818 | struct page **pages = NULL; | |
2819 | int i, j, got_pages = 0; | |
2820 | int ret = -EINVAL; | |
2821 | ||
2822 | if (ctx->user_bufs) | |
2823 | return -EBUSY; | |
2824 | if (!nr_args || nr_args > UIO_MAXIOV) | |
2825 | return -EINVAL; | |
2826 | ||
2827 | ctx->user_bufs = kcalloc(nr_args, sizeof(struct io_mapped_ubuf), | |
2828 | GFP_KERNEL); | |
2829 | if (!ctx->user_bufs) | |
2830 | return -ENOMEM; | |
2831 | ||
2832 | for (i = 0; i < nr_args; i++) { | |
2833 | struct io_mapped_ubuf *imu = &ctx->user_bufs[i]; | |
2834 | unsigned long off, start, end, ubuf; | |
2835 | int pret, nr_pages; | |
2836 | struct iovec iov; | |
2837 | size_t size; | |
2838 | ||
2839 | ret = io_copy_iov(ctx, &iov, arg, i); | |
2840 | if (ret) | |
a278682d | 2841 | goto err; |
edafccee JA |
2842 | |
2843 | /* | |
2844 | * Don't impose further limits on the size and buffer | |
2845 | * constraints here, we'll -EINVAL later when IO is | |
2846 | * submitted if they are wrong. | |
2847 | */ | |
2848 | ret = -EFAULT; | |
2849 | if (!iov.iov_base || !iov.iov_len) | |
2850 | goto err; | |
2851 | ||
2852 | /* arbitrary limit, but we need something */ | |
2853 | if (iov.iov_len > SZ_1G) | |
2854 | goto err; | |
2855 | ||
2856 | ubuf = (unsigned long) iov.iov_base; | |
2857 | end = (ubuf + iov.iov_len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
2858 | start = ubuf >> PAGE_SHIFT; | |
2859 | nr_pages = end - start; | |
2860 | ||
2861 | if (ctx->account_mem) { | |
2862 | ret = io_account_mem(ctx->user, nr_pages); | |
2863 | if (ret) | |
2864 | goto err; | |
2865 | } | |
2866 | ||
2867 | ret = 0; | |
2868 | if (!pages || nr_pages > got_pages) { | |
2869 | kfree(vmas); | |
2870 | kfree(pages); | |
d4ef6475 | 2871 | pages = kvmalloc_array(nr_pages, sizeof(struct page *), |
edafccee | 2872 | GFP_KERNEL); |
d4ef6475 | 2873 | vmas = kvmalloc_array(nr_pages, |
edafccee JA |
2874 | sizeof(struct vm_area_struct *), |
2875 | GFP_KERNEL); | |
2876 | if (!pages || !vmas) { | |
2877 | ret = -ENOMEM; | |
2878 | if (ctx->account_mem) | |
2879 | io_unaccount_mem(ctx->user, nr_pages); | |
2880 | goto err; | |
2881 | } | |
2882 | got_pages = nr_pages; | |
2883 | } | |
2884 | ||
d4ef6475 | 2885 | imu->bvec = kvmalloc_array(nr_pages, sizeof(struct bio_vec), |
edafccee JA |
2886 | GFP_KERNEL); |
2887 | ret = -ENOMEM; | |
2888 | if (!imu->bvec) { | |
2889 | if (ctx->account_mem) | |
2890 | io_unaccount_mem(ctx->user, nr_pages); | |
2891 | goto err; | |
2892 | } | |
2893 | ||
2894 | ret = 0; | |
2895 | down_read(¤t->mm->mmap_sem); | |
932f4a63 IW |
2896 | pret = get_user_pages(ubuf, nr_pages, |
2897 | FOLL_WRITE | FOLL_LONGTERM, | |
2898 | pages, vmas); | |
edafccee JA |
2899 | if (pret == nr_pages) { |
2900 | /* don't support file backed memory */ | |
2901 | for (j = 0; j < nr_pages; j++) { | |
2902 | struct vm_area_struct *vma = vmas[j]; | |
2903 | ||
2904 | if (vma->vm_file && | |
2905 | !is_file_hugepages(vma->vm_file)) { | |
2906 | ret = -EOPNOTSUPP; | |
2907 | break; | |
2908 | } | |
2909 | } | |
2910 | } else { | |
2911 | ret = pret < 0 ? pret : -EFAULT; | |
2912 | } | |
2913 | up_read(¤t->mm->mmap_sem); | |
2914 | if (ret) { | |
2915 | /* | |
2916 | * if we did partial map, or found file backed vmas, | |
2917 | * release any pages we did get | |
2918 | */ | |
2919 | if (pret > 0) { | |
2920 | for (j = 0; j < pret; j++) | |
2921 | put_page(pages[j]); | |
2922 | } | |
2923 | if (ctx->account_mem) | |
2924 | io_unaccount_mem(ctx->user, nr_pages); | |
d4ef6475 | 2925 | kvfree(imu->bvec); |
edafccee JA |
2926 | goto err; |
2927 | } | |
2928 | ||
2929 | off = ubuf & ~PAGE_MASK; | |
2930 | size = iov.iov_len; | |
2931 | for (j = 0; j < nr_pages; j++) { | |
2932 | size_t vec_len; | |
2933 | ||
2934 | vec_len = min_t(size_t, size, PAGE_SIZE - off); | |
2935 | imu->bvec[j].bv_page = pages[j]; | |
2936 | imu->bvec[j].bv_len = vec_len; | |
2937 | imu->bvec[j].bv_offset = off; | |
2938 | off = 0; | |
2939 | size -= vec_len; | |
2940 | } | |
2941 | /* store original address for later verification */ | |
2942 | imu->ubuf = ubuf; | |
2943 | imu->len = iov.iov_len; | |
2944 | imu->nr_bvecs = nr_pages; | |
2945 | ||
2946 | ctx->nr_user_bufs++; | |
2947 | } | |
d4ef6475 MR |
2948 | kvfree(pages); |
2949 | kvfree(vmas); | |
edafccee JA |
2950 | return 0; |
2951 | err: | |
d4ef6475 MR |
2952 | kvfree(pages); |
2953 | kvfree(vmas); | |
edafccee JA |
2954 | io_sqe_buffer_unregister(ctx); |
2955 | return ret; | |
2956 | } | |
2957 | ||
9b402849 JA |
2958 | static int io_eventfd_register(struct io_ring_ctx *ctx, void __user *arg) |
2959 | { | |
2960 | __s32 __user *fds = arg; | |
2961 | int fd; | |
2962 | ||
2963 | if (ctx->cq_ev_fd) | |
2964 | return -EBUSY; | |
2965 | ||
2966 | if (copy_from_user(&fd, fds, sizeof(*fds))) | |
2967 | return -EFAULT; | |
2968 | ||
2969 | ctx->cq_ev_fd = eventfd_ctx_fdget(fd); | |
2970 | if (IS_ERR(ctx->cq_ev_fd)) { | |
2971 | int ret = PTR_ERR(ctx->cq_ev_fd); | |
2972 | ctx->cq_ev_fd = NULL; | |
2973 | return ret; | |
2974 | } | |
2975 | ||
2976 | return 0; | |
2977 | } | |
2978 | ||
2979 | static int io_eventfd_unregister(struct io_ring_ctx *ctx) | |
2980 | { | |
2981 | if (ctx->cq_ev_fd) { | |
2982 | eventfd_ctx_put(ctx->cq_ev_fd); | |
2983 | ctx->cq_ev_fd = NULL; | |
2984 | return 0; | |
2985 | } | |
2986 | ||
2987 | return -ENXIO; | |
2988 | } | |
2989 | ||
2b188cc1 JA |
2990 | static void io_ring_ctx_free(struct io_ring_ctx *ctx) |
2991 | { | |
6b06314c | 2992 | io_finish_async(ctx); |
2b188cc1 JA |
2993 | if (ctx->sqo_mm) |
2994 | mmdrop(ctx->sqo_mm); | |
def596e9 JA |
2995 | |
2996 | io_iopoll_reap_events(ctx); | |
edafccee | 2997 | io_sqe_buffer_unregister(ctx); |
6b06314c | 2998 | io_sqe_files_unregister(ctx); |
9b402849 | 2999 | io_eventfd_unregister(ctx); |
def596e9 | 3000 | |
2b188cc1 | 3001 | #if defined(CONFIG_UNIX) |
355e8d26 EB |
3002 | if (ctx->ring_sock) { |
3003 | ctx->ring_sock->file = NULL; /* so that iput() is called */ | |
2b188cc1 | 3004 | sock_release(ctx->ring_sock); |
355e8d26 | 3005 | } |
2b188cc1 JA |
3006 | #endif |
3007 | ||
3008 | io_mem_free(ctx->sq_ring); | |
3009 | io_mem_free(ctx->sq_sqes); | |
3010 | io_mem_free(ctx->cq_ring); | |
3011 | ||
3012 | percpu_ref_exit(&ctx->refs); | |
3013 | if (ctx->account_mem) | |
3014 | io_unaccount_mem(ctx->user, | |
3015 | ring_pages(ctx->sq_entries, ctx->cq_entries)); | |
3016 | free_uid(ctx->user); | |
3017 | kfree(ctx); | |
3018 | } | |
3019 | ||
3020 | static __poll_t io_uring_poll(struct file *file, poll_table *wait) | |
3021 | { | |
3022 | struct io_ring_ctx *ctx = file->private_data; | |
3023 | __poll_t mask = 0; | |
3024 | ||
3025 | poll_wait(file, &ctx->cq_wait, wait); | |
4f7067c3 SB |
3026 | /* |
3027 | * synchronizes with barrier from wq_has_sleeper call in | |
3028 | * io_commit_cqring | |
3029 | */ | |
2b188cc1 | 3030 | smp_rmb(); |
fb775faa SB |
3031 | if (READ_ONCE(ctx->sq_ring->r.tail) - ctx->cached_sq_head != |
3032 | ctx->sq_ring->ring_entries) | |
2b188cc1 JA |
3033 | mask |= EPOLLOUT | EPOLLWRNORM; |
3034 | if (READ_ONCE(ctx->cq_ring->r.head) != ctx->cached_cq_tail) | |
3035 | mask |= EPOLLIN | EPOLLRDNORM; | |
3036 | ||
3037 | return mask; | |
3038 | } | |
3039 | ||
3040 | static int io_uring_fasync(int fd, struct file *file, int on) | |
3041 | { | |
3042 | struct io_ring_ctx *ctx = file->private_data; | |
3043 | ||
3044 | return fasync_helper(fd, file, on, &ctx->cq_fasync); | |
3045 | } | |
3046 | ||
3047 | static void io_ring_ctx_wait_and_kill(struct io_ring_ctx *ctx) | |
3048 | { | |
3049 | mutex_lock(&ctx->uring_lock); | |
3050 | percpu_ref_kill(&ctx->refs); | |
3051 | mutex_unlock(&ctx->uring_lock); | |
3052 | ||
221c5eb2 | 3053 | io_poll_remove_all(ctx); |
def596e9 | 3054 | io_iopoll_reap_events(ctx); |
2b188cc1 JA |
3055 | wait_for_completion(&ctx->ctx_done); |
3056 | io_ring_ctx_free(ctx); | |
3057 | } | |
3058 | ||
3059 | static int io_uring_release(struct inode *inode, struct file *file) | |
3060 | { | |
3061 | struct io_ring_ctx *ctx = file->private_data; | |
3062 | ||
3063 | file->private_data = NULL; | |
3064 | io_ring_ctx_wait_and_kill(ctx); | |
3065 | return 0; | |
3066 | } | |
3067 | ||
3068 | static int io_uring_mmap(struct file *file, struct vm_area_struct *vma) | |
3069 | { | |
3070 | loff_t offset = (loff_t) vma->vm_pgoff << PAGE_SHIFT; | |
3071 | unsigned long sz = vma->vm_end - vma->vm_start; | |
3072 | struct io_ring_ctx *ctx = file->private_data; | |
3073 | unsigned long pfn; | |
3074 | struct page *page; | |
3075 | void *ptr; | |
3076 | ||
3077 | switch (offset) { | |
3078 | case IORING_OFF_SQ_RING: | |
3079 | ptr = ctx->sq_ring; | |
3080 | break; | |
3081 | case IORING_OFF_SQES: | |
3082 | ptr = ctx->sq_sqes; | |
3083 | break; | |
3084 | case IORING_OFF_CQ_RING: | |
3085 | ptr = ctx->cq_ring; | |
3086 | break; | |
3087 | default: | |
3088 | return -EINVAL; | |
3089 | } | |
3090 | ||
3091 | page = virt_to_head_page(ptr); | |
3092 | if (sz > (PAGE_SIZE << compound_order(page))) | |
3093 | return -EINVAL; | |
3094 | ||
3095 | pfn = virt_to_phys(ptr) >> PAGE_SHIFT; | |
3096 | return remap_pfn_range(vma, vma->vm_start, pfn, sz, vma->vm_page_prot); | |
3097 | } | |
3098 | ||
3099 | SYSCALL_DEFINE6(io_uring_enter, unsigned int, fd, u32, to_submit, | |
3100 | u32, min_complete, u32, flags, const sigset_t __user *, sig, | |
3101 | size_t, sigsz) | |
3102 | { | |
3103 | struct io_ring_ctx *ctx; | |
3104 | long ret = -EBADF; | |
3105 | int submitted = 0; | |
3106 | struct fd f; | |
3107 | ||
6c271ce2 | 3108 | if (flags & ~(IORING_ENTER_GETEVENTS | IORING_ENTER_SQ_WAKEUP)) |
2b188cc1 JA |
3109 | return -EINVAL; |
3110 | ||
3111 | f = fdget(fd); | |
3112 | if (!f.file) | |
3113 | return -EBADF; | |
3114 | ||
3115 | ret = -EOPNOTSUPP; | |
3116 | if (f.file->f_op != &io_uring_fops) | |
3117 | goto out_fput; | |
3118 | ||
3119 | ret = -ENXIO; | |
3120 | ctx = f.file->private_data; | |
3121 | if (!percpu_ref_tryget(&ctx->refs)) | |
3122 | goto out_fput; | |
3123 | ||
6c271ce2 JA |
3124 | /* |
3125 | * For SQ polling, the thread will do all submissions and completions. | |
3126 | * Just return the requested submit count, and wake the thread if | |
3127 | * we were asked to. | |
3128 | */ | |
3129 | if (ctx->flags & IORING_SETUP_SQPOLL) { | |
3130 | if (flags & IORING_ENTER_SQ_WAKEUP) | |
3131 | wake_up(&ctx->sqo_wait); | |
3132 | submitted = to_submit; | |
3133 | goto out_ctx; | |
3134 | } | |
3135 | ||
2b188cc1 JA |
3136 | ret = 0; |
3137 | if (to_submit) { | |
3138 | to_submit = min(to_submit, ctx->sq_entries); | |
3139 | ||
3140 | mutex_lock(&ctx->uring_lock); | |
3141 | submitted = io_ring_submit(ctx, to_submit); | |
3142 | mutex_unlock(&ctx->uring_lock); | |
2b188cc1 JA |
3143 | } |
3144 | if (flags & IORING_ENTER_GETEVENTS) { | |
def596e9 JA |
3145 | unsigned nr_events = 0; |
3146 | ||
2b188cc1 JA |
3147 | min_complete = min(min_complete, ctx->cq_entries); |
3148 | ||
def596e9 JA |
3149 | if (ctx->flags & IORING_SETUP_IOPOLL) { |
3150 | mutex_lock(&ctx->uring_lock); | |
3151 | ret = io_iopoll_check(ctx, &nr_events, min_complete); | |
3152 | mutex_unlock(&ctx->uring_lock); | |
3153 | } else { | |
3154 | ret = io_cqring_wait(ctx, min_complete, sig, sigsz); | |
3155 | } | |
2b188cc1 JA |
3156 | } |
3157 | ||
3158 | out_ctx: | |
3159 | io_ring_drop_ctx_refs(ctx, 1); | |
3160 | out_fput: | |
3161 | fdput(f); | |
3162 | return submitted ? submitted : ret; | |
3163 | } | |
3164 | ||
3165 | static const struct file_operations io_uring_fops = { | |
3166 | .release = io_uring_release, | |
3167 | .mmap = io_uring_mmap, | |
3168 | .poll = io_uring_poll, | |
3169 | .fasync = io_uring_fasync, | |
3170 | }; | |
3171 | ||
3172 | static int io_allocate_scq_urings(struct io_ring_ctx *ctx, | |
3173 | struct io_uring_params *p) | |
3174 | { | |
3175 | struct io_sq_ring *sq_ring; | |
3176 | struct io_cq_ring *cq_ring; | |
3177 | size_t size; | |
3178 | ||
3179 | sq_ring = io_mem_alloc(struct_size(sq_ring, array, p->sq_entries)); | |
3180 | if (!sq_ring) | |
3181 | return -ENOMEM; | |
3182 | ||
3183 | ctx->sq_ring = sq_ring; | |
3184 | sq_ring->ring_mask = p->sq_entries - 1; | |
3185 | sq_ring->ring_entries = p->sq_entries; | |
3186 | ctx->sq_mask = sq_ring->ring_mask; | |
3187 | ctx->sq_entries = sq_ring->ring_entries; | |
3188 | ||
3189 | size = array_size(sizeof(struct io_uring_sqe), p->sq_entries); | |
3190 | if (size == SIZE_MAX) | |
3191 | return -EOVERFLOW; | |
3192 | ||
3193 | ctx->sq_sqes = io_mem_alloc(size); | |
52e04ef4 | 3194 | if (!ctx->sq_sqes) |
2b188cc1 | 3195 | return -ENOMEM; |
2b188cc1 JA |
3196 | |
3197 | cq_ring = io_mem_alloc(struct_size(cq_ring, cqes, p->cq_entries)); | |
52e04ef4 | 3198 | if (!cq_ring) |
2b188cc1 | 3199 | return -ENOMEM; |
2b188cc1 JA |
3200 | |
3201 | ctx->cq_ring = cq_ring; | |
3202 | cq_ring->ring_mask = p->cq_entries - 1; | |
3203 | cq_ring->ring_entries = p->cq_entries; | |
3204 | ctx->cq_mask = cq_ring->ring_mask; | |
3205 | ctx->cq_entries = cq_ring->ring_entries; | |
3206 | return 0; | |
3207 | } | |
3208 | ||
3209 | /* | |
3210 | * Allocate an anonymous fd, this is what constitutes the application | |
3211 | * visible backing of an io_uring instance. The application mmaps this | |
3212 | * fd to gain access to the SQ/CQ ring details. If UNIX sockets are enabled, | |
3213 | * we have to tie this fd to a socket for file garbage collection purposes. | |
3214 | */ | |
3215 | static int io_uring_get_fd(struct io_ring_ctx *ctx) | |
3216 | { | |
3217 | struct file *file; | |
3218 | int ret; | |
3219 | ||
3220 | #if defined(CONFIG_UNIX) | |
3221 | ret = sock_create_kern(&init_net, PF_UNIX, SOCK_RAW, IPPROTO_IP, | |
3222 | &ctx->ring_sock); | |
3223 | if (ret) | |
3224 | return ret; | |
3225 | #endif | |
3226 | ||
3227 | ret = get_unused_fd_flags(O_RDWR | O_CLOEXEC); | |
3228 | if (ret < 0) | |
3229 | goto err; | |
3230 | ||
3231 | file = anon_inode_getfile("[io_uring]", &io_uring_fops, ctx, | |
3232 | O_RDWR | O_CLOEXEC); | |
3233 | if (IS_ERR(file)) { | |
3234 | put_unused_fd(ret); | |
3235 | ret = PTR_ERR(file); | |
3236 | goto err; | |
3237 | } | |
3238 | ||
3239 | #if defined(CONFIG_UNIX) | |
3240 | ctx->ring_sock->file = file; | |
6b06314c | 3241 | ctx->ring_sock->sk->sk_user_data = ctx; |
2b188cc1 JA |
3242 | #endif |
3243 | fd_install(ret, file); | |
3244 | return ret; | |
3245 | err: | |
3246 | #if defined(CONFIG_UNIX) | |
3247 | sock_release(ctx->ring_sock); | |
3248 | ctx->ring_sock = NULL; | |
3249 | #endif | |
3250 | return ret; | |
3251 | } | |
3252 | ||
3253 | static int io_uring_create(unsigned entries, struct io_uring_params *p) | |
3254 | { | |
3255 | struct user_struct *user = NULL; | |
3256 | struct io_ring_ctx *ctx; | |
3257 | bool account_mem; | |
3258 | int ret; | |
3259 | ||
3260 | if (!entries || entries > IORING_MAX_ENTRIES) | |
3261 | return -EINVAL; | |
3262 | ||
3263 | /* | |
3264 | * Use twice as many entries for the CQ ring. It's possible for the | |
3265 | * application to drive a higher depth than the size of the SQ ring, | |
3266 | * since the sqes are only used at submission time. This allows for | |
3267 | * some flexibility in overcommitting a bit. | |
3268 | */ | |
3269 | p->sq_entries = roundup_pow_of_two(entries); | |
3270 | p->cq_entries = 2 * p->sq_entries; | |
3271 | ||
3272 | user = get_uid(current_user()); | |
3273 | account_mem = !capable(CAP_IPC_LOCK); | |
3274 | ||
3275 | if (account_mem) { | |
3276 | ret = io_account_mem(user, | |
3277 | ring_pages(p->sq_entries, p->cq_entries)); | |
3278 | if (ret) { | |
3279 | free_uid(user); | |
3280 | return ret; | |
3281 | } | |
3282 | } | |
3283 | ||
3284 | ctx = io_ring_ctx_alloc(p); | |
3285 | if (!ctx) { | |
3286 | if (account_mem) | |
3287 | io_unaccount_mem(user, ring_pages(p->sq_entries, | |
3288 | p->cq_entries)); | |
3289 | free_uid(user); | |
3290 | return -ENOMEM; | |
3291 | } | |
3292 | ctx->compat = in_compat_syscall(); | |
3293 | ctx->account_mem = account_mem; | |
3294 | ctx->user = user; | |
3295 | ||
3296 | ret = io_allocate_scq_urings(ctx, p); | |
3297 | if (ret) | |
3298 | goto err; | |
3299 | ||
6c271ce2 | 3300 | ret = io_sq_offload_start(ctx, p); |
2b188cc1 JA |
3301 | if (ret) |
3302 | goto err; | |
3303 | ||
3304 | ret = io_uring_get_fd(ctx); | |
3305 | if (ret < 0) | |
3306 | goto err; | |
3307 | ||
3308 | memset(&p->sq_off, 0, sizeof(p->sq_off)); | |
3309 | p->sq_off.head = offsetof(struct io_sq_ring, r.head); | |
3310 | p->sq_off.tail = offsetof(struct io_sq_ring, r.tail); | |
3311 | p->sq_off.ring_mask = offsetof(struct io_sq_ring, ring_mask); | |
3312 | p->sq_off.ring_entries = offsetof(struct io_sq_ring, ring_entries); | |
3313 | p->sq_off.flags = offsetof(struct io_sq_ring, flags); | |
3314 | p->sq_off.dropped = offsetof(struct io_sq_ring, dropped); | |
3315 | p->sq_off.array = offsetof(struct io_sq_ring, array); | |
3316 | ||
3317 | memset(&p->cq_off, 0, sizeof(p->cq_off)); | |
3318 | p->cq_off.head = offsetof(struct io_cq_ring, r.head); | |
3319 | p->cq_off.tail = offsetof(struct io_cq_ring, r.tail); | |
3320 | p->cq_off.ring_mask = offsetof(struct io_cq_ring, ring_mask); | |
3321 | p->cq_off.ring_entries = offsetof(struct io_cq_ring, ring_entries); | |
3322 | p->cq_off.overflow = offsetof(struct io_cq_ring, overflow); | |
3323 | p->cq_off.cqes = offsetof(struct io_cq_ring, cqes); | |
3324 | return ret; | |
3325 | err: | |
3326 | io_ring_ctx_wait_and_kill(ctx); | |
3327 | return ret; | |
3328 | } | |
3329 | ||
3330 | /* | |
3331 | * Sets up an aio uring context, and returns the fd. Applications asks for a | |
3332 | * ring size, we return the actual sq/cq ring sizes (among other things) in the | |
3333 | * params structure passed in. | |
3334 | */ | |
3335 | static long io_uring_setup(u32 entries, struct io_uring_params __user *params) | |
3336 | { | |
3337 | struct io_uring_params p; | |
3338 | long ret; | |
3339 | int i; | |
3340 | ||
3341 | if (copy_from_user(&p, params, sizeof(p))) | |
3342 | return -EFAULT; | |
3343 | for (i = 0; i < ARRAY_SIZE(p.resv); i++) { | |
3344 | if (p.resv[i]) | |
3345 | return -EINVAL; | |
3346 | } | |
3347 | ||
6c271ce2 JA |
3348 | if (p.flags & ~(IORING_SETUP_IOPOLL | IORING_SETUP_SQPOLL | |
3349 | IORING_SETUP_SQ_AFF)) | |
2b188cc1 JA |
3350 | return -EINVAL; |
3351 | ||
3352 | ret = io_uring_create(entries, &p); | |
3353 | if (ret < 0) | |
3354 | return ret; | |
3355 | ||
3356 | if (copy_to_user(params, &p, sizeof(p))) | |
3357 | return -EFAULT; | |
3358 | ||
3359 | return ret; | |
3360 | } | |
3361 | ||
3362 | SYSCALL_DEFINE2(io_uring_setup, u32, entries, | |
3363 | struct io_uring_params __user *, params) | |
3364 | { | |
3365 | return io_uring_setup(entries, params); | |
3366 | } | |
3367 | ||
edafccee JA |
3368 | static int __io_uring_register(struct io_ring_ctx *ctx, unsigned opcode, |
3369 | void __user *arg, unsigned nr_args) | |
b19062a5 JA |
3370 | __releases(ctx->uring_lock) |
3371 | __acquires(ctx->uring_lock) | |
edafccee JA |
3372 | { |
3373 | int ret; | |
3374 | ||
35fa71a0 JA |
3375 | /* |
3376 | * We're inside the ring mutex, if the ref is already dying, then | |
3377 | * someone else killed the ctx or is already going through | |
3378 | * io_uring_register(). | |
3379 | */ | |
3380 | if (percpu_ref_is_dying(&ctx->refs)) | |
3381 | return -ENXIO; | |
3382 | ||
edafccee | 3383 | percpu_ref_kill(&ctx->refs); |
b19062a5 JA |
3384 | |
3385 | /* | |
3386 | * Drop uring mutex before waiting for references to exit. If another | |
3387 | * thread is currently inside io_uring_enter() it might need to grab | |
3388 | * the uring_lock to make progress. If we hold it here across the drain | |
3389 | * wait, then we can deadlock. It's safe to drop the mutex here, since | |
3390 | * no new references will come in after we've killed the percpu ref. | |
3391 | */ | |
3392 | mutex_unlock(&ctx->uring_lock); | |
edafccee | 3393 | wait_for_completion(&ctx->ctx_done); |
b19062a5 | 3394 | mutex_lock(&ctx->uring_lock); |
edafccee JA |
3395 | |
3396 | switch (opcode) { | |
3397 | case IORING_REGISTER_BUFFERS: | |
3398 | ret = io_sqe_buffer_register(ctx, arg, nr_args); | |
3399 | break; | |
3400 | case IORING_UNREGISTER_BUFFERS: | |
3401 | ret = -EINVAL; | |
3402 | if (arg || nr_args) | |
3403 | break; | |
3404 | ret = io_sqe_buffer_unregister(ctx); | |
3405 | break; | |
6b06314c JA |
3406 | case IORING_REGISTER_FILES: |
3407 | ret = io_sqe_files_register(ctx, arg, nr_args); | |
3408 | break; | |
3409 | case IORING_UNREGISTER_FILES: | |
3410 | ret = -EINVAL; | |
3411 | if (arg || nr_args) | |
3412 | break; | |
3413 | ret = io_sqe_files_unregister(ctx); | |
3414 | break; | |
9b402849 JA |
3415 | case IORING_REGISTER_EVENTFD: |
3416 | ret = -EINVAL; | |
3417 | if (nr_args != 1) | |
3418 | break; | |
3419 | ret = io_eventfd_register(ctx, arg); | |
3420 | break; | |
3421 | case IORING_UNREGISTER_EVENTFD: | |
3422 | ret = -EINVAL; | |
3423 | if (arg || nr_args) | |
3424 | break; | |
3425 | ret = io_eventfd_unregister(ctx); | |
3426 | break; | |
edafccee JA |
3427 | default: |
3428 | ret = -EINVAL; | |
3429 | break; | |
3430 | } | |
3431 | ||
3432 | /* bring the ctx back to life */ | |
3433 | reinit_completion(&ctx->ctx_done); | |
3434 | percpu_ref_reinit(&ctx->refs); | |
3435 | return ret; | |
3436 | } | |
3437 | ||
3438 | SYSCALL_DEFINE4(io_uring_register, unsigned int, fd, unsigned int, opcode, | |
3439 | void __user *, arg, unsigned int, nr_args) | |
3440 | { | |
3441 | struct io_ring_ctx *ctx; | |
3442 | long ret = -EBADF; | |
3443 | struct fd f; | |
3444 | ||
3445 | f = fdget(fd); | |
3446 | if (!f.file) | |
3447 | return -EBADF; | |
3448 | ||
3449 | ret = -EOPNOTSUPP; | |
3450 | if (f.file->f_op != &io_uring_fops) | |
3451 | goto out_fput; | |
3452 | ||
3453 | ctx = f.file->private_data; | |
3454 | ||
3455 | mutex_lock(&ctx->uring_lock); | |
3456 | ret = __io_uring_register(ctx, opcode, arg, nr_args); | |
3457 | mutex_unlock(&ctx->uring_lock); | |
3458 | out_fput: | |
3459 | fdput(f); | |
3460 | return ret; | |
3461 | } | |
3462 | ||
2b188cc1 JA |
3463 | static int __init io_uring_init(void) |
3464 | { | |
3465 | req_cachep = KMEM_CACHE(io_kiocb, SLAB_HWCACHE_ALIGN | SLAB_PANIC); | |
3466 | return 0; | |
3467 | }; | |
3468 | __initcall(io_uring_init); |