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

Comparing libev/ev.c (file contents):
Revision 1.57 by root, Sun Nov 4 16:43:53 2007 UTC vs.
Revision 1.289 by root, Sat Jun 6 11:13:16 2009 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines