ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
Revision: 1.97
Committed: Sun Nov 11 01:53:07 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.96: +6 -2 lines
Log Message:
fix stop function of idle/check/prepare/child

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