ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
Revision: 1.91
Committed: Sun Nov 11 00:06:48 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.90: +1 -1 lines
Log Message:
make timers best-effort non-drifting

File Contents

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