2 * An async IO implementation for Linux
3 * Written by Benjamin LaHaise <bcrl@kvack.org>
5 * Implements an efficient asynchronous io interface.
7 * Copyright 2000, 2001, 2002 Red Hat, Inc. All Rights Reserved.
9 * See ../COPYING for licensing terms.
11 #define pr_fmt(fmt) "%s: " fmt, __func__
13 #include <linux/kernel.h>
14 #include <linux/init.h>
15 #include <linux/errno.h>
16 #include <linux/time.h>
17 #include <linux/aio_abi.h>
18 #include <linux/export.h>
19 #include <linux/syscalls.h>
20 #include <linux/backing-dev.h>
21 #include <linux/uio.h>
23 #include <linux/sched.h>
25 #include <linux/file.h>
27 #include <linux/mman.h>
28 #include <linux/mmu_context.h>
29 #include <linux/slab.h>
30 #include <linux/timer.h>
31 #include <linux/aio.h>
32 #include <linux/highmem.h>
33 #include <linux/workqueue.h>
34 #include <linux/security.h>
35 #include <linux/eventfd.h>
36 #include <linux/blkdev.h>
37 #include <linux/compat.h>
39 #include <asm/kmap_types.h>
40 #include <asm/uaccess.h>
42 #define AIO_RING_MAGIC 0xa10a10a1
43 #define AIO_RING_COMPAT_FEATURES 1
44 #define AIO_RING_INCOMPAT_FEATURES 0
46 unsigned id
; /* kernel internal index number */
47 unsigned nr
; /* number of io_events */
52 unsigned compat_features
;
53 unsigned incompat_features
;
54 unsigned header_length
; /* size of aio_ring */
57 struct io_event io_events
[0];
58 }; /* 128 bytes + ring size */
60 #define AIO_RING_PAGES 8
66 /* This needs improving */
67 unsigned long user_id
;
68 struct hlist_node list
;
71 * This is what userspace passed to io_setup(), it's not used for
72 * anything but counting against the global max_reqs quota.
74 * The real limit is nr_events - 1, which will be larger (see
79 /* Size of ringbuffer, in units of struct io_event */
82 unsigned long mmap_base
;
83 unsigned long mmap_size
;
85 struct page
**ring_pages
;
88 struct rcu_head rcu_head
;
89 struct work_struct rcu_work
;
93 } ____cacheline_aligned_in_smp
;
97 struct list_head active_reqs
; /* used for cancellation */
98 } ____cacheline_aligned_in_smp
;
101 struct mutex ring_lock
;
102 wait_queue_head_t wait
;
103 } ____cacheline_aligned_in_smp
;
107 spinlock_t completion_lock
;
108 } ____cacheline_aligned_in_smp
;
110 struct page
*internal_pages
[AIO_RING_PAGES
];
113 /*------ sysctl variables----*/
114 static DEFINE_SPINLOCK(aio_nr_lock
);
115 unsigned long aio_nr
; /* current system wide number of aio requests */
116 unsigned long aio_max_nr
= 0x10000; /* system wide maximum number of aio requests */
117 /*----end sysctl variables---*/
119 static struct kmem_cache
*kiocb_cachep
;
120 static struct kmem_cache
*kioctx_cachep
;
123 * Creates the slab caches used by the aio routines, panic on
124 * failure as this is done early during the boot sequence.
126 static int __init
aio_setup(void)
128 kiocb_cachep
= KMEM_CACHE(kiocb
, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
);
129 kioctx_cachep
= KMEM_CACHE(kioctx
,SLAB_HWCACHE_ALIGN
|SLAB_PANIC
);
131 pr_debug("sizeof(struct page) = %zu\n", sizeof(struct page
));
135 __initcall(aio_setup
);
137 static void aio_free_ring(struct kioctx
*ctx
)
141 for (i
= 0; i
< ctx
->nr_pages
; i
++)
142 put_page(ctx
->ring_pages
[i
]);
144 if (ctx
->ring_pages
&& ctx
->ring_pages
!= ctx
->internal_pages
)
145 kfree(ctx
->ring_pages
);
148 static int aio_setup_ring(struct kioctx
*ctx
)
150 struct aio_ring
*ring
;
151 unsigned nr_events
= ctx
->max_reqs
;
152 struct mm_struct
*mm
= current
->mm
;
153 unsigned long size
, populate
;
156 /* Compensate for the ring buffer's head/tail overlap entry */
157 nr_events
+= 2; /* 1 is required, 2 for good luck */
159 size
= sizeof(struct aio_ring
);
160 size
+= sizeof(struct io_event
) * nr_events
;
161 nr_pages
= (size
+ PAGE_SIZE
-1) >> PAGE_SHIFT
;
166 nr_events
= (PAGE_SIZE
* nr_pages
- sizeof(struct aio_ring
)) / sizeof(struct io_event
);
169 ctx
->ring_pages
= ctx
->internal_pages
;
170 if (nr_pages
> AIO_RING_PAGES
) {
171 ctx
->ring_pages
= kcalloc(nr_pages
, sizeof(struct page
*),
173 if (!ctx
->ring_pages
)
177 ctx
->mmap_size
= nr_pages
* PAGE_SIZE
;
178 pr_debug("attempting mmap of %lu bytes\n", ctx
->mmap_size
);
179 down_write(&mm
->mmap_sem
);
180 ctx
->mmap_base
= do_mmap_pgoff(NULL
, 0, ctx
->mmap_size
,
181 PROT_READ
|PROT_WRITE
,
182 MAP_ANONYMOUS
|MAP_PRIVATE
, 0, &populate
);
183 if (IS_ERR((void *)ctx
->mmap_base
)) {
184 up_write(&mm
->mmap_sem
);
190 pr_debug("mmap address: 0x%08lx\n", ctx
->mmap_base
);
191 ctx
->nr_pages
= get_user_pages(current
, mm
, ctx
->mmap_base
, nr_pages
,
192 1, 0, ctx
->ring_pages
, NULL
);
193 up_write(&mm
->mmap_sem
);
195 if (unlikely(ctx
->nr_pages
!= nr_pages
)) {
200 mm_populate(ctx
->mmap_base
, populate
);
202 ctx
->user_id
= ctx
->mmap_base
;
203 ctx
->nr_events
= nr_events
; /* trusted copy */
205 ring
= kmap_atomic(ctx
->ring_pages
[0]);
206 ring
->nr
= nr_events
; /* user copy */
207 ring
->id
= ctx
->user_id
;
208 ring
->head
= ring
->tail
= 0;
209 ring
->magic
= AIO_RING_MAGIC
;
210 ring
->compat_features
= AIO_RING_COMPAT_FEATURES
;
211 ring
->incompat_features
= AIO_RING_INCOMPAT_FEATURES
;
212 ring
->header_length
= sizeof(struct aio_ring
);
214 flush_dcache_page(ctx
->ring_pages
[0]);
219 #define AIO_EVENTS_PER_PAGE (PAGE_SIZE / sizeof(struct io_event))
220 #define AIO_EVENTS_FIRST_PAGE ((PAGE_SIZE - sizeof(struct aio_ring)) / sizeof(struct io_event))
221 #define AIO_EVENTS_OFFSET (AIO_EVENTS_PER_PAGE - AIO_EVENTS_FIRST_PAGE)
223 void kiocb_set_cancel_fn(struct kiocb
*req
, kiocb_cancel_fn
*cancel
)
225 struct kioctx
*ctx
= req
->ki_ctx
;
228 spin_lock_irqsave(&ctx
->ctx_lock
, flags
);
230 if (!req
->ki_list
.next
)
231 list_add(&req
->ki_list
, &ctx
->active_reqs
);
233 req
->ki_cancel
= cancel
;
235 spin_unlock_irqrestore(&ctx
->ctx_lock
, flags
);
237 EXPORT_SYMBOL(kiocb_set_cancel_fn
);
239 static int kiocb_cancel(struct kioctx
*ctx
, struct kiocb
*kiocb
,
240 struct io_event
*res
)
242 kiocb_cancel_fn
*old
, *cancel
;
246 * Don't want to set kiocb->ki_cancel = KIOCB_CANCELLED unless it
247 * actually has a cancel function, hence the cmpxchg()
250 cancel
= ACCESS_ONCE(kiocb
->ki_cancel
);
252 if (!cancel
|| cancel
== KIOCB_CANCELLED
)
256 cancel
= cmpxchg(&kiocb
->ki_cancel
, old
, KIOCB_CANCELLED
);
257 } while (cancel
!= old
);
259 atomic_inc(&kiocb
->ki_users
);
260 spin_unlock_irq(&ctx
->ctx_lock
);
262 memset(res
, 0, sizeof(*res
));
263 res
->obj
= (u64
)(unsigned long)kiocb
->ki_obj
.user
;
264 res
->data
= kiocb
->ki_user_data
;
265 ret
= cancel(kiocb
, res
);
267 spin_lock_irq(&ctx
->ctx_lock
);
272 static void free_ioctx_rcu(struct rcu_head
*head
)
274 struct kioctx
*ctx
= container_of(head
, struct kioctx
, rcu_head
);
275 kmem_cache_free(kioctx_cachep
, ctx
);
279 * When this function runs, the kioctx has been removed from the "hash table"
280 * and ctx->users has dropped to 0, so we know no more kiocbs can be submitted -
281 * now it's safe to cancel any that need to be.
283 static void free_ioctx(struct kioctx
*ctx
)
285 struct aio_ring
*ring
;
288 unsigned head
, avail
;
290 spin_lock_irq(&ctx
->ctx_lock
);
292 while (!list_empty(&ctx
->active_reqs
)) {
293 req
= list_first_entry(&ctx
->active_reqs
,
294 struct kiocb
, ki_list
);
296 list_del_init(&req
->ki_list
);
297 kiocb_cancel(ctx
, req
, &res
);
300 spin_unlock_irq(&ctx
->ctx_lock
);
302 ring
= kmap_atomic(ctx
->ring_pages
[0]);
306 while (atomic_read(&ctx
->reqs_active
) > 0) {
307 wait_event(ctx
->wait
,
309 atomic_read(&ctx
->reqs_active
) <= 0);
311 avail
= (head
<= ctx
->tail
? ctx
->tail
: ctx
->nr_events
) - head
;
314 head
%= ctx
->nr_events
;
317 WARN_ON(atomic_read(&ctx
->reqs_active
) < 0);
321 pr_debug("freeing %p\n", ctx
);
324 * Here the call_rcu() is between the wait_event() for reqs_active to
325 * hit 0, and freeing the ioctx.
327 * aio_complete() decrements reqs_active, but it has to touch the ioctx
328 * after to issue a wakeup so we use rcu.
330 call_rcu(&ctx
->rcu_head
, free_ioctx_rcu
);
333 static void put_ioctx(struct kioctx
*ctx
)
335 if (unlikely(atomic_dec_and_test(&ctx
->users
)))
340 * Allocates and initializes an ioctx. Returns an ERR_PTR if it failed.
342 static struct kioctx
*ioctx_alloc(unsigned nr_events
)
344 struct mm_struct
*mm
= current
->mm
;
348 /* Prevent overflows */
349 if ((nr_events
> (0x10000000U
/ sizeof(struct io_event
))) ||
350 (nr_events
> (0x10000000U
/ sizeof(struct kiocb
)))) {
351 pr_debug("ENOMEM: nr_events too high\n");
352 return ERR_PTR(-EINVAL
);
355 if (!nr_events
|| (unsigned long)nr_events
> aio_max_nr
)
356 return ERR_PTR(-EAGAIN
);
358 ctx
= kmem_cache_zalloc(kioctx_cachep
, GFP_KERNEL
);
360 return ERR_PTR(-ENOMEM
);
362 ctx
->max_reqs
= nr_events
;
364 atomic_set(&ctx
->users
, 2);
365 atomic_set(&ctx
->dead
, 0);
366 spin_lock_init(&ctx
->ctx_lock
);
367 spin_lock_init(&ctx
->completion_lock
);
368 mutex_init(&ctx
->ring_lock
);
369 init_waitqueue_head(&ctx
->wait
);
371 INIT_LIST_HEAD(&ctx
->active_reqs
);
373 if (aio_setup_ring(ctx
) < 0)
376 /* limit the number of system wide aios */
377 spin_lock(&aio_nr_lock
);
378 if (aio_nr
+ nr_events
> aio_max_nr
||
379 aio_nr
+ nr_events
< aio_nr
) {
380 spin_unlock(&aio_nr_lock
);
383 aio_nr
+= ctx
->max_reqs
;
384 spin_unlock(&aio_nr_lock
);
386 /* now link into global list. */
387 spin_lock(&mm
->ioctx_lock
);
388 hlist_add_head_rcu(&ctx
->list
, &mm
->ioctx_list
);
389 spin_unlock(&mm
->ioctx_lock
);
391 pr_debug("allocated ioctx %p[%ld]: mm=%p mask=0x%x\n",
392 ctx
, ctx
->user_id
, mm
, ctx
->nr_events
);
399 kmem_cache_free(kioctx_cachep
, ctx
);
400 pr_debug("error allocating ioctx %d\n", err
);
404 static void kill_ioctx_work(struct work_struct
*work
)
406 struct kioctx
*ctx
= container_of(work
, struct kioctx
, rcu_work
);
408 wake_up_all(&ctx
->wait
);
412 static void kill_ioctx_rcu(struct rcu_head
*head
)
414 struct kioctx
*ctx
= container_of(head
, struct kioctx
, rcu_head
);
416 INIT_WORK(&ctx
->rcu_work
, kill_ioctx_work
);
417 schedule_work(&ctx
->rcu_work
);
421 * Cancels all outstanding aio requests on an aio context. Used
422 * when the processes owning a context have all exited to encourage
423 * the rapid destruction of the kioctx.
425 static void kill_ioctx(struct mm_struct
*mm
, struct kioctx
*ctx
)
427 if (!atomic_xchg(&ctx
->dead
, 1)) {
428 spin_lock(&mm
->ioctx_lock
);
429 hlist_del_rcu(&ctx
->list
);
430 spin_unlock(&mm
->ioctx_lock
);
433 * It'd be more correct to do this in free_ioctx(), after all
434 * the outstanding kiocbs have finished - but by then io_destroy
435 * has already returned, so io_setup() could potentially return
436 * -EAGAIN with no ioctxs actually in use (as far as userspace
439 spin_lock(&aio_nr_lock
);
440 BUG_ON(aio_nr
- ctx
->max_reqs
> aio_nr
);
441 aio_nr
-= ctx
->max_reqs
;
442 spin_unlock(&aio_nr_lock
);
445 vm_munmap(ctx
->mmap_base
, ctx
->mmap_size
);
447 /* Between hlist_del_rcu() and dropping the initial ref */
448 call_rcu(&ctx
->rcu_head
, kill_ioctx_rcu
);
452 /* wait_on_sync_kiocb:
453 * Waits on the given sync kiocb to complete.
455 ssize_t
wait_on_sync_kiocb(struct kiocb
*iocb
)
457 while (atomic_read(&iocb
->ki_users
)) {
458 set_current_state(TASK_UNINTERRUPTIBLE
);
459 if (!atomic_read(&iocb
->ki_users
))
463 __set_current_state(TASK_RUNNING
);
464 return iocb
->ki_user_data
;
466 EXPORT_SYMBOL(wait_on_sync_kiocb
);
469 * exit_aio: called when the last user of mm goes away. At this point, there is
470 * no way for any new requests to be submited or any of the io_* syscalls to be
471 * called on the context.
473 * There may be outstanding kiocbs, but free_ioctx() will explicitly wait on
476 void exit_aio(struct mm_struct
*mm
)
479 struct hlist_node
*n
;
481 hlist_for_each_entry_safe(ctx
, n
, &mm
->ioctx_list
, list
) {
482 if (1 != atomic_read(&ctx
->users
))
484 "exit_aio:ioctx still alive: %d %d %d\n",
485 atomic_read(&ctx
->users
),
486 atomic_read(&ctx
->dead
),
487 atomic_read(&ctx
->reqs_active
));
489 * We don't need to bother with munmap() here -
490 * exit_mmap(mm) is coming and it'll unmap everything.
491 * Since aio_free_ring() uses non-zero ->mmap_size
492 * as indicator that it needs to unmap the area,
493 * just set it to 0; aio_free_ring() is the only
494 * place that uses ->mmap_size, so it's safe.
503 * Allocate a slot for an aio request. Increments the ki_users count
504 * of the kioctx so that the kioctx stays around until all requests are
505 * complete. Returns NULL if no requests are free.
507 * Returns with kiocb->ki_users set to 2. The io submit code path holds
508 * an extra reference while submitting the i/o.
509 * This prevents races between the aio code path referencing the
510 * req (after submitting it) and aio_complete() freeing the req.
512 static inline struct kiocb
*aio_get_req(struct kioctx
*ctx
)
516 if (atomic_read(&ctx
->reqs_active
) >= ctx
->nr_events
)
519 if (atomic_inc_return(&ctx
->reqs_active
) > ctx
->nr_events
- 1)
522 req
= kmem_cache_alloc(kiocb_cachep
, GFP_KERNEL
|__GFP_ZERO
);
526 atomic_set(&req
->ki_users
, 2);
531 atomic_dec(&ctx
->reqs_active
);
535 static void kiocb_free(struct kiocb
*req
)
539 if (req
->ki_eventfd
!= NULL
)
540 eventfd_ctx_put(req
->ki_eventfd
);
543 if (req
->ki_iovec
!= &req
->ki_inline_vec
)
544 kfree(req
->ki_iovec
);
545 kmem_cache_free(kiocb_cachep
, req
);
548 void aio_put_req(struct kiocb
*req
)
550 if (atomic_dec_and_test(&req
->ki_users
))
553 EXPORT_SYMBOL(aio_put_req
);
555 static struct kioctx
*lookup_ioctx(unsigned long ctx_id
)
557 struct mm_struct
*mm
= current
->mm
;
558 struct kioctx
*ctx
, *ret
= NULL
;
562 hlist_for_each_entry_rcu(ctx
, &mm
->ioctx_list
, list
) {
563 if (ctx
->user_id
== ctx_id
) {
564 atomic_inc(&ctx
->users
);
575 * Called when the io request on the given iocb is complete.
577 void aio_complete(struct kiocb
*iocb
, long res
, long res2
)
579 struct kioctx
*ctx
= iocb
->ki_ctx
;
580 struct aio_ring
*ring
;
581 struct io_event
*ev_page
, *event
;
586 * Special case handling for sync iocbs:
587 * - events go directly into the iocb for fast handling
588 * - the sync task with the iocb in its stack holds the single iocb
589 * ref, no other paths have a way to get another ref
590 * - the sync task helpfully left a reference to itself in the iocb
592 if (is_sync_kiocb(iocb
)) {
593 BUG_ON(atomic_read(&iocb
->ki_users
) != 1);
594 iocb
->ki_user_data
= res
;
595 atomic_set(&iocb
->ki_users
, 0);
596 wake_up_process(iocb
->ki_obj
.tsk
);
601 * Take rcu_read_lock() in case the kioctx is being destroyed, as we
602 * need to issue a wakeup after decrementing reqs_active.
606 if (iocb
->ki_list
.next
) {
609 spin_lock_irqsave(&ctx
->ctx_lock
, flags
);
610 list_del(&iocb
->ki_list
);
611 spin_unlock_irqrestore(&ctx
->ctx_lock
, flags
);
615 * cancelled requests don't get events, userland was given one
616 * when the event got cancelled.
618 if (unlikely(xchg(&iocb
->ki_cancel
,
619 KIOCB_CANCELLED
) == KIOCB_CANCELLED
)) {
620 atomic_dec(&ctx
->reqs_active
);
621 /* Still need the wake_up in case free_ioctx is waiting */
626 * Add a completion event to the ring buffer. Must be done holding
627 * ctx->ctx_lock to prevent other code from messing with the tail
628 * pointer since we might be called from irq context.
630 spin_lock_irqsave(&ctx
->completion_lock
, flags
);
633 pos
= tail
+ AIO_EVENTS_OFFSET
;
635 if (++tail
>= ctx
->nr_events
)
638 ev_page
= kmap_atomic(ctx
->ring_pages
[pos
/ AIO_EVENTS_PER_PAGE
]);
639 event
= ev_page
+ pos
% AIO_EVENTS_PER_PAGE
;
641 event
->obj
= (u64
)(unsigned long)iocb
->ki_obj
.user
;
642 event
->data
= iocb
->ki_user_data
;
646 kunmap_atomic(ev_page
);
647 flush_dcache_page(ctx
->ring_pages
[pos
/ AIO_EVENTS_PER_PAGE
]);
649 pr_debug("%p[%u]: %p: %p %Lx %lx %lx\n",
650 ctx
, tail
, iocb
, iocb
->ki_obj
.user
, iocb
->ki_user_data
,
653 /* after flagging the request as done, we
654 * must never even look at it again
656 smp_wmb(); /* make event visible before updating tail */
660 ring
= kmap_atomic(ctx
->ring_pages
[0]);
663 flush_dcache_page(ctx
->ring_pages
[0]);
665 spin_unlock_irqrestore(&ctx
->completion_lock
, flags
);
667 pr_debug("added to ring %p at [%u]\n", iocb
, tail
);
670 * Check if the user asked us to deliver the result through an
671 * eventfd. The eventfd_signal() function is safe to be called
674 if (iocb
->ki_eventfd
!= NULL
)
675 eventfd_signal(iocb
->ki_eventfd
, 1);
678 /* everything turned out well, dispose of the aiocb. */
680 atomic_dec(&ctx
->reqs_active
);
683 * We have to order our ring_info tail store above and test
684 * of the wait list below outside the wait lock. This is
685 * like in wake_up_bit() where clearing a bit has to be
686 * ordered with the unlocked test.
690 if (waitqueue_active(&ctx
->wait
))
695 EXPORT_SYMBOL(aio_complete
);
698 * Pull an event off of the ioctx's event ring. Returns the number of
701 static long aio_read_events_ring(struct kioctx
*ctx
,
702 struct io_event __user
*event
, long nr
)
704 struct aio_ring
*ring
;
709 mutex_lock(&ctx
->ring_lock
);
711 ring
= kmap_atomic(ctx
->ring_pages
[0]);
715 pr_debug("h%u t%u m%u\n", head
, ctx
->tail
, ctx
->nr_events
);
717 if (head
== ctx
->tail
)
720 head
%= ctx
->nr_events
;
727 avail
= (head
<= ctx
->tail
? ctx
->tail
: ctx
->nr_events
) - head
;
728 if (head
== ctx
->tail
)
731 avail
= min(avail
, nr
- ret
);
732 avail
= min_t(long, avail
, AIO_EVENTS_PER_PAGE
-
733 ((head
+ AIO_EVENTS_OFFSET
) % AIO_EVENTS_PER_PAGE
));
735 pos
= head
+ AIO_EVENTS_OFFSET
;
736 page
= ctx
->ring_pages
[pos
/ AIO_EVENTS_PER_PAGE
];
737 pos
%= AIO_EVENTS_PER_PAGE
;
740 copy_ret
= copy_to_user(event
+ ret
, ev
+ pos
,
741 sizeof(*ev
) * avail
);
744 if (unlikely(copy_ret
)) {
751 head
%= ctx
->nr_events
;
754 ring
= kmap_atomic(ctx
->ring_pages
[0]);
757 flush_dcache_page(ctx
->ring_pages
[0]);
759 pr_debug("%li h%u t%u\n", ret
, head
, ctx
->tail
);
761 mutex_unlock(&ctx
->ring_lock
);
766 static bool aio_read_events(struct kioctx
*ctx
, long min_nr
, long nr
,
767 struct io_event __user
*event
, long *i
)
769 long ret
= aio_read_events_ring(ctx
, event
+ *i
, nr
- *i
);
774 if (unlikely(atomic_read(&ctx
->dead
)))
780 return ret
< 0 || *i
>= min_nr
;
783 static long read_events(struct kioctx
*ctx
, long min_nr
, long nr
,
784 struct io_event __user
*event
,
785 struct timespec __user
*timeout
)
787 ktime_t until
= { .tv64
= KTIME_MAX
};
793 if (unlikely(copy_from_user(&ts
, timeout
, sizeof(ts
))))
796 until
= timespec_to_ktime(ts
);
800 * Note that aio_read_events() is being called as the conditional - i.e.
801 * we're calling it after prepare_to_wait() has set task state to
802 * TASK_INTERRUPTIBLE.
804 * But aio_read_events() can block, and if it blocks it's going to flip
805 * the task state back to TASK_RUNNING.
807 * This should be ok, provided it doesn't flip the state back to
808 * TASK_RUNNING and return 0 too much - that causes us to spin. That
809 * will only happen if the mutex_lock() call blocks, and we then find
810 * the ringbuffer empty. So in practice we should be ok, but it's
811 * something to be aware of when touching this code.
813 wait_event_interruptible_hrtimeout(ctx
->wait
,
814 aio_read_events(ctx
, min_nr
, nr
, event
, &ret
), until
);
816 if (!ret
&& signal_pending(current
))
823 * Create an aio_context capable of receiving at least nr_events.
824 * ctxp must not point to an aio_context that already exists, and
825 * must be initialized to 0 prior to the call. On successful
826 * creation of the aio_context, *ctxp is filled in with the resulting
827 * handle. May fail with -EINVAL if *ctxp is not initialized,
828 * if the specified nr_events exceeds internal limits. May fail
829 * with -EAGAIN if the specified nr_events exceeds the user's limit
830 * of available events. May fail with -ENOMEM if insufficient kernel
831 * resources are available. May fail with -EFAULT if an invalid
832 * pointer is passed for ctxp. Will fail with -ENOSYS if not
835 SYSCALL_DEFINE2(io_setup
, unsigned, nr_events
, aio_context_t __user
*, ctxp
)
837 struct kioctx
*ioctx
= NULL
;
841 ret
= get_user(ctx
, ctxp
);
846 if (unlikely(ctx
|| nr_events
== 0)) {
847 pr_debug("EINVAL: io_setup: ctx %lu nr_events %u\n",
852 ioctx
= ioctx_alloc(nr_events
);
853 ret
= PTR_ERR(ioctx
);
854 if (!IS_ERR(ioctx
)) {
855 ret
= put_user(ioctx
->user_id
, ctxp
);
857 kill_ioctx(current
->mm
, ioctx
);
866 * Destroy the aio_context specified. May cancel any outstanding
867 * AIOs and block on completion. Will fail with -ENOSYS if not
868 * implemented. May fail with -EINVAL if the context pointed to
871 SYSCALL_DEFINE1(io_destroy
, aio_context_t
, ctx
)
873 struct kioctx
*ioctx
= lookup_ioctx(ctx
);
874 if (likely(NULL
!= ioctx
)) {
875 kill_ioctx(current
->mm
, ioctx
);
879 pr_debug("EINVAL: io_destroy: invalid context id\n");
883 static void aio_advance_iovec(struct kiocb
*iocb
, ssize_t ret
)
885 struct iovec
*iov
= &iocb
->ki_iovec
[iocb
->ki_cur_seg
];
889 while (iocb
->ki_cur_seg
< iocb
->ki_nr_segs
&& ret
> 0) {
890 ssize_t
this = min((ssize_t
)iov
->iov_len
, ret
);
891 iov
->iov_base
+= this;
892 iov
->iov_len
-= this;
893 iocb
->ki_left
-= this;
895 if (iov
->iov_len
== 0) {
901 /* the caller should not have done more io than what fit in
902 * the remaining iovecs */
903 BUG_ON(ret
> 0 && iocb
->ki_left
== 0);
906 typedef ssize_t (aio_rw_op
)(struct kiocb
*, const struct iovec
*,
907 unsigned long, loff_t
);
909 static ssize_t
aio_rw_vect_retry(struct kiocb
*iocb
, int rw
, aio_rw_op
*rw_op
)
911 struct file
*file
= iocb
->ki_filp
;
912 struct address_space
*mapping
= file
->f_mapping
;
913 struct inode
*inode
= mapping
->host
;
916 /* This matches the pread()/pwrite() logic */
917 if (iocb
->ki_pos
< 0)
921 file_start_write(file
);
923 ret
= rw_op(iocb
, &iocb
->ki_iovec
[iocb
->ki_cur_seg
],
924 iocb
->ki_nr_segs
- iocb
->ki_cur_seg
,
927 aio_advance_iovec(iocb
, ret
);
929 /* retry all partial writes. retry partial reads as long as its a
931 } while (ret
> 0 && iocb
->ki_left
> 0 &&
933 (!S_ISFIFO(inode
->i_mode
) && !S_ISSOCK(inode
->i_mode
))));
935 file_end_write(file
);
937 /* This means we must have transferred all that we could */
938 /* No need to retry anymore */
939 if ((ret
== 0) || (iocb
->ki_left
== 0))
940 ret
= iocb
->ki_nbytes
- iocb
->ki_left
;
942 /* If we managed to write some out we return that, rather than
943 * the eventual error. */
945 && ret
< 0 && ret
!= -EIOCBQUEUED
946 && iocb
->ki_nbytes
- iocb
->ki_left
)
947 ret
= iocb
->ki_nbytes
- iocb
->ki_left
;
952 static ssize_t
aio_setup_vectored_rw(int rw
, struct kiocb
*kiocb
, bool compat
)
956 kiocb
->ki_nr_segs
= kiocb
->ki_nbytes
;
960 ret
= compat_rw_copy_check_uvector(rw
,
961 (struct compat_iovec __user
*)kiocb
->ki_buf
,
962 kiocb
->ki_nr_segs
, 1, &kiocb
->ki_inline_vec
,
966 ret
= rw_copy_check_uvector(rw
,
967 (struct iovec __user
*)kiocb
->ki_buf
,
968 kiocb
->ki_nr_segs
, 1, &kiocb
->ki_inline_vec
,
973 /* ki_nbytes now reflect bytes instead of segs */
974 kiocb
->ki_nbytes
= ret
;
978 static ssize_t
aio_setup_single_vector(int rw
, struct kiocb
*kiocb
)
980 if (unlikely(!access_ok(!rw
, kiocb
->ki_buf
, kiocb
->ki_nbytes
)))
983 kiocb
->ki_iovec
= &kiocb
->ki_inline_vec
;
984 kiocb
->ki_iovec
->iov_base
= kiocb
->ki_buf
;
985 kiocb
->ki_iovec
->iov_len
= kiocb
->ki_nbytes
;
986 kiocb
->ki_nr_segs
= 1;
992 * Performs the initial checks and aio retry method
993 * setup for the kiocb at the time of io submission.
995 static ssize_t
aio_run_iocb(struct kiocb
*req
, bool compat
)
997 struct file
*file
= req
->ki_filp
;
1003 switch (req
->ki_opcode
) {
1004 case IOCB_CMD_PREAD
:
1005 case IOCB_CMD_PREADV
:
1008 rw_op
= file
->f_op
->aio_read
;
1011 case IOCB_CMD_PWRITE
:
1012 case IOCB_CMD_PWRITEV
:
1015 rw_op
= file
->f_op
->aio_write
;
1018 if (unlikely(!(file
->f_mode
& mode
)))
1024 ret
= (req
->ki_opcode
== IOCB_CMD_PREADV
||
1025 req
->ki_opcode
== IOCB_CMD_PWRITEV
)
1026 ? aio_setup_vectored_rw(rw
, req
, compat
)
1027 : aio_setup_single_vector(rw
, req
);
1031 ret
= rw_verify_area(rw
, file
, &req
->ki_pos
, req
->ki_nbytes
);
1035 req
->ki_nbytes
= ret
;
1038 ret
= aio_rw_vect_retry(req
, rw
, rw_op
);
1041 case IOCB_CMD_FDSYNC
:
1042 if (!file
->f_op
->aio_fsync
)
1045 ret
= file
->f_op
->aio_fsync(req
, 1);
1048 case IOCB_CMD_FSYNC
:
1049 if (!file
->f_op
->aio_fsync
)
1052 ret
= file
->f_op
->aio_fsync(req
, 0);
1056 pr_debug("EINVAL: no operation provided\n");
1060 if (ret
!= -EIOCBQUEUED
) {
1062 * There's no easy way to restart the syscall since other AIO's
1063 * may be already running. Just fail this IO with EINTR.
1065 if (unlikely(ret
== -ERESTARTSYS
|| ret
== -ERESTARTNOINTR
||
1066 ret
== -ERESTARTNOHAND
||
1067 ret
== -ERESTART_RESTARTBLOCK
))
1069 aio_complete(req
, ret
, 0);
1075 static int io_submit_one(struct kioctx
*ctx
, struct iocb __user
*user_iocb
,
1076 struct iocb
*iocb
, bool compat
)
1081 /* enforce forwards compatibility on users */
1082 if (unlikely(iocb
->aio_reserved1
|| iocb
->aio_reserved2
)) {
1083 pr_debug("EINVAL: reserve field set\n");
1087 /* prevent overflows */
1089 (iocb
->aio_buf
!= (unsigned long)iocb
->aio_buf
) ||
1090 (iocb
->aio_nbytes
!= (size_t)iocb
->aio_nbytes
) ||
1091 ((ssize_t
)iocb
->aio_nbytes
< 0)
1093 pr_debug("EINVAL: io_submit: overflow check\n");
1097 req
= aio_get_req(ctx
);
1101 req
->ki_filp
= fget(iocb
->aio_fildes
);
1102 if (unlikely(!req
->ki_filp
)) {
1107 if (iocb
->aio_flags
& IOCB_FLAG_RESFD
) {
1109 * If the IOCB_FLAG_RESFD flag of aio_flags is set, get an
1110 * instance of the file* now. The file descriptor must be
1111 * an eventfd() fd, and will be signaled for each completed
1112 * event using the eventfd_signal() function.
1114 req
->ki_eventfd
= eventfd_ctx_fdget((int) iocb
->aio_resfd
);
1115 if (IS_ERR(req
->ki_eventfd
)) {
1116 ret
= PTR_ERR(req
->ki_eventfd
);
1117 req
->ki_eventfd
= NULL
;
1122 ret
= put_user(KIOCB_KEY
, &user_iocb
->aio_key
);
1123 if (unlikely(ret
)) {
1124 pr_debug("EFAULT: aio_key\n");
1128 req
->ki_obj
.user
= user_iocb
;
1129 req
->ki_user_data
= iocb
->aio_data
;
1130 req
->ki_pos
= iocb
->aio_offset
;
1132 req
->ki_buf
= (char __user
*)(unsigned long)iocb
->aio_buf
;
1133 req
->ki_left
= req
->ki_nbytes
= iocb
->aio_nbytes
;
1134 req
->ki_opcode
= iocb
->aio_lio_opcode
;
1136 ret
= aio_run_iocb(req
, compat
);
1140 aio_put_req(req
); /* drop extra ref to req */
1143 atomic_dec(&ctx
->reqs_active
);
1144 aio_put_req(req
); /* drop extra ref to req */
1145 aio_put_req(req
); /* drop i/o ref to req */
1149 long do_io_submit(aio_context_t ctx_id
, long nr
,
1150 struct iocb __user
*__user
*iocbpp
, bool compat
)
1155 struct blk_plug plug
;
1157 if (unlikely(nr
< 0))
1160 if (unlikely(nr
> LONG_MAX
/sizeof(*iocbpp
)))
1161 nr
= LONG_MAX
/sizeof(*iocbpp
);
1163 if (unlikely(!access_ok(VERIFY_READ
, iocbpp
, (nr
*sizeof(*iocbpp
)))))
1166 ctx
= lookup_ioctx(ctx_id
);
1167 if (unlikely(!ctx
)) {
1168 pr_debug("EINVAL: invalid context id\n");
1172 blk_start_plug(&plug
);
1175 * AKPM: should this return a partial result if some of the IOs were
1176 * successfully submitted?
1178 for (i
=0; i
<nr
; i
++) {
1179 struct iocb __user
*user_iocb
;
1182 if (unlikely(__get_user(user_iocb
, iocbpp
+ i
))) {
1187 if (unlikely(copy_from_user(&tmp
, user_iocb
, sizeof(tmp
)))) {
1192 ret
= io_submit_one(ctx
, user_iocb
, &tmp
, compat
);
1196 blk_finish_plug(&plug
);
1203 * Queue the nr iocbs pointed to by iocbpp for processing. Returns
1204 * the number of iocbs queued. May return -EINVAL if the aio_context
1205 * specified by ctx_id is invalid, if nr is < 0, if the iocb at
1206 * *iocbpp[0] is not properly initialized, if the operation specified
1207 * is invalid for the file descriptor in the iocb. May fail with
1208 * -EFAULT if any of the data structures point to invalid data. May
1209 * fail with -EBADF if the file descriptor specified in the first
1210 * iocb is invalid. May fail with -EAGAIN if insufficient resources
1211 * are available to queue any iocbs. Will return 0 if nr is 0. Will
1212 * fail with -ENOSYS if not implemented.
1214 SYSCALL_DEFINE3(io_submit
, aio_context_t
, ctx_id
, long, nr
,
1215 struct iocb __user
* __user
*, iocbpp
)
1217 return do_io_submit(ctx_id
, nr
, iocbpp
, 0);
1221 * Finds a given iocb for cancellation.
1223 static struct kiocb
*lookup_kiocb(struct kioctx
*ctx
, struct iocb __user
*iocb
,
1226 struct list_head
*pos
;
1228 assert_spin_locked(&ctx
->ctx_lock
);
1230 if (key
!= KIOCB_KEY
)
1233 /* TODO: use a hash or array, this sucks. */
1234 list_for_each(pos
, &ctx
->active_reqs
) {
1235 struct kiocb
*kiocb
= list_kiocb(pos
);
1236 if (kiocb
->ki_obj
.user
== iocb
)
1243 * Attempts to cancel an iocb previously passed to io_submit. If
1244 * the operation is successfully cancelled, the resulting event is
1245 * copied into the memory pointed to by result without being placed
1246 * into the completion queue and 0 is returned. May fail with
1247 * -EFAULT if any of the data structures pointed to are invalid.
1248 * May fail with -EINVAL if aio_context specified by ctx_id is
1249 * invalid. May fail with -EAGAIN if the iocb specified was not
1250 * cancelled. Will fail with -ENOSYS if not implemented.
1252 SYSCALL_DEFINE3(io_cancel
, aio_context_t
, ctx_id
, struct iocb __user
*, iocb
,
1253 struct io_event __user
*, result
)
1255 struct io_event res
;
1257 struct kiocb
*kiocb
;
1261 ret
= get_user(key
, &iocb
->aio_key
);
1265 ctx
= lookup_ioctx(ctx_id
);
1269 spin_lock_irq(&ctx
->ctx_lock
);
1271 kiocb
= lookup_kiocb(ctx
, iocb
, key
);
1273 ret
= kiocb_cancel(ctx
, kiocb
, &res
);
1277 spin_unlock_irq(&ctx
->ctx_lock
);
1280 /* Cancellation succeeded -- copy the result
1281 * into the user's buffer.
1283 if (copy_to_user(result
, &res
, sizeof(res
)))
1293 * Attempts to read at least min_nr events and up to nr events from
1294 * the completion queue for the aio_context specified by ctx_id. If
1295 * it succeeds, the number of read events is returned. May fail with
1296 * -EINVAL if ctx_id is invalid, if min_nr is out of range, if nr is
1297 * out of range, if timeout is out of range. May fail with -EFAULT
1298 * if any of the memory specified is invalid. May return 0 or
1299 * < min_nr if the timeout specified by timeout has elapsed
1300 * before sufficient events are available, where timeout == NULL
1301 * specifies an infinite timeout. Note that the timeout pointed to by
1302 * timeout is relative. Will fail with -ENOSYS if not implemented.
1304 SYSCALL_DEFINE5(io_getevents
, aio_context_t
, ctx_id
,
1307 struct io_event __user
*, events
,
1308 struct timespec __user
*, timeout
)
1310 struct kioctx
*ioctx
= lookup_ioctx(ctx_id
);
1313 if (likely(ioctx
)) {
1314 if (likely(min_nr
<= nr
&& min_nr
>= 0))
1315 ret
= read_events(ioctx
, min_nr
, nr
, events
, timeout
);