2009-08-20 16:58:35 +02:00
|
|
|
/*
|
|
|
|
* Linux native AIO support.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2009 IBM, Corp.
|
|
|
|
* Copyright (C) 2009 Red Hat, Inc.
|
|
|
|
*
|
|
|
|
* This work is licensed under the terms of the GNU GPL, version 2 or later.
|
|
|
|
* See the COPYING file in the top-level directory.
|
|
|
|
*/
|
|
|
|
#include "qemu-common.h"
|
2012-12-17 18:19:44 +01:00
|
|
|
#include "block/aio.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/queue.h"
|
2012-06-09 10:57:37 +02:00
|
|
|
#include "block/raw-aio.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/event_notifier.h"
|
2009-08-20 16:58:35 +02:00
|
|
|
|
|
|
|
#include <libaio.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Queue size (per-device).
|
|
|
|
*
|
|
|
|
* XXX: eventually we need to communicate this to the guest and/or make it
|
|
|
|
* tunable by the guest. If we get more outstanding requests at a time
|
|
|
|
* than this we will get EAGAIN from io_submit which is communicated to
|
|
|
|
* the guest as an I/O error.
|
|
|
|
*/
|
|
|
|
#define MAX_EVENTS 128
|
|
|
|
|
2014-07-04 12:04:34 +02:00
|
|
|
#define MAX_QUEUED_IO 128
|
|
|
|
|
2009-08-20 16:58:35 +02:00
|
|
|
struct qemu_laiocb {
|
2014-10-07 13:59:14 +02:00
|
|
|
BlockAIOCB common;
|
2009-08-20 16:58:35 +02:00
|
|
|
struct qemu_laio_state *ctx;
|
|
|
|
struct iocb iocb;
|
|
|
|
ssize_t ret;
|
|
|
|
size_t nbytes;
|
2011-10-13 15:42:52 +02:00
|
|
|
QEMUIOVector *qiov;
|
|
|
|
bool is_read;
|
2009-10-22 17:54:41 +02:00
|
|
|
QLIST_ENTRY(qemu_laiocb) node;
|
2009-08-20 16:58:35 +02:00
|
|
|
};
|
|
|
|
|
2014-07-04 12:04:34 +02:00
|
|
|
typedef struct {
|
|
|
|
struct iocb *iocbs[MAX_QUEUED_IO];
|
|
|
|
int plugged;
|
|
|
|
unsigned int size;
|
|
|
|
unsigned int idx;
|
|
|
|
} LaioQueue;
|
|
|
|
|
2009-08-20 16:58:35 +02:00
|
|
|
struct qemu_laio_state {
|
|
|
|
io_context_t ctx;
|
2012-02-24 08:39:02 +01:00
|
|
|
EventNotifier e;
|
2014-07-04 12:04:34 +02:00
|
|
|
|
|
|
|
/* io queue for submit at batch */
|
|
|
|
LaioQueue io_q;
|
2014-08-04 17:56:33 +02:00
|
|
|
|
|
|
|
/* I/O completion processing */
|
|
|
|
QEMUBH *completion_bh;
|
|
|
|
struct io_event events[MAX_EVENTS];
|
|
|
|
int event_idx;
|
|
|
|
int event_max;
|
2009-08-20 16:58:35 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
static inline ssize_t io_event_ret(struct io_event *ev)
|
|
|
|
{
|
|
|
|
return (ssize_t)(((uint64_t)ev->res2 << 32) | ev->res);
|
|
|
|
}
|
|
|
|
|
2009-10-22 17:54:41 +02:00
|
|
|
/*
|
|
|
|
* Completes an AIO request (calls the callback and frees the ACB).
|
|
|
|
*/
|
|
|
|
static void qemu_laio_process_completion(struct qemu_laio_state *s,
|
|
|
|
struct qemu_laiocb *laiocb)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = laiocb->ret;
|
|
|
|
if (ret != -ECANCELED) {
|
2011-10-13 15:42:52 +02:00
|
|
|
if (ret == laiocb->nbytes) {
|
2009-10-22 17:54:41 +02:00
|
|
|
ret = 0;
|
2011-10-13 15:42:52 +02:00
|
|
|
} else if (ret >= 0) {
|
|
|
|
/* Short reads mean EOF, pad with zeros. */
|
|
|
|
if (laiocb->is_read) {
|
consolidate qemu_iovec_memset{,_skip}() into single function and use existing iov_memset()
This patch combines two functions into one, and replaces
the implementation with already existing iov_memset() from
iov.c.
The new prototype of qemu_iovec_memset():
size_t qemu_iovec_memset(qiov, size_t offset, int fillc, size_t bytes)
It is different from former qemu_iovec_memset_skip(), and
I want to make other functions to be consistent with it
too: first how much to skip, second what, and 3rd how many
of it. It also returns actual number of bytes filled in,
which may be less than the requested `bytes' if qiov is
smaller than offset+bytes, in the same way iov_memset()
does.
While at it, use utility function iov_memset() from
iov.h in posix-aio-compat.c, where qiov was used.
Signed-off-by: Michael Tokarev <mjt@tls.msk.ru>
2012-03-10 13:54:23 +01:00
|
|
|
qemu_iovec_memset(laiocb->qiov, ret, 0,
|
|
|
|
laiocb->qiov->size - ret);
|
2011-10-13 15:42:52 +02:00
|
|
|
} else {
|
|
|
|
ret = -EINVAL;
|
|
|
|
}
|
|
|
|
}
|
2009-10-22 17:54:41 +02:00
|
|
|
}
|
2014-09-11 07:41:13 +02:00
|
|
|
laiocb->common.cb(laiocb->common.opaque, ret);
|
2009-10-22 17:54:41 +02:00
|
|
|
|
2014-09-11 07:41:28 +02:00
|
|
|
qemu_aio_unref(laiocb);
|
2009-10-22 17:54:41 +02:00
|
|
|
}
|
|
|
|
|
2014-08-04 17:56:33 +02:00
|
|
|
/* The completion BH fetches completed I/O requests and invokes their
|
|
|
|
* callbacks.
|
|
|
|
*
|
|
|
|
* The function is somewhat tricky because it supports nested event loops, for
|
|
|
|
* example when a request callback invokes aio_poll(). In order to do this,
|
|
|
|
* the completion events array and index are kept in qemu_laio_state. The BH
|
|
|
|
* reschedules itself as long as there are completions pending so it will
|
|
|
|
* either be called again in a nested event loop or will be called after all
|
|
|
|
* events have been completed. When there are no events left to complete, the
|
|
|
|
* BH returns without rescheduling.
|
|
|
|
*/
|
|
|
|
static void qemu_laio_completion_bh(void *opaque)
|
2009-08-20 16:58:35 +02:00
|
|
|
{
|
2014-08-04 17:56:33 +02:00
|
|
|
struct qemu_laio_state *s = opaque;
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2014-08-04 17:56:33 +02:00
|
|
|
/* Fetch more completion events when empty */
|
|
|
|
if (s->event_idx == s->event_max) {
|
2009-08-20 16:58:35 +02:00
|
|
|
do {
|
2014-08-04 17:56:33 +02:00
|
|
|
struct timespec ts = { 0 };
|
|
|
|
s->event_max = io_getevents(s->ctx, MAX_EVENTS, MAX_EVENTS,
|
|
|
|
s->events, &ts);
|
|
|
|
} while (s->event_max == -EINTR);
|
|
|
|
|
|
|
|
s->event_idx = 0;
|
|
|
|
if (s->event_max <= 0) {
|
|
|
|
s->event_max = 0;
|
|
|
|
return; /* no more events */
|
|
|
|
}
|
|
|
|
}
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2014-08-04 17:56:33 +02:00
|
|
|
/* Reschedule so nested event loops see currently pending completions */
|
|
|
|
qemu_bh_schedule(s->completion_bh);
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2014-08-04 17:56:33 +02:00
|
|
|
/* Process completion events */
|
|
|
|
while (s->event_idx < s->event_max) {
|
|
|
|
struct iocb *iocb = s->events[s->event_idx].obj;
|
|
|
|
struct qemu_laiocb *laiocb =
|
|
|
|
container_of(iocb, struct qemu_laiocb, iocb);
|
|
|
|
|
|
|
|
laiocb->ret = io_event_ret(&s->events[s->event_idx]);
|
|
|
|
s->event_idx++;
|
|
|
|
|
|
|
|
qemu_laio_process_completion(s, laiocb);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qemu_laio_completion_cb(EventNotifier *e)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = container_of(e, struct qemu_laio_state, e);
|
|
|
|
|
|
|
|
if (event_notifier_test_and_clear(&s->e)) {
|
|
|
|
qemu_bh_schedule(s->completion_bh);
|
2009-08-20 16:58:35 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-10-07 13:59:14 +02:00
|
|
|
static void laio_cancel(BlockAIOCB *blockacb)
|
2009-08-20 16:58:35 +02:00
|
|
|
{
|
|
|
|
struct qemu_laiocb *laiocb = (struct qemu_laiocb *)blockacb;
|
|
|
|
struct io_event event;
|
|
|
|
int ret;
|
|
|
|
|
2014-09-11 07:41:13 +02:00
|
|
|
if (laiocb->ret != -EINPROGRESS) {
|
2009-08-20 16:58:35 +02:00
|
|
|
return;
|
2014-09-11 07:41:13 +02:00
|
|
|
}
|
2009-08-20 16:58:35 +02:00
|
|
|
ret = io_cancel(laiocb->ctx->ctx, &laiocb->iocb, &event);
|
2014-09-11 07:41:13 +02:00
|
|
|
laiocb->ret = -ECANCELED;
|
|
|
|
if (ret != 0) {
|
|
|
|
/* iocb is not cancelled, cb will be called by the event loop later */
|
2009-08-20 16:58:35 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-09-11 07:41:13 +02:00
|
|
|
laiocb->common.cb(laiocb->common.opaque, laiocb->ret);
|
2009-08-20 16:58:35 +02:00
|
|
|
}
|
|
|
|
|
2012-10-31 16:34:37 +01:00
|
|
|
static const AIOCBInfo laio_aiocb_info = {
|
2009-08-20 16:58:35 +02:00
|
|
|
.aiocb_size = sizeof(struct qemu_laiocb),
|
2014-09-11 07:41:13 +02:00
|
|
|
.cancel_async = laio_cancel,
|
2009-08-20 16:58:35 +02:00
|
|
|
};
|
|
|
|
|
2014-07-04 12:04:34 +02:00
|
|
|
static void ioq_init(LaioQueue *io_q)
|
|
|
|
{
|
|
|
|
io_q->size = MAX_QUEUED_IO;
|
|
|
|
io_q->idx = 0;
|
|
|
|
io_q->plugged = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ioq_submit(struct qemu_laio_state *s)
|
|
|
|
{
|
|
|
|
int ret, i = 0;
|
|
|
|
int len = s->io_q.idx;
|
|
|
|
|
|
|
|
do {
|
|
|
|
ret = io_submit(s->ctx, len, s->io_q.iocbs);
|
|
|
|
} while (i++ < 3 && ret == -EAGAIN);
|
|
|
|
|
|
|
|
/* empty io queue */
|
|
|
|
s->io_q.idx = 0;
|
|
|
|
|
|
|
|
if (ret < 0) {
|
|
|
|
i = 0;
|
|
|
|
} else {
|
|
|
|
i = ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; i < len; i++) {
|
|
|
|
struct qemu_laiocb *laiocb =
|
|
|
|
container_of(s->io_q.iocbs[i], struct qemu_laiocb, iocb);
|
|
|
|
|
|
|
|
laiocb->ret = (ret < 0) ? ret : -EIO;
|
|
|
|
qemu_laio_process_completion(s, laiocb);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ioq_enqueue(struct qemu_laio_state *s, struct iocb *iocb)
|
|
|
|
{
|
|
|
|
unsigned int idx = s->io_q.idx;
|
|
|
|
|
|
|
|
s->io_q.iocbs[idx++] = iocb;
|
|
|
|
s->io_q.idx = idx;
|
|
|
|
|
|
|
|
/* submit immediately if queue is full */
|
|
|
|
if (idx == s->io_q.size) {
|
|
|
|
ioq_submit(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void laio_io_plug(BlockDriverState *bs, void *aio_ctx)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = aio_ctx;
|
|
|
|
|
|
|
|
s->io_q.plugged++;
|
|
|
|
}
|
|
|
|
|
|
|
|
int laio_io_unplug(BlockDriverState *bs, void *aio_ctx, bool unplug)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = aio_ctx;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
assert(s->io_q.plugged > 0 || !unplug);
|
|
|
|
|
|
|
|
if (unplug && --s->io_q.plugged > 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (s->io_q.idx > 0) {
|
|
|
|
ret = ioq_submit(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-10-07 13:59:14 +02:00
|
|
|
BlockAIOCB *laio_submit(BlockDriverState *bs, void *aio_ctx, int fd,
|
2009-08-20 16:58:35 +02:00
|
|
|
int64_t sector_num, QEMUIOVector *qiov, int nb_sectors,
|
2014-10-07 13:59:15 +02:00
|
|
|
BlockCompletionFunc *cb, void *opaque, int type)
|
2009-08-20 16:58:35 +02:00
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = aio_ctx;
|
|
|
|
struct qemu_laiocb *laiocb;
|
|
|
|
struct iocb *iocbs;
|
|
|
|
off_t offset = sector_num * 512;
|
|
|
|
|
2012-10-31 16:34:37 +01:00
|
|
|
laiocb = qemu_aio_get(&laio_aiocb_info, bs, cb, opaque);
|
2009-08-20 16:58:35 +02:00
|
|
|
laiocb->nbytes = nb_sectors * 512;
|
|
|
|
laiocb->ctx = s;
|
|
|
|
laiocb->ret = -EINPROGRESS;
|
2011-10-13 15:42:52 +02:00
|
|
|
laiocb->is_read = (type == QEMU_AIO_READ);
|
|
|
|
laiocb->qiov = qiov;
|
2009-08-20 16:58:35 +02:00
|
|
|
|
|
|
|
iocbs = &laiocb->iocb;
|
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case QEMU_AIO_WRITE:
|
|
|
|
io_prep_pwritev(iocbs, fd, qiov->iov, qiov->niov, offset);
|
|
|
|
break;
|
|
|
|
case QEMU_AIO_READ:
|
|
|
|
io_prep_preadv(iocbs, fd, qiov->iov, qiov->niov, offset);
|
|
|
|
break;
|
2011-08-30 09:46:11 +02:00
|
|
|
/* Currently Linux kernel does not support other operations */
|
2009-08-20 16:58:35 +02:00
|
|
|
default:
|
|
|
|
fprintf(stderr, "%s: invalid AIO request type 0x%x.\n",
|
|
|
|
__func__, type);
|
|
|
|
goto out_free_aiocb;
|
|
|
|
}
|
2012-02-24 08:39:02 +01:00
|
|
|
io_set_eventfd(&laiocb->iocb, event_notifier_get_fd(&s->e));
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2014-07-04 12:04:34 +02:00
|
|
|
if (!s->io_q.plugged) {
|
|
|
|
if (io_submit(s->ctx, 1, &iocbs) < 0) {
|
|
|
|
goto out_free_aiocb;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
ioq_enqueue(s, iocbs);
|
|
|
|
}
|
2009-08-20 16:58:35 +02:00
|
|
|
return &laiocb->common;
|
|
|
|
|
2011-09-22 14:21:30 +02:00
|
|
|
out_free_aiocb:
|
2014-09-11 07:41:28 +02:00
|
|
|
qemu_aio_unref(laiocb);
|
2009-08-20 16:58:35 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-05-08 16:34:47 +02:00
|
|
|
void laio_detach_aio_context(void *s_, AioContext *old_context)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = s_;
|
|
|
|
|
|
|
|
aio_set_event_notifier(old_context, &s->e, NULL);
|
2014-08-04 17:56:33 +02:00
|
|
|
qemu_bh_delete(s->completion_bh);
|
2014-05-08 16:34:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void laio_attach_aio_context(void *s_, AioContext *new_context)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = s_;
|
|
|
|
|
2014-08-04 17:56:33 +02:00
|
|
|
s->completion_bh = aio_bh_new(new_context, qemu_laio_completion_bh, s);
|
2014-05-08 16:34:47 +02:00
|
|
|
aio_set_event_notifier(new_context, &s->e, qemu_laio_completion_cb);
|
|
|
|
}
|
|
|
|
|
2009-08-20 16:58:35 +02:00
|
|
|
void *laio_init(void)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s;
|
|
|
|
|
2011-08-21 05:09:37 +02:00
|
|
|
s = g_malloc0(sizeof(*s));
|
2012-02-24 08:39:02 +01:00
|
|
|
if (event_notifier_init(&s->e, false) < 0) {
|
2009-08-20 16:58:35 +02:00
|
|
|
goto out_free_state;
|
2012-02-24 08:39:02 +01:00
|
|
|
}
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2012-02-24 08:39:02 +01:00
|
|
|
if (io_setup(MAX_EVENTS, &s->ctx) != 0) {
|
2009-08-20 16:58:35 +02:00
|
|
|
goto out_close_efd;
|
2012-02-24 08:39:02 +01:00
|
|
|
}
|
2009-08-20 16:58:35 +02:00
|
|
|
|
2014-07-04 12:04:34 +02:00
|
|
|
ioq_init(&s->io_q);
|
|
|
|
|
2009-08-20 16:58:35 +02:00
|
|
|
return s;
|
|
|
|
|
|
|
|
out_close_efd:
|
2012-02-24 08:39:02 +01:00
|
|
|
event_notifier_cleanup(&s->e);
|
2009-08-20 16:58:35 +02:00
|
|
|
out_free_state:
|
2011-08-21 05:09:37 +02:00
|
|
|
g_free(s);
|
2009-08-20 16:58:35 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
2014-05-08 16:34:48 +02:00
|
|
|
|
|
|
|
void laio_cleanup(void *s_)
|
|
|
|
{
|
|
|
|
struct qemu_laio_state *s = s_;
|
|
|
|
|
|
|
|
event_notifier_cleanup(&s->e);
|
2014-07-12 05:43:37 +02:00
|
|
|
|
|
|
|
if (io_destroy(s->ctx) != 0) {
|
|
|
|
fprintf(stderr, "%s: destroy AIO context %p failed\n",
|
|
|
|
__func__, &s->ctx);
|
|
|
|
}
|
2014-05-08 16:34:48 +02:00
|
|
|
g_free(s);
|
|
|
|
}
|