ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
(Generate patch)

Comparing libev/ev.c (file contents):
Revision 1.3 by root, Tue Oct 30 21:45:00 2007 UTC vs.
Revision 1.68 by root, Mon Nov 5 20:19:00 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines