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