#endif
#include <sys/wait.h>
+struct uloop_fd_event {
+ struct uloop_fd *fd;
+ unsigned int events;
+};
+
+struct uloop_fd_stack {
+ struct uloop_fd_stack *next;
+ struct uloop_fd *fd;
+ unsigned int events;
+};
+
+static struct uloop_fd_stack *fd_stack = NULL;
+
#define ULOOP_MAX_EVENTS 10
static struct list_head timeouts = LIST_HEAD_INIT(timeouts);
bool uloop_cancelled = false;
bool uloop_handle_sigchld = true;
static bool do_sigchld = false;
+
+static struct uloop_fd_event cur_fds[ULOOP_MAX_EVENTS];
static int cur_fd, cur_nfds;
#ifdef USE_KQUEUE
return register_kevent(fd, flags);
}
-int uloop_fd_delete(struct uloop_fd *sock)
+static int __uloop_fd_delete(struct uloop_fd *fd)
{
- int i;
-
- for (i = cur_fd + 1; i < cur_nfds; i++) {
- if (events[i].udata != sock)
- continue;
-
- events[i].udata = NULL;
- }
-
- sock->registered = false;
- return register_poll(sock, 0);
+ return register_poll(fd, 0);
}
-static void uloop_run_events(int timeout)
+static int uloop_fetch_events(int timeout)
{
struct timespec ts;
int nfds, n;
}
nfds = kevent(poll_fd, NULL, 0, events, ARRAY_SIZE(events), timeout >= 0 ? &ts : NULL);
- for(n = 0; n < nfds; ++n)
- {
+ for (n = 0; n < nfds; n++) {
+ struct uloop_fd_event *cur = &cur_fds[n];
struct uloop_fd *u = events[n].udata;
unsigned int ev = 0;
+ cur->fd = u;
if (!u)
continue;
if (events[n].flags & EV_EOF)
u->eof = true;
else if (!ev)
- continue;
+ cur->fd = NULL;
- if (u->cb) {
- cur_fd = n;
- cur_nfds = nfds;
- u->cb(u, ev);
- if (u->flags & ULOOP_EDGE_DEFER) {
- u->flags &= ~ULOOP_EDGE_DEFER;
- register_kevent(u, u->flags);
- }
+ cur->events = ev;
+ if (u->flags & ULOOP_EDGE_DEFER) {
+ u->flags &= ~ULOOP_EDGE_DEFER;
+ u->flags |= ULOOP_EDGE_TRIGGER;
+ register_kevent(u, u->flags);
}
}
- cur_nfds = 0;
+ return nfds;
}
#endif
ev.data.fd = fd->fd;
ev.data.ptr = fd;
+ fd->flags = flags;
return epoll_ctl(poll_fd, op, fd->fd, &ev);
}
static struct epoll_event events[ULOOP_MAX_EVENTS];
-int uloop_fd_delete(struct uloop_fd *sock)
+static int __uloop_fd_delete(struct uloop_fd *sock)
{
- int i;
-
- for (i = cur_fd + 1; i < cur_nfds; i++) {
- if (events[i].data.ptr != sock)
- continue;
-
- events[i].data.ptr = NULL;
- }
- sock->registered = false;
+ sock->flags = 0;
return epoll_ctl(poll_fd, EPOLL_CTL_DEL, sock->fd, 0);
}
-static void uloop_run_events(int timeout)
+static int uloop_fetch_events(int timeout)
{
int n, nfds;
nfds = epoll_wait(poll_fd, events, ARRAY_SIZE(events), timeout);
- for(n = 0; n < nfds; ++n)
- {
+ for (n = 0; n < nfds; ++n) {
+ struct uloop_fd_event *cur = &cur_fds[n];
struct uloop_fd *u = events[n].data.ptr;
unsigned int ev = 0;
+ cur->fd = u;
if (!u)
continue;
- if(events[n].events & (EPOLLERR|EPOLLHUP)) {
+ if (events[n].events & (EPOLLERR|EPOLLHUP)) {
u->error = true;
uloop_fd_delete(u);
}
- if(!(events[n].events & (EPOLLRDHUP|EPOLLIN|EPOLLOUT|EPOLLERR|EPOLLHUP)))
+ if(!(events[n].events & (EPOLLRDHUP|EPOLLIN|EPOLLOUT|EPOLLERR|EPOLLHUP))) {
+ cur->fd = NULL;
continue;
+ }
if(events[n].events & EPOLLRDHUP)
u->eof = true;
if(events[n].events & EPOLLOUT)
ev |= ULOOP_WRITE;
- if(u->cb) {
- cur_fd = n;
- cur_nfds = nfds;
- u->cb(u, ev);
- }
+ cur->events = ev;
}
- cur_nfds = 0;
+
+ return nfds;
}
#endif
+static bool uloop_fd_stack_event(struct uloop_fd *fd, int events)
+{
+ struct uloop_fd_stack *cur;
+
+ /*
+ * Do not buffer events for level-triggered fds, they will keep firing.
+ * Caller needs to take care of recursion issues.
+ */
+ if (!(fd->flags & ULOOP_EDGE_TRIGGER))
+ return false;
+
+ for (cur = fd_stack; cur; cur = cur->next) {
+ if (cur->fd != fd)
+ continue;
+
+ if (events < 0)
+ cur->fd = NULL;
+ else
+ cur->events |= events | ULOOP_EVENT_BUFFERED;
+
+ return true;
+ }
+
+ return false;
+}
+
+static void uloop_run_events(int timeout)
+{
+ struct uloop_fd_event *cur;
+ struct uloop_fd *fd;
+
+ if (!cur_nfds) {
+ cur_fd = 0;
+ cur_nfds = uloop_fetch_events(timeout);
+ if (cur_nfds < 0)
+ cur_nfds = 0;
+ }
+
+ while (cur_nfds > 0) {
+ struct uloop_fd_stack stack_cur;
+ unsigned int events;
+
+ cur = &cur_fds[cur_fd++];
+ cur_nfds--;
+
+ fd = cur->fd;
+ events = cur->events;
+ if (!fd)
+ continue;
+
+ if (!fd->cb)
+ continue;
+
+ if (uloop_fd_stack_event(fd, cur->events))
+ continue;
+
+ stack_cur.next = fd_stack;
+ stack_cur.fd = fd;
+ fd_stack = &stack_cur;
+ do {
+ stack_cur.events = 0;
+ fd->cb(fd, events);
+ events = stack_cur.events & ULOOP_EVENT_MASK;
+ } while (stack_cur.fd && events);
+ fd_stack = stack_cur.next;
+
+ return;
+ }
+}
+
int uloop_fd_add(struct uloop_fd *sock, unsigned int flags)
{
unsigned int fl;
int ret;
+ if (!(flags & (ULOOP_READ | ULOOP_WRITE)))
+ return uloop_fd_delete(sock);
+
if (!sock->registered && !(flags & ULOOP_BLOCKING)) {
fl = fcntl(sock->fd, F_GETFL, 0);
fl |= O_NONBLOCK;
return ret;
}
+int uloop_fd_delete(struct uloop_fd *fd)
+{
+ int i;
+
+ for (i = 0; i < cur_nfds; i++) {
+ if (cur_fds[cur_fd + i].fd != fd)
+ continue;
+
+ cur_fds[cur_fd + i].fd = NULL;
+ }
+
+ if (!fd->registered)
+ return 0;
+
+ fd->registered = false;
+ uloop_fd_stack_event(fd, -1);
+ return __uloop_fd_delete(fd);
+}
+
static int tv_diff(struct timeval *t1, struct timeval *t2)
{
return
return 0;
}
+int uloop_timeout_remaining(struct uloop_timeout *timeout)
+{
+ struct timeval now;
+
+ if (!timeout->pending)
+ return -1;
+
+ uloop_gettime(&now);
+
+ return tv_diff(&timeout->time, &now);
+}
+
int uloop_process_add(struct uloop_process *p)
{
struct uloop_process *tmp;
do_sigchld = true;
}
-static void uloop_setup_signals(void)
+static void uloop_setup_signals(bool add)
{
+ static struct sigaction old_sigint, old_sigchld;
struct sigaction s;
memset(&s, 0, sizeof(struct sigaction));
- s.sa_handler = uloop_handle_sigint;
- s.sa_flags = 0;
- sigaction(SIGINT, &s, NULL);
- if (uloop_handle_sigchld) {
- s.sa_handler = uloop_sigchld;
- sigaction(SIGCHLD, &s, NULL);
+ if (add) {
+ s.sa_handler = uloop_handle_sigint;
+ s.sa_flags = 0;
+ } else {
+ s = old_sigint;
}
+
+ sigaction(SIGINT, &s, &old_sigint);
+
+ if (!uloop_handle_sigchld)
+ return;
+
+ if (add)
+ s.sa_handler = uloop_sigchld;
+ else
+ s = old_sigchld;
+
+ sigaction(SIGCHLD, &s, &old_sigchld);
}
static int uloop_get_next_timeout(struct timeval *tv)
void uloop_run(void)
{
+ static int recursive_calls = 0;
struct timeval tv;
- uloop_setup_signals();
+ /*
+ * Handlers are only updated for the first call to uloop_run() (and restored
+ * when this call is done).
+ */
+ if (!recursive_calls++)
+ uloop_setup_signals(true);
+
while(!uloop_cancelled)
{
uloop_gettime(&tv);
if (do_sigchld)
uloop_handle_processes();
+ uloop_gettime(&tv);
uloop_run_events(uloop_get_next_timeout(&tv));
}
+
+ if (!--recursive_calls)
+ uloop_setup_signals(false);
}
void uloop_done(void)