1 /* 2 * Linux native AIO support. 3 * 4 * Copyright (C) 2009 IBM, Corp. 5 * Copyright (C) 2009 Red Hat, Inc. 6 * 7 * This work is licensed under the terms of the GNU GPL, version 2 or later. 8 * See the COPYING file in the top-level directory. 9 */ 10 #include "qemu/osdep.h" 11 #include "qemu-common.h" 12 #include "block/aio.h" 13 #include "qemu/queue.h" 14 #include "block/block.h" 15 #include "block/raw-aio.h" 16 #include "qemu/event_notifier.h" 17 #include "qemu/coroutine.h" 18 #include "qapi/error.h" 19 20 #include <libaio.h> 21 22 /* 23 * Queue size (per-device). 24 * 25 * XXX: eventually we need to communicate this to the guest and/or make it 26 * tunable by the guest. If we get more outstanding requests at a time 27 * than this we will get EAGAIN from io_submit which is communicated to 28 * the guest as an I/O error. 29 */ 30 #define MAX_EVENTS 128 31 32 struct qemu_laiocb { 33 Coroutine *co; 34 LinuxAioState *ctx; 35 struct iocb iocb; 36 ssize_t ret; 37 size_t nbytes; 38 QEMUIOVector *qiov; 39 bool is_read; 40 QSIMPLEQ_ENTRY(qemu_laiocb) next; 41 }; 42 43 typedef struct { 44 int plugged; 45 unsigned int in_queue; 46 unsigned int in_flight; 47 bool blocked; 48 QSIMPLEQ_HEAD(, qemu_laiocb) pending; 49 } LaioQueue; 50 51 struct LinuxAioState { 52 AioContext *aio_context; 53 54 io_context_t ctx; 55 EventNotifier e; 56 57 /* io queue for submit at batch. Protected by AioContext lock. */ 58 LaioQueue io_q; 59 60 /* I/O completion processing. Only runs in I/O thread. */ 61 QEMUBH *completion_bh; 62 int event_idx; 63 int event_max; 64 }; 65 66 static void ioq_submit(LinuxAioState *s); 67 68 static inline ssize_t io_event_ret(struct io_event *ev) 69 { 70 return (ssize_t)(((uint64_t)ev->res2 << 32) | ev->res); 71 } 72 73 /* 74 * Completes an AIO request. 75 */ 76 static void qemu_laio_process_completion(struct qemu_laiocb *laiocb) 77 { 78 int ret; 79 80 ret = laiocb->ret; 81 if (ret != -ECANCELED) { 82 if (ret == laiocb->nbytes) { 83 ret = 0; 84 } else if (ret >= 0) { 85 /* Short reads mean EOF, pad with zeros. */ 86 if (laiocb->is_read) { 87 qemu_iovec_memset(laiocb->qiov, ret, 0, 88 laiocb->qiov->size - ret); 89 } else { 90 ret = -ENOSPC; 91 } 92 } 93 } 94 95 laiocb->ret = ret; 96 97 /* 98 * If the coroutine is already entered it must be in ioq_submit() and 99 * will notice laio->ret has been filled in when it eventually runs 100 * later. Coroutines cannot be entered recursively so avoid doing 101 * that! 102 */ 103 if (!qemu_coroutine_entered(laiocb->co)) { 104 aio_co_wake(laiocb->co); 105 } 106 } 107 108 /** 109 * aio_ring buffer which is shared between userspace and kernel. 110 * 111 * This copied from linux/fs/aio.c, common header does not exist 112 * but AIO exists for ages so we assume ABI is stable. 113 */ 114 struct aio_ring { 115 unsigned id; /* kernel internal index number */ 116 unsigned nr; /* number of io_events */ 117 unsigned head; /* Written to by userland or by kernel. */ 118 unsigned tail; 119 120 unsigned magic; 121 unsigned compat_features; 122 unsigned incompat_features; 123 unsigned header_length; /* size of aio_ring */ 124 125 struct io_event io_events[0]; 126 }; 127 128 /** 129 * io_getevents_peek: 130 * @ctx: AIO context 131 * @events: pointer on events array, output value 132 133 * Returns the number of completed events and sets a pointer 134 * on events array. This function does not update the internal 135 * ring buffer, only reads head and tail. When @events has been 136 * processed io_getevents_commit() must be called. 137 */ 138 static inline unsigned int io_getevents_peek(io_context_t ctx, 139 struct io_event **events) 140 { 141 struct aio_ring *ring = (struct aio_ring *)ctx; 142 unsigned int head = ring->head, tail = ring->tail; 143 unsigned int nr; 144 145 nr = tail >= head ? tail - head : ring->nr - head; 146 *events = ring->io_events + head; 147 /* To avoid speculative loads of s->events[i] before observing tail. 148 Paired with smp_wmb() inside linux/fs/aio.c: aio_complete(). */ 149 smp_rmb(); 150 151 return nr; 152 } 153 154 /** 155 * io_getevents_commit: 156 * @ctx: AIO context 157 * @nr: the number of events on which head should be advanced 158 * 159 * Advances head of a ring buffer. 160 */ 161 static inline void io_getevents_commit(io_context_t ctx, unsigned int nr) 162 { 163 struct aio_ring *ring = (struct aio_ring *)ctx; 164 165 if (nr) { 166 ring->head = (ring->head + nr) % ring->nr; 167 } 168 } 169 170 /** 171 * io_getevents_advance_and_peek: 172 * @ctx: AIO context 173 * @events: pointer on events array, output value 174 * @nr: the number of events on which head should be advanced 175 * 176 * Advances head of a ring buffer and returns number of elements left. 177 */ 178 static inline unsigned int 179 io_getevents_advance_and_peek(io_context_t ctx, 180 struct io_event **events, 181 unsigned int nr) 182 { 183 io_getevents_commit(ctx, nr); 184 return io_getevents_peek(ctx, events); 185 } 186 187 /** 188 * qemu_laio_process_completions: 189 * @s: AIO state 190 * 191 * Fetches completed I/O requests and invokes their callbacks. 192 * 193 * The function is somewhat tricky because it supports nested event loops, for 194 * example when a request callback invokes aio_poll(). In order to do this, 195 * indices are kept in LinuxAioState. Function schedules BH completion so it 196 * can be called again in a nested event loop. When there are no events left 197 * to complete the BH is being canceled. 198 */ 199 static void qemu_laio_process_completions(LinuxAioState *s) 200 { 201 struct io_event *events; 202 203 /* Reschedule so nested event loops see currently pending completions */ 204 qemu_bh_schedule(s->completion_bh); 205 206 while ((s->event_max = io_getevents_advance_and_peek(s->ctx, &events, 207 s->event_idx))) { 208 for (s->event_idx = 0; s->event_idx < s->event_max; ) { 209 struct iocb *iocb = events[s->event_idx].obj; 210 struct qemu_laiocb *laiocb = 211 container_of(iocb, struct qemu_laiocb, iocb); 212 213 laiocb->ret = io_event_ret(&events[s->event_idx]); 214 215 /* Change counters one-by-one because we can be nested. */ 216 s->io_q.in_flight--; 217 s->event_idx++; 218 qemu_laio_process_completion(laiocb); 219 } 220 } 221 222 qemu_bh_cancel(s->completion_bh); 223 224 /* If we are nested we have to notify the level above that we are done 225 * by setting event_max to zero, upper level will then jump out of it's 226 * own `for` loop. If we are the last all counters droped to zero. */ 227 s->event_max = 0; 228 s->event_idx = 0; 229 } 230 231 static void qemu_laio_process_completions_and_submit(LinuxAioState *s) 232 { 233 aio_context_acquire(s->aio_context); 234 qemu_laio_process_completions(s); 235 236 if (!s->io_q.plugged && !QSIMPLEQ_EMPTY(&s->io_q.pending)) { 237 ioq_submit(s); 238 } 239 aio_context_release(s->aio_context); 240 } 241 242 static void qemu_laio_completion_bh(void *opaque) 243 { 244 LinuxAioState *s = opaque; 245 246 qemu_laio_process_completions_and_submit(s); 247 } 248 249 static void qemu_laio_completion_cb(EventNotifier *e) 250 { 251 LinuxAioState *s = container_of(e, LinuxAioState, e); 252 253 if (event_notifier_test_and_clear(&s->e)) { 254 qemu_laio_process_completions_and_submit(s); 255 } 256 } 257 258 static bool qemu_laio_poll_cb(void *opaque) 259 { 260 EventNotifier *e = opaque; 261 LinuxAioState *s = container_of(e, LinuxAioState, e); 262 struct io_event *events; 263 264 if (!io_getevents_peek(s->ctx, &events)) { 265 return false; 266 } 267 268 qemu_laio_process_completions_and_submit(s); 269 return true; 270 } 271 272 static void ioq_init(LaioQueue *io_q) 273 { 274 QSIMPLEQ_INIT(&io_q->pending); 275 io_q->plugged = 0; 276 io_q->in_queue = 0; 277 io_q->in_flight = 0; 278 io_q->blocked = false; 279 } 280 281 static void ioq_submit(LinuxAioState *s) 282 { 283 int ret, len; 284 struct qemu_laiocb *aiocb; 285 struct iocb *iocbs[MAX_EVENTS]; 286 QSIMPLEQ_HEAD(, qemu_laiocb) completed; 287 288 do { 289 if (s->io_q.in_flight >= MAX_EVENTS) { 290 break; 291 } 292 len = 0; 293 QSIMPLEQ_FOREACH(aiocb, &s->io_q.pending, next) { 294 iocbs[len++] = &aiocb->iocb; 295 if (s->io_q.in_flight + len >= MAX_EVENTS) { 296 break; 297 } 298 } 299 300 ret = io_submit(s->ctx, len, iocbs); 301 if (ret == -EAGAIN) { 302 break; 303 } 304 if (ret < 0) { 305 /* Fail the first request, retry the rest */ 306 aiocb = QSIMPLEQ_FIRST(&s->io_q.pending); 307 QSIMPLEQ_REMOVE_HEAD(&s->io_q.pending, next); 308 s->io_q.in_queue--; 309 aiocb->ret = ret; 310 qemu_laio_process_completion(aiocb); 311 continue; 312 } 313 314 s->io_q.in_flight += ret; 315 s->io_q.in_queue -= ret; 316 aiocb = container_of(iocbs[ret - 1], struct qemu_laiocb, iocb); 317 QSIMPLEQ_SPLIT_AFTER(&s->io_q.pending, aiocb, next, &completed); 318 } while (ret == len && !QSIMPLEQ_EMPTY(&s->io_q.pending)); 319 s->io_q.blocked = (s->io_q.in_queue > 0); 320 321 if (s->io_q.in_flight) { 322 /* We can try to complete something just right away if there are 323 * still requests in-flight. */ 324 qemu_laio_process_completions(s); 325 /* 326 * Even we have completed everything (in_flight == 0), the queue can 327 * have still pended requests (in_queue > 0). We do not attempt to 328 * repeat submission to avoid IO hang. The reason is simple: s->e is 329 * still set and completion callback will be called shortly and all 330 * pended requests will be submitted from there. 331 */ 332 } 333 } 334 335 void laio_io_plug(BlockDriverState *bs, LinuxAioState *s) 336 { 337 s->io_q.plugged++; 338 } 339 340 void laio_io_unplug(BlockDriverState *bs, LinuxAioState *s) 341 { 342 assert(s->io_q.plugged); 343 if (--s->io_q.plugged == 0 && 344 !s->io_q.blocked && !QSIMPLEQ_EMPTY(&s->io_q.pending)) { 345 ioq_submit(s); 346 } 347 } 348 349 static int laio_do_submit(int fd, struct qemu_laiocb *laiocb, off_t offset, 350 int type) 351 { 352 LinuxAioState *s = laiocb->ctx; 353 struct iocb *iocbs = &laiocb->iocb; 354 QEMUIOVector *qiov = laiocb->qiov; 355 356 switch (type) { 357 case QEMU_AIO_WRITE: 358 io_prep_pwritev(iocbs, fd, qiov->iov, qiov->niov, offset); 359 break; 360 case QEMU_AIO_READ: 361 io_prep_preadv(iocbs, fd, qiov->iov, qiov->niov, offset); 362 break; 363 /* Currently Linux kernel does not support other operations */ 364 default: 365 fprintf(stderr, "%s: invalid AIO request type 0x%x.\n", 366 __func__, type); 367 return -EIO; 368 } 369 io_set_eventfd(&laiocb->iocb, event_notifier_get_fd(&s->e)); 370 371 QSIMPLEQ_INSERT_TAIL(&s->io_q.pending, laiocb, next); 372 s->io_q.in_queue++; 373 if (!s->io_q.blocked && 374 (!s->io_q.plugged || 375 s->io_q.in_flight + s->io_q.in_queue >= MAX_EVENTS)) { 376 ioq_submit(s); 377 } 378 379 return 0; 380 } 381 382 int coroutine_fn laio_co_submit(BlockDriverState *bs, LinuxAioState *s, int fd, 383 uint64_t offset, QEMUIOVector *qiov, int type) 384 { 385 int ret; 386 struct qemu_laiocb laiocb = { 387 .co = qemu_coroutine_self(), 388 .nbytes = qiov->size, 389 .ctx = s, 390 .ret = -EINPROGRESS, 391 .is_read = (type == QEMU_AIO_READ), 392 .qiov = qiov, 393 }; 394 395 ret = laio_do_submit(fd, &laiocb, offset, type); 396 if (ret < 0) { 397 return ret; 398 } 399 400 if (laiocb.ret == -EINPROGRESS) { 401 qemu_coroutine_yield(); 402 } 403 return laiocb.ret; 404 } 405 406 void laio_detach_aio_context(LinuxAioState *s, AioContext *old_context) 407 { 408 aio_set_event_notifier(old_context, &s->e, false, NULL, NULL); 409 qemu_bh_delete(s->completion_bh); 410 s->aio_context = NULL; 411 } 412 413 void laio_attach_aio_context(LinuxAioState *s, AioContext *new_context) 414 { 415 s->aio_context = new_context; 416 s->completion_bh = aio_bh_new(new_context, qemu_laio_completion_bh, s); 417 aio_set_event_notifier(new_context, &s->e, false, 418 qemu_laio_completion_cb, 419 qemu_laio_poll_cb); 420 } 421 422 LinuxAioState *laio_init(Error **errp) 423 { 424 int rc; 425 LinuxAioState *s; 426 427 s = g_malloc0(sizeof(*s)); 428 rc = event_notifier_init(&s->e, false); 429 if (rc < 0) { 430 error_setg_errno(errp, -rc, "failed to to initialize event notifier"); 431 goto out_free_state; 432 } 433 434 rc = io_setup(MAX_EVENTS, &s->ctx); 435 if (rc < 0) { 436 error_setg_errno(errp, -rc, "failed to create linux AIO context"); 437 goto out_close_efd; 438 } 439 440 ioq_init(&s->io_q); 441 442 return s; 443 444 out_close_efd: 445 event_notifier_cleanup(&s->e); 446 out_free_state: 447 g_free(s); 448 return NULL; 449 } 450 451 void laio_cleanup(LinuxAioState *s) 452 { 453 event_notifier_cleanup(&s->e); 454 455 if (io_destroy(s->ctx) != 0) { 456 fprintf(stderr, "%s: destroy AIO context %p failed\n", 457 __func__, &s->ctx); 458 } 459 g_free(s); 460 } 461