-/* Licensed under BSD-MIT - see LICENSE file for details */
+/* Licensed under LGPLv2.1+ - see LICENSE file for details */
#include "io.h"
#include "backend.h"
#include <assert.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/socket.h>
+#include <limits.h>
-static size_t num_fds = 0, max_fds = 0, num_next = 0, num_finished = 0;
+static size_t num_fds = 0, max_fds = 0, num_next = 0, num_finished = 0, num_waiting = 0;
static struct pollfd *pollfds = NULL;
static struct fd **fds = NULL;
+static struct timers timeouts;
static bool add_fd(struct fd *fd, short events)
{
bool add_listener(struct io_listener *l)
{
- return add_fd(&l->fd, POLLIN);
+ if (!add_fd(&l->fd, POLLIN))
+ return false;
+ num_waiting++;
+ return true;
}
bool add_conn(struct io_conn *c)
return true;
}
+bool add_duplex(struct io_conn *c)
+{
+ c->fd.backend_info = c->duplex->fd.backend_info;
+ num_next++;
+ return true;
+}
+
static void del_conn(struct io_conn *conn)
{
- if (conn->fd.finish)
- conn->fd.finish(conn, conn->fd.finish_arg);
- del_fd(&conn->fd);
+ if (conn->finish)
+ conn->finish(conn, conn->finish_arg);
+ if (timeout_active(conn))
+ backend_del_timeout(conn);
+ free(conn->timeout);
+ if (conn->duplex) {
+ /* In case fds[] pointed to the other one. */
+ fds[conn->fd.backend_info] = &conn->duplex->fd;
+ conn->duplex->duplex = NULL;
+ } else
+ del_fd(&conn->fd);
if (conn->state == FINISHED)
num_finished--;
else if (conn->state == NEXT)
del_fd(&l->fd);
}
-void backend_set_state(struct io_conn *conn, struct io_op *op)
+void backend_set_state(struct io_conn *conn, struct io_plan *plan)
{
- enum io_state state = from_ioop(op);
+ enum io_state state = from_ioplan(plan);
struct pollfd *pfd = &pollfds[conn->fd.backend_info];
- switch (state) {
- case READ:
- case READPART:
- pfd->events = POLLIN;
- break;
- case WRITE:
- case WRITEPART:
- pfd->events = POLLOUT;
- break;
- case IDLE:
- pfd->events = 0;
- break;
- case NEXT:
+ if (pfd->events)
+ num_waiting--;
+
+ pfd->events = conn->pollflag;
+ if (conn->duplex) {
+ int mask = conn->duplex->pollflag;
+ /* You can't *both* read/write. */
+ assert(!mask || pfd->events != mask);
+ pfd->events |= mask;
+ }
+ if (pfd->events)
+ num_waiting++;
+
+ if (state == NEXT)
num_next++;
- break;
- case FINISHED:
+ else if (state == FINISHED)
num_finished++;
- break;
- default:
- abort();
- }
+
conn->state = state;
}
/* FIXME: What to do here? */
if (fd < 0)
return;
- c = io_new_conn(fd, l->fd.next, l->fd.finish, l->fd.next_arg);
+ c = io_new_conn(fd, l->next, l->finish, l->conn_arg);
if (!c) {
close(fd);
return;
unsigned int i;
for (i = 0; !io_loop_return && i < num_fds; i++) {
- struct io_conn *c;
+ struct io_conn *c, *duplex;
if (!num_finished) {
if (finished_only || num_next == 0)
if (fds[i]->listener)
continue;
c = (void *)fds[i];
- if (c->state == FINISHED) {
- del_conn(c);
- free(c);
- i--;
- } else if (!finished_only && c->state == NEXT) {
- backend_set_state(c, c->fd.next(c, c->fd.next_arg));
- num_next--;
+ for (duplex = c->duplex; c; c = duplex, duplex = NULL) {
+ if (c->state == FINISHED) {
+ del_conn(c);
+ free(c);
+ i--;
+ } else if (!finished_only && c->state == NEXT) {
+ backend_set_state(c, c->next(c, c->next_arg));
+ num_next--;
+ }
}
}
}
+static void ready(struct io_conn *c)
+{
+ backend_set_state(c, do_ready(c));
+}
+
+void backend_add_timeout(struct io_conn *conn, struct timespec duration)
+{
+ if (!timeouts.base)
+ timers_init(&timeouts, time_now());
+ timer_add(&timeouts, &conn->timeout->timer,
+ time_add(time_now(), duration));
+ conn->timeout->conn = conn;
+}
+
+void backend_del_timeout(struct io_conn *conn)
+{
+ assert(conn->timeout->conn == conn);
+ timer_del(&timeouts, &conn->timeout->timer);
+ conn->timeout->conn = NULL;
+}
+
/* This is the main loop. */
void *io_loop(void)
{
void *ret;
while (!io_loop_return) {
- int i, r;
+ int i, r, timeout = INT_MAX;
+ struct timespec now;
+
+ if (timeouts.base) {
+ struct timespec first;
+ struct list_head expired;
+ struct io_timeout *t;
+
+ now = time_now();
+
+ /* Call functions for expired timers. */
+ timers_expire(&timeouts, now, &expired);
+ while ((t = list_pop(&expired, struct io_timeout, timer.list))) {
+ struct io_conn *conn = t->conn;
+ /* Clear, in case timer re-adds */
+ t->conn = NULL;
+ backend_set_state(conn, t->next(conn, t->next_arg));
+ }
+
+ /* Now figure out how long to wait for the next one. */
+ if (timer_earliest(&timeouts, &first)) {
+ uint64_t f = time_to_msec(time_sub(first, now));
+ if (f < INT_MAX)
+ timeout = f;
+ }
+ }
if (num_finished || num_next) {
finish_and_next(false);
if (num_fds == 0)
break;
- r = poll(pollfds, num_fds, -1);
+ /* You can't tell them all to go to sleep! */
+ assert(num_waiting);
+
+ r = poll(pollfds, num_fds, timeout);
if (r < 0)
break;
for (i = 0; i < num_fds && !io_loop_return; i++) {
struct io_conn *c = (void *)fds[i];
- if (pollfds[i].revents & POLLOUT)
- backend_set_state(c, do_writeable(c));
- else if (pollfds[i].revents & POLLIN) {
- if (fds[i]->listener)
+ int events = pollfds[i].revents;
+
+ if (r == 0)
+ break;
+
+ if (fds[i]->listener) {
+ if (events & POLLIN) {
accept_conn((void *)c);
- else
- backend_set_state(c, do_readable(c));
- } else if (pollfds[i].revents & POLLHUP) {
+ r--;
+ }
+ } else if (events & (POLLIN|POLLOUT)) {
+ r--;
+ if (c->duplex) {
+ int mask = c->duplex->pollflag;
+ if (events & mask) {
+ ready(c->duplex);
+ events &= ~mask;
+ if (!(events&(POLLIN|POLLOUT)))
+ continue;
+ }
+ }
+ ready(c);
+ } else if (events & POLLHUP) {
+ r--;
backend_set_state(c, io_close(c, NULL));
+ if (c->duplex)
+ backend_set_state(c->duplex,
+ io_close(c->duplex,
+ NULL));
}
}
}