ccan/ccan/io/poll.c

/* Licensed under LGPLv2.1+ - see LICENSE file for details */
#include "io.h"
#include "backend.h"
#include <assert.h>
#include <poll.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <limits.h>
#include <errno.h>
#include <ccan/list/list.h>
#include <ccan/time/time.h>
#include <ccan/timer/timer.h>

static size_t num_fds = 0, max_fds = 0, num_waiting = 0;
static struct pollfd *pollfds = NULL;
static struct fd **fds = NULL;
static struct io_conn *closing = NULL, *always = NULL;

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) {
		size_t num = max_fds * 2;

		if (!tal_resize(&pollfds, num))
			return false;
		if (!tal_resize(&fds, num))
			return false;
		max_fds = num;
	}

	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;
	num_fds++;
	if (events)
		num_waiting++;

	return true;
}

static void del_fd(struct fd *fd)
{
	size_t n = fd->backend_info;

	assert(n != -1);
	assert(n < num_fds);
	if (pollfds[n].events)
		num_waiting--;
	if (n != num_fds - 1) {
		/* Move last one over us. */
		pollfds[n] = pollfds[num_fds-1];
		fds[n] = fds[num_fds-1];
		assert(fds[n]->backend_info == num_fds-1);
		fds[n]->backend_info = n;
	} else if (num_fds == 1) {
		/* Free everything when no more fds. */
		pollfds = tal_free(pollfds);
		fds = NULL;
		max_fds = 0;
	}
	num_fds--;
	fd->backend_info = -1;
	close(fd->fd);
}

bool add_listener(struct io_listener *l)
{
	if (!add_fd(&l->fd, POLLIN))
		return false;
	return true;
}

void backend_new_closing(struct io_conn *conn)
{
	/* Already on always list?  Remove it. */
	if (conn->list) {
		struct io_conn **p = &always;

		while (*p != conn)
			p = &(*p)->list;

		*p = conn->list;
	}

	conn->list = closing;
	closing = conn;
}

void backend_new_always(struct io_conn *conn)
{
	/* May already be in always list (other plan), or closing. */
	if (!conn->list) {
		conn->list = always;
		always = conn;
	}
}

void backend_new_plan(struct io_conn *conn)
{
	struct pollfd *pfd = &pollfds[conn->fd.backend_info];

	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;

	if (pfd->events) {
		num_waiting++;
		pfd->fd = conn->fd.fd;
	} else {
		pfd->fd = -conn->fd.fd;
	}
}

void backend_wake(const void *wait)
{
	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].u1.const_vp == wait)
			io_do_wakeup(c, &c->plan[IO_IN]);

		if (c->plan[IO_OUT].status == IO_WAITING
		    && c->plan[IO_OUT].u1.const_vp == wait)
			io_do_wakeup(c, &c->plan[IO_OUT]);
	}
}

bool add_conn(struct io_conn *c)
{
	return add_fd(&c->fd, 0);
}

static void del_conn(struct io_conn *conn)
{
	del_fd(&conn->fd);
	if (conn->finish) {
		/* Saved by io_close */
		errno = conn->plan[IO_IN].u1.s;
		conn->finish(conn, conn->finish_arg);
	}
	tal_free(conn);
}

void del_listener(struct io_listener *l)
{
	del_fd(&l->fd);
}

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;

	io_new_conn(l->ctx, fd, l->init, l->arg);
}

/* It's OK to miss some, as long as we make progress. */
static bool close_conns(void)
{
	bool ret = false;

	while (closing) {
		struct io_conn *conn = closing;

		assert(conn->plan[IO_IN].status == IO_CLOSING);
		assert(conn->plan[IO_OUT].status == IO_CLOSING);

		closing = closing->list;
		del_conn(conn);
		ret = true;
	}
	return ret;
}

static bool handle_always(void)
{
	bool ret = false;

	while (always) {
		struct io_conn *conn = always;

		assert(conn->plan[IO_IN].status == IO_ALWAYS
		       || conn->plan[IO_OUT].status == IO_ALWAYS);

		/* Remove from list, and mark it so it knows that. */
		always = always->list;
		conn->list = NULL;
		io_do_always(conn);
		ret = true;
	}
	return ret;
}

/* This is the main loop. */
void *io_loop(struct timers *timers, struct list_head *expired)
{
	void *ret;

	/* if timers is NULL, expired must be.  If not, not. */
	assert(!timers == !expired);

	/* Make sure this is empty if we exit for some other reason. */
	if (expired)
		list_head_init(expired);

	while (!io_loop_return) {
		int i, r, ms_timeout = -1;

		if (close_conns()) {
			/* Could have started/finished more. */
			continue;
		}

		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);

		if (timers) {
			struct timeabs now, first;

			now = time_now();

			/* Call functions for expired timers. */
			timers_expire(timers, now, expired);
			if (!list_empty(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(time_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;

		for (i = 0; i < num_fds && !io_loop_return; i++) {
			struct io_conn *c = (void *)fds[i];
			int events = pollfds[i].revents;

			if (r == 0)
				break;

			if (fds[i]->listener) {
				if (events & POLLIN) {
					accept_conn((void *)c);
					r--;
				}
			} else if (events & (POLLIN|POLLOUT)) {
				r--;
				io_ready(c, events);
			} else if (events & (POLLHUP|POLLNVAL|POLLERR)) {
				r--;
				errno = EBADF;
				io_close(c);
			}
		}
	}

	close_conns();

	ret = io_loop_return;
	io_loop_return = NULL;

	return ret;
}