Lines Matching refs:node
40 QLIST_ENTRY(AioHandler) node;
45 AioHandler *node;
47 QLIST_FOREACH(node, &aio_handlers, node) {
48 if (node->fd == fd)
49 if (!node->deleted)
50 return node;
63 AioHandler *node;
65 node = find_aio_handler(fd);
69 if (node) {
70 /* If the lock is held, just mark the node as deleted */
72 node->deleted = 1;
78 QLIST_REMOVE(node, node);
79 g_free(node);
83 if (node == NULL) {
85 node = g_malloc0(sizeof(AioHandler));
86 node->fd = fd;
87 QLIST_INSERT_HEAD(&aio_handlers, node, node);
90 node->io_read = io_read;
91 node->io_write = io_write;
92 node->io_flush = io_flush;
93 node->io_process_queue = io_process_queue;
94 node->opaque = opaque;
104 AioHandler *node;
116 QLIST_FOREACH(node, &aio_handlers, node) {
117 if (node->io_flush) {
118 ret |= node->io_flush(node->opaque);
126 AioHandler *node;
131 QLIST_FOREACH(node, &aio_handlers, node) {
132 if (node->io_process_queue) {
133 if (node->io_process_queue(node->opaque)) {
162 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 iolooper_add_read(looper, node->fd);
179 if (!node->deleted && node->io_write) {
180 iolooper_add_write(looper, node->fd);
200 node = QLIST_FIRST(&aio_handlers);
201 while (node) {
204 if (!node->deleted &&
205 iolooper_is_read(looper, node->fd) &&
206 node->io_read) {
207 node->io_read(node->opaque);
209 if (!node->deleted &&
210 iolooper_is_write(looper, node->fd) &&
211 node->io_write) {
212 node->io_write(node->opaque);
215 tmp = node;
216 node = QLIST_NEXT(node, node);
219 QLIST_REMOVE(tmp, node);