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

Comparing libev/ev.c (file contents):
Revision 1.65 by root, Sun Nov 4 23:29:48 2007 UTC vs.
Revision 1.272 by root, Mon Nov 3 12:17:40 2008 UTC

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

Diff Legend

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