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