1 |
/* |
2 |
* libev event processing core, watcher management |
3 |
* |
4 |
* Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
5 |
* All rights reserved. |
6 |
* |
7 |
* Redistribution and use in source and binary forms, with or without |
8 |
* modification, are permitted provided that the following conditions are |
9 |
* met: |
10 |
* |
11 |
* * Redistributions of source code must retain the above copyright |
12 |
* notice, this list of conditions and the following disclaimer. |
13 |
* |
14 |
* * Redistributions in binary form must reproduce the above |
15 |
* copyright notice, this list of conditions and the following |
16 |
* disclaimer in the documentation and/or other materials provided |
17 |
* with the distribution. |
18 |
* |
19 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
20 |
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
21 |
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
22 |
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
23 |
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
24 |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
25 |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
26 |
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
27 |
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
28 |
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
29 |
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 |
*/ |
31 |
|
32 |
#ifdef __cplusplus |
33 |
extern "C" { |
34 |
#endif |
35 |
|
36 |
#ifndef EV_STANDALONE |
37 |
# include "config.h" |
38 |
|
39 |
# if HAVE_CLOCK_GETTIME |
40 |
# ifndef EV_USE_MONOTONIC |
41 |
# define EV_USE_MONOTONIC 1 |
42 |
# endif |
43 |
# ifndef EV_USE_REALTIME |
44 |
# define EV_USE_REALTIME 1 |
45 |
# endif |
46 |
# endif |
47 |
|
48 |
# if HAVE_SELECT && HAVE_SYS_SELECT_H && !defined (EV_USE_SELECT) |
49 |
# define EV_USE_SELECT 1 |
50 |
# endif |
51 |
|
52 |
# if HAVE_POLL && HAVE_POLL_H && !defined (EV_USE_POLL) |
53 |
# define EV_USE_POLL 1 |
54 |
# endif |
55 |
|
56 |
# if HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H && !defined (EV_USE_EPOLL) |
57 |
# define EV_USE_EPOLL 1 |
58 |
# endif |
59 |
|
60 |
# if HAVE_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H && !defined (EV_USE_KQUEUE) |
61 |
# define EV_USE_KQUEUE 1 |
62 |
# endif |
63 |
|
64 |
#endif |
65 |
|
66 |
#include <math.h> |
67 |
#include <stdlib.h> |
68 |
#include <fcntl.h> |
69 |
#include <stddef.h> |
70 |
|
71 |
#include <stdio.h> |
72 |
|
73 |
#include <assert.h> |
74 |
#include <errno.h> |
75 |
#include <sys/types.h> |
76 |
#include <time.h> |
77 |
|
78 |
#include <signal.h> |
79 |
|
80 |
#ifndef _WIN32 |
81 |
# include <unistd.h> |
82 |
# include <sys/time.h> |
83 |
# include <sys/wait.h> |
84 |
#else |
85 |
# define WIN32_LEAN_AND_MEAN |
86 |
# include <windows.h> |
87 |
# ifndef EV_SELECT_IS_WINSOCKET |
88 |
# define EV_SELECT_IS_WINSOCKET 1 |
89 |
# endif |
90 |
#endif |
91 |
|
92 |
/**/ |
93 |
|
94 |
#ifndef EV_USE_MONOTONIC |
95 |
# define EV_USE_MONOTONIC 1 |
96 |
#endif |
97 |
|
98 |
#ifndef EV_USE_SELECT |
99 |
# define EV_USE_SELECT 1 |
100 |
# define EV_SELECT_USE_FD_SET 1 |
101 |
#endif |
102 |
|
103 |
#ifndef EV_USE_POLL |
104 |
# ifdef _WIN32 |
105 |
# define EV_USE_POLL 0 |
106 |
# else |
107 |
# define EV_USE_POLL 1 |
108 |
# endif |
109 |
#endif |
110 |
|
111 |
#ifndef EV_USE_EPOLL |
112 |
# define EV_USE_EPOLL 0 |
113 |
#endif |
114 |
|
115 |
#ifndef EV_USE_KQUEUE |
116 |
# define EV_USE_KQUEUE 0 |
117 |
#endif |
118 |
|
119 |
#ifndef EV_USE_REALTIME |
120 |
# define EV_USE_REALTIME 1 |
121 |
#endif |
122 |
|
123 |
/**/ |
124 |
|
125 |
/* darwin simply cannot be helped */ |
126 |
#ifdef __APPLE__ |
127 |
# undef EV_USE_POLL |
128 |
# undef EV_USE_KQUEUE |
129 |
#endif |
130 |
|
131 |
#ifndef CLOCK_MONOTONIC |
132 |
# undef EV_USE_MONOTONIC |
133 |
# define EV_USE_MONOTONIC 0 |
134 |
#endif |
135 |
|
136 |
#ifndef CLOCK_REALTIME |
137 |
# undef EV_USE_REALTIME |
138 |
# define EV_USE_REALTIME 0 |
139 |
#endif |
140 |
|
141 |
#if EV_SELECT_IS_WINSOCKET |
142 |
# include <winsock.h> |
143 |
#endif |
144 |
|
145 |
/**/ |
146 |
|
147 |
#define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
148 |
#define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
149 |
#define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
150 |
/*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
151 |
|
152 |
#ifdef EV_H |
153 |
# include EV_H |
154 |
#else |
155 |
# include "ev.h" |
156 |
#endif |
157 |
|
158 |
#if __GNUC__ >= 3 |
159 |
# define expect(expr,value) __builtin_expect ((expr),(value)) |
160 |
# define inline inline |
161 |
#else |
162 |
# define expect(expr,value) (expr) |
163 |
# define inline static |
164 |
#endif |
165 |
|
166 |
#define expect_false(expr) expect ((expr) != 0, 0) |
167 |
#define expect_true(expr) expect ((expr) != 0, 1) |
168 |
|
169 |
#define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
170 |
#define ABSPRI(w) ((w)->priority - EV_MINPRI) |
171 |
|
172 |
#define EMPTY0 /* required for microsofts broken pseudo-c compiler */ |
173 |
#define EMPTY2(a,b) /* used to suppress some warnings */ |
174 |
|
175 |
typedef struct ev_watcher *W; |
176 |
typedef struct ev_watcher_list *WL; |
177 |
typedef struct ev_watcher_time *WT; |
178 |
|
179 |
static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
180 |
|
181 |
#ifdef _WIN32 |
182 |
# include "ev_win32.c" |
183 |
#endif |
184 |
|
185 |
/*****************************************************************************/ |
186 |
|
187 |
static void (*syserr_cb)(const char *msg); |
188 |
|
189 |
void ev_set_syserr_cb (void (*cb)(const char *msg)) |
190 |
{ |
191 |
syserr_cb = cb; |
192 |
} |
193 |
|
194 |
static void |
195 |
syserr (const char *msg) |
196 |
{ |
197 |
if (!msg) |
198 |
msg = "(libev) system error"; |
199 |
|
200 |
if (syserr_cb) |
201 |
syserr_cb (msg); |
202 |
else |
203 |
{ |
204 |
perror (msg); |
205 |
abort (); |
206 |
} |
207 |
} |
208 |
|
209 |
static void *(*alloc)(void *ptr, long size); |
210 |
|
211 |
void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
212 |
{ |
213 |
alloc = cb; |
214 |
} |
215 |
|
216 |
static void * |
217 |
ev_realloc (void *ptr, long size) |
218 |
{ |
219 |
ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
220 |
|
221 |
if (!ptr && size) |
222 |
{ |
223 |
fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
224 |
abort (); |
225 |
} |
226 |
|
227 |
return ptr; |
228 |
} |
229 |
|
230 |
#define ev_malloc(size) ev_realloc (0, (size)) |
231 |
#define ev_free(ptr) ev_realloc ((ptr), 0) |
232 |
|
233 |
/*****************************************************************************/ |
234 |
|
235 |
typedef struct |
236 |
{ |
237 |
WL head; |
238 |
unsigned char events; |
239 |
unsigned char reify; |
240 |
#if EV_SELECT_IS_WINSOCKET |
241 |
SOCKET handle; |
242 |
#endif |
243 |
} ANFD; |
244 |
|
245 |
typedef struct |
246 |
{ |
247 |
W w; |
248 |
int events; |
249 |
} ANPENDING; |
250 |
|
251 |
#if EV_MULTIPLICITY |
252 |
|
253 |
struct ev_loop |
254 |
{ |
255 |
ev_tstamp ev_rt_now; |
256 |
#define ev_rt_now ((loop)->ev_rt_now) |
257 |
#define VAR(name,decl) decl; |
258 |
#include "ev_vars.h" |
259 |
#undef VAR |
260 |
}; |
261 |
#include "ev_wrap.h" |
262 |
|
263 |
static struct ev_loop default_loop_struct; |
264 |
struct ev_loop *ev_default_loop_ptr; |
265 |
|
266 |
#else |
267 |
|
268 |
ev_tstamp ev_rt_now; |
269 |
#define VAR(name,decl) static decl; |
270 |
#include "ev_vars.h" |
271 |
#undef VAR |
272 |
|
273 |
static int ev_default_loop_ptr; |
274 |
|
275 |
#endif |
276 |
|
277 |
/*****************************************************************************/ |
278 |
|
279 |
ev_tstamp |
280 |
ev_time (void) |
281 |
{ |
282 |
#if EV_USE_REALTIME |
283 |
struct timespec ts; |
284 |
clock_gettime (CLOCK_REALTIME, &ts); |
285 |
return ts.tv_sec + ts.tv_nsec * 1e-9; |
286 |
#else |
287 |
struct timeval tv; |
288 |
gettimeofday (&tv, 0); |
289 |
return tv.tv_sec + tv.tv_usec * 1e-6; |
290 |
#endif |
291 |
} |
292 |
|
293 |
inline ev_tstamp |
294 |
get_clock (void) |
295 |
{ |
296 |
#if EV_USE_MONOTONIC |
297 |
if (expect_true (have_monotonic)) |
298 |
{ |
299 |
struct timespec ts; |
300 |
clock_gettime (CLOCK_MONOTONIC, &ts); |
301 |
return ts.tv_sec + ts.tv_nsec * 1e-9; |
302 |
} |
303 |
#endif |
304 |
|
305 |
return ev_time (); |
306 |
} |
307 |
|
308 |
#if EV_MULTIPLICITY |
309 |
ev_tstamp |
310 |
ev_now (EV_P) |
311 |
{ |
312 |
return ev_rt_now; |
313 |
} |
314 |
#endif |
315 |
|
316 |
#define array_roundsize(type,n) (((n) | 4) & ~3) |
317 |
|
318 |
#define array_needsize(type,base,cur,cnt,init) \ |
319 |
if (expect_false ((cnt) > cur)) \ |
320 |
{ \ |
321 |
int newcnt = cur; \ |
322 |
do \ |
323 |
{ \ |
324 |
newcnt = array_roundsize (type, newcnt << 1); \ |
325 |
} \ |
326 |
while ((cnt) > newcnt); \ |
327 |
\ |
328 |
base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
329 |
init (base + cur, newcnt - cur); \ |
330 |
cur = newcnt; \ |
331 |
} |
332 |
|
333 |
#define array_slim(type,stem) \ |
334 |
if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
335 |
{ \ |
336 |
stem ## max = array_roundsize (stem ## cnt >> 1); \ |
337 |
base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
338 |
fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
339 |
} |
340 |
|
341 |
#define array_free(stem, idx) \ |
342 |
ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
343 |
|
344 |
/*****************************************************************************/ |
345 |
|
346 |
static void |
347 |
anfds_init (ANFD *base, int count) |
348 |
{ |
349 |
while (count--) |
350 |
{ |
351 |
base->head = 0; |
352 |
base->events = EV_NONE; |
353 |
base->reify = 0; |
354 |
|
355 |
++base; |
356 |
} |
357 |
} |
358 |
|
359 |
void |
360 |
ev_feed_event (EV_P_ void *w, int revents) |
361 |
{ |
362 |
W w_ = (W)w; |
363 |
|
364 |
if (w_->pending) |
365 |
{ |
366 |
pendings [ABSPRI (w_)][w_->pending - 1].events |= revents; |
367 |
return; |
368 |
} |
369 |
|
370 |
w_->pending = ++pendingcnt [ABSPRI (w_)]; |
371 |
array_needsize (ANPENDING, pendings [ABSPRI (w_)], pendingmax [ABSPRI (w_)], pendingcnt [ABSPRI (w_)], EMPTY2); |
372 |
pendings [ABSPRI (w_)][w_->pending - 1].w = w_; |
373 |
pendings [ABSPRI (w_)][w_->pending - 1].events = revents; |
374 |
} |
375 |
|
376 |
static void |
377 |
queue_events (EV_P_ W *events, int eventcnt, int type) |
378 |
{ |
379 |
int i; |
380 |
|
381 |
for (i = 0; i < eventcnt; ++i) |
382 |
ev_feed_event (EV_A_ events [i], type); |
383 |
} |
384 |
|
385 |
inline void |
386 |
fd_event (EV_P_ int fd, int revents) |
387 |
{ |
388 |
ANFD *anfd = anfds + fd; |
389 |
struct ev_io *w; |
390 |
|
391 |
for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
392 |
{ |
393 |
int ev = w->events & revents; |
394 |
|
395 |
if (ev) |
396 |
ev_feed_event (EV_A_ (W)w, ev); |
397 |
} |
398 |
} |
399 |
|
400 |
void |
401 |
ev_feed_fd_event (EV_P_ int fd, int revents) |
402 |
{ |
403 |
fd_event (EV_A_ fd, revents); |
404 |
} |
405 |
|
406 |
/*****************************************************************************/ |
407 |
|
408 |
static void |
409 |
fd_reify (EV_P) |
410 |
{ |
411 |
int i; |
412 |
|
413 |
for (i = 0; i < fdchangecnt; ++i) |
414 |
{ |
415 |
int fd = fdchanges [i]; |
416 |
ANFD *anfd = anfds + fd; |
417 |
struct ev_io *w; |
418 |
|
419 |
int events = 0; |
420 |
|
421 |
for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
422 |
events |= w->events; |
423 |
|
424 |
#if EV_SELECT_IS_WINSOCKET |
425 |
if (events) |
426 |
{ |
427 |
unsigned long argp; |
428 |
anfd->handle = _get_osfhandle (fd); |
429 |
assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &argp) == 0)); |
430 |
} |
431 |
#endif |
432 |
|
433 |
anfd->reify = 0; |
434 |
|
435 |
method_modify (EV_A_ fd, anfd->events, events); |
436 |
anfd->events = events; |
437 |
} |
438 |
|
439 |
fdchangecnt = 0; |
440 |
} |
441 |
|
442 |
static void |
443 |
fd_change (EV_P_ int fd) |
444 |
{ |
445 |
if (anfds [fd].reify) |
446 |
return; |
447 |
|
448 |
anfds [fd].reify = 1; |
449 |
|
450 |
++fdchangecnt; |
451 |
array_needsize (int, fdchanges, fdchangemax, fdchangecnt, EMPTY2); |
452 |
fdchanges [fdchangecnt - 1] = fd; |
453 |
} |
454 |
|
455 |
static void |
456 |
fd_kill (EV_P_ int fd) |
457 |
{ |
458 |
struct ev_io *w; |
459 |
|
460 |
while ((w = (struct ev_io *)anfds [fd].head)) |
461 |
{ |
462 |
ev_io_stop (EV_A_ w); |
463 |
ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
464 |
} |
465 |
} |
466 |
|
467 |
static int |
468 |
fd_valid (int fd) |
469 |
{ |
470 |
#ifdef _WIN32 |
471 |
return _get_osfhandle (fd) != -1; |
472 |
#else |
473 |
return fcntl (fd, F_GETFD) != -1; |
474 |
#endif |
475 |
} |
476 |
|
477 |
/* called on EBADF to verify fds */ |
478 |
static void |
479 |
fd_ebadf (EV_P) |
480 |
{ |
481 |
int fd; |
482 |
|
483 |
for (fd = 0; fd < anfdmax; ++fd) |
484 |
if (anfds [fd].events) |
485 |
if (!fd_valid (fd) == -1 && errno == EBADF) |
486 |
fd_kill (EV_A_ fd); |
487 |
} |
488 |
|
489 |
/* called on ENOMEM in select/poll to kill some fds and retry */ |
490 |
static void |
491 |
fd_enomem (EV_P) |
492 |
{ |
493 |
int fd; |
494 |
|
495 |
for (fd = anfdmax; fd--; ) |
496 |
if (anfds [fd].events) |
497 |
{ |
498 |
fd_kill (EV_A_ fd); |
499 |
return; |
500 |
} |
501 |
} |
502 |
|
503 |
/* usually called after fork if method needs to re-arm all fds from scratch */ |
504 |
static void |
505 |
fd_rearm_all (EV_P) |
506 |
{ |
507 |
int fd; |
508 |
|
509 |
/* this should be highly optimised to not do anything but set a flag */ |
510 |
for (fd = 0; fd < anfdmax; ++fd) |
511 |
if (anfds [fd].events) |
512 |
{ |
513 |
anfds [fd].events = 0; |
514 |
fd_change (EV_A_ fd); |
515 |
} |
516 |
} |
517 |
|
518 |
/*****************************************************************************/ |
519 |
|
520 |
static void |
521 |
upheap (WT *heap, int k) |
522 |
{ |
523 |
WT w = heap [k]; |
524 |
|
525 |
while (k && heap [k >> 1]->at > w->at) |
526 |
{ |
527 |
heap [k] = heap [k >> 1]; |
528 |
((W)heap [k])->active = k + 1; |
529 |
k >>= 1; |
530 |
} |
531 |
|
532 |
heap [k] = w; |
533 |
((W)heap [k])->active = k + 1; |
534 |
|
535 |
} |
536 |
|
537 |
static void |
538 |
downheap (WT *heap, int N, int k) |
539 |
{ |
540 |
WT w = heap [k]; |
541 |
|
542 |
while (k < (N >> 1)) |
543 |
{ |
544 |
int j = k << 1; |
545 |
|
546 |
if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
547 |
++j; |
548 |
|
549 |
if (w->at <= heap [j]->at) |
550 |
break; |
551 |
|
552 |
heap [k] = heap [j]; |
553 |
((W)heap [k])->active = k + 1; |
554 |
k = j; |
555 |
} |
556 |
|
557 |
heap [k] = w; |
558 |
((W)heap [k])->active = k + 1; |
559 |
} |
560 |
|
561 |
inline void |
562 |
adjustheap (WT *heap, int N, int k) |
563 |
{ |
564 |
upheap (heap, k); |
565 |
downheap (heap, N, k); |
566 |
} |
567 |
|
568 |
/*****************************************************************************/ |
569 |
|
570 |
typedef struct |
571 |
{ |
572 |
WL head; |
573 |
sig_atomic_t volatile gotsig; |
574 |
} ANSIG; |
575 |
|
576 |
static ANSIG *signals; |
577 |
static int signalmax; |
578 |
|
579 |
static int sigpipe [2]; |
580 |
static sig_atomic_t volatile gotsig; |
581 |
static struct ev_io sigev; |
582 |
|
583 |
static void |
584 |
signals_init (ANSIG *base, int count) |
585 |
{ |
586 |
while (count--) |
587 |
{ |
588 |
base->head = 0; |
589 |
base->gotsig = 0; |
590 |
|
591 |
++base; |
592 |
} |
593 |
} |
594 |
|
595 |
static void |
596 |
sighandler (int signum) |
597 |
{ |
598 |
#if _WIN32 |
599 |
signal (signum, sighandler); |
600 |
#endif |
601 |
|
602 |
signals [signum - 1].gotsig = 1; |
603 |
|
604 |
if (!gotsig) |
605 |
{ |
606 |
int old_errno = errno; |
607 |
gotsig = 1; |
608 |
write (sigpipe [1], &signum, 1); |
609 |
errno = old_errno; |
610 |
} |
611 |
} |
612 |
|
613 |
void |
614 |
ev_feed_signal_event (EV_P_ int signum) |
615 |
{ |
616 |
WL w; |
617 |
|
618 |
#if EV_MULTIPLICITY |
619 |
assert (("feeding signal events is only supported in the default loop", loop == ev_default_loop_ptr)); |
620 |
#endif |
621 |
|
622 |
--signum; |
623 |
|
624 |
if (signum < 0 || signum >= signalmax) |
625 |
return; |
626 |
|
627 |
signals [signum].gotsig = 0; |
628 |
|
629 |
for (w = signals [signum].head; w; w = w->next) |
630 |
ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
631 |
} |
632 |
|
633 |
static void |
634 |
sigcb (EV_P_ struct ev_io *iow, int revents) |
635 |
{ |
636 |
int signum; |
637 |
|
638 |
read (sigpipe [0], &revents, 1); |
639 |
gotsig = 0; |
640 |
|
641 |
for (signum = signalmax; signum--; ) |
642 |
if (signals [signum].gotsig) |
643 |
ev_feed_signal_event (EV_A_ signum + 1); |
644 |
} |
645 |
|
646 |
inline void |
647 |
fd_intern (int fd) |
648 |
{ |
649 |
#ifdef _WIN32 |
650 |
int arg = 1; |
651 |
ioctlsocket (_get_osfhandle (fd), FIONBIO, &arg); |
652 |
#else |
653 |
fcntl (fd, F_SETFD, FD_CLOEXEC); |
654 |
fcntl (fd, F_SETFL, O_NONBLOCK); |
655 |
#endif |
656 |
} |
657 |
|
658 |
static void |
659 |
siginit (EV_P) |
660 |
{ |
661 |
fd_intern (sigpipe [0]); |
662 |
fd_intern (sigpipe [1]); |
663 |
|
664 |
ev_io_set (&sigev, sigpipe [0], EV_READ); |
665 |
ev_io_start (EV_A_ &sigev); |
666 |
ev_unref (EV_A); /* child watcher should not keep loop alive */ |
667 |
} |
668 |
|
669 |
/*****************************************************************************/ |
670 |
|
671 |
static struct ev_child *childs [PID_HASHSIZE]; |
672 |
|
673 |
#ifndef _WIN32 |
674 |
|
675 |
static struct ev_signal childev; |
676 |
|
677 |
#ifndef WCONTINUED |
678 |
# define WCONTINUED 0 |
679 |
#endif |
680 |
|
681 |
static void |
682 |
child_reap (EV_P_ struct ev_signal *sw, int chain, int pid, int status) |
683 |
{ |
684 |
struct ev_child *w; |
685 |
|
686 |
for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
687 |
if (w->pid == pid || !w->pid) |
688 |
{ |
689 |
ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
690 |
w->rpid = pid; |
691 |
w->rstatus = status; |
692 |
ev_feed_event (EV_A_ (W)w, EV_CHILD); |
693 |
} |
694 |
} |
695 |
|
696 |
static void |
697 |
childcb (EV_P_ struct ev_signal *sw, int revents) |
698 |
{ |
699 |
int pid, status; |
700 |
|
701 |
if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
702 |
{ |
703 |
/* make sure we are called again until all childs have been reaped */ |
704 |
ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
705 |
|
706 |
child_reap (EV_A_ sw, pid, pid, status); |
707 |
child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
708 |
} |
709 |
} |
710 |
|
711 |
#endif |
712 |
|
713 |
/*****************************************************************************/ |
714 |
|
715 |
#if EV_USE_KQUEUE |
716 |
# include "ev_kqueue.c" |
717 |
#endif |
718 |
#if EV_USE_EPOLL |
719 |
# include "ev_epoll.c" |
720 |
#endif |
721 |
#if EV_USE_POLL |
722 |
# include "ev_poll.c" |
723 |
#endif |
724 |
#if EV_USE_SELECT |
725 |
# include "ev_select.c" |
726 |
#endif |
727 |
|
728 |
int |
729 |
ev_version_major (void) |
730 |
{ |
731 |
return EV_VERSION_MAJOR; |
732 |
} |
733 |
|
734 |
int |
735 |
ev_version_minor (void) |
736 |
{ |
737 |
return EV_VERSION_MINOR; |
738 |
} |
739 |
|
740 |
/* return true if we are running with elevated privileges and should ignore env variables */ |
741 |
static int |
742 |
enable_secure (void) |
743 |
{ |
744 |
#ifdef _WIN32 |
745 |
return 0; |
746 |
#else |
747 |
return getuid () != geteuid () |
748 |
|| getgid () != getegid (); |
749 |
#endif |
750 |
} |
751 |
|
752 |
unsigned int |
753 |
ev_method (EV_P) |
754 |
{ |
755 |
return method; |
756 |
} |
757 |
|
758 |
static void |
759 |
loop_init (EV_P_ unsigned int flags) |
760 |
{ |
761 |
if (!method) |
762 |
{ |
763 |
#if EV_USE_MONOTONIC |
764 |
{ |
765 |
struct timespec ts; |
766 |
if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
767 |
have_monotonic = 1; |
768 |
} |
769 |
#endif |
770 |
|
771 |
ev_rt_now = ev_time (); |
772 |
mn_now = get_clock (); |
773 |
now_floor = mn_now; |
774 |
rtmn_diff = ev_rt_now - mn_now; |
775 |
|
776 |
if (!(flags & EVFLAG_NOENV) && !enable_secure () && getenv ("LIBEV_FLAGS")) |
777 |
flags = atoi (getenv ("LIBEV_FLAGS")); |
778 |
|
779 |
if (!(flags & 0x0000ffff)) |
780 |
flags |= 0x0000ffff; |
781 |
|
782 |
method = 0; |
783 |
#if EV_USE_KQUEUE |
784 |
if (!method && (flags & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ flags); |
785 |
#endif |
786 |
#if EV_USE_EPOLL |
787 |
if (!method && (flags & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ flags); |
788 |
#endif |
789 |
#if EV_USE_POLL |
790 |
if (!method && (flags & EVMETHOD_POLL )) method = poll_init (EV_A_ flags); |
791 |
#endif |
792 |
#if EV_USE_SELECT |
793 |
if (!method && (flags & EVMETHOD_SELECT)) method = select_init (EV_A_ flags); |
794 |
#endif |
795 |
|
796 |
ev_init (&sigev, sigcb); |
797 |
ev_set_priority (&sigev, EV_MAXPRI); |
798 |
} |
799 |
} |
800 |
|
801 |
void |
802 |
loop_destroy (EV_P) |
803 |
{ |
804 |
int i; |
805 |
|
806 |
#if EV_USE_KQUEUE |
807 |
if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
808 |
#endif |
809 |
#if EV_USE_EPOLL |
810 |
if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
811 |
#endif |
812 |
#if EV_USE_POLL |
813 |
if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
814 |
#endif |
815 |
#if EV_USE_SELECT |
816 |
if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
817 |
#endif |
818 |
|
819 |
for (i = NUMPRI; i--; ) |
820 |
array_free (pending, [i]); |
821 |
|
822 |
/* have to use the microsoft-never-gets-it-right macro */ |
823 |
array_free (fdchange, EMPTY0); |
824 |
array_free (timer, EMPTY0); |
825 |
#if EV_PERIODICS |
826 |
array_free (periodic, EMPTY0); |
827 |
#endif |
828 |
array_free (idle, EMPTY0); |
829 |
array_free (prepare, EMPTY0); |
830 |
array_free (check, EMPTY0); |
831 |
|
832 |
method = 0; |
833 |
} |
834 |
|
835 |
static void |
836 |
loop_fork (EV_P) |
837 |
{ |
838 |
#if EV_USE_EPOLL |
839 |
if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
840 |
#endif |
841 |
#if EV_USE_KQUEUE |
842 |
if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
843 |
#endif |
844 |
|
845 |
if (ev_is_active (&sigev)) |
846 |
{ |
847 |
/* default loop */ |
848 |
|
849 |
ev_ref (EV_A); |
850 |
ev_io_stop (EV_A_ &sigev); |
851 |
close (sigpipe [0]); |
852 |
close (sigpipe [1]); |
853 |
|
854 |
while (pipe (sigpipe)) |
855 |
syserr ("(libev) error creating pipe"); |
856 |
|
857 |
siginit (EV_A); |
858 |
} |
859 |
|
860 |
postfork = 0; |
861 |
} |
862 |
|
863 |
#if EV_MULTIPLICITY |
864 |
struct ev_loop * |
865 |
ev_loop_new (unsigned int flags) |
866 |
{ |
867 |
struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
868 |
|
869 |
memset (loop, 0, sizeof (struct ev_loop)); |
870 |
|
871 |
loop_init (EV_A_ flags); |
872 |
|
873 |
if (ev_method (EV_A)) |
874 |
return loop; |
875 |
|
876 |
return 0; |
877 |
} |
878 |
|
879 |
void |
880 |
ev_loop_destroy (EV_P) |
881 |
{ |
882 |
loop_destroy (EV_A); |
883 |
ev_free (loop); |
884 |
} |
885 |
|
886 |
void |
887 |
ev_loop_fork (EV_P) |
888 |
{ |
889 |
postfork = 1; |
890 |
} |
891 |
|
892 |
#endif |
893 |
|
894 |
#if EV_MULTIPLICITY |
895 |
struct ev_loop * |
896 |
ev_default_loop_ (unsigned int flags) |
897 |
#else |
898 |
int |
899 |
ev_default_loop (unsigned int flags) |
900 |
#endif |
901 |
{ |
902 |
if (sigpipe [0] == sigpipe [1]) |
903 |
if (pipe (sigpipe)) |
904 |
return 0; |
905 |
|
906 |
if (!ev_default_loop_ptr) |
907 |
{ |
908 |
#if EV_MULTIPLICITY |
909 |
struct ev_loop *loop = ev_default_loop_ptr = &default_loop_struct; |
910 |
#else |
911 |
ev_default_loop_ptr = 1; |
912 |
#endif |
913 |
|
914 |
loop_init (EV_A_ flags); |
915 |
|
916 |
if (ev_method (EV_A)) |
917 |
{ |
918 |
siginit (EV_A); |
919 |
|
920 |
#ifndef _WIN32 |
921 |
ev_signal_init (&childev, childcb, SIGCHLD); |
922 |
ev_set_priority (&childev, EV_MAXPRI); |
923 |
ev_signal_start (EV_A_ &childev); |
924 |
ev_unref (EV_A); /* child watcher should not keep loop alive */ |
925 |
#endif |
926 |
} |
927 |
else |
928 |
ev_default_loop_ptr = 0; |
929 |
} |
930 |
|
931 |
return ev_default_loop_ptr; |
932 |
} |
933 |
|
934 |
void |
935 |
ev_default_destroy (void) |
936 |
{ |
937 |
#if EV_MULTIPLICITY |
938 |
struct ev_loop *loop = ev_default_loop_ptr; |
939 |
#endif |
940 |
|
941 |
#ifndef _WIN32 |
942 |
ev_ref (EV_A); /* child watcher */ |
943 |
ev_signal_stop (EV_A_ &childev); |
944 |
#endif |
945 |
|
946 |
ev_ref (EV_A); /* signal watcher */ |
947 |
ev_io_stop (EV_A_ &sigev); |
948 |
|
949 |
close (sigpipe [0]); sigpipe [0] = 0; |
950 |
close (sigpipe [1]); sigpipe [1] = 0; |
951 |
|
952 |
loop_destroy (EV_A); |
953 |
} |
954 |
|
955 |
void |
956 |
ev_default_fork (void) |
957 |
{ |
958 |
#if EV_MULTIPLICITY |
959 |
struct ev_loop *loop = ev_default_loop_ptr; |
960 |
#endif |
961 |
|
962 |
if (method) |
963 |
postfork = 1; |
964 |
} |
965 |
|
966 |
/*****************************************************************************/ |
967 |
|
968 |
static int |
969 |
any_pending (EV_P) |
970 |
{ |
971 |
int pri; |
972 |
|
973 |
for (pri = NUMPRI; pri--; ) |
974 |
if (pendingcnt [pri]) |
975 |
return 1; |
976 |
|
977 |
return 0; |
978 |
} |
979 |
|
980 |
static void |
981 |
call_pending (EV_P) |
982 |
{ |
983 |
int pri; |
984 |
|
985 |
for (pri = NUMPRI; pri--; ) |
986 |
while (pendingcnt [pri]) |
987 |
{ |
988 |
ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
989 |
|
990 |
if (p->w) |
991 |
{ |
992 |
p->w->pending = 0; |
993 |
EV_CB_INVOKE (p->w, p->events); |
994 |
} |
995 |
} |
996 |
} |
997 |
|
998 |
static void |
999 |
timers_reify (EV_P) |
1000 |
{ |
1001 |
while (timercnt && ((WT)timers [0])->at <= mn_now) |
1002 |
{ |
1003 |
struct ev_timer *w = timers [0]; |
1004 |
|
1005 |
assert (("inactive timer on timer heap detected", ev_is_active (w))); |
1006 |
|
1007 |
/* first reschedule or stop timer */ |
1008 |
if (w->repeat) |
1009 |
{ |
1010 |
assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
1011 |
|
1012 |
((WT)w)->at += w->repeat; |
1013 |
if (((WT)w)->at < mn_now) |
1014 |
((WT)w)->at = mn_now; |
1015 |
|
1016 |
downheap ((WT *)timers, timercnt, 0); |
1017 |
} |
1018 |
else |
1019 |
ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1020 |
|
1021 |
ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
1022 |
} |
1023 |
} |
1024 |
|
1025 |
#if EV_PERIODICS |
1026 |
static void |
1027 |
periodics_reify (EV_P) |
1028 |
{ |
1029 |
while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now) |
1030 |
{ |
1031 |
struct ev_periodic *w = periodics [0]; |
1032 |
|
1033 |
assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
1034 |
|
1035 |
/* first reschedule or stop timer */ |
1036 |
if (w->reschedule_cb) |
1037 |
{ |
1038 |
((WT)w)->at = w->reschedule_cb (w, ev_rt_now + 0.0001); |
1039 |
assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
1040 |
downheap ((WT *)periodics, periodiccnt, 0); |
1041 |
} |
1042 |
else if (w->interval) |
1043 |
{ |
1044 |
((WT)w)->at += floor ((ev_rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
1045 |
assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
1046 |
downheap ((WT *)periodics, periodiccnt, 0); |
1047 |
} |
1048 |
else |
1049 |
ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1050 |
|
1051 |
ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1052 |
} |
1053 |
} |
1054 |
|
1055 |
static void |
1056 |
periodics_reschedule (EV_P) |
1057 |
{ |
1058 |
int i; |
1059 |
|
1060 |
/* adjust periodics after time jump */ |
1061 |
for (i = 0; i < periodiccnt; ++i) |
1062 |
{ |
1063 |
struct ev_periodic *w = periodics [i]; |
1064 |
|
1065 |
if (w->reschedule_cb) |
1066 |
((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
1067 |
else if (w->interval) |
1068 |
((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1069 |
} |
1070 |
|
1071 |
/* now rebuild the heap */ |
1072 |
for (i = periodiccnt >> 1; i--; ) |
1073 |
downheap ((WT *)periodics, periodiccnt, i); |
1074 |
} |
1075 |
#endif |
1076 |
|
1077 |
inline int |
1078 |
time_update_monotonic (EV_P) |
1079 |
{ |
1080 |
mn_now = get_clock (); |
1081 |
|
1082 |
if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1083 |
{ |
1084 |
ev_rt_now = rtmn_diff + mn_now; |
1085 |
return 0; |
1086 |
} |
1087 |
else |
1088 |
{ |
1089 |
now_floor = mn_now; |
1090 |
ev_rt_now = ev_time (); |
1091 |
return 1; |
1092 |
} |
1093 |
} |
1094 |
|
1095 |
static void |
1096 |
time_update (EV_P) |
1097 |
{ |
1098 |
int i; |
1099 |
|
1100 |
#if EV_USE_MONOTONIC |
1101 |
if (expect_true (have_monotonic)) |
1102 |
{ |
1103 |
if (time_update_monotonic (EV_A)) |
1104 |
{ |
1105 |
ev_tstamp odiff = rtmn_diff; |
1106 |
|
1107 |
for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
1108 |
{ |
1109 |
rtmn_diff = ev_rt_now - mn_now; |
1110 |
|
1111 |
if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1112 |
return; /* all is well */ |
1113 |
|
1114 |
ev_rt_now = ev_time (); |
1115 |
mn_now = get_clock (); |
1116 |
now_floor = mn_now; |
1117 |
} |
1118 |
|
1119 |
# if EV_PERIODICS |
1120 |
periodics_reschedule (EV_A); |
1121 |
# endif |
1122 |
/* no timer adjustment, as the monotonic clock doesn't jump */ |
1123 |
/* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
1124 |
} |
1125 |
} |
1126 |
else |
1127 |
#endif |
1128 |
{ |
1129 |
ev_rt_now = ev_time (); |
1130 |
|
1131 |
if (expect_false (mn_now > ev_rt_now || mn_now < ev_rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
1132 |
{ |
1133 |
#if EV_PERIODICS |
1134 |
periodics_reschedule (EV_A); |
1135 |
#endif |
1136 |
|
1137 |
/* adjust timers. this is easy, as the offset is the same for all */ |
1138 |
for (i = 0; i < timercnt; ++i) |
1139 |
((WT)timers [i])->at += ev_rt_now - mn_now; |
1140 |
} |
1141 |
|
1142 |
mn_now = ev_rt_now; |
1143 |
} |
1144 |
} |
1145 |
|
1146 |
void |
1147 |
ev_ref (EV_P) |
1148 |
{ |
1149 |
++activecnt; |
1150 |
} |
1151 |
|
1152 |
void |
1153 |
ev_unref (EV_P) |
1154 |
{ |
1155 |
--activecnt; |
1156 |
} |
1157 |
|
1158 |
static int loop_done; |
1159 |
|
1160 |
void |
1161 |
ev_loop (EV_P_ int flags) |
1162 |
{ |
1163 |
double block; |
1164 |
loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
1165 |
|
1166 |
while (activecnt) |
1167 |
{ |
1168 |
/* queue check watchers (and execute them) */ |
1169 |
if (expect_false (preparecnt)) |
1170 |
{ |
1171 |
queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1172 |
call_pending (EV_A); |
1173 |
} |
1174 |
|
1175 |
/* we might have forked, so reify kernel state if necessary */ |
1176 |
if (expect_false (postfork)) |
1177 |
loop_fork (EV_A); |
1178 |
|
1179 |
/* update fd-related kernel structures */ |
1180 |
fd_reify (EV_A); |
1181 |
|
1182 |
/* calculate blocking time */ |
1183 |
|
1184 |
/* we only need this for !monotonic clock or timers, but as we basically |
1185 |
always have timers, we just calculate it always */ |
1186 |
#if EV_USE_MONOTONIC |
1187 |
if (expect_true (have_monotonic)) |
1188 |
time_update_monotonic (EV_A); |
1189 |
else |
1190 |
#endif |
1191 |
{ |
1192 |
ev_rt_now = ev_time (); |
1193 |
mn_now = ev_rt_now; |
1194 |
} |
1195 |
|
1196 |
if (flags & EVLOOP_NONBLOCK || idlecnt) |
1197 |
block = 0.; |
1198 |
else |
1199 |
{ |
1200 |
block = MAX_BLOCKTIME; |
1201 |
|
1202 |
if (timercnt) |
1203 |
{ |
1204 |
ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
1205 |
if (block > to) block = to; |
1206 |
} |
1207 |
|
1208 |
#if EV_PERIODICS |
1209 |
if (periodiccnt) |
1210 |
{ |
1211 |
ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + method_fudge; |
1212 |
if (block > to) block = to; |
1213 |
} |
1214 |
#endif |
1215 |
|
1216 |
if (block < 0.) block = 0.; |
1217 |
} |
1218 |
|
1219 |
method_poll (EV_A_ block); |
1220 |
|
1221 |
/* update ev_rt_now, do magic */ |
1222 |
time_update (EV_A); |
1223 |
|
1224 |
/* queue pending timers and reschedule them */ |
1225 |
timers_reify (EV_A); /* relative timers called last */ |
1226 |
#if EV_PERIODICS |
1227 |
periodics_reify (EV_A); /* absolute timers called first */ |
1228 |
#endif |
1229 |
|
1230 |
/* queue idle watchers unless io or timers are pending */ |
1231 |
if (idlecnt && !any_pending (EV_A)) |
1232 |
queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1233 |
|
1234 |
/* queue check watchers, to be executed first */ |
1235 |
if (checkcnt) |
1236 |
queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1237 |
|
1238 |
call_pending (EV_A); |
1239 |
|
1240 |
if (loop_done) |
1241 |
break; |
1242 |
} |
1243 |
|
1244 |
if (loop_done != 2) |
1245 |
loop_done = 0; |
1246 |
} |
1247 |
|
1248 |
void |
1249 |
ev_unloop (EV_P_ int how) |
1250 |
{ |
1251 |
loop_done = how; |
1252 |
} |
1253 |
|
1254 |
/*****************************************************************************/ |
1255 |
|
1256 |
inline void |
1257 |
wlist_add (WL *head, WL elem) |
1258 |
{ |
1259 |
elem->next = *head; |
1260 |
*head = elem; |
1261 |
} |
1262 |
|
1263 |
inline void |
1264 |
wlist_del (WL *head, WL elem) |
1265 |
{ |
1266 |
while (*head) |
1267 |
{ |
1268 |
if (*head == elem) |
1269 |
{ |
1270 |
*head = elem->next; |
1271 |
return; |
1272 |
} |
1273 |
|
1274 |
head = &(*head)->next; |
1275 |
} |
1276 |
} |
1277 |
|
1278 |
inline void |
1279 |
ev_clear_pending (EV_P_ W w) |
1280 |
{ |
1281 |
if (w->pending) |
1282 |
{ |
1283 |
pendings [ABSPRI (w)][w->pending - 1].w = 0; |
1284 |
w->pending = 0; |
1285 |
} |
1286 |
} |
1287 |
|
1288 |
inline void |
1289 |
ev_start (EV_P_ W w, int active) |
1290 |
{ |
1291 |
if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
1292 |
if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
1293 |
|
1294 |
w->active = active; |
1295 |
ev_ref (EV_A); |
1296 |
} |
1297 |
|
1298 |
inline void |
1299 |
ev_stop (EV_P_ W w) |
1300 |
{ |
1301 |
ev_unref (EV_A); |
1302 |
w->active = 0; |
1303 |
} |
1304 |
|
1305 |
/*****************************************************************************/ |
1306 |
|
1307 |
void |
1308 |
ev_io_start (EV_P_ struct ev_io *w) |
1309 |
{ |
1310 |
int fd = w->fd; |
1311 |
|
1312 |
if (ev_is_active (w)) |
1313 |
return; |
1314 |
|
1315 |
assert (("ev_io_start called with negative fd", fd >= 0)); |
1316 |
|
1317 |
ev_start (EV_A_ (W)w, 1); |
1318 |
array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1319 |
wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1320 |
|
1321 |
fd_change (EV_A_ fd); |
1322 |
} |
1323 |
|
1324 |
void |
1325 |
ev_io_stop (EV_P_ struct ev_io *w) |
1326 |
{ |
1327 |
ev_clear_pending (EV_A_ (W)w); |
1328 |
if (!ev_is_active (w)) |
1329 |
return; |
1330 |
|
1331 |
assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1332 |
|
1333 |
wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
1334 |
ev_stop (EV_A_ (W)w); |
1335 |
|
1336 |
fd_change (EV_A_ w->fd); |
1337 |
} |
1338 |
|
1339 |
void |
1340 |
ev_timer_start (EV_P_ struct ev_timer *w) |
1341 |
{ |
1342 |
if (ev_is_active (w)) |
1343 |
return; |
1344 |
|
1345 |
((WT)w)->at += mn_now; |
1346 |
|
1347 |
assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1348 |
|
1349 |
ev_start (EV_A_ (W)w, ++timercnt); |
1350 |
array_needsize (struct ev_timer *, timers, timermax, timercnt, EMPTY2); |
1351 |
timers [timercnt - 1] = w; |
1352 |
upheap ((WT *)timers, timercnt - 1); |
1353 |
|
1354 |
assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1355 |
} |
1356 |
|
1357 |
void |
1358 |
ev_timer_stop (EV_P_ struct ev_timer *w) |
1359 |
{ |
1360 |
ev_clear_pending (EV_A_ (W)w); |
1361 |
if (!ev_is_active (w)) |
1362 |
return; |
1363 |
|
1364 |
assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1365 |
|
1366 |
if (((W)w)->active < timercnt--) |
1367 |
{ |
1368 |
timers [((W)w)->active - 1] = timers [timercnt]; |
1369 |
adjustheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1370 |
} |
1371 |
|
1372 |
((WT)w)->at -= mn_now; |
1373 |
|
1374 |
ev_stop (EV_A_ (W)w); |
1375 |
} |
1376 |
|
1377 |
void |
1378 |
ev_timer_again (EV_P_ struct ev_timer *w) |
1379 |
{ |
1380 |
if (ev_is_active (w)) |
1381 |
{ |
1382 |
if (w->repeat) |
1383 |
{ |
1384 |
((WT)w)->at = mn_now + w->repeat; |
1385 |
adjustheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1386 |
} |
1387 |
else |
1388 |
ev_timer_stop (EV_A_ w); |
1389 |
} |
1390 |
else if (w->repeat) |
1391 |
{ |
1392 |
w->at = w->repeat; |
1393 |
ev_timer_start (EV_A_ w); |
1394 |
} |
1395 |
} |
1396 |
|
1397 |
#if EV_PERIODICS |
1398 |
void |
1399 |
ev_periodic_start (EV_P_ struct ev_periodic *w) |
1400 |
{ |
1401 |
if (ev_is_active (w)) |
1402 |
return; |
1403 |
|
1404 |
if (w->reschedule_cb) |
1405 |
((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
1406 |
else if (w->interval) |
1407 |
{ |
1408 |
assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1409 |
/* this formula differs from the one in periodic_reify because we do not always round up */ |
1410 |
((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1411 |
} |
1412 |
|
1413 |
ev_start (EV_A_ (W)w, ++periodiccnt); |
1414 |
array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, EMPTY2); |
1415 |
periodics [periodiccnt - 1] = w; |
1416 |
upheap ((WT *)periodics, periodiccnt - 1); |
1417 |
|
1418 |
assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1419 |
} |
1420 |
|
1421 |
void |
1422 |
ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1423 |
{ |
1424 |
ev_clear_pending (EV_A_ (W)w); |
1425 |
if (!ev_is_active (w)) |
1426 |
return; |
1427 |
|
1428 |
assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1429 |
|
1430 |
if (((W)w)->active < periodiccnt--) |
1431 |
{ |
1432 |
periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
1433 |
adjustheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
1434 |
} |
1435 |
|
1436 |
ev_stop (EV_A_ (W)w); |
1437 |
} |
1438 |
|
1439 |
void |
1440 |
ev_periodic_again (EV_P_ struct ev_periodic *w) |
1441 |
{ |
1442 |
/* TODO: use adjustheap and recalculation */ |
1443 |
ev_periodic_stop (EV_A_ w); |
1444 |
ev_periodic_start (EV_A_ w); |
1445 |
} |
1446 |
#endif |
1447 |
|
1448 |
void |
1449 |
ev_idle_start (EV_P_ struct ev_idle *w) |
1450 |
{ |
1451 |
if (ev_is_active (w)) |
1452 |
return; |
1453 |
|
1454 |
ev_start (EV_A_ (W)w, ++idlecnt); |
1455 |
array_needsize (struct ev_idle *, idles, idlemax, idlecnt, EMPTY2); |
1456 |
idles [idlecnt - 1] = w; |
1457 |
} |
1458 |
|
1459 |
void |
1460 |
ev_idle_stop (EV_P_ struct ev_idle *w) |
1461 |
{ |
1462 |
ev_clear_pending (EV_A_ (W)w); |
1463 |
if (!ev_is_active (w)) |
1464 |
return; |
1465 |
|
1466 |
idles [((W)w)->active - 1] = idles [--idlecnt]; |
1467 |
ev_stop (EV_A_ (W)w); |
1468 |
} |
1469 |
|
1470 |
void |
1471 |
ev_prepare_start (EV_P_ struct ev_prepare *w) |
1472 |
{ |
1473 |
if (ev_is_active (w)) |
1474 |
return; |
1475 |
|
1476 |
ev_start (EV_A_ (W)w, ++preparecnt); |
1477 |
array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); |
1478 |
prepares [preparecnt - 1] = w; |
1479 |
} |
1480 |
|
1481 |
void |
1482 |
ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1483 |
{ |
1484 |
ev_clear_pending (EV_A_ (W)w); |
1485 |
if (!ev_is_active (w)) |
1486 |
return; |
1487 |
|
1488 |
prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
1489 |
ev_stop (EV_A_ (W)w); |
1490 |
} |
1491 |
|
1492 |
void |
1493 |
ev_check_start (EV_P_ struct ev_check *w) |
1494 |
{ |
1495 |
if (ev_is_active (w)) |
1496 |
return; |
1497 |
|
1498 |
ev_start (EV_A_ (W)w, ++checkcnt); |
1499 |
array_needsize (struct ev_check *, checks, checkmax, checkcnt, EMPTY2); |
1500 |
checks [checkcnt - 1] = w; |
1501 |
} |
1502 |
|
1503 |
void |
1504 |
ev_check_stop (EV_P_ struct ev_check *w) |
1505 |
{ |
1506 |
ev_clear_pending (EV_A_ (W)w); |
1507 |
if (!ev_is_active (w)) |
1508 |
return; |
1509 |
|
1510 |
checks [((W)w)->active - 1] = checks [--checkcnt]; |
1511 |
ev_stop (EV_A_ (W)w); |
1512 |
} |
1513 |
|
1514 |
#ifndef SA_RESTART |
1515 |
# define SA_RESTART 0 |
1516 |
#endif |
1517 |
|
1518 |
void |
1519 |
ev_signal_start (EV_P_ struct ev_signal *w) |
1520 |
{ |
1521 |
#if EV_MULTIPLICITY |
1522 |
assert (("signal watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
1523 |
#endif |
1524 |
if (ev_is_active (w)) |
1525 |
return; |
1526 |
|
1527 |
assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1528 |
|
1529 |
ev_start (EV_A_ (W)w, 1); |
1530 |
array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
1531 |
wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1532 |
|
1533 |
if (!((WL)w)->next) |
1534 |
{ |
1535 |
#if _WIN32 |
1536 |
signal (w->signum, sighandler); |
1537 |
#else |
1538 |
struct sigaction sa; |
1539 |
sa.sa_handler = sighandler; |
1540 |
sigfillset (&sa.sa_mask); |
1541 |
sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1542 |
sigaction (w->signum, &sa, 0); |
1543 |
#endif |
1544 |
} |
1545 |
} |
1546 |
|
1547 |
void |
1548 |
ev_signal_stop (EV_P_ struct ev_signal *w) |
1549 |
{ |
1550 |
ev_clear_pending (EV_A_ (W)w); |
1551 |
if (!ev_is_active (w)) |
1552 |
return; |
1553 |
|
1554 |
wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
1555 |
ev_stop (EV_A_ (W)w); |
1556 |
|
1557 |
if (!signals [w->signum - 1].head) |
1558 |
signal (w->signum, SIG_DFL); |
1559 |
} |
1560 |
|
1561 |
void |
1562 |
ev_child_start (EV_P_ struct ev_child *w) |
1563 |
{ |
1564 |
#if EV_MULTIPLICITY |
1565 |
assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
1566 |
#endif |
1567 |
if (ev_is_active (w)) |
1568 |
return; |
1569 |
|
1570 |
ev_start (EV_A_ (W)w, 1); |
1571 |
wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1572 |
} |
1573 |
|
1574 |
void |
1575 |
ev_child_stop (EV_P_ struct ev_child *w) |
1576 |
{ |
1577 |
ev_clear_pending (EV_A_ (W)w); |
1578 |
if (!ev_is_active (w)) |
1579 |
return; |
1580 |
|
1581 |
wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1582 |
ev_stop (EV_A_ (W)w); |
1583 |
} |
1584 |
|
1585 |
/*****************************************************************************/ |
1586 |
|
1587 |
struct ev_once |
1588 |
{ |
1589 |
struct ev_io io; |
1590 |
struct ev_timer to; |
1591 |
void (*cb)(int revents, void *arg); |
1592 |
void *arg; |
1593 |
}; |
1594 |
|
1595 |
static void |
1596 |
once_cb (EV_P_ struct ev_once *once, int revents) |
1597 |
{ |
1598 |
void (*cb)(int revents, void *arg) = once->cb; |
1599 |
void *arg = once->arg; |
1600 |
|
1601 |
ev_io_stop (EV_A_ &once->io); |
1602 |
ev_timer_stop (EV_A_ &once->to); |
1603 |
ev_free (once); |
1604 |
|
1605 |
cb (revents, arg); |
1606 |
} |
1607 |
|
1608 |
static void |
1609 |
once_cb_io (EV_P_ struct ev_io *w, int revents) |
1610 |
{ |
1611 |
once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
1612 |
} |
1613 |
|
1614 |
static void |
1615 |
once_cb_to (EV_P_ struct ev_timer *w, int revents) |
1616 |
{ |
1617 |
once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
1618 |
} |
1619 |
|
1620 |
void |
1621 |
ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1622 |
{ |
1623 |
struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1624 |
|
1625 |
if (!once) |
1626 |
cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1627 |
else |
1628 |
{ |
1629 |
once->cb = cb; |
1630 |
once->arg = arg; |
1631 |
|
1632 |
ev_init (&once->io, once_cb_io); |
1633 |
if (fd >= 0) |
1634 |
{ |
1635 |
ev_io_set (&once->io, fd, events); |
1636 |
ev_io_start (EV_A_ &once->io); |
1637 |
} |
1638 |
|
1639 |
ev_init (&once->to, once_cb_to); |
1640 |
if (timeout >= 0.) |
1641 |
{ |
1642 |
ev_timer_set (&once->to, timeout, 0.); |
1643 |
ev_timer_start (EV_A_ &once->to); |
1644 |
} |
1645 |
} |
1646 |
} |
1647 |
|
1648 |
#ifdef __cplusplus |
1649 |
} |
1650 |
#endif |
1651 |
|