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