|
|
1 | /* |
|
|
2 | * libev event processing core, watcher management |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
|
|
5 | * All rights reserved. |
|
|
6 | * |
|
|
7 | * Redistribution and use in source and binary forms, with or without |
|
|
8 | * modification, are permitted provided that the following conditions are |
|
|
9 | * met: |
|
|
10 | * |
|
|
11 | * * Redistributions of source code must retain the above copyright |
|
|
12 | * notice, this list of conditions and the following disclaimer. |
|
|
13 | * |
|
|
14 | * * Redistributions in binary form must reproduce the above |
|
|
15 | * copyright notice, this list of conditions and the following |
|
|
16 | * disclaimer in the documentation and/or other materials provided |
|
|
17 | * with the distribution. |
|
|
18 | * |
|
|
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
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 | */ |
|
|
31 | #ifndef EV_STANDALONE |
|
|
32 | # include "config.h" |
|
|
33 | |
|
|
34 | # if HAVE_CLOCK_GETTIME |
|
|
35 | # define EV_USE_MONOTONIC 1 |
|
|
36 | # define EV_USE_REALTIME 1 |
|
|
37 | # endif |
|
|
38 | |
|
|
39 | # if HAVE_SELECT && HAVE_SYS_SELECT_H |
|
|
40 | # define EV_USE_SELECT 1 |
|
|
41 | # endif |
|
|
42 | |
|
|
43 | # if HAVE_POLL && HAVE_POLL_H |
|
|
44 | # define EV_USE_POLL 1 |
|
|
45 | # endif |
|
|
46 | |
|
|
47 | # if HAVE_EPOLL && HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H |
|
|
48 | # define EV_USE_EPOLL 1 |
|
|
49 | # endif |
|
|
50 | |
|
|
51 | # if HAVE_KQUEUE && HAVE_WORKING_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H |
|
|
52 | # define EV_USE_KQUEUE 1 |
|
|
53 | # endif |
|
|
54 | |
|
|
55 | #endif |
|
|
56 | |
1 | #include <math.h> |
57 | #include <math.h> |
2 | #include <stdlib.h> |
58 | #include <stdlib.h> |
|
|
59 | #include <fcntl.h> |
|
|
60 | #include <stddef.h> |
3 | |
61 | |
4 | #include <stdio.h> |
62 | #include <stdio.h> |
5 | |
63 | |
|
|
64 | #include <assert.h> |
6 | #include <errno.h> |
65 | #include <errno.h> |
7 | #include <sys/time.h> |
66 | #include <sys/types.h> |
8 | #include <time.h> |
67 | #include <time.h> |
9 | |
68 | |
|
|
69 | #include <signal.h> |
|
|
70 | |
|
|
71 | #ifndef WIN32 |
|
|
72 | # include <unistd.h> |
|
|
73 | # include <sys/time.h> |
|
|
74 | # include <sys/wait.h> |
|
|
75 | #endif |
|
|
76 | /**/ |
|
|
77 | |
|
|
78 | #ifndef EV_USE_MONOTONIC |
|
|
79 | # define EV_USE_MONOTONIC 1 |
|
|
80 | #endif |
|
|
81 | |
|
|
82 | #ifndef EV_USE_SELECT |
|
|
83 | # define EV_USE_SELECT 1 |
|
|
84 | #endif |
|
|
85 | |
|
|
86 | #ifndef EV_USE_POLL |
|
|
87 | # define EV_USE_POLL 0 /* poll is usually slower than select, and not as well tested */ |
|
|
88 | #endif |
|
|
89 | |
|
|
90 | #ifndef EV_USE_EPOLL |
|
|
91 | # define EV_USE_EPOLL 0 |
|
|
92 | #endif |
|
|
93 | |
|
|
94 | #ifndef EV_USE_KQUEUE |
|
|
95 | # define EV_USE_KQUEUE 0 |
|
|
96 | #endif |
|
|
97 | |
|
|
98 | #ifndef EV_USE_WIN32 |
|
|
99 | # ifdef WIN32 |
|
|
100 | # define EV_USE_WIN32 0 /* it does not exist, use select */ |
|
|
101 | # undef EV_USE_SELECT |
|
|
102 | # define EV_USE_SELECT 1 |
|
|
103 | # else |
|
|
104 | # define EV_USE_WIN32 0 |
|
|
105 | # endif |
|
|
106 | #endif |
|
|
107 | |
|
|
108 | #ifndef EV_USE_REALTIME |
|
|
109 | # define EV_USE_REALTIME 1 |
|
|
110 | #endif |
|
|
111 | |
|
|
112 | /**/ |
|
|
113 | |
10 | #ifdef CLOCK_MONOTONIC |
114 | #ifndef CLOCK_MONOTONIC |
|
|
115 | # undef EV_USE_MONOTONIC |
11 | # define HAVE_MONOTONIC 1 |
116 | # define EV_USE_MONOTONIC 0 |
12 | #endif |
117 | #endif |
13 | |
118 | |
14 | #define HAVE_EPOLL 1 |
119 | #ifndef CLOCK_REALTIME |
|
|
120 | # undef EV_USE_REALTIME |
15 | #define HAVE_REALTIME 1 |
121 | # define EV_USE_REALTIME 0 |
16 | #define HAVE_SELECT 0 |
122 | #endif |
17 | |
123 | |
18 | #define MAX_BLOCKTIME 60. |
124 | /**/ |
|
|
125 | |
|
|
126 | #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) */ |
|
|
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 */ |
19 | |
130 | |
20 | #include "ev.h" |
131 | #include "ev.h" |
21 | |
132 | |
|
|
133 | #if __GNUC__ >= 3 |
|
|
134 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
135 | # define inline inline |
|
|
136 | #else |
|
|
137 | # define expect(expr,value) (expr) |
|
|
138 | # define inline static |
|
|
139 | #endif |
|
|
140 | |
|
|
141 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
142 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
143 | |
|
|
144 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
|
|
145 | #define ABSPRI(w) ((w)->priority - EV_MINPRI) |
|
|
146 | |
22 | struct ev_watcher { |
147 | typedef struct ev_watcher *W; |
23 | EV_WATCHER (ev_watcher); |
148 | typedef struct ev_watcher_list *WL; |
|
|
149 | typedef struct ev_watcher_time *WT; |
|
|
150 | |
|
|
151 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
|
|
152 | |
|
|
153 | #include "ev_win32.c" |
|
|
154 | |
|
|
155 | /*****************************************************************************/ |
|
|
156 | |
|
|
157 | static void (*syserr_cb)(const char *msg); |
|
|
158 | |
|
|
159 | void ev_set_syserr_cb (void (*cb)(const char *msg)) |
|
|
160 | { |
|
|
161 | syserr_cb = cb; |
|
|
162 | } |
|
|
163 | |
|
|
164 | static void |
|
|
165 | syserr (const char *msg) |
|
|
166 | { |
|
|
167 | if (!msg) |
|
|
168 | msg = "(libev) system error"; |
|
|
169 | |
|
|
170 | if (syserr_cb) |
|
|
171 | syserr_cb (msg); |
|
|
172 | else |
|
|
173 | { |
|
|
174 | perror (msg); |
|
|
175 | abort (); |
|
|
176 | } |
|
|
177 | } |
|
|
178 | |
|
|
179 | static void *(*alloc)(void *ptr, long size); |
|
|
180 | |
|
|
181 | void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
|
|
182 | { |
|
|
183 | alloc = cb; |
|
|
184 | } |
|
|
185 | |
|
|
186 | static void * |
|
|
187 | ev_realloc (void *ptr, long size) |
|
|
188 | { |
|
|
189 | ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
|
|
190 | |
|
|
191 | if (!ptr && size) |
|
|
192 | { |
|
|
193 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
|
|
194 | abort (); |
|
|
195 | } |
|
|
196 | |
|
|
197 | return ptr; |
|
|
198 | } |
|
|
199 | |
|
|
200 | #define ev_malloc(size) ev_realloc (0, (size)) |
|
|
201 | #define ev_free(ptr) ev_realloc ((ptr), 0) |
|
|
202 | |
|
|
203 | /*****************************************************************************/ |
|
|
204 | |
|
|
205 | typedef struct |
|
|
206 | { |
|
|
207 | WL head; |
|
|
208 | unsigned char events; |
|
|
209 | unsigned char reify; |
|
|
210 | } ANFD; |
|
|
211 | |
|
|
212 | typedef struct |
|
|
213 | { |
|
|
214 | W w; |
|
|
215 | int events; |
|
|
216 | } ANPENDING; |
|
|
217 | |
|
|
218 | #if EV_MULTIPLICITY |
|
|
219 | |
|
|
220 | struct ev_loop |
|
|
221 | { |
|
|
222 | # define VAR(name,decl) decl; |
|
|
223 | # include "ev_vars.h" |
24 | }; |
224 | }; |
|
|
225 | # undef VAR |
|
|
226 | # include "ev_wrap.h" |
25 | |
227 | |
26 | struct ev_watcher_list { |
228 | #else |
27 | EV_WATCHER_LIST (ev_watcher_list); |
|
|
28 | }; |
|
|
29 | |
229 | |
30 | ev_tstamp ev_now; |
230 | # define VAR(name,decl) static decl; |
31 | int ev_method; |
231 | # include "ev_vars.h" |
|
|
232 | # undef VAR |
32 | |
233 | |
33 | static int have_monotonic; /* runtime */ |
234 | #endif |
34 | |
235 | |
35 | static ev_tstamp method_fudge; /* stupid epoll-returns-early bug */ |
236 | /*****************************************************************************/ |
36 | static void (*method_reify)(void); |
|
|
37 | static void (*method_poll)(ev_tstamp timeout); |
|
|
38 | |
237 | |
39 | ev_tstamp |
238 | inline ev_tstamp |
40 | ev_time (void) |
239 | ev_time (void) |
41 | { |
240 | { |
42 | #if HAVE_REALTIME |
241 | #if EV_USE_REALTIME |
43 | struct timespec ts; |
242 | struct timespec ts; |
44 | clock_gettime (CLOCK_REALTIME, &ts); |
243 | clock_gettime (CLOCK_REALTIME, &ts); |
45 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
244 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
46 | #else |
245 | #else |
47 | struct timeval tv; |
246 | struct timeval tv; |
48 | gettimeofday (&tv, 0); |
247 | gettimeofday (&tv, 0); |
49 | return tv.tv_sec + tv.tv_usec * 1e-6; |
248 | return tv.tv_sec + tv.tv_usec * 1e-6; |
50 | #endif |
249 | #endif |
51 | } |
250 | } |
52 | |
251 | |
53 | static ev_tstamp |
252 | inline ev_tstamp |
54 | get_clock (void) |
253 | get_clock (void) |
55 | { |
254 | { |
56 | #if HAVE_MONOTONIC |
255 | #if EV_USE_MONOTONIC |
57 | if (have_monotonic) |
256 | if (expect_true (have_monotonic)) |
58 | { |
257 | { |
59 | struct timespec ts; |
258 | struct timespec ts; |
60 | clock_gettime (CLOCK_MONOTONIC, &ts); |
259 | clock_gettime (CLOCK_MONOTONIC, &ts); |
61 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
260 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
62 | } |
261 | } |
63 | #endif |
262 | #endif |
64 | |
263 | |
65 | return ev_time (); |
264 | return ev_time (); |
66 | } |
265 | } |
67 | |
266 | |
|
|
267 | ev_tstamp |
|
|
268 | ev_now (EV_P) |
|
|
269 | { |
|
|
270 | return rt_now; |
|
|
271 | } |
|
|
272 | |
|
|
273 | #define array_roundsize(base,n) ((n) | 4 & ~3) |
|
|
274 | |
68 | #define array_needsize(base,cur,cnt,init) \ |
275 | #define array_needsize(base,cur,cnt,init) \ |
69 | if ((cnt) > cur) \ |
276 | if (expect_false ((cnt) > cur)) \ |
70 | { \ |
277 | { \ |
71 | int newcnt = cur ? cur << 1 : 16; \ |
278 | int newcnt = cur; \ |
72 | fprintf (stderr, "resize(" # base ") from %d to %d\n", cur, newcnt);\ |
279 | do \ |
|
|
280 | { \ |
|
|
281 | newcnt = array_roundsize (base, newcnt << 1); \ |
|
|
282 | } \ |
|
|
283 | while ((cnt) > newcnt); \ |
|
|
284 | \ |
73 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
285 | base = ev_realloc (base, sizeof (*base) * (newcnt)); \ |
74 | init (base + cur, newcnt - cur); \ |
286 | init (base + cur, newcnt - cur); \ |
75 | cur = newcnt; \ |
287 | cur = newcnt; \ |
76 | } |
288 | } |
77 | |
289 | |
78 | typedef struct |
290 | #define array_slim(stem) \ |
79 | { |
291 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
80 | struct ev_io *head; |
292 | { \ |
81 | unsigned char wev, rev; /* want, received event set */ |
293 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
82 | } ANFD; |
294 | base = ev_realloc (base, sizeof (*base) * (stem ## max)); \ |
|
|
295 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
|
|
296 | } |
83 | |
297 | |
84 | static ANFD *anfds; |
298 | /* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ |
85 | static int anfdmax; |
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; |
86 | |
302 | |
87 | static int *fdchanges; |
303 | #define array_free(stem, idx) \ |
88 | static int fdchangemax, fdchangecnt; |
304 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
|
|
305 | |
|
|
306 | /*****************************************************************************/ |
89 | |
307 | |
90 | static void |
308 | static void |
91 | anfds_init (ANFD *base, int count) |
309 | anfds_init (ANFD *base, int count) |
92 | { |
310 | { |
93 | while (count--) |
311 | while (count--) |
94 | { |
312 | { |
95 | base->head = 0; |
313 | base->head = 0; |
96 | base->wev = base->rev = EV_NONE; |
314 | base->events = EV_NONE; |
|
|
315 | base->reify = 0; |
|
|
316 | |
97 | ++base; |
317 | ++base; |
98 | } |
318 | } |
99 | } |
319 | } |
100 | |
320 | |
101 | typedef struct |
|
|
102 | { |
|
|
103 | struct ev_watcher *w; |
|
|
104 | int events; |
|
|
105 | } ANPENDING; |
|
|
106 | |
|
|
107 | static ANPENDING *pendings; |
|
|
108 | static int pendingmax, pendingcnt; |
|
|
109 | |
|
|
110 | static void |
321 | static void |
111 | event (struct ev_watcher *w, int events) |
322 | event (EV_P_ W w, int events) |
112 | { |
323 | { |
|
|
324 | if (w->pending) |
|
|
325 | { |
|
|
326 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
|
|
327 | return; |
|
|
328 | } |
|
|
329 | |
113 | w->pending = ++pendingcnt; |
330 | w->pending = ++pendingcnt [ABSPRI (w)]; |
114 | array_needsize (pendings, pendingmax, pendingcnt, ); |
331 | array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], (void)); |
115 | pendings [pendingcnt - 1].w = w; |
332 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
116 | pendings [pendingcnt - 1].events = events; |
333 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
117 | } |
334 | } |
118 | |
335 | |
119 | static void |
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 |
120 | fd_event (int fd, int events) |
346 | fd_event (EV_P_ int fd, int events) |
121 | { |
347 | { |
122 | ANFD *anfd = anfds + fd; |
348 | ANFD *anfd = anfds + fd; |
123 | struct ev_io *w; |
349 | struct ev_io *w; |
124 | |
350 | |
125 | for (w = anfd->head; w; w = w->next) |
351 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
126 | { |
352 | { |
127 | int ev = w->events & events; |
353 | int ev = w->events & events; |
128 | |
354 | |
129 | if (ev) |
355 | if (ev) |
130 | event ((struct ev_watcher *)w, ev); |
356 | event (EV_A_ (W)w, ev); |
|
|
357 | } |
|
|
358 | } |
|
|
359 | |
|
|
360 | /*****************************************************************************/ |
|
|
361 | |
|
|
362 | static void |
|
|
363 | fd_reify (EV_P) |
|
|
364 | { |
|
|
365 | int i; |
|
|
366 | |
|
|
367 | for (i = 0; i < fdchangecnt; ++i) |
|
|
368 | { |
|
|
369 | int fd = fdchanges [i]; |
|
|
370 | ANFD *anfd = anfds + fd; |
|
|
371 | struct ev_io *w; |
|
|
372 | |
|
|
373 | int events = 0; |
|
|
374 | |
|
|
375 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
|
|
376 | events |= w->events; |
|
|
377 | |
|
|
378 | anfd->reify = 0; |
|
|
379 | |
|
|
380 | method_modify (EV_A_ fd, anfd->events, events); |
|
|
381 | anfd->events = events; |
|
|
382 | } |
|
|
383 | |
|
|
384 | fdchangecnt = 0; |
|
|
385 | } |
|
|
386 | |
|
|
387 | static void |
|
|
388 | fd_change (EV_P_ int fd) |
|
|
389 | { |
|
|
390 | if (anfds [fd].reify) |
|
|
391 | return; |
|
|
392 | |
|
|
393 | anfds [fd].reify = 1; |
|
|
394 | |
|
|
395 | ++fdchangecnt; |
|
|
396 | array_needsize (fdchanges, fdchangemax, fdchangecnt, (void)); |
|
|
397 | fdchanges [fdchangecnt - 1] = fd; |
|
|
398 | } |
|
|
399 | |
|
|
400 | static void |
|
|
401 | fd_kill (EV_P_ int fd) |
|
|
402 | { |
|
|
403 | struct ev_io *w; |
|
|
404 | |
|
|
405 | while ((w = (struct ev_io *)anfds [fd].head)) |
|
|
406 | { |
|
|
407 | ev_io_stop (EV_A_ w); |
|
|
408 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
|
|
409 | } |
|
|
410 | } |
|
|
411 | |
|
|
412 | static int |
|
|
413 | fd_valid (int fd) |
|
|
414 | { |
|
|
415 | #ifdef WIN32 |
|
|
416 | return !!win32_get_osfhandle (fd); |
|
|
417 | #else |
|
|
418 | return fcntl (fd, F_GETFD) != -1; |
|
|
419 | #endif |
|
|
420 | } |
|
|
421 | |
|
|
422 | /* called on EBADF to verify fds */ |
|
|
423 | static void |
|
|
424 | fd_ebadf (EV_P) |
|
|
425 | { |
|
|
426 | int fd; |
|
|
427 | |
|
|
428 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
429 | if (anfds [fd].events) |
|
|
430 | if (!fd_valid (fd) == -1 && errno == EBADF) |
|
|
431 | fd_kill (EV_A_ fd); |
|
|
432 | } |
|
|
433 | |
|
|
434 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
|
|
435 | static void |
|
|
436 | fd_enomem (EV_P) |
|
|
437 | { |
|
|
438 | int fd; |
|
|
439 | |
|
|
440 | for (fd = anfdmax; fd--; ) |
|
|
441 | if (anfds [fd].events) |
|
|
442 | { |
|
|
443 | fd_kill (EV_A_ fd); |
|
|
444 | return; |
131 | } |
445 | } |
132 | } |
446 | } |
133 | |
447 | |
134 | static struct ev_timer **timers; |
448 | /* usually called after fork if method needs to re-arm all fds from scratch */ |
135 | static int timermax, timercnt; |
|
|
136 | |
|
|
137 | static void |
449 | static void |
138 | upheap (int k) |
450 | fd_rearm_all (EV_P) |
139 | { |
451 | { |
140 | struct ev_timer *w = timers [k]; |
452 | int fd; |
141 | |
453 | |
|
|
454 | /* this should be highly optimised to not do anything but set a flag */ |
|
|
455 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
456 | if (anfds [fd].events) |
|
|
457 | { |
|
|
458 | anfds [fd].events = 0; |
|
|
459 | fd_change (EV_A_ fd); |
|
|
460 | } |
|
|
461 | } |
|
|
462 | |
|
|
463 | /*****************************************************************************/ |
|
|
464 | |
|
|
465 | static void |
|
|
466 | upheap (WT *heap, int k) |
|
|
467 | { |
|
|
468 | WT w = heap [k]; |
|
|
469 | |
142 | while (k && timers [k >> 1]->at > w->at) |
470 | while (k && heap [k >> 1]->at > w->at) |
143 | { |
471 | { |
144 | timers [k] = timers [k >> 1]; |
472 | heap [k] = heap [k >> 1]; |
145 | timers [k]->active = k + 1; |
473 | ((W)heap [k])->active = k + 1; |
146 | k >>= 1; |
474 | k >>= 1; |
147 | } |
475 | } |
148 | |
476 | |
149 | timers [k] = w; |
477 | heap [k] = w; |
150 | timers [k]->active = k + 1; |
478 | ((W)heap [k])->active = k + 1; |
151 | |
479 | |
152 | } |
480 | } |
153 | |
481 | |
154 | static void |
482 | static void |
155 | downheap (int k) |
483 | downheap (WT *heap, int N, int k) |
156 | { |
484 | { |
157 | struct ev_timer *w = timers [k]; |
485 | WT w = heap [k]; |
158 | |
486 | |
159 | while (k < (timercnt >> 1)) |
487 | while (k < (N >> 1)) |
160 | { |
488 | { |
161 | int j = k << 1; |
489 | int j = k << 1; |
162 | |
490 | |
163 | if (j + 1 < timercnt && timers [j]->at > timers [j + 1]->at) |
491 | if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
164 | ++j; |
492 | ++j; |
165 | |
493 | |
166 | if (w->at <= timers [j]->at) |
494 | if (w->at <= heap [j]->at) |
167 | break; |
495 | break; |
168 | |
496 | |
169 | timers [k] = timers [j]; |
497 | heap [k] = heap [j]; |
170 | timers [k]->active = k + 1; |
498 | ((W)heap [k])->active = k + 1; |
171 | k = j; |
499 | k = j; |
172 | } |
500 | } |
173 | |
501 | |
174 | timers [k] = w; |
502 | heap [k] = w; |
175 | timers [k]->active = k + 1; |
503 | ((W)heap [k])->active = k + 1; |
176 | } |
504 | } |
177 | |
505 | |
178 | static struct ev_signal **signals; |
506 | /*****************************************************************************/ |
|
|
507 | |
|
|
508 | typedef struct |
|
|
509 | { |
|
|
510 | WL head; |
|
|
511 | sig_atomic_t volatile gotsig; |
|
|
512 | } ANSIG; |
|
|
513 | |
|
|
514 | static ANSIG *signals; |
179 | static int signalmax, signalcnt; |
515 | static int signalmax; |
180 | |
516 | |
|
|
517 | static int sigpipe [2]; |
|
|
518 | static sig_atomic_t volatile gotsig; |
|
|
519 | static struct ev_io sigev; |
|
|
520 | |
181 | static void |
521 | static void |
182 | signals_init (struct ev_signal **base, int count) |
522 | signals_init (ANSIG *base, int count) |
183 | { |
523 | { |
184 | while (count--) |
524 | while (count--) |
185 | *base++ = 0; |
525 | { |
186 | } |
526 | base->head = 0; |
|
|
527 | base->gotsig = 0; |
187 | |
528 | |
|
|
529 | ++base; |
|
|
530 | } |
|
|
531 | } |
|
|
532 | |
|
|
533 | static void |
|
|
534 | sighandler (int signum) |
|
|
535 | { |
|
|
536 | #if WIN32 |
|
|
537 | signal (signum, sighandler); |
|
|
538 | #endif |
|
|
539 | |
|
|
540 | signals [signum - 1].gotsig = 1; |
|
|
541 | |
|
|
542 | if (!gotsig) |
|
|
543 | { |
|
|
544 | int old_errno = errno; |
|
|
545 | gotsig = 1; |
|
|
546 | write (sigpipe [1], &signum, 1); |
|
|
547 | errno = old_errno; |
|
|
548 | } |
|
|
549 | } |
|
|
550 | |
|
|
551 | static void |
|
|
552 | sigcb (EV_P_ struct ev_io *iow, int revents) |
|
|
553 | { |
|
|
554 | WL w; |
|
|
555 | int signum; |
|
|
556 | |
|
|
557 | read (sigpipe [0], &revents, 1); |
|
|
558 | gotsig = 0; |
|
|
559 | |
|
|
560 | for (signum = signalmax; signum--; ) |
|
|
561 | if (signals [signum].gotsig) |
|
|
562 | { |
|
|
563 | signals [signum].gotsig = 0; |
|
|
564 | |
|
|
565 | for (w = signals [signum].head; w; w = w->next) |
|
|
566 | event (EV_A_ (W)w, EV_SIGNAL); |
|
|
567 | } |
|
|
568 | } |
|
|
569 | |
|
|
570 | static void |
|
|
571 | siginit (EV_P) |
|
|
572 | { |
|
|
573 | #ifndef WIN32 |
|
|
574 | fcntl (sigpipe [0], F_SETFD, FD_CLOEXEC); |
|
|
575 | fcntl (sigpipe [1], F_SETFD, FD_CLOEXEC); |
|
|
576 | |
|
|
577 | /* rather than sort out wether we really need nb, set it */ |
|
|
578 | fcntl (sigpipe [0], F_SETFL, O_NONBLOCK); |
|
|
579 | fcntl (sigpipe [1], F_SETFL, O_NONBLOCK); |
|
|
580 | #endif |
|
|
581 | |
|
|
582 | ev_io_set (&sigev, sigpipe [0], EV_READ); |
|
|
583 | ev_io_start (EV_A_ &sigev); |
|
|
584 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
|
|
585 | } |
|
|
586 | |
|
|
587 | /*****************************************************************************/ |
|
|
588 | |
|
|
589 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
590 | |
|
|
591 | #ifndef WIN32 |
|
|
592 | |
|
|
593 | static struct ev_signal childev; |
|
|
594 | |
|
|
595 | #ifndef WCONTINUED |
|
|
596 | # define WCONTINUED 0 |
|
|
597 | #endif |
|
|
598 | |
|
|
599 | static void |
|
|
600 | child_reap (EV_P_ struct ev_signal *sw, int chain, int pid, int status) |
|
|
601 | { |
|
|
602 | struct ev_child *w; |
|
|
603 | |
|
|
604 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
|
|
605 | if (w->pid == pid || !w->pid) |
|
|
606 | { |
|
|
607 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
|
|
608 | w->rpid = pid; |
|
|
609 | w->rstatus = status; |
|
|
610 | event (EV_A_ (W)w, EV_CHILD); |
|
|
611 | } |
|
|
612 | } |
|
|
613 | |
|
|
614 | static void |
|
|
615 | childcb (EV_P_ struct ev_signal *sw, int revents) |
|
|
616 | { |
|
|
617 | int pid, status; |
|
|
618 | |
|
|
619 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
|
|
620 | { |
|
|
621 | /* make sure we are called again until all childs have been reaped */ |
|
|
622 | event (EV_A_ (W)sw, EV_SIGNAL); |
|
|
623 | |
|
|
624 | child_reap (EV_A_ sw, pid, pid, status); |
|
|
625 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
|
|
626 | } |
|
|
627 | } |
|
|
628 | |
|
|
629 | #endif |
|
|
630 | |
|
|
631 | /*****************************************************************************/ |
|
|
632 | |
|
|
633 | #if EV_USE_KQUEUE |
|
|
634 | # include "ev_kqueue.c" |
|
|
635 | #endif |
188 | #if HAVE_EPOLL |
636 | #if EV_USE_EPOLL |
189 | # include "ev_epoll.c" |
637 | # include "ev_epoll.c" |
190 | #endif |
638 | #endif |
|
|
639 | #if EV_USE_POLL |
|
|
640 | # include "ev_poll.c" |
|
|
641 | #endif |
191 | #if HAVE_SELECT |
642 | #if EV_USE_SELECT |
192 | # include "ev_select.c" |
643 | # include "ev_select.c" |
193 | #endif |
644 | #endif |
194 | |
645 | |
195 | int ev_init (int flags) |
646 | int |
|
|
647 | ev_version_major (void) |
196 | { |
648 | { |
|
|
649 | return EV_VERSION_MAJOR; |
|
|
650 | } |
|
|
651 | |
|
|
652 | int |
|
|
653 | ev_version_minor (void) |
|
|
654 | { |
|
|
655 | return EV_VERSION_MINOR; |
|
|
656 | } |
|
|
657 | |
|
|
658 | /* return true if we are running with elevated privileges and should ignore env variables */ |
|
|
659 | static int |
|
|
660 | enable_secure (void) |
|
|
661 | { |
|
|
662 | #ifdef WIN32 |
|
|
663 | return 0; |
|
|
664 | #else |
|
|
665 | return getuid () != geteuid () |
|
|
666 | || getgid () != getegid (); |
|
|
667 | #endif |
|
|
668 | } |
|
|
669 | |
|
|
670 | int |
|
|
671 | ev_method (EV_P) |
|
|
672 | { |
|
|
673 | return method; |
|
|
674 | } |
|
|
675 | |
|
|
676 | static void |
|
|
677 | loop_init (EV_P_ int methods) |
|
|
678 | { |
|
|
679 | if (!method) |
|
|
680 | { |
197 | #if HAVE_MONOTONIC |
681 | #if EV_USE_MONOTONIC |
198 | { |
682 | { |
199 | struct timespec ts; |
683 | struct timespec ts; |
200 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
684 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
201 | have_monotonic = 1; |
685 | have_monotonic = 1; |
202 | } |
686 | } |
203 | #endif |
687 | #endif |
204 | |
688 | |
205 | ev_now = ev_time (); |
689 | rt_now = ev_time (); |
|
|
690 | mn_now = get_clock (); |
|
|
691 | now_floor = mn_now; |
|
|
692 | rtmn_diff = rt_now - mn_now; |
206 | |
693 | |
|
|
694 | if (methods == EVMETHOD_AUTO) |
|
|
695 | if (!enable_secure () && getenv ("LIBEV_METHODS")) |
|
|
696 | methods = atoi (getenv ("LIBEV_METHODS")); |
|
|
697 | else |
|
|
698 | methods = EVMETHOD_ANY; |
|
|
699 | |
|
|
700 | method = 0; |
|
|
701 | #if EV_USE_WIN32 |
|
|
702 | if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
|
|
703 | #endif |
|
|
704 | #if EV_USE_KQUEUE |
|
|
705 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
|
|
706 | #endif |
207 | #if HAVE_EPOLL |
707 | #if EV_USE_EPOLL |
208 | if (epoll_init (flags)) |
708 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
209 | return ev_method; |
|
|
210 | #endif |
709 | #endif |
|
|
710 | #if EV_USE_POLL |
|
|
711 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
|
|
712 | #endif |
211 | #if HAVE_SELECT |
713 | #if EV_USE_SELECT |
212 | if (select_init (flags)) |
714 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
213 | return ev_method; |
|
|
214 | #endif |
715 | #endif |
215 | |
716 | |
216 | ev_method = EVMETHOD_NONE; |
717 | ev_watcher_init (&sigev, sigcb); |
217 | return ev_method; |
718 | ev_set_priority (&sigev, EV_MAXPRI); |
|
|
719 | } |
218 | } |
720 | } |
219 | |
721 | |
220 | void ev_prefork (void) |
722 | void |
221 | { |
723 | loop_destroy (EV_P) |
222 | } |
|
|
223 | |
|
|
224 | void ev_postfork_parent (void) |
|
|
225 | { |
|
|
226 | } |
|
|
227 | |
|
|
228 | void ev_postfork_child (void) |
|
|
229 | { |
|
|
230 | #if HAVE_EPOLL |
|
|
231 | epoll_postfork_child (); |
|
|
232 | #endif |
|
|
233 | } |
|
|
234 | |
|
|
235 | static void |
|
|
236 | call_pending () |
|
|
237 | { |
724 | { |
238 | int i; |
725 | int i; |
239 | |
726 | |
240 | for (i = 0; i < pendingcnt; ++i) |
727 | #if EV_USE_WIN32 |
|
|
728 | if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
|
|
729 | #endif |
|
|
730 | #if EV_USE_KQUEUE |
|
|
731 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
|
|
732 | #endif |
|
|
733 | #if EV_USE_EPOLL |
|
|
734 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
|
|
735 | #endif |
|
|
736 | #if EV_USE_POLL |
|
|
737 | if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
|
|
738 | #endif |
|
|
739 | #if EV_USE_SELECT |
|
|
740 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
|
|
741 | #endif |
|
|
742 | |
|
|
743 | for (i = NUMPRI; i--; ) |
|
|
744 | array_free (pending, [i]); |
|
|
745 | |
|
|
746 | /* have to use the microsoft-never-gets-it-right macro */ |
|
|
747 | array_free_microshit (fdchange); |
|
|
748 | array_free_microshit (timer); |
|
|
749 | array_free_microshit (periodic); |
|
|
750 | array_free_microshit (idle); |
|
|
751 | array_free_microshit (prepare); |
|
|
752 | array_free_microshit (check); |
|
|
753 | |
|
|
754 | method = 0; |
|
|
755 | } |
|
|
756 | |
|
|
757 | static void |
|
|
758 | loop_fork (EV_P) |
|
|
759 | { |
|
|
760 | #if EV_USE_EPOLL |
|
|
761 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
|
|
762 | #endif |
|
|
763 | #if EV_USE_KQUEUE |
|
|
764 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
|
|
765 | #endif |
|
|
766 | |
|
|
767 | if (ev_is_active (&sigev)) |
|
|
768 | { |
|
|
769 | /* default loop */ |
|
|
770 | |
|
|
771 | ev_ref (EV_A); |
|
|
772 | ev_io_stop (EV_A_ &sigev); |
|
|
773 | close (sigpipe [0]); |
|
|
774 | close (sigpipe [1]); |
|
|
775 | |
|
|
776 | while (pipe (sigpipe)) |
|
|
777 | syserr ("(libev) error creating pipe"); |
|
|
778 | |
|
|
779 | siginit (EV_A); |
241 | { |
780 | } |
242 | ANPENDING *p = pendings + i; |
|
|
243 | |
781 | |
244 | if (p->w) |
782 | postfork = 0; |
|
|
783 | } |
|
|
784 | |
|
|
785 | #if EV_MULTIPLICITY |
|
|
786 | struct ev_loop * |
|
|
787 | ev_loop_new (int methods) |
|
|
788 | { |
|
|
789 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
790 | |
|
|
791 | memset (loop, 0, sizeof (struct ev_loop)); |
|
|
792 | |
|
|
793 | loop_init (EV_A_ methods); |
|
|
794 | |
|
|
795 | if (ev_method (EV_A)) |
|
|
796 | return loop; |
|
|
797 | |
|
|
798 | return 0; |
|
|
799 | } |
|
|
800 | |
|
|
801 | void |
|
|
802 | ev_loop_destroy (EV_P) |
|
|
803 | { |
|
|
804 | loop_destroy (EV_A); |
|
|
805 | ev_free (loop); |
|
|
806 | } |
|
|
807 | |
|
|
808 | void |
|
|
809 | ev_loop_fork (EV_P) |
|
|
810 | { |
|
|
811 | postfork = 1; |
|
|
812 | } |
|
|
813 | |
|
|
814 | #endif |
|
|
815 | |
|
|
816 | #if EV_MULTIPLICITY |
|
|
817 | struct ev_loop default_loop_struct; |
|
|
818 | static struct ev_loop *default_loop; |
|
|
819 | |
|
|
820 | struct ev_loop * |
|
|
821 | #else |
|
|
822 | static int default_loop; |
|
|
823 | |
|
|
824 | int |
|
|
825 | #endif |
|
|
826 | ev_default_loop (int methods) |
|
|
827 | { |
|
|
828 | if (sigpipe [0] == sigpipe [1]) |
|
|
829 | if (pipe (sigpipe)) |
|
|
830 | return 0; |
|
|
831 | |
|
|
832 | if (!default_loop) |
|
|
833 | { |
|
|
834 | #if EV_MULTIPLICITY |
|
|
835 | struct ev_loop *loop = default_loop = &default_loop_struct; |
|
|
836 | #else |
|
|
837 | default_loop = 1; |
|
|
838 | #endif |
|
|
839 | |
|
|
840 | loop_init (EV_A_ methods); |
|
|
841 | |
|
|
842 | if (ev_method (EV_A)) |
245 | { |
843 | { |
246 | p->w->pending = 0; |
844 | siginit (EV_A); |
247 | p->w->cb (p->w, p->events); |
845 | |
|
|
846 | #ifndef WIN32 |
|
|
847 | ev_signal_init (&childev, childcb, SIGCHLD); |
|
|
848 | ev_set_priority (&childev, EV_MAXPRI); |
|
|
849 | ev_signal_start (EV_A_ &childev); |
|
|
850 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
|
|
851 | #endif |
248 | } |
852 | } |
|
|
853 | else |
|
|
854 | default_loop = 0; |
|
|
855 | } |
|
|
856 | |
|
|
857 | return default_loop; |
|
|
858 | } |
|
|
859 | |
|
|
860 | void |
|
|
861 | ev_default_destroy (void) |
|
|
862 | { |
|
|
863 | #if EV_MULTIPLICITY |
|
|
864 | struct ev_loop *loop = default_loop; |
|
|
865 | #endif |
|
|
866 | |
|
|
867 | #ifndef WIN32 |
|
|
868 | ev_ref (EV_A); /* child watcher */ |
|
|
869 | ev_signal_stop (EV_A_ &childev); |
|
|
870 | #endif |
|
|
871 | |
|
|
872 | ev_ref (EV_A); /* signal watcher */ |
|
|
873 | ev_io_stop (EV_A_ &sigev); |
|
|
874 | |
|
|
875 | close (sigpipe [0]); sigpipe [0] = 0; |
|
|
876 | close (sigpipe [1]); sigpipe [1] = 0; |
|
|
877 | |
|
|
878 | loop_destroy (EV_A); |
|
|
879 | } |
|
|
880 | |
|
|
881 | void |
|
|
882 | ev_default_fork (void) |
|
|
883 | { |
|
|
884 | #if EV_MULTIPLICITY |
|
|
885 | struct ev_loop *loop = default_loop; |
|
|
886 | #endif |
|
|
887 | |
|
|
888 | if (method) |
|
|
889 | postfork = 1; |
|
|
890 | } |
|
|
891 | |
|
|
892 | /*****************************************************************************/ |
|
|
893 | |
|
|
894 | static void |
|
|
895 | call_pending (EV_P) |
|
|
896 | { |
|
|
897 | int pri; |
|
|
898 | |
|
|
899 | for (pri = NUMPRI; pri--; ) |
|
|
900 | while (pendingcnt [pri]) |
|
|
901 | { |
|
|
902 | ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
|
|
903 | |
|
|
904 | if (p->w) |
|
|
905 | { |
|
|
906 | p->w->pending = 0; |
|
|
907 | p->w->cb (EV_A_ p->w, p->events); |
|
|
908 | } |
249 | } |
909 | } |
250 | |
|
|
251 | pendingcnt = 0; |
|
|
252 | } |
910 | } |
253 | |
911 | |
254 | static void |
912 | static void |
255 | timer_reify (void) |
913 | timers_reify (EV_P) |
256 | { |
914 | { |
257 | while (timercnt && timers [0]->at <= ev_now) |
915 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
258 | { |
916 | { |
259 | struct ev_timer *w = timers [0]; |
917 | struct ev_timer *w = timers [0]; |
260 | |
918 | |
261 | fprintf (stderr, "0 %f, %d c%d\n", w->at, w->active, timercnt);//D |
919 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
|
|
920 | |
262 | /* first reschedule timer */ |
921 | /* first reschedule or stop timer */ |
263 | if (w->repeat) |
922 | if (w->repeat) |
264 | { |
923 | { |
265 | fprintf (stderr, "a %f now %f repeat %f, %f\n", w->at, ev_now, w->repeat, w->repeat *1e30);//D |
924 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
266 | if (w->is_abs) |
|
|
267 | w->at += ceil ((ev_now - w->at) / w->repeat + 1.) * w->repeat; |
|
|
268 | else |
|
|
269 | w->at = ev_now + w->repeat; |
925 | ((WT)w)->at = mn_now + w->repeat; |
270 | |
926 | downheap ((WT *)timers, timercnt, 0); |
271 | fprintf (stderr, "b %f\n", w->at);//D |
|
|
272 | |
|
|
273 | downheap (0); |
|
|
274 | } |
927 | } |
275 | else |
928 | else |
|
|
929 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
930 | |
|
|
931 | event (EV_A_ (W)w, EV_TIMEOUT); |
|
|
932 | } |
|
|
933 | } |
|
|
934 | |
|
|
935 | static void |
|
|
936 | periodics_reify (EV_P) |
|
|
937 | { |
|
|
938 | while (periodiccnt && ((WT)periodics [0])->at <= rt_now) |
|
|
939 | { |
|
|
940 | struct ev_periodic *w = periodics [0]; |
|
|
941 | |
|
|
942 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
|
|
943 | |
|
|
944 | /* first reschedule or stop timer */ |
|
|
945 | if (w->interval) |
276 | { |
946 | { |
277 | fprintf (stderr, "c %f, %d c%d\n", w->at, w->active, timercnt);//D |
947 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
278 | evtimer_stop (w); /* nonrepeating: stop timer */ |
948 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
|
|
949 | downheap ((WT *)periodics, periodiccnt, 0); |
279 | } |
950 | } |
|
|
951 | else |
|
|
952 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
280 | |
953 | |
281 | event ((struct ev_watcher *)w, EV_TIMEOUT); |
954 | event (EV_A_ (W)w, EV_PERIODIC); |
|
|
955 | } |
|
|
956 | } |
|
|
957 | |
|
|
958 | static void |
|
|
959 | periodics_reschedule (EV_P) |
|
|
960 | { |
|
|
961 | int i; |
|
|
962 | |
|
|
963 | /* adjust periodics after time jump */ |
|
|
964 | for (i = 0; i < periodiccnt; ++i) |
282 | } |
965 | { |
283 | } |
966 | struct ev_periodic *w = periodics [i]; |
284 | |
967 | |
285 | int ev_loop_done; |
968 | if (w->interval) |
|
|
969 | { |
|
|
970 | ev_tstamp diff = ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
286 | |
971 | |
|
|
972 | if (fabs (diff) >= 1e-4) |
|
|
973 | { |
|
|
974 | ev_periodic_stop (EV_A_ w); |
|
|
975 | ev_periodic_start (EV_A_ w); |
|
|
976 | |
|
|
977 | i = 0; /* restart loop, inefficient, but time jumps should be rare */ |
|
|
978 | } |
|
|
979 | } |
|
|
980 | } |
|
|
981 | } |
|
|
982 | |
|
|
983 | inline int |
|
|
984 | time_update_monotonic (EV_P) |
|
|
985 | { |
|
|
986 | mn_now = get_clock (); |
|
|
987 | |
|
|
988 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
|
|
989 | { |
|
|
990 | rt_now = rtmn_diff + mn_now; |
|
|
991 | return 0; |
|
|
992 | } |
|
|
993 | else |
|
|
994 | { |
|
|
995 | now_floor = mn_now; |
|
|
996 | rt_now = ev_time (); |
|
|
997 | return 1; |
|
|
998 | } |
|
|
999 | } |
|
|
1000 | |
|
|
1001 | static void |
|
|
1002 | time_update (EV_P) |
|
|
1003 | { |
|
|
1004 | int i; |
|
|
1005 | |
|
|
1006 | #if EV_USE_MONOTONIC |
|
|
1007 | if (expect_true (have_monotonic)) |
|
|
1008 | { |
|
|
1009 | if (time_update_monotonic (EV_A)) |
|
|
1010 | { |
|
|
1011 | ev_tstamp odiff = rtmn_diff; |
|
|
1012 | |
|
|
1013 | for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
|
|
1014 | { |
|
|
1015 | rtmn_diff = rt_now - mn_now; |
|
|
1016 | |
|
|
1017 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
|
|
1018 | return; /* all is well */ |
|
|
1019 | |
|
|
1020 | rt_now = ev_time (); |
|
|
1021 | mn_now = get_clock (); |
|
|
1022 | now_floor = mn_now; |
|
|
1023 | } |
|
|
1024 | |
|
|
1025 | periodics_reschedule (EV_A); |
|
|
1026 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
|
|
1027 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
|
|
1028 | } |
|
|
1029 | } |
|
|
1030 | else |
|
|
1031 | #endif |
|
|
1032 | { |
|
|
1033 | rt_now = ev_time (); |
|
|
1034 | |
|
|
1035 | if (expect_false (mn_now > rt_now || mn_now < rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
|
|
1036 | { |
|
|
1037 | periodics_reschedule (EV_A); |
|
|
1038 | |
|
|
1039 | /* adjust timers. this is easy, as the offset is the same for all */ |
|
|
1040 | for (i = 0; i < timercnt; ++i) |
|
|
1041 | ((WT)timers [i])->at += rt_now - mn_now; |
|
|
1042 | } |
|
|
1043 | |
|
|
1044 | mn_now = rt_now; |
|
|
1045 | } |
|
|
1046 | } |
|
|
1047 | |
|
|
1048 | void |
|
|
1049 | ev_ref (EV_P) |
|
|
1050 | { |
|
|
1051 | ++activecnt; |
|
|
1052 | } |
|
|
1053 | |
|
|
1054 | void |
|
|
1055 | ev_unref (EV_P) |
|
|
1056 | { |
|
|
1057 | --activecnt; |
|
|
1058 | } |
|
|
1059 | |
|
|
1060 | static int loop_done; |
|
|
1061 | |
|
|
1062 | void |
287 | int ev_loop (int flags) |
1063 | ev_loop (EV_P_ int flags) |
288 | { |
1064 | { |
289 | double block; |
1065 | double block; |
290 | ev_loop_done = flags & EVLOOP_ONESHOT; |
1066 | loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
291 | |
1067 | |
292 | do |
1068 | do |
293 | { |
1069 | { |
|
|
1070 | /* queue check watchers (and execute them) */ |
|
|
1071 | if (expect_false (preparecnt)) |
|
|
1072 | { |
|
|
1073 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
|
|
1074 | call_pending (EV_A); |
|
|
1075 | } |
|
|
1076 | |
|
|
1077 | /* we might have forked, so reify kernel state if necessary */ |
|
|
1078 | if (expect_false (postfork)) |
|
|
1079 | loop_fork (EV_A); |
|
|
1080 | |
294 | /* update fd-related kernel structures */ |
1081 | /* update fd-related kernel structures */ |
295 | method_reify (); fdchangecnt = 0; |
1082 | fd_reify (EV_A); |
296 | |
1083 | |
297 | /* calculate blocking time */ |
1084 | /* calculate blocking time */ |
|
|
1085 | |
|
|
1086 | /* we only need this for !monotonic clockor timers, but as we basically |
|
|
1087 | always have timers, we just calculate it always */ |
|
|
1088 | #if EV_USE_MONOTONIC |
|
|
1089 | if (expect_true (have_monotonic)) |
|
|
1090 | time_update_monotonic (EV_A); |
|
|
1091 | else |
|
|
1092 | #endif |
|
|
1093 | { |
298 | ev_now = ev_time (); |
1094 | rt_now = ev_time (); |
|
|
1095 | mn_now = rt_now; |
|
|
1096 | } |
299 | |
1097 | |
300 | if (flags & EVLOOP_NONBLOCK) |
1098 | if (flags & EVLOOP_NONBLOCK || idlecnt) |
301 | block = 0.; |
1099 | block = 0.; |
302 | else if (!timercnt) |
|
|
303 | block = MAX_BLOCKTIME; |
|
|
304 | else |
1100 | else |
305 | { |
1101 | { |
|
|
1102 | block = MAX_BLOCKTIME; |
|
|
1103 | |
|
|
1104 | if (timercnt) |
|
|
1105 | { |
306 | block = timers [0]->at - ev_now + method_fudge; |
1106 | ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
|
|
1107 | if (block > to) block = to; |
|
|
1108 | } |
|
|
1109 | |
|
|
1110 | if (periodiccnt) |
|
|
1111 | { |
|
|
1112 | ev_tstamp to = ((WT)periodics [0])->at - rt_now + method_fudge; |
|
|
1113 | if (block > to) block = to; |
|
|
1114 | } |
|
|
1115 | |
307 | if (block < 0.) block = 0.; |
1116 | if (block < 0.) block = 0.; |
308 | else if (block > MAX_BLOCKTIME) block = MAX_BLOCKTIME; |
|
|
309 | } |
1117 | } |
310 | |
1118 | |
311 | fprintf (stderr, "block %f\n", block);//D |
|
|
312 | method_poll (block); |
1119 | method_poll (EV_A_ block); |
313 | |
1120 | |
|
|
1121 | /* update rt_now, do magic */ |
|
|
1122 | time_update (EV_A); |
|
|
1123 | |
314 | /* put pending timers into pendign queue and reschedule them */ |
1124 | /* queue pending timers and reschedule them */ |
315 | timer_reify (); |
1125 | timers_reify (EV_A); /* relative timers called last */ |
|
|
1126 | periodics_reify (EV_A); /* absolute timers called first */ |
316 | |
1127 | |
317 | ev_now = ev_time (); |
1128 | /* queue idle watchers unless io or timers are pending */ |
|
|
1129 | if (!pendingcnt) |
|
|
1130 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
|
|
1131 | |
|
|
1132 | /* queue check watchers, to be executed first */ |
|
|
1133 | if (checkcnt) |
|
|
1134 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
|
|
1135 | |
318 | call_pending (); |
1136 | call_pending (EV_A); |
319 | } |
1137 | } |
320 | while (!ev_loop_done); |
1138 | while (activecnt && !loop_done); |
321 | } |
|
|
322 | |
1139 | |
323 | static void |
1140 | if (loop_done != 2) |
324 | wlist_add (struct ev_watcher_list **head, struct ev_watcher_list *elem) |
1141 | loop_done = 0; |
|
|
1142 | } |
|
|
1143 | |
|
|
1144 | void |
|
|
1145 | ev_unloop (EV_P_ int how) |
|
|
1146 | { |
|
|
1147 | loop_done = how; |
|
|
1148 | } |
|
|
1149 | |
|
|
1150 | /*****************************************************************************/ |
|
|
1151 | |
|
|
1152 | inline void |
|
|
1153 | wlist_add (WL *head, WL elem) |
325 | { |
1154 | { |
326 | elem->next = *head; |
1155 | elem->next = *head; |
327 | *head = elem; |
1156 | *head = elem; |
328 | } |
1157 | } |
329 | |
1158 | |
330 | static void |
1159 | inline void |
331 | wlist_del (struct ev_watcher_list **head, struct ev_watcher_list *elem) |
1160 | wlist_del (WL *head, WL elem) |
332 | { |
1161 | { |
333 | while (*head) |
1162 | while (*head) |
334 | { |
1163 | { |
335 | if (*head == elem) |
1164 | if (*head == elem) |
336 | { |
1165 | { |
… | |
… | |
340 | |
1169 | |
341 | head = &(*head)->next; |
1170 | head = &(*head)->next; |
342 | } |
1171 | } |
343 | } |
1172 | } |
344 | |
1173 | |
345 | static void |
1174 | inline void |
346 | ev_start (struct ev_watcher *w, int active) |
1175 | ev_clear_pending (EV_P_ W w) |
347 | { |
1176 | { |
|
|
1177 | if (w->pending) |
|
|
1178 | { |
|
|
1179 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
348 | w->pending = 0; |
1180 | w->pending = 0; |
|
|
1181 | } |
|
|
1182 | } |
|
|
1183 | |
|
|
1184 | inline void |
|
|
1185 | ev_start (EV_P_ W w, int active) |
|
|
1186 | { |
|
|
1187 | if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
|
|
1188 | if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
|
|
1189 | |
349 | w->active = active; |
1190 | w->active = active; |
|
|
1191 | ev_ref (EV_A); |
350 | } |
1192 | } |
351 | |
1193 | |
352 | static void |
1194 | inline void |
353 | ev_stop (struct ev_watcher *w) |
1195 | ev_stop (EV_P_ W w) |
354 | { |
1196 | { |
355 | if (w->pending) |
1197 | ev_unref (EV_A); |
356 | pendings [w->pending - 1].w = 0; |
|
|
357 | |
|
|
358 | w->active = 0; |
1198 | w->active = 0; |
359 | /* nop */ |
|
|
360 | } |
1199 | } |
361 | |
1200 | |
|
|
1201 | /*****************************************************************************/ |
|
|
1202 | |
362 | void |
1203 | void |
363 | evio_start (struct ev_io *w) |
1204 | ev_io_start (EV_P_ struct ev_io *w) |
364 | { |
1205 | { |
|
|
1206 | int fd = w->fd; |
|
|
1207 | |
365 | if (ev_is_active (w)) |
1208 | if (ev_is_active (w)) |
366 | return; |
1209 | return; |
367 | |
1210 | |
368 | int fd = w->fd; |
1211 | assert (("ev_io_start called with negative fd", fd >= 0)); |
369 | |
1212 | |
370 | ev_start ((struct ev_watcher *)w, 1); |
1213 | ev_start (EV_A_ (W)w, 1); |
371 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
1214 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
372 | wlist_add ((struct ev_watcher_list **)&anfds[fd].head, (struct ev_watcher_list *)w); |
1215 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
373 | |
1216 | |
374 | ++fdchangecnt; |
1217 | fd_change (EV_A_ fd); |
375 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
|
|
376 | fdchanges [fdchangecnt - 1] = fd; |
|
|
377 | } |
1218 | } |
378 | |
1219 | |
379 | void |
1220 | void |
380 | evio_stop (struct ev_io *w) |
1221 | ev_io_stop (EV_P_ struct ev_io *w) |
381 | { |
1222 | { |
|
|
1223 | ev_clear_pending (EV_A_ (W)w); |
382 | if (!ev_is_active (w)) |
1224 | if (!ev_is_active (w)) |
383 | return; |
1225 | return; |
384 | |
1226 | |
385 | wlist_del ((struct ev_watcher_list **)&anfds[w->fd].head, (struct ev_watcher_list *)w); |
1227 | wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
386 | ev_stop ((struct ev_watcher *)w); |
1228 | ev_stop (EV_A_ (W)w); |
387 | |
1229 | |
388 | ++fdchangecnt; |
1230 | fd_change (EV_A_ w->fd); |
389 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
|
|
390 | fdchanges [fdchangecnt - 1] = w->fd; |
|
|
391 | } |
1231 | } |
392 | |
1232 | |
393 | void |
1233 | void |
394 | evtimer_start (struct ev_timer *w) |
1234 | ev_timer_start (EV_P_ struct ev_timer *w) |
395 | { |
1235 | { |
396 | if (ev_is_active (w)) |
1236 | if (ev_is_active (w)) |
397 | return; |
1237 | return; |
398 | |
1238 | |
399 | fprintf (stderr, "t1 %f a %d\n", w->at, w->is_abs);//D |
1239 | ((WT)w)->at += mn_now; |
400 | if (w->is_abs) |
1240 | |
|
|
1241 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
|
|
1242 | |
|
|
1243 | ev_start (EV_A_ (W)w, ++timercnt); |
|
|
1244 | array_needsize (timers, timermax, timercnt, (void)); |
|
|
1245 | timers [timercnt - 1] = w; |
|
|
1246 | upheap ((WT *)timers, timercnt - 1); |
|
|
1247 | |
|
|
1248 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1249 | } |
|
|
1250 | |
|
|
1251 | void |
|
|
1252 | ev_timer_stop (EV_P_ struct ev_timer *w) |
|
|
1253 | { |
|
|
1254 | ev_clear_pending (EV_A_ (W)w); |
|
|
1255 | if (!ev_is_active (w)) |
|
|
1256 | return; |
|
|
1257 | |
|
|
1258 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1259 | |
|
|
1260 | if (((W)w)->active < timercnt--) |
|
|
1261 | { |
|
|
1262 | timers [((W)w)->active - 1] = timers [timercnt]; |
|
|
1263 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
401 | { |
1264 | } |
402 | /* this formula differs from the one in timer_reify becuse we do not round up */ |
1265 | |
|
|
1266 | ((WT)w)->at = w->repeat; |
|
|
1267 | |
|
|
1268 | ev_stop (EV_A_ (W)w); |
|
|
1269 | } |
|
|
1270 | |
|
|
1271 | void |
|
|
1272 | ev_timer_again (EV_P_ struct ev_timer *w) |
|
|
1273 | { |
|
|
1274 | if (ev_is_active (w)) |
|
|
1275 | { |
403 | if (w->repeat) |
1276 | if (w->repeat) |
404 | w->at += ceil ((ev_now - w->at) / w->repeat) * w->repeat; |
1277 | { |
|
|
1278 | ((WT)w)->at = mn_now + w->repeat; |
|
|
1279 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
|
|
1280 | } |
|
|
1281 | else |
|
|
1282 | ev_timer_stop (EV_A_ w); |
|
|
1283 | } |
|
|
1284 | else if (w->repeat) |
|
|
1285 | ev_timer_start (EV_A_ w); |
|
|
1286 | } |
|
|
1287 | |
|
|
1288 | void |
|
|
1289 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
|
|
1290 | { |
|
|
1291 | if (ev_is_active (w)) |
|
|
1292 | return; |
|
|
1293 | |
|
|
1294 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
|
|
1295 | |
|
|
1296 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
|
|
1297 | if (w->interval) |
|
|
1298 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
|
|
1299 | |
|
|
1300 | ev_start (EV_A_ (W)w, ++periodiccnt); |
|
|
1301 | array_needsize (periodics, periodicmax, periodiccnt, (void)); |
|
|
1302 | periodics [periodiccnt - 1] = w; |
|
|
1303 | upheap ((WT *)periodics, periodiccnt - 1); |
|
|
1304 | |
|
|
1305 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
|
|
1306 | } |
|
|
1307 | |
|
|
1308 | void |
|
|
1309 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
|
|
1310 | { |
|
|
1311 | ev_clear_pending (EV_A_ (W)w); |
|
|
1312 | if (!ev_is_active (w)) |
|
|
1313 | return; |
|
|
1314 | |
|
|
1315 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
|
|
1316 | |
|
|
1317 | if (((W)w)->active < periodiccnt--) |
405 | } |
1318 | { |
|
|
1319 | periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
|
|
1320 | downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
|
|
1321 | } |
|
|
1322 | |
|
|
1323 | ev_stop (EV_A_ (W)w); |
|
|
1324 | } |
|
|
1325 | |
|
|
1326 | void |
|
|
1327 | ev_idle_start (EV_P_ struct ev_idle *w) |
|
|
1328 | { |
|
|
1329 | if (ev_is_active (w)) |
|
|
1330 | return; |
|
|
1331 | |
|
|
1332 | ev_start (EV_A_ (W)w, ++idlecnt); |
|
|
1333 | array_needsize (idles, idlemax, idlecnt, (void)); |
|
|
1334 | idles [idlecnt - 1] = w; |
|
|
1335 | } |
|
|
1336 | |
|
|
1337 | void |
|
|
1338 | ev_idle_stop (EV_P_ struct ev_idle *w) |
|
|
1339 | { |
|
|
1340 | ev_clear_pending (EV_A_ (W)w); |
|
|
1341 | if (ev_is_active (w)) |
|
|
1342 | return; |
|
|
1343 | |
|
|
1344 | idles [((W)w)->active - 1] = idles [--idlecnt]; |
|
|
1345 | ev_stop (EV_A_ (W)w); |
|
|
1346 | } |
|
|
1347 | |
|
|
1348 | void |
|
|
1349 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
|
|
1350 | { |
|
|
1351 | if (ev_is_active (w)) |
|
|
1352 | return; |
|
|
1353 | |
|
|
1354 | ev_start (EV_A_ (W)w, ++preparecnt); |
|
|
1355 | array_needsize (prepares, preparemax, preparecnt, (void)); |
|
|
1356 | prepares [preparecnt - 1] = w; |
|
|
1357 | } |
|
|
1358 | |
|
|
1359 | void |
|
|
1360 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
|
|
1361 | { |
|
|
1362 | ev_clear_pending (EV_A_ (W)w); |
|
|
1363 | if (ev_is_active (w)) |
|
|
1364 | return; |
|
|
1365 | |
|
|
1366 | prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
|
|
1367 | ev_stop (EV_A_ (W)w); |
|
|
1368 | } |
|
|
1369 | |
|
|
1370 | void |
|
|
1371 | ev_check_start (EV_P_ struct ev_check *w) |
|
|
1372 | { |
|
|
1373 | if (ev_is_active (w)) |
|
|
1374 | return; |
|
|
1375 | |
|
|
1376 | ev_start (EV_A_ (W)w, ++checkcnt); |
|
|
1377 | array_needsize (checks, checkmax, checkcnt, (void)); |
|
|
1378 | checks [checkcnt - 1] = w; |
|
|
1379 | } |
|
|
1380 | |
|
|
1381 | void |
|
|
1382 | ev_check_stop (EV_P_ struct ev_check *w) |
|
|
1383 | { |
|
|
1384 | ev_clear_pending (EV_A_ (W)w); |
|
|
1385 | if (ev_is_active (w)) |
|
|
1386 | return; |
|
|
1387 | |
|
|
1388 | checks [((W)w)->active - 1] = checks [--checkcnt]; |
|
|
1389 | ev_stop (EV_A_ (W)w); |
|
|
1390 | } |
|
|
1391 | |
|
|
1392 | #ifndef SA_RESTART |
|
|
1393 | # define SA_RESTART 0 |
|
|
1394 | #endif |
|
|
1395 | |
|
|
1396 | void |
|
|
1397 | ev_signal_start (EV_P_ struct ev_signal *w) |
|
|
1398 | { |
|
|
1399 | #if EV_MULTIPLICITY |
|
|
1400 | assert (("signal watchers are only supported in the default loop", loop == default_loop)); |
|
|
1401 | #endif |
|
|
1402 | if (ev_is_active (w)) |
|
|
1403 | return; |
|
|
1404 | |
|
|
1405 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
|
|
1406 | |
|
|
1407 | ev_start (EV_A_ (W)w, 1); |
|
|
1408 | array_needsize (signals, signalmax, w->signum, signals_init); |
|
|
1409 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
|
|
1410 | |
|
|
1411 | if (!((WL)w)->next) |
|
|
1412 | { |
|
|
1413 | #if WIN32 |
|
|
1414 | signal (w->signum, sighandler); |
|
|
1415 | #else |
|
|
1416 | struct sigaction sa; |
|
|
1417 | sa.sa_handler = sighandler; |
|
|
1418 | sigfillset (&sa.sa_mask); |
|
|
1419 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
|
|
1420 | sigaction (w->signum, &sa, 0); |
|
|
1421 | #endif |
|
|
1422 | } |
|
|
1423 | } |
|
|
1424 | |
|
|
1425 | void |
|
|
1426 | ev_signal_stop (EV_P_ struct ev_signal *w) |
|
|
1427 | { |
|
|
1428 | ev_clear_pending (EV_A_ (W)w); |
|
|
1429 | if (!ev_is_active (w)) |
|
|
1430 | return; |
|
|
1431 | |
|
|
1432 | wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
|
|
1433 | ev_stop (EV_A_ (W)w); |
|
|
1434 | |
|
|
1435 | if (!signals [w->signum - 1].head) |
|
|
1436 | signal (w->signum, SIG_DFL); |
|
|
1437 | } |
|
|
1438 | |
|
|
1439 | void |
|
|
1440 | ev_child_start (EV_P_ struct ev_child *w) |
|
|
1441 | { |
|
|
1442 | #if EV_MULTIPLICITY |
|
|
1443 | assert (("child watchers are only supported in the default loop", loop == default_loop)); |
|
|
1444 | #endif |
|
|
1445 | if (ev_is_active (w)) |
|
|
1446 | return; |
|
|
1447 | |
|
|
1448 | ev_start (EV_A_ (W)w, 1); |
|
|
1449 | wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
|
|
1450 | } |
|
|
1451 | |
|
|
1452 | void |
|
|
1453 | ev_child_stop (EV_P_ struct ev_child *w) |
|
|
1454 | { |
|
|
1455 | ev_clear_pending (EV_A_ (W)w); |
|
|
1456 | if (ev_is_active (w)) |
|
|
1457 | return; |
|
|
1458 | |
|
|
1459 | wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
|
|
1460 | ev_stop (EV_A_ (W)w); |
|
|
1461 | } |
|
|
1462 | |
|
|
1463 | /*****************************************************************************/ |
|
|
1464 | |
|
|
1465 | struct ev_once |
|
|
1466 | { |
|
|
1467 | struct ev_io io; |
|
|
1468 | struct ev_timer to; |
|
|
1469 | void (*cb)(int revents, void *arg); |
|
|
1470 | void *arg; |
|
|
1471 | }; |
|
|
1472 | |
|
|
1473 | static void |
|
|
1474 | once_cb (EV_P_ struct ev_once *once, int revents) |
|
|
1475 | { |
|
|
1476 | void (*cb)(int revents, void *arg) = once->cb; |
|
|
1477 | void *arg = once->arg; |
|
|
1478 | |
|
|
1479 | ev_io_stop (EV_A_ &once->io); |
|
|
1480 | ev_timer_stop (EV_A_ &once->to); |
|
|
1481 | ev_free (once); |
|
|
1482 | |
|
|
1483 | cb (revents, arg); |
|
|
1484 | } |
|
|
1485 | |
|
|
1486 | static void |
|
|
1487 | once_cb_io (EV_P_ struct ev_io *w, int revents) |
|
|
1488 | { |
|
|
1489 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
|
|
1490 | } |
|
|
1491 | |
|
|
1492 | static void |
|
|
1493 | once_cb_to (EV_P_ struct ev_timer *w, int revents) |
|
|
1494 | { |
|
|
1495 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
|
|
1496 | } |
|
|
1497 | |
|
|
1498 | void |
|
|
1499 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
|
|
1500 | { |
|
|
1501 | struct ev_once *once = ev_malloc (sizeof (struct ev_once)); |
|
|
1502 | |
|
|
1503 | if (!once) |
|
|
1504 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
406 | else |
1505 | else |
407 | w->at += ev_now; |
|
|
408 | fprintf (stderr, "t2 %f a %d\n", w->at, w->is_abs);//D |
|
|
409 | |
|
|
410 | ev_start ((struct ev_watcher *)w, ++timercnt); |
|
|
411 | array_needsize (timers, timermax, timercnt, ); |
|
|
412 | timers [timercnt - 1] = w; |
|
|
413 | upheap (timercnt - 1); |
|
|
414 | } |
|
|
415 | |
|
|
416 | void |
|
|
417 | evtimer_stop (struct ev_timer *w) |
|
|
418 | { |
|
|
419 | fprintf (stderr, "-topping %d, %d\n", w->active, timercnt);//D |
|
|
420 | if (!ev_is_active (w)) |
|
|
421 | return; |
|
|
422 | |
|
|
423 | fprintf (stderr, "stopping %d, %d\n", w->active, timercnt);//D |
|
|
424 | if (w->active < timercnt) |
|
|
425 | { |
|
|
426 | timers [w->active - 1] = timers [--timercnt]; |
|
|
427 | downheap (w->active - 1); |
|
|
428 | } |
1506 | { |
|
|
1507 | once->cb = cb; |
|
|
1508 | once->arg = arg; |
429 | |
1509 | |
430 | ev_stop ((struct ev_watcher *)w); |
1510 | ev_watcher_init (&once->io, once_cb_io); |
431 | } |
1511 | if (fd >= 0) |
|
|
1512 | { |
|
|
1513 | ev_io_set (&once->io, fd, events); |
|
|
1514 | ev_io_start (EV_A_ &once->io); |
|
|
1515 | } |
432 | |
1516 | |
433 | void |
1517 | ev_watcher_init (&once->to, once_cb_to); |
434 | evsignal_start (struct ev_signal *w) |
1518 | if (timeout >= 0.) |
435 | { |
1519 | { |
436 | if (ev_is_active (w)) |
1520 | ev_timer_set (&once->to, timeout, 0.); |
437 | return; |
1521 | ev_timer_start (EV_A_ &once->to); |
438 | |
1522 | } |
439 | ev_start ((struct ev_watcher *)w, 1); |
|
|
440 | array_needsize (signals, signalmax, w->signum, signals_init); |
|
|
441 | wlist_add ((struct ev_watcher_list **)&signals [w->signum - 1], (struct ev_watcher_list *)w); |
|
|
442 | } |
|
|
443 | |
|
|
444 | void |
|
|
445 | evsignal_stop (struct ev_signal *w) |
|
|
446 | { |
|
|
447 | if (!ev_is_active (w)) |
|
|
448 | return; |
|
|
449 | |
|
|
450 | wlist_del ((struct ev_watcher_list **)&signals [w->signum - 1], (struct ev_watcher_list *)w); |
|
|
451 | ev_stop ((struct ev_watcher *)w); |
|
|
452 | } |
|
|
453 | |
|
|
454 | /*****************************************************************************/ |
|
|
455 | #if 1 |
|
|
456 | |
|
|
457 | static void |
|
|
458 | sin_cb (struct ev_io *w, int revents) |
|
|
459 | { |
|
|
460 | fprintf (stderr, "sin %d, revents %d\n", w->fd, revents); |
|
|
461 | } |
|
|
462 | |
|
|
463 | static void |
|
|
464 | ocb (struct ev_timer *w, int revents) |
|
|
465 | { |
|
|
466 | fprintf (stderr, "timer %f,%f (%x) (%f) d%p\n", w->at, w->repeat, revents, w->at - ev_time (), w->data); |
|
|
467 | } |
|
|
468 | |
|
|
469 | int main (void) |
|
|
470 | { |
|
|
471 | struct ev_io sin; |
|
|
472 | |
|
|
473 | ev_init (0); |
|
|
474 | |
|
|
475 | evw_init (&sin, sin_cb, 55); |
|
|
476 | evio_set (&sin, 0, EV_READ); |
|
|
477 | evio_start (&sin); |
|
|
478 | |
|
|
479 | struct ev_timer t[1000]; |
|
|
480 | |
|
|
481 | int i; |
|
|
482 | for (i = 0; i < 1000; ++i) |
|
|
483 | { |
1523 | } |
484 | struct ev_timer *w = t + i; |
|
|
485 | evw_init (w, ocb, i); |
|
|
486 | evtimer_set_rel (w, drand48 (), 0); |
|
|
487 | evtimer_start (w); |
|
|
488 | if (drand48 () < 0.5) |
|
|
489 | evtimer_stop (w); |
|
|
490 | } |
|
|
491 | |
|
|
492 | ev_loop (0); |
|
|
493 | |
|
|
494 | return 0; |
|
|
495 | } |
1524 | } |
496 | |
1525 | |
497 | #endif |
|
|
498 | |
|
|
499 | |
|
|
500 | |
|
|
501 | |
|
|