… | |
… | |
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 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> |
… | |
… | |
88 | #else |
96 | #else |
89 | |
97 | |
90 | int word = fd / NFDBITS; |
98 | int word = fd / NFDBITS; |
91 | int mask = 1UL << (fd % NFDBITS); |
99 | int mask = 1UL << (fd % NFDBITS); |
92 | |
100 | |
93 | if (vec_max < word + 1) |
101 | if (expect_false (vec_max < word + 1)) |
94 | { |
102 | { |
95 | int new_max = word + 1; |
103 | int new_max = word + 1; |
96 | |
104 | |
97 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
105 | vec_ri = ev_realloc (vec_ri, new_max * NFDBYTES); |
98 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
106 | vec_ro = ev_realloc (vec_ro, new_max * NFDBYTES); /* could free/malloc */ |
… | |
… | |
132 | tv.tv_sec = (long)timeout; |
140 | tv.tv_sec = (long)timeout; |
133 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
141 | tv.tv_usec = (long)((timeout - (ev_tstamp)tv.tv_sec) * 1e6); |
134 | |
142 | |
135 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
143 | res = select (vec_max * NFDBITS, (fd_set *)vec_ro, (fd_set *)vec_wo, 0, &tv); |
136 | |
144 | |
137 | if (res < 0) |
145 | if (expect_false (res < 0)) |
138 | { |
146 | { |
139 | #if EV_SELECT_IS_WINSOCKET |
147 | #if EV_SELECT_IS_WINSOCKET |
140 | errno = WSAGetLastError (); |
148 | errno = WSAGetLastError (); |
141 | #endif |
149 | #endif |
142 | |
150 | |
… | |
… | |
166 | #endif |
174 | #endif |
167 | |
175 | |
168 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
176 | if (FD_ISSET (handle, (fd_set *)vec_ro)) events |= EV_READ; |
169 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
177 | if (FD_ISSET (handle, (fd_set *)vec_wo)) events |= EV_WRITE; |
170 | |
178 | |
171 | if (events) |
179 | if (expect_true (events)) |
172 | fd_event (EV_A_ fd, events); |
180 | fd_event (EV_A_ fd, events); |
173 | } |
181 | } |
174 | } |
182 | } |
175 | |
183 | |
176 | #else |
184 | #else |
… | |
… | |
189 | int events = 0; |
197 | int events = 0; |
190 | |
198 | |
191 | events |= word_r & mask ? EV_READ : 0; |
199 | events |= word_r & mask ? EV_READ : 0; |
192 | events |= word_w & mask ? EV_WRITE : 0; |
200 | events |= word_w & mask ? EV_WRITE : 0; |
193 | |
201 | |
194 | if (events) |
202 | if (expect_true (events)) |
195 | fd_event (EV_A_ word * NFDBITS + bit, events); |
203 | fd_event (EV_A_ word * NFDBITS + bit, events); |
196 | } |
204 | } |
197 | } |
205 | } |
198 | } |
206 | } |
199 | |
207 | |
200 | #endif |
208 | #endif |
201 | } |
209 | } |
202 | |
210 | |
203 | static int |
211 | int inline_size |
204 | select_init (EV_P_ int flags) |
212 | select_init (EV_P_ int flags) |
205 | { |
213 | { |
206 | method_fudge = 1e-2; /* needed to compensate for select returning early, very conservative */ |
214 | backend_fudge = 0.; /* posix says this is zero */ |
207 | method_modify = select_modify; |
215 | backend_modify = select_modify; |
208 | method_poll = select_poll; |
216 | backend_poll = select_poll; |
209 | |
217 | |
210 | #if EV_SELECT_USE_FD_SET |
218 | #if EV_SELECT_USE_FD_SET |
211 | vec_max = FD_SETSIZE / 32; |
219 | vec_max = FD_SETSIZE / 32; |
212 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
220 | vec_ri = ev_malloc (sizeof (fd_set)); FD_ZERO ((fd_set *)vec_ri); |
213 | vec_ro = ev_malloc (sizeof (fd_set)); |
221 | vec_ro = ev_malloc (sizeof (fd_set)); |
… | |
… | |
222 | #endif |
230 | #endif |
223 | |
231 | |
224 | return EVBACKEND_SELECT; |
232 | return EVBACKEND_SELECT; |
225 | } |
233 | } |
226 | |
234 | |
227 | static void |
235 | void inline_size |
228 | select_destroy (EV_P) |
236 | select_destroy (EV_P) |
229 | { |
237 | { |
230 | ev_free (vec_ri); |
238 | ev_free (vec_ri); |
231 | ev_free (vec_ro); |
239 | ev_free (vec_ro); |
232 | ev_free (vec_wi); |
240 | ev_free (vec_wi); |