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

Comparing libev/ev.c (file contents):
Revision 1.6 by root, Tue Oct 30 23:55:29 2007 UTC vs.
Revision 1.254 by root, Wed Jun 4 20:26:55 2008 UTC

1/*
2 * libev event processing core, watcher management
3 *
4 * Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL.
38 */
39
40#ifdef __cplusplus
41extern "C" {
42#endif
43
44/* this big block deduces configuration from config.h */
45#ifndef EV_STANDALONE
46# ifdef EV_CONFIG_H
47# include EV_CONFIG_H
48# else
49# include "config.h"
50# endif
51
52# if HAVE_CLOCK_GETTIME
53# ifndef EV_USE_MONOTONIC
54# define EV_USE_MONOTONIC 1
55# endif
56# ifndef EV_USE_REALTIME
57# define EV_USE_REALTIME 1
58# endif
59# else
60# ifndef EV_USE_MONOTONIC
61# define EV_USE_MONOTONIC 0
62# endif
63# ifndef EV_USE_REALTIME
64# define EV_USE_REALTIME 0
65# endif
66# endif
67
68# ifndef EV_USE_NANOSLEEP
69# if HAVE_NANOSLEEP
70# define EV_USE_NANOSLEEP 1
71# else
72# define EV_USE_NANOSLEEP 0
73# endif
74# endif
75
76# ifndef EV_USE_SELECT
77# if HAVE_SELECT && HAVE_SYS_SELECT_H
78# define EV_USE_SELECT 1
79# else
80# define EV_USE_SELECT 0
81# endif
82# endif
83
84# ifndef EV_USE_POLL
85# if HAVE_POLL && HAVE_POLL_H
86# define EV_USE_POLL 1
87# else
88# define EV_USE_POLL 0
89# endif
90# endif
91
92# ifndef EV_USE_EPOLL
93# if HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H
94# define EV_USE_EPOLL 1
95# else
96# define EV_USE_EPOLL 0
97# endif
98# endif
99
100# ifndef EV_USE_KQUEUE
101# if HAVE_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H
102# define EV_USE_KQUEUE 1
103# else
104# define EV_USE_KQUEUE 0
105# endif
106# endif
107
108# ifndef EV_USE_PORT
109# if HAVE_PORT_H && HAVE_PORT_CREATE
110# define EV_USE_PORT 1
111# else
112# define EV_USE_PORT 0
113# endif
114# endif
115
116# ifndef EV_USE_INOTIFY
117# if HAVE_INOTIFY_INIT && HAVE_SYS_INOTIFY_H
118# define EV_USE_INOTIFY 1
119# else
120# define EV_USE_INOTIFY 0
121# endif
122# endif
123
124# ifndef EV_USE_EVENTFD
125# if HAVE_EVENTFD
126# define EV_USE_EVENTFD 1
127# else
128# define EV_USE_EVENTFD 0
129# endif
130# endif
131
132#endif
133
1#include <math.h> 134#include <math.h>
2#include <stdlib.h> 135#include <stdlib.h>
136#include <fcntl.h>
137#include <stddef.h>
3 138
4#include <stdio.h> 139#include <stdio.h>
5 140
6#include <assert.h> 141#include <assert.h>
7#include <errno.h> 142#include <errno.h>
8#include <sys/time.h> 143#include <sys/types.h>
9#include <time.h> 144#include <time.h>
10 145
146#include <signal.h>
147
148#ifdef EV_H
149# include EV_H
150#else
151# include "ev.h"
152#endif
153
154#ifndef _WIN32
155# include <sys/time.h>
156# include <sys/wait.h>
157# include <unistd.h>
158#else
159# define WIN32_LEAN_AND_MEAN
160# include <windows.h>
161# ifndef EV_SELECT_IS_WINSOCKET
162# define EV_SELECT_IS_WINSOCKET 1
163# endif
164#endif
165
166/* this block tries to deduce configuration from header-defined symbols and defaults */
167
168#ifndef EV_USE_MONOTONIC
169# if defined (_POSIX_MONOTONIC_CLOCK) && _POSIX_MONOTONIC_CLOCK >= 0
170# define EV_USE_MONOTONIC 1
171# else
172# define EV_USE_MONOTONIC 0
173# endif
174#endif
175
176#ifndef EV_USE_REALTIME
177# define EV_USE_REALTIME 0
178#endif
179
180#ifndef EV_USE_NANOSLEEP
181# if _POSIX_C_SOURCE >= 199309L
182# define EV_USE_NANOSLEEP 1
183# else
184# define EV_USE_NANOSLEEP 0
185# endif
186#endif
187
188#ifndef EV_USE_SELECT
189# define EV_USE_SELECT 1
190#endif
191
192#ifndef EV_USE_POLL
193# ifdef _WIN32
194# define EV_USE_POLL 0
195# else
196# define EV_USE_POLL 1
197# endif
198#endif
199
200#ifndef EV_USE_EPOLL
201# if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 4))
202# define EV_USE_EPOLL 1
203# else
204# define EV_USE_EPOLL 0
205# endif
206#endif
207
208#ifndef EV_USE_KQUEUE
209# define EV_USE_KQUEUE 0
210#endif
211
212#ifndef EV_USE_PORT
213# define EV_USE_PORT 0
214#endif
215
216#ifndef EV_USE_INOTIFY
217# if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 4))
218# define EV_USE_INOTIFY 1
219# else
220# define EV_USE_INOTIFY 0
221# endif
222#endif
223
224#ifndef EV_PID_HASHSIZE
225# if EV_MINIMAL
226# define EV_PID_HASHSIZE 1
227# else
228# define EV_PID_HASHSIZE 16
229# endif
230#endif
231
232#ifndef EV_INOTIFY_HASHSIZE
233# if EV_MINIMAL
234# define EV_INOTIFY_HASHSIZE 1
235# else
236# define EV_INOTIFY_HASHSIZE 16
237# endif
238#endif
239
240#ifndef EV_USE_EVENTFD
241# if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7))
242# define EV_USE_EVENTFD 1
243# else
244# define EV_USE_EVENTFD 0
245# endif
246#endif
247
248#if 0 /* debugging */
249# define EV_VERIFY 3
250# define EV_USE_4HEAP 1
251# define EV_HEAP_CACHE_AT 1
252#endif
253
254#ifndef EV_VERIFY
255# define EV_VERIFY !EV_MINIMAL
256#endif
257
258#ifndef EV_USE_4HEAP
259# define EV_USE_4HEAP !EV_MINIMAL
260#endif
261
262#ifndef EV_HEAP_CACHE_AT
263# define EV_HEAP_CACHE_AT !EV_MINIMAL
264#endif
265
266/* this block fixes any misconfiguration where we know we run into trouble otherwise */
267
11#ifdef CLOCK_MONOTONIC 268#ifndef CLOCK_MONOTONIC
269# undef EV_USE_MONOTONIC
12# define HAVE_MONOTONIC 1 270# define EV_USE_MONOTONIC 0
271#endif
272
273#ifndef CLOCK_REALTIME
274# undef EV_USE_REALTIME
275# define EV_USE_REALTIME 0
276#endif
277
278#if !EV_STAT_ENABLE
279# undef EV_USE_INOTIFY
280# define EV_USE_INOTIFY 0
281#endif
282
283#if !EV_USE_NANOSLEEP
284# ifndef _WIN32
285# include <sys/select.h>
13#endif 286# endif
287#endif
14 288
15#define HAVE_REALTIME 1 289#if EV_USE_INOTIFY
16#define HAVE_EPOLL 1 290# include <sys/inotify.h>
17#define HAVE_SELECT 1 291#endif
292
293#if EV_SELECT_IS_WINSOCKET
294# include <winsock.h>
295#endif
296
297#if EV_USE_EVENTFD
298/* our minimum requirement is glibc 2.7 which has the stub, but not the header */
299# include <stdint.h>
300# ifdef __cplusplus
301extern "C" {
302# endif
303int eventfd (unsigned int initval, int flags);
304# ifdef __cplusplus
305}
306# endif
307#endif
308
309/**/
310
311#if EV_VERIFY >= 3
312# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
313#else
314# define EV_FREQUENT_CHECK do { } while (0)
315#endif
316
317/*
318 * This is used to avoid floating point rounding problems.
319 * It is added to ev_rt_now when scheduling periodics
320 * to ensure progress, time-wise, even when rounding
321 * errors are against us.
322 * This value is good at least till the year 4000.
323 * Better solutions welcome.
324 */
325#define TIME_EPSILON 0.0001220703125 /* 1/8192 */
18 326
19#define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ 327#define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */
20#define MAX_BLOCKTIME 60. 328#define MAX_BLOCKTIME 59.743 /* never wait longer than this time (to detect time jumps) */
329/*#define CLEANUP_INTERVAL (MAX_BLOCKTIME * 5.) /* how often to try to free memory and re-check fds, TODO */
21 330
331#if __GNUC__ >= 4
332# define expect(expr,value) __builtin_expect ((expr),(value))
333# define noinline __attribute__ ((noinline))
334#else
335# define expect(expr,value) (expr)
336# define noinline
337# if __STDC_VERSION__ < 199901L && __GNUC__ < 2
338# define inline
339# endif
340#endif
341
342#define expect_false(expr) expect ((expr) != 0, 0)
343#define expect_true(expr) expect ((expr) != 0, 1)
344#define inline_size static inline
345
346#if EV_MINIMAL
347# define inline_speed static noinline
348#else
349# define inline_speed static inline
350#endif
351
352#define NUMPRI (EV_MAXPRI - EV_MINPRI + 1)
353#define ABSPRI(w) (((W)w)->priority - EV_MINPRI)
354
355#define EMPTY /* required for microsofts broken pseudo-c compiler */
356#define EMPTY2(a,b) /* used to suppress some warnings */
357
358typedef ev_watcher *W;
359typedef ev_watcher_list *WL;
360typedef ev_watcher_time *WT;
361
362#define ev_active(w) ((W)(w))->active
363#define ev_at(w) ((WT)(w))->at
364
365#if EV_USE_MONOTONIC
366/* sig_atomic_t is used to avoid per-thread variables or locking but still */
367/* giving it a reasonably high chance of working on typical architetcures */
368static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */
369#endif
370
371#ifdef _WIN32
372# include "ev_win32.c"
373#endif
374
375/*****************************************************************************/
376
377static void (*syserr_cb)(const char *msg);
378
379void
380ev_set_syserr_cb (void (*cb)(const char *msg))
381{
382 syserr_cb = cb;
383}
384
385static void noinline
386syserr (const char *msg)
387{
388 if (!msg)
389 msg = "(libev) system error";
390
391 if (syserr_cb)
392 syserr_cb (msg);
393 else
394 {
395 perror (msg);
396 abort ();
397 }
398}
399
400static void *
401ev_realloc_emul (void *ptr, long size)
402{
403 /* some systems, notably openbsd and darwin, fail to properly
404 * implement realloc (x, 0) (as required by both ansi c-98 and
405 * the single unix specification, so work around them here.
406 */
407
408 if (size)
409 return realloc (ptr, size);
410
411 free (ptr);
412 return 0;
413}
414
415static void *(*alloc)(void *ptr, long size) = ev_realloc_emul;
416
417void
418ev_set_allocator (void *(*cb)(void *ptr, long size))
419{
420 alloc = cb;
421}
422
423inline_speed void *
424ev_realloc (void *ptr, long size)
425{
426 ptr = alloc (ptr, size);
427
428 if (!ptr && size)
429 {
430 fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size);
431 abort ();
432 }
433
434 return ptr;
435}
436
437#define ev_malloc(size) ev_realloc (0, (size))
438#define ev_free(ptr) ev_realloc ((ptr), 0)
439
440/*****************************************************************************/
441
442typedef struct
443{
444 WL head;
445 unsigned char events;
446 unsigned char reify;
447#if EV_SELECT_IS_WINSOCKET
448 SOCKET handle;
449#endif
450} ANFD;
451
452typedef struct
453{
454 W w;
455 int events;
456} ANPENDING;
457
458#if EV_USE_INOTIFY
459/* hash table entry per inotify-id */
460typedef struct
461{
462 WL head;
463} ANFS;
464#endif
465
466/* Heap Entry */
467#if EV_HEAP_CACHE_AT
468 typedef struct {
469 ev_tstamp at;
470 WT w;
471 } ANHE;
472
473 #define ANHE_w(he) (he).w /* access watcher, read-write */
474 #define ANHE_at(he) (he).at /* access cached at, read-only */
475 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
476#else
477 typedef WT ANHE;
478
479 #define ANHE_w(he) (he)
480 #define ANHE_at(he) (he)->at
481 #define ANHE_at_cache(he)
482#endif
483
484#if EV_MULTIPLICITY
485
486 struct ev_loop
487 {
488 ev_tstamp ev_rt_now;
489 #define ev_rt_now ((loop)->ev_rt_now)
490 #define VAR(name,decl) decl;
491 #include "ev_vars.h"
492 #undef VAR
493 };
22#include "ev.h" 494 #include "ev_wrap.h"
23 495
24struct ev_watcher { 496 static struct ev_loop default_loop_struct;
25 EV_WATCHER (ev_watcher); 497 struct ev_loop *ev_default_loop_ptr;
26};
27 498
28struct ev_watcher_list { 499#else
29 EV_WATCHER_LIST (ev_watcher_list);
30};
31 500
32static ev_tstamp now, diff; /* monotonic clock */
33ev_tstamp ev_now; 501 ev_tstamp ev_rt_now;
34int ev_method; 502 #define VAR(name,decl) static decl;
503 #include "ev_vars.h"
504 #undef VAR
35 505
36static int have_monotonic; /* runtime */ 506 static int ev_default_loop_ptr;
37 507
38static ev_tstamp method_fudge; /* stupid epoll-returns-early bug */ 508#endif
39static void (*method_modify)(int fd, int oev, int nev); 509
40static void (*method_poll)(ev_tstamp timeout); 510/*****************************************************************************/
41 511
42ev_tstamp 512ev_tstamp
43ev_time (void) 513ev_time (void)
44{ 514{
45#if HAVE_REALTIME 515#if EV_USE_REALTIME
46 struct timespec ts; 516 struct timespec ts;
47 clock_gettime (CLOCK_REALTIME, &ts); 517 clock_gettime (CLOCK_REALTIME, &ts);
48 return ts.tv_sec + ts.tv_nsec * 1e-9; 518 return ts.tv_sec + ts.tv_nsec * 1e-9;
49#else 519#else
50 struct timeval tv; 520 struct timeval tv;
51 gettimeofday (&tv, 0); 521 gettimeofday (&tv, 0);
52 return tv.tv_sec + tv.tv_usec * 1e-6; 522 return tv.tv_sec + tv.tv_usec * 1e-6;
53#endif 523#endif
54} 524}
55 525
56static ev_tstamp 526ev_tstamp inline_size
57get_clock (void) 527get_clock (void)
58{ 528{
59#if HAVE_MONOTONIC 529#if EV_USE_MONOTONIC
60 if (have_monotonic) 530 if (expect_true (have_monotonic))
61 { 531 {
62 struct timespec ts; 532 struct timespec ts;
63 clock_gettime (CLOCK_MONOTONIC, &ts); 533 clock_gettime (CLOCK_MONOTONIC, &ts);
64 return ts.tv_sec + ts.tv_nsec * 1e-9; 534 return ts.tv_sec + ts.tv_nsec * 1e-9;
65 } 535 }
66#endif 536#endif
67 537
68 return ev_time (); 538 return ev_time ();
69} 539}
70 540
541#if EV_MULTIPLICITY
542ev_tstamp
543ev_now (EV_P)
544{
545 return ev_rt_now;
546}
547#endif
548
549void
550ev_sleep (ev_tstamp delay)
551{
552 if (delay > 0.)
553 {
554#if EV_USE_NANOSLEEP
555 struct timespec ts;
556
557 ts.tv_sec = (time_t)delay;
558 ts.tv_nsec = (long)((delay - (ev_tstamp)(ts.tv_sec)) * 1e9);
559
560 nanosleep (&ts, 0);
561#elif defined(_WIN32)
562 Sleep ((unsigned long)(delay * 1e3));
563#else
564 struct timeval tv;
565
566 tv.tv_sec = (time_t)delay;
567 tv.tv_usec = (long)((delay - (ev_tstamp)(tv.tv_sec)) * 1e6);
568
569 select (0, 0, 0, 0, &tv);
570#endif
571 }
572}
573
574/*****************************************************************************/
575
576#define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */
577
578int inline_size
579array_nextsize (int elem, int cur, int cnt)
580{
581 int ncur = cur + 1;
582
583 do
584 ncur <<= 1;
585 while (cnt > ncur);
586
587 /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */
588 if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4)
589 {
590 ncur *= elem;
591 ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1);
592 ncur = ncur - sizeof (void *) * 4;
593 ncur /= elem;
594 }
595
596 return ncur;
597}
598
599static noinline void *
600array_realloc (int elem, void *base, int *cur, int cnt)
601{
602 *cur = array_nextsize (elem, *cur, cnt);
603 return ev_realloc (base, elem * *cur);
604}
605
71#define array_needsize(base,cur,cnt,init) \ 606#define array_needsize(type,base,cur,cnt,init) \
72 if ((cnt) > cur) \ 607 if (expect_false ((cnt) > (cur))) \
73 { \ 608 { \
74 int newcnt = cur ? cur << 1 : 16; \ 609 int ocur_ = (cur); \
75 fprintf (stderr, "resize(" # base ") from %d to %d\n", cur, newcnt);\ 610 (base) = (type *)array_realloc \
76 base = realloc (base, sizeof (*base) * (newcnt)); \ 611 (sizeof (type), (base), &(cur), (cnt)); \
77 init (base + cur, newcnt - cur); \ 612 init ((base) + (ocur_), (cur) - ocur_); \
78 cur = newcnt; \ 613 }
614
615#if 0
616#define array_slim(type,stem) \
617 if (stem ## max < array_roundsize (stem ## cnt >> 2)) \
618 { \
619 stem ## max = array_roundsize (stem ## cnt >> 1); \
620 base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\
621 fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\
622 }
623#endif
624
625#define array_free(stem, idx) \
626 ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0;
627
628/*****************************************************************************/
629
630void noinline
631ev_feed_event (EV_P_ void *w, int revents)
632{
633 W w_ = (W)w;
634 int pri = ABSPRI (w_);
635
636 if (expect_false (w_->pending))
637 pendings [pri][w_->pending - 1].events |= revents;
638 else
79 } 639 {
640 w_->pending = ++pendingcnt [pri];
641 array_needsize (ANPENDING, pendings [pri], pendingmax [pri], w_->pending, EMPTY2);
642 pendings [pri][w_->pending - 1].w = w_;
643 pendings [pri][w_->pending - 1].events = revents;
644 }
645}
80 646
81typedef struct 647void inline_speed
648queue_events (EV_P_ W *events, int eventcnt, int type)
82{ 649{
83 struct ev_io *head; 650 int i;
84 unsigned char wev, rev; /* want, received event set */
85} ANFD;
86 651
87static ANFD *anfds; 652 for (i = 0; i < eventcnt; ++i)
88static int anfdmax; 653 ev_feed_event (EV_A_ events [i], type);
654}
89 655
90static int *fdchanges; 656/*****************************************************************************/
91static int fdchangemax, fdchangecnt;
92 657
93static void 658void inline_size
94anfds_init (ANFD *base, int count) 659anfds_init (ANFD *base, int count)
95{ 660{
96 while (count--) 661 while (count--)
97 { 662 {
98 base->head = 0; 663 base->head = 0;
99 base->wev = base->rev = EV_NONE; 664 base->events = EV_NONE;
665 base->reify = 0;
666
100 ++base; 667 ++base;
101 } 668 }
102} 669}
103 670
104typedef struct 671void inline_speed
105{
106 struct ev_watcher *w;
107 int events;
108} ANPENDING;
109
110static ANPENDING *pendings;
111static int pendingmax, pendingcnt;
112
113static void
114event (struct ev_watcher *w, int events)
115{
116 w->pending = ++pendingcnt;
117 array_needsize (pendings, pendingmax, pendingcnt, );
118 pendings [pendingcnt - 1].w = w;
119 pendings [pendingcnt - 1].events = events;
120}
121
122static void
123fd_event (int fd, int events) 672fd_event (EV_P_ int fd, int revents)
124{ 673{
125 ANFD *anfd = anfds + fd; 674 ANFD *anfd = anfds + fd;
126 struct ev_io *w; 675 ev_io *w;
127 676
128 for (w = anfd->head; w; w = w->next) 677 for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next)
129 { 678 {
130 int ev = w->events & events; 679 int ev = w->events & revents;
131 680
132 if (ev) 681 if (ev)
133 event ((struct ev_watcher *)w, ev); 682 ev_feed_event (EV_A_ (W)w, ev);
134 }
135}
136
137static struct ev_timer **atimers;
138static int atimermax, atimercnt;
139
140static struct ev_timer **rtimers;
141static int rtimermax, rtimercnt;
142
143static void
144upheap (struct ev_timer **timers, int k)
145{
146 struct ev_timer *w = timers [k];
147
148 while (k && timers [k >> 1]->at > w->at)
149 { 683 }
150 timers [k] = timers [k >> 1];
151 timers [k]->active = k + 1;
152 k >>= 1;
153 }
154
155 timers [k] = w;
156 timers [k]->active = k + 1;
157
158} 684}
159 685
160static void 686void
161downheap (struct ev_timer **timers, int N, int k) 687ev_feed_fd_event (EV_P_ int fd, int revents)
162{ 688{
163 struct ev_timer *w = timers [k]; 689 if (fd >= 0 && fd < anfdmax)
164 690 fd_event (EV_A_ fd, revents);
165 while (k < (N >> 1))
166 {
167 int j = k << 1;
168
169 if (j + 1 < N && timers [j]->at > timers [j + 1]->at)
170 ++j;
171
172 if (w->at <= timers [j]->at)
173 break;
174
175 timers [k] = timers [j];
176 timers [k]->active = k + 1;
177 k = j;
178 }
179
180 timers [k] = w;
181 timers [k]->active = k + 1;
182} 691}
183 692
184static struct ev_signal **signals; 693void inline_size
185static int signalmax; 694fd_reify (EV_P)
186
187static void
188signals_init (struct ev_signal **base, int count)
189{
190 while (count--)
191 *base++ = 0;
192}
193
194#if HAVE_EPOLL
195# include "ev_epoll.c"
196#endif
197#if HAVE_SELECT
198# include "ev_select.c"
199#endif
200
201int ev_init (int flags)
202{
203#if HAVE_MONOTONIC
204 {
205 struct timespec ts;
206 if (!clock_gettime (CLOCK_MONOTONIC, &ts))
207 have_monotonic = 1;
208 }
209#endif
210
211 ev_now = ev_time ();
212 now = get_clock ();
213 diff = ev_now - now;
214
215#if HAVE_EPOLL
216 if (epoll_init (flags))
217 return ev_method;
218#endif
219#if HAVE_SELECT
220 if (select_init (flags))
221 return ev_method;
222#endif
223
224 ev_method = EVMETHOD_NONE;
225 return ev_method;
226}
227
228void ev_prefork (void)
229{
230}
231
232void ev_postfork_parent (void)
233{
234}
235
236void ev_postfork_child (void)
237{
238#if HAVE_EPOLL
239 if (ev_method == EVMETHOD_EPOLL)
240 epoll_postfork_child ();
241#endif
242}
243
244static void
245fd_reify (void)
246{ 695{
247 int i; 696 int i;
248 697
249 for (i = 0; i < fdchangecnt; ++i) 698 for (i = 0; i < fdchangecnt; ++i)
250 { 699 {
251 int fd = fdchanges [i]; 700 int fd = fdchanges [i];
252 ANFD *anfd = anfds + fd; 701 ANFD *anfd = anfds + fd;
253 struct ev_io *w; 702 ev_io *w;
254 703
255 int wev = 0; 704 unsigned char events = 0;
256 705
257 for (w = anfd->head; w; w = w->next) 706 for (w = (ev_io *)anfd->head; w; w = (ev_io *)((WL)w)->next)
258 wev |= w->events; 707 events |= (unsigned char)w->events;
259 708
260 if (anfd->wev != wev) 709#if EV_SELECT_IS_WINSOCKET
710 if (events)
261 { 711 {
262 method_modify (fd, anfd->wev, wev); 712 unsigned long arg;
263 anfd->wev = wev; 713 #ifdef EV_FD_TO_WIN32_HANDLE
714 anfd->handle = EV_FD_TO_WIN32_HANDLE (fd);
715 #else
716 anfd->handle = _get_osfhandle (fd);
717 #endif
718 assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &arg) == 0));
264 } 719 }
720#endif
721
722 {
723 unsigned char o_events = anfd->events;
724 unsigned char o_reify = anfd->reify;
725
726 anfd->reify = 0;
727 anfd->events = events;
728
729 if (o_events != events || o_reify & EV_IOFDSET)
730 backend_modify (EV_A_ fd, o_events, events);
731 }
265 } 732 }
266 733
267 fdchangecnt = 0; 734 fdchangecnt = 0;
268} 735}
269 736
737void inline_size
738fd_change (EV_P_ int fd, int flags)
739{
740 unsigned char reify = anfds [fd].reify;
741 anfds [fd].reify |= flags;
742
743 if (expect_true (!reify))
744 {
745 ++fdchangecnt;
746 array_needsize (int, fdchanges, fdchangemax, fdchangecnt, EMPTY2);
747 fdchanges [fdchangecnt - 1] = fd;
748 }
749}
750
751void inline_speed
752fd_kill (EV_P_ int fd)
753{
754 ev_io *w;
755
756 while ((w = (ev_io *)anfds [fd].head))
757 {
758 ev_io_stop (EV_A_ w);
759 ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE);
760 }
761}
762
763int inline_size
764fd_valid (int fd)
765{
766#ifdef _WIN32
767 return _get_osfhandle (fd) != -1;
768#else
769 return fcntl (fd, F_GETFD) != -1;
770#endif
771}
772
773/* called on EBADF to verify fds */
774static void noinline
775fd_ebadf (EV_P)
776{
777 int fd;
778
779 for (fd = 0; fd < anfdmax; ++fd)
780 if (anfds [fd].events)
781 if (!fd_valid (fd) && errno == EBADF)
782 fd_kill (EV_A_ fd);
783}
784
785/* called on ENOMEM in select/poll to kill some fds and retry */
786static void noinline
787fd_enomem (EV_P)
788{
789 int fd;
790
791 for (fd = anfdmax; fd--; )
792 if (anfds [fd].events)
793 {
794 fd_kill (EV_A_ fd);
795 return;
796 }
797}
798
799/* usually called after fork if backend needs to re-arm all fds from scratch */
800static void noinline
801fd_rearm_all (EV_P)
802{
803 int fd;
804
805 for (fd = 0; fd < anfdmax; ++fd)
806 if (anfds [fd].events)
807 {
808 anfds [fd].events = 0;
809 fd_change (EV_A_ fd, EV_IOFDSET | 1);
810 }
811}
812
813/*****************************************************************************/
814
815/*
816 * the heap functions want a real array index. array index 0 uis guaranteed to not
817 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
818 * the branching factor of the d-tree.
819 */
820
821/*
822 * at the moment we allow libev the luxury of two heaps,
823 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
824 * which is more cache-efficient.
825 * the difference is about 5% with 50000+ watchers.
826 */
827#if EV_USE_4HEAP
828
829#define DHEAP 4
830#define HEAP0 (DHEAP - 1) /* index of first element in heap */
831#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
832#define UPHEAP_DONE(p,k) ((p) == (k))
833
834/* away from the root */
835void inline_speed
836downheap (ANHE *heap, int N, int k)
837{
838 ANHE he = heap [k];
839 ANHE *E = heap + N + HEAP0;
840
841 for (;;)
842 {
843 ev_tstamp minat;
844 ANHE *minpos;
845 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
846
847 /* find minimum child */
848 if (expect_true (pos + DHEAP - 1 < E))
849 {
850 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
851 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
852 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
853 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
854 }
855 else if (pos < E)
856 {
857 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
858 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
859 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
860 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
861 }
862 else
863 break;
864
865 if (ANHE_at (he) <= minat)
866 break;
867
868 heap [k] = *minpos;
869 ev_active (ANHE_w (*minpos)) = k;
870
871 k = minpos - heap;
872 }
873
874 heap [k] = he;
875 ev_active (ANHE_w (he)) = k;
876}
877
878#else /* 4HEAP */
879
880#define HEAP0 1
881#define HPARENT(k) ((k) >> 1)
882#define UPHEAP_DONE(p,k) (!(p))
883
884/* away from the root */
885void inline_speed
886downheap (ANHE *heap, int N, int k)
887{
888 ANHE he = heap [k];
889
890 for (;;)
891 {
892 int c = k << 1;
893
894 if (c > N + HEAP0 - 1)
895 break;
896
897 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
898 ? 1 : 0;
899
900 if (ANHE_at (he) <= ANHE_at (heap [c]))
901 break;
902
903 heap [k] = heap [c];
904 ev_active (ANHE_w (heap [k])) = k;
905
906 k = c;
907 }
908
909 heap [k] = he;
910 ev_active (ANHE_w (he)) = k;
911}
912#endif
913
914/* towards the root */
915void inline_speed
916upheap (ANHE *heap, int k)
917{
918 ANHE he = heap [k];
919
920 for (;;)
921 {
922 int p = HPARENT (k);
923
924 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
925 break;
926
927 heap [k] = heap [p];
928 ev_active (ANHE_w (heap [k])) = k;
929 k = p;
930 }
931
932 heap [k] = he;
933 ev_active (ANHE_w (he)) = k;
934}
935
936void inline_size
937adjustheap (ANHE *heap, int N, int k)
938{
939 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
940 upheap (heap, k);
941 else
942 downheap (heap, N, k);
943}
944
945/* rebuild the heap: this function is used only once and executed rarely */
946void inline_size
947reheap (ANHE *heap, int N)
948{
949 int i;
950
951 /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
952 /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
953 for (i = 0; i < N; ++i)
954 upheap (heap, i + HEAP0);
955}
956
957/*****************************************************************************/
958
959typedef struct
960{
961 WL head;
962 EV_ATOMIC_T gotsig;
963} ANSIG;
964
965static ANSIG *signals;
966static int signalmax;
967
968static EV_ATOMIC_T gotsig;
969
970void inline_size
971signals_init (ANSIG *base, int count)
972{
973 while (count--)
974 {
975 base->head = 0;
976 base->gotsig = 0;
977
978 ++base;
979 }
980}
981
982/*****************************************************************************/
983
984void inline_speed
985fd_intern (int fd)
986{
987#ifdef _WIN32
988 unsigned long arg = 1;
989 ioctlsocket (_get_osfhandle (fd), FIONBIO, &arg);
990#else
991 fcntl (fd, F_SETFD, FD_CLOEXEC);
992 fcntl (fd, F_SETFL, O_NONBLOCK);
993#endif
994}
995
996static void noinline
997evpipe_init (EV_P)
998{
999 if (!ev_is_active (&pipeev))
1000 {
1001#if EV_USE_EVENTFD
1002 if ((evfd = eventfd (0, 0)) >= 0)
1003 {
1004 evpipe [0] = -1;
1005 fd_intern (evfd);
1006 ev_io_set (&pipeev, evfd, EV_READ);
1007 }
1008 else
1009#endif
1010 {
1011 while (pipe (evpipe))
1012 syserr ("(libev) error creating signal/async pipe");
1013
1014 fd_intern (evpipe [0]);
1015 fd_intern (evpipe [1]);
1016 ev_io_set (&pipeev, evpipe [0], EV_READ);
1017 }
1018
1019 ev_io_start (EV_A_ &pipeev);
1020 ev_unref (EV_A); /* watcher should not keep loop alive */
1021 }
1022}
1023
1024void inline_size
1025evpipe_write (EV_P_ EV_ATOMIC_T *flag)
1026{
1027 if (!*flag)
1028 {
1029 int old_errno = errno; /* save errno because write might clobber it */
1030
1031 *flag = 1;
1032
1033#if EV_USE_EVENTFD
1034 if (evfd >= 0)
1035 {
1036 uint64_t counter = 1;
1037 write (evfd, &counter, sizeof (uint64_t));
1038 }
1039 else
1040#endif
1041 write (evpipe [1], &old_errno, 1);
1042
1043 errno = old_errno;
1044 }
1045}
1046
270static void 1047static void
271call_pending () 1048pipecb (EV_P_ ev_io *iow, int revents)
1049{
1050#if EV_USE_EVENTFD
1051 if (evfd >= 0)
1052 {
1053 uint64_t counter;
1054 read (evfd, &counter, sizeof (uint64_t));
1055 }
1056 else
1057#endif
1058 {
1059 char dummy;
1060 read (evpipe [0], &dummy, 1);
1061 }
1062
1063 if (gotsig && ev_is_default_loop (EV_A))
1064 {
1065 int signum;
1066 gotsig = 0;
1067
1068 for (signum = signalmax; signum--; )
1069 if (signals [signum].gotsig)
1070 ev_feed_signal_event (EV_A_ signum + 1);
1071 }
1072
1073#if EV_ASYNC_ENABLE
1074 if (gotasync)
1075 {
1076 int i;
1077 gotasync = 0;
1078
1079 for (i = asynccnt; i--; )
1080 if (asyncs [i]->sent)
1081 {
1082 asyncs [i]->sent = 0;
1083 ev_feed_event (EV_A_ asyncs [i], EV_ASYNC);
1084 }
1085 }
1086#endif
1087}
1088
1089/*****************************************************************************/
1090
1091static void
1092ev_sighandler (int signum)
1093{
1094#if EV_MULTIPLICITY
1095 struct ev_loop *loop = &default_loop_struct;
1096#endif
1097
1098#if _WIN32
1099 signal (signum, ev_sighandler);
1100#endif
1101
1102 signals [signum - 1].gotsig = 1;
1103 evpipe_write (EV_A_ &gotsig);
1104}
1105
1106void noinline
1107ev_feed_signal_event (EV_P_ int signum)
1108{
1109 WL w;
1110
1111#if EV_MULTIPLICITY
1112 assert (("feeding signal events is only supported in the default loop", loop == ev_default_loop_ptr));
1113#endif
1114
1115 --signum;
1116
1117 if (signum < 0 || signum >= signalmax)
1118 return;
1119
1120 signals [signum].gotsig = 0;
1121
1122 for (w = signals [signum].head; w; w = w->next)
1123 ev_feed_event (EV_A_ (W)w, EV_SIGNAL);
1124}
1125
1126/*****************************************************************************/
1127
1128static WL childs [EV_PID_HASHSIZE];
1129
1130#ifndef _WIN32
1131
1132static ev_signal childev;
1133
1134#ifndef WIFCONTINUED
1135# define WIFCONTINUED(status) 0
1136#endif
1137
1138void inline_speed
1139child_reap (EV_P_ int chain, int pid, int status)
1140{
1141 ev_child *w;
1142 int traced = WIFSTOPPED (status) || WIFCONTINUED (status);
1143
1144 for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next)
1145 {
1146 if ((w->pid == pid || !w->pid)
1147 && (!traced || (w->flags & 1)))
1148 {
1149 ev_set_priority (w, EV_MAXPRI); /* need to do it *now*, this *must* be the same prio as the signal watcher itself */
1150 w->rpid = pid;
1151 w->rstatus = status;
1152 ev_feed_event (EV_A_ (W)w, EV_CHILD);
1153 }
1154 }
1155}
1156
1157#ifndef WCONTINUED
1158# define WCONTINUED 0
1159#endif
1160
1161static void
1162childcb (EV_P_ ev_signal *sw, int revents)
1163{
1164 int pid, status;
1165
1166 /* some systems define WCONTINUED but then fail to support it (linux 2.4) */
1167 if (0 >= (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED)))
1168 if (!WCONTINUED
1169 || errno != EINVAL
1170 || 0 >= (pid = waitpid (-1, &status, WNOHANG | WUNTRACED)))
1171 return;
1172
1173 /* make sure we are called again until all children have been reaped */
1174 /* we need to do it this way so that the callback gets called before we continue */
1175 ev_feed_event (EV_A_ (W)sw, EV_SIGNAL);
1176
1177 child_reap (EV_A_ pid, pid, status);
1178 if (EV_PID_HASHSIZE > 1)
1179 child_reap (EV_A_ 0, pid, status); /* this might trigger a watcher twice, but feed_event catches that */
1180}
1181
1182#endif
1183
1184/*****************************************************************************/
1185
1186#if EV_USE_PORT
1187# include "ev_port.c"
1188#endif
1189#if EV_USE_KQUEUE
1190# include "ev_kqueue.c"
1191#endif
1192#if EV_USE_EPOLL
1193# include "ev_epoll.c"
1194#endif
1195#if EV_USE_POLL
1196# include "ev_poll.c"
1197#endif
1198#if EV_USE_SELECT
1199# include "ev_select.c"
1200#endif
1201
1202int
1203ev_version_major (void)
1204{
1205 return EV_VERSION_MAJOR;
1206}
1207
1208int
1209ev_version_minor (void)
1210{
1211 return EV_VERSION_MINOR;
1212}
1213
1214/* return true if we are running with elevated privileges and should ignore env variables */
1215int inline_size
1216enable_secure (void)
1217{
1218#ifdef _WIN32
1219 return 0;
1220#else
1221 return getuid () != geteuid ()
1222 || getgid () != getegid ();
1223#endif
1224}
1225
1226unsigned int
1227ev_supported_backends (void)
1228{
1229 unsigned int flags = 0;
1230
1231 if (EV_USE_PORT ) flags |= EVBACKEND_PORT;
1232 if (EV_USE_KQUEUE) flags |= EVBACKEND_KQUEUE;
1233 if (EV_USE_EPOLL ) flags |= EVBACKEND_EPOLL;
1234 if (EV_USE_POLL ) flags |= EVBACKEND_POLL;
1235 if (EV_USE_SELECT) flags |= EVBACKEND_SELECT;
1236
1237 return flags;
1238}
1239
1240unsigned int
1241ev_recommended_backends (void)
1242{
1243 unsigned int flags = ev_supported_backends ();
1244
1245#ifndef __NetBSD__
1246 /* kqueue is borked on everything but netbsd apparently */
1247 /* it usually doesn't work correctly on anything but sockets and pipes */
1248 flags &= ~EVBACKEND_KQUEUE;
1249#endif
1250#ifdef __APPLE__
1251 // flags &= ~EVBACKEND_KQUEUE; for documentation
1252 flags &= ~EVBACKEND_POLL;
1253#endif
1254
1255 return flags;
1256}
1257
1258unsigned int
1259ev_embeddable_backends (void)
1260{
1261 int flags = EVBACKEND_EPOLL | EVBACKEND_KQUEUE | EVBACKEND_PORT;
1262
1263 /* epoll embeddability broken on all linux versions up to at least 2.6.23 */
1264 /* please fix it and tell me how to detect the fix */
1265 flags &= ~EVBACKEND_EPOLL;
1266
1267 return flags;
1268}
1269
1270unsigned int
1271ev_backend (EV_P)
1272{
1273 return backend;
1274}
1275
1276unsigned int
1277ev_loop_count (EV_P)
1278{
1279 return loop_count;
1280}
1281
1282void
1283ev_set_io_collect_interval (EV_P_ ev_tstamp interval)
1284{
1285 io_blocktime = interval;
1286}
1287
1288void
1289ev_set_timeout_collect_interval (EV_P_ ev_tstamp interval)
1290{
1291 timeout_blocktime = interval;
1292}
1293
1294static void noinline
1295loop_init (EV_P_ unsigned int flags)
1296{
1297 if (!backend)
1298 {
1299#if EV_USE_MONOTONIC
1300 {
1301 struct timespec ts;
1302 if (!clock_gettime (CLOCK_MONOTONIC, &ts))
1303 have_monotonic = 1;
1304 }
1305#endif
1306
1307 ev_rt_now = ev_time ();
1308 mn_now = get_clock ();
1309 now_floor = mn_now;
1310 rtmn_diff = ev_rt_now - mn_now;
1311
1312 io_blocktime = 0.;
1313 timeout_blocktime = 0.;
1314 backend = 0;
1315 backend_fd = -1;
1316 gotasync = 0;
1317#if EV_USE_INOTIFY
1318 fs_fd = -2;
1319#endif
1320
1321 /* pid check not overridable via env */
1322#ifndef _WIN32
1323 if (flags & EVFLAG_FORKCHECK)
1324 curpid = getpid ();
1325#endif
1326
1327 if (!(flags & EVFLAG_NOENV)
1328 && !enable_secure ()
1329 && getenv ("LIBEV_FLAGS"))
1330 flags = atoi (getenv ("LIBEV_FLAGS"));
1331
1332 if (!(flags & 0x0000ffffU))
1333 flags |= ev_recommended_backends ();
1334
1335#if EV_USE_PORT
1336 if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags);
1337#endif
1338#if EV_USE_KQUEUE
1339 if (!backend && (flags & EVBACKEND_KQUEUE)) backend = kqueue_init (EV_A_ flags);
1340#endif
1341#if EV_USE_EPOLL
1342 if (!backend && (flags & EVBACKEND_EPOLL )) backend = epoll_init (EV_A_ flags);
1343#endif
1344#if EV_USE_POLL
1345 if (!backend && (flags & EVBACKEND_POLL )) backend = poll_init (EV_A_ flags);
1346#endif
1347#if EV_USE_SELECT
1348 if (!backend && (flags & EVBACKEND_SELECT)) backend = select_init (EV_A_ flags);
1349#endif
1350
1351 ev_init (&pipeev, pipecb);
1352 ev_set_priority (&pipeev, EV_MAXPRI);
1353 }
1354}
1355
1356static void noinline
1357loop_destroy (EV_P)
272{ 1358{
273 int i; 1359 int i;
274 1360
275 for (i = 0; i < pendingcnt; ++i) 1361 if (ev_is_active (&pipeev))
276 { 1362 {
277 ANPENDING *p = pendings + i; 1363 ev_ref (EV_A); /* signal watcher */
1364 ev_io_stop (EV_A_ &pipeev);
278 1365
279 if (p->w) 1366#if EV_USE_EVENTFD
1367 if (evfd >= 0)
1368 close (evfd);
1369#endif
1370
1371 if (evpipe [0] >= 0)
280 { 1372 {
281 p->w->pending = 0; 1373 close (evpipe [0]);
282 p->w->cb (p->w, p->events); 1374 close (evpipe [1]);
283 } 1375 }
284 } 1376 }
285 1377
286 pendingcnt = 0; 1378#if EV_USE_INOTIFY
287} 1379 if (fs_fd >= 0)
1380 close (fs_fd);
1381#endif
288 1382
289static void 1383 if (backend_fd >= 0)
290timers_reify (struct ev_timer **timers, int timercnt, ev_tstamp now) 1384 close (backend_fd);
1385
1386#if EV_USE_PORT
1387 if (backend == EVBACKEND_PORT ) port_destroy (EV_A);
1388#endif
1389#if EV_USE_KQUEUE
1390 if (backend == EVBACKEND_KQUEUE) kqueue_destroy (EV_A);
1391#endif
1392#if EV_USE_EPOLL
1393 if (backend == EVBACKEND_EPOLL ) epoll_destroy (EV_A);
1394#endif
1395#if EV_USE_POLL
1396 if (backend == EVBACKEND_POLL ) poll_destroy (EV_A);
1397#endif
1398#if EV_USE_SELECT
1399 if (backend == EVBACKEND_SELECT) select_destroy (EV_A);
1400#endif
1401
1402 for (i = NUMPRI; i--; )
1403 {
1404 array_free (pending, [i]);
1405#if EV_IDLE_ENABLE
1406 array_free (idle, [i]);
1407#endif
1408 }
1409
1410 ev_free (anfds); anfdmax = 0;
1411
1412 /* have to use the microsoft-never-gets-it-right macro */
1413 array_free (fdchange, EMPTY);
1414 array_free (timer, EMPTY);
1415#if EV_PERIODIC_ENABLE
1416 array_free (periodic, EMPTY);
1417#endif
1418#if EV_FORK_ENABLE
1419 array_free (fork, EMPTY);
1420#endif
1421 array_free (prepare, EMPTY);
1422 array_free (check, EMPTY);
1423#if EV_ASYNC_ENABLE
1424 array_free (async, EMPTY);
1425#endif
1426
1427 backend = 0;
1428}
1429
1430#if EV_USE_INOTIFY
1431void inline_size infy_fork (EV_P);
1432#endif
1433
1434void inline_size
1435loop_fork (EV_P)
291{ 1436{
292 while (timercnt && timers [0]->at <= now) 1437#if EV_USE_PORT
1438 if (backend == EVBACKEND_PORT ) port_fork (EV_A);
1439#endif
1440#if EV_USE_KQUEUE
1441 if (backend == EVBACKEND_KQUEUE) kqueue_fork (EV_A);
1442#endif
1443#if EV_USE_EPOLL
1444 if (backend == EVBACKEND_EPOLL ) epoll_fork (EV_A);
1445#endif
1446#if EV_USE_INOTIFY
1447 infy_fork (EV_A);
1448#endif
1449
1450 if (ev_is_active (&pipeev))
1451 {
1452 /* this "locks" the handlers against writing to the pipe */
1453 /* while we modify the fd vars */
1454 gotsig = 1;
1455#if EV_ASYNC_ENABLE
1456 gotasync = 1;
1457#endif
1458
1459 ev_ref (EV_A);
1460 ev_io_stop (EV_A_ &pipeev);
1461
1462#if EV_USE_EVENTFD
1463 if (evfd >= 0)
1464 close (evfd);
1465#endif
1466
1467 if (evpipe [0] >= 0)
1468 {
1469 close (evpipe [0]);
1470 close (evpipe [1]);
1471 }
1472
1473 evpipe_init (EV_A);
1474 /* now iterate over everything, in case we missed something */
1475 pipecb (EV_A_ &pipeev, EV_READ);
1476 }
1477
1478 postfork = 0;
1479}
1480
1481#if EV_MULTIPLICITY
1482
1483struct ev_loop *
1484ev_loop_new (unsigned int flags)
1485{
1486 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop));
1487
1488 memset (loop, 0, sizeof (struct ev_loop));
1489
1490 loop_init (EV_A_ flags);
1491
1492 if (ev_backend (EV_A))
1493 return loop;
1494
1495 return 0;
1496}
1497
1498void
1499ev_loop_destroy (EV_P)
1500{
1501 loop_destroy (EV_A);
1502 ev_free (loop);
1503}
1504
1505void
1506ev_loop_fork (EV_P)
1507{
1508 postfork = 1; /* must be in line with ev_default_fork */
1509}
1510
1511#if EV_VERIFY
1512void noinline
1513verify_watcher (EV_P_ W w)
1514{
1515 assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI));
1516
1517 if (w->pending)
1518 assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w));
1519}
1520
1521static void noinline
1522verify_heap (EV_P_ ANHE *heap, int N)
1523{
1524 int i;
1525
1526 for (i = HEAP0; i < N + HEAP0; ++i)
1527 {
1528 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
1529 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
1530 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
1531
1532 verify_watcher (EV_A_ (W)ANHE_w (heap [i]));
1533 }
1534}
1535
1536static void noinline
1537array_verify (EV_P_ W *ws, int cnt)
1538{
1539 while (cnt--)
1540 {
1541 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1542 verify_watcher (EV_A_ ws [cnt]);
1543 }
1544}
1545#endif
1546
1547void
1548ev_loop_verify (EV_P)
1549{
1550#if EV_VERIFY
1551 int i;
1552 WL w;
1553
1554 assert (activecnt >= -1);
1555
1556 assert (fdchangemax >= fdchangecnt);
1557 for (i = 0; i < fdchangecnt; ++i)
1558 assert (("negative fd in fdchanges", fdchanges [i] >= 0));
1559
1560 assert (anfdmax >= 0);
1561 for (i = 0; i < anfdmax; ++i)
1562 for (w = anfds [i].head; w; w = w->next)
293 { 1563 {
294 struct ev_timer *w = timers [0]; 1564 verify_watcher (EV_A_ (W)w);
1565 assert (("inactive fd watcher on anfd list", ev_active (w) == 1));
1566 assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i));
1567 }
1568
1569 assert (timermax >= timercnt);
1570 verify_heap (EV_A_ timers, timercnt);
1571
1572#if EV_PERIODIC_ENABLE
1573 assert (periodicmax >= periodiccnt);
1574 verify_heap (EV_A_ periodics, periodiccnt);
1575#endif
1576
1577 for (i = NUMPRI; i--; )
1578 {
1579 assert (pendingmax [i] >= pendingcnt [i]);
1580#if EV_IDLE_ENABLE
1581 assert (idleall >= 0);
1582 assert (idlemax [i] >= idlecnt [i]);
1583 array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
1584#endif
1585 }
1586
1587#if EV_FORK_ENABLE
1588 assert (forkmax >= forkcnt);
1589 array_verify (EV_A_ (W *)forks, forkcnt);
1590#endif
1591
1592#if EV_ASYNC_ENABLE
1593 assert (asyncmax >= asynccnt);
1594 array_verify (EV_A_ (W *)asyncs, asynccnt);
1595#endif
1596
1597 assert (preparemax >= preparecnt);
1598 array_verify (EV_A_ (W *)prepares, preparecnt);
1599
1600 assert (checkmax >= checkcnt);
1601 array_verify (EV_A_ (W *)checks, checkcnt);
1602
1603# if 0
1604 for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next)
1605 for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1606# endif
1607#endif
1608}
1609
1610#endif /* multiplicity */
1611
1612#if EV_MULTIPLICITY
1613struct ev_loop *
1614ev_default_loop_init (unsigned int flags)
1615#else
1616int
1617ev_default_loop (unsigned int flags)
1618#endif
1619{
1620 if (!ev_default_loop_ptr)
1621 {
1622#if EV_MULTIPLICITY
1623 struct ev_loop *loop = ev_default_loop_ptr = &default_loop_struct;
1624#else
1625 ev_default_loop_ptr = 1;
1626#endif
1627
1628 loop_init (EV_A_ flags);
1629
1630 if (ev_backend (EV_A))
1631 {
1632#ifndef _WIN32
1633 ev_signal_init (&childev, childcb, SIGCHLD);
1634 ev_set_priority (&childev, EV_MAXPRI);
1635 ev_signal_start (EV_A_ &childev);
1636 ev_unref (EV_A); /* child watcher should not keep loop alive */
1637#endif
1638 }
1639 else
1640 ev_default_loop_ptr = 0;
1641 }
1642
1643 return ev_default_loop_ptr;
1644}
1645
1646void
1647ev_default_destroy (void)
1648{
1649#if EV_MULTIPLICITY
1650 struct ev_loop *loop = ev_default_loop_ptr;
1651#endif
1652
1653#ifndef _WIN32
1654 ev_ref (EV_A); /* child watcher */
1655 ev_signal_stop (EV_A_ &childev);
1656#endif
1657
1658 loop_destroy (EV_A);
1659}
1660
1661void
1662ev_default_fork (void)
1663{
1664#if EV_MULTIPLICITY
1665 struct ev_loop *loop = ev_default_loop_ptr;
1666#endif
1667
1668 if (backend)
1669 postfork = 1; /* must be in line with ev_loop_fork */
1670}
1671
1672/*****************************************************************************/
1673
1674void
1675ev_invoke (EV_P_ void *w, int revents)
1676{
1677 EV_CB_INVOKE ((W)w, revents);
1678}
1679
1680void inline_speed
1681call_pending (EV_P)
1682{
1683 int pri;
1684
1685 for (pri = NUMPRI; pri--; )
1686 while (pendingcnt [pri])
1687 {
1688 ANPENDING *p = pendings [pri] + --pendingcnt [pri];
1689
1690 if (expect_true (p->w))
1691 {
1692 /*assert (("non-pending watcher on pending list", p->w->pending));*/
1693
1694 p->w->pending = 0;
1695 EV_CB_INVOKE (p->w, p->events);
1696 EV_FREQUENT_CHECK;
1697 }
1698 }
1699}
1700
1701#if EV_IDLE_ENABLE
1702void inline_size
1703idle_reify (EV_P)
1704{
1705 if (expect_false (idleall))
1706 {
1707 int pri;
1708
1709 for (pri = NUMPRI; pri--; )
1710 {
1711 if (pendingcnt [pri])
1712 break;
1713
1714 if (idlecnt [pri])
1715 {
1716 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1717 break;
1718 }
1719 }
1720 }
1721}
1722#endif
1723
1724void inline_size
1725timers_reify (EV_P)
1726{
1727 EV_FREQUENT_CHECK;
1728
1729 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1730 {
1731 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1732
1733 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
295 1734
296 /* first reschedule or stop timer */ 1735 /* first reschedule or stop timer */
297 if (w->repeat) 1736 if (w->repeat)
298 { 1737 {
299 if (w->is_abs) 1738 ev_at (w) += w->repeat;
300 w->at += floor ((now - w->at) / w->repeat + 1.) * w->repeat; 1739 if (ev_at (w) < mn_now)
301 else 1740 ev_at (w) = mn_now;
302 w->at = now + w->repeat;
303 1741
304 assert (w->at > now); 1742 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
305 1743
1744 ANHE_at_cache (timers [HEAP0]);
306 downheap (timers, timercnt, 0); 1745 downheap (timers, timercnt, HEAP0);
307 } 1746 }
308 else 1747 else
1748 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1749
1750 EV_FREQUENT_CHECK;
1751 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1752 }
1753}
1754
1755#if EV_PERIODIC_ENABLE
1756void inline_size
1757periodics_reify (EV_P)
1758{
1759 EV_FREQUENT_CHECK;
1760
1761 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1762 {
1763 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1764
1765 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1766
1767 /* first reschedule or stop timer */
1768 if (w->reschedule_cb)
309 { 1769 {
310 evtimer_stop (w); /* nonrepeating: stop timer */ 1770 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
311 --timercnt; /* maybe pass by reference instead? */ 1771
1772 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1773
1774 ANHE_at_cache (periodics [HEAP0]);
1775 downheap (periodics, periodiccnt, HEAP0);
312 } 1776 }
1777 else if (w->interval)
1778 {
1779 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1780 /* if next trigger time is not sufficiently in the future, put it there */
1781 /* this might happen because of floating point inexactness */
1782 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1783 {
1784 ev_at (w) += w->interval;
313 1785
314 event ((struct ev_watcher *)w, EV_TIMEOUT); 1786 /* if interval is unreasonably low we might still have a time in the past */
315 } 1787 /* so correct this. this will make the periodic very inexact, but the user */
316} 1788 /* has effectively asked to get triggered more often than possible */
1789 if (ev_at (w) < ev_rt_now)
1790 ev_at (w) = ev_rt_now;
1791 }
317 1792
318static void 1793 ANHE_at_cache (periodics [HEAP0]);
319time_update () 1794 downheap (periodics, periodiccnt, HEAP0);
1795 }
1796 else
1797 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1798
1799 EV_FREQUENT_CHECK;
1800 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1801 }
1802}
1803
1804static void noinline
1805periodics_reschedule (EV_P)
320{ 1806{
321 int i; 1807 int i;
322 ev_now = ev_time ();
323 1808
324 if (have_monotonic) 1809 /* adjust periodics after time jump */
1810 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1811 {
1812 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1813
1814 if (w->reschedule_cb)
1815 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1816 else if (w->interval)
1817 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1818
1819 ANHE_at_cache (periodics [i]);
325 { 1820 }
1821
1822 reheap (periodics, periodiccnt);
1823}
1824#endif
1825
1826void inline_speed
1827time_update (EV_P_ ev_tstamp max_block)
1828{
1829 int i;
1830
1831#if EV_USE_MONOTONIC
1832 if (expect_true (have_monotonic))
1833 {
326 ev_tstamp odiff = diff; 1834 ev_tstamp odiff = rtmn_diff;
327 1835
328 /* detecting time jumps is much more difficult */ 1836 mn_now = get_clock ();
329 for (i = 2; --i; ) /* loop a few times, before making important decisions */ 1837
1838 /* only fetch the realtime clock every 0.5*MIN_TIMEJUMP seconds */
1839 /* interpolate in the meantime */
1840 if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5))
330 { 1841 {
331 now = get_clock (); 1842 ev_rt_now = rtmn_diff + mn_now;
1843 return;
1844 }
1845
1846 now_floor = mn_now;
1847 ev_rt_now = ev_time ();
1848
1849 /* loop a few times, before making important decisions.
1850 * on the choice of "4": one iteration isn't enough,
1851 * in case we get preempted during the calls to
1852 * ev_time and get_clock. a second call is almost guaranteed
1853 * to succeed in that case, though. and looping a few more times
1854 * doesn't hurt either as we only do this on time-jumps or
1855 * in the unlikely event of having been preempted here.
1856 */
1857 for (i = 4; --i; )
1858 {
332 diff = ev_now - now; 1859 rtmn_diff = ev_rt_now - mn_now;
333 1860
334 if (fabs (odiff - diff) < MIN_TIMEJUMP) 1861 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
335 return; /* all is well */ 1862 return; /* all is well */
336 1863
337 ev_now = ev_time (); 1864 ev_rt_now = ev_time ();
1865 mn_now = get_clock ();
1866 now_floor = mn_now;
338 } 1867 }
339 1868
340 /* time jump detected, reschedule atimers */ 1869# if EV_PERIODIC_ENABLE
341 for (i = 0; i < atimercnt; ++i) 1870 periodics_reschedule (EV_A);
1871# endif
1872 /* no timer adjustment, as the monotonic clock doesn't jump */
1873 /* timers_reschedule (EV_A_ rtmn_diff - odiff) */
1874 }
1875 else
1876#endif
1877 {
1878 ev_rt_now = ev_time ();
1879
1880 if (expect_false (mn_now > ev_rt_now || ev_rt_now > mn_now + max_block + MIN_TIMEJUMP))
342 { 1881 {
343 struct ev_timer *w = atimers [i]; 1882#if EV_PERIODIC_ENABLE
344 w->at += ceil ((ev_now - w->at) / w->repeat + 1.) * w->repeat; 1883 periodics_reschedule (EV_A);
1884#endif
1885 /* adjust timers. this is easy, as the offset is the same for all of them */
1886 for (i = 0; i < timercnt; ++i)
1887 {
1888 ANHE *he = timers + i + HEAP0;
1889 ANHE_w (*he)->at += ev_rt_now - mn_now;
1890 ANHE_at_cache (*he);
1891 }
345 } 1892 }
346 }
347 else
348 {
349 if (now > ev_now || now < ev_now - MAX_BLOCKTIME - MIN_TIMEJUMP)
350 /* time jump detected, adjust rtimers */
351 for (i = 0; i < rtimercnt; ++i)
352 rtimers [i]->at += ev_now - now;
353 1893
354 now = ev_now; 1894 mn_now = ev_rt_now;
355 } 1895 }
356} 1896}
357 1897
358int ev_loop_done; 1898void
1899ev_ref (EV_P)
1900{
1901 ++activecnt;
1902}
359 1903
1904void
1905ev_unref (EV_P)
1906{
1907 --activecnt;
1908}
1909
1910static int loop_done;
1911
1912void
360void ev_loop (int flags) 1913ev_loop (EV_P_ int flags)
361{ 1914{
362 double block; 1915 loop_done = EVUNLOOP_CANCEL;
363 ev_loop_done = flags & EVLOOP_ONESHOT; 1916
1917 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
364 1918
365 do 1919 do
366 { 1920 {
1921#if EV_VERIFY >= 2
1922 ev_loop_verify (EV_A);
1923#endif
1924
1925#ifndef _WIN32
1926 if (expect_false (curpid)) /* penalise the forking check even more */
1927 if (expect_false (getpid () != curpid))
1928 {
1929 curpid = getpid ();
1930 postfork = 1;
1931 }
1932#endif
1933
1934#if EV_FORK_ENABLE
1935 /* we might have forked, so queue fork handlers */
1936 if (expect_false (postfork))
1937 if (forkcnt)
1938 {
1939 queue_events (EV_A_ (W *)forks, forkcnt, EV_FORK);
1940 call_pending (EV_A);
1941 }
1942#endif
1943
1944 /* queue prepare watchers (and execute them) */
1945 if (expect_false (preparecnt))
1946 {
1947 queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE);
1948 call_pending (EV_A);
1949 }
1950
1951 if (expect_false (!activecnt))
1952 break;
1953
1954 /* we might have forked, so reify kernel state if necessary */
1955 if (expect_false (postfork))
1956 loop_fork (EV_A);
1957
367 /* update fd-related kernel structures */ 1958 /* update fd-related kernel structures */
368 fd_reify (); 1959 fd_reify (EV_A);
369 1960
370 /* calculate blocking time */ 1961 /* calculate blocking time */
371 if (flags & EVLOOP_NONBLOCK) 1962 {
372 block = 0.; 1963 ev_tstamp waittime = 0.;
373 else 1964 ev_tstamp sleeptime = 0.;
1965
1966 if (expect_true (!(flags & EVLOOP_NONBLOCK || idleall || !activecnt)))
374 { 1967 {
1968 /* update time to cancel out callback processing overhead */
1969 time_update (EV_A_ 1e100);
1970
375 block = MAX_BLOCKTIME; 1971 waittime = MAX_BLOCKTIME;
376 1972
377 if (rtimercnt) 1973 if (timercnt)
378 { 1974 {
379 ev_tstamp to = rtimers [0]->at - get_clock () + method_fudge; 1975 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
380 if (block > to) block = to; 1976 if (waittime > to) waittime = to;
381 } 1977 }
382 1978
1979#if EV_PERIODIC_ENABLE
383 if (atimercnt) 1980 if (periodiccnt)
384 { 1981 {
385 ev_tstamp to = atimers [0]->at - ev_time () + method_fudge; 1982 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
386 if (block > to) block = to; 1983 if (waittime > to) waittime = to;
387 } 1984 }
1985#endif
388 1986
389 if (block < 0.) block = 0.; 1987 if (expect_false (waittime < timeout_blocktime))
1988 waittime = timeout_blocktime;
1989
1990 sleeptime = waittime - backend_fudge;
1991
1992 if (expect_true (sleeptime > io_blocktime))
1993 sleeptime = io_blocktime;
1994
1995 if (sleeptime)
1996 {
1997 ev_sleep (sleeptime);
1998 waittime -= sleeptime;
1999 }
390 } 2000 }
391 2001
392 method_poll (block); 2002 ++loop_count;
2003 backend_poll (EV_A_ waittime);
393 2004
394 /* update ev_now, do magic */ 2005 /* update ev_rt_now, do magic */
395 time_update (); 2006 time_update (EV_A_ waittime + sleeptime);
2007 }
396 2008
397 /* put pending timers into pendign queue and reschedule them */ 2009 /* queue pending timers and reschedule them */
398 /* absolute timers first */ 2010 timers_reify (EV_A); /* relative timers called last */
399 timers_reify (atimers, atimercnt, ev_now); 2011#if EV_PERIODIC_ENABLE
400 /* relative timers second */ 2012 periodics_reify (EV_A); /* absolute timers called first */
401 timers_reify (rtimers, rtimercnt, now); 2013#endif
402 2014
2015#if EV_IDLE_ENABLE
2016 /* queue idle watchers unless other events are pending */
2017 idle_reify (EV_A);
2018#endif
2019
2020 /* queue check watchers, to be executed first */
2021 if (expect_false (checkcnt))
2022 queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK);
2023
403 call_pending (); 2024 call_pending (EV_A);
404 } 2025 }
405 while (!ev_loop_done); 2026 while (expect_true (
406} 2027 activecnt
2028 && !loop_done
2029 && !(flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK))
2030 ));
407 2031
408static void 2032 if (loop_done == EVUNLOOP_ONE)
409wlist_add (struct ev_watcher_list **head, struct ev_watcher_list *elem) 2033 loop_done = EVUNLOOP_CANCEL;
2034}
2035
2036void
2037ev_unloop (EV_P_ int how)
2038{
2039 loop_done = how;
2040}
2041
2042/*****************************************************************************/
2043
2044void inline_size
2045wlist_add (WL *head, WL elem)
410{ 2046{
411 elem->next = *head; 2047 elem->next = *head;
412 *head = elem; 2048 *head = elem;
413} 2049}
414 2050
415static void 2051void inline_size
416wlist_del (struct ev_watcher_list **head, struct ev_watcher_list *elem) 2052wlist_del (WL *head, WL elem)
417{ 2053{
418 while (*head) 2054 while (*head)
419 { 2055 {
420 if (*head == elem) 2056 if (*head == elem)
421 { 2057 {
… …
425 2061
426 head = &(*head)->next; 2062 head = &(*head)->next;
427 } 2063 }
428} 2064}
429 2065
2066void inline_speed
2067clear_pending (EV_P_ W w)
2068{
2069 if (w->pending)
2070 {
2071 pendings [ABSPRI (w)][w->pending - 1].w = 0;
2072 w->pending = 0;
2073 }
2074}
2075
2076int
2077ev_clear_pending (EV_P_ void *w)
2078{
2079 W w_ = (W)w;
2080 int pending = w_->pending;
2081
2082 if (expect_true (pending))
2083 {
2084 ANPENDING *p = pendings [ABSPRI (w_)] + pending - 1;
2085 w_->pending = 0;
2086 p->w = 0;
2087 return p->events;
2088 }
2089 else
2090 return 0;
2091}
2092
2093void inline_size
2094pri_adjust (EV_P_ W w)
2095{
2096 int pri = w->priority;
2097 pri = pri < EV_MINPRI ? EV_MINPRI : pri;
2098 pri = pri > EV_MAXPRI ? EV_MAXPRI : pri;
2099 w->priority = pri;
2100}
2101
2102void inline_speed
2103ev_start (EV_P_ W w, int active)
2104{
2105 pri_adjust (EV_A_ w);
2106 w->active = active;
2107 ev_ref (EV_A);
2108}
2109
2110void inline_size
2111ev_stop (EV_P_ W w)
2112{
2113 ev_unref (EV_A);
2114 w->active = 0;
2115}
2116
2117/*****************************************************************************/
2118
2119void noinline
2120ev_io_start (EV_P_ ev_io *w)
2121{
2122 int fd = w->fd;
2123
2124 if (expect_false (ev_is_active (w)))
2125 return;
2126
2127 assert (("ev_io_start called with negative fd", fd >= 0));
2128
2129 EV_FREQUENT_CHECK;
2130
2131 ev_start (EV_A_ (W)w, 1);
2132 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
2133 wlist_add (&anfds[fd].head, (WL)w);
2134
2135 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
2136 w->events &= ~EV_IOFDSET;
2137
2138 EV_FREQUENT_CHECK;
2139}
2140
2141void noinline
2142ev_io_stop (EV_P_ ev_io *w)
2143{
2144 clear_pending (EV_A_ (W)w);
2145 if (expect_false (!ev_is_active (w)))
2146 return;
2147
2148 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2149
2150 EV_FREQUENT_CHECK;
2151
2152 wlist_del (&anfds[w->fd].head, (WL)w);
2153 ev_stop (EV_A_ (W)w);
2154
2155 fd_change (EV_A_ w->fd, 1);
2156
2157 EV_FREQUENT_CHECK;
2158}
2159
2160void noinline
2161ev_timer_start (EV_P_ ev_timer *w)
2162{
2163 if (expect_false (ev_is_active (w)))
2164 return;
2165
2166 ev_at (w) += mn_now;
2167
2168 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2169
2170 EV_FREQUENT_CHECK;
2171
2172 ++timercnt;
2173 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2174 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2175 ANHE_w (timers [ev_active (w)]) = (WT)w;
2176 ANHE_at_cache (timers [ev_active (w)]);
2177 upheap (timers, ev_active (w));
2178
2179 EV_FREQUENT_CHECK;
2180
2181 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
2182}
2183
2184void noinline
2185ev_timer_stop (EV_P_ ev_timer *w)
2186{
2187 clear_pending (EV_A_ (W)w);
2188 if (expect_false (!ev_is_active (w)))
2189 return;
2190
2191 EV_FREQUENT_CHECK;
2192
2193 {
2194 int active = ev_active (w);
2195
2196 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2197
2198 --timercnt;
2199
2200 if (expect_true (active < timercnt + HEAP0))
2201 {
2202 timers [active] = timers [timercnt + HEAP0];
2203 adjustheap (timers, timercnt, active);
2204 }
2205 }
2206
2207 EV_FREQUENT_CHECK;
2208
2209 ev_at (w) -= mn_now;
2210
2211 ev_stop (EV_A_ (W)w);
2212}
2213
2214void noinline
2215ev_timer_again (EV_P_ ev_timer *w)
2216{
2217 EV_FREQUENT_CHECK;
2218
2219 if (ev_is_active (w))
2220 {
2221 if (w->repeat)
2222 {
2223 ev_at (w) = mn_now + w->repeat;
2224 ANHE_at_cache (timers [ev_active (w)]);
2225 adjustheap (timers, timercnt, ev_active (w));
2226 }
2227 else
2228 ev_timer_stop (EV_A_ w);
2229 }
2230 else if (w->repeat)
2231 {
2232 ev_at (w) = w->repeat;
2233 ev_timer_start (EV_A_ w);
2234 }
2235
2236 EV_FREQUENT_CHECK;
2237}
2238
2239#if EV_PERIODIC_ENABLE
2240void noinline
2241ev_periodic_start (EV_P_ ev_periodic *w)
2242{
2243 if (expect_false (ev_is_active (w)))
2244 return;
2245
2246 if (w->reschedule_cb)
2247 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
2248 else if (w->interval)
2249 {
2250 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.));
2251 /* this formula differs from the one in periodic_reify because we do not always round up */
2252 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2253 }
2254 else
2255 ev_at (w) = w->offset;
2256
2257 EV_FREQUENT_CHECK;
2258
2259 ++periodiccnt;
2260 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2261 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2262 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2263 ANHE_at_cache (periodics [ev_active (w)]);
2264 upheap (periodics, ev_active (w));
2265
2266 EV_FREQUENT_CHECK;
2267
2268 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2269}
2270
2271void noinline
2272ev_periodic_stop (EV_P_ ev_periodic *w)
2273{
2274 clear_pending (EV_A_ (W)w);
2275 if (expect_false (!ev_is_active (w)))
2276 return;
2277
2278 EV_FREQUENT_CHECK;
2279
2280 {
2281 int active = ev_active (w);
2282
2283 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2284
2285 --periodiccnt;
2286
2287 if (expect_true (active < periodiccnt + HEAP0))
2288 {
2289 periodics [active] = periodics [periodiccnt + HEAP0];
2290 adjustheap (periodics, periodiccnt, active);
2291 }
2292 }
2293
2294 EV_FREQUENT_CHECK;
2295
2296 ev_stop (EV_A_ (W)w);
2297}
2298
2299void noinline
2300ev_periodic_again (EV_P_ ev_periodic *w)
2301{
2302 /* TODO: use adjustheap and recalculation */
2303 ev_periodic_stop (EV_A_ w);
2304 ev_periodic_start (EV_A_ w);
2305}
2306#endif
2307
2308#ifndef SA_RESTART
2309# define SA_RESTART 0
2310#endif
2311
2312void noinline
2313ev_signal_start (EV_P_ ev_signal *w)
2314{
2315#if EV_MULTIPLICITY
2316 assert (("signal watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2317#endif
2318 if (expect_false (ev_is_active (w)))
2319 return;
2320
2321 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2322
2323 evpipe_init (EV_A);
2324
2325 EV_FREQUENT_CHECK;
2326
2327 {
2328#ifndef _WIN32
2329 sigset_t full, prev;
2330 sigfillset (&full);
2331 sigprocmask (SIG_SETMASK, &full, &prev);
2332#endif
2333
2334 array_needsize (ANSIG, signals, signalmax, w->signum, signals_init);
2335
2336#ifndef _WIN32
2337 sigprocmask (SIG_SETMASK, &prev, 0);
2338#endif
2339 }
2340
2341 ev_start (EV_A_ (W)w, 1);
2342 wlist_add (&signals [w->signum - 1].head, (WL)w);
2343
2344 if (!((WL)w)->next)
2345 {
2346#if _WIN32
2347 signal (w->signum, ev_sighandler);
2348#else
2349 struct sigaction sa;
2350 sa.sa_handler = ev_sighandler;
2351 sigfillset (&sa.sa_mask);
2352 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2353 sigaction (w->signum, &sa, 0);
2354#endif
2355 }
2356
2357 EV_FREQUENT_CHECK;
2358}
2359
2360void noinline
2361ev_signal_stop (EV_P_ ev_signal *w)
2362{
2363 clear_pending (EV_A_ (W)w);
2364 if (expect_false (!ev_is_active (w)))
2365 return;
2366
2367 EV_FREQUENT_CHECK;
2368
2369 wlist_del (&signals [w->signum - 1].head, (WL)w);
2370 ev_stop (EV_A_ (W)w);
2371
2372 if (!signals [w->signum - 1].head)
2373 signal (w->signum, SIG_DFL);
2374
2375 EV_FREQUENT_CHECK;
2376}
2377
2378void
2379ev_child_start (EV_P_ ev_child *w)
2380{
2381#if EV_MULTIPLICITY
2382 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2383#endif
2384 if (expect_false (ev_is_active (w)))
2385 return;
2386
2387 EV_FREQUENT_CHECK;
2388
2389 ev_start (EV_A_ (W)w, 1);
2390 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2391
2392 EV_FREQUENT_CHECK;
2393}
2394
2395void
2396ev_child_stop (EV_P_ ev_child *w)
2397{
2398 clear_pending (EV_A_ (W)w);
2399 if (expect_false (!ev_is_active (w)))
2400 return;
2401
2402 EV_FREQUENT_CHECK;
2403
2404 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2405 ev_stop (EV_A_ (W)w);
2406
2407 EV_FREQUENT_CHECK;
2408}
2409
2410#if EV_STAT_ENABLE
2411
2412# ifdef _WIN32
2413# undef lstat
2414# define lstat(a,b) _stati64 (a,b)
2415# endif
2416
2417#define DEF_STAT_INTERVAL 5.0074891
2418#define MIN_STAT_INTERVAL 0.1074891
2419
2420static void noinline stat_timer_cb (EV_P_ ev_timer *w_, int revents);
2421
2422#if EV_USE_INOTIFY
2423# define EV_INOTIFY_BUFSIZE 8192
2424
2425static void noinline
2426infy_add (EV_P_ ev_stat *w)
2427{
2428 w->wd = inotify_add_watch (fs_fd, w->path, IN_ATTRIB | IN_DELETE_SELF | IN_MOVE_SELF | IN_MODIFY | IN_DONT_FOLLOW | IN_MASK_ADD);
2429
2430 if (w->wd < 0)
2431 {
2432 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2433
2434 /* monitor some parent directory for speedup hints */
2435 /* note that exceeding the hardcoded limit is not a correctness issue, */
2436 /* but an efficiency issue only */
2437 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2438 {
2439 char path [4096];
2440 strcpy (path, w->path);
2441
2442 do
2443 {
2444 int mask = IN_MASK_ADD | IN_DELETE_SELF | IN_MOVE_SELF
2445 | (errno == EACCES ? IN_ATTRIB : IN_CREATE | IN_MOVED_TO);
2446
2447 char *pend = strrchr (path, '/');
2448
2449 if (!pend)
2450 break; /* whoops, no '/', complain to your admin */
2451
2452 *pend = 0;
2453 w->wd = inotify_add_watch (fs_fd, path, mask);
2454 }
2455 while (w->wd < 0 && (errno == ENOENT || errno == EACCES));
2456 }
2457 }
2458 else
2459 ev_timer_stop (EV_A_ &w->timer); /* we can watch this in a race-free way */
2460
2461 if (w->wd >= 0)
2462 wlist_add (&fs_hash [w->wd & (EV_INOTIFY_HASHSIZE - 1)].head, (WL)w);
2463}
2464
2465static void noinline
2466infy_del (EV_P_ ev_stat *w)
2467{
2468 int slot;
2469 int wd = w->wd;
2470
2471 if (wd < 0)
2472 return;
2473
2474 w->wd = -2;
2475 slot = wd & (EV_INOTIFY_HASHSIZE - 1);
2476 wlist_del (&fs_hash [slot].head, (WL)w);
2477
2478 /* remove this watcher, if others are watching it, they will rearm */
2479 inotify_rm_watch (fs_fd, wd);
2480}
2481
2482static void noinline
2483infy_wd (EV_P_ int slot, int wd, struct inotify_event *ev)
2484{
2485 if (slot < 0)
2486 /* overflow, need to check for all hahs slots */
2487 for (slot = 0; slot < EV_INOTIFY_HASHSIZE; ++slot)
2488 infy_wd (EV_A_ slot, wd, ev);
2489 else
2490 {
2491 WL w_;
2492
2493 for (w_ = fs_hash [slot & (EV_INOTIFY_HASHSIZE - 1)].head; w_; )
2494 {
2495 ev_stat *w = (ev_stat *)w_;
2496 w_ = w_->next; /* lets us remove this watcher and all before it */
2497
2498 if (w->wd == wd || wd == -1)
2499 {
2500 if (ev->mask & (IN_IGNORED | IN_UNMOUNT | IN_DELETE_SELF))
2501 {
2502 w->wd = -1;
2503 infy_add (EV_A_ w); /* re-add, no matter what */
2504 }
2505
2506 stat_timer_cb (EV_A_ &w->timer, 0);
2507 }
2508 }
2509 }
2510}
2511
430static void 2512static void
431ev_start (struct ev_watcher *w, int active) 2513infy_cb (EV_P_ ev_io *w, int revents)
432{ 2514{
433 w->pending = 0; 2515 char buf [EV_INOTIFY_BUFSIZE];
434 w->active = active; 2516 struct inotify_event *ev = (struct inotify_event *)buf;
2517 int ofs;
2518 int len = read (fs_fd, buf, sizeof (buf));
2519
2520 for (ofs = 0; ofs < len; ofs += sizeof (struct inotify_event) + ev->len)
2521 infy_wd (EV_A_ ev->wd, ev->wd, ev);
2522}
2523
2524void inline_size
2525infy_init (EV_P)
2526{
2527 if (fs_fd != -2)
2528 return;
2529
2530 fs_fd = inotify_init ();
2531
2532 if (fs_fd >= 0)
2533 {
2534 ev_io_init (&fs_w, infy_cb, fs_fd, EV_READ);
2535 ev_set_priority (&fs_w, EV_MAXPRI);
2536 ev_io_start (EV_A_ &fs_w);
2537 }
2538}
2539
2540void inline_size
2541infy_fork (EV_P)
2542{
2543 int slot;
2544
2545 if (fs_fd < 0)
2546 return;
2547
2548 close (fs_fd);
2549 fs_fd = inotify_init ();
2550
2551 for (slot = 0; slot < EV_INOTIFY_HASHSIZE; ++slot)
2552 {
2553 WL w_ = fs_hash [slot].head;
2554 fs_hash [slot].head = 0;
2555
2556 while (w_)
2557 {
2558 ev_stat *w = (ev_stat *)w_;
2559 w_ = w_->next; /* lets us add this watcher */
2560
2561 w->wd = -1;
2562
2563 if (fs_fd >= 0)
2564 infy_add (EV_A_ w); /* re-add, no matter what */
2565 else
2566 ev_timer_start (EV_A_ &w->timer);
2567 }
2568
2569 }
2570}
2571
2572#endif
2573
2574void
2575ev_stat_stat (EV_P_ ev_stat *w)
2576{
2577 if (lstat (w->path, &w->attr) < 0)
2578 w->attr.st_nlink = 0;
2579 else if (!w->attr.st_nlink)
2580 w->attr.st_nlink = 1;
2581}
2582
2583static void noinline
2584stat_timer_cb (EV_P_ ev_timer *w_, int revents)
2585{
2586 ev_stat *w = (ev_stat *)(((char *)w_) - offsetof (ev_stat, timer));
2587
2588 /* we copy this here each the time so that */
2589 /* prev has the old value when the callback gets invoked */
2590 w->prev = w->attr;
2591 ev_stat_stat (EV_A_ w);
2592
2593 /* memcmp doesn't work on netbsd, they.... do stuff to their struct stat */
2594 if (
2595 w->prev.st_dev != w->attr.st_dev
2596 || w->prev.st_ino != w->attr.st_ino
2597 || w->prev.st_mode != w->attr.st_mode
2598 || w->prev.st_nlink != w->attr.st_nlink
2599 || w->prev.st_uid != w->attr.st_uid
2600 || w->prev.st_gid != w->attr.st_gid
2601 || w->prev.st_rdev != w->attr.st_rdev
2602 || w->prev.st_size != w->attr.st_size
2603 || w->prev.st_atime != w->attr.st_atime
2604 || w->prev.st_mtime != w->attr.st_mtime
2605 || w->prev.st_ctime != w->attr.st_ctime
2606 ) {
2607 #if EV_USE_INOTIFY
2608 infy_del (EV_A_ w);
2609 infy_add (EV_A_ w);
2610 ev_stat_stat (EV_A_ w); /* avoid race... */
2611 #endif
2612
2613 ev_feed_event (EV_A_ w, EV_STAT);
2614 }
2615}
2616
2617void
2618ev_stat_start (EV_P_ ev_stat *w)
2619{
2620 if (expect_false (ev_is_active (w)))
2621 return;
2622
2623 /* since we use memcmp, we need to clear any padding data etc. */
2624 memset (&w->prev, 0, sizeof (ev_statdata));
2625 memset (&w->attr, 0, sizeof (ev_statdata));
2626
2627 ev_stat_stat (EV_A_ w);
2628
2629 if (w->interval < MIN_STAT_INTERVAL)
2630 w->interval = w->interval ? MIN_STAT_INTERVAL : DEF_STAT_INTERVAL;
2631
2632 ev_timer_init (&w->timer, stat_timer_cb, w->interval, w->interval);
2633 ev_set_priority (&w->timer, ev_priority (w));
2634
2635#if EV_USE_INOTIFY
2636 infy_init (EV_A);
2637
2638 if (fs_fd >= 0)
2639 infy_add (EV_A_ w);
2640 else
2641#endif
2642 ev_timer_start (EV_A_ &w->timer);
2643
2644 ev_start (EV_A_ (W)w, 1);
2645
2646 EV_FREQUENT_CHECK;
2647}
2648
2649void
2650ev_stat_stop (EV_P_ ev_stat *w)
2651{
2652 clear_pending (EV_A_ (W)w);
2653 if (expect_false (!ev_is_active (w)))
2654 return;
2655
2656 EV_FREQUENT_CHECK;
2657
2658#if EV_USE_INOTIFY
2659 infy_del (EV_A_ w);
2660#endif
2661 ev_timer_stop (EV_A_ &w->timer);
2662
2663 ev_stop (EV_A_ (W)w);
2664
2665 EV_FREQUENT_CHECK;
2666}
2667#endif
2668
2669#if EV_IDLE_ENABLE
2670void
2671ev_idle_start (EV_P_ ev_idle *w)
2672{
2673 if (expect_false (ev_is_active (w)))
2674 return;
2675
2676 pri_adjust (EV_A_ (W)w);
2677
2678 EV_FREQUENT_CHECK;
2679
2680 {
2681 int active = ++idlecnt [ABSPRI (w)];
2682
2683 ++idleall;
2684 ev_start (EV_A_ (W)w, active);
2685
2686 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2687 idles [ABSPRI (w)][active - 1] = w;
2688 }
2689
2690 EV_FREQUENT_CHECK;
2691}
2692
2693void
2694ev_idle_stop (EV_P_ ev_idle *w)
2695{
2696 clear_pending (EV_A_ (W)w);
2697 if (expect_false (!ev_is_active (w)))
2698 return;
2699
2700 EV_FREQUENT_CHECK;
2701
2702 {
2703 int active = ev_active (w);
2704
2705 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2706 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2707
2708 ev_stop (EV_A_ (W)w);
2709 --idleall;
2710 }
2711
2712 EV_FREQUENT_CHECK;
2713}
2714#endif
2715
2716void
2717ev_prepare_start (EV_P_ ev_prepare *w)
2718{
2719 if (expect_false (ev_is_active (w)))
2720 return;
2721
2722 EV_FREQUENT_CHECK;
2723
2724 ev_start (EV_A_ (W)w, ++preparecnt);
2725 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2726 prepares [preparecnt - 1] = w;
2727
2728 EV_FREQUENT_CHECK;
2729}
2730
2731void
2732ev_prepare_stop (EV_P_ ev_prepare *w)
2733{
2734 clear_pending (EV_A_ (W)w);
2735 if (expect_false (!ev_is_active (w)))
2736 return;
2737
2738 EV_FREQUENT_CHECK;
2739
2740 {
2741 int active = ev_active (w);
2742
2743 prepares [active - 1] = prepares [--preparecnt];
2744 ev_active (prepares [active - 1]) = active;
2745 }
2746
2747 ev_stop (EV_A_ (W)w);
2748
2749 EV_FREQUENT_CHECK;
2750}
2751
2752void
2753ev_check_start (EV_P_ ev_check *w)
2754{
2755 if (expect_false (ev_is_active (w)))
2756 return;
2757
2758 EV_FREQUENT_CHECK;
2759
2760 ev_start (EV_A_ (W)w, ++checkcnt);
2761 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2762 checks [checkcnt - 1] = w;
2763
2764 EV_FREQUENT_CHECK;
2765}
2766
2767void
2768ev_check_stop (EV_P_ ev_check *w)
2769{
2770 clear_pending (EV_A_ (W)w);
2771 if (expect_false (!ev_is_active (w)))
2772 return;
2773
2774 EV_FREQUENT_CHECK;
2775
2776 {
2777 int active = ev_active (w);
2778
2779 checks [active - 1] = checks [--checkcnt];
2780 ev_active (checks [active - 1]) = active;
2781 }
2782
2783 ev_stop (EV_A_ (W)w);
2784
2785 EV_FREQUENT_CHECK;
2786}
2787
2788#if EV_EMBED_ENABLE
2789void noinline
2790ev_embed_sweep (EV_P_ ev_embed *w)
2791{
2792 ev_loop (w->other, EVLOOP_NONBLOCK);
435} 2793}
436 2794
437static void 2795static void
438ev_stop (struct ev_watcher *w) 2796embed_io_cb (EV_P_ ev_io *io, int revents)
439{ 2797{
440 if (w->pending) 2798 ev_embed *w = (ev_embed *)(((char *)io) - offsetof (ev_embed, io));
441 pendings [w->pending - 1].w = 0;
442 2799
443 w->active = 0;
444 /* nop */
445}
446
447void
448evio_start (struct ev_io *w)
449{
450 if (ev_is_active (w)) 2800 if (ev_cb (w))
2801 ev_feed_event (EV_A_ (W)w, EV_EMBED);
2802 else
2803 ev_loop (w->other, EVLOOP_NONBLOCK);
2804}
2805
2806static void
2807embed_prepare_cb (EV_P_ ev_prepare *prepare, int revents)
2808{
2809 ev_embed *w = (ev_embed *)(((char *)prepare) - offsetof (ev_embed, prepare));
2810
2811 {
2812 struct ev_loop *loop = w->other;
2813
2814 while (fdchangecnt)
2815 {
2816 fd_reify (EV_A);
2817 ev_loop (EV_A_ EVLOOP_NONBLOCK);
2818 }
2819 }
2820}
2821
2822#if 0
2823static void
2824embed_idle_cb (EV_P_ ev_idle *idle, int revents)
2825{
2826 ev_idle_stop (EV_A_ idle);
2827}
2828#endif
2829
2830void
2831ev_embed_start (EV_P_ ev_embed *w)
2832{
2833 if (expect_false (ev_is_active (w)))
451 return; 2834 return;
452 2835
453 int fd = w->fd; 2836 {
2837 struct ev_loop *loop = w->other;
2838 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2839 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2840 }
454 2841
455 ev_start ((struct ev_watcher *)w, 1); 2842 EV_FREQUENT_CHECK;
456 array_needsize (anfds, anfdmax, fd + 1, anfds_init);
457 wlist_add ((struct ev_watcher_list **)&anfds[fd].head, (struct ev_watcher_list *)w);
458 2843
459 ++fdchangecnt; 2844 ev_set_priority (&w->io, ev_priority (w));
460 array_needsize (fdchanges, fdchangemax, fdchangecnt, ); 2845 ev_io_start (EV_A_ &w->io);
461 fdchanges [fdchangecnt - 1] = fd;
462}
463 2846
2847 ev_prepare_init (&w->prepare, embed_prepare_cb);
2848 ev_set_priority (&w->prepare, EV_MINPRI);
2849 ev_prepare_start (EV_A_ &w->prepare);
2850
2851 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2852
2853 ev_start (EV_A_ (W)w, 1);
2854
2855 EV_FREQUENT_CHECK;
2856}
2857
464void 2858void
465evio_stop (struct ev_io *w) 2859ev_embed_stop (EV_P_ ev_embed *w)
466{ 2860{
2861 clear_pending (EV_A_ (W)w);
467 if (!ev_is_active (w)) 2862 if (expect_false (!ev_is_active (w)))
468 return; 2863 return;
469 2864
470 wlist_del ((struct ev_watcher_list **)&anfds[w->fd].head, (struct ev_watcher_list *)w); 2865 EV_FREQUENT_CHECK;
471 ev_stop ((struct ev_watcher *)w);
472 2866
473 ++fdchangecnt; 2867 ev_io_stop (EV_A_ &w->io);
474 array_needsize (fdchanges, fdchangemax, fdchangecnt, ); 2868 ev_prepare_stop (EV_A_ &w->prepare);
475 fdchanges [fdchangecnt - 1] = w->fd;
476}
477 2869
2870 ev_stop (EV_A_ (W)w);
2871
2872 EV_FREQUENT_CHECK;
2873}
2874#endif
2875
2876#if EV_FORK_ENABLE
478void 2877void
479evtimer_start (struct ev_timer *w) 2878ev_fork_start (EV_P_ ev_fork *w)
480{ 2879{
481 if (ev_is_active (w)) 2880 if (expect_false (ev_is_active (w)))
482 return; 2881 return;
483 2882
484 if (w->is_abs) 2883 EV_FREQUENT_CHECK;
485 {
486 /* this formula differs from the one in timer_reify becuse we do not round up */
487 if (w->repeat)
488 w->at += ceil ((ev_now - w->at) / w->repeat) * w->repeat;
489 2884
490 ev_start ((struct ev_watcher *)w, ++atimercnt); 2885 ev_start (EV_A_ (W)w, ++forkcnt);
491 array_needsize (atimers, atimermax, atimercnt, ); 2886 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
492 atimers [atimercnt - 1] = w; 2887 forks [forkcnt - 1] = w;
493 upheap (atimers, atimercnt - 1);
494 }
495 else
496 {
497 w->at += now;
498 2888
499 ev_start ((struct ev_watcher *)w, ++rtimercnt); 2889 EV_FREQUENT_CHECK;
500 array_needsize (rtimers, rtimermax, rtimercnt, );
501 rtimers [rtimercnt - 1] = w;
502 upheap (rtimers, rtimercnt - 1);
503 }
504
505} 2890}
506 2891
507void 2892void
508evtimer_stop (struct ev_timer *w) 2893ev_fork_stop (EV_P_ ev_fork *w)
509{ 2894{
2895 clear_pending (EV_A_ (W)w);
510 if (!ev_is_active (w)) 2896 if (expect_false (!ev_is_active (w)))
511 return; 2897 return;
512 2898
513 if (w->is_abs) 2899 EV_FREQUENT_CHECK;
2900
514 { 2901 {
515 if (w->active < atimercnt--) 2902 int active = ev_active (w);
516 { 2903
517 atimers [w->active - 1] = atimers [atimercnt]; 2904 forks [active - 1] = forks [--forkcnt];
518 downheap (atimers, atimercnt, w->active - 1); 2905 ev_active (forks [active - 1]) = active;
519 }
520 } 2906 }
521 else
522 {
523 if (w->active < rtimercnt--)
524 {
525 rtimers [w->active - 1] = rtimers [rtimercnt];
526 downheap (rtimers, rtimercnt, w->active - 1);
527 }
528 }
529 2907
530 ev_stop ((struct ev_watcher *)w); 2908 ev_stop (EV_A_ (W)w);
531}
532 2909
2910 EV_FREQUENT_CHECK;
2911}
2912#endif
2913
2914#if EV_ASYNC_ENABLE
533void 2915void
534evsignal_start (struct ev_signal *w) 2916ev_async_start (EV_P_ ev_async *w)
535{ 2917{
536 if (ev_is_active (w)) 2918 if (expect_false (ev_is_active (w)))
537 return; 2919 return;
538 2920
539 ev_start ((struct ev_watcher *)w, 1); 2921 evpipe_init (EV_A);
540 array_needsize (signals, signalmax, w->signum, signals_init);
541 wlist_add ((struct ev_watcher_list **)&signals [w->signum - 1], (struct ev_watcher_list *)w);
542}
543 2922
2923 EV_FREQUENT_CHECK;
2924
2925 ev_start (EV_A_ (W)w, ++asynccnt);
2926 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2927 asyncs [asynccnt - 1] = w;
2928
2929 EV_FREQUENT_CHECK;
2930}
2931
544void 2932void
545evsignal_stop (struct ev_signal *w) 2933ev_async_stop (EV_P_ ev_async *w)
546{ 2934{
2935 clear_pending (EV_A_ (W)w);
547 if (!ev_is_active (w)) 2936 if (expect_false (!ev_is_active (w)))
548 return; 2937 return;
549 2938
550 wlist_del ((struct ev_watcher_list **)&signals [w->signum - 1], (struct ev_watcher_list *)w); 2939 EV_FREQUENT_CHECK;
551 ev_stop ((struct ev_watcher *)w); 2940
2941 {
2942 int active = ev_active (w);
2943
2944 asyncs [active - 1] = asyncs [--asynccnt];
2945 ev_active (asyncs [active - 1]) = active;
2946 }
2947
2948 ev_stop (EV_A_ (W)w);
2949
2950 EV_FREQUENT_CHECK;
552} 2951}
2952
2953void
2954ev_async_send (EV_P_ ev_async *w)
2955{
2956 w->sent = 1;
2957 evpipe_write (EV_A_ &gotasync);
2958}
2959#endif
553 2960
554/*****************************************************************************/ 2961/*****************************************************************************/
555#if 1 2962
2963struct ev_once
2964{
2965 ev_io io;
2966 ev_timer to;
2967 void (*cb)(int revents, void *arg);
2968 void *arg;
2969};
556 2970
557static void 2971static void
558sin_cb (struct ev_io *w, int revents) 2972once_cb (EV_P_ struct ev_once *once, int revents)
559{ 2973{
560 fprintf (stderr, "sin %d, revents %d\n", w->fd, revents); 2974 void (*cb)(int revents, void *arg) = once->cb;
2975 void *arg = once->arg;
2976
2977 ev_io_stop (EV_A_ &once->io);
2978 ev_timer_stop (EV_A_ &once->to);
2979 ev_free (once);
2980
2981 cb (revents, arg);
561} 2982}
562 2983
563static void 2984static void
2985once_cb_io (EV_P_ ev_io *w, int revents)
2986{
2987 once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents);
2988}
2989
2990static void
564ocb (struct ev_timer *w, int revents) 2991once_cb_to (EV_P_ ev_timer *w, int revents)
565{ 2992{
566 //fprintf (stderr, "timer %f,%f (%x) (%f) d%p\n", w->at, w->repeat, revents, w->at - ev_time (), w->data); 2993 once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents);
567 evtimer_stop (w);
568 evtimer_start (w);
569} 2994}
570 2995
571int main (void) 2996void
2997ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg)
572{ 2998{
573 struct ev_io sin; 2999 struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once));
574 3000
575 ev_init (0); 3001 if (expect_false (!once))
576
577 evw_init (&sin, sin_cb, 55);
578 evio_set (&sin, 0, EV_READ);
579 evio_start (&sin);
580
581 struct ev_timer t[10000];
582
583#if 1
584 int i;
585 for (i = 0; i < 10000; ++i)
586 {
587 struct ev_timer *w = t + i;
588 evw_init (w, ocb, i);
589 evtimer_set_abs (w, drand48 (), 0.99775533);
590 evtimer_start (w);
591 if (drand48 () < 0.5)
592 evtimer_stop (w);
593 } 3002 {
594#endif 3003 cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg);
595
596 struct ev_timer t1;
597 evw_init (&t1, ocb, 0);
598 evtimer_set_abs (&t1, 5, 10);
599 evtimer_start (&t1);
600
601 ev_loop (0);
602
603 return 0; 3004 return;
604} 3005 }
605 3006
606#endif 3007 once->cb = cb;
3008 once->arg = arg;
607 3009
3010 ev_init (&once->io, once_cb_io);
3011 if (fd >= 0)
3012 {
3013 ev_io_set (&once->io, fd, events);
3014 ev_io_start (EV_A_ &once->io);
3015 }
608 3016
3017 ev_init (&once->to, once_cb_to);
3018 if (timeout >= 0.)
3019 {
3020 ev_timer_set (&once->to, timeout, 0.);
3021 ev_timer_start (EV_A_ &once->to);
3022 }
3023}
609 3024
3025#if EV_MULTIPLICITY
3026 #include "ev_wrap.h"
3027#endif
610 3028
3029#ifdef __cplusplus
3030}
3031#endif
3032

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines