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

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

Diff Legend

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