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

Comparing libev/ev.c (file contents):
Revision 1.28 by root, Thu Nov 1 06:48:49 2007 UTC vs.
Revision 1.271 by root, Mon Nov 3 12:13:15 2008 UTC

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

Diff Legend

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