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