Include qemu-common.h in order to get prototypes for qemu_malloc etc.
[qemu/mini2440.git] / aio.c
blob687e4bef08b533caf9e9f8423a28f104476fbd9c
1 /*
2 * QEMU aio implementation
4 * Copyright IBM, Corp. 2008
6 * Authors:
7 * Anthony Liguori <aliguori@us.ibm.com>
9 * This work is licensed under the terms of the GNU GPL, version 2. See
10 * the COPYING file in the top-level directory.
14 #include "qemu-common.h"
15 #include "block.h"
16 #include "sys-queue.h"
17 #include "qemu_socket.h"
19 typedef struct AioHandler AioHandler;
21 /* The list of registered AIO handlers */
22 static LIST_HEAD(, AioHandler) aio_handlers;
24 /* This is a simple lock used to protect the aio_handlers list. Specifically,
25 * it's used to ensure that no callbacks are removed while we're walking and
26 * dispatching callbacks.
28 static int walking_handlers;
30 struct AioHandler
32 int fd;
33 IOHandler *io_read;
34 IOHandler *io_write;
35 AioFlushHandler *io_flush;
36 int deleted;
37 void *opaque;
38 LIST_ENTRY(AioHandler) node;
41 static AioHandler *find_aio_handler(int fd)
43 AioHandler *node;
45 LIST_FOREACH(node, &aio_handlers, node) {
46 if (node->fd == fd)
47 return node;
50 return NULL;
53 int qemu_aio_set_fd_handler(int fd,
54 IOHandler *io_read,
55 IOHandler *io_write,
56 AioFlushHandler *io_flush,
57 void *opaque)
59 AioHandler *node;
61 node = find_aio_handler(fd);
63 /* Are we deleting the fd handler? */
64 if (!io_read && !io_write) {
65 if (node) {
66 /* If the lock is held, just mark the node as deleted */
67 if (walking_handlers)
68 node->deleted = 1;
69 else {
70 /* Otherwise, delete it for real. We can't just mark it as
71 * deleted because deleted nodes are only cleaned up after
72 * releasing the walking_handlers lock.
74 LIST_REMOVE(node, node);
75 qemu_free(node);
78 } else {
79 if (node == NULL) {
80 /* Alloc and insert if it's not already there */
81 node = qemu_mallocz(sizeof(AioHandler));
82 if (node == NULL)
83 return -ENOMEM;
84 node->fd = fd;
85 LIST_INSERT_HEAD(&aio_handlers, node, node);
87 /* Update handler with latest information */
88 node->io_read = io_read;
89 node->io_write = io_write;
90 node->io_flush = io_flush;
91 node->opaque = opaque;
94 qemu_set_fd_handler2(fd, NULL, io_read, io_write, opaque);
96 return 0;
99 void qemu_aio_flush(void)
101 AioHandler *node;
102 int ret;
104 do {
105 ret = 0;
107 LIST_FOREACH(node, &aio_handlers, node) {
108 ret |= node->io_flush(node->opaque);
111 qemu_aio_wait();
112 } while (ret > 0);
115 void qemu_aio_wait(void)
117 int ret;
119 if (qemu_bh_poll())
120 return;
122 do {
123 AioHandler *node;
124 fd_set rdfds, wrfds;
125 int max_fd = -1;
127 walking_handlers = 1;
129 /* fill fd sets */
130 LIST_FOREACH(node, &aio_handlers, node) {
131 /* If there aren't pending AIO operations, don't invoke callbacks.
132 * Otherwise, if there are no AIO requests, qemu_aio_wait() would
133 * wait indefinitely.
135 if (node->io_flush && node->io_flush(node->opaque) == 0)
136 continue;
138 if (!node->deleted && node->io_read) {
139 FD_SET(node->fd, &rdfds);
140 max_fd = MAX(max_fd, node->fd + 1);
142 if (!node->deleted && node->io_write) {
143 FD_SET(node->fd, &wrfds);
144 max_fd = MAX(max_fd, node->fd + 1);
148 walking_handlers = 0;
150 /* No AIO operations? Get us out of here */
151 if (max_fd == -1)
152 break;
154 /* wait until next event */
155 ret = select(max_fd, &rdfds, &wrfds, NULL, NULL);
156 if (ret == -1 && errno == EINTR)
157 continue;
159 /* if we have any readable fds, dispatch event */
160 if (ret > 0) {
161 walking_handlers = 1;
163 /* we have to walk very carefully in case
164 * qemu_aio_set_fd_handler is called while we're walking */
165 node = LIST_FIRST(&aio_handlers);
166 while (node) {
167 AioHandler *tmp;
169 if (!node->deleted &&
170 FD_ISSET(node->fd, &rdfds) &&
171 node->io_read) {
172 node->io_read(node->opaque);
174 if (!node->deleted &&
175 FD_ISSET(node->fd, &wrfds) &&
176 node->io_write) {
177 node->io_write(node->opaque);
180 tmp = node;
181 node = LIST_NEXT(node, node);
183 if (tmp->deleted) {
184 LIST_REMOVE(tmp, node);
185 qemu_free(tmp);
189 walking_handlers = 0;
191 } while (ret == 0);