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 (expect_false (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 */ |
|
|
103 | #ifdef _WIN32 |
|
|
104 | vec_eo = ev_realloc (vec_eo, new_max * NFDBYTES); /* could free/malloc */ |
|
|
105 | #endif |
101 | |
106 | |
102 | for (; vec_max < new_max; ++vec_max) |
107 | for (; vec_max < new_max; ++vec_max) |
103 | ((fd_mask *)vec_ri)[vec_max] = |
108 | ((fd_mask *)vec_ri) [vec_max] = |
104 | ((fd_mask *)vec_wi)[vec_max] = 0; |
109 | ((fd_mask *)vec_wi) [vec_max] = 0; |
105 | } |
110 | } |
106 | |
111 | |
107 | ((fd_mask *)vec_ri) [word] |= mask; |
112 | ((fd_mask *)vec_ri) [word] |= mask; |
108 | if (!(nev & EV_READ)) |
113 | if (!(nev & EV_READ)) |
109 | ((fd_mask *)vec_ri) [word] &= ~mask; |
114 | ((fd_mask *)vec_ri) [word] &= ~mask; |
… | |
… | |
118 | static void |
123 | static void |
119 | select_poll (EV_P_ ev_tstamp timeout) |
124 | select_poll (EV_P_ ev_tstamp timeout) |
120 | { |
125 | { |
121 | struct timeval tv; |
126 | struct timeval tv; |
122 | int res; |
127 | int res; |
123 | |
128 | int fd_setsize; |
124 | #if EV_SELECT_USE_FD_SET |
|
|
125 | memcpy (vec_ro, vec_ri, sizeof (fd_set)); |
|
|
126 | memcpy (vec_wo, vec_wi, sizeof (fd_set)); |
|
|
127 | #else |
|
|
128 | memcpy (vec_ro, vec_ri, vec_max * NFDBYTES); |
|
|
129 | memcpy (vec_wo, vec_wi, vec_max * NFDBYTES); |
|
|
130 | #endif |
|
|
131 | |
129 | |
132 | tv.tv_sec = (long)timeout; |
130 | tv.tv_sec = (long)timeout; |
133 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
131 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
134 | |
132 | |
|
|
133 | #if EV_SELECT_USE_FD_SET |
|
|
134 | fd_setsize = sizeof (fd_set); |
|
|
135 | #else |
|
|
136 | fd_setsize = vec_max * NFDBYTES; |
|
|
137 | #endif |
|
|
138 | |
|
|
139 | memcpy (vec_ro, vec_ri, fd_setsize); |
|
|
140 | memcpy (vec_wo, vec_wi, fd_setsize); |
|
|
141 | |
|
|
142 | #ifdef _WIN32 |
|
|
143 | /* pass in the write set as except set. |
|
|
144 | * the idea behind this is to work around a windows bug that causes |
|
|
145 | * errors to be reported as an exception and not by setting |
|
|
146 | * the writable bit. this is so uncontrollably lame. |
|
|
147 | */ |
|
|
148 | memcpy (vec_eo, vec_wi, fd_setsize); |
|
|
149 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, (fd_set *)vec_eo, &tv); |
|
|
150 | #else |
135 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
151 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
|
|
152 | #endif |
136 | |
153 | |
137 | if (expect_false (res < 0)) |
154 | if (expect_false (res < 0)) |
138 | { |
155 | { |
139 | #if EV_SELECT_IS_WINSOCKET |
156 | #if EV_SELECT_IS_WINSOCKET |
140 | errno = WSAGetLastError (); |
157 | errno = WSAGetLastError (); |
|
|
158 | #endif |
|
|
159 | #ifdef WSABASEERR |
|
|
160 | /* on windows, select returns incompatible error codes, fix this */ |
|
|
161 | if (errno >= WSABASEERR && errno < WSABASEERR + 1000) |
|
|
162 | if (errno == WSAENOTSOCK) |
|
|
163 | errno = EBADF; |
|
|
164 | else |
|
|
165 | errno -= WSABASEERR; |
|
|
166 | #endif |
|
|
167 | |
|
|
168 | #ifdef _WIN32 |
|
|
169 | /* select on windows errornously returns EINVAL when no fd sets have been |
|
|
170 | * provided (this is documented). what microsoft doesn't tell you that this bug |
|
|
171 | * exists even when the fd sets are provided, so we have to check for this bug |
|
|
172 | * here and emulate by sleeping manually. |
|
|
173 | * we also get EINVAL when the timeout is invalid, but we ignore this case here |
|
|
174 | * and assume that EINVAL always means: you have to wait manually. |
|
|
175 | */ |
|
|
176 | if (errno == EINVAL) |
|
|
177 | { |
|
|
178 | ev_sleep (timeout); |
|
|
179 | return; |
|
|
180 | } |
141 | #endif |
181 | #endif |
142 | |
182 | |
143 | if (errno == EBADF) |
183 | if (errno == EBADF) |
144 | fd_ebadf (EV_A); |
184 | fd_ebadf (EV_A); |
145 | else if (errno == ENOMEM && !syserr_cb) |
185 | else if (errno == ENOMEM && !syserr_cb) |
… | |
… | |
165 | int handle = fd; |
205 | int handle = fd; |
166 | #endif |
206 | #endif |
167 | |
207 | |
168 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
208 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
169 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
209 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
|
|
210 | #ifdef _WIN32 |
|
|
211 | if (FD_ISSET (handle, (fd_set *)vec_eo)) events |= EV_WRITE; |
|
|
212 | #endif |
170 | |
213 | |
171 | if (expect_true (events)) |
214 | if (expect_true (events)) |
172 | fd_event (EV_A_ fd, events); |
215 | fd_event (EV_A_ fd, events); |
173 | } |
216 | } |
174 | } |
217 | } |
… | |
… | |
179 | int word, bit; |
222 | int word, bit; |
180 | for (word = vec_max; word--; ) |
223 | for (word = vec_max; word--; ) |
181 | { |
224 | { |
182 | fd_mask word_r = ((fd_mask *)vec_ro) [word]; |
225 | fd_mask word_r = ((fd_mask *)vec_ro) [word]; |
183 | fd_mask word_w = ((fd_mask *)vec_wo) [word]; |
226 | fd_mask word_w = ((fd_mask *)vec_wo) [word]; |
|
|
227 | #ifdef _WIN32 |
|
|
228 | word_w |= ((fd_mask *)vec_eo) [word]; |
|
|
229 | #endif |
184 | |
230 | |
185 | if (word_r || word_w) |
231 | if (word_r || word_w) |
186 | for (bit = NFDBITS; bit--; ) |
232 | for (bit = NFDBITS; bit--; ) |
187 | { |
233 | { |
188 | fd_mask mask = 1UL << bit; |
234 | fd_mask mask = 1UL << bit; |
… | |
… | |
211 | vec_max = FD_SETSIZE / 32; |
257 | vec_max = FD_SETSIZE / 32; |
212 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
258 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
213 | vec_ro = ev_malloc (sizeof (fd_set)); |
259 | vec_ro = ev_malloc (sizeof (fd_set)); |
214 | vec_wi = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_wi); |
260 | vec_wi = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_wi); |
215 | vec_wo = ev_malloc (sizeof (fd_set)); |
261 | vec_wo = ev_malloc (sizeof (fd_set)); |
|
|
262 | #ifdef _WIN32 |
|
|
263 | vec_eo = ev_malloc (sizeof (fd_set)); |
|
|
264 | #endif |
216 | #else |
265 | #else |
217 | vec_max = 0; |
266 | vec_max = 0; |
218 | vec_ri = 0; |
267 | vec_ri = 0; |
219 | vec_ri = 0; |
268 | vec_ri = 0; |
220 | vec_wo = 0; |
269 | vec_wo = 0; |