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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines