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

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

Diff Legend

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