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

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

Diff Legend

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