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