ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
Revision: 1.80
Committed: Fri Nov 9 15:30:59 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.79: +18 -17 lines
Log Message:
*** empty log message ***

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