2 * libev epoll fd activity backend
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met:
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL.
41 * general notes about epoll:
43 * a) epoll silently removes fds from the fd set. as nothing tells us
44 * that an fd has been removed otherwise, we have to continually
45 * "rearm" fds that we suspect *might* have changed (same
46 * problem with kqueue, but much less costly there).
47 * b) the fact that ADD != MOD creates a lot of extra syscalls due to a)
48 * and seems not to have any advantage.
49 * c) the inability to handle fork or file descriptors (think dup)
50 * limits the applicability over poll, so this is not a generic
53 * lots of "weird code" and complication handling in this file is due
54 * to these design problems with epoll, as we try very hard to avoid
55 * epoll_ctl syscalls for common usage patterns.
58 #include <sys/epoll.h>
61 epoll_modify (EV_P_ int fd, int oev, int nev)
63 struct epoll_event ev;
66 * we handle EPOLL_CTL_DEL by ignoring it here
67 * on the assumption that the fd is gone anyways
68 * if that is wrong, we have to handle the spurious
69 * event in epoll_poll.
74 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
75 ev.events = (nev & EV_READ ? EPOLLIN : 0)
76 | (nev & EV_WRITE ? EPOLLOUT : 0);
78 if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
81 if (expect_true (errno == ENOENT))
83 /* on ENOENT the fd went away, so try to do the right thing */
87 if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev))
90 else if (expect_true (errno == EEXIST))
92 /* on EEXIST we ignored a previous DEL */
93 if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev))
101 epoll_poll (EV_P_ ev_tstamp timeout)
104 int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));
106 if (expect_false (eventcnt < 0))
109 syserr ("(libev) epoll_wait");
114 for (i = 0; i < eventcnt; ++i)
116 struct epoll_event *ev = epoll_events + i;
118 int fd = ev->data.u64;
119 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
120 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0);
121 int want = anfds [fd].events;
123 if (expect_false (got & ~want))
125 /* we received an event but are not interested in it, try mod or del */
126 ev->events = (want & EV_READ ? EPOLLIN : 0)
127 | (want & EV_WRITE ? EPOLLOUT : 0);
129 epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev);
132 fd_event (EV_A_ fd, got);
135 /* if the receive array was full, increase its size */
136 if (expect_false (eventcnt == epoll_eventmax))
138 ev_free (epoll_events);
139 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
140 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
145 epoll_init (EV_P_ int flags)
147 backend_fd = epoll_create (256);
152 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
154 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
155 backend_modify = epoll_modify;
156 backend_poll = epoll_poll;
158 epoll_eventmax = 64; /* intiial number of events receivable per poll */
159 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
161 return EVBACKEND_EPOLL;
167 ev_free (epoll_events);
175 while ((backend_fd = epoll_create (256)) < 0)
176 syserr ("(libev) epoll_create");
178 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);