1 /* Licensed under LGPLv2.1+ - see LICENSE file for details */
8 #include <sys/socket.h>
11 #include <ccan/list/list.h>
12 #include <ccan/time/time.h>
13 #include <ccan/timer/timer.h>
15 static size_t num_fds = 0, max_fds = 0, num_waiting = 0;
16 static struct pollfd *pollfds = NULL;
17 static struct fd **fds = NULL;
18 static struct io_conn *closing = NULL, *always = NULL;
20 static bool add_fd(struct fd *fd, short events)
24 pollfds = tal_arr(NULL, struct pollfd, 8);
27 fds = tal_arr(pollfds, struct fd *, 8);
33 if (num_fds + 1 > max_fds) {
34 size_t num = max_fds * 2;
36 if (!tal_resize(&pollfds, num))
38 if (!tal_resize(&fds, num))
43 pollfds[num_fds].events = events;
44 /* In case it's idle. */
46 pollfds[num_fds].fd = -fd->fd;
48 pollfds[num_fds].fd = fd->fd;
49 pollfds[num_fds].revents = 0; /* In case we're iterating now */
51 fd->backend_info = num_fds;
59 static void del_fd(struct fd *fd)
61 size_t n = fd->backend_info;
65 if (pollfds[n].events)
67 if (n != num_fds - 1) {
68 /* Move last one over us. */
69 pollfds[n] = pollfds[num_fds-1];
70 fds[n] = fds[num_fds-1];
71 assert(fds[n]->backend_info == num_fds-1);
72 fds[n]->backend_info = n;
73 } else if (num_fds == 1) {
74 /* Free everything when no more fds. */
75 pollfds = tal_free(pollfds);
80 fd->backend_info = -1;
84 bool add_listener(struct io_listener *l)
86 if (!add_fd(&l->fd, POLLIN))
91 void remove_from_always(struct io_conn *conn)
93 struct io_conn **p = &always;
101 void backend_new_closing(struct io_conn *conn)
103 /* Already on always list? Remove it. */
105 remove_from_always(conn);
107 conn->list = closing;
111 void backend_new_always(struct io_conn *conn)
113 /* May already be in always list (other plan), or closing. */
120 void backend_new_plan(struct io_conn *conn)
122 struct pollfd *pfd = &pollfds[conn->fd.backend_info];
128 if (conn->plan[IO_IN].status == IO_POLLING)
129 pfd->events |= POLLIN;
130 if (conn->plan[IO_OUT].status == IO_POLLING)
131 pfd->events |= POLLOUT;
135 pfd->fd = conn->fd.fd;
137 pfd->fd = -conn->fd.fd;
141 void backend_wake(const void *wait)
145 for (i = 0; i < num_fds; i++) {
148 /* Ignore listeners */
149 if (fds[i]->listener)
153 if (c->plan[IO_IN].status == IO_WAITING
154 && c->plan[IO_IN].arg.u1.const_vp == wait)
155 io_do_wakeup(c, &c->plan[IO_IN]);
157 if (c->plan[IO_OUT].status == IO_WAITING
158 && c->plan[IO_OUT].arg.u1.const_vp == wait)
159 io_do_wakeup(c, &c->plan[IO_OUT]);
163 bool add_conn(struct io_conn *c)
165 return add_fd(&c->fd, 0);
168 static void del_conn(struct io_conn *conn)
172 /* Saved by io_close */
173 errno = conn->plan[IO_IN].arg.u1.s;
174 conn->finish(conn, conn->finish_arg);
179 void del_listener(struct io_listener *l)
184 static void accept_conn(struct io_listener *l)
186 int fd = accept(l->fd.fd, NULL, NULL);
188 /* FIXME: What to do here? */
192 io_new_conn(l->ctx, fd, l->init, l->arg);
195 /* It's OK to miss some, as long as we make progress. */
196 static bool close_conns(void)
201 struct io_conn *conn = closing;
203 assert(conn->plan[IO_IN].status == IO_CLOSING);
204 assert(conn->plan[IO_OUT].status == IO_CLOSING);
206 closing = closing->list;
213 static bool handle_always(void)
218 struct io_conn *conn = always;
220 assert(conn->plan[IO_IN].status == IO_ALWAYS
221 || conn->plan[IO_OUT].status == IO_ALWAYS);
223 /* Remove from list, and mark it so it knows that. */
224 always = always->list;
232 /* This is the main loop. */
233 void *io_loop(struct timers *timers, struct list_head *expired)
237 /* if timers is NULL, expired must be. If not, not. */
238 assert(!timers == !expired);
240 /* Make sure this is empty if we exit for some other reason. */
242 list_head_init(expired);
244 while (!io_loop_return) {
245 int i, r, ms_timeout = -1;
248 /* Could have started/finished more. */
252 if (handle_always()) {
253 /* Could have started/finished more. */
257 /* Everything closed? */
261 /* You can't tell them all to go to sleep! */
265 struct timeabs now, first;
269 /* Call functions for expired timers. */
270 timers_expire(timers, now, expired);
271 if (!list_empty(expired))
274 /* Now figure out how long to wait for the next one. */
275 if (timer_earliest(timers, &first)) {
277 next = time_to_msec(time_between(first, now));
281 ms_timeout = INT_MAX;
285 r = poll(pollfds, num_fds, ms_timeout);
289 for (i = 0; i < num_fds && !io_loop_return; i++) {
290 struct io_conn *c = (void *)fds[i];
291 int events = pollfds[i].revents;
296 if (fds[i]->listener) {
297 if (events & POLLIN) {
298 accept_conn((void *)c);
301 } else if (events & (POLLIN|POLLOUT)) {
304 } else if (events & (POLLHUP|POLLNVAL|POLLERR)) {
314 ret = io_loop_return;
315 io_loop_return = NULL;