Lines Matching refs:node

39     QLIST_ENTRY(AioHandler) node;
44 AioHandler *node;
46 QLIST_FOREACH(node, &aio_handlers, node) {
47 if (node->fd == fd)
48 if (!node->deleted)
49 return node;
62 AioHandler *node;
64 node = find_aio_handler(fd);
68 if (node) {
69 /* If the lock is held, just mark the node as deleted */
71 node->deleted = 1;
77 QLIST_REMOVE(node, node);
78 g_free(node);
82 if (node == NULL) {
84 node = g_malloc0(sizeof(AioHandler));
85 node->fd = fd;
86 QLIST_INSERT_HEAD(&aio_handlers, node, node);
89 node->io_read = io_read;
90 node->io_write = io_write;
91 node->io_flush = io_flush;
92 node->io_process_queue = io_process_queue;
93 node->opaque = opaque;
103 AioHandler *node;
115 QLIST_FOREACH(node, &aio_handlers, node) {
116 if (node->io_flush) {
117 ret |= node->io_flush(node->opaque);
125 AioHandler *node;
130 QLIST_FOREACH(node, &aio_handlers, node) {
131 if (node->io_process_queue) {
132 if (node->io_process_queue(node->opaque)) {
158 AioHandler *node;
168 QLIST_FOREACH(node, &aio_handlers, node) {
173 if (node->io_flush && node->io_flush(node->opaque) == 0)
176 if (!node->deleted && node->io_read) {
177 FD_SET(node->fd, &rdfds);
178 max_fd = MAX(max_fd, node->fd + 1);
180 if (!node->deleted && node->io_write) {
181 FD_SET(node->fd, &wrfds);
182 max_fd = MAX(max_fd, node->fd + 1);
203 node = QLIST_FIRST(&aio_handlers);
204 while (node) {
207 if (!node->deleted &&
208 FD_ISSET(node->fd, &rdfds) &&
209 node->io_read) {
210 node->io_read(node->opaque);
212 if (!node->deleted &&
213 FD_ISSET(node->fd, &wrfds) &&
214 node->io_write) {
215 node->io_write(node->opaque);
218 tmp = node;
219 node = QLIST_NEXT(node, node);
222 QLIST_REMOVE(tmp, node);