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

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

Diff Legend

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