1 /* Licensed under LGPLv2.1+ - see LICENSE file for details */
8 #include <sys/socket.h>
11 #include <ccan/time/time.h>
12 #include <ccan/timer/timer.h>
14 static size_t num_fds = 0, max_fds = 0, num_waiting = 0, num_always = 0, max_always = 0;
15 static struct pollfd *pollfds = NULL;
16 static struct fd **fds = NULL;
17 static struct io_plan **always = NULL;
18 static struct timemono (*nowfn)(void) = time_mono;
19 static int (*pollfn)(struct pollfd *fds, nfds_t nfds, int timeout) = poll;
21 struct timemono (*io_time_override(struct timemono (*now)(void)))(void)
23 struct timemono (*old)(void) = nowfn;
28 int (*io_poll_override(int (*poll)(struct pollfd *fds, nfds_t nfds, int timeout)))(struct pollfd *, nfds_t, int)
30 int (*old)(struct pollfd *fds, nfds_t nfds, int timeout) = pollfn;
35 static bool add_fd(struct fd *fd, short events)
39 pollfds = tal_arr(NULL, struct pollfd, 8);
42 fds = tal_arr(pollfds, struct fd *, 8);
48 if (num_fds + 1 > max_fds) {
49 size_t num = max_fds * 2;
51 if (!tal_resize(&pollfds, num))
53 if (!tal_resize(&fds, num))
58 pollfds[num_fds].events = events;
59 /* In case it's idle. */
61 pollfds[num_fds].fd = -fd->fd - 1;
63 pollfds[num_fds].fd = fd->fd;
64 pollfds[num_fds].revents = 0; /* In case we're iterating now */
66 fd->backend_info = num_fds;
74 static void del_fd(struct fd *fd)
76 size_t n = fd->backend_info;
80 if (pollfds[n].events)
82 if (n != num_fds - 1) {
83 /* Move last one over us. */
84 pollfds[n] = pollfds[num_fds-1];
85 fds[n] = fds[num_fds-1];
86 assert(fds[n]->backend_info == num_fds-1);
87 fds[n]->backend_info = n;
88 } else if (num_fds == 1) {
89 /* Free everything when no more fds. */
90 pollfds = tal_free(pollfds);
95 fd->backend_info = -1;
98 static void destroy_listener(struct io_listener *l)
104 bool add_listener(struct io_listener *l)
106 if (!add_fd(&l->fd, POLLIN))
108 tal_add_destructor(l, destroy_listener);
112 static int find_always(const struct io_plan *plan)
114 for (size_t i = 0; i < num_always; i++)
115 if (always[i] == plan)
120 static void remove_from_always(const struct io_plan *plan)
124 if (plan->status != IO_ALWAYS)
127 pos = find_always(plan);
130 /* Move last one down if we made a hole */
131 if (pos != num_always-1)
132 always[pos] = always[num_always-1];
136 bool backend_new_always(struct io_plan *plan)
138 assert(find_always(plan) == -1);
141 assert(num_always == 0);
142 always = tal_arr(NULL, struct io_plan *, 8);
148 if (num_always + 1 > max_always) {
149 size_t num = max_always * 2;
151 if (!tal_resize(&always, num))
156 always[num_always++] = plan;
160 void backend_new_plan(struct io_conn *conn)
162 struct pollfd *pfd = &pollfds[conn->fd.backend_info];
168 if (conn->plan[IO_IN].status == IO_POLLING_NOTSTARTED
169 || conn->plan[IO_IN].status == IO_POLLING_STARTED)
170 pfd->events |= POLLIN;
171 if (conn->plan[IO_OUT].status == IO_POLLING_NOTSTARTED
172 || conn->plan[IO_OUT].status == IO_POLLING_STARTED)
173 pfd->events |= POLLOUT;
177 pfd->fd = conn->fd.fd;
179 pfd->fd = -conn->fd.fd - 1;
183 void backend_wake(const void *wait)
187 for (i = 0; i < num_fds; i++) {
190 /* Ignore listeners */
191 if (fds[i]->listener)
195 if (c->plan[IO_IN].status == IO_WAITING
196 && c->plan[IO_IN].arg.u1.const_vp == wait)
197 io_do_wakeup(c, IO_IN);
199 if (c->plan[IO_OUT].status == IO_WAITING
200 && c->plan[IO_OUT].arg.u1.const_vp == wait)
201 io_do_wakeup(c, IO_OUT);
205 static void destroy_conn(struct io_conn *conn, bool close_fd)
207 int saved_errno = errno;
213 remove_from_always(&conn->plan[IO_IN]);
214 remove_from_always(&conn->plan[IO_OUT]);
216 /* errno saved/restored by tal_free itself. */
219 conn->finish(conn, conn->finish_arg);
223 static void destroy_conn_close_fd(struct io_conn *conn)
225 destroy_conn(conn, true);
228 bool add_conn(struct io_conn *c)
230 if (!add_fd(&c->fd, 0))
232 tal_add_destructor(c, destroy_conn_close_fd);
236 void cleanup_conn_without_close(struct io_conn *conn)
238 tal_del_destructor(conn, destroy_conn_close_fd);
239 destroy_conn(conn, false);
242 static void accept_conn(struct io_listener *l)
244 int fd = accept(l->fd.fd, NULL, NULL);
246 /* FIXME: What to do here? */
250 io_new_conn(l->ctx, fd, l->init, l->arg);
253 static bool handle_always(void)
257 while (num_always > 0) {
258 /* Remove first: it might re-add */
259 struct io_plan *plan = always[num_always-1];
267 /* This is the main loop. */
268 void *io_loop(struct timers *timers, struct timer **expired)
272 /* if timers is NULL, expired must be. If not, not. */
273 assert(!timers == !expired);
275 /* Make sure this is NULL if we exit for some other reason. */
279 while (!io_loop_return) {
280 int i, r, ms_timeout = -1;
282 if (handle_always()) {
283 /* Could have started/finished more. */
287 /* Everything closed? */
291 /* You can't tell them all to go to sleep! */
295 struct timemono now, first;
299 /* Call functions for expired timers. */
300 *expired = timers_expire(timers, now);
304 /* Now figure out how long to wait for the next one. */
305 if (timer_earliest(timers, &first)) {
307 next = time_to_msec(timemono_between(first, now));
311 ms_timeout = INT_MAX;
315 r = pollfn(pollfds, num_fds, ms_timeout);
317 /* Signals shouldn't break us, unless they set
324 for (i = 0; i < num_fds && !io_loop_return; i++) {
325 struct io_conn *c = (void *)fds[i];
326 int events = pollfds[i].revents;
331 if (fds[i]->listener) {
332 struct io_listener *l = (void *)fds[i];
333 if (events & POLLIN) {
336 } else if (events & (POLLHUP|POLLNVAL|POLLERR)) {
339 io_close_listener(l);
341 } else if (events & (POLLIN|POLLOUT)) {
344 } else if (events & (POLLHUP|POLLNVAL|POLLERR)) {
352 ret = io_loop_return;
353 io_loop_return = NULL;