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

Diff Legend

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