#include <sys/types.h>
#include <sys/socket.h>
#include <limits.h>
+#include <errno.h>
+#include <ccan/time/time.h>
+#include <ccan/timer/timer.h>
-static size_t num_fds = 0, max_fds = 0, num_finished = 0, num_waiting = 0;
+static size_t num_fds = 0, max_fds = 0, num_waiting = 0;
static struct pollfd *pollfds = NULL;
static struct fd **fds = NULL;
-static struct timers timeouts;
+static LIST_HEAD(closing);
+static LIST_HEAD(always);
+static struct timemono (*nowfn)(void) = time_mono;
+
+struct timemono (*io_time_override(struct timemono (*now)(void)))(void)
+{
+ struct timemono (*old)(void) = nowfn;
+ nowfn = now;
+ return old;
+}
static bool add_fd(struct fd *fd, short events)
{
+ if (!max_fds) {
+ assert(num_fds == 0);
+ pollfds = tal_arr(NULL, struct pollfd, 8);
+ if (!pollfds)
+ return false;
+ fds = tal_arr(pollfds, struct fd *, 8);
+ if (!fds)
+ return false;
+ max_fds = 8;
+ }
+
if (num_fds + 1 > max_fds) {
- struct pollfd *newpollfds;
- struct fd **newfds;
- size_t num = max_fds ? max_fds * 2 : 8;
+ size_t num = max_fds * 2;
- newpollfds = realloc(pollfds, sizeof(*newpollfds) * num);
- if (!newpollfds)
+ if (!tal_resize(&pollfds, num))
return false;
- pollfds = newpollfds;
- newfds = realloc(fds, sizeof(*newfds) * num);
- if (!newfds)
+ if (!tal_resize(&fds, num))
return false;
- fds = newfds;
max_fds = num;
}
- pollfds[num_fds].fd = fd->fd;
pollfds[num_fds].events = events;
+ /* In case it's idle. */
+ if (!events)
+ pollfds[num_fds].fd = -fd->fd;
+ else
+ pollfds[num_fds].fd = fd->fd;
pollfds[num_fds].revents = 0; /* In case we're iterating now */
fds[num_fds] = fd;
fd->backend_info = num_fds;
fds[n]->backend_info = n;
} else if (num_fds == 1) {
/* Free everything when no more fds. */
- free(pollfds);
- free(fds);
- pollfds = NULL;
+ pollfds = tal_free(pollfds);
fds = NULL;
max_fds = 0;
}
num_fds--;
fd->backend_info = -1;
+
+ /* Closing a local socket doesn't wake poll() because other end
+ * has them open. See 2.6. When should I use shutdown()?
+ * in http://www.faqs.org/faqs/unix-faq/socket/ */
+ shutdown(fd->fd, SHUT_RDWR);
+
close(fd->fd);
}
return true;
}
-static void adjust_counts(enum io_state state)
+void remove_from_always(struct io_conn *conn)
+{
+ list_del_init(&conn->always);
+}
+
+void backend_new_closing(struct io_conn *conn)
+{
+ /* In case it's on always list, remove it. */
+ list_del_init(&conn->always);
+ list_add_tail(&closing, &conn->closing);
+}
+
+void backend_new_always(struct io_conn *conn)
{
- if (state == IO_FINISHED)
- num_finished++;
+ /* In case it's already in always list. */
+ list_del(&conn->always);
+ list_add_tail(&always, &conn->always);
}
-static void update_pollevents(struct io_conn *conn)
+void backend_new_plan(struct io_conn *conn)
{
struct pollfd *pfd = &pollfds[conn->fd.backend_info];
if (pfd->events)
num_waiting--;
- pfd->events = conn->plan.pollflag;
- if (conn->duplex) {
- int mask = conn->duplex->plan.pollflag;
- /* You can't *both* read/write. */
- assert(!mask || pfd->events != mask);
- pfd->events |= mask;
- }
- if (pfd->events)
- num_waiting++;
+ pfd->events = 0;
+ if (conn->plan[IO_IN].status == IO_POLLING)
+ pfd->events |= POLLIN;
+ if (conn->plan[IO_OUT].status == IO_POLLING)
+ pfd->events |= POLLOUT;
- adjust_counts(conn->plan.state);
+ if (pfd->events) {
+ num_waiting++;
+ pfd->fd = conn->fd.fd;
+ } else {
+ pfd->fd = -conn->fd.fd;
+ }
}
-bool add_conn(struct io_conn *c)
+void backend_wake(const void *wait)
{
- if (!add_fd(&c->fd, c->plan.pollflag))
- return false;
- adjust_counts(c->plan.state);
- return true;
+ unsigned int i;
+
+ for (i = 0; i < num_fds; i++) {
+ struct io_conn *c;
+
+ /* Ignore listeners */
+ if (fds[i]->listener)
+ continue;
+
+ c = (void *)fds[i];
+ if (c->plan[IO_IN].status == IO_WAITING
+ && c->plan[IO_IN].arg.u1.const_vp == wait)
+ io_do_wakeup(c, IO_IN);
+
+ if (c->plan[IO_OUT].status == IO_WAITING
+ && c->plan[IO_OUT].arg.u1.const_vp == wait)
+ io_do_wakeup(c, IO_OUT);
+ }
}
-bool add_duplex(struct io_conn *c)
+bool add_conn(struct io_conn *c)
{
- c->fd.backend_info = c->duplex->fd.backend_info;
- update_pollevents(c);
- return true;
+ return add_fd(&c->fd, 0);
}
static void del_conn(struct io_conn *conn)
{
- assert(conn->plan.state == IO_FINISHED);
- if (conn->finish)
+ del_fd(&conn->fd);
+ if (conn->finish) {
+ /* Saved by io_close */
+ errno = conn->plan[IO_IN].arg.u1.s;
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);
- num_finished--;
+ }
+ tal_free(conn);
}
void del_listener(struct io_listener *l)
del_fd(&l->fd);
}
-static void backend_set_state(struct io_conn *conn, struct io_plan plan)
-{
- conn->plan = plan;
- update_pollevents(conn);
-}
-
-void backend_wakeup(struct io_conn *conn)
-{
- update_pollevents(conn);
-}
-
static void accept_conn(struct io_listener *l)
{
int fd = accept(l->fd.fd, NULL, NULL);
/* FIXME: What to do here? */
if (fd < 0)
return;
- l->init(fd, l->arg);
+
+ io_new_conn(l->ctx, fd, l->init, l->arg);
}
/* It's OK to miss some, as long as we make progress. */
-static void finish_conns(void)
+static bool close_conns(void)
{
- unsigned int i;
-
- for (i = 0; !io_loop_return && i < num_fds; i++) {
- struct io_conn *c, *duplex;
+ bool ret = false;
+ struct io_conn *conn;
- if (!num_finished)
- break;
+ while ((conn = list_pop(&closing, struct io_conn, closing)) != NULL) {
+ assert(conn->plan[IO_IN].status == IO_CLOSING);
+ assert(conn->plan[IO_OUT].status == IO_CLOSING);
- if (fds[i]->listener)
- continue;
- c = (void *)fds[i];
- for (duplex = c->duplex; c; c = duplex, duplex = NULL) {
- if (c->plan.state == IO_FINISHED) {
- del_conn(c);
- free(c);
- i--;
- }
- }
+ del_conn(conn);
+ ret = true;
}
+ return ret;
}
-static void ready(struct io_conn *c)
+static bool handle_always(void)
{
- backend_set_state(c, do_ready(c));
-}
+ bool ret = false;
+ struct io_conn *conn;
-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;
-}
+ while ((conn = list_pop(&always, struct io_conn, always)) != NULL) {
+ assert(conn->plan[IO_IN].status == IO_ALWAYS
+ || conn->plan[IO_OUT].status == IO_ALWAYS);
-void backend_del_timeout(struct io_conn *conn)
-{
- assert(conn->timeout->conn == conn);
- timer_del(&timeouts, &conn->timeout->timer);
- conn->timeout->conn = NULL;
+ /* Re-initialize, for next time. */
+ list_node_init(&conn->always);
+ io_do_always(conn);
+ ret = true;
+ }
+ return ret;
}
/* This is the main loop. */
-void *io_loop(void)
+void *io_loop(struct timers *timers, struct timer **expired)
{
void *ret;
- while (!io_loop_return) {
- int i, r, timeout = INT_MAX;
- struct timespec now;
-
- if (timeouts.base) {
- struct timespec first;
- struct list_head expired;
- struct io_timeout *t;
+ /* if timers is NULL, expired must be. If not, not. */
+ assert(!timers == !expired);
- now = time_now();
+ /* Make sure this is NULL if we exit for some other reason. */
+ if (expired)
+ *expired = NULL;
- /* 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));
- }
+ while (!io_loop_return) {
+ int i, r, ms_timeout = -1;
- /* 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 (close_conns()) {
+ /* Could have started/finished more. */
+ continue;
}
- if (num_finished) {
- finish_conns();
+ if (handle_always()) {
/* Could have started/finished more. */
continue;
}
+ /* Everything closed? */
if (num_fds == 0)
break;
/* You can't tell them all to go to sleep! */
assert(num_waiting);
- r = poll(pollfds, num_fds, timeout);
+ if (timers) {
+ struct timemono now, first;
+
+ now = nowfn();
+
+ /* Call functions for expired timers. */
+ *expired = timers_expire(timers, now);
+ if (*expired)
+ break;
+
+ /* Now figure out how long to wait for the next one. */
+ if (timer_earliest(timers, &first)) {
+ uint64_t next;
+ next = time_to_msec(timemono_between(first, now));
+ if (next < INT_MAX)
+ ms_timeout = next;
+ else
+ ms_timeout = INT_MAX;
+ }
+ }
+
+ r = poll(pollfds, num_fds, ms_timeout);
if (r < 0)
break;
}
} else if (events & (POLLIN|POLLOUT)) {
r--;
- if (c->duplex) {
- int mask = c->duplex->plan.pollflag;
- if (events & mask) {
- ready(c->duplex);
- events &= ~mask;
- if (!(events&(POLLIN|POLLOUT)))
- continue;
- }
- }
- ready(c);
- } else if (events & POLLHUP) {
+ io_ready(c, events);
+ } else if (events & (POLLHUP|POLLNVAL|POLLERR)) {
r--;
- backend_set_state(c, io_close(c, NULL));
- if (c->duplex)
- backend_set_state(c->duplex,
- io_close(c->duplex,
- NULL));
+ errno = EBADF;
+ io_close(c);
}
}
}
- while (num_finished)
- finish_conns();
+ close_conns();
ret = io_loop_return;
io_loop_return = NULL;
+
return ret;
}