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 #include <linux/kernel.h>
12 #include <linux/init.h>
13 #include <linux/errno.h>
14 #include <linux/time.h>
15 #include <linux/aio_abi.h>
16 #include <linux/module.h>
17 #include <linux/syscalls.h>
21 #include <linux/sched.h>
23 #include <linux/file.h>
25 #include <linux/mman.h>
26 #include <linux/slab.h>
27 #include <linux/timer.h>
28 #include <linux/aio.h>
29 #include <linux/highmem.h>
30 #include <linux/workqueue.h>
31 #include <linux/security.h>
32 #include <linux/rcuref.h>
34 #include <asm/kmap_types.h>
35 #include <asm/uaccess.h>
36 #include <asm/mmu_context.h>
39 #define dprintk printk
41 #define dprintk(x...) do { ; } while (0)
44 /*------ sysctl variables----*/
45 atomic_t aio_nr
= ATOMIC_INIT(0); /* current system wide number of aio requests */
46 unsigned aio_max_nr
= 0x10000; /* system wide maximum number of aio requests */
47 /*----end sysctl variables---*/
49 static kmem_cache_t
*kiocb_cachep
;
50 static kmem_cache_t
*kioctx_cachep
;
52 static struct workqueue_struct
*aio_wq
;
54 /* Used for rare fput completion. */
55 static void aio_fput_routine(void *);
56 static DECLARE_WORK(fput_work
, aio_fput_routine
, NULL
);
58 static DEFINE_SPINLOCK(fput_lock
);
59 static LIST_HEAD(fput_head
);
61 static void aio_kick_handler(void *);
62 static void aio_queue_work(struct kioctx
*);
65 * Creates the slab caches used by the aio routines, panic on
66 * failure as this is done early during the boot sequence.
68 static int __init
aio_setup(void)
70 kiocb_cachep
= kmem_cache_create("kiocb", sizeof(struct kiocb
),
71 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
, NULL
, NULL
);
72 kioctx_cachep
= kmem_cache_create("kioctx", sizeof(struct kioctx
),
73 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
, NULL
, NULL
);
75 aio_wq
= create_workqueue("aio");
77 pr_debug("aio_setup: sizeof(struct page) = %d\n", (int)sizeof(struct page
));
82 static void aio_free_ring(struct kioctx
*ctx
)
84 struct aio_ring_info
*info
= &ctx
->ring_info
;
87 for (i
=0; i
<info
->nr_pages
; i
++)
88 put_page(info
->ring_pages
[i
]);
90 if (info
->mmap_size
) {
91 down_write(&ctx
->mm
->mmap_sem
);
92 do_munmap(ctx
->mm
, info
->mmap_base
, info
->mmap_size
);
93 up_write(&ctx
->mm
->mmap_sem
);
96 if (info
->ring_pages
&& info
->ring_pages
!= info
->internal_pages
)
97 kfree(info
->ring_pages
);
98 info
->ring_pages
= NULL
;
102 static int aio_setup_ring(struct kioctx
*ctx
)
104 struct aio_ring
*ring
;
105 struct aio_ring_info
*info
= &ctx
->ring_info
;
106 unsigned nr_events
= ctx
->max_reqs
;
110 /* Compensate for the ring buffer's head/tail overlap entry */
111 nr_events
+= 2; /* 1 is required, 2 for good luck */
113 size
= sizeof(struct aio_ring
);
114 size
+= sizeof(struct io_event
) * nr_events
;
115 nr_pages
= (size
+ PAGE_SIZE
-1) >> PAGE_SHIFT
;
120 nr_events
= (PAGE_SIZE
* nr_pages
- sizeof(struct aio_ring
)) / sizeof(struct io_event
);
123 info
->ring_pages
= info
->internal_pages
;
124 if (nr_pages
> AIO_RING_PAGES
) {
125 info
->ring_pages
= kmalloc(sizeof(struct page
*) * nr_pages
, GFP_KERNEL
);
126 if (!info
->ring_pages
)
128 memset(info
->ring_pages
, 0, sizeof(struct page
*) * nr_pages
);
131 info
->mmap_size
= nr_pages
* PAGE_SIZE
;
132 dprintk("attempting mmap of %lu bytes\n", info
->mmap_size
);
133 down_write(&ctx
->mm
->mmap_sem
);
134 info
->mmap_base
= do_mmap(NULL
, 0, info
->mmap_size
,
135 PROT_READ
|PROT_WRITE
, MAP_ANON
|MAP_PRIVATE
,
137 if (IS_ERR((void *)info
->mmap_base
)) {
138 up_write(&ctx
->mm
->mmap_sem
);
139 printk("mmap err: %ld\n", -info
->mmap_base
);
145 dprintk("mmap address: 0x%08lx\n", info
->mmap_base
);
146 info
->nr_pages
= get_user_pages(current
, ctx
->mm
,
147 info
->mmap_base
, nr_pages
,
148 1, 0, info
->ring_pages
, NULL
);
149 up_write(&ctx
->mm
->mmap_sem
);
151 if (unlikely(info
->nr_pages
!= nr_pages
)) {
156 ctx
->user_id
= info
->mmap_base
;
158 info
->nr
= nr_events
; /* trusted copy */
160 ring
= kmap_atomic(info
->ring_pages
[0], KM_USER0
);
161 ring
->nr
= nr_events
; /* user copy */
162 ring
->id
= ctx
->user_id
;
163 ring
->head
= ring
->tail
= 0;
164 ring
->magic
= AIO_RING_MAGIC
;
165 ring
->compat_features
= AIO_RING_COMPAT_FEATURES
;
166 ring
->incompat_features
= AIO_RING_INCOMPAT_FEATURES
;
167 ring
->header_length
= sizeof(struct aio_ring
);
168 kunmap_atomic(ring
, KM_USER0
);
174 /* aio_ring_event: returns a pointer to the event at the given index from
175 * kmap_atomic(, km). Release the pointer with put_aio_ring_event();
177 #define AIO_EVENTS_PER_PAGE (PAGE_SIZE / sizeof(struct io_event))
178 #define AIO_EVENTS_FIRST_PAGE ((PAGE_SIZE - sizeof(struct aio_ring)) / sizeof(struct io_event))
179 #define AIO_EVENTS_OFFSET (AIO_EVENTS_PER_PAGE - AIO_EVENTS_FIRST_PAGE)
181 #define aio_ring_event(info, nr, km) ({ \
182 unsigned pos = (nr) + AIO_EVENTS_OFFSET; \
183 struct io_event *__event; \
184 __event = kmap_atomic( \
185 (info)->ring_pages[pos / AIO_EVENTS_PER_PAGE], km); \
186 __event += pos % AIO_EVENTS_PER_PAGE; \
190 #define put_aio_ring_event(event, km) do { \
191 struct io_event *__event = (event); \
193 kunmap_atomic((void *)((unsigned long)__event & PAGE_MASK), km); \
197 * Allocates and initializes an ioctx. Returns an ERR_PTR if it failed.
199 static struct kioctx
*ioctx_alloc(unsigned nr_events
)
201 struct mm_struct
*mm
;
204 /* Prevent overflows */
205 if ((nr_events
> (0x10000000U
/ sizeof(struct io_event
))) ||
206 (nr_events
> (0x10000000U
/ sizeof(struct kiocb
)))) {
207 pr_debug("ENOMEM: nr_events too high\n");
208 return ERR_PTR(-EINVAL
);
211 if (nr_events
> aio_max_nr
)
212 return ERR_PTR(-EAGAIN
);
214 ctx
= kmem_cache_alloc(kioctx_cachep
, GFP_KERNEL
);
216 return ERR_PTR(-ENOMEM
);
218 memset(ctx
, 0, sizeof(*ctx
));
219 ctx
->max_reqs
= nr_events
;
220 mm
= ctx
->mm
= current
->mm
;
221 atomic_inc(&mm
->mm_count
);
223 atomic_set(&ctx
->users
, 1);
224 spin_lock_init(&ctx
->ctx_lock
);
225 spin_lock_init(&ctx
->ring_info
.ring_lock
);
226 init_waitqueue_head(&ctx
->wait
);
228 INIT_LIST_HEAD(&ctx
->active_reqs
);
229 INIT_LIST_HEAD(&ctx
->run_list
);
230 INIT_WORK(&ctx
->wq
, aio_kick_handler
, ctx
);
232 if (aio_setup_ring(ctx
) < 0)
235 /* limit the number of system wide aios */
236 atomic_add(ctx
->max_reqs
, &aio_nr
); /* undone by __put_ioctx */
237 if (unlikely(atomic_read(&aio_nr
) > aio_max_nr
))
240 /* now link into global list. kludge. FIXME */
241 write_lock(&mm
->ioctx_list_lock
);
242 ctx
->next
= mm
->ioctx_list
;
243 mm
->ioctx_list
= ctx
;
244 write_unlock(&mm
->ioctx_list_lock
);
246 dprintk("aio: allocated ioctx %p[%ld]: mm=%p mask=0x%x\n",
247 ctx
, ctx
->user_id
, current
->mm
, ctx
->ring_info
.nr
);
251 atomic_sub(ctx
->max_reqs
, &aio_nr
);
252 ctx
->max_reqs
= 0; /* prevent __put_ioctx from sub'ing aio_nr */
254 return ERR_PTR(-EAGAIN
);
258 kmem_cache_free(kioctx_cachep
, ctx
);
259 ctx
= ERR_PTR(-ENOMEM
);
261 dprintk("aio: error allocating ioctx %p\n", ctx
);
266 * Cancels all outstanding aio requests on an aio context. Used
267 * when the processes owning a context have all exited to encourage
268 * the rapid destruction of the kioctx.
270 static void aio_cancel_all(struct kioctx
*ctx
)
272 int (*cancel
)(struct kiocb
*, struct io_event
*);
274 spin_lock_irq(&ctx
->ctx_lock
);
276 while (!list_empty(&ctx
->active_reqs
)) {
277 struct list_head
*pos
= ctx
->active_reqs
.next
;
278 struct kiocb
*iocb
= list_kiocb(pos
);
279 list_del_init(&iocb
->ki_list
);
280 cancel
= iocb
->ki_cancel
;
281 kiocbSetCancelled(iocb
);
284 spin_unlock_irq(&ctx
->ctx_lock
);
286 spin_lock_irq(&ctx
->ctx_lock
);
289 spin_unlock_irq(&ctx
->ctx_lock
);
292 static void wait_for_all_aios(struct kioctx
*ctx
)
294 struct task_struct
*tsk
= current
;
295 DECLARE_WAITQUEUE(wait
, tsk
);
297 if (!ctx
->reqs_active
)
300 add_wait_queue(&ctx
->wait
, &wait
);
301 set_task_state(tsk
, TASK_UNINTERRUPTIBLE
);
302 while (ctx
->reqs_active
) {
304 set_task_state(tsk
, TASK_UNINTERRUPTIBLE
);
306 __set_task_state(tsk
, TASK_RUNNING
);
307 remove_wait_queue(&ctx
->wait
, &wait
);
310 /* wait_on_sync_kiocb:
311 * Waits on the given sync kiocb to complete.
313 ssize_t fastcall
wait_on_sync_kiocb(struct kiocb
*iocb
)
315 while (iocb
->ki_users
) {
316 set_current_state(TASK_UNINTERRUPTIBLE
);
321 __set_current_state(TASK_RUNNING
);
322 return iocb
->ki_user_data
;
325 /* exit_aio: called when the last user of mm goes away. At this point,
326 * there is no way for any new requests to be submited or any of the
327 * io_* syscalls to be called on the context. However, there may be
328 * outstanding requests which hold references to the context; as they
329 * go away, they will call put_ioctx and release any pinned memory
330 * associated with the request (held via struct page * references).
332 void fastcall
exit_aio(struct mm_struct
*mm
)
334 struct kioctx
*ctx
= mm
->ioctx_list
;
335 mm
->ioctx_list
= NULL
;
337 struct kioctx
*next
= ctx
->next
;
341 wait_for_all_aios(ctx
);
343 * this is an overkill, but ensures we don't leave
344 * the ctx on the aio_wq
346 flush_workqueue(aio_wq
);
348 if (1 != atomic_read(&ctx
->users
))
350 "exit_aio:ioctx still alive: %d %d %d\n",
351 atomic_read(&ctx
->users
), ctx
->dead
,
359 * Called when the last user of an aio context has gone away,
360 * and the struct needs to be freed.
362 void fastcall
__put_ioctx(struct kioctx
*ctx
)
364 unsigned nr_events
= ctx
->max_reqs
;
366 if (unlikely(ctx
->reqs_active
))
369 cancel_delayed_work(&ctx
->wq
);
370 flush_workqueue(aio_wq
);
374 pr_debug("__put_ioctx: freeing %p\n", ctx
);
375 kmem_cache_free(kioctx_cachep
, ctx
);
377 atomic_sub(nr_events
, &aio_nr
);
381 * Allocate a slot for an aio request. Increments the users count
382 * of the kioctx so that the kioctx stays around until all requests are
383 * complete. Returns NULL if no requests are free.
385 * Returns with kiocb->users set to 2. The io submit code path holds
386 * an extra reference while submitting the i/o.
387 * This prevents races between the aio code path referencing the
388 * req (after submitting it) and aio_complete() freeing the req.
390 static struct kiocb
*FASTCALL(__aio_get_req(struct kioctx
*ctx
));
391 static struct kiocb fastcall
*__aio_get_req(struct kioctx
*ctx
)
393 struct kiocb
*req
= NULL
;
394 struct aio_ring
*ring
;
397 req
= kmem_cache_alloc(kiocb_cachep
, GFP_KERNEL
);
401 req
->ki_flags
= 1 << KIF_LOCKED
;
405 req
->ki_cancel
= NULL
;
406 req
->ki_retry
= NULL
;
409 INIT_LIST_HEAD(&req
->ki_run_list
);
411 /* Check if the completion queue has enough free space to
412 * accept an event from this io.
414 spin_lock_irq(&ctx
->ctx_lock
);
415 ring
= kmap_atomic(ctx
->ring_info
.ring_pages
[0], KM_USER0
);
416 if (ctx
->reqs_active
< aio_ring_avail(&ctx
->ring_info
, ring
)) {
417 list_add(&req
->ki_list
, &ctx
->active_reqs
);
422 kunmap_atomic(ring
, KM_USER0
);
423 spin_unlock_irq(&ctx
->ctx_lock
);
426 kmem_cache_free(kiocb_cachep
, req
);
433 static inline struct kiocb
*aio_get_req(struct kioctx
*ctx
)
436 /* Handle a potential starvation case -- should be exceedingly rare as
437 * requests will be stuck on fput_head only if the aio_fput_routine is
438 * delayed and the requests were the last user of the struct file.
440 req
= __aio_get_req(ctx
);
441 if (unlikely(NULL
== req
)) {
442 aio_fput_routine(NULL
);
443 req
= __aio_get_req(ctx
);
448 static inline void really_put_req(struct kioctx
*ctx
, struct kiocb
*req
)
452 kmem_cache_free(kiocb_cachep
, req
);
455 if (unlikely(!ctx
->reqs_active
&& ctx
->dead
))
459 static void aio_fput_routine(void *data
)
461 spin_lock_irq(&fput_lock
);
462 while (likely(!list_empty(&fput_head
))) {
463 struct kiocb
*req
= list_kiocb(fput_head
.next
);
464 struct kioctx
*ctx
= req
->ki_ctx
;
466 list_del(&req
->ki_list
);
467 spin_unlock_irq(&fput_lock
);
469 /* Complete the fput */
470 __fput(req
->ki_filp
);
472 /* Link the iocb into the context's free list */
473 spin_lock_irq(&ctx
->ctx_lock
);
474 really_put_req(ctx
, req
);
475 spin_unlock_irq(&ctx
->ctx_lock
);
478 spin_lock_irq(&fput_lock
);
480 spin_unlock_irq(&fput_lock
);
484 * Returns true if this put was the last user of the request.
486 static int __aio_put_req(struct kioctx
*ctx
, struct kiocb
*req
)
488 dprintk(KERN_DEBUG
"aio_put(%p): f_count=%d\n",
489 req
, atomic_read(&req
->ki_filp
->f_count
));
492 if (unlikely(req
->ki_users
< 0))
494 if (likely(req
->ki_users
))
496 list_del(&req
->ki_list
); /* remove from active_reqs */
497 req
->ki_cancel
= NULL
;
498 req
->ki_retry
= NULL
;
500 /* Must be done under the lock to serialise against cancellation.
501 * Call this aio_fput as it duplicates fput via the fput_work.
503 if (unlikely(rcuref_dec_and_test(&req
->ki_filp
->f_count
))) {
505 spin_lock(&fput_lock
);
506 list_add(&req
->ki_list
, &fput_head
);
507 spin_unlock(&fput_lock
);
508 queue_work(aio_wq
, &fput_work
);
510 really_put_req(ctx
, req
);
515 * Returns true if this put was the last user of the kiocb,
516 * false if the request is still in use.
518 int fastcall
aio_put_req(struct kiocb
*req
)
520 struct kioctx
*ctx
= req
->ki_ctx
;
522 spin_lock_irq(&ctx
->ctx_lock
);
523 ret
= __aio_put_req(ctx
, req
);
524 spin_unlock_irq(&ctx
->ctx_lock
);
530 /* Lookup an ioctx id. ioctx_list is lockless for reads.
531 * FIXME: this is O(n) and is only suitable for development.
533 struct kioctx
*lookup_ioctx(unsigned long ctx_id
)
535 struct kioctx
*ioctx
;
536 struct mm_struct
*mm
;
539 read_lock(&mm
->ioctx_list_lock
);
540 for (ioctx
= mm
->ioctx_list
; ioctx
; ioctx
= ioctx
->next
)
541 if (likely(ioctx
->user_id
== ctx_id
&& !ioctx
->dead
)) {
545 read_unlock(&mm
->ioctx_list_lock
);
550 static int lock_kiocb_action(void *param
)
556 static inline void lock_kiocb(struct kiocb
*iocb
)
558 wait_on_bit_lock(&iocb
->ki_flags
, KIF_LOCKED
, lock_kiocb_action
,
559 TASK_UNINTERRUPTIBLE
);
562 static inline void unlock_kiocb(struct kiocb
*iocb
)
564 kiocbClearLocked(iocb
);
565 smp_mb__after_clear_bit();
566 wake_up_bit(&iocb
->ki_flags
, KIF_LOCKED
);
571 * Makes the calling kernel thread take on the specified
573 * Called by the retry thread execute retries within the
574 * iocb issuer's mm context, so that copy_from/to_user
575 * operations work seamlessly for aio.
576 * (Note: this routine is intended to be called only
577 * from a kernel thread context)
579 static void use_mm(struct mm_struct
*mm
)
581 struct mm_struct
*active_mm
;
582 struct task_struct
*tsk
= current
;
585 tsk
->flags
|= PF_BORROWED_MM
;
586 active_mm
= tsk
->active_mm
;
587 atomic_inc(&mm
->mm_count
);
591 * Note that on UML this *requires* PF_BORROWED_MM to be set, otherwise
592 * it won't work. Update it accordingly if you change it here
594 activate_mm(active_mm
, mm
);
602 * Reverses the effect of use_mm, i.e. releases the
603 * specified mm context which was earlier taken on
604 * by the calling kernel thread
605 * (Note: this routine is intended to be called only
606 * from a kernel thread context)
608 * Comments: Called with ctx->ctx_lock held. This nests
609 * task_lock instead ctx_lock.
611 static void unuse_mm(struct mm_struct
*mm
)
613 struct task_struct
*tsk
= current
;
616 tsk
->flags
&= ~PF_BORROWED_MM
;
618 /* active_mm is still 'mm' */
619 enter_lazy_tlb(mm
, tsk
);
624 * Queue up a kiocb to be retried. Assumes that the kiocb
625 * has already been marked as kicked, and places it on
626 * the retry run list for the corresponding ioctx, if it
627 * isn't already queued. Returns 1 if it actually queued
628 * the kiocb (to tell the caller to activate the work
629 * queue to process it), or 0, if it found that it was
632 * Should be called with the spin lock iocb->ki_ctx->ctx_lock
635 static inline int __queue_kicked_iocb(struct kiocb
*iocb
)
637 struct kioctx
*ctx
= iocb
->ki_ctx
;
639 if (list_empty(&iocb
->ki_run_list
)) {
640 list_add_tail(&iocb
->ki_run_list
,
648 * This is the core aio execution routine. It is
649 * invoked both for initial i/o submission and
650 * subsequent retries via the aio_kick_handler.
651 * Expects to be invoked with iocb->ki_ctx->lock
652 * already held. The lock is released and reaquired
653 * as needed during processing.
655 * Calls the iocb retry method (already setup for the
656 * iocb on initial submission) for operation specific
657 * handling, but takes care of most of common retry
658 * execution details for a given iocb. The retry method
659 * needs to be non-blocking as far as possible, to avoid
660 * holding up other iocbs waiting to be serviced by the
661 * retry kernel thread.
663 * The trickier parts in this code have to do with
664 * ensuring that only one retry instance is in progress
665 * for a given iocb at any time. Providing that guarantee
666 * simplifies the coding of individual aio operations as
667 * it avoids various potential races.
669 static ssize_t
aio_run_iocb(struct kiocb
*iocb
)
671 struct kioctx
*ctx
= iocb
->ki_ctx
;
672 ssize_t (*retry
)(struct kiocb
*);
675 if (iocb
->ki_retried
++ > 1024*1024) {
676 printk("Maximal retry count. Bytes done %Zd\n",
677 iocb
->ki_nbytes
- iocb
->ki_left
);
681 if (!(iocb
->ki_retried
& 0xff)) {
682 pr_debug("%ld retry: %d of %d\n", iocb
->ki_retried
,
683 iocb
->ki_nbytes
- iocb
->ki_left
, iocb
->ki_nbytes
);
686 if (!(retry
= iocb
->ki_retry
)) {
687 printk("aio_run_iocb: iocb->ki_retry = NULL\n");
692 * We don't want the next retry iteration for this
693 * operation to start until this one has returned and
694 * updated the iocb state. However, wait_queue functions
695 * can trigger a kick_iocb from interrupt context in the
696 * meantime, indicating that data is available for the next
697 * iteration. We want to remember that and enable the
698 * next retry iteration _after_ we are through with
701 * So, in order to be able to register a "kick", but
702 * prevent it from being queued now, we clear the kick
703 * flag, but make the kick code *think* that the iocb is
704 * still on the run list until we are actually done.
705 * When we are done with this iteration, we check if
706 * the iocb was kicked in the meantime and if so, queue
710 kiocbClearKicked(iocb
);
713 * This is so that aio_complete knows it doesn't need to
714 * pull the iocb off the run list (We can't just call
715 * INIT_LIST_HEAD because we don't want a kick_iocb to
716 * queue this on the run list yet)
718 iocb
->ki_run_list
.next
= iocb
->ki_run_list
.prev
= NULL
;
719 spin_unlock_irq(&ctx
->ctx_lock
);
721 /* Quit retrying if the i/o has been cancelled */
722 if (kiocbIsCancelled(iocb
)) {
724 aio_complete(iocb
, ret
, 0);
725 /* must not access the iocb after this */
730 * Now we are all set to call the retry method in async
731 * context. By setting this thread's io_wait context
732 * to point to the wait queue entry inside the currently
733 * running iocb for the duration of the retry, we ensure
734 * that async notification wakeups are queued by the
735 * operation instead of blocking waits, and when notified,
736 * cause the iocb to be kicked for continuation (through
737 * the aio_wake_function callback).
739 BUG_ON(current
->io_wait
!= NULL
);
740 current
->io_wait
= &iocb
->ki_wait
;
742 current
->io_wait
= NULL
;
744 if (ret
!= -EIOCBRETRY
&& ret
!= -EIOCBQUEUED
) {
745 BUG_ON(!list_empty(&iocb
->ki_wait
.task_list
));
746 aio_complete(iocb
, ret
, 0);
749 spin_lock_irq(&ctx
->ctx_lock
);
751 if (-EIOCBRETRY
== ret
) {
753 * OK, now that we are done with this iteration
754 * and know that there is more left to go,
755 * this is where we let go so that a subsequent
756 * "kick" can start the next iteration
759 /* will make __queue_kicked_iocb succeed from here on */
760 INIT_LIST_HEAD(&iocb
->ki_run_list
);
761 /* we must queue the next iteration ourselves, if it
762 * has already been kicked */
763 if (kiocbIsKicked(iocb
)) {
764 __queue_kicked_iocb(iocb
);
767 * __queue_kicked_iocb will always return 1 here, because
768 * iocb->ki_run_list is empty at this point so it should
769 * be safe to unconditionally queue the context into the
780 * Process all pending retries queued on the ioctx
782 * Assumes it is operating within the aio issuer's mm
783 * context. Expects to be called with ctx->ctx_lock held
785 static int __aio_run_iocbs(struct kioctx
*ctx
)
790 list_splice_init(&ctx
->run_list
, &run_list
);
791 while (!list_empty(&run_list
)) {
792 iocb
= list_entry(run_list
.next
, struct kiocb
,
794 list_del(&iocb
->ki_run_list
);
796 * Hold an extra reference while retrying i/o.
798 iocb
->ki_users
++; /* grab extra reference */
802 if (__aio_put_req(ctx
, iocb
)) /* drop extra ref */
805 if (!list_empty(&ctx
->run_list
))
810 static void aio_queue_work(struct kioctx
* ctx
)
812 unsigned long timeout
;
814 * if someone is waiting, get the work started right
815 * away, otherwise, use a longer delay
818 if (waitqueue_active(&ctx
->wait
))
822 queue_delayed_work(aio_wq
, &ctx
->wq
, timeout
);
828 * Process all pending retries queued on the ioctx
830 * Assumes it is operating within the aio issuer's mm
833 static inline void aio_run_iocbs(struct kioctx
*ctx
)
837 spin_lock_irq(&ctx
->ctx_lock
);
839 requeue
= __aio_run_iocbs(ctx
);
840 spin_unlock_irq(&ctx
->ctx_lock
);
846 * just like aio_run_iocbs, but keeps running them until
847 * the list stays empty
849 static inline void aio_run_all_iocbs(struct kioctx
*ctx
)
851 spin_lock_irq(&ctx
->ctx_lock
);
852 while (__aio_run_iocbs(ctx
))
854 spin_unlock_irq(&ctx
->ctx_lock
);
859 * Work queue handler triggered to process pending
860 * retries on an ioctx. Takes on the aio issuer's
861 * mm context before running the iocbs, so that
862 * copy_xxx_user operates on the issuer's address
864 * Run on aiod's context.
866 static void aio_kick_handler(void *data
)
868 struct kioctx
*ctx
= data
;
869 mm_segment_t oldfs
= get_fs();
874 spin_lock_irq(&ctx
->ctx_lock
);
875 requeue
=__aio_run_iocbs(ctx
);
877 spin_unlock_irq(&ctx
->ctx_lock
);
880 * we're in a worker thread already, don't use queue_delayed_work,
883 queue_work(aio_wq
, &ctx
->wq
);
888 * Called by kick_iocb to queue the kiocb for retry
889 * and if required activate the aio work queue to process
892 static void try_queue_kicked_iocb(struct kiocb
*iocb
)
894 struct kioctx
*ctx
= iocb
->ki_ctx
;
898 /* We're supposed to be the only path putting the iocb back on the run
899 * list. If we find that the iocb is *back* on a wait queue already
900 * than retry has happened before we could queue the iocb. This also
901 * means that the retry could have completed and freed our iocb, no
903 BUG_ON((!list_empty(&iocb
->ki_wait
.task_list
)));
905 spin_lock_irqsave(&ctx
->ctx_lock
, flags
);
906 /* set this inside the lock so that we can't race with aio_run_iocb()
907 * testing it and putting the iocb on the run list under the lock */
908 if (!kiocbTryKick(iocb
))
909 run
= __queue_kicked_iocb(iocb
);
910 spin_unlock_irqrestore(&ctx
->ctx_lock
, flags
);
917 * Called typically from a wait queue callback context
918 * (aio_wake_function) to trigger a retry of the iocb.
919 * The retry is usually executed by aio workqueue
920 * threads (See aio_kick_handler).
922 void fastcall
kick_iocb(struct kiocb
*iocb
)
924 /* sync iocbs are easy: they can only ever be executing from a
926 if (is_sync_kiocb(iocb
)) {
927 kiocbSetKicked(iocb
);
928 wake_up_process(iocb
->ki_obj
.tsk
);
932 try_queue_kicked_iocb(iocb
);
934 EXPORT_SYMBOL(kick_iocb
);
937 * Called when the io request on the given iocb is complete.
938 * Returns true if this is the last user of the request. The
939 * only other user of the request can be the cancellation code.
941 int fastcall
aio_complete(struct kiocb
*iocb
, long res
, long res2
)
943 struct kioctx
*ctx
= iocb
->ki_ctx
;
944 struct aio_ring_info
*info
;
945 struct aio_ring
*ring
;
946 struct io_event
*event
;
951 /* Special case handling for sync iocbs: events go directly
952 * into the iocb for fast handling. Note that this will not
953 * work if we allow sync kiocbs to be cancelled. in which
954 * case the usage count checks will have to move under ctx_lock
957 if (is_sync_kiocb(iocb
)) {
960 iocb
->ki_user_data
= res
;
961 if (iocb
->ki_users
== 1) {
965 spin_lock_irq(&ctx
->ctx_lock
);
967 ret
= (0 == iocb
->ki_users
);
968 spin_unlock_irq(&ctx
->ctx_lock
);
970 /* sync iocbs put the task here for us */
971 wake_up_process(iocb
->ki_obj
.tsk
);
975 info
= &ctx
->ring_info
;
977 /* add a completion event to the ring buffer.
978 * must be done holding ctx->ctx_lock to prevent
979 * other code from messing with the tail
980 * pointer since we might be called from irq
983 spin_lock_irqsave(&ctx
->ctx_lock
, flags
);
985 if (iocb
->ki_run_list
.prev
&& !list_empty(&iocb
->ki_run_list
))
986 list_del_init(&iocb
->ki_run_list
);
989 * cancelled requests don't get events, userland was given one
990 * when the event got cancelled.
992 if (kiocbIsCancelled(iocb
))
995 ring
= kmap_atomic(info
->ring_pages
[0], KM_IRQ1
);
998 event
= aio_ring_event(info
, tail
, KM_IRQ0
);
999 if (++tail
>= info
->nr
)
1002 event
->obj
= (u64
)(unsigned long)iocb
->ki_obj
.user
;
1003 event
->data
= iocb
->ki_user_data
;
1007 dprintk("aio_complete: %p[%lu]: %p: %p %Lx %lx %lx\n",
1008 ctx
, tail
, iocb
, iocb
->ki_obj
.user
, iocb
->ki_user_data
,
1011 /* after flagging the request as done, we
1012 * must never even look at it again
1014 smp_wmb(); /* make event visible before updating tail */
1019 put_aio_ring_event(event
, KM_IRQ0
);
1020 kunmap_atomic(ring
, KM_IRQ1
);
1022 pr_debug("added to ring %p at [%lu]\n", iocb
, tail
);
1024 pr_debug("%ld retries: %d of %d\n", iocb
->ki_retried
,
1025 iocb
->ki_nbytes
- iocb
->ki_left
, iocb
->ki_nbytes
);
1027 /* everything turned out well, dispose of the aiocb. */
1028 ret
= __aio_put_req(ctx
, iocb
);
1030 spin_unlock_irqrestore(&ctx
->ctx_lock
, flags
);
1032 if (waitqueue_active(&ctx
->wait
))
1033 wake_up(&ctx
->wait
);
1042 * Pull an event off of the ioctx's event ring. Returns the number of
1043 * events fetched (0 or 1 ;-)
1044 * FIXME: make this use cmpxchg.
1045 * TODO: make the ringbuffer user mmap()able (requires FIXME).
1047 static int aio_read_evt(struct kioctx
*ioctx
, struct io_event
*ent
)
1049 struct aio_ring_info
*info
= &ioctx
->ring_info
;
1050 struct aio_ring
*ring
;
1054 ring
= kmap_atomic(info
->ring_pages
[0], KM_USER0
);
1055 dprintk("in aio_read_evt h%lu t%lu m%lu\n",
1056 (unsigned long)ring
->head
, (unsigned long)ring
->tail
,
1057 (unsigned long)ring
->nr
);
1059 if (ring
->head
== ring
->tail
)
1062 spin_lock(&info
->ring_lock
);
1064 head
= ring
->head
% info
->nr
;
1065 if (head
!= ring
->tail
) {
1066 struct io_event
*evp
= aio_ring_event(info
, head
, KM_USER1
);
1068 head
= (head
+ 1) % info
->nr
;
1069 smp_mb(); /* finish reading the event before updatng the head */
1072 put_aio_ring_event(evp
, KM_USER1
);
1074 spin_unlock(&info
->ring_lock
);
1077 kunmap_atomic(ring
, KM_USER0
);
1078 dprintk("leaving aio_read_evt: %d h%lu t%lu\n", ret
,
1079 (unsigned long)ring
->head
, (unsigned long)ring
->tail
);
1083 struct aio_timeout
{
1084 struct timer_list timer
;
1086 struct task_struct
*p
;
1089 static void timeout_func(unsigned long data
)
1091 struct aio_timeout
*to
= (struct aio_timeout
*)data
;
1094 wake_up_process(to
->p
);
1097 static inline void init_timeout(struct aio_timeout
*to
)
1099 init_timer(&to
->timer
);
1100 to
->timer
.data
= (unsigned long)to
;
1101 to
->timer
.function
= timeout_func
;
1106 static inline void set_timeout(long start_jiffies
, struct aio_timeout
*to
,
1107 const struct timespec
*ts
)
1109 to
->timer
.expires
= start_jiffies
+ timespec_to_jiffies(ts
);
1110 if (time_after(to
->timer
.expires
, jiffies
))
1111 add_timer(&to
->timer
);
1116 static inline void clear_timeout(struct aio_timeout
*to
)
1118 del_singleshot_timer_sync(&to
->timer
);
1121 static int read_events(struct kioctx
*ctx
,
1122 long min_nr
, long nr
,
1123 struct io_event __user
*event
,
1124 struct timespec __user
*timeout
)
1126 long start_jiffies
= jiffies
;
1127 struct task_struct
*tsk
= current
;
1128 DECLARE_WAITQUEUE(wait
, tsk
);
1131 struct io_event ent
;
1132 struct aio_timeout to
;
1135 /* needed to zero any padding within an entry (there shouldn't be
1136 * any, but C is fun!
1138 memset(&ent
, 0, sizeof(ent
));
1141 while (likely(i
< nr
)) {
1142 ret
= aio_read_evt(ctx
, &ent
);
1143 if (unlikely(ret
<= 0))
1146 dprintk("read event: %Lx %Lx %Lx %Lx\n",
1147 ent
.data
, ent
.obj
, ent
.res
, ent
.res2
);
1149 /* Could we split the check in two? */
1151 if (unlikely(copy_to_user(event
, &ent
, sizeof(ent
)))) {
1152 dprintk("aio: lost an event due to EFAULT.\n");
1157 /* Good, event copied to userland, update counts. */
1169 /* racey check, but it gets redone */
1170 if (!retry
&& unlikely(!list_empty(&ctx
->run_list
))) {
1172 aio_run_all_iocbs(ctx
);
1180 if (unlikely(copy_from_user(&ts
, timeout
, sizeof(ts
))))
1183 set_timeout(start_jiffies
, &to
, &ts
);
1186 while (likely(i
< nr
)) {
1187 add_wait_queue_exclusive(&ctx
->wait
, &wait
);
1189 set_task_state(tsk
, TASK_INTERRUPTIBLE
);
1190 ret
= aio_read_evt(ctx
, &ent
);
1196 if (to
.timed_out
) /* Only check after read evt */
1199 if (signal_pending(tsk
)) {
1203 /*ret = aio_read_evt(ctx, &ent);*/
1206 set_task_state(tsk
, TASK_RUNNING
);
1207 remove_wait_queue(&ctx
->wait
, &wait
);
1209 if (unlikely(ret
<= 0))
1213 if (unlikely(copy_to_user(event
, &ent
, sizeof(ent
)))) {
1214 dprintk("aio: lost an event due to EFAULT.\n");
1218 /* Good, event copied to userland, update counts. */
1229 /* Take an ioctx and remove it from the list of ioctx's. Protects
1230 * against races with itself via ->dead.
1232 static void io_destroy(struct kioctx
*ioctx
)
1234 struct mm_struct
*mm
= current
->mm
;
1235 struct kioctx
**tmp
;
1238 /* delete the entry from the list is someone else hasn't already */
1239 write_lock(&mm
->ioctx_list_lock
);
1240 was_dead
= ioctx
->dead
;
1242 for (tmp
= &mm
->ioctx_list
; *tmp
&& *tmp
!= ioctx
;
1243 tmp
= &(*tmp
)->next
)
1247 write_unlock(&mm
->ioctx_list_lock
);
1249 dprintk("aio_release(%p)\n", ioctx
);
1250 if (likely(!was_dead
))
1251 put_ioctx(ioctx
); /* twice for the list */
1253 aio_cancel_all(ioctx
);
1254 wait_for_all_aios(ioctx
);
1255 put_ioctx(ioctx
); /* once for the lookup */
1259 * Create an aio_context capable of receiving at least nr_events.
1260 * ctxp must not point to an aio_context that already exists, and
1261 * must be initialized to 0 prior to the call. On successful
1262 * creation of the aio_context, *ctxp is filled in with the resulting
1263 * handle. May fail with -EINVAL if *ctxp is not initialized,
1264 * if the specified nr_events exceeds internal limits. May fail
1265 * with -EAGAIN if the specified nr_events exceeds the user's limit
1266 * of available events. May fail with -ENOMEM if insufficient kernel
1267 * resources are available. May fail with -EFAULT if an invalid
1268 * pointer is passed for ctxp. Will fail with -ENOSYS if not
1271 asmlinkage
long sys_io_setup(unsigned nr_events
, aio_context_t __user
*ctxp
)
1273 struct kioctx
*ioctx
= NULL
;
1277 ret
= get_user(ctx
, ctxp
);
1282 if (unlikely(ctx
|| (int)nr_events
<= 0)) {
1283 pr_debug("EINVAL: io_setup: ctx or nr_events > max\n");
1287 ioctx
= ioctx_alloc(nr_events
);
1288 ret
= PTR_ERR(ioctx
);
1289 if (!IS_ERR(ioctx
)) {
1290 ret
= put_user(ioctx
->user_id
, ctxp
);
1294 get_ioctx(ioctx
); /* io_destroy() expects us to hold a ref */
1303 * Destroy the aio_context specified. May cancel any outstanding
1304 * AIOs and block on completion. Will fail with -ENOSYS if not
1305 * implemented. May fail with -EFAULT if the context pointed to
1308 asmlinkage
long sys_io_destroy(aio_context_t ctx
)
1310 struct kioctx
*ioctx
= lookup_ioctx(ctx
);
1311 if (likely(NULL
!= ioctx
)) {
1315 pr_debug("EINVAL: io_destroy: invalid context id\n");
1320 * aio_p{read,write} are the default ki_retry methods for
1321 * IO_CMD_P{READ,WRITE}. They maintains kiocb retry state around potentially
1322 * multiple calls to f_op->aio_read(). They loop around partial progress
1323 * instead of returning -EIOCBRETRY because they don't have the means to call
1326 static ssize_t
aio_pread(struct kiocb
*iocb
)
1328 struct file
*file
= iocb
->ki_filp
;
1329 struct address_space
*mapping
= file
->f_mapping
;
1330 struct inode
*inode
= mapping
->host
;
1334 ret
= file
->f_op
->aio_read(iocb
, iocb
->ki_buf
,
1335 iocb
->ki_left
, iocb
->ki_pos
);
1337 * Can't just depend on iocb->ki_left to determine
1338 * whether we are done. This may have been a short read.
1341 iocb
->ki_buf
+= ret
;
1342 iocb
->ki_left
-= ret
;
1346 * For pipes and sockets we return once we have some data; for
1347 * regular files we retry till we complete the entire read or
1348 * find that we can't read any more data (e.g short reads).
1350 } while (ret
> 0 && iocb
->ki_left
> 0 &&
1351 !S_ISFIFO(inode
->i_mode
) && !S_ISSOCK(inode
->i_mode
));
1353 /* This means we must have transferred all that we could */
1354 /* No need to retry anymore */
1355 if ((ret
== 0) || (iocb
->ki_left
== 0))
1356 ret
= iocb
->ki_nbytes
- iocb
->ki_left
;
1361 /* see aio_pread() */
1362 static ssize_t
aio_pwrite(struct kiocb
*iocb
)
1364 struct file
*file
= iocb
->ki_filp
;
1368 ret
= file
->f_op
->aio_write(iocb
, iocb
->ki_buf
,
1369 iocb
->ki_left
, iocb
->ki_pos
);
1371 iocb
->ki_buf
+= ret
;
1372 iocb
->ki_left
-= ret
;
1374 } while (ret
> 0 && iocb
->ki_left
> 0);
1376 if ((ret
== 0) || (iocb
->ki_left
== 0))
1377 ret
= iocb
->ki_nbytes
- iocb
->ki_left
;
1382 static ssize_t
aio_fdsync(struct kiocb
*iocb
)
1384 struct file
*file
= iocb
->ki_filp
;
1385 ssize_t ret
= -EINVAL
;
1387 if (file
->f_op
->aio_fsync
)
1388 ret
= file
->f_op
->aio_fsync(iocb
, 1);
1392 static ssize_t
aio_fsync(struct kiocb
*iocb
)
1394 struct file
*file
= iocb
->ki_filp
;
1395 ssize_t ret
= -EINVAL
;
1397 if (file
->f_op
->aio_fsync
)
1398 ret
= file
->f_op
->aio_fsync(iocb
, 0);
1404 * Performs the initial checks and aio retry method
1405 * setup for the kiocb at the time of io submission.
1407 static ssize_t
aio_setup_iocb(struct kiocb
*kiocb
)
1409 struct file
*file
= kiocb
->ki_filp
;
1412 switch (kiocb
->ki_opcode
) {
1413 case IOCB_CMD_PREAD
:
1415 if (unlikely(!(file
->f_mode
& FMODE_READ
)))
1418 if (unlikely(!access_ok(VERIFY_WRITE
, kiocb
->ki_buf
,
1422 if (file
->f_op
->aio_read
)
1423 kiocb
->ki_retry
= aio_pread
;
1425 case IOCB_CMD_PWRITE
:
1427 if (unlikely(!(file
->f_mode
& FMODE_WRITE
)))
1430 if (unlikely(!access_ok(VERIFY_READ
, kiocb
->ki_buf
,
1434 if (file
->f_op
->aio_write
)
1435 kiocb
->ki_retry
= aio_pwrite
;
1437 case IOCB_CMD_FDSYNC
:
1439 if (file
->f_op
->aio_fsync
)
1440 kiocb
->ki_retry
= aio_fdsync
;
1442 case IOCB_CMD_FSYNC
:
1444 if (file
->f_op
->aio_fsync
)
1445 kiocb
->ki_retry
= aio_fsync
;
1448 dprintk("EINVAL: io_submit: no operation provided\n");
1452 if (!kiocb
->ki_retry
)
1459 * aio_wake_function:
1460 * wait queue callback function for aio notification,
1461 * Simply triggers a retry of the operation via kick_iocb.
1463 * This callback is specified in the wait queue entry in
1464 * a kiocb (current->io_wait points to this wait queue
1465 * entry when an aio operation executes; it is used
1466 * instead of a synchronous wait when an i/o blocking
1467 * condition is encountered during aio).
1470 * This routine is executed with the wait queue lock held.
1471 * Since kick_iocb acquires iocb->ctx->ctx_lock, it nests
1472 * the ioctx lock inside the wait queue lock. This is safe
1473 * because this callback isn't used for wait queues which
1474 * are nested inside ioctx lock (i.e. ctx->wait)
1476 static int aio_wake_function(wait_queue_t
*wait
, unsigned mode
,
1477 int sync
, void *key
)
1479 struct kiocb
*iocb
= container_of(wait
, struct kiocb
, ki_wait
);
1481 list_del_init(&wait
->task_list
);
1486 int fastcall
io_submit_one(struct kioctx
*ctx
, struct iocb __user
*user_iocb
,
1493 /* enforce forwards compatibility on users */
1494 if (unlikely(iocb
->aio_reserved1
|| iocb
->aio_reserved2
||
1495 iocb
->aio_reserved3
)) {
1496 pr_debug("EINVAL: io_submit: reserve field set\n");
1500 /* prevent overflows */
1502 (iocb
->aio_buf
!= (unsigned long)iocb
->aio_buf
) ||
1503 (iocb
->aio_nbytes
!= (size_t)iocb
->aio_nbytes
) ||
1504 ((ssize_t
)iocb
->aio_nbytes
< 0)
1506 pr_debug("EINVAL: io_submit: overflow check\n");
1510 file
= fget(iocb
->aio_fildes
);
1511 if (unlikely(!file
))
1514 req
= aio_get_req(ctx
); /* returns with 2 references to req */
1515 if (unlikely(!req
)) {
1520 req
->ki_filp
= file
;
1521 ret
= put_user(req
->ki_key
, &user_iocb
->aio_key
);
1522 if (unlikely(ret
)) {
1523 dprintk("EFAULT: aio_key\n");
1527 req
->ki_obj
.user
= user_iocb
;
1528 req
->ki_user_data
= iocb
->aio_data
;
1529 req
->ki_pos
= iocb
->aio_offset
;
1531 req
->ki_buf
= (char __user
*)(unsigned long)iocb
->aio_buf
;
1532 req
->ki_left
= req
->ki_nbytes
= iocb
->aio_nbytes
;
1533 req
->ki_opcode
= iocb
->aio_lio_opcode
;
1534 init_waitqueue_func_entry(&req
->ki_wait
, aio_wake_function
);
1535 INIT_LIST_HEAD(&req
->ki_wait
.task_list
);
1536 req
->ki_retried
= 0;
1538 ret
= aio_setup_iocb(req
);
1543 spin_lock_irq(&ctx
->ctx_lock
);
1546 if (!list_empty(&ctx
->run_list
)) {
1547 /* drain the run list */
1548 while (__aio_run_iocbs(ctx
))
1551 spin_unlock_irq(&ctx
->ctx_lock
);
1552 aio_put_req(req
); /* drop extra ref to req */
1556 aio_put_req(req
); /* drop extra ref to req */
1557 aio_put_req(req
); /* drop i/o ref to req */
1562 * Queue the nr iocbs pointed to by iocbpp for processing. Returns
1563 * the number of iocbs queued. May return -EINVAL if the aio_context
1564 * specified by ctx_id is invalid, if nr is < 0, if the iocb at
1565 * *iocbpp[0] is not properly initialized, if the operation specified
1566 * is invalid for the file descriptor in the iocb. May fail with
1567 * -EFAULT if any of the data structures point to invalid data. May
1568 * fail with -EBADF if the file descriptor specified in the first
1569 * iocb is invalid. May fail with -EAGAIN if insufficient resources
1570 * are available to queue any iocbs. Will return 0 if nr is 0. Will
1571 * fail with -ENOSYS if not implemented.
1573 asmlinkage
long sys_io_submit(aio_context_t ctx_id
, long nr
,
1574 struct iocb __user
* __user
*iocbpp
)
1580 if (unlikely(nr
< 0))
1583 if (unlikely(!access_ok(VERIFY_READ
, iocbpp
, (nr
*sizeof(*iocbpp
)))))
1586 ctx
= lookup_ioctx(ctx_id
);
1587 if (unlikely(!ctx
)) {
1588 pr_debug("EINVAL: io_submit: invalid context id\n");
1593 * AKPM: should this return a partial result if some of the IOs were
1594 * successfully submitted?
1596 for (i
=0; i
<nr
; i
++) {
1597 struct iocb __user
*user_iocb
;
1600 if (unlikely(__get_user(user_iocb
, iocbpp
+ i
))) {
1605 if (unlikely(copy_from_user(&tmp
, user_iocb
, sizeof(tmp
)))) {
1610 ret
= io_submit_one(ctx
, user_iocb
, &tmp
);
1620 * Finds a given iocb for cancellation.
1621 * MUST be called with ctx->ctx_lock held.
1623 static struct kiocb
*lookup_kiocb(struct kioctx
*ctx
, struct iocb __user
*iocb
,
1626 struct list_head
*pos
;
1627 /* TODO: use a hash or array, this sucks. */
1628 list_for_each(pos
, &ctx
->active_reqs
) {
1629 struct kiocb
*kiocb
= list_kiocb(pos
);
1630 if (kiocb
->ki_obj
.user
== iocb
&& kiocb
->ki_key
== key
)
1637 * Attempts to cancel an iocb previously passed to io_submit. If
1638 * the operation is successfully cancelled, the resulting event is
1639 * copied into the memory pointed to by result without being placed
1640 * into the completion queue and 0 is returned. May fail with
1641 * -EFAULT if any of the data structures pointed to are invalid.
1642 * May fail with -EINVAL if aio_context specified by ctx_id is
1643 * invalid. May fail with -EAGAIN if the iocb specified was not
1644 * cancelled. Will fail with -ENOSYS if not implemented.
1646 asmlinkage
long sys_io_cancel(aio_context_t ctx_id
, struct iocb __user
*iocb
,
1647 struct io_event __user
*result
)
1649 int (*cancel
)(struct kiocb
*iocb
, struct io_event
*res
);
1651 struct kiocb
*kiocb
;
1655 ret
= get_user(key
, &iocb
->aio_key
);
1659 ctx
= lookup_ioctx(ctx_id
);
1663 spin_lock_irq(&ctx
->ctx_lock
);
1665 kiocb
= lookup_kiocb(ctx
, iocb
, key
);
1666 if (kiocb
&& kiocb
->ki_cancel
) {
1667 cancel
= kiocb
->ki_cancel
;
1669 kiocbSetCancelled(kiocb
);
1672 spin_unlock_irq(&ctx
->ctx_lock
);
1674 if (NULL
!= cancel
) {
1675 struct io_event tmp
;
1676 pr_debug("calling cancel\n");
1678 memset(&tmp
, 0, sizeof(tmp
));
1679 tmp
.obj
= (u64
)(unsigned long)kiocb
->ki_obj
.user
;
1680 tmp
.data
= kiocb
->ki_user_data
;
1681 ret
= cancel(kiocb
, &tmp
);
1683 /* Cancellation succeeded -- copy the result
1684 * into the user's buffer.
1686 if (copy_to_user(result
, &tmp
, sizeof(tmp
)))
1689 unlock_kiocb(kiocb
);
1699 * Attempts to read at least min_nr events and up to nr events from
1700 * the completion queue for the aio_context specified by ctx_id. May
1701 * fail with -EINVAL if ctx_id is invalid, if min_nr is out of range,
1702 * if nr is out of range, if when is out of range. May fail with
1703 * -EFAULT if any of the memory specified to is invalid. May return
1704 * 0 or < min_nr if no events are available and the timeout specified
1705 * by when has elapsed, where when == NULL specifies an infinite
1706 * timeout. Note that the timeout pointed to by when is relative and
1707 * will be updated if not NULL and the operation blocks. Will fail
1708 * with -ENOSYS if not implemented.
1710 asmlinkage
long sys_io_getevents(aio_context_t ctx_id
,
1713 struct io_event __user
*events
,
1714 struct timespec __user
*timeout
)
1716 struct kioctx
*ioctx
= lookup_ioctx(ctx_id
);
1719 if (likely(ioctx
)) {
1720 if (likely(min_nr
<= nr
&& min_nr
>= 0 && nr
>= 0))
1721 ret
= read_events(ioctx
, min_nr
, nr
, events
, timeout
);
1728 __initcall(aio_setup
);
1730 EXPORT_SYMBOL(aio_complete
);
1731 EXPORT_SYMBOL(aio_put_req
);
1732 EXPORT_SYMBOL(wait_on_sync_kiocb
);