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

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

Diff Legend

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