linux-aio.c 8.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
/*
 * 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"
11
#include "block/aio.h"
12
#include "qemu/queue.h"
13
#include "block/raw-aio.h"
14
#include "qemu/event_notifier.h"
15 16 17 18 19 20 21 22 23 24 25 26 27

#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

28 29
#define MAX_QUEUED_IO  128

30
struct qemu_laiocb {
31
    BlockAIOCB common;
32 33 34 35
    struct qemu_laio_state *ctx;
    struct iocb iocb;
    ssize_t ret;
    size_t nbytes;
36 37
    QEMUIOVector *qiov;
    bool is_read;
38
    QSIMPLEQ_ENTRY(qemu_laiocb) next;
39 40
};

41 42 43
typedef struct {
    int plugged;
    unsigned int idx;
44
    QSIMPLEQ_HEAD(, qemu_laiocb) pending;
45 46
} LaioQueue;

47 48
struct qemu_laio_state {
    io_context_t ctx;
P
Paolo Bonzini 已提交
49
    EventNotifier e;
50 51 52

    /* io queue for submit at batch */
    LaioQueue io_q;
53 54 55 56 57 58

    /* I/O completion processing */
    QEMUBH *completion_bh;
    struct io_event events[MAX_EVENTS];
    int event_idx;
    int event_max;
59 60
};

61 62
static int ioq_submit(struct qemu_laio_state *s);

63 64 65 66 67
static inline ssize_t io_event_ret(struct io_event *ev)
{
    return (ssize_t)(((uint64_t)ev->res2 << 32) | ev->res);
}

K
Kevin Wolf 已提交
68 69 70 71 72 73 74 75 76 77
/*
 * 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) {
78
        if (ret == laiocb->nbytes) {
K
Kevin Wolf 已提交
79
            ret = 0;
80 81 82
        } else if (ret >= 0) {
            /* Short reads mean EOF, pad with zeros. */
            if (laiocb->is_read) {
83 84
                qemu_iovec_memset(laiocb->qiov, ret, 0,
                    laiocb->qiov->size - ret);
85 86 87 88
            } else {
                ret = -EINVAL;
            }
        }
K
Kevin Wolf 已提交
89
    }
90
    laiocb->common.cb(laiocb->common.opaque, ret);
K
Kevin Wolf 已提交
91

92
    qemu_aio_unref(laiocb);
K
Kevin Wolf 已提交
93 94
}

95 96 97 98 99 100 101 102 103 104 105 106
/* 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)
107
{
108
    struct qemu_laio_state *s = opaque;
109

110 111
    /* Fetch more completion events when empty */
    if (s->event_idx == s->event_max) {
112
        do {
113 114 115 116 117 118 119 120 121 122 123
            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 */
        }
    }
124

125 126
    /* Reschedule so nested event loops see currently pending completions */
    qemu_bh_schedule(s->completion_bh);
127

128 129 130 131 132 133 134 135 136 137 138
    /* 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);
    }
139 140 141 142

    if (!s->io_q.plugged && !QSIMPLEQ_EMPTY(&s->io_q.pending)) {
        ioq_submit(s);
    }
143 144 145 146 147 148 149 150
}

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);
151 152 153
    }
}

154
static void laio_cancel(BlockAIOCB *blockacb)
155 156 157 158 159
{
    struct qemu_laiocb *laiocb = (struct qemu_laiocb *)blockacb;
    struct io_event event;
    int ret;

160
    if (laiocb->ret != -EINPROGRESS) {
161
        return;
162
    }
163
    ret = io_cancel(laiocb->ctx->ctx, &laiocb->iocb, &event);
164 165 166
    laiocb->ret = -ECANCELED;
    if (ret != 0) {
        /* iocb is not cancelled, cb will be called by the event loop later */
167 168 169
        return;
    }

170
    laiocb->common.cb(laiocb->common.opaque, laiocb->ret);
171 172
}

S
Stefan Hajnoczi 已提交
173
static const AIOCBInfo laio_aiocb_info = {
174
    .aiocb_size         = sizeof(struct qemu_laiocb),
175
    .cancel_async       = laio_cancel,
176 177
};

178 179
static void ioq_init(LaioQueue *io_q)
{
180
    QSIMPLEQ_INIT(&io_q->pending);
181
    io_q->plugged = 0;
182
    io_q->idx = 0;
183 184 185 186
}

static int ioq_submit(struct qemu_laio_state *s)
{
187 188 189 190
    int ret, i;
    int len = 0;
    struct qemu_laiocb *aiocb;
    struct iocb *iocbs[MAX_QUEUED_IO];
191

192 193 194 195 196 197
    QSIMPLEQ_FOREACH(aiocb, &s->io_q.pending, next) {
        iocbs[len++] = &aiocb->iocb;
        if (len == MAX_QUEUED_IO) {
            break;
        }
    }
198

199 200 201 202
    ret = io_submit(s->ctx, len, iocbs);
    if (ret == -EAGAIN) {
        ret = 0;
    }
203
    if (ret < 0) {
204
        abort();
205 206
    }

207 208 209
    for (i = 0; i < ret; i++) {
        s->io_q.idx--;
        QSIMPLEQ_REMOVE_HEAD(&s->io_q.pending, next);
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231
    }
    return ret;
}

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;
    }

232
    if (!QSIMPLEQ_EMPTY(&s->io_q.pending)) {
233 234 235 236 237 238
        ret = ioq_submit(s);
    }

    return ret;
}

239
BlockAIOCB *laio_submit(BlockDriverState *bs, void *aio_ctx, int fd,
240
        int64_t sector_num, QEMUIOVector *qiov, int nb_sectors,
241
        BlockCompletionFunc *cb, void *opaque, int type)
242 243 244 245 246 247
{
    struct qemu_laio_state *s = aio_ctx;
    struct qemu_laiocb *laiocb;
    struct iocb *iocbs;
    off_t offset = sector_num * 512;

S
Stefan Hajnoczi 已提交
248
    laiocb = qemu_aio_get(&laio_aiocb_info, bs, cb, opaque);
249 250 251
    laiocb->nbytes = nb_sectors * 512;
    laiocb->ctx = s;
    laiocb->ret = -EINPROGRESS;
252 253
    laiocb->is_read = (type == QEMU_AIO_READ);
    laiocb->qiov = qiov;
254 255 256 257 258 259 260 261 262 263

    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;
F
Frediano Ziglio 已提交
264
    /* Currently Linux kernel does not support other operations */
265 266 267 268 269
    default:
        fprintf(stderr, "%s: invalid AIO request type 0x%x.\n",
                        __func__, type);
        goto out_free_aiocb;
    }
P
Paolo Bonzini 已提交
270
    io_set_eventfd(&laiocb->iocb, event_notifier_get_fd(&s->e));
271

272 273 274 275
    QSIMPLEQ_INSERT_TAIL(&s->io_q.pending, laiocb, next);
    s->io_q.idx++;
    if (s->io_q.idx == (s->io_q.plugged ? MAX_QUEUED_IO : 1)) {
        ioq_submit(s);
276
    }
277 278
    return &laiocb->common;

279
out_free_aiocb:
280
    qemu_aio_unref(laiocb);
281 282 283
    return NULL;
}

284 285 286 287 288
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);
289
    qemu_bh_delete(s->completion_bh);
290 291 292 293 294 295
}

void laio_attach_aio_context(void *s_, AioContext *new_context)
{
    struct qemu_laio_state *s = s_;

296
    s->completion_bh = aio_bh_new(new_context, qemu_laio_completion_bh, s);
297 298 299
    aio_set_event_notifier(new_context, &s->e, qemu_laio_completion_cb);
}

300 301 302 303
void *laio_init(void)
{
    struct qemu_laio_state *s;

304
    s = g_malloc0(sizeof(*s));
P
Paolo Bonzini 已提交
305
    if (event_notifier_init(&s->e, false) < 0) {
306
        goto out_free_state;
P
Paolo Bonzini 已提交
307
    }
308

P
Paolo Bonzini 已提交
309
    if (io_setup(MAX_EVENTS, &s->ctx) != 0) {
310
        goto out_close_efd;
P
Paolo Bonzini 已提交
311
    }
312

313 314
    ioq_init(&s->io_q);

315 316 317
    return s;

out_close_efd:
P
Paolo Bonzini 已提交
318
    event_notifier_cleanup(&s->e);
319
out_free_state:
320
    g_free(s);
321 322
    return NULL;
}
323 324 325 326 327 328

void laio_cleanup(void *s_)
{
    struct qemu_laio_state *s = s_;

    event_notifier_cleanup(&s->e);
G
Gonglei 已提交
329 330 331 332 333

    if (io_destroy(s->ctx) != 0) {
        fprintf(stderr, "%s: destroy AIO context %p failed\n",
                        __func__, &s->ctx);
    }
334 335
    g_free(s);
}