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

Comparing libev/ev.c (file contents):
Revision 1.27 by root, Wed Oct 31 22:16:36 2007 UTC vs.
Revision 1.268 by root, Mon Oct 27 13:39:18 2008 UTC

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

Diff Legend

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