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