2 * Copyright (C) 2010 Felix Fietkau <nbd@openwrt.org>
3 * Copyright (C) 2010 John Crispin <blogic@openwrt.org>
4 * Copyright (C) 2010 Steven Barth <steven@midlink.org>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
23 #include <sys/types.h>
38 #include <sys/event.h>
41 #include <sys/epoll.h>
45 #define ULOOP_MAX_EVENTS 10
47 static struct list_head timeouts = LIST_HEAD_INIT(timeouts);
48 static struct list_head processes = LIST_HEAD_INIT(processes);
50 static int poll_fd = -1;
51 bool uloop_cancelled = false;
52 bool uloop_handle_sigchld = true;
53 static bool do_sigchld = false;
54 static int cur_fd, cur_nfds;
71 static uint16_t get_flags(unsigned int flags, unsigned int mask)
79 if (flags & ULOOP_EDGE_TRIGGER)
85 static struct kevent events[ULOOP_MAX_EVENTS];
87 static int register_poll(struct uloop_fd *fd, unsigned int flags)
89 struct timespec timeout = { 0, 0 };
95 kflags = get_flags(flags, ULOOP_READ);
96 EV_SET(&ev[nev++], fd->fd, EVFILT_READ, kflags, 0, 0, fd);
98 kflags = get_flags(flags, ULOOP_WRITE);
99 EV_SET(&ev[nev++], fd->fd, EVFILT_WRITE, kflags, 0, 0, fd);
104 if (nev && (kevent(poll_fd, ev, nev, NULL, fl, &timeout) == -1))
110 int uloop_fd_delete(struct uloop_fd *sock)
114 for (i = cur_fd + 1; i < cur_nfds; i++) {
115 if (events[i].udata != sock)
118 events[i].udata = NULL;
121 sock->registered = false;
122 return register_poll(sock, 0);
125 static void uloop_run_events(int timeout)
131 ts.tv_sec = timeout / 1000;
132 ts.tv_nsec = (timeout % 1000) * 1000000;
135 nfds = kevent(poll_fd, NULL, 0, events, ARRAY_SIZE(events), timeout >= 0 ? &ts : NULL);
136 for(n = 0; n < nfds; ++n)
138 struct uloop_fd *u = events[n].udata;
144 if (events[n].flags & EV_ERROR) {
149 if(events[n].filter == EVFILT_READ)
151 else if (events[n].filter == EVFILT_WRITE)
154 if (events[n].flags & EV_EOF)
173 * FIXME: uClibc < 0.9.30.3 does not define EPOLLRDHUP for Linux >= 2.6.17
176 #define EPOLLRDHUP 0x2000
184 poll_fd = epoll_create(32);
188 fcntl(poll_fd, F_SETFD, fcntl(poll_fd, F_GETFD) | FD_CLOEXEC);
192 static int register_poll(struct uloop_fd *fd, unsigned int flags)
194 struct epoll_event ev;
195 int op = fd->registered ? EPOLL_CTL_MOD : EPOLL_CTL_ADD;
197 memset(&ev, 0, sizeof(struct epoll_event));
199 if (flags & ULOOP_READ)
200 ev.events |= EPOLLIN | EPOLLRDHUP;
202 if (flags & ULOOP_WRITE)
203 ev.events |= EPOLLOUT;
205 if (flags & ULOOP_EDGE_TRIGGER)
206 ev.events |= EPOLLET;
211 return epoll_ctl(poll_fd, op, fd->fd, &ev);
214 static struct epoll_event events[ULOOP_MAX_EVENTS];
216 int uloop_fd_delete(struct uloop_fd *sock)
220 for (i = cur_fd + 1; i < cur_nfds; i++) {
221 if (events[i].data.ptr != sock)
224 events[i].data.ptr = NULL;
226 sock->registered = false;
227 return epoll_ctl(poll_fd, EPOLL_CTL_DEL, sock->fd, 0);
230 static void uloop_run_events(int timeout)
234 nfds = epoll_wait(poll_fd, events, ARRAY_SIZE(events), timeout);
235 for(n = 0; n < nfds; ++n)
237 struct uloop_fd *u = events[n].data.ptr;
243 if(events[n].events & (EPOLLERR|EPOLLHUP)) {
248 if(!(events[n].events & (EPOLLRDHUP|EPOLLIN|EPOLLOUT|EPOLLERR|EPOLLHUP)))
251 if(events[n].events & EPOLLRDHUP)
254 if(events[n].events & EPOLLIN)
257 if(events[n].events & EPOLLOUT)
271 int uloop_fd_add(struct uloop_fd *sock, unsigned int flags)
276 if (!sock->registered && !(flags & ULOOP_BLOCKING)) {
277 fl = fcntl(sock->fd, F_GETFL, 0);
279 fcntl(sock->fd, F_SETFL, fl);
282 ret = register_poll(sock, flags);
286 sock->registered = true;
293 static int tv_diff(struct timeval *t1, struct timeval *t2)
296 (t1->tv_sec - t2->tv_sec) * 1000 +
297 (t1->tv_usec - t2->tv_usec) / 1000;
300 int uloop_timeout_add(struct uloop_timeout *timeout)
302 struct uloop_timeout *tmp;
303 struct list_head *h = &timeouts;
305 if (timeout->pending)
308 list_for_each_entry(tmp, &timeouts, list) {
309 if (tv_diff(&tmp->time, &timeout->time) > 0) {
315 list_add_tail(&timeout->list, h);
316 timeout->pending = true;
321 int uloop_timeout_set(struct uloop_timeout *timeout, int msecs)
323 struct timeval *time = &timeout->time;
325 if (timeout->pending)
326 uloop_timeout_cancel(timeout);
328 gettimeofday(&timeout->time, NULL);
330 time->tv_sec += msecs / 1000;
331 time->tv_usec += (msecs % 1000) * 1000;
333 if (time->tv_usec > 1000000) {
335 time->tv_usec %= 1000000;
338 return uloop_timeout_add(timeout);
341 int uloop_timeout_cancel(struct uloop_timeout *timeout)
343 if (!timeout->pending)
346 list_del(&timeout->list);
347 timeout->pending = false;
352 int uloop_process_add(struct uloop_process *p)
354 struct uloop_process *tmp;
355 struct list_head *h = &processes;
360 list_for_each_entry(tmp, &processes, list) {
361 if (tmp->pid > p->pid) {
367 list_add_tail(&p->list, h);
373 int uloop_process_delete(struct uloop_process *p)
384 static void uloop_handle_processes(void)
386 struct uloop_process *p, *tmp;
393 pid = waitpid(-1, &ret, WNOHANG);
397 list_for_each_entry_safe(p, tmp, &processes, list) {
404 uloop_process_delete(p);
411 static void uloop_handle_sigint(int signo)
413 uloop_cancelled = true;
416 static void uloop_sigchld(int signo)
421 static void uloop_setup_signals(void)
425 memset(&s, 0, sizeof(struct sigaction));
426 s.sa_handler = uloop_handle_sigint;
428 sigaction(SIGINT, &s, NULL);
430 if (uloop_handle_sigchld) {
431 s.sa_handler = uloop_sigchld;
432 sigaction(SIGCHLD, &s, NULL);
436 static int uloop_get_next_timeout(struct timeval *tv)
438 struct uloop_timeout *timeout;
441 if (list_empty(&timeouts))
444 timeout = list_first_entry(&timeouts, struct uloop_timeout, list);
445 diff = tv_diff(&timeout->time, tv);
452 static void uloop_process_timeouts(struct timeval *tv)
454 struct uloop_timeout *t;
456 while (!list_empty(&timeouts)) {
457 t = list_first_entry(&timeouts, struct uloop_timeout, list);
459 if (tv_diff(&t->time, tv) > 0)
462 uloop_timeout_cancel(t);
468 static void uloop_clear_timeouts(void)
470 struct uloop_timeout *t, *tmp;
472 list_for_each_entry_safe(t, tmp, &timeouts, list)
473 uloop_timeout_cancel(t);
476 static void uloop_clear_processes(void)
478 struct uloop_process *p, *tmp;
480 list_for_each_entry_safe(p, tmp, &processes, list)
481 uloop_process_delete(p);
488 uloop_setup_signals();
489 while(!uloop_cancelled)
491 gettimeofday(&tv, NULL);
492 uloop_process_timeouts(&tv);
497 uloop_handle_processes();
498 uloop_run_events(uloop_get_next_timeout(&tv));
502 void uloop_done(void)
510 uloop_clear_timeouts();
511 uloop_clear_processes();