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 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 */ |
34 | # include <sys/select.h> |
42 | # include <sys/select.h> |
… | |
… | |
44 | #endif |
52 | #endif |
45 | |
53 | |
46 | #if EV_SELECT_IS_WINSOCKET |
54 | #if EV_SELECT_IS_WINSOCKET |
47 | # undef EV_SELECT_USE_FD_SET |
55 | # undef EV_SELECT_USE_FD_SET |
48 | # define EV_SELECT_USE_FD_SET 1 |
56 | # define EV_SELECT_USE_FD_SET 1 |
49 | # undef EINTR |
|
|
50 | # define EINTR WSAEINTR |
|
|
51 | # undef EBADF |
|
|
52 | # define EBADF WSAENOTSOCK |
|
|
53 | # undef ENOMEM |
|
|
54 | # define ENOMEM (errno + 1) |
|
|
55 | #endif |
57 | #endif |
56 | |
58 | |
57 | #if !EV_SELECT_USE_FD_SET |
59 | #if !EV_SELECT_USE_FD_SET |
58 | # define NFDBYTES (NFDBITS / 8) |
60 | # define NFDBYTES (NFDBITS / 8) |
59 | #endif |
61 | #endif |
… | |
… | |
85 | else |
87 | else |
86 | FD_CLR (handle, (fd_set *)vec_wi); |
88 | FD_CLR (handle, (fd_set *)vec_wi); |
87 | |
89 | |
88 | #else |
90 | #else |
89 | |
91 | |
90 | int word = fd / NFDBITS; |
92 | int word = fd / NFDBITS; |
91 | int mask = 1UL << (fd % NFDBITS); |
93 | fd_mask mask = 1UL << (fd % NFDBITS); |
92 | |
94 | |
93 | if (vec_max < word + 1) |
95 | if (expect_false (vec_max <= word)) |
94 | { |
96 | { |
95 | int new_max = word + 1; |
97 | int new_max = word + 1; |
96 | |
98 | |
97 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
99 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
98 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
100 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
99 | vec_wi = ev_realloc (vec_wi, new_max * NFDBYTES); |
101 | vec_wi = ev_realloc (vec_wi, new_max * NFDBYTES); |
100 | vec_wo = ev_realloc (vec_wo, new_max * NFDBYTES); /* could free/malloc */ |
102 | vec_wo = ev_realloc (vec_wo, new_max * NFDBYTES); /* could free/malloc */ |
101 | |
103 | |
102 | for (; vec_max < new_max; ++vec_max) |
104 | for (; vec_max < new_max; ++vec_max) |
103 | ((fd_mask *)vec_ri)[vec_max] = |
105 | ((fd_mask *)vec_ri) [vec_max] = |
104 | ((fd_mask *)vec_wi)[vec_max] = 0; |
106 | ((fd_mask *)vec_wi) [vec_max] = 0; |
105 | } |
107 | } |
106 | |
108 | |
107 | ((fd_mask *)vec_ri) [word] |= mask; |
109 | ((fd_mask *)vec_ri) [word] |= mask; |
108 | if (!(nev & EV_READ)) |
110 | if (!(nev & EV_READ)) |
109 | ((fd_mask *)vec_ri) [word] &= ~mask; |
111 | ((fd_mask *)vec_ri) [word] &= ~mask; |
… | |
… | |
130 | #endif |
132 | #endif |
131 | |
133 | |
132 | tv.tv_sec = (long)timeout; |
134 | tv.tv_sec = (long)timeout; |
133 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
135 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
134 | |
136 | |
|
|
137 | #ifdef _WIN32 |
|
|
138 | /* pass in the write set as except set. |
|
|
139 | * the idea behind this is to work around a windows bug that causes |
|
|
140 | * errors to be reported as an exception and not by setting |
|
|
141 | * the writable bit. this is so uncontrollably lame. |
|
|
142 | */ |
|
|
143 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, (fd_set *)vec_wo, &tv); |
|
|
144 | #else |
135 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
145 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
|
|
146 | #endif |
136 | |
147 | |
137 | if (res < 0) |
148 | if (expect_false (res < 0)) |
138 | { |
149 | { |
139 | #if EV_SELECT_IS_WINSOCKET |
150 | #if EV_SELECT_IS_WINSOCKET |
140 | errno = WSAGetLastError (); |
151 | errno = WSAGetLastError (); |
|
|
152 | #endif |
|
|
153 | #ifdef WSABASEERR |
|
|
154 | /* on windows, select returns incompatible error codes, fix this */ |
|
|
155 | if (errno >= WSABASEERR && errno < WSABASEERR + 1000) |
|
|
156 | if (errno == WSAENOTSOCK) |
|
|
157 | errno = EBADF; |
|
|
158 | else |
|
|
159 | errno -= WSABASEERR; |
|
|
160 | #endif |
|
|
161 | |
|
|
162 | #ifdef _WIN32 |
|
|
163 | /* select on windows errornously returns EINVAL when no fd sets have been |
|
|
164 | * provided (this is documented). what microsoft doesn't tell you that this bug |
|
|
165 | * exists even when the fd sets are provided, so we have to check for this bug |
|
|
166 | * here and emulate by sleeping manually. |
|
|
167 | * we also get EINVAL when the timeout is invalid, but we ignore this case here |
|
|
168 | * and assume that EINVAL always means: you have to wait manually. |
|
|
169 | */ |
|
|
170 | if (errno == EINVAL) |
|
|
171 | { |
|
|
172 | ev_sleep (timeout); |
|
|
173 | return; |
|
|
174 | } |
141 | #endif |
175 | #endif |
142 | |
176 | |
143 | if (errno == EBADF) |
177 | if (errno == EBADF) |
144 | fd_ebadf (EV_A); |
178 | fd_ebadf (EV_A); |
145 | else if (errno == ENOMEM && !syserr_cb) |
179 | else if (errno == ENOMEM && !syserr_cb) |
… | |
… | |
166 | #endif |
200 | #endif |
167 | |
201 | |
168 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
202 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
169 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
203 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
170 | |
204 | |
171 | if (events) |
205 | if (expect_true (events)) |
172 | fd_event (EV_A_ fd, events); |
206 | fd_event (EV_A_ fd, events); |
173 | } |
207 | } |
174 | } |
208 | } |
175 | |
209 | |
176 | #else |
210 | #else |
… | |
… | |
189 | int events = 0; |
223 | int events = 0; |
190 | |
224 | |
191 | events |= word_r & mask ? EV_READ : 0; |
225 | events |= word_r & mask ? EV_READ : 0; |
192 | events |= word_w & mask ? EV_WRITE : 0; |
226 | events |= word_w & mask ? EV_WRITE : 0; |
193 | |
227 | |
194 | if (events) |
228 | if (expect_true (events)) |
195 | fd_event (EV_A_ word * NFDBITS + bit, events); |
229 | fd_event (EV_A_ word * NFDBITS + bit, events); |
196 | } |
230 | } |
197 | } |
231 | } |
198 | } |
232 | } |
199 | |
233 | |
200 | #endif |
234 | #endif |
201 | } |
235 | } |
202 | |
236 | |
203 | static int |
237 | int inline_size |
204 | select_init (EV_P_ int flags) |
238 | select_init (EV_P_ int flags) |
205 | { |
239 | { |
206 | backend_fudge = 1e-2; /* needed to compensate for select returning early, very conservative */ |
240 | backend_fudge = 0.; /* posix says this is zero */ |
207 | backend_modify = select_modify; |
241 | backend_modify = select_modify; |
208 | backend_poll = select_poll; |
242 | backend_poll = select_poll; |
209 | |
243 | |
210 | #if EV_SELECT_USE_FD_SET |
244 | #if EV_SELECT_USE_FD_SET |
211 | vec_max = FD_SETSIZE / 32; |
245 | vec_max = FD_SETSIZE / 32; |
… | |
… | |
222 | #endif |
256 | #endif |
223 | |
257 | |
224 | return EVBACKEND_SELECT; |
258 | return EVBACKEND_SELECT; |
225 | } |
259 | } |
226 | |
260 | |
227 | static void |
261 | void inline_size |
228 | select_destroy (EV_P) |
262 | select_destroy (EV_P) |
229 | { |
263 | { |
230 | ev_free (vec_ri); |
264 | ev_free (vec_ri); |
231 | ev_free (vec_ro); |
265 | ev_free (vec_ro); |
232 | ev_free (vec_wi); |
266 | ev_free (vec_wi); |