2008-09-22 21:17:18 +02:00
|
|
|
/*
|
|
|
|
* QEMU aio implementation
|
|
|
|
*
|
|
|
|
* Copyright IBM, Corp. 2008
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Anthony Liguori <aliguori@us.ibm.com>
|
|
|
|
*
|
|
|
|
* This work is licensed under the terms of the GNU GPL, version 2. See
|
|
|
|
* the COPYING file in the top-level directory.
|
|
|
|
*
|
2012-01-13 17:44:23 +01:00
|
|
|
* Contributions after 2012-01-13 are licensed under the terms of the
|
|
|
|
* GNU GPL, version 2 or (at your option) any later version.
|
2008-09-22 21:17:18 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "qemu-common.h"
|
2012-12-17 18:19:44 +01:00
|
|
|
#include "block/block.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/queue.h"
|
|
|
|
#include "qemu/sockets.h"
|
2008-09-22 21:17:18 +02:00
|
|
|
|
|
|
|
struct AioHandler
|
|
|
|
{
|
2012-09-24 14:57:22 +02:00
|
|
|
GPollFD pfd;
|
2008-09-22 21:17:18 +02:00
|
|
|
IOHandler *io_read;
|
|
|
|
IOHandler *io_write;
|
|
|
|
int deleted;
|
2013-02-20 11:28:32 +01:00
|
|
|
int pollfds_idx;
|
2008-09-22 21:17:18 +02:00
|
|
|
void *opaque;
|
2009-09-12 09:36:22 +02:00
|
|
|
QLIST_ENTRY(AioHandler) node;
|
2008-09-22 21:17:18 +02:00
|
|
|
};
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
static AioHandler *find_aio_handler(AioContext *ctx, int fd)
|
2008-09-22 21:17:18 +02:00
|
|
|
{
|
|
|
|
AioHandler *node;
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
QLIST_FOREACH(node, &ctx->aio_handlers, node) {
|
2012-09-24 14:57:22 +02:00
|
|
|
if (node->pfd.fd == fd)
|
2009-05-06 02:58:48 +02:00
|
|
|
if (!node->deleted)
|
|
|
|
return node;
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
void aio_set_fd_handler(AioContext *ctx,
|
|
|
|
int fd,
|
|
|
|
IOHandler *io_read,
|
|
|
|
IOHandler *io_write,
|
|
|
|
void *opaque)
|
2008-09-22 21:17:18 +02:00
|
|
|
{
|
|
|
|
AioHandler *node;
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
node = find_aio_handler(ctx, fd);
|
2008-09-22 21:17:18 +02:00
|
|
|
|
|
|
|
/* Are we deleting the fd handler? */
|
|
|
|
if (!io_read && !io_write) {
|
|
|
|
if (node) {
|
2012-09-24 14:57:41 +02:00
|
|
|
g_source_remove_poll(&ctx->source, &node->pfd);
|
|
|
|
|
2008-09-22 21:17:18 +02:00
|
|
|
/* If the lock is held, just mark the node as deleted */
|
2012-09-24 14:57:22 +02:00
|
|
|
if (ctx->walking_handlers) {
|
2008-09-22 21:17:18 +02:00
|
|
|
node->deleted = 1;
|
2012-09-24 14:57:22 +02:00
|
|
|
node->pfd.revents = 0;
|
|
|
|
} else {
|
2008-09-22 21:17:18 +02:00
|
|
|
/* Otherwise, delete it for real. We can't just mark it as
|
|
|
|
* deleted because deleted nodes are only cleaned up after
|
|
|
|
* releasing the walking_handlers lock.
|
|
|
|
*/
|
2009-09-12 09:36:22 +02:00
|
|
|
QLIST_REMOVE(node, node);
|
2011-08-21 05:09:37 +02:00
|
|
|
g_free(node);
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (node == NULL) {
|
|
|
|
/* Alloc and insert if it's not already there */
|
2014-12-04 13:55:09 +01:00
|
|
|
node = g_new0(AioHandler, 1);
|
2012-09-24 14:57:22 +02:00
|
|
|
node->pfd.fd = fd;
|
2012-09-13 12:28:51 +02:00
|
|
|
QLIST_INSERT_HEAD(&ctx->aio_handlers, node, node);
|
2012-09-24 14:57:41 +02:00
|
|
|
|
|
|
|
g_source_add_poll(&ctx->source, &node->pfd);
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
|
|
|
/* Update handler with latest information */
|
|
|
|
node->io_read = io_read;
|
|
|
|
node->io_write = io_write;
|
|
|
|
node->opaque = opaque;
|
2013-02-20 11:28:32 +01:00
|
|
|
node->pollfds_idx = -1;
|
2012-09-24 14:57:22 +02:00
|
|
|
|
2013-02-20 11:28:33 +01:00
|
|
|
node->pfd.events = (io_read ? G_IO_IN | G_IO_HUP | G_IO_ERR : 0);
|
|
|
|
node->pfd.events |= (io_write ? G_IO_OUT | G_IO_ERR : 0);
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
2012-09-25 10:22:39 +02:00
|
|
|
|
|
|
|
aio_notify(ctx);
|
2012-06-09 03:44:00 +02:00
|
|
|
}
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
void aio_set_event_notifier(AioContext *ctx,
|
|
|
|
EventNotifier *notifier,
|
2013-04-11 17:26:25 +02:00
|
|
|
EventNotifierHandler *io_read)
|
2008-09-22 21:17:18 +02:00
|
|
|
{
|
2012-09-13 12:28:51 +02:00
|
|
|
aio_set_fd_handler(ctx, event_notifier_get_fd(notifier),
|
2013-04-11 17:26:25 +02:00
|
|
|
(IOHandler *)io_read, NULL, notifier);
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
|
|
|
|
2014-07-09 11:53:08 +02:00
|
|
|
bool aio_prepare(AioContext *ctx)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-09-24 14:57:22 +02:00
|
|
|
bool aio_pending(AioContext *ctx)
|
|
|
|
{
|
|
|
|
AioHandler *node;
|
|
|
|
|
|
|
|
QLIST_FOREACH(node, &ctx->aio_handlers, node) {
|
|
|
|
int revents;
|
|
|
|
|
|
|
|
revents = node->pfd.revents & node->pfd.events;
|
|
|
|
if (revents & (G_IO_IN | G_IO_HUP | G_IO_ERR) && node->io_read) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (revents & (G_IO_OUT | G_IO_ERR) && node->io_write) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2014-07-09 11:53:05 +02:00
|
|
|
bool aio_dispatch(AioContext *ctx)
|
2008-09-22 21:17:18 +02:00
|
|
|
{
|
2012-04-12 14:00:56 +02:00
|
|
|
AioHandler *node;
|
2013-02-20 11:28:31 +01:00
|
|
|
bool progress = false;
|
2012-09-24 14:37:53 +02:00
|
|
|
|
2014-07-09 11:53:05 +02:00
|
|
|
/*
|
|
|
|
* If there are callbacks left that have been queued, we need to call them.
|
|
|
|
* Do not call select in this case, because it is possible that the caller
|
|
|
|
* does not need a complete flush (as is the case for aio_poll loops).
|
|
|
|
*/
|
|
|
|
if (aio_bh_poll(ctx)) {
|
|
|
|
progress = true;
|
|
|
|
}
|
|
|
|
|
2012-09-24 14:57:22 +02:00
|
|
|
/*
|
2014-07-07 15:18:02 +02:00
|
|
|
* We have to walk very carefully in case aio_set_fd_handler is
|
2012-09-24 14:57:22 +02:00
|
|
|
* called while we're walking.
|
|
|
|
*/
|
|
|
|
node = QLIST_FIRST(&ctx->aio_handlers);
|
|
|
|
while (node) {
|
|
|
|
AioHandler *tmp;
|
|
|
|
int revents;
|
|
|
|
|
|
|
|
ctx->walking_handlers++;
|
|
|
|
|
|
|
|
revents = node->pfd.revents & node->pfd.events;
|
|
|
|
node->pfd.revents = 0;
|
|
|
|
|
2013-02-20 11:28:31 +01:00
|
|
|
if (!node->deleted &&
|
|
|
|
(revents & (G_IO_IN | G_IO_HUP | G_IO_ERR)) &&
|
|
|
|
node->io_read) {
|
2012-09-24 14:57:22 +02:00
|
|
|
node->io_read(node->opaque);
|
2013-04-11 16:56:50 +02:00
|
|
|
|
|
|
|
/* aio_notify() does not count as progress */
|
|
|
|
if (node->opaque != &ctx->notifier) {
|
|
|
|
progress = true;
|
|
|
|
}
|
2012-09-24 14:57:22 +02:00
|
|
|
}
|
2013-02-20 11:28:31 +01:00
|
|
|
if (!node->deleted &&
|
|
|
|
(revents & (G_IO_OUT | G_IO_ERR)) &&
|
|
|
|
node->io_write) {
|
2012-09-24 14:57:22 +02:00
|
|
|
node->io_write(node->opaque);
|
|
|
|
progress = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
tmp = node;
|
|
|
|
node = QLIST_NEXT(node, node);
|
|
|
|
|
|
|
|
ctx->walking_handlers--;
|
|
|
|
|
|
|
|
if (!ctx->walking_handlers && tmp->deleted) {
|
|
|
|
QLIST_REMOVE(tmp, node);
|
|
|
|
g_free(tmp);
|
|
|
|
}
|
|
|
|
}
|
2013-08-21 17:02:53 +02:00
|
|
|
|
|
|
|
/* Run our timers */
|
|
|
|
progress |= timerlistgroup_run_timers(&ctx->tlg);
|
|
|
|
|
2013-02-20 11:28:31 +01:00
|
|
|
return progress;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool aio_poll(AioContext *ctx, bool blocking)
|
|
|
|
{
|
|
|
|
AioHandler *node;
|
2014-07-07 15:18:04 +02:00
|
|
|
bool was_dispatching;
|
2013-02-20 11:28:31 +01:00
|
|
|
int ret;
|
2013-04-11 16:56:50 +02:00
|
|
|
bool progress;
|
2013-02-20 11:28:31 +01:00
|
|
|
|
2014-07-07 15:18:04 +02:00
|
|
|
was_dispatching = ctx->dispatching;
|
2013-02-20 11:28:31 +01:00
|
|
|
progress = false;
|
|
|
|
|
2014-07-07 15:18:04 +02:00
|
|
|
/* aio_notify can avoid the expensive event_notifier_set if
|
|
|
|
* everything (file descriptors, bottom halves, timers) will
|
2014-07-09 11:53:05 +02:00
|
|
|
* be re-evaluated before the next blocking poll(). This is
|
|
|
|
* already true when aio_poll is called with blocking == false;
|
|
|
|
* if blocking == true, it is only true after poll() returns.
|
2014-07-07 15:18:04 +02:00
|
|
|
*
|
|
|
|
* If we're in a nested event loop, ctx->dispatching might be true.
|
|
|
|
* In that case we can restore it just before returning, but we
|
|
|
|
* have to clear it now.
|
|
|
|
*/
|
|
|
|
aio_set_dispatching(ctx, !blocking);
|
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
ctx->walking_handlers++;
|
2008-09-22 21:17:18 +02:00
|
|
|
|
2013-02-20 11:28:32 +01:00
|
|
|
g_array_set_size(ctx->pollfds, 0);
|
2008-09-22 21:17:18 +02:00
|
|
|
|
2013-02-20 11:28:32 +01:00
|
|
|
/* fill pollfds */
|
2012-09-13 12:28:51 +02:00
|
|
|
QLIST_FOREACH(node, &ctx->aio_handlers, node) {
|
2013-02-20 11:28:32 +01:00
|
|
|
node->pollfds_idx = -1;
|
|
|
|
if (!node->deleted && node->pfd.events) {
|
|
|
|
GPollFD pfd = {
|
|
|
|
.fd = node->pfd.fd,
|
|
|
|
.events = node->pfd.events,
|
|
|
|
};
|
|
|
|
node->pollfds_idx = ctx->pollfds->len;
|
|
|
|
g_array_append_val(ctx->pollfds, pfd);
|
2012-04-12 14:00:56 +02:00
|
|
|
}
|
|
|
|
}
|
2008-09-22 21:17:18 +02:00
|
|
|
|
2012-09-13 12:28:51 +02:00
|
|
|
ctx->walking_handlers--;
|
2008-09-22 21:17:18 +02:00
|
|
|
|
2012-04-12 14:00:56 +02:00
|
|
|
/* wait until next event */
|
2013-08-21 17:02:53 +02:00
|
|
|
ret = qemu_poll_ns((GPollFD *)ctx->pollfds->data,
|
|
|
|
ctx->pollfds->len,
|
2014-07-09 11:53:01 +02:00
|
|
|
blocking ? aio_compute_timeout(ctx) : 0);
|
2012-04-12 14:00:56 +02:00
|
|
|
|
|
|
|
/* if we have any readable fds, dispatch event */
|
|
|
|
if (ret > 0) {
|
2013-02-20 11:28:32 +01:00
|
|
|
QLIST_FOREACH(node, &ctx->aio_handlers, node) {
|
|
|
|
if (node->pollfds_idx != -1) {
|
|
|
|
GPollFD *pfd = &g_array_index(ctx->pollfds, GPollFD,
|
|
|
|
node->pollfds_idx);
|
|
|
|
node->pfd.revents = pfd->revents;
|
2012-04-12 14:00:56 +02:00
|
|
|
}
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|
2013-08-21 17:02:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Run dispatch even if there were no readable fds to run timers */
|
2014-07-07 15:18:04 +02:00
|
|
|
aio_set_dispatching(ctx, true);
|
2013-08-21 17:02:53 +02:00
|
|
|
if (aio_dispatch(ctx)) {
|
|
|
|
progress = true;
|
2012-04-12 14:00:56 +02:00
|
|
|
}
|
2012-04-12 14:00:55 +02:00
|
|
|
|
2014-07-07 15:18:04 +02:00
|
|
|
aio_set_dispatching(ctx, was_dispatching);
|
2013-04-11 16:56:50 +02:00
|
|
|
return progress;
|
2008-09-22 21:17:18 +02:00
|
|
|
}
|