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