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

Comparing libev/ev.c (file contents):
Revision 1.47 by root, Sat Nov 3 11:44:44 2007 UTC vs.
Revision 1.251 by root, Thu May 22 03:42:34 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines