ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
Revision: 1.71
Committed: Tue Nov 6 13:17:55 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.70: +45 -21 lines
Log Message:
now port to microsofts goddamn broken pseudo-c-we-do-it-different-to-spite-you so-called c compiler

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