| 1 |
root |
1.5 |
/* |
| 2 |
root |
1.9 |
* libev epoll fd activity backend |
| 3 |
|
|
* |
| 4 |
root |
1.5 |
* Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
| 5 |
|
|
* All rights reserved. |
| 6 |
|
|
* |
| 7 |
|
|
* Redistribution and use in source and binary forms, with or without |
| 8 |
|
|
* modification, are permitted provided that the following conditions are |
| 9 |
|
|
* met: |
| 10 |
|
|
* |
| 11 |
|
|
* * Redistributions of source code must retain the above copyright |
| 12 |
|
|
* notice, this list of conditions and the following disclaimer. |
| 13 |
|
|
* |
| 14 |
|
|
* * Redistributions in binary form must reproduce the above |
| 15 |
|
|
* copyright notice, this list of conditions and the following |
| 16 |
|
|
* disclaimer in the documentation and/or other materials provided |
| 17 |
|
|
* with the distribution. |
| 18 |
|
|
* |
| 19 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 20 |
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 21 |
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 22 |
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 23 |
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 24 |
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 25 |
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 26 |
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 27 |
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 28 |
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 29 |
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 30 |
|
|
*/ |
| 31 |
|
|
|
| 32 |
root |
1.1 |
#include <sys/epoll.h> |
| 33 |
|
|
|
| 34 |
|
|
static void |
| 35 |
root |
1.13 |
epoll_modify (EV_P_ int fd, int oev, int nev) |
| 36 |
root |
1.1 |
{ |
| 37 |
root |
1.2 |
int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; |
| 38 |
root |
1.1 |
|
| 39 |
root |
1.2 |
struct epoll_event ev; |
| 40 |
root |
1.11 |
ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */ |
| 41 |
root |
1.2 |
ev.events = |
| 42 |
|
|
(nev & EV_READ ? EPOLLIN : 0) |
| 43 |
|
|
| (nev & EV_WRITE ? EPOLLOUT : 0); |
| 44 |
|
|
|
| 45 |
root |
1.18 |
if (epoll_ctl (epoll_fd, mode, fd, &ev)) |
| 46 |
root |
1.19 |
if (errno != ENOENT /* on ENOENT the fd went away, so try to do the right thing */ |
| 47 |
|
|
|| (nev && epoll_ctl (epoll_fd, EPOLL_CTL_ADD, fd, &ev))) |
| 48 |
|
|
fd_kill (EV_A_ fd); |
| 49 |
root |
1.1 |
} |
| 50 |
|
|
|
| 51 |
root |
1.6 |
static void |
| 52 |
root |
1.13 |
epoll_poll (EV_P_ ev_tstamp timeout) |
| 53 |
root |
1.1 |
{ |
| 54 |
root |
1.20 |
int i; |
| 55 |
root |
1.14 |
int eventcnt = epoll_wait (epoll_fd, epoll_events, epoll_eventmax, ceil (timeout * 1000.)); |
| 56 |
root |
1.1 |
|
| 57 |
|
|
if (eventcnt < 0) |
| 58 |
root |
1.20 |
{ |
| 59 |
|
|
if (errno != EINTR) |
| 60 |
root |
1.21 |
syserr ("(libev) epoll_wait"); |
| 61 |
root |
1.20 |
|
| 62 |
|
|
return; |
| 63 |
|
|
} |
| 64 |
root |
1.1 |
|
| 65 |
|
|
for (i = 0; i < eventcnt; ++i) |
| 66 |
|
|
fd_event ( |
| 67 |
root |
1.13 |
EV_A_ |
| 68 |
root |
1.14 |
epoll_events [i].data.u64, |
| 69 |
|
|
(epoll_events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
| 70 |
|
|
| (epoll_events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
| 71 |
root |
1.1 |
); |
| 72 |
|
|
|
| 73 |
|
|
/* if the receive array was full, increase its size */ |
| 74 |
root |
1.14 |
if (expect_false (eventcnt == epoll_eventmax)) |
| 75 |
root |
1.1 |
{ |
| 76 |
root |
1.20 |
ev_free (epoll_events); |
| 77 |
root |
1.14 |
epoll_eventmax = array_roundsize (epoll_events, epoll_eventmax << 1); |
| 78 |
root |
1.20 |
epoll_events = ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
| 79 |
root |
1.1 |
} |
| 80 |
|
|
} |
| 81 |
|
|
|
| 82 |
root |
1.13 |
static int |
| 83 |
|
|
epoll_init (EV_P_ int flags) |
| 84 |
root |
1.1 |
{ |
| 85 |
|
|
epoll_fd = epoll_create (256); |
| 86 |
|
|
|
| 87 |
|
|
if (epoll_fd < 0) |
| 88 |
root |
1.13 |
return 0; |
| 89 |
root |
1.3 |
|
| 90 |
|
|
fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
| 91 |
root |
1.1 |
|
| 92 |
root |
1.2 |
method_fudge = 1e-3; /* needed to compensate for epoll returning early */ |
| 93 |
|
|
method_modify = epoll_modify; |
| 94 |
|
|
method_poll = epoll_poll; |
| 95 |
root |
1.1 |
|
| 96 |
root |
1.14 |
epoll_eventmax = 64; /* intiial number of events receivable per poll */ |
| 97 |
root |
1.20 |
epoll_events = ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
| 98 |
root |
1.13 |
|
| 99 |
|
|
return EVMETHOD_EPOLL; |
| 100 |
root |
1.1 |
} |
| 101 |
root |
1.6 |
|
| 102 |
root |
1.15 |
static void |
| 103 |
|
|
epoll_destroy (EV_P) |
| 104 |
|
|
{ |
| 105 |
|
|
close (epoll_fd); |
| 106 |
|
|
|
| 107 |
root |
1.20 |
ev_free (epoll_events); |
| 108 |
root |
1.15 |
} |
| 109 |
|
|
|
| 110 |
|
|
static void |
| 111 |
|
|
epoll_fork (EV_P) |
| 112 |
|
|
{ |
| 113 |
root |
1.22 |
close (epoll_fd); |
| 114 |
root |
1.21 |
|
| 115 |
root |
1.22 |
while ((epoll_fd = epoll_create (256)) < 0) |
| 116 |
|
|
syserr ("(libev) epoll_create"); |
| 117 |
root |
1.21 |
|
| 118 |
root |
1.15 |
fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
| 119 |
|
|
|
| 120 |
root |
1.16 |
fd_rearm_all (EV_A); |
| 121 |
root |
1.15 |
} |
| 122 |
|
|
|