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

Comparing libev/ev.c (file contents):
Revision 1.135 by root, Sat Nov 24 06:23:27 2007 UTC vs.
Revision 1.245 by root, Wed May 21 00:26:01 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines