1 |
root |
1.5 |
/* |
2 |
root |
1.9 |
* libev epoll fd activity backend |
3 |
|
|
* |
4 |
root |
1.34 |
* Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de> |
5 |
root |
1.5 |
* All rights reserved. |
6 |
|
|
* |
7 |
root |
1.33 |
* Redistribution and use in source and binary forms, with or without modifica- |
8 |
|
|
* tion, are permitted provided that the following conditions are met: |
9 |
|
|
* |
10 |
|
|
* 1. Redistributions of source code must retain the above copyright notice, |
11 |
|
|
* this list of conditions and the following disclaimer. |
12 |
|
|
* |
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. |
16 |
|
|
* |
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. |
27 |
root |
1.5 |
* |
28 |
root |
1.33 |
* 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. |
38 |
root |
1.5 |
*/ |
39 |
|
|
|
40 |
root |
1.32 |
/* |
41 |
|
|
* general notes about epoll: |
42 |
|
|
* |
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 |
51 |
|
|
* poll replacement. |
52 |
|
|
* |
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 |
root |
1.37 |
* epoll_ctl syscalls for common usage patterns and handle the breakage |
56 |
|
|
* ensuing from receiving events for closed and otherwise long gone |
57 |
|
|
* file descriptors. |
58 |
root |
1.32 |
*/ |
59 |
|
|
|
60 |
root |
1.1 |
#include <sys/epoll.h> |
61 |
|
|
|
62 |
|
|
static void |
63 |
root |
1.13 |
epoll_modify (EV_P_ int fd, int oev, int nev) |
64 |
root |
1.1 |
{ |
65 |
root |
1.32 |
struct epoll_event ev; |
66 |
root |
1.35 |
unsigned char oldmask; |
67 |
root |
1.32 |
|
68 |
|
|
/* |
69 |
|
|
* we handle EPOLL_CTL_DEL by ignoring it here |
70 |
|
|
* on the assumption that the fd is gone anyways |
71 |
|
|
* if that is wrong, we have to handle the spurious |
72 |
|
|
* event in epoll_poll. |
73 |
root |
1.43 |
* if the fd is added again, we try to ADD it, and, if that |
74 |
root |
1.35 |
* fails, we assume it still has the same eventmask. |
75 |
root |
1.32 |
*/ |
76 |
|
|
if (!nev) |
77 |
|
|
return; |
78 |
root |
1.1 |
|
79 |
root |
1.35 |
oldmask = anfds [fd].emask; |
80 |
|
|
anfds [fd].emask = nev; |
81 |
|
|
|
82 |
root |
1.42 |
/* store the generation counter in the upper 32 bits, the fd in the lower 32 bits */ |
83 |
|
|
ev.data.u64 = (uint64_t)(uint32_t)fd |
84 |
|
|
| ((uint64_t)(uint32_t)++anfds [fd].egen << 32); |
85 |
root |
1.32 |
ev.events = (nev & EV_READ ? EPOLLIN : 0) |
86 |
|
|
| (nev & EV_WRITE ? EPOLLOUT : 0); |
87 |
|
|
|
88 |
|
|
if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) |
89 |
|
|
return; |
90 |
|
|
|
91 |
|
|
if (expect_true (errno == ENOENT)) |
92 |
|
|
{ |
93 |
root |
1.35 |
/* if ENOENT then the fd went away, so try to do the right thing */ |
94 |
root |
1.32 |
if (!nev) |
95 |
root |
1.36 |
goto dec_egen; |
96 |
root |
1.32 |
|
97 |
|
|
if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev)) |
98 |
|
|
return; |
99 |
|
|
} |
100 |
|
|
else if (expect_true (errno == EEXIST)) |
101 |
|
|
{ |
102 |
root |
1.35 |
/* EEXIST means we ignored a previous DEL, but the fd is still active */ |
103 |
|
|
/* if the kernel mask is the same as the new mask, we assume it hasn't changed */ |
104 |
root |
1.36 |
if (oldmask == nev) |
105 |
|
|
goto dec_egen; |
106 |
|
|
|
107 |
|
|
if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev)) |
108 |
root |
1.32 |
return; |
109 |
|
|
} |
110 |
|
|
|
111 |
|
|
fd_kill (EV_A_ fd); |
112 |
root |
1.36 |
|
113 |
|
|
dec_egen: |
114 |
|
|
/* we didn't successfully call epoll_ctl, so decrement the generation counter again */ |
115 |
|
|
--anfds [fd].egen; |
116 |
root |
1.1 |
} |
117 |
|
|
|
118 |
root |
1.6 |
static void |
119 |
root |
1.13 |
epoll_poll (EV_P_ ev_tstamp timeout) |
120 |
root |
1.1 |
{ |
121 |
root |
1.20 |
int i; |
122 |
root |
1.26 |
int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); |
123 |
root |
1.1 |
|
124 |
root |
1.29 |
if (expect_false (eventcnt < 0)) |
125 |
root |
1.20 |
{ |
126 |
|
|
if (errno != EINTR) |
127 |
root |
1.38 |
ev_syserr ("(libev) epoll_wait"); |
128 |
root |
1.20 |
|
129 |
|
|
return; |
130 |
|
|
} |
131 |
root |
1.1 |
|
132 |
|
|
for (i = 0; i < eventcnt; ++i) |
133 |
root |
1.32 |
{ |
134 |
|
|
struct epoll_event *ev = epoll_events + i; |
135 |
|
|
|
136 |
root |
1.37 |
int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */ |
137 |
|
|
int want = anfds [fd].events; |
138 |
root |
1.32 |
int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
139 |
|
|
| (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); |
140 |
|
|
|
141 |
root |
1.37 |
/* check for spurious notification */ |
142 |
root |
1.40 |
if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) |
143 |
root |
1.37 |
{ |
144 |
|
|
/* recreate kernel state */ |
145 |
|
|
postfork = 1; |
146 |
|
|
continue; |
147 |
|
|
} |
148 |
root |
1.36 |
|
149 |
root |
1.32 |
if (expect_false (got & ~want)) |
150 |
|
|
{ |
151 |
root |
1.35 |
anfds [fd].emask = want; |
152 |
|
|
|
153 |
root |
1.32 |
/* we received an event but are not interested in it, try mod or del */ |
154 |
root |
1.35 |
/* I don't think we ever need MOD, but let's handle it anyways */ |
155 |
root |
1.32 |
ev->events = (want & EV_READ ? EPOLLIN : 0) |
156 |
|
|
| (want & EV_WRITE ? EPOLLOUT : 0); |
157 |
|
|
|
158 |
root |
1.37 |
if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) |
159 |
|
|
{ |
160 |
|
|
postfork = 1; /* an error occured, recreate kernel state */ |
161 |
|
|
continue; |
162 |
|
|
} |
163 |
root |
1.32 |
} |
164 |
|
|
|
165 |
|
|
fd_event (EV_A_ fd, got); |
166 |
|
|
} |
167 |
root |
1.1 |
|
168 |
|
|
/* if the receive array was full, increase its size */ |
169 |
root |
1.14 |
if (expect_false (eventcnt == epoll_eventmax)) |
170 |
root |
1.1 |
{ |
171 |
root |
1.20 |
ev_free (epoll_events); |
172 |
root |
1.28 |
epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); |
173 |
root |
1.23 |
epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
174 |
root |
1.1 |
} |
175 |
|
|
} |
176 |
|
|
|
177 |
root |
1.27 |
int inline_size |
178 |
root |
1.13 |
epoll_init (EV_P_ int flags) |
179 |
root |
1.1 |
{ |
180 |
root |
1.26 |
backend_fd = epoll_create (256); |
181 |
root |
1.1 |
|
182 |
root |
1.26 |
if (backend_fd < 0) |
183 |
root |
1.13 |
return 0; |
184 |
root |
1.3 |
|
185 |
root |
1.26 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
186 |
root |
1.1 |
|
187 |
root |
1.31 |
backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ |
188 |
root |
1.25 |
backend_modify = epoll_modify; |
189 |
|
|
backend_poll = epoll_poll; |
190 |
root |
1.1 |
|
191 |
root |
1.37 |
epoll_eventmax = 64; /* initial number of events receivable per poll */ |
192 |
root |
1.23 |
epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
193 |
root |
1.13 |
|
194 |
root |
1.24 |
return EVBACKEND_EPOLL; |
195 |
root |
1.1 |
} |
196 |
root |
1.6 |
|
197 |
root |
1.27 |
void inline_size |
198 |
root |
1.15 |
epoll_destroy (EV_P) |
199 |
|
|
{ |
200 |
root |
1.20 |
ev_free (epoll_events); |
201 |
root |
1.15 |
} |
202 |
|
|
|
203 |
root |
1.27 |
void inline_size |
204 |
root |
1.15 |
epoll_fork (EV_P) |
205 |
|
|
{ |
206 |
root |
1.26 |
close (backend_fd); |
207 |
root |
1.21 |
|
208 |
root |
1.26 |
while ((backend_fd = epoll_create (256)) < 0) |
209 |
root |
1.38 |
ev_syserr ("(libev) epoll_create"); |
210 |
root |
1.21 |
|
211 |
root |
1.26 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
212 |
root |
1.15 |
|
213 |
root |
1.16 |
fd_rearm_all (EV_A); |
214 |
root |
1.15 |
} |
215 |
|
|
|