1 | /* |
1 | /* |
2 | * libev select fd activity backend |
2 | * libev select fd activity backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libev@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * modification, are permitted provided that the following conditions are |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * 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. |
10 | * |
27 | * |
11 | * * Redistributions of source code must retain the above copyright |
28 | * Alternatively, the contents of this file may be used under the terms of |
12 | * notice, this list of conditions and the following disclaimer. |
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
13 | * |
30 | * in which case the provisions of the GPL are applicable instead of |
14 | * * Redistributions in binary form must reproduce the above |
31 | * the above. If you wish to allow the use of your version of this file |
15 | * copyright notice, this list of conditions and the following |
32 | * only under the terms of the GPL and not to allow others to use your |
16 | * disclaimer in the documentation and/or other materials provided |
33 | * version of this file under the BSD license, indicate your decision |
17 | * with the distribution. |
34 | * by deleting the provisions above and replace them with the notice |
18 | * |
35 | * and other provisions required by the GPL. If you do not delete the |
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
36 | * provisions above, a recipient may use your version of this file under |
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
37 | * either the BSD or the GPL. |
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 | */ |
38 | */ |
31 | |
39 | |
32 | #ifndef _WIN32 |
40 | #ifndef _WIN32 |
33 | /* for unix systems */ |
41 | /* for unix systems */ |
|
|
42 | # include <inttypes.h> |
|
|
43 | # ifndef __hpux |
|
|
44 | /* for REAL unix systems */ |
34 | # include <sys/select.h> |
45 | # include <sys/select.h> |
35 | # include <inttypes.h> |
46 | # endif |
36 | #endif |
47 | #endif |
37 | |
48 | |
38 | #ifndef EV_SELECT_USE_FD_SET |
49 | #ifndef EV_SELECT_USE_FD_SET |
39 | # ifdef NFDBITS |
50 | # ifdef NFDBITS |
40 | # define EV_SELECT_USE_FD_SET 0 |
51 | # define EV_SELECT_USE_FD_SET 0 |
… | |
… | |
44 | #endif |
55 | #endif |
45 | |
56 | |
46 | #if EV_SELECT_IS_WINSOCKET |
57 | #if EV_SELECT_IS_WINSOCKET |
47 | # undef EV_SELECT_USE_FD_SET |
58 | # undef EV_SELECT_USE_FD_SET |
48 | # define EV_SELECT_USE_FD_SET 1 |
59 | # define EV_SELECT_USE_FD_SET 1 |
49 | # undef EINTR |
60 | # undef NFDBITS |
50 | # define EINTR WSAEINTR |
61 | # define NFDBITS 0 |
51 | # undef EBADF |
|
|
52 | # define EBADF WSAENOTSOCK |
|
|
53 | # undef ENOMEM |
|
|
54 | # define ENOMEM (errno + 1) |
|
|
55 | #endif |
62 | #endif |
56 | |
63 | |
57 | #if !EV_SELECT_USE_FD_SET |
64 | #if !EV_SELECT_USE_FD_SET |
58 | # define NFDBYTES (NFDBITS / 8) |
65 | # define NFDBYTES (NFDBITS / 8) |
59 | #endif |
66 | #endif |
… | |
… | |
73 | SOCKET handle = anfds [fd].handle; |
80 | SOCKET handle = anfds [fd].handle; |
74 | #else |
81 | #else |
75 | int handle = fd; |
82 | int handle = fd; |
76 | #endif |
83 | #endif |
77 | |
84 | |
|
|
85 | assert (("libev: fd >= FD_SETSIZE passed to fd_set-based select backend", fd < FD_SETSIZE)); |
|
|
86 | |
|
|
87 | /* FD_SET is broken on windows (it adds the fd to a set twice or more, |
|
|
88 | * which eventually leads to overflows). Need to call it only on changes. |
|
|
89 | */ |
|
|
90 | #if EV_SELECT_IS_WINSOCKET |
|
|
91 | if ((oev ^ nev) & EV_READ) |
|
|
92 | #endif |
78 | if (nev & EV_READ) |
93 | if (nev & EV_READ) |
79 | FD_SET (handle, (fd_set *)vec_ri); |
94 | FD_SET (handle, (fd_set *)vec_ri); |
80 | else |
95 | else |
81 | FD_CLR (handle, (fd_set *)vec_ri); |
96 | FD_CLR (handle, (fd_set *)vec_ri); |
82 | |
97 | |
|
|
98 | #if EV_SELECT_IS_WINSOCKET |
|
|
99 | if ((oev ^ nev) & EV_WRITE) |
|
|
100 | #endif |
83 | if (nev & EV_WRITE) |
101 | if (nev & EV_WRITE) |
84 | FD_SET (handle, (fd_set *)vec_wi); |
102 | FD_SET (handle, (fd_set *)vec_wi); |
85 | else |
103 | else |
86 | FD_CLR (handle, (fd_set *)vec_wi); |
104 | FD_CLR (handle, (fd_set *)vec_wi); |
87 | |
105 | |
88 | #else |
106 | #else |
89 | |
107 | |
90 | int word = fd / NFDBITS; |
108 | int word = fd / NFDBITS; |
91 | int mask = 1UL << (fd % NFDBITS); |
109 | fd_mask mask = 1UL << (fd % NFDBITS); |
92 | |
110 | |
93 | if (vec_max < word + 1) |
111 | if (expect_false (vec_max <= word)) |
94 | { |
112 | { |
95 | int new_max = word + 1; |
113 | int new_max = word + 1; |
96 | |
114 | |
97 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
115 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
98 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
116 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
99 | vec_wi = ev_realloc (vec_wi, new_max * NFDBYTES); |
117 | vec_wi = ev_realloc (vec_wi, new_max * NFDBYTES); |
100 | vec_wo = ev_realloc (vec_wo, new_max * NFDBYTES); /* could free/malloc */ |
118 | vec_wo = ev_realloc (vec_wo, new_max * NFDBYTES); /* could free/malloc */ |
|
|
119 | #ifdef _WIN32 |
|
|
120 | vec_eo = ev_realloc (vec_eo, new_max * NFDBYTES); /* could free/malloc */ |
|
|
121 | #endif |
101 | |
122 | |
102 | for (; vec_max < new_max; ++vec_max) |
123 | for (; vec_max < new_max; ++vec_max) |
103 | ((fd_mask *)vec_ri)[vec_max] = |
124 | ((fd_mask *)vec_ri) [vec_max] = |
104 | ((fd_mask *)vec_wi)[vec_max] = 0; |
125 | ((fd_mask *)vec_wi) [vec_max] = 0; |
105 | } |
126 | } |
106 | |
127 | |
107 | ((fd_mask *)vec_ri) [word] |= mask; |
128 | ((fd_mask *)vec_ri) [word] |= mask; |
108 | if (!(nev & EV_READ)) |
129 | if (!(nev & EV_READ)) |
109 | ((fd_mask *)vec_ri) [word] &= ~mask; |
130 | ((fd_mask *)vec_ri) [word] &= ~mask; |
… | |
… | |
118 | static void |
139 | static void |
119 | select_poll (EV_P_ ev_tstamp timeout) |
140 | select_poll (EV_P_ ev_tstamp timeout) |
120 | { |
141 | { |
121 | struct timeval tv; |
142 | struct timeval tv; |
122 | int res; |
143 | int res; |
|
|
144 | int fd_setsize; |
|
|
145 | |
|
|
146 | EV_RELEASE_CB; |
|
|
147 | EV_TV_SET (tv, timeout); |
123 | |
148 | |
124 | #if EV_SELECT_USE_FD_SET |
149 | #if EV_SELECT_USE_FD_SET |
|
|
150 | fd_setsize = sizeof (fd_set); |
|
|
151 | #else |
|
|
152 | fd_setsize = vec_max * NFDBYTES; |
|
|
153 | #endif |
|
|
154 | |
125 | memcpy (vec_ro, vec_ri, sizeof (fd_set)); |
155 | memcpy (vec_ro, vec_ri, fd_setsize); |
126 | memcpy (vec_wo, vec_wi, sizeof (fd_set)); |
156 | memcpy (vec_wo, vec_wi, fd_setsize); |
127 | #else |
|
|
128 | memcpy (vec_ro, vec_ri, vec_max * NFDBYTES); |
|
|
129 | memcpy (vec_wo, vec_wi, vec_max * NFDBYTES); |
|
|
130 | #endif |
|
|
131 | |
157 | |
132 | tv.tv_sec = (long)timeout; |
158 | #ifdef _WIN32 |
133 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
159 | /* pass in the write set as except set. |
134 | |
160 | * the idea behind this is to work around a windows bug that causes |
|
|
161 | * errors to be reported as an exception and not by setting |
|
|
162 | * the writable bit. this is so uncontrollably lame. |
|
|
163 | */ |
|
|
164 | memcpy (vec_eo, vec_wi, fd_setsize); |
|
|
165 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, (fd_set *)vec_eo, &tv); |
|
|
166 | #elif EV_SELECT_USE_FD_SET |
|
|
167 | fd_setsize = anfdmax < FD_SETSIZE ? anfdmax : FD_SETSIZE; |
|
|
168 | res = select (fd_setsize, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
|
|
169 | #else |
135 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
170 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
|
|
171 | #endif |
|
|
172 | EV_ACQUIRE_CB; |
136 | |
173 | |
137 | if (res < 0) |
174 | if (expect_false (res < 0)) |
138 | { |
175 | { |
139 | #if EV_SELECT_IS_WINSOCKET |
176 | #if EV_SELECT_IS_WINSOCKET |
140 | errno = WSAGetLastError (); |
177 | errno = WSAGetLastError (); |
|
|
178 | #endif |
|
|
179 | #ifdef WSABASEERR |
|
|
180 | /* on windows, select returns incompatible error codes, fix this */ |
|
|
181 | if (errno >= WSABASEERR && errno < WSABASEERR + 1000) |
|
|
182 | if (errno == WSAENOTSOCK) |
|
|
183 | errno = EBADF; |
|
|
184 | else |
|
|
185 | errno -= WSABASEERR; |
|
|
186 | #endif |
|
|
187 | |
|
|
188 | #ifdef _WIN32 |
|
|
189 | /* select on windows erroneously returns EINVAL when no fd sets have been |
|
|
190 | * provided (this is documented). what microsoft doesn't tell you that this bug |
|
|
191 | * exists even when the fd sets _are_ provided, so we have to check for this bug |
|
|
192 | * here and emulate by sleeping manually. |
|
|
193 | * we also get EINVAL when the timeout is invalid, but we ignore this case here |
|
|
194 | * and assume that EINVAL always means: you have to wait manually. |
|
|
195 | */ |
|
|
196 | if (errno == EINVAL) |
|
|
197 | { |
|
|
198 | ev_sleep (timeout); |
|
|
199 | return; |
|
|
200 | } |
141 | #endif |
201 | #endif |
142 | |
202 | |
143 | if (errno == EBADF) |
203 | if (errno == EBADF) |
144 | fd_ebadf (EV_A); |
204 | fd_ebadf (EV_A); |
145 | else if (errno == ENOMEM && !syserr_cb) |
205 | else if (errno == ENOMEM && !syserr_cb) |
146 | fd_enomem (EV_A); |
206 | fd_enomem (EV_A); |
147 | else if (errno != EINTR) |
207 | else if (errno != EINTR) |
148 | syserr ("(libev) select"); |
208 | ev_syserr ("(libev) select"); |
149 | |
209 | |
150 | return; |
210 | return; |
151 | } |
211 | } |
152 | |
212 | |
153 | #if EV_SELECT_USE_FD_SET |
213 | #if EV_SELECT_USE_FD_SET |
… | |
… | |
165 | int handle = fd; |
225 | int handle = fd; |
166 | #endif |
226 | #endif |
167 | |
227 | |
168 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
228 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
169 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
229 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
|
|
230 | #ifdef _WIN32 |
|
|
231 | if (FD_ISSET (handle, (fd_set *)vec_eo)) events |= EV_WRITE; |
|
|
232 | #endif |
170 | |
233 | |
171 | if (events) |
234 | if (expect_true (events)) |
172 | fd_event (EV_A_ fd, events); |
235 | fd_event (EV_A_ fd, events); |
173 | } |
236 | } |
174 | } |
237 | } |
175 | |
238 | |
176 | #else |
239 | #else |
… | |
… | |
179 | int word, bit; |
242 | int word, bit; |
180 | for (word = vec_max; word--; ) |
243 | for (word = vec_max; word--; ) |
181 | { |
244 | { |
182 | fd_mask word_r = ((fd_mask *)vec_ro) [word]; |
245 | fd_mask word_r = ((fd_mask *)vec_ro) [word]; |
183 | fd_mask word_w = ((fd_mask *)vec_wo) [word]; |
246 | fd_mask word_w = ((fd_mask *)vec_wo) [word]; |
|
|
247 | #ifdef _WIN32 |
|
|
248 | word_w |= ((fd_mask *)vec_eo) [word]; |
|
|
249 | #endif |
184 | |
250 | |
185 | if (word_r || word_w) |
251 | if (word_r || word_w) |
186 | for (bit = NFDBITS; bit--; ) |
252 | for (bit = NFDBITS; bit--; ) |
187 | { |
253 | { |
188 | fd_mask mask = 1UL << bit; |
254 | fd_mask mask = 1UL << bit; |
189 | int events = 0; |
255 | int events = 0; |
190 | |
256 | |
191 | events |= word_r & mask ? EV_READ : 0; |
257 | events |= word_r & mask ? EV_READ : 0; |
192 | events |= word_w & mask ? EV_WRITE : 0; |
258 | events |= word_w & mask ? EV_WRITE : 0; |
193 | |
259 | |
194 | if (events) |
260 | if (expect_true (events)) |
195 | fd_event (EV_A_ word * NFDBITS + bit, events); |
261 | fd_event (EV_A_ word * NFDBITS + bit, events); |
196 | } |
262 | } |
197 | } |
263 | } |
198 | } |
264 | } |
199 | |
265 | |
200 | #endif |
266 | #endif |
201 | } |
267 | } |
202 | |
268 | |
203 | static int |
269 | int inline_size |
204 | select_init (EV_P_ int flags) |
270 | select_init (EV_P_ int flags) |
205 | { |
271 | { |
206 | method_fudge = 1e-2; /* needed to compensate for select returning early, very conservative */ |
272 | backend_fudge = 0.; /* posix says this is zero */ |
207 | method_modify = select_modify; |
273 | backend_modify = select_modify; |
208 | method_poll = select_poll; |
274 | backend_poll = select_poll; |
209 | |
275 | |
210 | #if EV_SELECT_USE_FD_SET |
276 | #if EV_SELECT_USE_FD_SET |
211 | vec_max = FD_SETSIZE / 32; |
|
|
212 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
277 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
213 | vec_ro = ev_malloc (sizeof (fd_set)); |
278 | vec_ro = ev_malloc (sizeof (fd_set)); |
214 | vec_wi = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_wi); |
279 | vec_wi = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_wi); |
215 | vec_wo = ev_malloc (sizeof (fd_set)); |
280 | vec_wo = ev_malloc (sizeof (fd_set)); |
|
|
281 | #ifdef _WIN32 |
|
|
282 | vec_eo = ev_malloc (sizeof (fd_set)); |
|
|
283 | #endif |
216 | #else |
284 | #else |
217 | vec_max = 0; |
285 | vec_max = 0; |
218 | vec_ri = 0; |
286 | vec_ri = 0; |
219 | vec_ri = 0; |
287 | vec_ro = 0; |
|
|
288 | vec_wi = 0; |
220 | vec_wo = 0; |
289 | vec_wo = 0; |
|
|
290 | #ifdef _WIN32 |
221 | vec_wo = 0; |
291 | vec_eo = 0; |
|
|
292 | #endif |
222 | #endif |
293 | #endif |
223 | |
294 | |
224 | return EVBACKEND_SELECT; |
295 | return EVBACKEND_SELECT; |
225 | } |
296 | } |
226 | |
297 | |
227 | static void |
298 | void inline_size |
228 | select_destroy (EV_P) |
299 | select_destroy (EV_P) |
229 | { |
300 | { |
230 | ev_free (vec_ri); |
301 | ev_free (vec_ri); |
231 | ev_free (vec_ro); |
302 | ev_free (vec_ro); |
232 | ev_free (vec_wi); |
303 | ev_free (vec_wi); |
233 | ev_free (vec_wo); |
304 | ev_free (vec_wo); |
|
|
305 | #ifdef _WIN32 |
|
|
306 | ev_free (vec_eo); |
|
|
307 | #endif |
234 | } |
308 | } |
235 | |
309 | |
236 | |
310 | |