1 | /* |
1 | /* |
2 | * libev event processing core, watcher management |
2 | * libev event processing core, watcher management |
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 | #ifdef __cplusplus |
40 | #ifdef __cplusplus |
33 | extern "C" { |
41 | extern "C" { |
34 | #endif |
42 | #endif |
35 | |
43 | |
|
|
44 | /* this big block deduces configuration from config.h */ |
36 | #ifndef EV_STANDALONE |
45 | #ifndef EV_STANDALONE |
|
|
46 | # ifdef EV_CONFIG_H |
|
|
47 | # include EV_CONFIG_H |
|
|
48 | # else |
37 | # include "config.h" |
49 | # include "config.h" |
|
|
50 | # endif |
38 | |
51 | |
39 | # if HAVE_CLOCK_GETTIME |
52 | # if HAVE_CLOCK_GETTIME |
|
|
53 | # ifndef EV_USE_MONOTONIC |
40 | # define EV_USE_MONOTONIC 1 |
54 | # define EV_USE_MONOTONIC 1 |
|
|
55 | # endif |
|
|
56 | # ifndef EV_USE_REALTIME |
41 | # define EV_USE_REALTIME 1 |
57 | # define EV_USE_REALTIME 1 |
|
|
58 | # endif |
|
|
59 | # else |
|
|
60 | # ifndef EV_USE_MONOTONIC |
|
|
61 | # define EV_USE_MONOTONIC 0 |
|
|
62 | # endif |
|
|
63 | # ifndef EV_USE_REALTIME |
|
|
64 | # define EV_USE_REALTIME 0 |
|
|
65 | # endif |
42 | # endif |
66 | # endif |
43 | |
67 | |
44 | # if HAVE_SELECT && HAVE_SYS_SELECT_H |
68 | # ifndef EV_USE_NANOSLEEP |
|
|
69 | # if HAVE_NANOSLEEP |
45 | # define EV_USE_SELECT 1 |
70 | # define EV_USE_NANOSLEEP 1 |
|
|
71 | # else |
|
|
72 | # define EV_USE_NANOSLEEP 0 |
|
|
73 | # endif |
46 | # endif |
74 | # endif |
47 | |
75 | |
48 | # if HAVE_POLL && HAVE_POLL_H |
76 | # ifndef EV_USE_SELECT |
|
|
77 | # if HAVE_SELECT && HAVE_SYS_SELECT_H |
49 | # define EV_USE_POLL 1 |
78 | # define EV_USE_SELECT 1 |
|
|
79 | # else |
|
|
80 | # define EV_USE_SELECT 0 |
|
|
81 | # endif |
50 | # endif |
82 | # endif |
51 | |
83 | |
52 | # if HAVE_EPOLL && HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H |
84 | # ifndef EV_USE_POLL |
|
|
85 | # if HAVE_POLL && HAVE_POLL_H |
53 | # define EV_USE_EPOLL 1 |
86 | # define EV_USE_POLL 1 |
|
|
87 | # else |
|
|
88 | # define EV_USE_POLL 0 |
|
|
89 | # endif |
54 | # endif |
90 | # endif |
55 | |
91 | |
56 | # if HAVE_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H |
92 | # ifndef EV_USE_EPOLL |
|
|
93 | # if HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H |
57 | # define EV_USE_KQUEUE 1 |
94 | # define EV_USE_EPOLL 1 |
|
|
95 | # else |
|
|
96 | # define EV_USE_EPOLL 0 |
|
|
97 | # endif |
58 | # endif |
98 | # endif |
|
|
99 | |
|
|
100 | # ifndef EV_USE_KQUEUE |
|
|
101 | # if HAVE_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H |
|
|
102 | # define EV_USE_KQUEUE 1 |
|
|
103 | # else |
|
|
104 | # define EV_USE_KQUEUE 0 |
|
|
105 | # endif |
|
|
106 | # endif |
|
|
107 | |
|
|
108 | # ifndef EV_USE_PORT |
|
|
109 | # if HAVE_PORT_H && HAVE_PORT_CREATE |
|
|
110 | # define EV_USE_PORT 1 |
|
|
111 | # else |
|
|
112 | # define EV_USE_PORT 0 |
|
|
113 | # endif |
|
|
114 | # endif |
59 | |
115 | |
|
|
116 | # ifndef EV_USE_INOTIFY |
|
|
117 | # if HAVE_INOTIFY_INIT && HAVE_SYS_INOTIFY_H |
|
|
118 | # define EV_USE_INOTIFY 1 |
|
|
119 | # else |
|
|
120 | # define EV_USE_INOTIFY 0 |
|
|
121 | # endif |
|
|
122 | # endif |
|
|
123 | |
|
|
124 | # ifndef EV_USE_EVENTFD |
|
|
125 | # if HAVE_EVENTFD |
|
|
126 | # define EV_USE_EVENTFD 1 |
|
|
127 | # else |
|
|
128 | # define EV_USE_EVENTFD 0 |
|
|
129 | # endif |
|
|
130 | # endif |
|
|
131 | |
60 | #endif |
132 | #endif |
61 | |
133 | |
62 | #include <math.h> |
134 | #include <math.h> |
63 | #include <stdlib.h> |
135 | #include <stdlib.h> |
64 | #include <fcntl.h> |
136 | #include <fcntl.h> |
… | |
… | |
71 | #include <sys/types.h> |
143 | #include <sys/types.h> |
72 | #include <time.h> |
144 | #include <time.h> |
73 | |
145 | |
74 | #include <signal.h> |
146 | #include <signal.h> |
75 | |
147 | |
76 | #ifndef WIN32 |
|
|
77 | # include <unistd.h> |
|
|
78 | # include <sys/time.h> |
|
|
79 | # include <sys/wait.h> |
|
|
80 | #endif |
|
|
81 | /**/ |
|
|
82 | |
|
|
83 | #ifndef EV_USE_MONOTONIC |
|
|
84 | # define EV_USE_MONOTONIC 1 |
|
|
85 | #endif |
|
|
86 | |
|
|
87 | #ifndef EV_USE_SELECT |
|
|
88 | # define EV_USE_SELECT 1 |
|
|
89 | #endif |
|
|
90 | |
|
|
91 | #ifndef EV_USE_POLL |
|
|
92 | # define EV_USE_POLL 0 /* poll is usually slower than select, and not as well tested */ |
|
|
93 | #endif |
|
|
94 | |
|
|
95 | #ifndef EV_USE_EPOLL |
|
|
96 | # define EV_USE_EPOLL 0 |
|
|
97 | #endif |
|
|
98 | |
|
|
99 | #ifndef EV_USE_KQUEUE |
|
|
100 | # define EV_USE_KQUEUE 0 |
|
|
101 | #endif |
|
|
102 | |
|
|
103 | #ifndef EV_USE_WIN32 |
|
|
104 | # ifdef WIN32 |
|
|
105 | # define EV_USE_WIN32 0 /* it does not exist, use select */ |
|
|
106 | # undef EV_USE_SELECT |
|
|
107 | # define EV_USE_SELECT 1 |
|
|
108 | # else |
|
|
109 | # define EV_USE_WIN32 0 |
|
|
110 | # endif |
|
|
111 | #endif |
|
|
112 | |
|
|
113 | #ifndef EV_USE_REALTIME |
|
|
114 | # define EV_USE_REALTIME 1 |
|
|
115 | #endif |
|
|
116 | |
|
|
117 | /**/ |
|
|
118 | |
|
|
119 | #ifndef CLOCK_MONOTONIC |
|
|
120 | # undef EV_USE_MONOTONIC |
|
|
121 | # define EV_USE_MONOTONIC 0 |
|
|
122 | #endif |
|
|
123 | |
|
|
124 | #ifndef CLOCK_REALTIME |
|
|
125 | # undef EV_USE_REALTIME |
|
|
126 | # define EV_USE_REALTIME 0 |
|
|
127 | #endif |
|
|
128 | |
|
|
129 | /**/ |
|
|
130 | |
|
|
131 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
|
|
132 | #define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
|
|
133 | #define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
|
|
134 | /*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
|
|
135 | |
|
|
136 | #ifdef EV_H |
148 | #ifdef EV_H |
137 | # include EV_H |
149 | # include EV_H |
138 | #else |
150 | #else |
139 | # include "ev.h" |
151 | # include "ev.h" |
140 | #endif |
152 | #endif |
141 | |
153 | |
|
|
154 | #ifndef _WIN32 |
|
|
155 | # include <sys/time.h> |
|
|
156 | # include <sys/wait.h> |
|
|
157 | # include <unistd.h> |
|
|
158 | #else |
|
|
159 | # define WIN32_LEAN_AND_MEAN |
|
|
160 | # include <windows.h> |
|
|
161 | # ifndef EV_SELECT_IS_WINSOCKET |
|
|
162 | # define EV_SELECT_IS_WINSOCKET 1 |
|
|
163 | # endif |
|
|
164 | #endif |
|
|
165 | |
|
|
166 | /* this block tries to deduce configuration from header-defined symbols and defaults */ |
|
|
167 | |
|
|
168 | #ifndef EV_USE_MONOTONIC |
|
|
169 | # define EV_USE_MONOTONIC 0 |
|
|
170 | #endif |
|
|
171 | |
|
|
172 | #ifndef EV_USE_REALTIME |
|
|
173 | # define EV_USE_REALTIME 0 |
|
|
174 | #endif |
|
|
175 | |
|
|
176 | #ifndef EV_USE_NANOSLEEP |
|
|
177 | # define EV_USE_NANOSLEEP 0 |
|
|
178 | #endif |
|
|
179 | |
|
|
180 | #ifndef EV_USE_SELECT |
|
|
181 | # define EV_USE_SELECT 1 |
|
|
182 | #endif |
|
|
183 | |
|
|
184 | #ifndef EV_USE_POLL |
|
|
185 | # ifdef _WIN32 |
|
|
186 | # define EV_USE_POLL 0 |
|
|
187 | # else |
|
|
188 | # define EV_USE_POLL 1 |
|
|
189 | # endif |
|
|
190 | #endif |
|
|
191 | |
|
|
192 | #ifndef EV_USE_EPOLL |
|
|
193 | # if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 4)) |
|
|
194 | # define EV_USE_EPOLL 1 |
|
|
195 | # else |
|
|
196 | # define EV_USE_EPOLL 0 |
|
|
197 | # endif |
|
|
198 | #endif |
|
|
199 | |
|
|
200 | #ifndef EV_USE_KQUEUE |
|
|
201 | # define EV_USE_KQUEUE 0 |
|
|
202 | #endif |
|
|
203 | |
|
|
204 | #ifndef EV_USE_PORT |
|
|
205 | # define EV_USE_PORT 0 |
|
|
206 | #endif |
|
|
207 | |
|
|
208 | #ifndef EV_USE_INOTIFY |
|
|
209 | # if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 4)) |
|
|
210 | # define EV_USE_INOTIFY 1 |
|
|
211 | # else |
|
|
212 | # define EV_USE_INOTIFY 0 |
|
|
213 | # endif |
|
|
214 | #endif |
|
|
215 | |
|
|
216 | #ifndef EV_PID_HASHSIZE |
|
|
217 | # if EV_MINIMAL |
|
|
218 | # define EV_PID_HASHSIZE 1 |
|
|
219 | # else |
|
|
220 | # define EV_PID_HASHSIZE 16 |
|
|
221 | # endif |
|
|
222 | #endif |
|
|
223 | |
|
|
224 | #ifndef EV_INOTIFY_HASHSIZE |
|
|
225 | # if EV_MINIMAL |
|
|
226 | # define EV_INOTIFY_HASHSIZE 1 |
|
|
227 | # else |
|
|
228 | # define EV_INOTIFY_HASHSIZE 16 |
|
|
229 | # endif |
|
|
230 | #endif |
|
|
231 | |
|
|
232 | #ifndef EV_USE_EVENTFD |
|
|
233 | # if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7)) |
|
|
234 | # define EV_USE_EVENTFD 1 |
|
|
235 | # else |
|
|
236 | # define EV_USE_EVENTFD 0 |
|
|
237 | # endif |
|
|
238 | #endif |
|
|
239 | |
|
|
240 | #if 0 /* debugging */ |
|
|
241 | # define EV_VERIFY 3 |
|
|
242 | # define EV_USE_4HEAP 1 |
|
|
243 | # define EV_HEAP_CACHE_AT 1 |
|
|
244 | #endif |
|
|
245 | |
|
|
246 | #ifndef EV_VERIFY |
|
|
247 | # define EV_VERIFY !EV_MINIMAL |
|
|
248 | #endif |
|
|
249 | |
|
|
250 | #ifndef EV_USE_4HEAP |
|
|
251 | # define EV_USE_4HEAP !EV_MINIMAL |
|
|
252 | #endif |
|
|
253 | |
|
|
254 | #ifndef EV_HEAP_CACHE_AT |
|
|
255 | # define EV_HEAP_CACHE_AT !EV_MINIMAL |
|
|
256 | #endif |
|
|
257 | |
|
|
258 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
|
|
259 | |
|
|
260 | #ifndef CLOCK_MONOTONIC |
|
|
261 | # undef EV_USE_MONOTONIC |
|
|
262 | # define EV_USE_MONOTONIC 0 |
|
|
263 | #endif |
|
|
264 | |
|
|
265 | #ifndef CLOCK_REALTIME |
|
|
266 | # undef EV_USE_REALTIME |
|
|
267 | # define EV_USE_REALTIME 0 |
|
|
268 | #endif |
|
|
269 | |
|
|
270 | #if !EV_STAT_ENABLE |
|
|
271 | # undef EV_USE_INOTIFY |
|
|
272 | # define EV_USE_INOTIFY 0 |
|
|
273 | #endif |
|
|
274 | |
|
|
275 | #if !EV_USE_NANOSLEEP |
|
|
276 | # ifndef _WIN32 |
|
|
277 | # include <sys/select.h> |
|
|
278 | # endif |
|
|
279 | #endif |
|
|
280 | |
|
|
281 | #if EV_USE_INOTIFY |
|
|
282 | # include <sys/inotify.h> |
|
|
283 | #endif |
|
|
284 | |
|
|
285 | #if EV_SELECT_IS_WINSOCKET |
|
|
286 | # include <winsock.h> |
|
|
287 | #endif |
|
|
288 | |
|
|
289 | #if EV_USE_EVENTFD |
|
|
290 | /* our minimum requirement is glibc 2.7 which has the stub, but not the header */ |
|
|
291 | # include <stdint.h> |
|
|
292 | # ifdef __cplusplus |
|
|
293 | extern "C" { |
|
|
294 | # endif |
|
|
295 | int eventfd (unsigned int initval, int flags); |
|
|
296 | # ifdef __cplusplus |
|
|
297 | } |
|
|
298 | # endif |
|
|
299 | #endif |
|
|
300 | |
|
|
301 | /**/ |
|
|
302 | |
|
|
303 | #if EV_VERIFY >= 3 |
|
|
304 | # define EV_FREQUENT_CHECK ev_loop_verify (EV_A) |
|
|
305 | #else |
|
|
306 | # define EV_FREQUENT_CHECK do { } while (0) |
|
|
307 | #endif |
|
|
308 | |
|
|
309 | /* |
|
|
310 | * This is used to avoid floating point rounding problems. |
|
|
311 | * It is added to ev_rt_now when scheduling periodics |
|
|
312 | * to ensure progress, time-wise, even when rounding |
|
|
313 | * errors are against us. |
|
|
314 | * This value is good at least till the year 4000. |
|
|
315 | * Better solutions welcome. |
|
|
316 | */ |
|
|
317 | #define TIME_EPSILON 0.0001220703125 /* 1/8192 */ |
|
|
318 | |
|
|
319 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
|
|
320 | #define MAX_BLOCKTIME 59.743 /* never wait longer than this time (to detect time jumps) */ |
|
|
321 | /*#define CLEANUP_INTERVAL (MAX_BLOCKTIME * 5.) /* how often to try to free memory and re-check fds, TODO */ |
|
|
322 | |
142 | #if __GNUC__ >= 3 |
323 | #if __GNUC__ >= 4 |
143 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
324 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
144 | # define inline inline |
325 | # define noinline __attribute__ ((noinline)) |
145 | #else |
326 | #else |
146 | # define expect(expr,value) (expr) |
327 | # define expect(expr,value) (expr) |
147 | # define inline static |
328 | # define noinline |
|
|
329 | # if __STDC_VERSION__ < 199901L && __GNUC__ < 2 |
|
|
330 | # define inline |
|
|
331 | # endif |
148 | #endif |
332 | #endif |
149 | |
333 | |
150 | #define expect_false(expr) expect ((expr) != 0, 0) |
334 | #define expect_false(expr) expect ((expr) != 0, 0) |
151 | #define expect_true(expr) expect ((expr) != 0, 1) |
335 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
336 | #define inline_size static inline |
|
|
337 | |
|
|
338 | #if EV_MINIMAL |
|
|
339 | # define inline_speed static noinline |
|
|
340 | #else |
|
|
341 | # define inline_speed static inline |
|
|
342 | #endif |
152 | |
343 | |
153 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
344 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
154 | #define ABSPRI(w) ((w)->priority - EV_MINPRI) |
345 | #define ABSPRI(w) (((W)w)->priority - EV_MINPRI) |
155 | |
346 | |
|
|
347 | #define EMPTY /* required for microsofts broken pseudo-c compiler */ |
|
|
348 | #define EMPTY2(a,b) /* used to suppress some warnings */ |
|
|
349 | |
156 | typedef struct ev_watcher *W; |
350 | typedef ev_watcher *W; |
157 | typedef struct ev_watcher_list *WL; |
351 | typedef ev_watcher_list *WL; |
158 | typedef struct ev_watcher_time *WT; |
352 | typedef ev_watcher_time *WT; |
159 | |
353 | |
|
|
354 | #define ev_active(w) ((W)(w))->active |
|
|
355 | #define ev_at(w) ((WT)(w))->at |
|
|
356 | |
|
|
357 | #if EV_USE_MONOTONIC |
|
|
358 | /* sig_atomic_t is used to avoid per-thread variables or locking but still */ |
|
|
359 | /* giving it a reasonably high chance of working on typical architetcures */ |
160 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
360 | static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
|
|
361 | #endif |
161 | |
362 | |
|
|
363 | #ifdef _WIN32 |
162 | #include "ev_win32.c" |
364 | # include "ev_win32.c" |
|
|
365 | #endif |
163 | |
366 | |
164 | /*****************************************************************************/ |
367 | /*****************************************************************************/ |
165 | |
368 | |
166 | static void (*syserr_cb)(const char *msg); |
369 | static void (*syserr_cb)(const char *msg); |
167 | |
370 | |
|
|
371 | void |
168 | void ev_set_syserr_cb (void (*cb)(const char *msg)) |
372 | ev_set_syserr_cb (void (*cb)(const char *msg)) |
169 | { |
373 | { |
170 | syserr_cb = cb; |
374 | syserr_cb = cb; |
171 | } |
375 | } |
172 | |
376 | |
173 | static void |
377 | static void noinline |
174 | syserr (const char *msg) |
378 | syserr (const char *msg) |
175 | { |
379 | { |
176 | if (!msg) |
380 | if (!msg) |
177 | msg = "(libev) system error"; |
381 | msg = "(libev) system error"; |
178 | |
382 | |
… | |
… | |
183 | perror (msg); |
387 | perror (msg); |
184 | abort (); |
388 | abort (); |
185 | } |
389 | } |
186 | } |
390 | } |
187 | |
391 | |
|
|
392 | static void * |
|
|
393 | ev_realloc_emul (void *ptr, long size) |
|
|
394 | { |
|
|
395 | /* some systems, notably openbsd and darwin, fail to properly |
|
|
396 | * implement realloc (x, 0) (as required by both ansi c-98 and |
|
|
397 | * the single unix specification, so work around them here. |
|
|
398 | */ |
|
|
399 | |
|
|
400 | if (size) |
|
|
401 | return realloc (ptr, size); |
|
|
402 | |
|
|
403 | free (ptr); |
|
|
404 | return 0; |
|
|
405 | } |
|
|
406 | |
188 | static void *(*alloc)(void *ptr, long size); |
407 | static void *(*alloc)(void *ptr, long size) = ev_realloc_emul; |
189 | |
408 | |
|
|
409 | void |
190 | void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
410 | ev_set_allocator (void *(*cb)(void *ptr, long size)) |
191 | { |
411 | { |
192 | alloc = cb; |
412 | alloc = cb; |
193 | } |
413 | } |
194 | |
414 | |
195 | static void * |
415 | inline_speed void * |
196 | ev_realloc (void *ptr, long size) |
416 | ev_realloc (void *ptr, long size) |
197 | { |
417 | { |
198 | ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
418 | ptr = alloc (ptr, size); |
199 | |
419 | |
200 | if (!ptr && size) |
420 | if (!ptr && size) |
201 | { |
421 | { |
202 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
422 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
203 | abort (); |
423 | abort (); |
… | |
… | |
214 | typedef struct |
434 | typedef struct |
215 | { |
435 | { |
216 | WL head; |
436 | WL head; |
217 | unsigned char events; |
437 | unsigned char events; |
218 | unsigned char reify; |
438 | unsigned char reify; |
|
|
439 | #if EV_SELECT_IS_WINSOCKET |
|
|
440 | SOCKET handle; |
|
|
441 | #endif |
219 | } ANFD; |
442 | } ANFD; |
220 | |
443 | |
221 | typedef struct |
444 | typedef struct |
222 | { |
445 | { |
223 | W w; |
446 | W w; |
224 | int events; |
447 | int events; |
225 | } ANPENDING; |
448 | } ANPENDING; |
226 | |
449 | |
|
|
450 | #if EV_USE_INOTIFY |
|
|
451 | /* hash table entry per inotify-id */ |
|
|
452 | typedef struct |
|
|
453 | { |
|
|
454 | WL head; |
|
|
455 | } ANFS; |
|
|
456 | #endif |
|
|
457 | |
|
|
458 | /* Heap Entry */ |
|
|
459 | #if EV_HEAP_CACHE_AT |
|
|
460 | typedef struct { |
|
|
461 | ev_tstamp at; |
|
|
462 | WT w; |
|
|
463 | } ANHE; |
|
|
464 | |
|
|
465 | #define ANHE_w(he) (he).w /* access watcher, read-write */ |
|
|
466 | #define ANHE_at(he) (he).at /* access cached at, read-only */ |
|
|
467 | #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */ |
|
|
468 | #else |
|
|
469 | typedef WT ANHE; |
|
|
470 | |
|
|
471 | #define ANHE_w(he) (he) |
|
|
472 | #define ANHE_at(he) (he)->at |
|
|
473 | #define ANHE_at_cache(he) |
|
|
474 | #endif |
|
|
475 | |
227 | #if EV_MULTIPLICITY |
476 | #if EV_MULTIPLICITY |
228 | |
477 | |
229 | struct ev_loop |
478 | struct ev_loop |
230 | { |
479 | { |
231 | ev_tstamp ev_rt_now; |
480 | ev_tstamp ev_rt_now; |
|
|
481 | #define ev_rt_now ((loop)->ev_rt_now) |
232 | #define VAR(name,decl) decl; |
482 | #define VAR(name,decl) decl; |
233 | #include "ev_vars.h" |
483 | #include "ev_vars.h" |
234 | #undef VAR |
484 | #undef VAR |
235 | }; |
485 | }; |
236 | #include "ev_wrap.h" |
486 | #include "ev_wrap.h" |
237 | |
487 | |
238 | struct ev_loop default_loop_struct; |
488 | static struct ev_loop default_loop_struct; |
239 | static struct ev_loop *default_loop; |
489 | struct ev_loop *ev_default_loop_ptr; |
240 | |
490 | |
241 | #else |
491 | #else |
242 | |
492 | |
243 | ev_tstamp ev_rt_now; |
493 | ev_tstamp ev_rt_now; |
244 | #define VAR(name,decl) static decl; |
494 | #define VAR(name,decl) static decl; |
245 | #include "ev_vars.h" |
495 | #include "ev_vars.h" |
246 | #undef VAR |
496 | #undef VAR |
247 | |
497 | |
248 | static int default_loop; |
498 | static int ev_default_loop_ptr; |
249 | |
499 | |
250 | #endif |
500 | #endif |
251 | |
501 | |
252 | /*****************************************************************************/ |
502 | /*****************************************************************************/ |
253 | |
503 | |
254 | inline ev_tstamp |
504 | ev_tstamp |
255 | ev_time (void) |
505 | ev_time (void) |
256 | { |
506 | { |
257 | #if EV_USE_REALTIME |
507 | #if EV_USE_REALTIME |
258 | struct timespec ts; |
508 | struct timespec ts; |
259 | clock_gettime (CLOCK_REALTIME, &ts); |
509 | clock_gettime (CLOCK_REALTIME, &ts); |
… | |
… | |
263 | gettimeofday (&tv, 0); |
513 | gettimeofday (&tv, 0); |
264 | return tv.tv_sec + tv.tv_usec * 1e-6; |
514 | return tv.tv_sec + tv.tv_usec * 1e-6; |
265 | #endif |
515 | #endif |
266 | } |
516 | } |
267 | |
517 | |
268 | inline ev_tstamp |
518 | ev_tstamp inline_size |
269 | get_clock (void) |
519 | get_clock (void) |
270 | { |
520 | { |
271 | #if EV_USE_MONOTONIC |
521 | #if EV_USE_MONOTONIC |
272 | if (expect_true (have_monotonic)) |
522 | if (expect_true (have_monotonic)) |
273 | { |
523 | { |
… | |
… | |
286 | { |
536 | { |
287 | return ev_rt_now; |
537 | return ev_rt_now; |
288 | } |
538 | } |
289 | #endif |
539 | #endif |
290 | |
540 | |
291 | #define array_roundsize(type,n) ((n) | 4 & ~3) |
541 | void |
|
|
542 | ev_sleep (ev_tstamp delay) |
|
|
543 | { |
|
|
544 | if (delay > 0.) |
|
|
545 | { |
|
|
546 | #if EV_USE_NANOSLEEP |
|
|
547 | struct timespec ts; |
|
|
548 | |
|
|
549 | ts.tv_sec = (time_t)delay; |
|
|
550 | ts.tv_nsec = (long)((delay - (ev_tstamp)(ts.tv_sec)) * 1e9); |
|
|
551 | |
|
|
552 | nanosleep (&ts, 0); |
|
|
553 | #elif defined(_WIN32) |
|
|
554 | Sleep ((unsigned long)(delay * 1e3)); |
|
|
555 | #else |
|
|
556 | struct timeval tv; |
|
|
557 | |
|
|
558 | tv.tv_sec = (time_t)delay; |
|
|
559 | tv.tv_usec = (long)((delay - (ev_tstamp)(tv.tv_sec)) * 1e6); |
|
|
560 | |
|
|
561 | select (0, 0, 0, 0, &tv); |
|
|
562 | #endif |
|
|
563 | } |
|
|
564 | } |
|
|
565 | |
|
|
566 | /*****************************************************************************/ |
|
|
567 | |
|
|
568 | #define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */ |
|
|
569 | |
|
|
570 | int inline_size |
|
|
571 | array_nextsize (int elem, int cur, int cnt) |
|
|
572 | { |
|
|
573 | int ncur = cur + 1; |
|
|
574 | |
|
|
575 | do |
|
|
576 | ncur <<= 1; |
|
|
577 | while (cnt > ncur); |
|
|
578 | |
|
|
579 | /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */ |
|
|
580 | if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4) |
|
|
581 | { |
|
|
582 | ncur *= elem; |
|
|
583 | ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1); |
|
|
584 | ncur = ncur - sizeof (void *) * 4; |
|
|
585 | ncur /= elem; |
|
|
586 | } |
|
|
587 | |
|
|
588 | return ncur; |
|
|
589 | } |
|
|
590 | |
|
|
591 | static noinline void * |
|
|
592 | array_realloc (int elem, void *base, int *cur, int cnt) |
|
|
593 | { |
|
|
594 | *cur = array_nextsize (elem, *cur, cnt); |
|
|
595 | return ev_realloc (base, elem * *cur); |
|
|
596 | } |
292 | |
597 | |
293 | #define array_needsize(type,base,cur,cnt,init) \ |
598 | #define array_needsize(type,base,cur,cnt,init) \ |
294 | if (expect_false ((cnt) > cur)) \ |
599 | if (expect_false ((cnt) > (cur))) \ |
295 | { \ |
600 | { \ |
296 | int newcnt = cur; \ |
601 | int ocur_ = (cur); \ |
297 | do \ |
602 | (base) = (type *)array_realloc \ |
298 | { \ |
603 | (sizeof (type), (base), &(cur), (cnt)); \ |
299 | newcnt = array_roundsize (type, newcnt << 1); \ |
604 | init ((base) + (ocur_), (cur) - ocur_); \ |
300 | } \ |
|
|
301 | while ((cnt) > newcnt); \ |
|
|
302 | \ |
|
|
303 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
|
|
304 | init (base + cur, newcnt - cur); \ |
|
|
305 | cur = newcnt; \ |
|
|
306 | } |
605 | } |
307 | |
606 | |
|
|
607 | #if 0 |
308 | #define array_slim(type,stem) \ |
608 | #define array_slim(type,stem) \ |
309 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
609 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
310 | { \ |
610 | { \ |
311 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
611 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
312 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
612 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
313 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
613 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
314 | } |
614 | } |
315 | |
615 | #endif |
316 | /* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ |
|
|
317 | /* bringing us everlasting joy in form of stupid extra macros that are not required in C */ |
|
|
318 | #define array_free_microshit(stem) \ |
|
|
319 | ev_free (stem ## s); stem ## cnt = stem ## max = 0; |
|
|
320 | |
616 | |
321 | #define array_free(stem, idx) \ |
617 | #define array_free(stem, idx) \ |
322 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
618 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
323 | |
619 | |
324 | /*****************************************************************************/ |
620 | /*****************************************************************************/ |
325 | |
621 | |
326 | static void |
622 | void noinline |
|
|
623 | ev_feed_event (EV_P_ void *w, int revents) |
|
|
624 | { |
|
|
625 | W w_ = (W)w; |
|
|
626 | int pri = ABSPRI (w_); |
|
|
627 | |
|
|
628 | if (expect_false (w_->pending)) |
|
|
629 | pendings [pri][w_->pending - 1].events |= revents; |
|
|
630 | else |
|
|
631 | { |
|
|
632 | w_->pending = ++pendingcnt [pri]; |
|
|
633 | array_needsize (ANPENDING, pendings [pri], pendingmax [pri], w_->pending, EMPTY2); |
|
|
634 | pendings [pri][w_->pending - 1].w = w_; |
|
|
635 | pendings [pri][w_->pending - 1].events = revents; |
|
|
636 | } |
|
|
637 | } |
|
|
638 | |
|
|
639 | void inline_speed |
|
|
640 | queue_events (EV_P_ W *events, int eventcnt, int type) |
|
|
641 | { |
|
|
642 | int i; |
|
|
643 | |
|
|
644 | for (i = 0; i < eventcnt; ++i) |
|
|
645 | ev_feed_event (EV_A_ events [i], type); |
|
|
646 | } |
|
|
647 | |
|
|
648 | /*****************************************************************************/ |
|
|
649 | |
|
|
650 | void inline_size |
327 | anfds_init (ANFD *base, int count) |
651 | anfds_init (ANFD *base, int count) |
328 | { |
652 | { |
329 | while (count--) |
653 | while (count--) |
330 | { |
654 | { |
331 | base->head = 0; |
655 | base->head = 0; |
… | |
… | |
334 | |
658 | |
335 | ++base; |
659 | ++base; |
336 | } |
660 | } |
337 | } |
661 | } |
338 | |
662 | |
339 | void |
663 | void inline_speed |
340 | ev_feed_event (EV_P_ void *w, int revents) |
|
|
341 | { |
|
|
342 | W w_ = (W)w; |
|
|
343 | |
|
|
344 | if (w_->pending) |
|
|
345 | { |
|
|
346 | pendings [ABSPRI (w_)][w_->pending - 1].events |= revents; |
|
|
347 | return; |
|
|
348 | } |
|
|
349 | |
|
|
350 | w_->pending = ++pendingcnt [ABSPRI (w_)]; |
|
|
351 | array_needsize (ANPENDING, pendings [ABSPRI (w_)], pendingmax [ABSPRI (w_)], pendingcnt [ABSPRI (w_)], (void)); |
|
|
352 | pendings [ABSPRI (w_)][w_->pending - 1].w = w_; |
|
|
353 | pendings [ABSPRI (w_)][w_->pending - 1].events = revents; |
|
|
354 | } |
|
|
355 | |
|
|
356 | static void |
|
|
357 | queue_events (EV_P_ W *events, int eventcnt, int type) |
|
|
358 | { |
|
|
359 | int i; |
|
|
360 | |
|
|
361 | for (i = 0; i < eventcnt; ++i) |
|
|
362 | ev_feed_event (EV_A_ events [i], type); |
|
|
363 | } |
|
|
364 | |
|
|
365 | inline void |
|
|
366 | fd_event (EV_P_ int fd, int revents) |
664 | fd_event (EV_P_ int fd, int revents) |
367 | { |
665 | { |
368 | ANFD *anfd = anfds + fd; |
666 | ANFD *anfd = anfds + fd; |
369 | struct ev_io *w; |
667 | ev_io *w; |
370 | |
668 | |
371 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
669 | for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next) |
372 | { |
670 | { |
373 | int ev = w->events & revents; |
671 | int ev = w->events & revents; |
374 | |
672 | |
375 | if (ev) |
673 | if (ev) |
376 | ev_feed_event (EV_A_ (W)w, ev); |
674 | ev_feed_event (EV_A_ (W)w, ev); |
… | |
… | |
378 | } |
676 | } |
379 | |
677 | |
380 | void |
678 | void |
381 | ev_feed_fd_event (EV_P_ int fd, int revents) |
679 | ev_feed_fd_event (EV_P_ int fd, int revents) |
382 | { |
680 | { |
|
|
681 | if (fd >= 0 && fd < anfdmax) |
383 | fd_event (EV_A_ fd, revents); |
682 | fd_event (EV_A_ fd, revents); |
384 | } |
683 | } |
385 | |
684 | |
386 | /*****************************************************************************/ |
685 | void inline_size |
387 | |
|
|
388 | static void |
|
|
389 | fd_reify (EV_P) |
686 | fd_reify (EV_P) |
390 | { |
687 | { |
391 | int i; |
688 | int i; |
392 | |
689 | |
393 | for (i = 0; i < fdchangecnt; ++i) |
690 | for (i = 0; i < fdchangecnt; ++i) |
394 | { |
691 | { |
395 | int fd = fdchanges [i]; |
692 | int fd = fdchanges [i]; |
396 | ANFD *anfd = anfds + fd; |
693 | ANFD *anfd = anfds + fd; |
397 | struct ev_io *w; |
694 | ev_io *w; |
398 | |
695 | |
399 | int events = 0; |
696 | unsigned char events = 0; |
400 | |
697 | |
401 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
698 | for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next) |
402 | events |= w->events; |
699 | events |= (unsigned char)w->events; |
403 | |
700 | |
|
|
701 | #if EV_SELECT_IS_WINSOCKET |
|
|
702 | if (events) |
|
|
703 | { |
|
|
704 | unsigned long argp; |
|
|
705 | #ifdef EV_FD_TO_WIN32_HANDLE |
|
|
706 | anfd->handle = EV_FD_TO_WIN32_HANDLE (fd); |
|
|
707 | #else |
|
|
708 | anfd->handle = _get_osfhandle (fd); |
|
|
709 | #endif |
|
|
710 | assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &argp) == 0)); |
|
|
711 | } |
|
|
712 | #endif |
|
|
713 | |
|
|
714 | { |
|
|
715 | unsigned char o_events = anfd->events; |
|
|
716 | unsigned char o_reify = anfd->reify; |
|
|
717 | |
404 | anfd->reify = 0; |
718 | anfd->reify = 0; |
405 | |
|
|
406 | method_modify (EV_A_ fd, anfd->events, events); |
|
|
407 | anfd->events = events; |
719 | anfd->events = events; |
|
|
720 | |
|
|
721 | if (o_events != events || o_reify & EV_IOFDSET) |
|
|
722 | backend_modify (EV_A_ fd, o_events, events); |
|
|
723 | } |
408 | } |
724 | } |
409 | |
725 | |
410 | fdchangecnt = 0; |
726 | fdchangecnt = 0; |
411 | } |
727 | } |
412 | |
728 | |
413 | static void |
729 | void inline_size |
414 | fd_change (EV_P_ int fd) |
730 | fd_change (EV_P_ int fd, int flags) |
415 | { |
731 | { |
416 | if (anfds [fd].reify) |
732 | unsigned char reify = anfds [fd].reify; |
417 | return; |
|
|
418 | |
|
|
419 | anfds [fd].reify = 1; |
733 | anfds [fd].reify |= flags; |
420 | |
734 | |
|
|
735 | if (expect_true (!reify)) |
|
|
736 | { |
421 | ++fdchangecnt; |
737 | ++fdchangecnt; |
422 | array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void)); |
738 | array_needsize (int, fdchanges, fdchangemax, fdchangecnt, EMPTY2); |
423 | fdchanges [fdchangecnt - 1] = fd; |
739 | fdchanges [fdchangecnt - 1] = fd; |
|
|
740 | } |
424 | } |
741 | } |
425 | |
742 | |
426 | static void |
743 | void inline_speed |
427 | fd_kill (EV_P_ int fd) |
744 | fd_kill (EV_P_ int fd) |
428 | { |
745 | { |
429 | struct ev_io *w; |
746 | ev_io *w; |
430 | |
747 | |
431 | while ((w = (struct ev_io *)anfds [fd].head)) |
748 | while ((w = (ev_io *)anfds [fd].head)) |
432 | { |
749 | { |
433 | ev_io_stop (EV_A_ w); |
750 | ev_io_stop (EV_A_ w); |
434 | ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
751 | ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
435 | } |
752 | } |
436 | } |
753 | } |
437 | |
754 | |
438 | static int |
755 | int inline_size |
439 | fd_valid (int fd) |
756 | fd_valid (int fd) |
440 | { |
757 | { |
441 | #ifdef WIN32 |
758 | #ifdef _WIN32 |
442 | return !!win32_get_osfhandle (fd); |
759 | return _get_osfhandle (fd) != -1; |
443 | #else |
760 | #else |
444 | return fcntl (fd, F_GETFD) != -1; |
761 | return fcntl (fd, F_GETFD) != -1; |
445 | #endif |
762 | #endif |
446 | } |
763 | } |
447 | |
764 | |
448 | /* called on EBADF to verify fds */ |
765 | /* called on EBADF to verify fds */ |
449 | static void |
766 | static void noinline |
450 | fd_ebadf (EV_P) |
767 | fd_ebadf (EV_P) |
451 | { |
768 | { |
452 | int fd; |
769 | int fd; |
453 | |
770 | |
454 | for (fd = 0; fd < anfdmax; ++fd) |
771 | for (fd = 0; fd < anfdmax; ++fd) |
… | |
… | |
456 | if (!fd_valid (fd) == -1 && errno == EBADF) |
773 | if (!fd_valid (fd) == -1 && errno == EBADF) |
457 | fd_kill (EV_A_ fd); |
774 | fd_kill (EV_A_ fd); |
458 | } |
775 | } |
459 | |
776 | |
460 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
777 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
461 | static void |
778 | static void noinline |
462 | fd_enomem (EV_P) |
779 | fd_enomem (EV_P) |
463 | { |
780 | { |
464 | int fd; |
781 | int fd; |
465 | |
782 | |
466 | for (fd = anfdmax; fd--; ) |
783 | for (fd = anfdmax; fd--; ) |
… | |
… | |
469 | fd_kill (EV_A_ fd); |
786 | fd_kill (EV_A_ fd); |
470 | return; |
787 | return; |
471 | } |
788 | } |
472 | } |
789 | } |
473 | |
790 | |
474 | /* usually called after fork if method needs to re-arm all fds from scratch */ |
791 | /* usually called after fork if backend needs to re-arm all fds from scratch */ |
475 | static void |
792 | static void noinline |
476 | fd_rearm_all (EV_P) |
793 | fd_rearm_all (EV_P) |
477 | { |
794 | { |
478 | int fd; |
795 | int fd; |
479 | |
796 | |
480 | /* this should be highly optimised to not do anything but set a flag */ |
|
|
481 | for (fd = 0; fd < anfdmax; ++fd) |
797 | for (fd = 0; fd < anfdmax; ++fd) |
482 | if (anfds [fd].events) |
798 | if (anfds [fd].events) |
483 | { |
799 | { |
484 | anfds [fd].events = 0; |
800 | anfds [fd].events = 0; |
485 | fd_change (EV_A_ fd); |
801 | fd_change (EV_A_ fd, EV_IOFDSET | 1); |
486 | } |
802 | } |
487 | } |
803 | } |
488 | |
804 | |
489 | /*****************************************************************************/ |
805 | /*****************************************************************************/ |
490 | |
806 | |
491 | static void |
807 | /* |
492 | upheap (WT *heap, int k) |
808 | * the heap functions want a real array index. array index 0 uis guaranteed to not |
493 | { |
809 | * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives |
494 | WT w = heap [k]; |
810 | * the branching factor of the d-tree. |
|
|
811 | */ |
495 | |
812 | |
496 | while (k && heap [k >> 1]->at > w->at) |
813 | /* |
497 | { |
814 | * at the moment we allow libev the luxury of two heaps, |
498 | heap [k] = heap [k >> 1]; |
815 | * a small-code-size 2-heap one and a ~1.5kb larger 4-heap |
499 | ((W)heap [k])->active = k + 1; |
816 | * which is more cache-efficient. |
500 | k >>= 1; |
817 | * the difference is about 5% with 50000+ watchers. |
501 | } |
818 | */ |
|
|
819 | #if EV_USE_4HEAP |
502 | |
820 | |
503 | heap [k] = w; |
821 | #define DHEAP 4 |
504 | ((W)heap [k])->active = k + 1; |
822 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
|
|
823 | #define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0) |
|
|
824 | #define UPHEAP_DONE(p,k) ((p) == (k)) |
505 | |
825 | |
506 | } |
826 | /* away from the root */ |
507 | |
827 | void inline_speed |
508 | static void |
|
|
509 | downheap (WT *heap, int N, int k) |
828 | downheap (ANHE *heap, int N, int k) |
510 | { |
829 | { |
511 | WT w = heap [k]; |
830 | ANHE he = heap [k]; |
|
|
831 | ANHE *E = heap + N + HEAP0; |
512 | |
832 | |
513 | while (k < (N >> 1)) |
833 | for (;;) |
514 | { |
834 | { |
515 | int j = k << 1; |
835 | ev_tstamp minat; |
|
|
836 | ANHE *minpos; |
|
|
837 | ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1; |
516 | |
838 | |
517 | if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
839 | /* find minimum child */ |
|
|
840 | if (expect_true (pos + DHEAP - 1 < E)) |
518 | ++j; |
841 | { |
519 | |
842 | /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
520 | if (w->at <= heap [j]->at) |
843 | if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
844 | if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
845 | if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
846 | } |
|
|
847 | else if (pos < E) |
|
|
848 | { |
|
|
849 | /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
850 | if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
851 | if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
852 | if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
853 | } |
|
|
854 | else |
521 | break; |
855 | break; |
522 | |
856 | |
|
|
857 | if (ANHE_at (he) <= minat) |
|
|
858 | break; |
|
|
859 | |
|
|
860 | heap [k] = *minpos; |
|
|
861 | ev_active (ANHE_w (*minpos)) = k; |
|
|
862 | |
|
|
863 | k = minpos - heap; |
|
|
864 | } |
|
|
865 | |
|
|
866 | heap [k] = he; |
|
|
867 | ev_active (ANHE_w (he)) = k; |
|
|
868 | } |
|
|
869 | |
|
|
870 | #else /* 4HEAP */ |
|
|
871 | |
|
|
872 | #define HEAP0 1 |
|
|
873 | #define HPARENT(k) ((k) >> 1) |
|
|
874 | #define UPHEAP_DONE(p,k) (!(p)) |
|
|
875 | |
|
|
876 | /* away from the root */ |
|
|
877 | void inline_speed |
|
|
878 | downheap (ANHE *heap, int N, int k) |
|
|
879 | { |
|
|
880 | ANHE he = heap [k]; |
|
|
881 | |
|
|
882 | for (;;) |
|
|
883 | { |
|
|
884 | int c = k << 1; |
|
|
885 | |
|
|
886 | if (c > N + HEAP0 - 1) |
|
|
887 | break; |
|
|
888 | |
|
|
889 | c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) |
|
|
890 | ? 1 : 0; |
|
|
891 | |
|
|
892 | if (ANHE_at (he) <= ANHE_at (heap [c])) |
|
|
893 | break; |
|
|
894 | |
523 | heap [k] = heap [j]; |
895 | heap [k] = heap [c]; |
524 | ((W)heap [k])->active = k + 1; |
896 | ev_active (ANHE_w (heap [k])) = k; |
|
|
897 | |
525 | k = j; |
898 | k = c; |
526 | } |
899 | } |
527 | |
900 | |
528 | heap [k] = w; |
901 | heap [k] = he; |
529 | ((W)heap [k])->active = k + 1; |
902 | ev_active (ANHE_w (he)) = k; |
530 | } |
903 | } |
|
|
904 | #endif |
531 | |
905 | |
532 | inline void |
906 | /* towards the root */ |
533 | adjustheap (WT *heap, int N, int k, ev_tstamp at) |
907 | void inline_speed |
|
|
908 | upheap (ANHE *heap, int k) |
534 | { |
909 | { |
535 | ev_tstamp old_at = heap [k]->at; |
910 | ANHE he = heap [k]; |
|
|
911 | |
|
|
912 | for (;;) |
|
|
913 | { |
|
|
914 | int p = HPARENT (k); |
|
|
915 | |
|
|
916 | if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he)) |
|
|
917 | break; |
|
|
918 | |
|
|
919 | heap [k] = heap [p]; |
|
|
920 | ev_active (ANHE_w (heap [k])) = k; |
|
|
921 | k = p; |
|
|
922 | } |
|
|
923 | |
536 | heap [k]->at = at; |
924 | heap [k] = he; |
|
|
925 | ev_active (ANHE_w (he)) = k; |
|
|
926 | } |
537 | |
927 | |
538 | if (old_at < at) |
928 | void inline_size |
|
|
929 | adjustheap (ANHE *heap, int N, int k) |
|
|
930 | { |
|
|
931 | if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k])) |
|
|
932 | upheap (heap, k); |
|
|
933 | else |
539 | downheap (heap, N, k); |
934 | downheap (heap, N, k); |
540 | else |
935 | } |
|
|
936 | |
|
|
937 | /* rebuild the heap: this function is used only once and executed rarely */ |
|
|
938 | void inline_size |
|
|
939 | reheap (ANHE *heap, int N) |
|
|
940 | { |
|
|
941 | int i; |
|
|
942 | |
|
|
943 | /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */ |
|
|
944 | /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */ |
|
|
945 | for (i = 0; i < N; ++i) |
541 | upheap (heap, k); |
946 | upheap (heap, i + HEAP0); |
542 | } |
947 | } |
543 | |
948 | |
544 | /*****************************************************************************/ |
949 | /*****************************************************************************/ |
545 | |
950 | |
546 | typedef struct |
951 | typedef struct |
547 | { |
952 | { |
548 | WL head; |
953 | WL head; |
549 | sig_atomic_t volatile gotsig; |
954 | EV_ATOMIC_T gotsig; |
550 | } ANSIG; |
955 | } ANSIG; |
551 | |
956 | |
552 | static ANSIG *signals; |
957 | static ANSIG *signals; |
553 | static int signalmax; |
958 | static int signalmax; |
554 | |
959 | |
555 | static int sigpipe [2]; |
960 | static EV_ATOMIC_T gotsig; |
556 | static sig_atomic_t volatile gotsig; |
|
|
557 | static struct ev_io sigev; |
|
|
558 | |
961 | |
559 | static void |
962 | void inline_size |
560 | signals_init (ANSIG *base, int count) |
963 | signals_init (ANSIG *base, int count) |
561 | { |
964 | { |
562 | while (count--) |
965 | while (count--) |
563 | { |
966 | { |
564 | base->head = 0; |
967 | base->head = 0; |
… | |
… | |
566 | |
969 | |
567 | ++base; |
970 | ++base; |
568 | } |
971 | } |
569 | } |
972 | } |
570 | |
973 | |
|
|
974 | /*****************************************************************************/ |
|
|
975 | |
|
|
976 | void inline_speed |
|
|
977 | fd_intern (int fd) |
|
|
978 | { |
|
|
979 | #ifdef _WIN32 |
|
|
980 | int arg = 1; |
|
|
981 | ioctlsocket (_get_osfhandle (fd), FIONBIO, &arg); |
|
|
982 | #else |
|
|
983 | fcntl (fd, F_SETFD, FD_CLOEXEC); |
|
|
984 | fcntl (fd, F_SETFL, O_NONBLOCK); |
|
|
985 | #endif |
|
|
986 | } |
|
|
987 | |
|
|
988 | static void noinline |
|
|
989 | evpipe_init (EV_P) |
|
|
990 | { |
|
|
991 | if (!ev_is_active (&pipeev)) |
|
|
992 | { |
|
|
993 | #if EV_USE_EVENTFD |
|
|
994 | if ((evfd = eventfd (0, 0)) >= 0) |
|
|
995 | { |
|
|
996 | evpipe [0] = -1; |
|
|
997 | fd_intern (evfd); |
|
|
998 | ev_io_set (&pipeev, evfd, EV_READ); |
|
|
999 | } |
|
|
1000 | else |
|
|
1001 | #endif |
|
|
1002 | { |
|
|
1003 | while (pipe (evpipe)) |
|
|
1004 | syserr ("(libev) error creating signal/async pipe"); |
|
|
1005 | |
|
|
1006 | fd_intern (evpipe [0]); |
|
|
1007 | fd_intern (evpipe [1]); |
|
|
1008 | ev_io_set (&pipeev, evpipe [0], EV_READ); |
|
|
1009 | } |
|
|
1010 | |
|
|
1011 | ev_io_start (EV_A_ &pipeev); |
|
|
1012 | ev_unref (EV_A); /* watcher should not keep loop alive */ |
|
|
1013 | } |
|
|
1014 | } |
|
|
1015 | |
|
|
1016 | void inline_size |
|
|
1017 | evpipe_write (EV_P_ EV_ATOMIC_T *flag) |
|
|
1018 | { |
|
|
1019 | if (!*flag) |
|
|
1020 | { |
|
|
1021 | int old_errno = errno; /* save errno because write might clobber it */ |
|
|
1022 | |
|
|
1023 | *flag = 1; |
|
|
1024 | |
|
|
1025 | #if EV_USE_EVENTFD |
|
|
1026 | if (evfd >= 0) |
|
|
1027 | { |
|
|
1028 | uint64_t counter = 1; |
|
|
1029 | write (evfd, &counter, sizeof (uint64_t)); |
|
|
1030 | } |
|
|
1031 | else |
|
|
1032 | #endif |
|
|
1033 | write (evpipe [1], &old_errno, 1); |
|
|
1034 | |
|
|
1035 | errno = old_errno; |
|
|
1036 | } |
|
|
1037 | } |
|
|
1038 | |
571 | static void |
1039 | static void |
|
|
1040 | pipecb (EV_P_ ev_io *iow, int revents) |
|
|
1041 | { |
|
|
1042 | #if EV_USE_EVENTFD |
|
|
1043 | if (evfd >= 0) |
|
|
1044 | { |
|
|
1045 | uint64_t counter; |
|
|
1046 | read (evfd, &counter, sizeof (uint64_t)); |
|
|
1047 | } |
|
|
1048 | else |
|
|
1049 | #endif |
|
|
1050 | { |
|
|
1051 | char dummy; |
|
|
1052 | read (evpipe [0], &dummy, 1); |
|
|
1053 | } |
|
|
1054 | |
|
|
1055 | if (gotsig && ev_is_default_loop (EV_A)) |
|
|
1056 | { |
|
|
1057 | int signum; |
|
|
1058 | gotsig = 0; |
|
|
1059 | |
|
|
1060 | for (signum = signalmax; signum--; ) |
|
|
1061 | if (signals [signum].gotsig) |
|
|
1062 | ev_feed_signal_event (EV_A_ signum + 1); |
|
|
1063 | } |
|
|
1064 | |
|
|
1065 | #if EV_ASYNC_ENABLE |
|
|
1066 | if (gotasync) |
|
|
1067 | { |
|
|
1068 | int i; |
|
|
1069 | gotasync = 0; |
|
|
1070 | |
|
|
1071 | for (i = asynccnt; i--; ) |
|
|
1072 | if (asyncs [i]->sent) |
|
|
1073 | { |
|
|
1074 | asyncs [i]->sent = 0; |
|
|
1075 | ev_feed_event (EV_A_ asyncs [i], EV_ASYNC); |
|
|
1076 | } |
|
|
1077 | } |
|
|
1078 | #endif |
|
|
1079 | } |
|
|
1080 | |
|
|
1081 | /*****************************************************************************/ |
|
|
1082 | |
|
|
1083 | static void |
572 | sighandler (int signum) |
1084 | ev_sighandler (int signum) |
573 | { |
1085 | { |
|
|
1086 | #if EV_MULTIPLICITY |
|
|
1087 | struct ev_loop *loop = &default_loop_struct; |
|
|
1088 | #endif |
|
|
1089 | |
574 | #if WIN32 |
1090 | #if _WIN32 |
575 | signal (signum, sighandler); |
1091 | signal (signum, ev_sighandler); |
576 | #endif |
1092 | #endif |
577 | |
1093 | |
578 | signals [signum - 1].gotsig = 1; |
1094 | signals [signum - 1].gotsig = 1; |
579 | |
1095 | evpipe_write (EV_A_ &gotsig); |
580 | if (!gotsig) |
|
|
581 | { |
|
|
582 | int old_errno = errno; |
|
|
583 | gotsig = 1; |
|
|
584 | #ifdef WIN32 |
|
|
585 | send (sigpipe [1], &signum, 1, MSG_DONTWAIT); |
|
|
586 | #else |
|
|
587 | write (sigpipe [1], &signum, 1); |
|
|
588 | #endif |
|
|
589 | errno = old_errno; |
|
|
590 | } |
|
|
591 | } |
1096 | } |
592 | |
1097 | |
593 | void |
1098 | void noinline |
594 | ev_feed_signal_event (EV_P_ int signum) |
1099 | ev_feed_signal_event (EV_P_ int signum) |
595 | { |
1100 | { |
596 | WL w; |
1101 | WL w; |
597 | |
1102 | |
598 | #if EV_MULTIPLICITY |
1103 | #if EV_MULTIPLICITY |
599 | assert (("feeding signal events is only supported in the default loop", loop == default_loop)); |
1104 | assert (("feeding signal events is only supported in the default loop", loop == ev_default_loop_ptr)); |
600 | #endif |
1105 | #endif |
601 | |
1106 | |
602 | --signum; |
1107 | --signum; |
603 | |
1108 | |
604 | if (signum < 0 || signum >= signalmax) |
1109 | if (signum < 0 || signum >= signalmax) |
… | |
… | |
608 | |
1113 | |
609 | for (w = signals [signum].head; w; w = w->next) |
1114 | for (w = signals [signum].head; w; w = w->next) |
610 | ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
1115 | ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
611 | } |
1116 | } |
612 | |
1117 | |
613 | static void |
|
|
614 | sigcb (EV_P_ struct ev_io *iow, int revents) |
|
|
615 | { |
|
|
616 | int signum; |
|
|
617 | |
|
|
618 | #ifdef WIN32 |
|
|
619 | recv (sigpipe [0], &revents, 1, MSG_DONTWAIT); |
|
|
620 | #else |
|
|
621 | read (sigpipe [0], &revents, 1); |
|
|
622 | #endif |
|
|
623 | gotsig = 0; |
|
|
624 | |
|
|
625 | for (signum = signalmax; signum--; ) |
|
|
626 | if (signals [signum].gotsig) |
|
|
627 | ev_feed_signal_event (EV_A_ signum + 1); |
|
|
628 | } |
|
|
629 | |
|
|
630 | static void |
|
|
631 | siginit (EV_P) |
|
|
632 | { |
|
|
633 | #ifndef WIN32 |
|
|
634 | fcntl (sigpipe [0], F_SETFD, FD_CLOEXEC); |
|
|
635 | fcntl (sigpipe [1], F_SETFD, FD_CLOEXEC); |
|
|
636 | |
|
|
637 | /* rather than sort out wether we really need nb, set it */ |
|
|
638 | fcntl (sigpipe [0], F_SETFL, O_NONBLOCK); |
|
|
639 | fcntl (sigpipe [1], F_SETFL, O_NONBLOCK); |
|
|
640 | #endif |
|
|
641 | |
|
|
642 | ev_io_set (&sigev, sigpipe [0], EV_READ); |
|
|
643 | ev_io_start (EV_A_ &sigev); |
|
|
644 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
|
|
645 | } |
|
|
646 | |
|
|
647 | /*****************************************************************************/ |
1118 | /*****************************************************************************/ |
648 | |
1119 | |
649 | static struct ev_child *childs [PID_HASHSIZE]; |
1120 | static WL childs [EV_PID_HASHSIZE]; |
650 | |
1121 | |
651 | #ifndef WIN32 |
1122 | #ifndef _WIN32 |
652 | |
1123 | |
653 | static struct ev_signal childev; |
1124 | static ev_signal childev; |
|
|
1125 | |
|
|
1126 | #ifndef WIFCONTINUED |
|
|
1127 | # define WIFCONTINUED(status) 0 |
|
|
1128 | #endif |
|
|
1129 | |
|
|
1130 | void inline_speed |
|
|
1131 | child_reap (EV_P_ int chain, int pid, int status) |
|
|
1132 | { |
|
|
1133 | ev_child *w; |
|
|
1134 | int traced = WIFSTOPPED (status) || WIFCONTINUED (status); |
|
|
1135 | |
|
|
1136 | for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next) |
|
|
1137 | { |
|
|
1138 | if ((w->pid == pid || !w->pid) |
|
|
1139 | && (!traced || (w->flags & 1))) |
|
|
1140 | { |
|
|
1141 | ev_set_priority (w, EV_MAXPRI); /* need to do it *now*, this *must* be the same prio as the signal watcher itself */ |
|
|
1142 | w->rpid = pid; |
|
|
1143 | w->rstatus = status; |
|
|
1144 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
|
|
1145 | } |
|
|
1146 | } |
|
|
1147 | } |
654 | |
1148 | |
655 | #ifndef WCONTINUED |
1149 | #ifndef WCONTINUED |
656 | # define WCONTINUED 0 |
1150 | # define WCONTINUED 0 |
657 | #endif |
1151 | #endif |
658 | |
1152 | |
659 | static void |
1153 | static void |
660 | child_reap (EV_P_ struct ev_signal *sw, int chain, int pid, int status) |
|
|
661 | { |
|
|
662 | struct ev_child *w; |
|
|
663 | |
|
|
664 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
|
|
665 | if (w->pid == pid || !w->pid) |
|
|
666 | { |
|
|
667 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
|
|
668 | w->rpid = pid; |
|
|
669 | w->rstatus = status; |
|
|
670 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
|
|
671 | } |
|
|
672 | } |
|
|
673 | |
|
|
674 | static void |
|
|
675 | childcb (EV_P_ struct ev_signal *sw, int revents) |
1154 | childcb (EV_P_ ev_signal *sw, int revents) |
676 | { |
1155 | { |
677 | int pid, status; |
1156 | int pid, status; |
678 | |
1157 | |
|
|
1158 | /* some systems define WCONTINUED but then fail to support it (linux 2.4) */ |
679 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
1159 | if (0 >= (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
680 | { |
1160 | if (!WCONTINUED |
|
|
1161 | || errno != EINVAL |
|
|
1162 | || 0 >= (pid = waitpid (-1, &status, WNOHANG | WUNTRACED))) |
|
|
1163 | return; |
|
|
1164 | |
681 | /* make sure we are called again until all childs have been reaped */ |
1165 | /* make sure we are called again until all children have been reaped */ |
|
|
1166 | /* we need to do it this way so that the callback gets called before we continue */ |
682 | ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
1167 | ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
683 | |
1168 | |
684 | child_reap (EV_A_ sw, pid, pid, status); |
1169 | child_reap (EV_A_ pid, pid, status); |
|
|
1170 | if (EV_PID_HASHSIZE > 1) |
685 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
1171 | child_reap (EV_A_ 0, pid, status); /* this might trigger a watcher twice, but feed_event catches that */ |
686 | } |
|
|
687 | } |
1172 | } |
688 | |
1173 | |
689 | #endif |
1174 | #endif |
690 | |
1175 | |
691 | /*****************************************************************************/ |
1176 | /*****************************************************************************/ |
692 | |
1177 | |
|
|
1178 | #if EV_USE_PORT |
|
|
1179 | # include "ev_port.c" |
|
|
1180 | #endif |
693 | #if EV_USE_KQUEUE |
1181 | #if EV_USE_KQUEUE |
694 | # include "ev_kqueue.c" |
1182 | # include "ev_kqueue.c" |
695 | #endif |
1183 | #endif |
696 | #if EV_USE_EPOLL |
1184 | #if EV_USE_EPOLL |
697 | # include "ev_epoll.c" |
1185 | # include "ev_epoll.c" |
… | |
… | |
714 | { |
1202 | { |
715 | return EV_VERSION_MINOR; |
1203 | return EV_VERSION_MINOR; |
716 | } |
1204 | } |
717 | |
1205 | |
718 | /* return true if we are running with elevated privileges and should ignore env variables */ |
1206 | /* return true if we are running with elevated privileges and should ignore env variables */ |
719 | static int |
1207 | int inline_size |
720 | enable_secure (void) |
1208 | enable_secure (void) |
721 | { |
1209 | { |
722 | #ifdef WIN32 |
1210 | #ifdef _WIN32 |
723 | return 0; |
1211 | return 0; |
724 | #else |
1212 | #else |
725 | return getuid () != geteuid () |
1213 | return getuid () != geteuid () |
726 | || getgid () != getegid (); |
1214 | || getgid () != getegid (); |
727 | #endif |
1215 | #endif |
728 | } |
1216 | } |
729 | |
1217 | |
730 | int |
1218 | unsigned int |
731 | ev_method (EV_P) |
1219 | ev_supported_backends (void) |
732 | { |
1220 | { |
733 | return method; |
1221 | unsigned int flags = 0; |
734 | } |
|
|
735 | |
1222 | |
736 | static void |
1223 | if (EV_USE_PORT ) flags |= EVBACKEND_PORT; |
737 | loop_init (EV_P_ int methods) |
1224 | if (EV_USE_KQUEUE) flags |= EVBACKEND_KQUEUE; |
|
|
1225 | if (EV_USE_EPOLL ) flags |= EVBACKEND_EPOLL; |
|
|
1226 | if (EV_USE_POLL ) flags |= EVBACKEND_POLL; |
|
|
1227 | if (EV_USE_SELECT) flags |= EVBACKEND_SELECT; |
|
|
1228 | |
|
|
1229 | return flags; |
|
|
1230 | } |
|
|
1231 | |
|
|
1232 | unsigned int |
|
|
1233 | ev_recommended_backends (void) |
738 | { |
1234 | { |
739 | if (!method) |
1235 | unsigned int flags = ev_supported_backends (); |
|
|
1236 | |
|
|
1237 | #ifndef __NetBSD__ |
|
|
1238 | /* kqueue is borked on everything but netbsd apparently */ |
|
|
1239 | /* it usually doesn't work correctly on anything but sockets and pipes */ |
|
|
1240 | flags &= ~EVBACKEND_KQUEUE; |
|
|
1241 | #endif |
|
|
1242 | #ifdef __APPLE__ |
|
|
1243 | // flags &= ~EVBACKEND_KQUEUE; for documentation |
|
|
1244 | flags &= ~EVBACKEND_POLL; |
|
|
1245 | #endif |
|
|
1246 | |
|
|
1247 | return flags; |
|
|
1248 | } |
|
|
1249 | |
|
|
1250 | unsigned int |
|
|
1251 | ev_embeddable_backends (void) |
|
|
1252 | { |
|
|
1253 | int flags = EVBACKEND_EPOLL | EVBACKEND_KQUEUE | EVBACKEND_PORT; |
|
|
1254 | |
|
|
1255 | /* epoll embeddability broken on all linux versions up to at least 2.6.23 */ |
|
|
1256 | /* please fix it and tell me how to detect the fix */ |
|
|
1257 | flags &= ~EVBACKEND_EPOLL; |
|
|
1258 | |
|
|
1259 | return flags; |
|
|
1260 | } |
|
|
1261 | |
|
|
1262 | unsigned int |
|
|
1263 | ev_backend (EV_P) |
|
|
1264 | { |
|
|
1265 | return backend; |
|
|
1266 | } |
|
|
1267 | |
|
|
1268 | unsigned int |
|
|
1269 | ev_loop_count (EV_P) |
|
|
1270 | { |
|
|
1271 | return loop_count; |
|
|
1272 | } |
|
|
1273 | |
|
|
1274 | void |
|
|
1275 | ev_set_io_collect_interval (EV_P_ ev_tstamp interval) |
|
|
1276 | { |
|
|
1277 | io_blocktime = interval; |
|
|
1278 | } |
|
|
1279 | |
|
|
1280 | void |
|
|
1281 | ev_set_timeout_collect_interval (EV_P_ ev_tstamp interval) |
|
|
1282 | { |
|
|
1283 | timeout_blocktime = interval; |
|
|
1284 | } |
|
|
1285 | |
|
|
1286 | static void noinline |
|
|
1287 | loop_init (EV_P_ unsigned int flags) |
|
|
1288 | { |
|
|
1289 | if (!backend) |
740 | { |
1290 | { |
741 | #if EV_USE_MONOTONIC |
1291 | #if EV_USE_MONOTONIC |
742 | { |
1292 | { |
743 | struct timespec ts; |
1293 | struct timespec ts; |
744 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
1294 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
745 | have_monotonic = 1; |
1295 | have_monotonic = 1; |
746 | } |
1296 | } |
747 | #endif |
1297 | #endif |
748 | |
1298 | |
749 | ev_rt_now = ev_time (); |
1299 | ev_rt_now = ev_time (); |
750 | mn_now = get_clock (); |
1300 | mn_now = get_clock (); |
751 | now_floor = mn_now; |
1301 | now_floor = mn_now; |
752 | rtmn_diff = ev_rt_now - mn_now; |
1302 | rtmn_diff = ev_rt_now - mn_now; |
753 | |
1303 | |
754 | if (methods == EVMETHOD_AUTO) |
1304 | io_blocktime = 0.; |
755 | if (!enable_secure () && getenv ("LIBEV_METHODS")) |
1305 | timeout_blocktime = 0.; |
|
|
1306 | backend = 0; |
|
|
1307 | backend_fd = -1; |
|
|
1308 | gotasync = 0; |
|
|
1309 | #if EV_USE_INOTIFY |
|
|
1310 | fs_fd = -2; |
|
|
1311 | #endif |
|
|
1312 | |
|
|
1313 | /* pid check not overridable via env */ |
|
|
1314 | #ifndef _WIN32 |
|
|
1315 | if (flags & EVFLAG_FORKCHECK) |
|
|
1316 | curpid = getpid (); |
|
|
1317 | #endif |
|
|
1318 | |
|
|
1319 | if (!(flags & EVFLAG_NOENV) |
|
|
1320 | && !enable_secure () |
|
|
1321 | && getenv ("LIBEV_FLAGS")) |
756 | methods = atoi (getenv ("LIBEV_METHODS")); |
1322 | flags = atoi (getenv ("LIBEV_FLAGS")); |
757 | else |
|
|
758 | methods = EVMETHOD_ANY; |
|
|
759 | |
1323 | |
760 | method = 0; |
1324 | if (!(flags & 0x0000ffffU)) |
761 | #if EV_USE_WIN32 |
1325 | flags |= ev_recommended_backends (); |
762 | if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
1326 | |
|
|
1327 | #if EV_USE_PORT |
|
|
1328 | if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags); |
763 | #endif |
1329 | #endif |
764 | #if EV_USE_KQUEUE |
1330 | #if EV_USE_KQUEUE |
765 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
1331 | if (!backend && (flags & EVBACKEND_KQUEUE)) backend = kqueue_init (EV_A_ flags); |
766 | #endif |
1332 | #endif |
767 | #if EV_USE_EPOLL |
1333 | #if EV_USE_EPOLL |
768 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
1334 | if (!backend && (flags & EVBACKEND_EPOLL )) backend = epoll_init (EV_A_ flags); |
769 | #endif |
1335 | #endif |
770 | #if EV_USE_POLL |
1336 | #if EV_USE_POLL |
771 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
1337 | if (!backend && (flags & EVBACKEND_POLL )) backend = poll_init (EV_A_ flags); |
772 | #endif |
1338 | #endif |
773 | #if EV_USE_SELECT |
1339 | #if EV_USE_SELECT |
774 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
1340 | if (!backend && (flags & EVBACKEND_SELECT)) backend = select_init (EV_A_ flags); |
775 | #endif |
1341 | #endif |
776 | |
1342 | |
777 | ev_init (&sigev, sigcb); |
1343 | ev_init (&pipeev, pipecb); |
778 | ev_set_priority (&sigev, EV_MAXPRI); |
1344 | ev_set_priority (&pipeev, EV_MAXPRI); |
779 | } |
1345 | } |
780 | } |
1346 | } |
781 | |
1347 | |
782 | void |
1348 | static void noinline |
783 | loop_destroy (EV_P) |
1349 | loop_destroy (EV_P) |
784 | { |
1350 | { |
785 | int i; |
1351 | int i; |
786 | |
1352 | |
|
|
1353 | if (ev_is_active (&pipeev)) |
|
|
1354 | { |
|
|
1355 | ev_ref (EV_A); /* signal watcher */ |
|
|
1356 | ev_io_stop (EV_A_ &pipeev); |
|
|
1357 | |
|
|
1358 | #if EV_USE_EVENTFD |
|
|
1359 | if (evfd >= 0) |
|
|
1360 | close (evfd); |
|
|
1361 | #endif |
|
|
1362 | |
|
|
1363 | if (evpipe [0] >= 0) |
|
|
1364 | { |
|
|
1365 | close (evpipe [0]); |
|
|
1366 | close (evpipe [1]); |
|
|
1367 | } |
|
|
1368 | } |
|
|
1369 | |
787 | #if EV_USE_WIN32 |
1370 | #if EV_USE_INOTIFY |
788 | if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
1371 | if (fs_fd >= 0) |
|
|
1372 | close (fs_fd); |
|
|
1373 | #endif |
|
|
1374 | |
|
|
1375 | if (backend_fd >= 0) |
|
|
1376 | close (backend_fd); |
|
|
1377 | |
|
|
1378 | #if EV_USE_PORT |
|
|
1379 | if (backend == EVBACKEND_PORT ) port_destroy (EV_A); |
789 | #endif |
1380 | #endif |
790 | #if EV_USE_KQUEUE |
1381 | #if EV_USE_KQUEUE |
791 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
1382 | if (backend == EVBACKEND_KQUEUE) kqueue_destroy (EV_A); |
792 | #endif |
1383 | #endif |
793 | #if EV_USE_EPOLL |
1384 | #if EV_USE_EPOLL |
794 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
1385 | if (backend == EVBACKEND_EPOLL ) epoll_destroy (EV_A); |
795 | #endif |
1386 | #endif |
796 | #if EV_USE_POLL |
1387 | #if EV_USE_POLL |
797 | if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
1388 | if (backend == EVBACKEND_POLL ) poll_destroy (EV_A); |
798 | #endif |
1389 | #endif |
799 | #if EV_USE_SELECT |
1390 | #if EV_USE_SELECT |
800 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
1391 | if (backend == EVBACKEND_SELECT) select_destroy (EV_A); |
801 | #endif |
1392 | #endif |
802 | |
1393 | |
803 | for (i = NUMPRI; i--; ) |
1394 | for (i = NUMPRI; i--; ) |
|
|
1395 | { |
804 | array_free (pending, [i]); |
1396 | array_free (pending, [i]); |
|
|
1397 | #if EV_IDLE_ENABLE |
|
|
1398 | array_free (idle, [i]); |
|
|
1399 | #endif |
|
|
1400 | } |
|
|
1401 | |
|
|
1402 | ev_free (anfds); anfdmax = 0; |
805 | |
1403 | |
806 | /* have to use the microsoft-never-gets-it-right macro */ |
1404 | /* have to use the microsoft-never-gets-it-right macro */ |
807 | array_free_microshit (fdchange); |
1405 | array_free (fdchange, EMPTY); |
808 | array_free_microshit (timer); |
1406 | array_free (timer, EMPTY); |
809 | array_free_microshit (periodic); |
1407 | #if EV_PERIODIC_ENABLE |
810 | array_free_microshit (idle); |
1408 | array_free (periodic, EMPTY); |
811 | array_free_microshit (prepare); |
1409 | #endif |
812 | array_free_microshit (check); |
1410 | #if EV_FORK_ENABLE |
|
|
1411 | array_free (fork, EMPTY); |
|
|
1412 | #endif |
|
|
1413 | array_free (prepare, EMPTY); |
|
|
1414 | array_free (check, EMPTY); |
|
|
1415 | #if EV_ASYNC_ENABLE |
|
|
1416 | array_free (async, EMPTY); |
|
|
1417 | #endif |
813 | |
1418 | |
814 | method = 0; |
1419 | backend = 0; |
815 | } |
1420 | } |
816 | |
1421 | |
817 | static void |
1422 | #if EV_USE_INOTIFY |
|
|
1423 | void inline_size infy_fork (EV_P); |
|
|
1424 | #endif |
|
|
1425 | |
|
|
1426 | void inline_size |
818 | loop_fork (EV_P) |
1427 | loop_fork (EV_P) |
819 | { |
1428 | { |
|
|
1429 | #if EV_USE_PORT |
|
|
1430 | if (backend == EVBACKEND_PORT ) port_fork (EV_A); |
|
|
1431 | #endif |
|
|
1432 | #if EV_USE_KQUEUE |
|
|
1433 | if (backend == EVBACKEND_KQUEUE) kqueue_fork (EV_A); |
|
|
1434 | #endif |
820 | #if EV_USE_EPOLL |
1435 | #if EV_USE_EPOLL |
821 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
1436 | if (backend == EVBACKEND_EPOLL ) epoll_fork (EV_A); |
822 | #endif |
1437 | #endif |
823 | #if EV_USE_KQUEUE |
1438 | #if EV_USE_INOTIFY |
824 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
1439 | infy_fork (EV_A); |
825 | #endif |
1440 | #endif |
826 | |
1441 | |
827 | if (ev_is_active (&sigev)) |
1442 | if (ev_is_active (&pipeev)) |
828 | { |
1443 | { |
829 | /* default loop */ |
1444 | /* this "locks" the handlers against writing to the pipe */ |
|
|
1445 | /* while we modify the fd vars */ |
|
|
1446 | gotsig = 1; |
|
|
1447 | #if EV_ASYNC_ENABLE |
|
|
1448 | gotasync = 1; |
|
|
1449 | #endif |
830 | |
1450 | |
831 | ev_ref (EV_A); |
1451 | ev_ref (EV_A); |
832 | ev_io_stop (EV_A_ &sigev); |
1452 | ev_io_stop (EV_A_ &pipeev); |
|
|
1453 | |
|
|
1454 | #if EV_USE_EVENTFD |
|
|
1455 | if (evfd >= 0) |
|
|
1456 | close (evfd); |
|
|
1457 | #endif |
|
|
1458 | |
|
|
1459 | if (evpipe [0] >= 0) |
|
|
1460 | { |
833 | close (sigpipe [0]); |
1461 | close (evpipe [0]); |
834 | close (sigpipe [1]); |
1462 | close (evpipe [1]); |
|
|
1463 | } |
835 | |
1464 | |
836 | while (pipe (sigpipe)) |
|
|
837 | syserr ("(libev) error creating pipe"); |
|
|
838 | |
|
|
839 | siginit (EV_A); |
1465 | evpipe_init (EV_A); |
|
|
1466 | /* now iterate over everything, in case we missed something */ |
|
|
1467 | pipecb (EV_A_ &pipeev, EV_READ); |
840 | } |
1468 | } |
841 | |
1469 | |
842 | postfork = 0; |
1470 | postfork = 0; |
843 | } |
1471 | } |
|
|
1472 | |
|
|
1473 | #if EV_MULTIPLICITY |
|
|
1474 | |
|
|
1475 | struct ev_loop * |
|
|
1476 | ev_loop_new (unsigned int flags) |
|
|
1477 | { |
|
|
1478 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
1479 | |
|
|
1480 | memset (loop, 0, sizeof (struct ev_loop)); |
|
|
1481 | |
|
|
1482 | loop_init (EV_A_ flags); |
|
|
1483 | |
|
|
1484 | if (ev_backend (EV_A)) |
|
|
1485 | return loop; |
|
|
1486 | |
|
|
1487 | return 0; |
|
|
1488 | } |
|
|
1489 | |
|
|
1490 | void |
|
|
1491 | ev_loop_destroy (EV_P) |
|
|
1492 | { |
|
|
1493 | loop_destroy (EV_A); |
|
|
1494 | ev_free (loop); |
|
|
1495 | } |
|
|
1496 | |
|
|
1497 | void |
|
|
1498 | ev_loop_fork (EV_P) |
|
|
1499 | { |
|
|
1500 | postfork = 1; /* must be in line with ev_default_fork */ |
|
|
1501 | } |
|
|
1502 | |
|
|
1503 | #if EV_VERIFY |
|
|
1504 | void noinline |
|
|
1505 | verify_watcher (EV_P_ W w) |
|
|
1506 | { |
|
|
1507 | assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI)); |
|
|
1508 | |
|
|
1509 | if (w->pending) |
|
|
1510 | assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w)); |
|
|
1511 | } |
|
|
1512 | |
|
|
1513 | static void noinline |
|
|
1514 | verify_heap (EV_P_ ANHE *heap, int N) |
|
|
1515 | { |
|
|
1516 | int i; |
|
|
1517 | |
|
|
1518 | for (i = HEAP0; i < N + HEAP0; ++i) |
|
|
1519 | { |
|
|
1520 | assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i)); |
|
|
1521 | assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i]))); |
|
|
1522 | assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i])))); |
|
|
1523 | |
|
|
1524 | verify_watcher (EV_A_ (W)ANHE_w (heap [i])); |
|
|
1525 | } |
|
|
1526 | } |
|
|
1527 | |
|
|
1528 | static void noinline |
|
|
1529 | array_verify (EV_P_ W *ws, int cnt) |
|
|
1530 | { |
|
|
1531 | while (cnt--) |
|
|
1532 | { |
|
|
1533 | assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1)); |
|
|
1534 | verify_watcher (EV_A_ ws [cnt]); |
|
|
1535 | } |
|
|
1536 | } |
|
|
1537 | #endif |
|
|
1538 | |
|
|
1539 | void |
|
|
1540 | ev_loop_verify (EV_P) |
|
|
1541 | { |
|
|
1542 | #if EV_VERIFY |
|
|
1543 | int i; |
|
|
1544 | WL w; |
|
|
1545 | |
|
|
1546 | assert (activecnt >= -1); |
|
|
1547 | |
|
|
1548 | assert (fdchangemax >= fdchangecnt); |
|
|
1549 | for (i = 0; i < fdchangecnt; ++i) |
|
|
1550 | assert (("negative fd in fdchanges", fdchanges [i] >= 0)); |
|
|
1551 | |
|
|
1552 | assert (anfdmax >= 0); |
|
|
1553 | for (i = 0; i < anfdmax; ++i) |
|
|
1554 | for (w = anfds [i].head; w; w = w->next) |
|
|
1555 | { |
|
|
1556 | verify_watcher (EV_A_ (W)w); |
|
|
1557 | assert (("inactive fd watcher on anfd list", ev_active (w) == 1)); |
|
|
1558 | assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i)); |
|
|
1559 | } |
|
|
1560 | |
|
|
1561 | assert (timermax >= timercnt); |
|
|
1562 | verify_heap (EV_A_ timers, timercnt); |
|
|
1563 | |
|
|
1564 | #if EV_PERIODIC_ENABLE |
|
|
1565 | assert (periodicmax >= periodiccnt); |
|
|
1566 | verify_heap (EV_A_ periodics, periodiccnt); |
|
|
1567 | #endif |
|
|
1568 | |
|
|
1569 | for (i = NUMPRI; i--; ) |
|
|
1570 | { |
|
|
1571 | assert (pendingmax [i] >= pendingcnt [i]); |
|
|
1572 | #if EV_IDLE_ENABLE |
|
|
1573 | assert (idlemax [i] >= idlecnt [i]); |
|
|
1574 | array_verify (EV_A_ (W *)idles [i], idlecnt [i]); |
|
|
1575 | #endif |
|
|
1576 | } |
|
|
1577 | |
|
|
1578 | #if EV_FORK_ENABLE |
|
|
1579 | assert (forkmax >= forkcnt); |
|
|
1580 | array_verify (EV_A_ (W *)forks, forkcnt); |
|
|
1581 | #endif |
|
|
1582 | |
|
|
1583 | #if EV_ASYNC_ENABLE |
|
|
1584 | assert (asyncmax >= asynccnt); |
|
|
1585 | array_verify (EV_A_ (W *)asyncs, asynccnt); |
|
|
1586 | #endif |
|
|
1587 | |
|
|
1588 | assert (preparemax >= preparecnt); |
|
|
1589 | array_verify (EV_A_ (W *)prepares, preparecnt); |
|
|
1590 | |
|
|
1591 | assert (checkmax >= checkcnt); |
|
|
1592 | array_verify (EV_A_ (W *)checks, checkcnt); |
|
|
1593 | |
|
|
1594 | # if 0 |
|
|
1595 | for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next) |
|
|
1596 | for (signum = signalmax; signum--; ) if (signals [signum].gotsig) |
|
|
1597 | # endif |
|
|
1598 | #endif |
|
|
1599 | } |
|
|
1600 | |
|
|
1601 | #endif /* multiplicity */ |
844 | |
1602 | |
845 | #if EV_MULTIPLICITY |
1603 | #if EV_MULTIPLICITY |
846 | struct ev_loop * |
1604 | struct ev_loop * |
847 | ev_loop_new (int methods) |
1605 | ev_default_loop_init (unsigned int flags) |
848 | { |
|
|
849 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
850 | |
|
|
851 | memset (loop, 0, sizeof (struct ev_loop)); |
|
|
852 | |
|
|
853 | loop_init (EV_A_ methods); |
|
|
854 | |
|
|
855 | if (ev_method (EV_A)) |
|
|
856 | return loop; |
|
|
857 | |
|
|
858 | return 0; |
|
|
859 | } |
|
|
860 | |
|
|
861 | void |
|
|
862 | ev_loop_destroy (EV_P) |
|
|
863 | { |
|
|
864 | loop_destroy (EV_A); |
|
|
865 | ev_free (loop); |
|
|
866 | } |
|
|
867 | |
|
|
868 | void |
|
|
869 | ev_loop_fork (EV_P) |
|
|
870 | { |
|
|
871 | postfork = 1; |
|
|
872 | } |
|
|
873 | |
|
|
874 | #endif |
|
|
875 | |
|
|
876 | #if EV_MULTIPLICITY |
|
|
877 | struct ev_loop * |
|
|
878 | #else |
1606 | #else |
879 | int |
1607 | int |
|
|
1608 | ev_default_loop (unsigned int flags) |
880 | #endif |
1609 | #endif |
881 | ev_default_loop (int methods) |
|
|
882 | { |
1610 | { |
883 | if (sigpipe [0] == sigpipe [1]) |
|
|
884 | if (pipe (sigpipe)) |
|
|
885 | return 0; |
|
|
886 | |
|
|
887 | if (!default_loop) |
1611 | if (!ev_default_loop_ptr) |
888 | { |
1612 | { |
889 | #if EV_MULTIPLICITY |
1613 | #if EV_MULTIPLICITY |
890 | struct ev_loop *loop = default_loop = &default_loop_struct; |
1614 | struct ev_loop *loop = ev_default_loop_ptr = &default_loop_struct; |
891 | #else |
1615 | #else |
892 | default_loop = 1; |
1616 | ev_default_loop_ptr = 1; |
893 | #endif |
1617 | #endif |
894 | |
1618 | |
895 | loop_init (EV_A_ methods); |
1619 | loop_init (EV_A_ flags); |
896 | |
1620 | |
897 | if (ev_method (EV_A)) |
1621 | if (ev_backend (EV_A)) |
898 | { |
1622 | { |
899 | siginit (EV_A); |
|
|
900 | |
|
|
901 | #ifndef WIN32 |
1623 | #ifndef _WIN32 |
902 | ev_signal_init (&childev, childcb, SIGCHLD); |
1624 | ev_signal_init (&childev, childcb, SIGCHLD); |
903 | ev_set_priority (&childev, EV_MAXPRI); |
1625 | ev_set_priority (&childev, EV_MAXPRI); |
904 | ev_signal_start (EV_A_ &childev); |
1626 | ev_signal_start (EV_A_ &childev); |
905 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
1627 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
906 | #endif |
1628 | #endif |
907 | } |
1629 | } |
908 | else |
1630 | else |
909 | default_loop = 0; |
1631 | ev_default_loop_ptr = 0; |
910 | } |
1632 | } |
911 | |
1633 | |
912 | return default_loop; |
1634 | return ev_default_loop_ptr; |
913 | } |
1635 | } |
914 | |
1636 | |
915 | void |
1637 | void |
916 | ev_default_destroy (void) |
1638 | ev_default_destroy (void) |
917 | { |
1639 | { |
918 | #if EV_MULTIPLICITY |
1640 | #if EV_MULTIPLICITY |
919 | struct ev_loop *loop = default_loop; |
1641 | struct ev_loop *loop = ev_default_loop_ptr; |
920 | #endif |
1642 | #endif |
921 | |
1643 | |
922 | #ifndef WIN32 |
1644 | #ifndef _WIN32 |
923 | ev_ref (EV_A); /* child watcher */ |
1645 | ev_ref (EV_A); /* child watcher */ |
924 | ev_signal_stop (EV_A_ &childev); |
1646 | ev_signal_stop (EV_A_ &childev); |
925 | #endif |
1647 | #endif |
926 | |
1648 | |
927 | ev_ref (EV_A); /* signal watcher */ |
|
|
928 | ev_io_stop (EV_A_ &sigev); |
|
|
929 | |
|
|
930 | close (sigpipe [0]); sigpipe [0] = 0; |
|
|
931 | close (sigpipe [1]); sigpipe [1] = 0; |
|
|
932 | |
|
|
933 | loop_destroy (EV_A); |
1649 | loop_destroy (EV_A); |
934 | } |
1650 | } |
935 | |
1651 | |
936 | void |
1652 | void |
937 | ev_default_fork (void) |
1653 | ev_default_fork (void) |
938 | { |
1654 | { |
939 | #if EV_MULTIPLICITY |
1655 | #if EV_MULTIPLICITY |
940 | struct ev_loop *loop = default_loop; |
1656 | struct ev_loop *loop = ev_default_loop_ptr; |
941 | #endif |
1657 | #endif |
942 | |
1658 | |
943 | if (method) |
1659 | if (backend) |
944 | postfork = 1; |
1660 | postfork = 1; /* must be in line with ev_loop_fork */ |
945 | } |
1661 | } |
946 | |
1662 | |
947 | /*****************************************************************************/ |
1663 | /*****************************************************************************/ |
948 | |
1664 | |
949 | static int |
1665 | void |
950 | any_pending (EV_P) |
1666 | ev_invoke (EV_P_ void *w, int revents) |
951 | { |
1667 | { |
952 | int pri; |
1668 | EV_CB_INVOKE ((W)w, revents); |
953 | |
|
|
954 | for (pri = NUMPRI; pri--; ) |
|
|
955 | if (pendingcnt [pri]) |
|
|
956 | return 1; |
|
|
957 | |
|
|
958 | return 0; |
|
|
959 | } |
1669 | } |
960 | |
1670 | |
961 | static void |
1671 | void inline_speed |
962 | call_pending (EV_P) |
1672 | call_pending (EV_P) |
963 | { |
1673 | { |
964 | int pri; |
1674 | int pri; |
965 | |
1675 | |
966 | for (pri = NUMPRI; pri--; ) |
1676 | for (pri = NUMPRI; pri--; ) |
967 | while (pendingcnt [pri]) |
1677 | while (pendingcnt [pri]) |
968 | { |
1678 | { |
969 | ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
1679 | ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
970 | |
1680 | |
971 | if (p->w) |
1681 | if (expect_true (p->w)) |
972 | { |
1682 | { |
|
|
1683 | /*assert (("non-pending watcher on pending list", p->w->pending));*/ |
|
|
1684 | |
973 | p->w->pending = 0; |
1685 | p->w->pending = 0; |
974 | EV_CB_INVOKE (p->w, p->events); |
1686 | EV_CB_INVOKE (p->w, p->events); |
|
|
1687 | EV_FREQUENT_CHECK; |
975 | } |
1688 | } |
976 | } |
1689 | } |
977 | } |
1690 | } |
978 | |
1691 | |
979 | static void |
1692 | #if EV_IDLE_ENABLE |
|
|
1693 | void inline_size |
|
|
1694 | idle_reify (EV_P) |
|
|
1695 | { |
|
|
1696 | if (expect_false (idleall)) |
|
|
1697 | { |
|
|
1698 | int pri; |
|
|
1699 | |
|
|
1700 | for (pri = NUMPRI; pri--; ) |
|
|
1701 | { |
|
|
1702 | if (pendingcnt [pri]) |
|
|
1703 | break; |
|
|
1704 | |
|
|
1705 | if (idlecnt [pri]) |
|
|
1706 | { |
|
|
1707 | queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); |
|
|
1708 | break; |
|
|
1709 | } |
|
|
1710 | } |
|
|
1711 | } |
|
|
1712 | } |
|
|
1713 | #endif |
|
|
1714 | |
|
|
1715 | void inline_size |
980 | timers_reify (EV_P) |
1716 | timers_reify (EV_P) |
981 | { |
1717 | { |
|
|
1718 | EV_FREQUENT_CHECK; |
|
|
1719 | |
982 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
1720 | while (timercnt && ANHE_at (timers [HEAP0]) < mn_now) |
983 | { |
1721 | { |
984 | struct ev_timer *w = timers [0]; |
1722 | ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); |
985 | |
1723 | |
986 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
1724 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
987 | |
1725 | |
988 | /* first reschedule or stop timer */ |
1726 | /* first reschedule or stop timer */ |
989 | if (w->repeat) |
1727 | if (w->repeat) |
990 | { |
1728 | { |
|
|
1729 | ev_at (w) += w->repeat; |
|
|
1730 | if (ev_at (w) < mn_now) |
|
|
1731 | ev_at (w) = mn_now; |
|
|
1732 | |
991 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
1733 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
992 | ((WT)w)->at = mn_now + w->repeat; |
1734 | |
|
|
1735 | ANHE_at_cache (timers [HEAP0]); |
993 | downheap ((WT *)timers, timercnt, 0); |
1736 | downheap (timers, timercnt, HEAP0); |
994 | } |
1737 | } |
995 | else |
1738 | else |
996 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1739 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
997 | |
1740 | |
|
|
1741 | EV_FREQUENT_CHECK; |
998 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
1742 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
999 | } |
1743 | } |
1000 | } |
1744 | } |
1001 | |
1745 | |
1002 | static void |
1746 | #if EV_PERIODIC_ENABLE |
|
|
1747 | void inline_size |
1003 | periodics_reify (EV_P) |
1748 | periodics_reify (EV_P) |
1004 | { |
1749 | { |
|
|
1750 | EV_FREQUENT_CHECK; |
|
|
1751 | |
1005 | while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now) |
1752 | while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now) |
1006 | { |
1753 | { |
1007 | struct ev_periodic *w = periodics [0]; |
1754 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); |
1008 | |
1755 | |
1009 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
1756 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1010 | |
1757 | |
1011 | /* first reschedule or stop timer */ |
1758 | /* first reschedule or stop timer */ |
1012 | if (w->reschedule_cb) |
1759 | if (w->reschedule_cb) |
1013 | { |
1760 | { |
1014 | ev_tstamp at = ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + 0.0001); |
1761 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1015 | |
1762 | |
1016 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
1763 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now)); |
|
|
1764 | |
|
|
1765 | ANHE_at_cache (periodics [HEAP0]); |
1017 | downheap ((WT *)periodics, periodiccnt, 0); |
1766 | downheap (periodics, periodiccnt, HEAP0); |
1018 | } |
1767 | } |
1019 | else if (w->interval) |
1768 | else if (w->interval) |
1020 | { |
1769 | { |
1021 | ((WT)w)->at += floor ((ev_rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
1770 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1022 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
1771 | /* if next trigger time is not sufficiently in the future, put it there */ |
|
|
1772 | /* this might happen because of floating point inexactness */ |
|
|
1773 | if (ev_at (w) - ev_rt_now < TIME_EPSILON) |
|
|
1774 | { |
|
|
1775 | ev_at (w) += w->interval; |
|
|
1776 | |
|
|
1777 | /* if interval is unreasonably low we might still have a time in the past */ |
|
|
1778 | /* so correct this. this will make the periodic very inexact, but the user */ |
|
|
1779 | /* has effectively asked to get triggered more often than possible */ |
|
|
1780 | if (ev_at (w) < ev_rt_now) |
|
|
1781 | ev_at (w) = ev_rt_now; |
|
|
1782 | } |
|
|
1783 | |
|
|
1784 | ANHE_at_cache (periodics [HEAP0]); |
1023 | downheap ((WT *)periodics, periodiccnt, 0); |
1785 | downheap (periodics, periodiccnt, HEAP0); |
1024 | } |
1786 | } |
1025 | else |
1787 | else |
1026 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1788 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1027 | |
1789 | |
|
|
1790 | EV_FREQUENT_CHECK; |
1028 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1791 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1029 | } |
1792 | } |
1030 | } |
1793 | } |
1031 | |
1794 | |
1032 | static void |
1795 | static void noinline |
1033 | periodics_reschedule (EV_P) |
1796 | periodics_reschedule (EV_P) |
1034 | { |
1797 | { |
1035 | int i; |
1798 | int i; |
1036 | |
1799 | |
1037 | /* adjust periodics after time jump */ |
1800 | /* adjust periodics after time jump */ |
1038 | for (i = 0; i < periodiccnt; ++i) |
1801 | for (i = HEAP0; i < periodiccnt + HEAP0; ++i) |
1039 | { |
1802 | { |
1040 | struct ev_periodic *w = periodics [i]; |
1803 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]); |
1041 | |
1804 | |
1042 | if (w->reschedule_cb) |
1805 | if (w->reschedule_cb) |
1043 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
1806 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1044 | else if (w->interval) |
1807 | else if (w->interval) |
1045 | ((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1808 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1809 | |
|
|
1810 | ANHE_at_cache (periodics [i]); |
|
|
1811 | } |
|
|
1812 | |
|
|
1813 | reheap (periodics, periodiccnt); |
|
|
1814 | } |
|
|
1815 | #endif |
|
|
1816 | |
|
|
1817 | void inline_speed |
|
|
1818 | time_update (EV_P_ ev_tstamp max_block) |
|
|
1819 | { |
|
|
1820 | int i; |
|
|
1821 | |
|
|
1822 | #if EV_USE_MONOTONIC |
|
|
1823 | if (expect_true (have_monotonic)) |
1046 | } |
1824 | { |
|
|
1825 | ev_tstamp odiff = rtmn_diff; |
1047 | |
1826 | |
1048 | /* now rebuild the heap */ |
|
|
1049 | for (i = periodiccnt >> 1; i--; ) |
|
|
1050 | downheap ((WT *)periodics, periodiccnt, i); |
|
|
1051 | } |
|
|
1052 | |
|
|
1053 | inline int |
|
|
1054 | time_update_monotonic (EV_P) |
|
|
1055 | { |
|
|
1056 | mn_now = get_clock (); |
1827 | mn_now = get_clock (); |
1057 | |
1828 | |
|
|
1829 | /* only fetch the realtime clock every 0.5*MIN_TIMEJUMP seconds */ |
|
|
1830 | /* interpolate in the meantime */ |
1058 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1831 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1059 | { |
1832 | { |
1060 | ev_rt_now = rtmn_diff + mn_now; |
1833 | ev_rt_now = rtmn_diff + mn_now; |
1061 | return 0; |
1834 | return; |
1062 | } |
1835 | } |
1063 | else |
1836 | |
1064 | { |
|
|
1065 | now_floor = mn_now; |
1837 | now_floor = mn_now; |
1066 | ev_rt_now = ev_time (); |
1838 | ev_rt_now = ev_time (); |
1067 | return 1; |
|
|
1068 | } |
|
|
1069 | } |
|
|
1070 | |
1839 | |
1071 | static void |
1840 | /* loop a few times, before making important decisions. |
1072 | time_update (EV_P) |
1841 | * on the choice of "4": one iteration isn't enough, |
1073 | { |
1842 | * in case we get preempted during the calls to |
1074 | int i; |
1843 | * ev_time and get_clock. a second call is almost guaranteed |
1075 | |
1844 | * to succeed in that case, though. and looping a few more times |
1076 | #if EV_USE_MONOTONIC |
1845 | * doesn't hurt either as we only do this on time-jumps or |
1077 | if (expect_true (have_monotonic)) |
1846 | * in the unlikely event of having been preempted here. |
1078 | { |
1847 | */ |
1079 | if (time_update_monotonic (EV_A)) |
1848 | for (i = 4; --i; ) |
1080 | { |
1849 | { |
1081 | ev_tstamp odiff = rtmn_diff; |
1850 | rtmn_diff = ev_rt_now - mn_now; |
1082 | |
1851 | |
1083 | for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
1852 | if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP)) |
|
|
1853 | return; /* all is well */ |
|
|
1854 | |
|
|
1855 | ev_rt_now = ev_time (); |
|
|
1856 | mn_now = get_clock (); |
|
|
1857 | now_floor = mn_now; |
|
|
1858 | } |
|
|
1859 | |
|
|
1860 | # if EV_PERIODIC_ENABLE |
|
|
1861 | periodics_reschedule (EV_A); |
|
|
1862 | # endif |
|
|
1863 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
|
|
1864 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
|
|
1865 | } |
|
|
1866 | else |
|
|
1867 | #endif |
|
|
1868 | { |
|
|
1869 | ev_rt_now = ev_time (); |
|
|
1870 | |
|
|
1871 | if (expect_false (mn_now > ev_rt_now || ev_rt_now > mn_now + max_block + MIN_TIMEJUMP)) |
|
|
1872 | { |
|
|
1873 | #if EV_PERIODIC_ENABLE |
|
|
1874 | periodics_reschedule (EV_A); |
|
|
1875 | #endif |
|
|
1876 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
|
|
1877 | for (i = 0; i < timercnt; ++i) |
1084 | { |
1878 | { |
1085 | rtmn_diff = ev_rt_now - mn_now; |
1879 | ANHE *he = timers + i + HEAP0; |
1086 | |
1880 | ANHE_w (*he)->at += ev_rt_now - mn_now; |
1087 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1881 | ANHE_at_cache (*he); |
1088 | return; /* all is well */ |
|
|
1089 | |
|
|
1090 | ev_rt_now = ev_time (); |
|
|
1091 | mn_now = get_clock (); |
|
|
1092 | now_floor = mn_now; |
|
|
1093 | } |
1882 | } |
1094 | |
|
|
1095 | periodics_reschedule (EV_A); |
|
|
1096 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
|
|
1097 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
|
|
1098 | } |
1883 | } |
1099 | } |
|
|
1100 | else |
|
|
1101 | #endif |
|
|
1102 | { |
|
|
1103 | ev_rt_now = ev_time (); |
|
|
1104 | |
|
|
1105 | if (expect_false (mn_now > ev_rt_now || mn_now < ev_rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
|
|
1106 | { |
|
|
1107 | periodics_reschedule (EV_A); |
|
|
1108 | |
|
|
1109 | /* adjust timers. this is easy, as the offset is the same for all */ |
|
|
1110 | for (i = 0; i < timercnt; ++i) |
|
|
1111 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
|
|
1112 | } |
|
|
1113 | |
1884 | |
1114 | mn_now = ev_rt_now; |
1885 | mn_now = ev_rt_now; |
1115 | } |
1886 | } |
1116 | } |
1887 | } |
1117 | |
1888 | |
… | |
… | |
1130 | static int loop_done; |
1901 | static int loop_done; |
1131 | |
1902 | |
1132 | void |
1903 | void |
1133 | ev_loop (EV_P_ int flags) |
1904 | ev_loop (EV_P_ int flags) |
1134 | { |
1905 | { |
1135 | double block; |
1906 | loop_done = EVUNLOOP_CANCEL; |
1136 | loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
1907 | |
|
|
1908 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
1137 | |
1909 | |
1138 | do |
1910 | do |
1139 | { |
1911 | { |
|
|
1912 | #if EV_VERIFY >= 2 |
|
|
1913 | ev_loop_verify (EV_A); |
|
|
1914 | #endif |
|
|
1915 | |
|
|
1916 | #ifndef _WIN32 |
|
|
1917 | if (expect_false (curpid)) /* penalise the forking check even more */ |
|
|
1918 | if (expect_false (getpid () != curpid)) |
|
|
1919 | { |
|
|
1920 | curpid = getpid (); |
|
|
1921 | postfork = 1; |
|
|
1922 | } |
|
|
1923 | #endif |
|
|
1924 | |
|
|
1925 | #if EV_FORK_ENABLE |
|
|
1926 | /* we might have forked, so queue fork handlers */ |
|
|
1927 | if (expect_false (postfork)) |
|
|
1928 | if (forkcnt) |
|
|
1929 | { |
|
|
1930 | queue_events (EV_A_ (W *)forks, forkcnt, EV_FORK); |
|
|
1931 | call_pending (EV_A); |
|
|
1932 | } |
|
|
1933 | #endif |
|
|
1934 | |
1140 | /* queue check watchers (and execute them) */ |
1935 | /* queue prepare watchers (and execute them) */ |
1141 | if (expect_false (preparecnt)) |
1936 | if (expect_false (preparecnt)) |
1142 | { |
1937 | { |
1143 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1938 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1144 | call_pending (EV_A); |
1939 | call_pending (EV_A); |
1145 | } |
1940 | } |
1146 | |
1941 | |
|
|
1942 | if (expect_false (!activecnt)) |
|
|
1943 | break; |
|
|
1944 | |
1147 | /* we might have forked, so reify kernel state if necessary */ |
1945 | /* we might have forked, so reify kernel state if necessary */ |
1148 | if (expect_false (postfork)) |
1946 | if (expect_false (postfork)) |
1149 | loop_fork (EV_A); |
1947 | loop_fork (EV_A); |
1150 | |
1948 | |
1151 | /* update fd-related kernel structures */ |
1949 | /* update fd-related kernel structures */ |
1152 | fd_reify (EV_A); |
1950 | fd_reify (EV_A); |
1153 | |
1951 | |
1154 | /* calculate blocking time */ |
1952 | /* calculate blocking time */ |
|
|
1953 | { |
|
|
1954 | ev_tstamp waittime = 0.; |
|
|
1955 | ev_tstamp sleeptime = 0.; |
1155 | |
1956 | |
1156 | /* we only need this for !monotonic clock or timers, but as we basically |
1957 | if (expect_true (!(flags & EVLOOP_NONBLOCK || idleall || !activecnt))) |
1157 | always have timers, we just calculate it always */ |
|
|
1158 | #if EV_USE_MONOTONIC |
|
|
1159 | if (expect_true (have_monotonic)) |
|
|
1160 | time_update_monotonic (EV_A); |
|
|
1161 | else |
|
|
1162 | #endif |
|
|
1163 | { |
1958 | { |
1164 | ev_rt_now = ev_time (); |
1959 | /* update time to cancel out callback processing overhead */ |
1165 | mn_now = ev_rt_now; |
1960 | time_update (EV_A_ 1e100); |
1166 | } |
|
|
1167 | |
1961 | |
1168 | if (flags & EVLOOP_NONBLOCK || idlecnt) |
|
|
1169 | block = 0.; |
|
|
1170 | else |
|
|
1171 | { |
|
|
1172 | block = MAX_BLOCKTIME; |
1962 | waittime = MAX_BLOCKTIME; |
1173 | |
1963 | |
1174 | if (timercnt) |
1964 | if (timercnt) |
1175 | { |
1965 | { |
1176 | ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
1966 | ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge; |
1177 | if (block > to) block = to; |
1967 | if (waittime > to) waittime = to; |
1178 | } |
1968 | } |
1179 | |
1969 | |
|
|
1970 | #if EV_PERIODIC_ENABLE |
1180 | if (periodiccnt) |
1971 | if (periodiccnt) |
1181 | { |
1972 | { |
1182 | ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + method_fudge; |
1973 | ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1183 | if (block > to) block = to; |
1974 | if (waittime > to) waittime = to; |
1184 | } |
1975 | } |
|
|
1976 | #endif |
1185 | |
1977 | |
1186 | if (block < 0.) block = 0.; |
1978 | if (expect_false (waittime < timeout_blocktime)) |
|
|
1979 | waittime = timeout_blocktime; |
|
|
1980 | |
|
|
1981 | sleeptime = waittime - backend_fudge; |
|
|
1982 | |
|
|
1983 | if (expect_true (sleeptime > io_blocktime)) |
|
|
1984 | sleeptime = io_blocktime; |
|
|
1985 | |
|
|
1986 | if (sleeptime) |
|
|
1987 | { |
|
|
1988 | ev_sleep (sleeptime); |
|
|
1989 | waittime -= sleeptime; |
|
|
1990 | } |
1187 | } |
1991 | } |
1188 | |
1992 | |
1189 | method_poll (EV_A_ block); |
1993 | ++loop_count; |
|
|
1994 | backend_poll (EV_A_ waittime); |
1190 | |
1995 | |
1191 | /* update ev_rt_now, do magic */ |
1996 | /* update ev_rt_now, do magic */ |
1192 | time_update (EV_A); |
1997 | time_update (EV_A_ waittime + sleeptime); |
|
|
1998 | } |
1193 | |
1999 | |
1194 | /* queue pending timers and reschedule them */ |
2000 | /* queue pending timers and reschedule them */ |
1195 | timers_reify (EV_A); /* relative timers called last */ |
2001 | timers_reify (EV_A); /* relative timers called last */ |
|
|
2002 | #if EV_PERIODIC_ENABLE |
1196 | periodics_reify (EV_A); /* absolute timers called first */ |
2003 | periodics_reify (EV_A); /* absolute timers called first */ |
|
|
2004 | #endif |
1197 | |
2005 | |
|
|
2006 | #if EV_IDLE_ENABLE |
1198 | /* queue idle watchers unless io or timers are pending */ |
2007 | /* queue idle watchers unless other events are pending */ |
1199 | if (idlecnt && !any_pending (EV_A)) |
2008 | idle_reify (EV_A); |
1200 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
2009 | #endif |
1201 | |
2010 | |
1202 | /* queue check watchers, to be executed first */ |
2011 | /* queue check watchers, to be executed first */ |
1203 | if (checkcnt) |
2012 | if (expect_false (checkcnt)) |
1204 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
2013 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1205 | |
2014 | |
1206 | call_pending (EV_A); |
2015 | call_pending (EV_A); |
1207 | } |
2016 | } |
1208 | while (activecnt && !loop_done); |
2017 | while (expect_true ( |
|
|
2018 | activecnt |
|
|
2019 | && !loop_done |
|
|
2020 | && !(flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK)) |
|
|
2021 | )); |
1209 | |
2022 | |
1210 | if (loop_done != 2) |
2023 | if (loop_done == EVUNLOOP_ONE) |
1211 | loop_done = 0; |
2024 | loop_done = EVUNLOOP_CANCEL; |
1212 | } |
2025 | } |
1213 | |
2026 | |
1214 | void |
2027 | void |
1215 | ev_unloop (EV_P_ int how) |
2028 | ev_unloop (EV_P_ int how) |
1216 | { |
2029 | { |
1217 | loop_done = how; |
2030 | loop_done = how; |
1218 | } |
2031 | } |
1219 | |
2032 | |
1220 | /*****************************************************************************/ |
2033 | /*****************************************************************************/ |
1221 | |
2034 | |
1222 | inline void |
2035 | void inline_size |
1223 | wlist_add (WL *head, WL elem) |
2036 | wlist_add (WL *head, WL elem) |
1224 | { |
2037 | { |
1225 | elem->next = *head; |
2038 | elem->next = *head; |
1226 | *head = elem; |
2039 | *head = elem; |
1227 | } |
2040 | } |
1228 | |
2041 | |
1229 | inline void |
2042 | void inline_size |
1230 | wlist_del (WL *head, WL elem) |
2043 | wlist_del (WL *head, WL elem) |
1231 | { |
2044 | { |
1232 | while (*head) |
2045 | while (*head) |
1233 | { |
2046 | { |
1234 | if (*head == elem) |
2047 | if (*head == elem) |
… | |
… | |
1239 | |
2052 | |
1240 | head = &(*head)->next; |
2053 | head = &(*head)->next; |
1241 | } |
2054 | } |
1242 | } |
2055 | } |
1243 | |
2056 | |
1244 | inline void |
2057 | void inline_speed |
1245 | ev_clear_pending (EV_P_ W w) |
2058 | clear_pending (EV_P_ W w) |
1246 | { |
2059 | { |
1247 | if (w->pending) |
2060 | if (w->pending) |
1248 | { |
2061 | { |
1249 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
2062 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
1250 | w->pending = 0; |
2063 | w->pending = 0; |
1251 | } |
2064 | } |
1252 | } |
2065 | } |
1253 | |
2066 | |
1254 | inline void |
2067 | int |
|
|
2068 | ev_clear_pending (EV_P_ void *w) |
|
|
2069 | { |
|
|
2070 | W w_ = (W)w; |
|
|
2071 | int pending = w_->pending; |
|
|
2072 | |
|
|
2073 | if (expect_true (pending)) |
|
|
2074 | { |
|
|
2075 | ANPENDING *p = pendings [ABSPRI (w_)] + pending - 1; |
|
|
2076 | w_->pending = 0; |
|
|
2077 | p->w = 0; |
|
|
2078 | return p->events; |
|
|
2079 | } |
|
|
2080 | else |
|
|
2081 | return 0; |
|
|
2082 | } |
|
|
2083 | |
|
|
2084 | void inline_size |
|
|
2085 | pri_adjust (EV_P_ W w) |
|
|
2086 | { |
|
|
2087 | int pri = w->priority; |
|
|
2088 | pri = pri < EV_MINPRI ? EV_MINPRI : pri; |
|
|
2089 | pri = pri > EV_MAXPRI ? EV_MAXPRI : pri; |
|
|
2090 | w->priority = pri; |
|
|
2091 | } |
|
|
2092 | |
|
|
2093 | void inline_speed |
1255 | ev_start (EV_P_ W w, int active) |
2094 | ev_start (EV_P_ W w, int active) |
1256 | { |
2095 | { |
1257 | if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
2096 | pri_adjust (EV_A_ w); |
1258 | if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
|
|
1259 | |
|
|
1260 | w->active = active; |
2097 | w->active = active; |
1261 | ev_ref (EV_A); |
2098 | ev_ref (EV_A); |
1262 | } |
2099 | } |
1263 | |
2100 | |
1264 | inline void |
2101 | void inline_size |
1265 | ev_stop (EV_P_ W w) |
2102 | ev_stop (EV_P_ W w) |
1266 | { |
2103 | { |
1267 | ev_unref (EV_A); |
2104 | ev_unref (EV_A); |
1268 | w->active = 0; |
2105 | w->active = 0; |
1269 | } |
2106 | } |
1270 | |
2107 | |
1271 | /*****************************************************************************/ |
2108 | /*****************************************************************************/ |
1272 | |
2109 | |
1273 | void |
2110 | void noinline |
1274 | ev_io_start (EV_P_ struct ev_io *w) |
2111 | ev_io_start (EV_P_ ev_io *w) |
1275 | { |
2112 | { |
1276 | int fd = w->fd; |
2113 | int fd = w->fd; |
1277 | |
2114 | |
1278 | if (ev_is_active (w)) |
2115 | if (expect_false (ev_is_active (w))) |
1279 | return; |
2116 | return; |
1280 | |
2117 | |
1281 | assert (("ev_io_start called with negative fd", fd >= 0)); |
2118 | assert (("ev_io_start called with negative fd", fd >= 0)); |
|
|
2119 | |
|
|
2120 | EV_FREQUENT_CHECK; |
1282 | |
2121 | |
1283 | ev_start (EV_A_ (W)w, 1); |
2122 | ev_start (EV_A_ (W)w, 1); |
1284 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
2123 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1285 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
2124 | wlist_add (&anfds[fd].head, (WL)w); |
1286 | |
2125 | |
1287 | fd_change (EV_A_ fd); |
2126 | fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); |
1288 | } |
2127 | w->events &= ~EV_IOFDSET; |
1289 | |
2128 | |
1290 | void |
2129 | EV_FREQUENT_CHECK; |
|
|
2130 | } |
|
|
2131 | |
|
|
2132 | void noinline |
1291 | ev_io_stop (EV_P_ struct ev_io *w) |
2133 | ev_io_stop (EV_P_ ev_io *w) |
1292 | { |
2134 | { |
1293 | ev_clear_pending (EV_A_ (W)w); |
2135 | clear_pending (EV_A_ (W)w); |
1294 | if (!ev_is_active (w)) |
2136 | if (expect_false (!ev_is_active (w))) |
1295 | return; |
2137 | return; |
1296 | |
2138 | |
1297 | assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
2139 | assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1298 | |
2140 | |
|
|
2141 | EV_FREQUENT_CHECK; |
|
|
2142 | |
1299 | wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
2143 | wlist_del (&anfds[w->fd].head, (WL)w); |
1300 | ev_stop (EV_A_ (W)w); |
2144 | ev_stop (EV_A_ (W)w); |
1301 | |
2145 | |
1302 | fd_change (EV_A_ w->fd); |
2146 | fd_change (EV_A_ w->fd, 1); |
1303 | } |
|
|
1304 | |
2147 | |
1305 | void |
2148 | EV_FREQUENT_CHECK; |
|
|
2149 | } |
|
|
2150 | |
|
|
2151 | void noinline |
1306 | ev_timer_start (EV_P_ struct ev_timer *w) |
2152 | ev_timer_start (EV_P_ ev_timer *w) |
1307 | { |
2153 | { |
|
|
2154 | if (expect_false (ev_is_active (w))) |
|
|
2155 | return; |
|
|
2156 | |
|
|
2157 | ev_at (w) += mn_now; |
|
|
2158 | |
|
|
2159 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
|
|
2160 | |
|
|
2161 | EV_FREQUENT_CHECK; |
|
|
2162 | |
|
|
2163 | ++timercnt; |
|
|
2164 | ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1); |
|
|
2165 | array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); |
|
|
2166 | ANHE_w (timers [ev_active (w)]) = (WT)w; |
|
|
2167 | ANHE_at_cache (timers [ev_active (w)]); |
|
|
2168 | upheap (timers, ev_active (w)); |
|
|
2169 | |
|
|
2170 | EV_FREQUENT_CHECK; |
|
|
2171 | |
|
|
2172 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ |
|
|
2173 | } |
|
|
2174 | |
|
|
2175 | void noinline |
|
|
2176 | ev_timer_stop (EV_P_ ev_timer *w) |
|
|
2177 | { |
|
|
2178 | clear_pending (EV_A_ (W)w); |
|
|
2179 | if (expect_false (!ev_is_active (w))) |
|
|
2180 | return; |
|
|
2181 | |
|
|
2182 | EV_FREQUENT_CHECK; |
|
|
2183 | |
|
|
2184 | { |
|
|
2185 | int active = ev_active (w); |
|
|
2186 | |
|
|
2187 | assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); |
|
|
2188 | |
|
|
2189 | --timercnt; |
|
|
2190 | |
|
|
2191 | if (expect_true (active < timercnt + HEAP0)) |
|
|
2192 | { |
|
|
2193 | timers [active] = timers [timercnt + HEAP0]; |
|
|
2194 | adjustheap (timers, timercnt, active); |
|
|
2195 | } |
|
|
2196 | } |
|
|
2197 | |
|
|
2198 | EV_FREQUENT_CHECK; |
|
|
2199 | |
|
|
2200 | ev_at (w) -= mn_now; |
|
|
2201 | |
|
|
2202 | ev_stop (EV_A_ (W)w); |
|
|
2203 | } |
|
|
2204 | |
|
|
2205 | void noinline |
|
|
2206 | ev_timer_again (EV_P_ ev_timer *w) |
|
|
2207 | { |
|
|
2208 | EV_FREQUENT_CHECK; |
|
|
2209 | |
1308 | if (ev_is_active (w)) |
2210 | if (ev_is_active (w)) |
1309 | return; |
|
|
1310 | |
|
|
1311 | ((WT)w)->at += mn_now; |
|
|
1312 | |
|
|
1313 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
|
|
1314 | |
|
|
1315 | ev_start (EV_A_ (W)w, ++timercnt); |
|
|
1316 | array_needsize (struct ev_timer *, timers, timermax, timercnt, (void)); |
|
|
1317 | timers [timercnt - 1] = w; |
|
|
1318 | upheap ((WT *)timers, timercnt - 1); |
|
|
1319 | |
|
|
1320 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1321 | } |
|
|
1322 | |
|
|
1323 | void |
|
|
1324 | ev_timer_stop (EV_P_ struct ev_timer *w) |
|
|
1325 | { |
|
|
1326 | ev_clear_pending (EV_A_ (W)w); |
|
|
1327 | if (!ev_is_active (w)) |
|
|
1328 | return; |
|
|
1329 | |
|
|
1330 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1331 | |
|
|
1332 | if (((W)w)->active < timercnt--) |
|
|
1333 | { |
|
|
1334 | timers [((W)w)->active - 1] = timers [timercnt]; |
|
|
1335 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
|
|
1336 | } |
|
|
1337 | |
|
|
1338 | ((WT)w)->at = w->repeat; |
|
|
1339 | |
|
|
1340 | ev_stop (EV_A_ (W)w); |
|
|
1341 | } |
|
|
1342 | |
|
|
1343 | void |
|
|
1344 | ev_timer_again (EV_P_ struct ev_timer *w) |
|
|
1345 | { |
|
|
1346 | if (ev_is_active (w)) |
|
|
1347 | { |
2211 | { |
1348 | if (w->repeat) |
2212 | if (w->repeat) |
1349 | adjustheap ((WT *)timers, timercnt, ((W)w)->active - 1, mn_now + w->repeat); |
2213 | { |
|
|
2214 | ev_at (w) = mn_now + w->repeat; |
|
|
2215 | ANHE_at_cache (timers [ev_active (w)]); |
|
|
2216 | adjustheap (timers, timercnt, ev_active (w)); |
|
|
2217 | } |
1350 | else |
2218 | else |
1351 | ev_timer_stop (EV_A_ w); |
2219 | ev_timer_stop (EV_A_ w); |
1352 | } |
2220 | } |
1353 | else if (w->repeat) |
2221 | else if (w->repeat) |
|
|
2222 | { |
|
|
2223 | ev_at (w) = w->repeat; |
1354 | ev_timer_start (EV_A_ w); |
2224 | ev_timer_start (EV_A_ w); |
1355 | } |
2225 | } |
1356 | |
2226 | |
1357 | void |
2227 | EV_FREQUENT_CHECK; |
|
|
2228 | } |
|
|
2229 | |
|
|
2230 | #if EV_PERIODIC_ENABLE |
|
|
2231 | void noinline |
1358 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
2232 | ev_periodic_start (EV_P_ ev_periodic *w) |
1359 | { |
2233 | { |
1360 | if (ev_is_active (w)) |
2234 | if (expect_false (ev_is_active (w))) |
1361 | return; |
2235 | return; |
1362 | |
2236 | |
1363 | if (w->reschedule_cb) |
2237 | if (w->reschedule_cb) |
1364 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
2238 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1365 | else if (w->interval) |
2239 | else if (w->interval) |
1366 | { |
2240 | { |
1367 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
2241 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1368 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
2242 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1369 | ((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
2243 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1370 | } |
2244 | } |
|
|
2245 | else |
|
|
2246 | ev_at (w) = w->offset; |
1371 | |
2247 | |
|
|
2248 | EV_FREQUENT_CHECK; |
|
|
2249 | |
|
|
2250 | ++periodiccnt; |
1372 | ev_start (EV_A_ (W)w, ++periodiccnt); |
2251 | ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1); |
1373 | array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void)); |
2252 | array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); |
1374 | periodics [periodiccnt - 1] = w; |
2253 | ANHE_w (periodics [ev_active (w)]) = (WT)w; |
1375 | upheap ((WT *)periodics, periodiccnt - 1); |
2254 | ANHE_at_cache (periodics [ev_active (w)]); |
|
|
2255 | upheap (periodics, ev_active (w)); |
1376 | |
2256 | |
|
|
2257 | EV_FREQUENT_CHECK; |
|
|
2258 | |
1377 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
2259 | /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ |
1378 | } |
2260 | } |
1379 | |
2261 | |
1380 | void |
2262 | void noinline |
1381 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
2263 | ev_periodic_stop (EV_P_ ev_periodic *w) |
1382 | { |
2264 | { |
1383 | ev_clear_pending (EV_A_ (W)w); |
2265 | clear_pending (EV_A_ (W)w); |
1384 | if (!ev_is_active (w)) |
2266 | if (expect_false (!ev_is_active (w))) |
1385 | return; |
2267 | return; |
1386 | |
2268 | |
|
|
2269 | EV_FREQUENT_CHECK; |
|
|
2270 | |
|
|
2271 | { |
|
|
2272 | int active = ev_active (w); |
|
|
2273 | |
1387 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
2274 | assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); |
1388 | |
2275 | |
1389 | if (((W)w)->active < periodiccnt--) |
2276 | --periodiccnt; |
|
|
2277 | |
|
|
2278 | if (expect_true (active < periodiccnt + HEAP0)) |
1390 | { |
2279 | { |
1391 | periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
2280 | periodics [active] = periodics [periodiccnt + HEAP0]; |
1392 | downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
2281 | adjustheap (periodics, periodiccnt, active); |
1393 | } |
2282 | } |
|
|
2283 | } |
|
|
2284 | |
|
|
2285 | EV_FREQUENT_CHECK; |
1394 | |
2286 | |
1395 | ev_stop (EV_A_ (W)w); |
2287 | ev_stop (EV_A_ (W)w); |
1396 | } |
2288 | } |
1397 | |
2289 | |
1398 | void |
2290 | void noinline |
1399 | ev_periodic_again (EV_P_ struct ev_periodic *w) |
2291 | ev_periodic_again (EV_P_ ev_periodic *w) |
1400 | { |
2292 | { |
1401 | /* TODO: use adjustheap and recalculation */ |
2293 | /* TODO: use adjustheap and recalculation */ |
1402 | ev_periodic_stop (EV_A_ w); |
2294 | ev_periodic_stop (EV_A_ w); |
1403 | ev_periodic_start (EV_A_ w); |
2295 | ev_periodic_start (EV_A_ w); |
1404 | } |
2296 | } |
1405 | |
2297 | #endif |
1406 | void |
|
|
1407 | ev_idle_start (EV_P_ struct ev_idle *w) |
|
|
1408 | { |
|
|
1409 | if (ev_is_active (w)) |
|
|
1410 | return; |
|
|
1411 | |
|
|
1412 | ev_start (EV_A_ (W)w, ++idlecnt); |
|
|
1413 | array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void)); |
|
|
1414 | idles [idlecnt - 1] = w; |
|
|
1415 | } |
|
|
1416 | |
|
|
1417 | void |
|
|
1418 | ev_idle_stop (EV_P_ struct ev_idle *w) |
|
|
1419 | { |
|
|
1420 | ev_clear_pending (EV_A_ (W)w); |
|
|
1421 | if (ev_is_active (w)) |
|
|
1422 | return; |
|
|
1423 | |
|
|
1424 | idles [((W)w)->active - 1] = idles [--idlecnt]; |
|
|
1425 | ev_stop (EV_A_ (W)w); |
|
|
1426 | } |
|
|
1427 | |
|
|
1428 | void |
|
|
1429 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
|
|
1430 | { |
|
|
1431 | if (ev_is_active (w)) |
|
|
1432 | return; |
|
|
1433 | |
|
|
1434 | ev_start (EV_A_ (W)w, ++preparecnt); |
|
|
1435 | array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void)); |
|
|
1436 | prepares [preparecnt - 1] = w; |
|
|
1437 | } |
|
|
1438 | |
|
|
1439 | void |
|
|
1440 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
|
|
1441 | { |
|
|
1442 | ev_clear_pending (EV_A_ (W)w); |
|
|
1443 | if (ev_is_active (w)) |
|
|
1444 | return; |
|
|
1445 | |
|
|
1446 | prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
|
|
1447 | ev_stop (EV_A_ (W)w); |
|
|
1448 | } |
|
|
1449 | |
|
|
1450 | void |
|
|
1451 | ev_check_start (EV_P_ struct ev_check *w) |
|
|
1452 | { |
|
|
1453 | if (ev_is_active (w)) |
|
|
1454 | return; |
|
|
1455 | |
|
|
1456 | ev_start (EV_A_ (W)w, ++checkcnt); |
|
|
1457 | array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void)); |
|
|
1458 | checks [checkcnt - 1] = w; |
|
|
1459 | } |
|
|
1460 | |
|
|
1461 | void |
|
|
1462 | ev_check_stop (EV_P_ struct ev_check *w) |
|
|
1463 | { |
|
|
1464 | ev_clear_pending (EV_A_ (W)w); |
|
|
1465 | if (ev_is_active (w)) |
|
|
1466 | return; |
|
|
1467 | |
|
|
1468 | checks [((W)w)->active - 1] = checks [--checkcnt]; |
|
|
1469 | ev_stop (EV_A_ (W)w); |
|
|
1470 | } |
|
|
1471 | |
2298 | |
1472 | #ifndef SA_RESTART |
2299 | #ifndef SA_RESTART |
1473 | # define SA_RESTART 0 |
2300 | # define SA_RESTART 0 |
1474 | #endif |
2301 | #endif |
1475 | |
2302 | |
1476 | void |
2303 | void noinline |
1477 | ev_signal_start (EV_P_ struct ev_signal *w) |
2304 | ev_signal_start (EV_P_ ev_signal *w) |
1478 | { |
2305 | { |
1479 | #if EV_MULTIPLICITY |
2306 | #if EV_MULTIPLICITY |
1480 | assert (("signal watchers are only supported in the default loop", loop == default_loop)); |
2307 | assert (("signal watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
1481 | #endif |
2308 | #endif |
1482 | if (ev_is_active (w)) |
2309 | if (expect_false (ev_is_active (w))) |
1483 | return; |
2310 | return; |
1484 | |
2311 | |
1485 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
2312 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1486 | |
2313 | |
|
|
2314 | evpipe_init (EV_A); |
|
|
2315 | |
|
|
2316 | EV_FREQUENT_CHECK; |
|
|
2317 | |
|
|
2318 | { |
|
|
2319 | #ifndef _WIN32 |
|
|
2320 | sigset_t full, prev; |
|
|
2321 | sigfillset (&full); |
|
|
2322 | sigprocmask (SIG_SETMASK, &full, &prev); |
|
|
2323 | #endif |
|
|
2324 | |
|
|
2325 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
|
|
2326 | |
|
|
2327 | #ifndef _WIN32 |
|
|
2328 | sigprocmask (SIG_SETMASK, &prev, 0); |
|
|
2329 | #endif |
|
|
2330 | } |
|
|
2331 | |
1487 | ev_start (EV_A_ (W)w, 1); |
2332 | ev_start (EV_A_ (W)w, 1); |
1488 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
|
|
1489 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
2333 | wlist_add (&signals [w->signum - 1].head, (WL)w); |
1490 | |
2334 | |
1491 | if (!((WL)w)->next) |
2335 | if (!((WL)w)->next) |
1492 | { |
2336 | { |
1493 | #if WIN32 |
2337 | #if _WIN32 |
1494 | signal (w->signum, sighandler); |
2338 | signal (w->signum, ev_sighandler); |
1495 | #else |
2339 | #else |
1496 | struct sigaction sa; |
2340 | struct sigaction sa; |
1497 | sa.sa_handler = sighandler; |
2341 | sa.sa_handler = ev_sighandler; |
1498 | sigfillset (&sa.sa_mask); |
2342 | sigfillset (&sa.sa_mask); |
1499 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
2343 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1500 | sigaction (w->signum, &sa, 0); |
2344 | sigaction (w->signum, &sa, 0); |
1501 | #endif |
2345 | #endif |
1502 | } |
2346 | } |
1503 | } |
|
|
1504 | |
2347 | |
1505 | void |
2348 | EV_FREQUENT_CHECK; |
|
|
2349 | } |
|
|
2350 | |
|
|
2351 | void noinline |
1506 | ev_signal_stop (EV_P_ struct ev_signal *w) |
2352 | ev_signal_stop (EV_P_ ev_signal *w) |
1507 | { |
2353 | { |
1508 | ev_clear_pending (EV_A_ (W)w); |
2354 | clear_pending (EV_A_ (W)w); |
1509 | if (!ev_is_active (w)) |
2355 | if (expect_false (!ev_is_active (w))) |
1510 | return; |
2356 | return; |
1511 | |
2357 | |
|
|
2358 | EV_FREQUENT_CHECK; |
|
|
2359 | |
1512 | wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
2360 | wlist_del (&signals [w->signum - 1].head, (WL)w); |
1513 | ev_stop (EV_A_ (W)w); |
2361 | ev_stop (EV_A_ (W)w); |
1514 | |
2362 | |
1515 | if (!signals [w->signum - 1].head) |
2363 | if (!signals [w->signum - 1].head) |
1516 | signal (w->signum, SIG_DFL); |
2364 | signal (w->signum, SIG_DFL); |
1517 | } |
|
|
1518 | |
2365 | |
|
|
2366 | EV_FREQUENT_CHECK; |
|
|
2367 | } |
|
|
2368 | |
1519 | void |
2369 | void |
1520 | ev_child_start (EV_P_ struct ev_child *w) |
2370 | ev_child_start (EV_P_ ev_child *w) |
1521 | { |
2371 | { |
1522 | #if EV_MULTIPLICITY |
2372 | #if EV_MULTIPLICITY |
1523 | assert (("child watchers are only supported in the default loop", loop == default_loop)); |
2373 | assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
1524 | #endif |
2374 | #endif |
1525 | if (ev_is_active (w)) |
2375 | if (expect_false (ev_is_active (w))) |
1526 | return; |
2376 | return; |
1527 | |
2377 | |
|
|
2378 | EV_FREQUENT_CHECK; |
|
|
2379 | |
1528 | ev_start (EV_A_ (W)w, 1); |
2380 | ev_start (EV_A_ (W)w, 1); |
1529 | wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
2381 | wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
1530 | } |
|
|
1531 | |
2382 | |
|
|
2383 | EV_FREQUENT_CHECK; |
|
|
2384 | } |
|
|
2385 | |
1532 | void |
2386 | void |
1533 | ev_child_stop (EV_P_ struct ev_child *w) |
2387 | ev_child_stop (EV_P_ ev_child *w) |
1534 | { |
2388 | { |
1535 | ev_clear_pending (EV_A_ (W)w); |
2389 | clear_pending (EV_A_ (W)w); |
1536 | if (ev_is_active (w)) |
2390 | if (expect_false (!ev_is_active (w))) |
1537 | return; |
2391 | return; |
1538 | |
2392 | |
|
|
2393 | EV_FREQUENT_CHECK; |
|
|
2394 | |
1539 | wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
2395 | wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
1540 | ev_stop (EV_A_ (W)w); |
2396 | ev_stop (EV_A_ (W)w); |
|
|
2397 | |
|
|
2398 | EV_FREQUENT_CHECK; |
1541 | } |
2399 | } |
|
|
2400 | |
|
|
2401 | #if EV_STAT_ENABLE |
|
|
2402 | |
|
|
2403 | # ifdef _WIN32 |
|
|
2404 | # undef lstat |
|
|
2405 | # define lstat(a,b) _stati64 (a,b) |
|
|
2406 | # endif |
|
|
2407 | |
|
|
2408 | #define DEF_STAT_INTERVAL 5.0074891 |
|
|
2409 | #define MIN_STAT_INTERVAL 0.1074891 |
|
|
2410 | |
|
|
2411 | static void noinline stat_timer_cb (EV_P_ ev_timer *w_, int revents); |
|
|
2412 | |
|
|
2413 | #if EV_USE_INOTIFY |
|
|
2414 | # define EV_INOTIFY_BUFSIZE 8192 |
|
|
2415 | |
|
|
2416 | static void noinline |
|
|
2417 | infy_add (EV_P_ ev_stat *w) |
|
|
2418 | { |
|
|
2419 | w->wd = inotify_add_watch (fs_fd, w->path, IN_ATTRIB | IN_DELETE_SELF | IN_MOVE_SELF | IN_MODIFY | IN_DONT_FOLLOW | IN_MASK_ADD); |
|
|
2420 | |
|
|
2421 | if (w->wd < 0) |
|
|
2422 | { |
|
|
2423 | ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ |
|
|
2424 | |
|
|
2425 | /* monitor some parent directory for speedup hints */ |
|
|
2426 | /* note that exceeding the hardcoded limit is not a correctness issue, */ |
|
|
2427 | /* but an efficiency issue only */ |
|
|
2428 | if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) |
|
|
2429 | { |
|
|
2430 | char path [4096]; |
|
|
2431 | strcpy (path, w->path); |
|
|
2432 | |
|
|
2433 | do |
|
|
2434 | { |
|
|
2435 | int mask = IN_MASK_ADD | IN_DELETE_SELF | IN_MOVE_SELF |
|
|
2436 | | (errno == EACCES ? IN_ATTRIB : IN_CREATE | IN_MOVED_TO); |
|
|
2437 | |
|
|
2438 | char *pend = strrchr (path, '/'); |
|
|
2439 | |
|
|
2440 | if (!pend) |
|
|
2441 | break; /* whoops, no '/', complain to your admin */ |
|
|
2442 | |
|
|
2443 | *pend = 0; |
|
|
2444 | w->wd = inotify_add_watch (fs_fd, path, mask); |
|
|
2445 | } |
|
|
2446 | while (w->wd < 0 && (errno == ENOENT || errno == EACCES)); |
|
|
2447 | } |
|
|
2448 | } |
|
|
2449 | else |
|
|
2450 | ev_timer_stop (EV_A_ &w->timer); /* we can watch this in a race-free way */ |
|
|
2451 | |
|
|
2452 | if (w->wd >= 0) |
|
|
2453 | wlist_add (&fs_hash [w->wd & (EV_INOTIFY_HASHSIZE - 1)].head, (WL)w); |
|
|
2454 | } |
|
|
2455 | |
|
|
2456 | static void noinline |
|
|
2457 | infy_del (EV_P_ ev_stat *w) |
|
|
2458 | { |
|
|
2459 | int slot; |
|
|
2460 | int wd = w->wd; |
|
|
2461 | |
|
|
2462 | if (wd < 0) |
|
|
2463 | return; |
|
|
2464 | |
|
|
2465 | w->wd = -2; |
|
|
2466 | slot = wd & (EV_INOTIFY_HASHSIZE - 1); |
|
|
2467 | wlist_del (&fs_hash [slot].head, (WL)w); |
|
|
2468 | |
|
|
2469 | /* remove this watcher, if others are watching it, they will rearm */ |
|
|
2470 | inotify_rm_watch (fs_fd, wd); |
|
|
2471 | } |
|
|
2472 | |
|
|
2473 | static void noinline |
|
|
2474 | infy_wd (EV_P_ int slot, int wd, struct inotify_event *ev) |
|
|
2475 | { |
|
|
2476 | if (slot < 0) |
|
|
2477 | /* overflow, need to check for all hahs slots */ |
|
|
2478 | for (slot = 0; slot < EV_INOTIFY_HASHSIZE; ++slot) |
|
|
2479 | infy_wd (EV_A_ slot, wd, ev); |
|
|
2480 | else |
|
|
2481 | { |
|
|
2482 | WL w_; |
|
|
2483 | |
|
|
2484 | for (w_ = fs_hash [slot & (EV_INOTIFY_HASHSIZE - 1)].head; w_; ) |
|
|
2485 | { |
|
|
2486 | ev_stat *w = (ev_stat *)w_; |
|
|
2487 | w_ = w_->next; /* lets us remove this watcher and all before it */ |
|
|
2488 | |
|
|
2489 | if (w->wd == wd || wd == -1) |
|
|
2490 | { |
|
|
2491 | if (ev->mask & (IN_IGNORED | IN_UNMOUNT | IN_DELETE_SELF)) |
|
|
2492 | { |
|
|
2493 | w->wd = -1; |
|
|
2494 | infy_add (EV_A_ w); /* re-add, no matter what */ |
|
|
2495 | } |
|
|
2496 | |
|
|
2497 | stat_timer_cb (EV_A_ &w->timer, 0); |
|
|
2498 | } |
|
|
2499 | } |
|
|
2500 | } |
|
|
2501 | } |
|
|
2502 | |
|
|
2503 | static void |
|
|
2504 | infy_cb (EV_P_ ev_io *w, int revents) |
|
|
2505 | { |
|
|
2506 | char buf [EV_INOTIFY_BUFSIZE]; |
|
|
2507 | struct inotify_event *ev = (struct inotify_event *)buf; |
|
|
2508 | int ofs; |
|
|
2509 | int len = read (fs_fd, buf, sizeof (buf)); |
|
|
2510 | |
|
|
2511 | for (ofs = 0; ofs < len; ofs += sizeof (struct inotify_event) + ev->len) |
|
|
2512 | infy_wd (EV_A_ ev->wd, ev->wd, ev); |
|
|
2513 | } |
|
|
2514 | |
|
|
2515 | void inline_size |
|
|
2516 | infy_init (EV_P) |
|
|
2517 | { |
|
|
2518 | if (fs_fd != -2) |
|
|
2519 | return; |
|
|
2520 | |
|
|
2521 | fs_fd = inotify_init (); |
|
|
2522 | |
|
|
2523 | if (fs_fd >= 0) |
|
|
2524 | { |
|
|
2525 | ev_io_init (&fs_w, infy_cb, fs_fd, EV_READ); |
|
|
2526 | ev_set_priority (&fs_w, EV_MAXPRI); |
|
|
2527 | ev_io_start (EV_A_ &fs_w); |
|
|
2528 | } |
|
|
2529 | } |
|
|
2530 | |
|
|
2531 | void inline_size |
|
|
2532 | infy_fork (EV_P) |
|
|
2533 | { |
|
|
2534 | int slot; |
|
|
2535 | |
|
|
2536 | if (fs_fd < 0) |
|
|
2537 | return; |
|
|
2538 | |
|
|
2539 | close (fs_fd); |
|
|
2540 | fs_fd = inotify_init (); |
|
|
2541 | |
|
|
2542 | for (slot = 0; slot < EV_INOTIFY_HASHSIZE; ++slot) |
|
|
2543 | { |
|
|
2544 | WL w_ = fs_hash [slot].head; |
|
|
2545 | fs_hash [slot].head = 0; |
|
|
2546 | |
|
|
2547 | while (w_) |
|
|
2548 | { |
|
|
2549 | ev_stat *w = (ev_stat *)w_; |
|
|
2550 | w_ = w_->next; /* lets us add this watcher */ |
|
|
2551 | |
|
|
2552 | w->wd = -1; |
|
|
2553 | |
|
|
2554 | if (fs_fd >= 0) |
|
|
2555 | infy_add (EV_A_ w); /* re-add, no matter what */ |
|
|
2556 | else |
|
|
2557 | ev_timer_start (EV_A_ &w->timer); |
|
|
2558 | } |
|
|
2559 | |
|
|
2560 | } |
|
|
2561 | } |
|
|
2562 | |
|
|
2563 | #endif |
|
|
2564 | |
|
|
2565 | void |
|
|
2566 | ev_stat_stat (EV_P_ ev_stat *w) |
|
|
2567 | { |
|
|
2568 | if (lstat (w->path, &w->attr) < 0) |
|
|
2569 | w->attr.st_nlink = 0; |
|
|
2570 | else if (!w->attr.st_nlink) |
|
|
2571 | w->attr.st_nlink = 1; |
|
|
2572 | } |
|
|
2573 | |
|
|
2574 | static void noinline |
|
|
2575 | stat_timer_cb (EV_P_ ev_timer *w_, int revents) |
|
|
2576 | { |
|
|
2577 | ev_stat *w = (ev_stat *)(((char *)w_) - offsetof (ev_stat, timer)); |
|
|
2578 | |
|
|
2579 | /* we copy this here each the time so that */ |
|
|
2580 | /* prev has the old value when the callback gets invoked */ |
|
|
2581 | w->prev = w->attr; |
|
|
2582 | ev_stat_stat (EV_A_ w); |
|
|
2583 | |
|
|
2584 | /* memcmp doesn't work on netbsd, they.... do stuff to their struct stat */ |
|
|
2585 | if ( |
|
|
2586 | w->prev.st_dev != w->attr.st_dev |
|
|
2587 | || w->prev.st_ino != w->attr.st_ino |
|
|
2588 | || w->prev.st_mode != w->attr.st_mode |
|
|
2589 | || w->prev.st_nlink != w->attr.st_nlink |
|
|
2590 | || w->prev.st_uid != w->attr.st_uid |
|
|
2591 | || w->prev.st_gid != w->attr.st_gid |
|
|
2592 | || w->prev.st_rdev != w->attr.st_rdev |
|
|
2593 | || w->prev.st_size != w->attr.st_size |
|
|
2594 | || w->prev.st_atime != w->attr.st_atime |
|
|
2595 | || w->prev.st_mtime != w->attr.st_mtime |
|
|
2596 | || w->prev.st_ctime != w->attr.st_ctime |
|
|
2597 | ) { |
|
|
2598 | #if EV_USE_INOTIFY |
|
|
2599 | infy_del (EV_A_ w); |
|
|
2600 | infy_add (EV_A_ w); |
|
|
2601 | ev_stat_stat (EV_A_ w); /* avoid race... */ |
|
|
2602 | #endif |
|
|
2603 | |
|
|
2604 | ev_feed_event (EV_A_ w, EV_STAT); |
|
|
2605 | } |
|
|
2606 | } |
|
|
2607 | |
|
|
2608 | void |
|
|
2609 | ev_stat_start (EV_P_ ev_stat *w) |
|
|
2610 | { |
|
|
2611 | if (expect_false (ev_is_active (w))) |
|
|
2612 | return; |
|
|
2613 | |
|
|
2614 | /* since we use memcmp, we need to clear any padding data etc. */ |
|
|
2615 | memset (&w->prev, 0, sizeof (ev_statdata)); |
|
|
2616 | memset (&w->attr, 0, sizeof (ev_statdata)); |
|
|
2617 | |
|
|
2618 | ev_stat_stat (EV_A_ w); |
|
|
2619 | |
|
|
2620 | if (w->interval < MIN_STAT_INTERVAL) |
|
|
2621 | w->interval = w->interval ? MIN_STAT_INTERVAL : DEF_STAT_INTERVAL; |
|
|
2622 | |
|
|
2623 | ev_timer_init (&w->timer, stat_timer_cb, w->interval, w->interval); |
|
|
2624 | ev_set_priority (&w->timer, ev_priority (w)); |
|
|
2625 | |
|
|
2626 | #if EV_USE_INOTIFY |
|
|
2627 | infy_init (EV_A); |
|
|
2628 | |
|
|
2629 | if (fs_fd >= 0) |
|
|
2630 | infy_add (EV_A_ w); |
|
|
2631 | else |
|
|
2632 | #endif |
|
|
2633 | ev_timer_start (EV_A_ &w->timer); |
|
|
2634 | |
|
|
2635 | ev_start (EV_A_ (W)w, 1); |
|
|
2636 | |
|
|
2637 | EV_FREQUENT_CHECK; |
|
|
2638 | } |
|
|
2639 | |
|
|
2640 | void |
|
|
2641 | ev_stat_stop (EV_P_ ev_stat *w) |
|
|
2642 | { |
|
|
2643 | clear_pending (EV_A_ (W)w); |
|
|
2644 | if (expect_false (!ev_is_active (w))) |
|
|
2645 | return; |
|
|
2646 | |
|
|
2647 | EV_FREQUENT_CHECK; |
|
|
2648 | |
|
|
2649 | #if EV_USE_INOTIFY |
|
|
2650 | infy_del (EV_A_ w); |
|
|
2651 | #endif |
|
|
2652 | ev_timer_stop (EV_A_ &w->timer); |
|
|
2653 | |
|
|
2654 | ev_stop (EV_A_ (W)w); |
|
|
2655 | |
|
|
2656 | EV_FREQUENT_CHECK; |
|
|
2657 | } |
|
|
2658 | #endif |
|
|
2659 | |
|
|
2660 | #if EV_IDLE_ENABLE |
|
|
2661 | void |
|
|
2662 | ev_idle_start (EV_P_ ev_idle *w) |
|
|
2663 | { |
|
|
2664 | if (expect_false (ev_is_active (w))) |
|
|
2665 | return; |
|
|
2666 | |
|
|
2667 | pri_adjust (EV_A_ (W)w); |
|
|
2668 | |
|
|
2669 | EV_FREQUENT_CHECK; |
|
|
2670 | |
|
|
2671 | { |
|
|
2672 | int active = ++idlecnt [ABSPRI (w)]; |
|
|
2673 | |
|
|
2674 | ++idleall; |
|
|
2675 | ev_start (EV_A_ (W)w, active); |
|
|
2676 | |
|
|
2677 | array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); |
|
|
2678 | idles [ABSPRI (w)][active - 1] = w; |
|
|
2679 | } |
|
|
2680 | |
|
|
2681 | EV_FREQUENT_CHECK; |
|
|
2682 | } |
|
|
2683 | |
|
|
2684 | void |
|
|
2685 | ev_idle_stop (EV_P_ ev_idle *w) |
|
|
2686 | { |
|
|
2687 | clear_pending (EV_A_ (W)w); |
|
|
2688 | if (expect_false (!ev_is_active (w))) |
|
|
2689 | return; |
|
|
2690 | |
|
|
2691 | EV_FREQUENT_CHECK; |
|
|
2692 | |
|
|
2693 | { |
|
|
2694 | int active = ev_active (w); |
|
|
2695 | |
|
|
2696 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
|
|
2697 | ev_active (idles [ABSPRI (w)][active - 1]) = active; |
|
|
2698 | |
|
|
2699 | ev_stop (EV_A_ (W)w); |
|
|
2700 | --idleall; |
|
|
2701 | } |
|
|
2702 | |
|
|
2703 | EV_FREQUENT_CHECK; |
|
|
2704 | } |
|
|
2705 | #endif |
|
|
2706 | |
|
|
2707 | void |
|
|
2708 | ev_prepare_start (EV_P_ ev_prepare *w) |
|
|
2709 | { |
|
|
2710 | if (expect_false (ev_is_active (w))) |
|
|
2711 | return; |
|
|
2712 | |
|
|
2713 | EV_FREQUENT_CHECK; |
|
|
2714 | |
|
|
2715 | ev_start (EV_A_ (W)w, ++preparecnt); |
|
|
2716 | array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); |
|
|
2717 | prepares [preparecnt - 1] = w; |
|
|
2718 | |
|
|
2719 | EV_FREQUENT_CHECK; |
|
|
2720 | } |
|
|
2721 | |
|
|
2722 | void |
|
|
2723 | ev_prepare_stop (EV_P_ ev_prepare *w) |
|
|
2724 | { |
|
|
2725 | clear_pending (EV_A_ (W)w); |
|
|
2726 | if (expect_false (!ev_is_active (w))) |
|
|
2727 | return; |
|
|
2728 | |
|
|
2729 | EV_FREQUENT_CHECK; |
|
|
2730 | |
|
|
2731 | { |
|
|
2732 | int active = ev_active (w); |
|
|
2733 | |
|
|
2734 | prepares [active - 1] = prepares [--preparecnt]; |
|
|
2735 | ev_active (prepares [active - 1]) = active; |
|
|
2736 | } |
|
|
2737 | |
|
|
2738 | ev_stop (EV_A_ (W)w); |
|
|
2739 | |
|
|
2740 | EV_FREQUENT_CHECK; |
|
|
2741 | } |
|
|
2742 | |
|
|
2743 | void |
|
|
2744 | ev_check_start (EV_P_ ev_check *w) |
|
|
2745 | { |
|
|
2746 | if (expect_false (ev_is_active (w))) |
|
|
2747 | return; |
|
|
2748 | |
|
|
2749 | EV_FREQUENT_CHECK; |
|
|
2750 | |
|
|
2751 | ev_start (EV_A_ (W)w, ++checkcnt); |
|
|
2752 | array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); |
|
|
2753 | checks [checkcnt - 1] = w; |
|
|
2754 | |
|
|
2755 | EV_FREQUENT_CHECK; |
|
|
2756 | } |
|
|
2757 | |
|
|
2758 | void |
|
|
2759 | ev_check_stop (EV_P_ ev_check *w) |
|
|
2760 | { |
|
|
2761 | clear_pending (EV_A_ (W)w); |
|
|
2762 | if (expect_false (!ev_is_active (w))) |
|
|
2763 | return; |
|
|
2764 | |
|
|
2765 | EV_FREQUENT_CHECK; |
|
|
2766 | |
|
|
2767 | { |
|
|
2768 | int active = ev_active (w); |
|
|
2769 | |
|
|
2770 | checks [active - 1] = checks [--checkcnt]; |
|
|
2771 | ev_active (checks [active - 1]) = active; |
|
|
2772 | } |
|
|
2773 | |
|
|
2774 | ev_stop (EV_A_ (W)w); |
|
|
2775 | |
|
|
2776 | EV_FREQUENT_CHECK; |
|
|
2777 | } |
|
|
2778 | |
|
|
2779 | #if EV_EMBED_ENABLE |
|
|
2780 | void noinline |
|
|
2781 | ev_embed_sweep (EV_P_ ev_embed *w) |
|
|
2782 | { |
|
|
2783 | ev_loop (w->other, EVLOOP_NONBLOCK); |
|
|
2784 | } |
|
|
2785 | |
|
|
2786 | static void |
|
|
2787 | embed_io_cb (EV_P_ ev_io *io, int revents) |
|
|
2788 | { |
|
|
2789 | ev_embed *w = (ev_embed *)(((char *)io) - offsetof (ev_embed, io)); |
|
|
2790 | |
|
|
2791 | if (ev_cb (w)) |
|
|
2792 | ev_feed_event (EV_A_ (W)w, EV_EMBED); |
|
|
2793 | else |
|
|
2794 | ev_loop (w->other, EVLOOP_NONBLOCK); |
|
|
2795 | } |
|
|
2796 | |
|
|
2797 | static void |
|
|
2798 | embed_prepare_cb (EV_P_ ev_prepare *prepare, int revents) |
|
|
2799 | { |
|
|
2800 | ev_embed *w = (ev_embed *)(((char *)prepare) - offsetof (ev_embed, prepare)); |
|
|
2801 | |
|
|
2802 | { |
|
|
2803 | struct ev_loop *loop = w->other; |
|
|
2804 | |
|
|
2805 | while (fdchangecnt) |
|
|
2806 | { |
|
|
2807 | fd_reify (EV_A); |
|
|
2808 | ev_loop (EV_A_ EVLOOP_NONBLOCK); |
|
|
2809 | } |
|
|
2810 | } |
|
|
2811 | } |
|
|
2812 | |
|
|
2813 | #if 0 |
|
|
2814 | static void |
|
|
2815 | embed_idle_cb (EV_P_ ev_idle *idle, int revents) |
|
|
2816 | { |
|
|
2817 | ev_idle_stop (EV_A_ idle); |
|
|
2818 | } |
|
|
2819 | #endif |
|
|
2820 | |
|
|
2821 | void |
|
|
2822 | ev_embed_start (EV_P_ ev_embed *w) |
|
|
2823 | { |
|
|
2824 | if (expect_false (ev_is_active (w))) |
|
|
2825 | return; |
|
|
2826 | |
|
|
2827 | { |
|
|
2828 | struct ev_loop *loop = w->other; |
|
|
2829 | assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); |
|
|
2830 | ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); |
|
|
2831 | } |
|
|
2832 | |
|
|
2833 | EV_FREQUENT_CHECK; |
|
|
2834 | |
|
|
2835 | ev_set_priority (&w->io, ev_priority (w)); |
|
|
2836 | ev_io_start (EV_A_ &w->io); |
|
|
2837 | |
|
|
2838 | ev_prepare_init (&w->prepare, embed_prepare_cb); |
|
|
2839 | ev_set_priority (&w->prepare, EV_MINPRI); |
|
|
2840 | ev_prepare_start (EV_A_ &w->prepare); |
|
|
2841 | |
|
|
2842 | /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ |
|
|
2843 | |
|
|
2844 | ev_start (EV_A_ (W)w, 1); |
|
|
2845 | |
|
|
2846 | EV_FREQUENT_CHECK; |
|
|
2847 | } |
|
|
2848 | |
|
|
2849 | void |
|
|
2850 | ev_embed_stop (EV_P_ ev_embed *w) |
|
|
2851 | { |
|
|
2852 | clear_pending (EV_A_ (W)w); |
|
|
2853 | if (expect_false (!ev_is_active (w))) |
|
|
2854 | return; |
|
|
2855 | |
|
|
2856 | EV_FREQUENT_CHECK; |
|
|
2857 | |
|
|
2858 | ev_io_stop (EV_A_ &w->io); |
|
|
2859 | ev_prepare_stop (EV_A_ &w->prepare); |
|
|
2860 | |
|
|
2861 | ev_stop (EV_A_ (W)w); |
|
|
2862 | |
|
|
2863 | EV_FREQUENT_CHECK; |
|
|
2864 | } |
|
|
2865 | #endif |
|
|
2866 | |
|
|
2867 | #if EV_FORK_ENABLE |
|
|
2868 | void |
|
|
2869 | ev_fork_start (EV_P_ ev_fork *w) |
|
|
2870 | { |
|
|
2871 | if (expect_false (ev_is_active (w))) |
|
|
2872 | return; |
|
|
2873 | |
|
|
2874 | EV_FREQUENT_CHECK; |
|
|
2875 | |
|
|
2876 | ev_start (EV_A_ (W)w, ++forkcnt); |
|
|
2877 | array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); |
|
|
2878 | forks [forkcnt - 1] = w; |
|
|
2879 | |
|
|
2880 | EV_FREQUENT_CHECK; |
|
|
2881 | } |
|
|
2882 | |
|
|
2883 | void |
|
|
2884 | ev_fork_stop (EV_P_ ev_fork *w) |
|
|
2885 | { |
|
|
2886 | clear_pending (EV_A_ (W)w); |
|
|
2887 | if (expect_false (!ev_is_active (w))) |
|
|
2888 | return; |
|
|
2889 | |
|
|
2890 | EV_FREQUENT_CHECK; |
|
|
2891 | |
|
|
2892 | { |
|
|
2893 | int active = ev_active (w); |
|
|
2894 | |
|
|
2895 | forks [active - 1] = forks [--forkcnt]; |
|
|
2896 | ev_active (forks [active - 1]) = active; |
|
|
2897 | } |
|
|
2898 | |
|
|
2899 | ev_stop (EV_A_ (W)w); |
|
|
2900 | |
|
|
2901 | EV_FREQUENT_CHECK; |
|
|
2902 | } |
|
|
2903 | #endif |
|
|
2904 | |
|
|
2905 | #if EV_ASYNC_ENABLE |
|
|
2906 | void |
|
|
2907 | ev_async_start (EV_P_ ev_async *w) |
|
|
2908 | { |
|
|
2909 | if (expect_false (ev_is_active (w))) |
|
|
2910 | return; |
|
|
2911 | |
|
|
2912 | evpipe_init (EV_A); |
|
|
2913 | |
|
|
2914 | EV_FREQUENT_CHECK; |
|
|
2915 | |
|
|
2916 | ev_start (EV_A_ (W)w, ++asynccnt); |
|
|
2917 | array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); |
|
|
2918 | asyncs [asynccnt - 1] = w; |
|
|
2919 | |
|
|
2920 | EV_FREQUENT_CHECK; |
|
|
2921 | } |
|
|
2922 | |
|
|
2923 | void |
|
|
2924 | ev_async_stop (EV_P_ ev_async *w) |
|
|
2925 | { |
|
|
2926 | clear_pending (EV_A_ (W)w); |
|
|
2927 | if (expect_false (!ev_is_active (w))) |
|
|
2928 | return; |
|
|
2929 | |
|
|
2930 | EV_FREQUENT_CHECK; |
|
|
2931 | |
|
|
2932 | { |
|
|
2933 | int active = ev_active (w); |
|
|
2934 | |
|
|
2935 | asyncs [active - 1] = asyncs [--asynccnt]; |
|
|
2936 | ev_active (asyncs [active - 1]) = active; |
|
|
2937 | } |
|
|
2938 | |
|
|
2939 | ev_stop (EV_A_ (W)w); |
|
|
2940 | |
|
|
2941 | EV_FREQUENT_CHECK; |
|
|
2942 | } |
|
|
2943 | |
|
|
2944 | void |
|
|
2945 | ev_async_send (EV_P_ ev_async *w) |
|
|
2946 | { |
|
|
2947 | w->sent = 1; |
|
|
2948 | evpipe_write (EV_A_ &gotasync); |
|
|
2949 | } |
|
|
2950 | #endif |
1542 | |
2951 | |
1543 | /*****************************************************************************/ |
2952 | /*****************************************************************************/ |
1544 | |
2953 | |
1545 | struct ev_once |
2954 | struct ev_once |
1546 | { |
2955 | { |
1547 | struct ev_io io; |
2956 | ev_io io; |
1548 | struct ev_timer to; |
2957 | ev_timer to; |
1549 | void (*cb)(int revents, void *arg); |
2958 | void (*cb)(int revents, void *arg); |
1550 | void *arg; |
2959 | void *arg; |
1551 | }; |
2960 | }; |
1552 | |
2961 | |
1553 | static void |
2962 | static void |
… | |
… | |
1562 | |
2971 | |
1563 | cb (revents, arg); |
2972 | cb (revents, arg); |
1564 | } |
2973 | } |
1565 | |
2974 | |
1566 | static void |
2975 | static void |
1567 | once_cb_io (EV_P_ struct ev_io *w, int revents) |
2976 | once_cb_io (EV_P_ ev_io *w, int revents) |
1568 | { |
2977 | { |
1569 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
2978 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
1570 | } |
2979 | } |
1571 | |
2980 | |
1572 | static void |
2981 | static void |
1573 | once_cb_to (EV_P_ struct ev_timer *w, int revents) |
2982 | once_cb_to (EV_P_ ev_timer *w, int revents) |
1574 | { |
2983 | { |
1575 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
2984 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
1576 | } |
2985 | } |
1577 | |
2986 | |
1578 | void |
2987 | void |
1579 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
2988 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1580 | { |
2989 | { |
1581 | struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
2990 | struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1582 | |
2991 | |
1583 | if (!once) |
2992 | if (expect_false (!once)) |
|
|
2993 | { |
1584 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
2994 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1585 | else |
2995 | return; |
1586 | { |
2996 | } |
|
|
2997 | |
1587 | once->cb = cb; |
2998 | once->cb = cb; |
1588 | once->arg = arg; |
2999 | once->arg = arg; |
1589 | |
3000 | |
1590 | ev_init (&once->io, once_cb_io); |
3001 | ev_init (&once->io, once_cb_io); |
1591 | if (fd >= 0) |
3002 | if (fd >= 0) |
1592 | { |
3003 | { |
1593 | ev_io_set (&once->io, fd, events); |
3004 | ev_io_set (&once->io, fd, events); |
1594 | ev_io_start (EV_A_ &once->io); |
3005 | ev_io_start (EV_A_ &once->io); |
1595 | } |
3006 | } |
1596 | |
3007 | |
1597 | ev_init (&once->to, once_cb_to); |
3008 | ev_init (&once->to, once_cb_to); |
1598 | if (timeout >= 0.) |
3009 | if (timeout >= 0.) |
1599 | { |
3010 | { |
1600 | ev_timer_set (&once->to, timeout, 0.); |
3011 | ev_timer_set (&once->to, timeout, 0.); |
1601 | ev_timer_start (EV_A_ &once->to); |
3012 | ev_timer_start (EV_A_ &once->to); |
1602 | } |
|
|
1603 | } |
3013 | } |
1604 | } |
3014 | } |
|
|
3015 | |
|
|
3016 | #if EV_MULTIPLICITY |
|
|
3017 | #include "ev_wrap.h" |
|
|
3018 | #endif |
1605 | |
3019 | |
1606 | #ifdef __cplusplus |
3020 | #ifdef __cplusplus |
1607 | } |
3021 | } |
1608 | #endif |
3022 | #endif |
1609 | |
3023 | |