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 | |
|
|
40 | #ifndef _WIN32 |
32 | /* for unix systems */ |
41 | /* for unix systems */ |
33 | #if WIN32 |
42 | # include <sys/select.h> |
34 | typedef unsigned int uint32_t; |
43 | # include <inttypes.h> |
|
|
44 | #endif |
|
|
45 | |
35 | # ifndef EV_SELECT_USE_FD_SET |
46 | #ifndef EV_SELECT_USE_FD_SET |
|
|
47 | # ifdef NFDBITS |
|
|
48 | # define EV_SELECT_USE_FD_SET 0 |
|
|
49 | # else |
36 | # define EV_SELECT_USE_FD_SET 1 |
50 | # define EV_SELECT_USE_FD_SET 1 |
37 | # endif |
51 | # endif |
38 | #else |
|
|
39 | # include <sys/select.h> |
|
|
40 | # include <inttypes.h> |
|
|
41 | #endif |
52 | #endif |
42 | |
53 | |
43 | #if EV_SELECT_USE_WIN32_HANDLES |
54 | #if EV_SELECT_IS_WINSOCKET |
44 | # undef EV_SELECT_USE_FD_SET |
55 | # undef EV_SELECT_USE_FD_SET |
45 | # define EV_SELECT_USE_FD_SET 1 |
56 | # define EV_SELECT_USE_FD_SET 1 |
46 | #else |
57 | #endif |
|
|
58 | |
|
|
59 | #if !EV_SELECT_USE_FD_SET |
|
|
60 | # define NFDBYTES (NFDBITS / 8) |
47 | #endif |
61 | #endif |
48 | |
62 | |
49 | #include <string.h> |
63 | #include <string.h> |
50 | |
64 | |
51 | static void |
65 | static void |
52 | select_modify (EV_P_ int fd, int oev, int nev) |
66 | select_modify (EV_P_ int fd, int oev, int nev) |
53 | { |
67 | { |
54 | if (oev == nev) |
68 | if (oev == nev) |
55 | return; |
69 | return; |
56 | |
70 | |
57 | #if EV_SELECT_USE_FD_SET |
|
|
58 | # if EV_SELECT_USE_WIN32_HANDLES |
|
|
59 | fd = _get_osfhandle (fd); |
|
|
60 | if (fd < 0) |
|
|
61 | return; |
|
|
62 | # endif |
|
|
63 | |
|
|
64 | if (nev & EV_READ) |
|
|
65 | FD_SET (fd, (struct fd_set *)vec_ri); |
|
|
66 | else |
|
|
67 | FD_CLR (fd, (struct fd_set *)vec_ri); |
|
|
68 | |
|
|
69 | if (nev & EV_WRITE) |
|
|
70 | FD_SET (fd, (struct fd_set *)vec_wi); |
|
|
71 | else |
|
|
72 | FD_CLR (fd, (struct fd_set *)vec_wi); |
|
|
73 | #else |
|
|
74 | { |
71 | { |
75 | int offs = fd >> 3; |
72 | #if EV_SELECT_USE_FD_SET |
76 | int mask = 1 << (fd & 7); |
|
|
77 | |
73 | |
78 | if (vec_max < (fd >> 5) + 1) |
74 | #if EV_SELECT_IS_WINSOCKET |
|
|
75 | SOCKET handle = anfds [fd].handle; |
|
|
76 | #else |
|
|
77 | int handle = fd; |
|
|
78 | #endif |
|
|
79 | |
|
|
80 | if (nev & EV_READ) |
|
|
81 | FD_SET (handle, (fd_set *)vec_ri); |
|
|
82 | else |
|
|
83 | FD_CLR (handle, (fd_set *)vec_ri); |
|
|
84 | |
|
|
85 | if (nev & EV_WRITE) |
|
|
86 | FD_SET (handle, (fd_set *)vec_wi); |
|
|
87 | else |
|
|
88 | FD_CLR (handle, (fd_set *)vec_wi); |
|
|
89 | |
|
|
90 | #else |
|
|
91 | |
|
|
92 | int word = fd / NFDBITS; |
|
|
93 | fd_mask mask = 1UL << (fd % NFDBITS); |
|
|
94 | |
|
|
95 | if (expect_false (vec_max <= word)) |
79 | { |
96 | { |
80 | int new_max = (fd >> 5) + 1; |
97 | int new_max = word + 1; |
81 | |
98 | |
82 | vec_ri = (unsigned char *)ev_realloc (vec_ri, new_max * 4); |
99 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
83 | vec_ro = (unsigned char *)ev_realloc (vec_ro, new_max * 4); /* could free/malloc */ |
100 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
84 | vec_wi = (unsigned char *)ev_realloc (vec_wi, new_max * 4); |
101 | vec_wi = ev_realloc (vec_wi, new_max * NFDBYTES); |
85 | vec_wo = (unsigned char *)ev_realloc (vec_wo, new_max * 4); /* could free/malloc */ |
102 | vec_wo = ev_realloc (vec_wo, new_max * NFDBYTES); /* could free/malloc */ |
86 | |
103 | |
87 | for (; vec_max < new_max; ++vec_max) |
104 | for (; vec_max < new_max; ++vec_max) |
88 | ((uint32_t *)vec_ri)[vec_max] = |
105 | ((fd_mask *)vec_ri) [vec_max] = |
89 | ((uint32_t *)vec_wi)[vec_max] = 0; |
106 | ((fd_mask *)vec_wi) [vec_max] = 0; |
90 | } |
107 | } |
91 | |
108 | |
92 | vec_ri [offs] |= mask; |
109 | ((fd_mask *)vec_ri) [word] |= mask; |
93 | if (!(nev & EV_READ)) |
110 | if (!(nev & EV_READ)) |
94 | vec_ri [offs] &= ~mask; |
111 | ((fd_mask *)vec_ri) [word] &= ~mask; |
95 | |
112 | |
96 | vec_wi [offs] |= mask; |
113 | ((fd_mask *)vec_wi) [word] |= mask; |
97 | if (!(nev & EV_WRITE)) |
114 | if (!(nev & EV_WRITE)) |
98 | vec_wi [offs] &= ~mask; |
115 | ((fd_mask *)vec_wi) [word] &= ~mask; |
|
|
116 | #endif |
99 | } |
117 | } |
100 | #endif |
|
|
101 | } |
118 | } |
102 | |
119 | |
103 | static void |
120 | static void |
104 | select_poll (EV_P_ ev_tstamp timeout) |
121 | select_poll (EV_P_ ev_tstamp timeout) |
105 | { |
122 | { |
106 | int word, offs; |
|
|
107 | struct timeval tv; |
123 | struct timeval tv; |
108 | int res; |
124 | int res; |
109 | |
125 | |
110 | #if EV_SELECT_USE_FD_SET |
126 | #if EV_SELECT_USE_FD_SET |
111 | memcpy (vec_ro, vec_ri, sizeof (struct fd_set)); |
127 | memcpy (vec_ro, vec_ri, sizeof (fd_set)); |
112 | memcpy (vec_wo, vec_wi, sizeof (struct fd_set)); |
128 | memcpy (vec_wo, vec_wi, sizeof (fd_set)); |
113 | #else |
129 | #else |
114 | memcpy (vec_ro, vec_ri, vec_max * 4); |
130 | memcpy (vec_ro, vec_ri, vec_max * NFDBYTES); |
115 | memcpy (vec_wo, vec_wi, vec_max * 4); |
131 | memcpy (vec_wo, vec_wi, vec_max * NFDBYTES); |
116 | #endif |
132 | #endif |
117 | |
133 | |
118 | tv.tv_sec = (long)timeout; |
134 | tv.tv_sec = (long)timeout; |
119 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
135 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
120 | |
136 | |
121 | res = select (vec_max * 32, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
137 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
122 | |
138 | |
123 | if (res < 0) |
139 | if (expect_false (res < 0)) |
124 | { |
140 | { |
125 | #ifdef WIN32 |
141 | #if EV_SELECT_IS_WINSOCKET |
126 | if (errno == WSAEINTR ) errno = EINTR; |
142 | errno = WSAGetLastError (); |
|
|
143 | #endif |
|
|
144 | #ifdef WSABASEERR |
|
|
145 | /* on windows, select returns incompatible error codes, fix this */ |
|
|
146 | if (errno >= WSABASEERR && errno < WSABASEERR + 1000) |
127 | if (errno == WSAENOTSOCK) errno = EBADF; |
147 | if (errno == WSAENOTSOCK) |
128 | #endif |
148 | errno = EBADF; |
|
|
149 | else |
|
|
150 | errno -= WSABASEERR; |
|
|
151 | #endif |
|
|
152 | |
|
|
153 | #ifdef _WIN32 |
|
|
154 | /* select on windows errornously returns EINVAL when no fd sets have been |
|
|
155 | * provided (this is documented). what microsoft doesn't tell you that this bug |
|
|
156 | * exists even when the fd sets are provided, so we have to check for this bug |
|
|
157 | * here and emulate by sleeping manually. |
|
|
158 | * we also get EINVAL when the timeout is invalid, but we ignore this case here |
|
|
159 | * and assume that EINVAL always means: you have to wait manually. |
|
|
160 | */ |
|
|
161 | if (errno == EINVAL) |
|
|
162 | { |
|
|
163 | ev_sleep (timeout); |
|
|
164 | return; |
|
|
165 | } |
|
|
166 | #endif |
129 | |
167 | |
130 | if (errno == EBADF) |
168 | if (errno == EBADF) |
131 | fd_ebadf (EV_A); |
169 | fd_ebadf (EV_A); |
132 | else if (errno == ENOMEM && !syserr_cb) |
170 | else if (errno == ENOMEM && !syserr_cb) |
133 | fd_enomem (EV_A); |
171 | fd_enomem (EV_A); |
… | |
… | |
136 | |
174 | |
137 | return; |
175 | return; |
138 | } |
176 | } |
139 | |
177 | |
140 | #if EV_SELECT_USE_FD_SET |
178 | #if EV_SELECT_USE_FD_SET |
141 | # if EV_SELECT_USE_WIN32_HANDLES |
179 | |
|
|
180 | { |
|
|
181 | int fd; |
|
|
182 | |
142 | for (word = 0; word < anfdmax; ++word) |
183 | for (fd = 0; fd < anfdmax; ++fd) |
143 | { |
|
|
144 | if (!anfd [word].events) |
184 | if (anfds [fd].events) |
145 | { |
185 | { |
146 | int fd = _get_osfhandle (word); |
186 | int events = 0; |
|
|
187 | #if EV_SELECT_IS_WINSOCKET |
|
|
188 | SOCKET handle = anfds [fd].handle; |
|
|
189 | #else |
|
|
190 | int handle = fd; |
|
|
191 | #endif |
147 | |
192 | |
148 | if (fd >= 0) |
193 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
|
|
194 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
|
|
195 | |
|
|
196 | if (expect_true (events)) |
|
|
197 | fd_event (EV_A_ fd, events); |
|
|
198 | } |
|
|
199 | } |
|
|
200 | |
|
|
201 | #else |
|
|
202 | |
|
|
203 | { |
|
|
204 | int word, bit; |
|
|
205 | for (word = vec_max; word--; ) |
|
|
206 | { |
|
|
207 | fd_mask word_r = ((fd_mask *)vec_ro) [word]; |
|
|
208 | fd_mask word_w = ((fd_mask *)vec_wo) [word]; |
|
|
209 | |
|
|
210 | if (word_r || word_w) |
|
|
211 | for (bit = NFDBITS; bit--; ) |
149 | { |
212 | { |
|
|
213 | fd_mask mask = 1UL << bit; |
150 | int events = 0; |
214 | int events = 0; |
151 | |
215 | |
152 | if (FD_ISSET (fd, (struct fd_set *)vec_ro)) events |= EV_READ; |
216 | events |= word_r & mask ? EV_READ : 0; |
153 | if (FD_ISSET (fd, (struct fd_set *)vec_wo)) events |= EV_WRITE; |
217 | events |= word_w & mask ? EV_WRITE : 0; |
154 | |
218 | |
155 | if (events) |
219 | if (expect_true (events)) |
156 | fd_event (EV_A_ word, events); |
220 | fd_event (EV_A_ word * NFDBITS + bit, events); |
157 | } |
221 | } |
158 | } |
222 | } |
159 | } |
223 | } |
160 | # else |
|
|
161 | for (word = 0; word < FD_SETSIZE; ++word) |
|
|
162 | { |
|
|
163 | int events = 0; |
|
|
164 | if (FD_ISSET (word, (struct fd_set *)vec_ro)) events |= EV_READ; |
|
|
165 | if (FD_ISSET (word, (struct fd_set *)vec_wo)) events |= EV_WRITE; |
|
|
166 | |
224 | |
167 | if (events) |
|
|
168 | fd_event (EV_A_ word, events); |
|
|
169 | } |
|
|
170 | # endif |
225 | #endif |
171 | #else |
|
|
172 | for (word = vec_max; word--; ) |
|
|
173 | { |
|
|
174 | if (((uint32_t *)vec_ro) [word] | ((uint32_t *)vec_wo) [word]) |
|
|
175 | for (offs = 4; offs--; ) |
|
|
176 | { |
|
|
177 | int idx = word * 4 + offs; |
|
|
178 | unsigned char byte_r = vec_ro [idx]; |
|
|
179 | unsigned char byte_w = vec_wo [idx]; |
|
|
180 | int bit; |
|
|
181 | |
|
|
182 | if (byte_r | byte_w) |
|
|
183 | for (bit = 8; bit--; ) |
|
|
184 | { |
|
|
185 | int events = 0; |
|
|
186 | events |= byte_r & (1 << bit) ? EV_READ : 0; |
|
|
187 | events |= byte_w & (1 << bit) ? EV_WRITE : 0; |
|
|
188 | |
|
|
189 | if (events) |
|
|
190 | fd_event (EV_A_ idx * 8 + bit, events); |
|
|
191 | } |
|
|
192 | } |
|
|
193 | } |
|
|
194 | #endif |
|
|
195 | } |
226 | } |
196 | |
227 | |
197 | static int |
228 | int inline_size |
198 | select_init (EV_P_ int flags) |
229 | select_init (EV_P_ int flags) |
199 | { |
230 | { |
200 | method_fudge = 1e-2; /* needed to compensate for select returning early, very conservative */ |
231 | backend_fudge = 0.; /* posix says this is zero */ |
201 | method_modify = select_modify; |
232 | backend_modify = select_modify; |
202 | method_poll = select_poll; |
233 | backend_poll = select_poll; |
203 | |
234 | |
204 | #if EV_SELECT_USE_FD_SET |
235 | #if EV_SELECT_USE_FD_SET |
205 | vec_max = FD_SETSIZE / 32; |
236 | vec_max = FD_SETSIZE / 32; |
206 | vec_ri = ev_malloc (sizeof (struct fd_set)); FD_ZERO ((struct fd_set *)vec_ri); |
237 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
207 | vec_ro = ev_malloc (sizeof (struct fd_set)); |
238 | vec_ro = ev_malloc (sizeof (fd_set)); |
208 | vec_wi = ev_malloc (sizeof (struct fd_set)); FD_ZERO ((struct fd_set *)vec_wi); |
239 | vec_wi = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_wi); |
209 | vec_wo = ev_malloc (sizeof (struct fd_set)); |
240 | vec_wo = ev_malloc (sizeof (fd_set)); |
210 | #else |
241 | #else |
211 | vec_max = 0; |
242 | vec_max = 0; |
212 | vec_ri = 0; |
243 | vec_ri = 0; |
213 | vec_ri = 0; |
244 | vec_ri = 0; |
214 | vec_wo = 0; |
245 | vec_wo = 0; |
215 | vec_wo = 0; |
246 | vec_wo = 0; |
216 | #endif |
247 | #endif |
217 | |
248 | |
218 | return EVMETHOD_SELECT; |
249 | return EVBACKEND_SELECT; |
219 | } |
250 | } |
220 | |
251 | |
221 | static void |
252 | void inline_size |
222 | select_destroy (EV_P) |
253 | select_destroy (EV_P) |
223 | { |
254 | { |
224 | ev_free (vec_ri); |
255 | ev_free (vec_ri); |
225 | ev_free (vec_ro); |
256 | ev_free (vec_ro); |
226 | ev_free (vec_wi); |
257 | ev_free (vec_wi); |