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 |
|
35 |
#include <math.h> |
36 |
#include <stdlib.h> |
37 |
#include <unistd.h> |
38 |
#include <fcntl.h> |
39 |
#include <signal.h> |
40 |
#include <stddef.h> |
41 |
|
42 |
#include <stdio.h> |
43 |
|
44 |
#include <assert.h> |
45 |
#include <errno.h> |
46 |
#include <sys/types.h> |
47 |
#ifndef WIN32 |
48 |
# include <sys/wait.h> |
49 |
#endif |
50 |
#include <sys/time.h> |
51 |
#include <time.h> |
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 |
|
81 |
#ifndef CLOCK_MONOTONIC |
82 |
# undef EV_USE_MONOTONIC |
83 |
# define EV_USE_MONOTONIC 0 |
84 |
#endif |
85 |
|
86 |
#ifndef CLOCK_REALTIME |
87 |
# undef EV_USE_REALTIME |
88 |
# define EV_USE_REALTIME 0 |
89 |
#endif |
90 |
|
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 */ |
97 |
|
98 |
#include "ev.h" |
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 |
|
114 |
typedef struct ev_watcher *W; |
115 |
typedef struct ev_watcher_list *WL; |
116 |
typedef struct ev_watcher_time *WT; |
117 |
|
118 |
static ev_tstamp now_floor, now, diff; /* monotonic clock */ |
119 |
ev_tstamp ev_now; |
120 |
int ev_method; |
121 |
|
122 |
static int have_monotonic; /* runtime */ |
123 |
|
124 |
static ev_tstamp method_fudge; /* stupid epoll-returns-early bug */ |
125 |
static void (*method_modify)(int fd, int oev, int nev); |
126 |
static void (*method_poll)(ev_tstamp timeout); |
127 |
|
128 |
/*****************************************************************************/ |
129 |
|
130 |
ev_tstamp |
131 |
ev_time (void) |
132 |
{ |
133 |
#if EV_USE_REALTIME |
134 |
struct timespec ts; |
135 |
clock_gettime (CLOCK_REALTIME, &ts); |
136 |
return ts.tv_sec + ts.tv_nsec * 1e-9; |
137 |
#else |
138 |
struct timeval tv; |
139 |
gettimeofday (&tv, 0); |
140 |
return tv.tv_sec + tv.tv_usec * 1e-6; |
141 |
#endif |
142 |
} |
143 |
|
144 |
static ev_tstamp |
145 |
get_clock (void) |
146 |
{ |
147 |
#if EV_USE_MONOTONIC |
148 |
if (expect_true (have_monotonic)) |
149 |
{ |
150 |
struct timespec ts; |
151 |
clock_gettime (CLOCK_MONOTONIC, &ts); |
152 |
return ts.tv_sec + ts.tv_nsec * 1e-9; |
153 |
} |
154 |
#endif |
155 |
|
156 |
return ev_time (); |
157 |
} |
158 |
|
159 |
#define array_roundsize(base,n) ((n) | 4 & ~3) |
160 |
|
161 |
#define array_needsize(base,cur,cnt,init) \ |
162 |
if (expect_false ((cnt) > cur)) \ |
163 |
{ \ |
164 |
int newcnt = cur; \ |
165 |
do \ |
166 |
{ \ |
167 |
newcnt = array_roundsize (base, newcnt << 1); \ |
168 |
} \ |
169 |
while ((cnt) > newcnt); \ |
170 |
\ |
171 |
base = realloc (base, sizeof (*base) * (newcnt)); \ |
172 |
init (base + cur, newcnt - cur); \ |
173 |
cur = newcnt; \ |
174 |
} |
175 |
|
176 |
/*****************************************************************************/ |
177 |
|
178 |
typedef struct |
179 |
{ |
180 |
struct ev_io *head; |
181 |
unsigned char events; |
182 |
unsigned char reify; |
183 |
} ANFD; |
184 |
|
185 |
static ANFD *anfds; |
186 |
static int anfdmax; |
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 |
|
251 |
static int *fdchanges; |
252 |
static int fdchangemax, fdchangecnt; |
253 |
|
254 |
static void |
255 |
fd_reify (void) |
256 |
{ |
257 |
int i; |
258 |
|
259 |
for (i = 0; i < fdchangecnt; ++i) |
260 |
{ |
261 |
int fd = fdchanges [i]; |
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 |
{ |
298 |
struct ev_io *w; |
299 |
|
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) |
328 |
{ |
329 |
close (fd); |
330 |
fd_kill (fd); |
331 |
return; |
332 |
} |
333 |
} |
334 |
|
335 |
/*****************************************************************************/ |
336 |
|
337 |
static struct ev_timer **timers; |
338 |
static int timermax, timercnt; |
339 |
|
340 |
static struct ev_periodic **periodics; |
341 |
static int periodicmax, periodiccnt; |
342 |
|
343 |
static void |
344 |
upheap (WT *timers, int k) |
345 |
{ |
346 |
WT w = timers [k]; |
347 |
|
348 |
while (k && timers [k >> 1]->at > w->at) |
349 |
{ |
350 |
timers [k] = timers [k >> 1]; |
351 |
timers [k]->active = k + 1; |
352 |
k >>= 1; |
353 |
} |
354 |
|
355 |
timers [k] = w; |
356 |
timers [k]->active = k + 1; |
357 |
|
358 |
} |
359 |
|
360 |
static void |
361 |
downheap (WT *timers, int N, int k) |
362 |
{ |
363 |
WT w = timers [k]; |
364 |
|
365 |
while (k < (N >> 1)) |
366 |
{ |
367 |
int j = k << 1; |
368 |
|
369 |
if (j + 1 < N && timers [j]->at > timers [j + 1]->at) |
370 |
++j; |
371 |
|
372 |
if (w->at <= timers [j]->at) |
373 |
break; |
374 |
|
375 |
timers [k] = timers [j]; |
376 |
timers [k]->active = k + 1; |
377 |
k = j; |
378 |
} |
379 |
|
380 |
timers [k] = w; |
381 |
timers [k]->active = k + 1; |
382 |
} |
383 |
|
384 |
/*****************************************************************************/ |
385 |
|
386 |
typedef struct |
387 |
{ |
388 |
struct ev_signal *head; |
389 |
sig_atomic_t volatile gotsig; |
390 |
} ANSIG; |
391 |
|
392 |
static ANSIG *signals; |
393 |
static int signalmax; |
394 |
|
395 |
static int sigpipe [2]; |
396 |
static sig_atomic_t volatile gotsig; |
397 |
static struct ev_io sigev; |
398 |
|
399 |
static void |
400 |
signals_init (ANSIG *base, int count) |
401 |
{ |
402 |
while (count--) |
403 |
{ |
404 |
base->head = 0; |
405 |
base->gotsig = 0; |
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 |
childcb (struct ev_signal *sw, int revents) |
482 |
{ |
483 |
struct ev_child *w; |
484 |
int pid, status; |
485 |
|
486 |
while ((pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED)) != -1) |
487 |
for (w = childs [pid & (PID_HASHSIZE - 1)]; w; w = w->next) |
488 |
if (w->pid == pid || !w->pid) |
489 |
{ |
490 |
w->status = status; |
491 |
event ((W)w, EV_CHILD); |
492 |
} |
493 |
} |
494 |
|
495 |
#endif |
496 |
|
497 |
/*****************************************************************************/ |
498 |
|
499 |
#if EV_USE_KQUEUE |
500 |
# include "ev_kqueue.c" |
501 |
#endif |
502 |
#if EV_USE_EPOLL |
503 |
# include "ev_epoll.c" |
504 |
#endif |
505 |
#if EV_USE_POLL |
506 |
# include "ev_poll.c" |
507 |
#endif |
508 |
#if EV_USE_SELECT |
509 |
# include "ev_select.c" |
510 |
#endif |
511 |
|
512 |
int |
513 |
ev_version_major (void) |
514 |
{ |
515 |
return EV_VERSION_MAJOR; |
516 |
} |
517 |
|
518 |
int |
519 |
ev_version_minor (void) |
520 |
{ |
521 |
return EV_VERSION_MINOR; |
522 |
} |
523 |
|
524 |
/* return true if we are running with elevated privileges and ignore env variables */ |
525 |
static int |
526 |
enable_secure () |
527 |
{ |
528 |
return getuid () != geteuid () |
529 |
|| getgid () != getegid (); |
530 |
} |
531 |
|
532 |
int ev_init (int methods) |
533 |
{ |
534 |
if (!ev_method) |
535 |
{ |
536 |
#if EV_USE_MONOTONIC |
537 |
{ |
538 |
struct timespec ts; |
539 |
if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
540 |
have_monotonic = 1; |
541 |
} |
542 |
#endif |
543 |
|
544 |
ev_now = ev_time (); |
545 |
now = get_clock (); |
546 |
now_floor = now; |
547 |
diff = ev_now - now; |
548 |
|
549 |
if (pipe (sigpipe)) |
550 |
return 0; |
551 |
|
552 |
if (methods == EVMETHOD_AUTO) |
553 |
if (!enable_secure () && getenv ("LIBEV_METHODS")) |
554 |
methods = atoi (getenv ("LIBEV_METHODS")); |
555 |
else |
556 |
methods = EVMETHOD_ANY; |
557 |
|
558 |
ev_method = 0; |
559 |
#if EV_USE_KQUEUE |
560 |
if (!ev_method && (methods & EVMETHOD_KQUEUE)) kqueue_init (methods); |
561 |
#endif |
562 |
#if EV_USE_EPOLL |
563 |
if (!ev_method && (methods & EVMETHOD_EPOLL )) epoll_init (methods); |
564 |
#endif |
565 |
#if EV_USE_POLL |
566 |
if (!ev_method && (methods & EVMETHOD_POLL )) poll_init (methods); |
567 |
#endif |
568 |
#if EV_USE_SELECT |
569 |
if (!ev_method && (methods & EVMETHOD_SELECT)) select_init (methods); |
570 |
#endif |
571 |
|
572 |
if (ev_method) |
573 |
{ |
574 |
ev_watcher_init (&sigev, sigcb); |
575 |
siginit (); |
576 |
|
577 |
#ifndef WIN32 |
578 |
ev_signal_init (&childev, childcb, SIGCHLD); |
579 |
ev_signal_start (&childev); |
580 |
#endif |
581 |
} |
582 |
} |
583 |
|
584 |
return ev_method; |
585 |
} |
586 |
|
587 |
/*****************************************************************************/ |
588 |
|
589 |
void |
590 |
ev_fork_prepare (void) |
591 |
{ |
592 |
/* nop */ |
593 |
} |
594 |
|
595 |
void |
596 |
ev_fork_parent (void) |
597 |
{ |
598 |
/* nop */ |
599 |
} |
600 |
|
601 |
void |
602 |
ev_fork_child (void) |
603 |
{ |
604 |
#if EV_USE_EPOLL |
605 |
if (ev_method == EVMETHOD_EPOLL) |
606 |
epoll_postfork_child (); |
607 |
#endif |
608 |
|
609 |
ev_io_stop (&sigev); |
610 |
close (sigpipe [0]); |
611 |
close (sigpipe [1]); |
612 |
pipe (sigpipe); |
613 |
siginit (); |
614 |
} |
615 |
|
616 |
/*****************************************************************************/ |
617 |
|
618 |
static void |
619 |
call_pending (void) |
620 |
{ |
621 |
int pri; |
622 |
|
623 |
for (pri = NUMPRI; pri--; ) |
624 |
while (pendingcnt [pri]) |
625 |
{ |
626 |
ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
627 |
|
628 |
if (p->w) |
629 |
{ |
630 |
p->w->pending = 0; |
631 |
p->w->cb (p->w, p->events); |
632 |
} |
633 |
} |
634 |
} |
635 |
|
636 |
static void |
637 |
timers_reify (void) |
638 |
{ |
639 |
while (timercnt && timers [0]->at <= now) |
640 |
{ |
641 |
struct ev_timer *w = timers [0]; |
642 |
|
643 |
/* first reschedule or stop timer */ |
644 |
if (w->repeat) |
645 |
{ |
646 |
assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
647 |
w->at = now + w->repeat; |
648 |
downheap ((WT *)timers, timercnt, 0); |
649 |
} |
650 |
else |
651 |
ev_timer_stop (w); /* nonrepeating: stop timer */ |
652 |
|
653 |
event ((W)w, EV_TIMEOUT); |
654 |
} |
655 |
} |
656 |
|
657 |
static void |
658 |
periodics_reify (void) |
659 |
{ |
660 |
while (periodiccnt && periodics [0]->at <= ev_now) |
661 |
{ |
662 |
struct ev_periodic *w = periodics [0]; |
663 |
|
664 |
/* first reschedule or stop timer */ |
665 |
if (w->interval) |
666 |
{ |
667 |
w->at += floor ((ev_now - w->at) / w->interval + 1.) * w->interval; |
668 |
assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", w->at > ev_now)); |
669 |
downheap ((WT *)periodics, periodiccnt, 0); |
670 |
} |
671 |
else |
672 |
ev_periodic_stop (w); /* nonrepeating: stop timer */ |
673 |
|
674 |
event ((W)w, EV_PERIODIC); |
675 |
} |
676 |
} |
677 |
|
678 |
static void |
679 |
periodics_reschedule (ev_tstamp diff) |
680 |
{ |
681 |
int i; |
682 |
|
683 |
/* adjust periodics after time jump */ |
684 |
for (i = 0; i < periodiccnt; ++i) |
685 |
{ |
686 |
struct ev_periodic *w = periodics [i]; |
687 |
|
688 |
if (w->interval) |
689 |
{ |
690 |
ev_tstamp diff = ceil ((ev_now - w->at) / w->interval) * w->interval; |
691 |
|
692 |
if (fabs (diff) >= 1e-4) |
693 |
{ |
694 |
ev_periodic_stop (w); |
695 |
ev_periodic_start (w); |
696 |
|
697 |
i = 0; /* restart loop, inefficient, but time jumps should be rare */ |
698 |
} |
699 |
} |
700 |
} |
701 |
} |
702 |
|
703 |
static int |
704 |
time_update_monotonic (void) |
705 |
{ |
706 |
now = get_clock (); |
707 |
|
708 |
if (expect_true (now - now_floor < MIN_TIMEJUMP * .5)) |
709 |
{ |
710 |
ev_now = now + diff; |
711 |
return 0; |
712 |
} |
713 |
else |
714 |
{ |
715 |
now_floor = now; |
716 |
ev_now = ev_time (); |
717 |
return 1; |
718 |
} |
719 |
} |
720 |
|
721 |
static void |
722 |
time_update (void) |
723 |
{ |
724 |
int i; |
725 |
|
726 |
#if EV_USE_MONOTONIC |
727 |
if (expect_true (have_monotonic)) |
728 |
{ |
729 |
if (time_update_monotonic ()) |
730 |
{ |
731 |
ev_tstamp odiff = diff; |
732 |
|
733 |
for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
734 |
{ |
735 |
diff = ev_now - now; |
736 |
|
737 |
if (fabs (odiff - diff) < MIN_TIMEJUMP) |
738 |
return; /* all is well */ |
739 |
|
740 |
ev_now = ev_time (); |
741 |
now = get_clock (); |
742 |
now_floor = now; |
743 |
} |
744 |
|
745 |
periodics_reschedule (diff - odiff); |
746 |
/* no timer adjustment, as the monotonic clock doesn't jump */ |
747 |
} |
748 |
} |
749 |
else |
750 |
#endif |
751 |
{ |
752 |
ev_now = ev_time (); |
753 |
|
754 |
if (expect_false (now > ev_now || now < ev_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
755 |
{ |
756 |
periodics_reschedule (ev_now - now); |
757 |
|
758 |
/* adjust timers. this is easy, as the offset is the same for all */ |
759 |
for (i = 0; i < timercnt; ++i) |
760 |
timers [i]->at += diff; |
761 |
} |
762 |
|
763 |
now = ev_now; |
764 |
} |
765 |
} |
766 |
|
767 |
int ev_loop_done; |
768 |
|
769 |
void ev_loop (int flags) |
770 |
{ |
771 |
double block; |
772 |
ev_loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
773 |
|
774 |
do |
775 |
{ |
776 |
/* queue check watchers (and execute them) */ |
777 |
if (expect_false (preparecnt)) |
778 |
{ |
779 |
queue_events ((W *)prepares, preparecnt, EV_PREPARE); |
780 |
call_pending (); |
781 |
} |
782 |
|
783 |
/* update fd-related kernel structures */ |
784 |
fd_reify (); |
785 |
|
786 |
/* calculate blocking time */ |
787 |
|
788 |
/* we only need this for !monotonic clockor timers, but as we basically |
789 |
always have timers, we just calculate it always */ |
790 |
#if EV_USE_MONOTONIC |
791 |
if (expect_true (have_monotonic)) |
792 |
time_update_monotonic (); |
793 |
else |
794 |
#endif |
795 |
{ |
796 |
ev_now = ev_time (); |
797 |
now = ev_now; |
798 |
} |
799 |
|
800 |
if (flags & EVLOOP_NONBLOCK || idlecnt) |
801 |
block = 0.; |
802 |
else |
803 |
{ |
804 |
block = MAX_BLOCKTIME; |
805 |
|
806 |
if (timercnt) |
807 |
{ |
808 |
ev_tstamp to = timers [0]->at - now + method_fudge; |
809 |
if (block > to) block = to; |
810 |
} |
811 |
|
812 |
if (periodiccnt) |
813 |
{ |
814 |
ev_tstamp to = periodics [0]->at - ev_now + method_fudge; |
815 |
if (block > to) block = to; |
816 |
} |
817 |
|
818 |
if (block < 0.) block = 0.; |
819 |
} |
820 |
|
821 |
method_poll (block); |
822 |
|
823 |
/* update ev_now, do magic */ |
824 |
time_update (); |
825 |
|
826 |
/* queue pending timers and reschedule them */ |
827 |
timers_reify (); /* relative timers called last */ |
828 |
periodics_reify (); /* absolute timers called first */ |
829 |
|
830 |
/* queue idle watchers unless io or timers are pending */ |
831 |
if (!pendingcnt) |
832 |
queue_events ((W *)idles, idlecnt, EV_IDLE); |
833 |
|
834 |
/* queue check watchers, to be executed first */ |
835 |
if (checkcnt) |
836 |
queue_events ((W *)checks, checkcnt, EV_CHECK); |
837 |
|
838 |
call_pending (); |
839 |
} |
840 |
while (!ev_loop_done); |
841 |
|
842 |
if (ev_loop_done != 2) |
843 |
ev_loop_done = 0; |
844 |
} |
845 |
|
846 |
/*****************************************************************************/ |
847 |
|
848 |
static void |
849 |
wlist_add (WL *head, WL elem) |
850 |
{ |
851 |
elem->next = *head; |
852 |
*head = elem; |
853 |
} |
854 |
|
855 |
static void |
856 |
wlist_del (WL *head, WL elem) |
857 |
{ |
858 |
while (*head) |
859 |
{ |
860 |
if (*head == elem) |
861 |
{ |
862 |
*head = elem->next; |
863 |
return; |
864 |
} |
865 |
|
866 |
head = &(*head)->next; |
867 |
} |
868 |
} |
869 |
|
870 |
static void |
871 |
ev_clear_pending (W w) |
872 |
{ |
873 |
if (w->pending) |
874 |
{ |
875 |
pendings [ABSPRI (w)][w->pending - 1].w = 0; |
876 |
w->pending = 0; |
877 |
} |
878 |
} |
879 |
|
880 |
static void |
881 |
ev_start (W w, int active) |
882 |
{ |
883 |
if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
884 |
if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
885 |
|
886 |
w->active = active; |
887 |
} |
888 |
|
889 |
static void |
890 |
ev_stop (W w) |
891 |
{ |
892 |
w->active = 0; |
893 |
} |
894 |
|
895 |
/*****************************************************************************/ |
896 |
|
897 |
void |
898 |
ev_io_start (struct ev_io *w) |
899 |
{ |
900 |
int fd = w->fd; |
901 |
|
902 |
if (ev_is_active (w)) |
903 |
return; |
904 |
|
905 |
assert (("ev_io_start called with negative fd", fd >= 0)); |
906 |
|
907 |
ev_start ((W)w, 1); |
908 |
array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
909 |
wlist_add ((WL *)&anfds[fd].head, (WL)w); |
910 |
|
911 |
fd_change (fd); |
912 |
} |
913 |
|
914 |
void |
915 |
ev_io_stop (struct ev_io *w) |
916 |
{ |
917 |
ev_clear_pending ((W)w); |
918 |
if (!ev_is_active (w)) |
919 |
return; |
920 |
|
921 |
wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
922 |
ev_stop ((W)w); |
923 |
|
924 |
fd_change (w->fd); |
925 |
} |
926 |
|
927 |
void |
928 |
ev_timer_start (struct ev_timer *w) |
929 |
{ |
930 |
if (ev_is_active (w)) |
931 |
return; |
932 |
|
933 |
w->at += now; |
934 |
|
935 |
assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
936 |
|
937 |
ev_start ((W)w, ++timercnt); |
938 |
array_needsize (timers, timermax, timercnt, ); |
939 |
timers [timercnt - 1] = w; |
940 |
upheap ((WT *)timers, timercnt - 1); |
941 |
} |
942 |
|
943 |
void |
944 |
ev_timer_stop (struct ev_timer *w) |
945 |
{ |
946 |
ev_clear_pending ((W)w); |
947 |
if (!ev_is_active (w)) |
948 |
return; |
949 |
|
950 |
if (w->active < timercnt--) |
951 |
{ |
952 |
timers [w->active - 1] = timers [timercnt]; |
953 |
downheap ((WT *)timers, timercnt, w->active - 1); |
954 |
} |
955 |
|
956 |
w->at = w->repeat; |
957 |
|
958 |
ev_stop ((W)w); |
959 |
} |
960 |
|
961 |
void |
962 |
ev_timer_again (struct ev_timer *w) |
963 |
{ |
964 |
if (ev_is_active (w)) |
965 |
{ |
966 |
if (w->repeat) |
967 |
{ |
968 |
w->at = now + w->repeat; |
969 |
downheap ((WT *)timers, timercnt, w->active - 1); |
970 |
} |
971 |
else |
972 |
ev_timer_stop (w); |
973 |
} |
974 |
else if (w->repeat) |
975 |
ev_timer_start (w); |
976 |
} |
977 |
|
978 |
void |
979 |
ev_periodic_start (struct ev_periodic *w) |
980 |
{ |
981 |
if (ev_is_active (w)) |
982 |
return; |
983 |
|
984 |
assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
985 |
|
986 |
/* this formula differs from the one in periodic_reify because we do not always round up */ |
987 |
if (w->interval) |
988 |
w->at += ceil ((ev_now - w->at) / w->interval) * w->interval; |
989 |
|
990 |
ev_start ((W)w, ++periodiccnt); |
991 |
array_needsize (periodics, periodicmax, periodiccnt, ); |
992 |
periodics [periodiccnt - 1] = w; |
993 |
upheap ((WT *)periodics, periodiccnt - 1); |
994 |
} |
995 |
|
996 |
void |
997 |
ev_periodic_stop (struct ev_periodic *w) |
998 |
{ |
999 |
ev_clear_pending ((W)w); |
1000 |
if (!ev_is_active (w)) |
1001 |
return; |
1002 |
|
1003 |
if (w->active < periodiccnt--) |
1004 |
{ |
1005 |
periodics [w->active - 1] = periodics [periodiccnt]; |
1006 |
downheap ((WT *)periodics, periodiccnt, w->active - 1); |
1007 |
} |
1008 |
|
1009 |
ev_stop ((W)w); |
1010 |
} |
1011 |
|
1012 |
void |
1013 |
ev_signal_start (struct ev_signal *w) |
1014 |
{ |
1015 |
if (ev_is_active (w)) |
1016 |
return; |
1017 |
|
1018 |
assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1019 |
|
1020 |
ev_start ((W)w, 1); |
1021 |
array_needsize (signals, signalmax, w->signum, signals_init); |
1022 |
wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1023 |
|
1024 |
if (!w->next) |
1025 |
{ |
1026 |
struct sigaction sa; |
1027 |
sa.sa_handler = sighandler; |
1028 |
sigfillset (&sa.sa_mask); |
1029 |
sa.sa_flags = 0; |
1030 |
sigaction (w->signum, &sa, 0); |
1031 |
} |
1032 |
} |
1033 |
|
1034 |
void |
1035 |
ev_signal_stop (struct ev_signal *w) |
1036 |
{ |
1037 |
ev_clear_pending ((W)w); |
1038 |
if (!ev_is_active (w)) |
1039 |
return; |
1040 |
|
1041 |
wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
1042 |
ev_stop ((W)w); |
1043 |
|
1044 |
if (!signals [w->signum - 1].head) |
1045 |
signal (w->signum, SIG_DFL); |
1046 |
} |
1047 |
|
1048 |
void |
1049 |
ev_idle_start (struct ev_idle *w) |
1050 |
{ |
1051 |
if (ev_is_active (w)) |
1052 |
return; |
1053 |
|
1054 |
ev_start ((W)w, ++idlecnt); |
1055 |
array_needsize (idles, idlemax, idlecnt, ); |
1056 |
idles [idlecnt - 1] = w; |
1057 |
} |
1058 |
|
1059 |
void |
1060 |
ev_idle_stop (struct ev_idle *w) |
1061 |
{ |
1062 |
ev_clear_pending ((W)w); |
1063 |
if (ev_is_active (w)) |
1064 |
return; |
1065 |
|
1066 |
idles [w->active - 1] = idles [--idlecnt]; |
1067 |
ev_stop ((W)w); |
1068 |
} |
1069 |
|
1070 |
void |
1071 |
ev_prepare_start (struct ev_prepare *w) |
1072 |
{ |
1073 |
if (ev_is_active (w)) |
1074 |
return; |
1075 |
|
1076 |
ev_start ((W)w, ++preparecnt); |
1077 |
array_needsize (prepares, preparemax, preparecnt, ); |
1078 |
prepares [preparecnt - 1] = w; |
1079 |
} |
1080 |
|
1081 |
void |
1082 |
ev_prepare_stop (struct ev_prepare *w) |
1083 |
{ |
1084 |
ev_clear_pending ((W)w); |
1085 |
if (ev_is_active (w)) |
1086 |
return; |
1087 |
|
1088 |
prepares [w->active - 1] = prepares [--preparecnt]; |
1089 |
ev_stop ((W)w); |
1090 |
} |
1091 |
|
1092 |
void |
1093 |
ev_check_start (struct ev_check *w) |
1094 |
{ |
1095 |
if (ev_is_active (w)) |
1096 |
return; |
1097 |
|
1098 |
ev_start ((W)w, ++checkcnt); |
1099 |
array_needsize (checks, checkmax, checkcnt, ); |
1100 |
checks [checkcnt - 1] = w; |
1101 |
} |
1102 |
|
1103 |
void |
1104 |
ev_check_stop (struct ev_check *w) |
1105 |
{ |
1106 |
ev_clear_pending ((W)w); |
1107 |
if (ev_is_active (w)) |
1108 |
return; |
1109 |
|
1110 |
checks [w->active - 1] = checks [--checkcnt]; |
1111 |
ev_stop ((W)w); |
1112 |
} |
1113 |
|
1114 |
void |
1115 |
ev_child_start (struct ev_child *w) |
1116 |
{ |
1117 |
if (ev_is_active (w)) |
1118 |
return; |
1119 |
|
1120 |
ev_start ((W)w, 1); |
1121 |
wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1122 |
} |
1123 |
|
1124 |
void |
1125 |
ev_child_stop (struct ev_child *w) |
1126 |
{ |
1127 |
ev_clear_pending ((W)w); |
1128 |
if (ev_is_active (w)) |
1129 |
return; |
1130 |
|
1131 |
wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1132 |
ev_stop ((W)w); |
1133 |
} |
1134 |
|
1135 |
/*****************************************************************************/ |
1136 |
|
1137 |
struct ev_once |
1138 |
{ |
1139 |
struct ev_io io; |
1140 |
struct ev_timer to; |
1141 |
void (*cb)(int revents, void *arg); |
1142 |
void *arg; |
1143 |
}; |
1144 |
|
1145 |
static void |
1146 |
once_cb (struct ev_once *once, int revents) |
1147 |
{ |
1148 |
void (*cb)(int revents, void *arg) = once->cb; |
1149 |
void *arg = once->arg; |
1150 |
|
1151 |
ev_io_stop (&once->io); |
1152 |
ev_timer_stop (&once->to); |
1153 |
free (once); |
1154 |
|
1155 |
cb (revents, arg); |
1156 |
} |
1157 |
|
1158 |
static void |
1159 |
once_cb_io (struct ev_io *w, int revents) |
1160 |
{ |
1161 |
once_cb ((struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
1162 |
} |
1163 |
|
1164 |
static void |
1165 |
once_cb_to (struct ev_timer *w, int revents) |
1166 |
{ |
1167 |
once_cb ((struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
1168 |
} |
1169 |
|
1170 |
void |
1171 |
ev_once (int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1172 |
{ |
1173 |
struct ev_once *once = malloc (sizeof (struct ev_once)); |
1174 |
|
1175 |
if (!once) |
1176 |
cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1177 |
else |
1178 |
{ |
1179 |
once->cb = cb; |
1180 |
once->arg = arg; |
1181 |
|
1182 |
ev_watcher_init (&once->io, once_cb_io); |
1183 |
if (fd >= 0) |
1184 |
{ |
1185 |
ev_io_set (&once->io, fd, events); |
1186 |
ev_io_start (&once->io); |
1187 |
} |
1188 |
|
1189 |
ev_watcher_init (&once->to, once_cb_to); |
1190 |
if (timeout >= 0.) |
1191 |
{ |
1192 |
ev_timer_set (&once->to, timeout, 0.); |
1193 |
ev_timer_start (&once->to); |
1194 |
} |
1195 |
} |
1196 |
} |
1197 |
|
1198 |
/*****************************************************************************/ |
1199 |
|
1200 |
#if 0 |
1201 |
|
1202 |
struct ev_io wio; |
1203 |
|
1204 |
static void |
1205 |
sin_cb (struct ev_io *w, int revents) |
1206 |
{ |
1207 |
fprintf (stderr, "sin %d, revents %d\n", w->fd, revents); |
1208 |
} |
1209 |
|
1210 |
static void |
1211 |
ocb (struct ev_timer *w, int revents) |
1212 |
{ |
1213 |
//fprintf (stderr, "timer %f,%f (%x) (%f) d%p\n", w->at, w->repeat, revents, w->at - ev_time (), w->data); |
1214 |
ev_timer_stop (w); |
1215 |
ev_timer_start (w); |
1216 |
} |
1217 |
|
1218 |
static void |
1219 |
scb (struct ev_signal *w, int revents) |
1220 |
{ |
1221 |
fprintf (stderr, "signal %x,%d\n", revents, w->signum); |
1222 |
ev_io_stop (&wio); |
1223 |
ev_io_start (&wio); |
1224 |
} |
1225 |
|
1226 |
static void |
1227 |
gcb (struct ev_signal *w, int revents) |
1228 |
{ |
1229 |
fprintf (stderr, "generic %x\n", revents); |
1230 |
|
1231 |
} |
1232 |
|
1233 |
int main (void) |
1234 |
{ |
1235 |
ev_init (0); |
1236 |
|
1237 |
ev_io_init (&wio, sin_cb, 0, EV_READ); |
1238 |
ev_io_start (&wio); |
1239 |
|
1240 |
struct ev_timer t[10000]; |
1241 |
|
1242 |
#if 0 |
1243 |
int i; |
1244 |
for (i = 0; i < 10000; ++i) |
1245 |
{ |
1246 |
struct ev_timer *w = t + i; |
1247 |
ev_watcher_init (w, ocb, i); |
1248 |
ev_timer_init_abs (w, ocb, drand48 (), 0.99775533); |
1249 |
ev_timer_start (w); |
1250 |
if (drand48 () < 0.5) |
1251 |
ev_timer_stop (w); |
1252 |
} |
1253 |
#endif |
1254 |
|
1255 |
struct ev_timer t1; |
1256 |
ev_timer_init (&t1, ocb, 5, 10); |
1257 |
ev_timer_start (&t1); |
1258 |
|
1259 |
struct ev_signal sig; |
1260 |
ev_signal_init (&sig, scb, SIGQUIT); |
1261 |
ev_signal_start (&sig); |
1262 |
|
1263 |
struct ev_check cw; |
1264 |
ev_check_init (&cw, gcb); |
1265 |
ev_check_start (&cw); |
1266 |
|
1267 |
struct ev_idle iw; |
1268 |
ev_idle_init (&iw, gcb); |
1269 |
ev_idle_start (&iw); |
1270 |
|
1271 |
ev_loop (0); |
1272 |
|
1273 |
return 0; |
1274 |
} |
1275 |
|
1276 |
#endif |
1277 |
|
1278 |
|
1279 |
|
1280 |
|