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