… | |
… | |
54 | |
54 | |
55 | #endif |
55 | #endif |
56 | |
56 | |
57 | #include <math.h> |
57 | #include <math.h> |
58 | #include <stdlib.h> |
58 | #include <stdlib.h> |
59 | #include <unistd.h> |
|
|
60 | #include <fcntl.h> |
59 | #include <fcntl.h> |
61 | #include <signal.h> |
|
|
62 | #include <stddef.h> |
60 | #include <stddef.h> |
63 | |
61 | |
64 | #include <stdio.h> |
62 | #include <stdio.h> |
65 | |
63 | |
66 | #include <assert.h> |
64 | #include <assert.h> |
67 | #include <errno.h> |
65 | #include <errno.h> |
68 | #include <sys/types.h> |
66 | #include <sys/types.h> |
|
|
67 | #include <time.h> |
|
|
68 | |
|
|
69 | #include <signal.h> |
|
|
70 | |
69 | #ifndef WIN32 |
71 | #ifndef WIN32 |
|
|
72 | # include <unistd.h> |
|
|
73 | # include <sys/time.h> |
70 | # include <sys/wait.h> |
74 | # include <sys/wait.h> |
71 | #endif |
75 | #endif |
72 | #include <sys/time.h> |
|
|
73 | #include <time.h> |
|
|
74 | |
|
|
75 | /**/ |
76 | /**/ |
76 | |
77 | |
77 | #ifndef EV_USE_MONOTONIC |
78 | #ifndef EV_USE_MONOTONIC |
78 | # define EV_USE_MONOTONIC 1 |
79 | # define EV_USE_MONOTONIC 1 |
79 | #endif |
80 | #endif |
… | |
… | |
94 | # define EV_USE_KQUEUE 0 |
95 | # define EV_USE_KQUEUE 0 |
95 | #endif |
96 | #endif |
96 | |
97 | |
97 | #ifndef EV_USE_WIN32 |
98 | #ifndef EV_USE_WIN32 |
98 | # ifdef WIN32 |
99 | # ifdef WIN32 |
|
|
100 | # define EV_USE_WIN32 0 /* it does not exist, use select */ |
|
|
101 | # undef EV_USE_SELECT |
99 | # define EV_USE_WIN32 1 |
102 | # define EV_USE_SELECT 1 |
100 | # else |
103 | # else |
101 | # define EV_USE_WIN32 0 |
104 | # define EV_USE_WIN32 0 |
102 | # endif |
105 | # endif |
103 | #endif |
106 | #endif |
104 | |
107 | |
… | |
… | |
145 | typedef struct ev_watcher_list *WL; |
148 | typedef struct ev_watcher_list *WL; |
146 | typedef struct ev_watcher_time *WT; |
149 | typedef struct ev_watcher_time *WT; |
147 | |
150 | |
148 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
151 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
149 | |
152 | |
150 | #if WIN32 |
153 | #include "ev_win32.c" |
151 | /* note: the comment below could not be substantiated, but what would I care */ |
154 | |
152 | /* MSDN says this is required to handle SIGFPE */ |
155 | /*****************************************************************************/ |
153 | volatile double SIGFPE_REQ = 0.0f; |
156 | |
154 | #endif |
157 | static void (*syserr_cb)(const char *msg); |
|
|
158 | |
|
|
159 | void ev_set_syserr_cb (void (*cb)(const char *msg)) |
|
|
160 | { |
|
|
161 | syserr_cb = cb; |
|
|
162 | } |
|
|
163 | |
|
|
164 | static void |
|
|
165 | syserr (const char *msg) |
|
|
166 | { |
|
|
167 | if (!msg) |
|
|
168 | msg = "(libev) system error"; |
|
|
169 | |
|
|
170 | if (syserr_cb) |
|
|
171 | syserr_cb (msg); |
|
|
172 | else |
|
|
173 | { |
|
|
174 | perror (msg); |
|
|
175 | abort (); |
|
|
176 | } |
|
|
177 | } |
|
|
178 | |
|
|
179 | static void *(*alloc)(void *ptr, long size); |
|
|
180 | |
|
|
181 | void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
|
|
182 | { |
|
|
183 | alloc = cb; |
|
|
184 | } |
|
|
185 | |
|
|
186 | static void * |
|
|
187 | ev_realloc (void *ptr, long size) |
|
|
188 | { |
|
|
189 | ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
|
|
190 | |
|
|
191 | if (!ptr && size) |
|
|
192 | { |
|
|
193 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
|
|
194 | abort (); |
|
|
195 | } |
|
|
196 | |
|
|
197 | return ptr; |
|
|
198 | } |
|
|
199 | |
|
|
200 | #define ev_malloc(size) ev_realloc (0, (size)) |
|
|
201 | #define ev_free(ptr) ev_realloc ((ptr), 0) |
155 | |
202 | |
156 | /*****************************************************************************/ |
203 | /*****************************************************************************/ |
157 | |
204 | |
158 | typedef struct |
205 | typedef struct |
159 | { |
206 | { |
… | |
… | |
221 | ev_now (EV_P) |
268 | ev_now (EV_P) |
222 | { |
269 | { |
223 | return rt_now; |
270 | return rt_now; |
224 | } |
271 | } |
225 | |
272 | |
226 | #define array_roundsize(base,n) ((n) | 4 & ~3) |
273 | #define array_roundsize(type,n) ((n) | 4 & ~3) |
227 | |
274 | |
228 | #define array_needsize(base,cur,cnt,init) \ |
275 | #define array_needsize(type,base,cur,cnt,init) \ |
229 | if (expect_false ((cnt) > cur)) \ |
276 | if (expect_false ((cnt) > cur)) \ |
230 | { \ |
277 | { \ |
231 | int newcnt = cur; \ |
278 | int newcnt = cur; \ |
232 | do \ |
279 | do \ |
233 | { \ |
280 | { \ |
234 | newcnt = array_roundsize (base, newcnt << 1); \ |
281 | newcnt = array_roundsize (type, newcnt << 1); \ |
235 | } \ |
282 | } \ |
236 | while ((cnt) > newcnt); \ |
283 | while ((cnt) > newcnt); \ |
237 | \ |
284 | \ |
238 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
285 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
239 | init (base + cur, newcnt - cur); \ |
286 | init (base + cur, newcnt - cur); \ |
240 | cur = newcnt; \ |
287 | cur = newcnt; \ |
241 | } |
288 | } |
242 | |
289 | |
243 | #define array_slim(stem) \ |
290 | #define array_slim(type,stem) \ |
244 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
291 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
245 | { \ |
292 | { \ |
246 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
293 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
247 | base = realloc (base, sizeof (*base) * (stem ## max)); \ |
294 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
248 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
295 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
249 | } |
296 | } |
250 | |
297 | |
|
|
298 | /* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ |
|
|
299 | /* bringing us everlasting joy in form of stupid extra macros that are not required in C */ |
|
|
300 | #define array_free_microshit(stem) \ |
|
|
301 | ev_free (stem ## s); stem ## cnt = stem ## max = 0; |
|
|
302 | |
251 | #define array_free(stem, idx) \ |
303 | #define array_free(stem, idx) \ |
252 | free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
304 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
253 | |
305 | |
254 | /*****************************************************************************/ |
306 | /*****************************************************************************/ |
255 | |
307 | |
256 | static void |
308 | static void |
257 | anfds_init (ANFD *base, int count) |
309 | anfds_init (ANFD *base, int count) |
… | |
… | |
264 | |
316 | |
265 | ++base; |
317 | ++base; |
266 | } |
318 | } |
267 | } |
319 | } |
268 | |
320 | |
269 | static void |
321 | void |
270 | event (EV_P_ W w, int events) |
322 | ev_feed_event (EV_P_ void *w, int revents) |
271 | { |
323 | { |
|
|
324 | W w_ = (W)w; |
|
|
325 | |
272 | if (w->pending) |
326 | if (w_->pending) |
273 | { |
327 | { |
274 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
328 | pendings [ABSPRI (w_)][w_->pending - 1].events |= revents; |
275 | return; |
329 | return; |
276 | } |
330 | } |
277 | |
331 | |
278 | w->pending = ++pendingcnt [ABSPRI (w)]; |
332 | w_->pending = ++pendingcnt [ABSPRI (w_)]; |
279 | array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], ); |
333 | array_needsize (ANPENDING, pendings [ABSPRI (w_)], pendingmax [ABSPRI (w_)], pendingcnt [ABSPRI (w_)], (void)); |
280 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
334 | pendings [ABSPRI (w_)][w_->pending - 1].w = w_; |
281 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
335 | pendings [ABSPRI (w_)][w_->pending - 1].events = revents; |
282 | } |
336 | } |
283 | |
337 | |
284 | static void |
338 | static void |
285 | queue_events (EV_P_ W *events, int eventcnt, int type) |
339 | queue_events (EV_P_ W *events, int eventcnt, int type) |
286 | { |
340 | { |
287 | int i; |
341 | int i; |
288 | |
342 | |
289 | for (i = 0; i < eventcnt; ++i) |
343 | for (i = 0; i < eventcnt; ++i) |
290 | event (EV_A_ events [i], type); |
344 | ev_feed_event (EV_A_ events [i], type); |
291 | } |
345 | } |
292 | |
346 | |
293 | static void |
347 | inline void |
294 | fd_event (EV_P_ int fd, int events) |
348 | fd_event (EV_P_ int fd, int revents) |
295 | { |
349 | { |
296 | ANFD *anfd = anfds + fd; |
350 | ANFD *anfd = anfds + fd; |
297 | struct ev_io *w; |
351 | struct ev_io *w; |
298 | |
352 | |
299 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
353 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
300 | { |
354 | { |
301 | int ev = w->events & events; |
355 | int ev = w->events & revents; |
302 | |
356 | |
303 | if (ev) |
357 | if (ev) |
304 | event (EV_A_ (W)w, ev); |
358 | ev_feed_event (EV_A_ (W)w, ev); |
305 | } |
359 | } |
|
|
360 | } |
|
|
361 | |
|
|
362 | void |
|
|
363 | ev_feed_fd_event (EV_P_ int fd, int revents) |
|
|
364 | { |
|
|
365 | fd_event (EV_A_ fd, revents); |
306 | } |
366 | } |
307 | |
367 | |
308 | /*****************************************************************************/ |
368 | /*****************************************************************************/ |
309 | |
369 | |
310 | static void |
370 | static void |
… | |
… | |
333 | } |
393 | } |
334 | |
394 | |
335 | static void |
395 | static void |
336 | fd_change (EV_P_ int fd) |
396 | fd_change (EV_P_ int fd) |
337 | { |
397 | { |
338 | if (anfds [fd].reify || fdchangecnt < 0) |
398 | if (anfds [fd].reify) |
339 | return; |
399 | return; |
340 | |
400 | |
341 | anfds [fd].reify = 1; |
401 | anfds [fd].reify = 1; |
342 | |
402 | |
343 | ++fdchangecnt; |
403 | ++fdchangecnt; |
344 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
404 | array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void)); |
345 | fdchanges [fdchangecnt - 1] = fd; |
405 | fdchanges [fdchangecnt - 1] = fd; |
346 | } |
406 | } |
347 | |
407 | |
348 | static void |
408 | static void |
349 | fd_kill (EV_P_ int fd) |
409 | fd_kill (EV_P_ int fd) |
… | |
… | |
351 | struct ev_io *w; |
411 | struct ev_io *w; |
352 | |
412 | |
353 | while ((w = (struct ev_io *)anfds [fd].head)) |
413 | while ((w = (struct ev_io *)anfds [fd].head)) |
354 | { |
414 | { |
355 | ev_io_stop (EV_A_ w); |
415 | ev_io_stop (EV_A_ w); |
356 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
416 | ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
357 | } |
417 | } |
|
|
418 | } |
|
|
419 | |
|
|
420 | static int |
|
|
421 | fd_valid (int fd) |
|
|
422 | { |
|
|
423 | #ifdef WIN32 |
|
|
424 | return !!win32_get_osfhandle (fd); |
|
|
425 | #else |
|
|
426 | return fcntl (fd, F_GETFD) != -1; |
|
|
427 | #endif |
358 | } |
428 | } |
359 | |
429 | |
360 | /* called on EBADF to verify fds */ |
430 | /* called on EBADF to verify fds */ |
361 | static void |
431 | static void |
362 | fd_ebadf (EV_P) |
432 | fd_ebadf (EV_P) |
363 | { |
433 | { |
364 | int fd; |
434 | int fd; |
365 | |
435 | |
366 | for (fd = 0; fd < anfdmax; ++fd) |
436 | for (fd = 0; fd < anfdmax; ++fd) |
367 | if (anfds [fd].events) |
437 | if (anfds [fd].events) |
368 | if (fcntl (fd, F_GETFD) == -1 && errno == EBADF) |
438 | if (!fd_valid (fd) == -1 && errno == EBADF) |
369 | fd_kill (EV_A_ fd); |
439 | fd_kill (EV_A_ fd); |
370 | } |
440 | } |
371 | |
441 | |
372 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
442 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
373 | static void |
443 | static void |
… | |
… | |
381 | fd_kill (EV_A_ fd); |
451 | fd_kill (EV_A_ fd); |
382 | return; |
452 | return; |
383 | } |
453 | } |
384 | } |
454 | } |
385 | |
455 | |
386 | /* susually called after fork if method needs to re-arm all fds from scratch */ |
456 | /* usually called after fork if method needs to re-arm all fds from scratch */ |
387 | static void |
457 | static void |
388 | fd_rearm_all (EV_P) |
458 | fd_rearm_all (EV_P) |
389 | { |
459 | { |
390 | int fd; |
460 | int fd; |
391 | |
461 | |
… | |
… | |
479 | |
549 | |
480 | if (!gotsig) |
550 | if (!gotsig) |
481 | { |
551 | { |
482 | int old_errno = errno; |
552 | int old_errno = errno; |
483 | gotsig = 1; |
553 | gotsig = 1; |
|
|
554 | #ifdef WIN32 |
|
|
555 | send (sigpipe [1], &signum, 1, MSG_DONTWAIT); |
|
|
556 | #else |
484 | write (sigpipe [1], &signum, 1); |
557 | write (sigpipe [1], &signum, 1); |
|
|
558 | #endif |
485 | errno = old_errno; |
559 | errno = old_errno; |
486 | } |
560 | } |
|
|
561 | } |
|
|
562 | |
|
|
563 | void |
|
|
564 | ev_feed_signal_event (EV_P_ int signum) |
|
|
565 | { |
|
|
566 | #if EV_MULTIPLICITY |
|
|
567 | assert (("feeding signal events is only supported in the default loop", loop == default_loop)); |
|
|
568 | #endif |
|
|
569 | |
|
|
570 | --signum; |
|
|
571 | |
|
|
572 | if (signum < 0 || signum >= signalmax) |
|
|
573 | return; |
|
|
574 | |
|
|
575 | signals [signum].gotsig = 0; |
|
|
576 | |
|
|
577 | for (w = signals [signum].head; w; w = w->next) |
|
|
578 | ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
487 | } |
579 | } |
488 | |
580 | |
489 | static void |
581 | static void |
490 | sigcb (EV_P_ struct ev_io *iow, int revents) |
582 | sigcb (EV_P_ struct ev_io *iow, int revents) |
491 | { |
583 | { |
492 | WL w; |
584 | WL w; |
493 | int signum; |
585 | int signum; |
494 | |
586 | |
|
|
587 | #ifdef WIN32 |
|
|
588 | recv (sigpipe [0], &revents, 1, MSG_DONTWAIT); |
|
|
589 | #else |
495 | read (sigpipe [0], &revents, 1); |
590 | read (sigpipe [0], &revents, 1); |
|
|
591 | #endif |
496 | gotsig = 0; |
592 | gotsig = 0; |
497 | |
593 | |
498 | for (signum = signalmax; signum--; ) |
594 | for (signum = signalmax; signum--; ) |
499 | if (signals [signum].gotsig) |
595 | if (signals [signum].gotsig) |
500 | { |
596 | sigevent (EV_A_ signum + 1); |
501 | signals [signum].gotsig = 0; |
|
|
502 | |
|
|
503 | for (w = signals [signum].head; w; w = w->next) |
|
|
504 | event (EV_A_ (W)w, EV_SIGNAL); |
|
|
505 | } |
|
|
506 | } |
597 | } |
507 | |
598 | |
508 | static void |
599 | static void |
509 | siginit (EV_P) |
600 | siginit (EV_P) |
510 | { |
601 | { |
… | |
… | |
522 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
613 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
523 | } |
614 | } |
524 | |
615 | |
525 | /*****************************************************************************/ |
616 | /*****************************************************************************/ |
526 | |
617 | |
|
|
618 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
619 | |
527 | #ifndef WIN32 |
620 | #ifndef WIN32 |
528 | |
621 | |
529 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
530 | static struct ev_signal childev; |
622 | static struct ev_signal childev; |
531 | |
623 | |
532 | #ifndef WCONTINUED |
624 | #ifndef WCONTINUED |
533 | # define WCONTINUED 0 |
625 | # define WCONTINUED 0 |
534 | #endif |
626 | #endif |
… | |
… | |
542 | if (w->pid == pid || !w->pid) |
634 | if (w->pid == pid || !w->pid) |
543 | { |
635 | { |
544 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
636 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
545 | w->rpid = pid; |
637 | w->rpid = pid; |
546 | w->rstatus = status; |
638 | w->rstatus = status; |
547 | event (EV_A_ (W)w, EV_CHILD); |
639 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
548 | } |
640 | } |
549 | } |
641 | } |
550 | |
642 | |
551 | static void |
643 | static void |
552 | childcb (EV_P_ struct ev_signal *sw, int revents) |
644 | childcb (EV_P_ struct ev_signal *sw, int revents) |
… | |
… | |
554 | int pid, status; |
646 | int pid, status; |
555 | |
647 | |
556 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
648 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
557 | { |
649 | { |
558 | /* make sure we are called again until all childs have been reaped */ |
650 | /* make sure we are called again until all childs have been reaped */ |
559 | event (EV_A_ (W)sw, EV_SIGNAL); |
651 | ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
560 | |
652 | |
561 | child_reap (EV_A_ sw, pid, pid, status); |
653 | child_reap (EV_A_ sw, pid, pid, status); |
562 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
654 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
563 | } |
655 | } |
564 | } |
656 | } |
… | |
… | |
648 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
740 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
649 | #endif |
741 | #endif |
650 | #if EV_USE_SELECT |
742 | #if EV_USE_SELECT |
651 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
743 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
652 | #endif |
744 | #endif |
|
|
745 | |
|
|
746 | ev_watcher_init (&sigev, sigcb); |
|
|
747 | ev_set_priority (&sigev, EV_MAXPRI); |
653 | } |
748 | } |
654 | } |
749 | } |
655 | |
750 | |
656 | void |
751 | void |
657 | loop_destroy (EV_P) |
752 | loop_destroy (EV_P) |
… | |
… | |
675 | #endif |
770 | #endif |
676 | |
771 | |
677 | for (i = NUMPRI; i--; ) |
772 | for (i = NUMPRI; i--; ) |
678 | array_free (pending, [i]); |
773 | array_free (pending, [i]); |
679 | |
774 | |
|
|
775 | /* have to use the microsoft-never-gets-it-right macro */ |
680 | array_free (fdchange, ); |
776 | array_free_microshit (fdchange); |
681 | array_free (timer, ); |
777 | array_free_microshit (timer); |
682 | array_free (periodic, ); |
778 | array_free_microshit (periodic); |
683 | array_free (idle, ); |
779 | array_free_microshit (idle); |
684 | array_free (prepare, ); |
780 | array_free_microshit (prepare); |
685 | array_free (check, ); |
781 | array_free_microshit (check); |
686 | |
782 | |
687 | method = 0; |
783 | method = 0; |
688 | /*TODO*/ |
|
|
689 | } |
784 | } |
690 | |
785 | |
691 | void |
786 | static void |
692 | loop_fork (EV_P) |
787 | loop_fork (EV_P) |
693 | { |
788 | { |
694 | /*TODO*/ |
|
|
695 | #if EV_USE_EPOLL |
789 | #if EV_USE_EPOLL |
696 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
790 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
697 | #endif |
791 | #endif |
698 | #if EV_USE_KQUEUE |
792 | #if EV_USE_KQUEUE |
699 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
793 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
700 | #endif |
794 | #endif |
|
|
795 | |
|
|
796 | if (ev_is_active (&sigev)) |
|
|
797 | { |
|
|
798 | /* default loop */ |
|
|
799 | |
|
|
800 | ev_ref (EV_A); |
|
|
801 | ev_io_stop (EV_A_ &sigev); |
|
|
802 | close (sigpipe [0]); |
|
|
803 | close (sigpipe [1]); |
|
|
804 | |
|
|
805 | while (pipe (sigpipe)) |
|
|
806 | syserr ("(libev) error creating pipe"); |
|
|
807 | |
|
|
808 | siginit (EV_A); |
|
|
809 | } |
|
|
810 | |
|
|
811 | postfork = 0; |
701 | } |
812 | } |
702 | |
813 | |
703 | #if EV_MULTIPLICITY |
814 | #if EV_MULTIPLICITY |
704 | struct ev_loop * |
815 | struct ev_loop * |
705 | ev_loop_new (int methods) |
816 | ev_loop_new (int methods) |
706 | { |
817 | { |
707 | struct ev_loop *loop = (struct ev_loop *)calloc (1, sizeof (struct ev_loop)); |
818 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
819 | |
|
|
820 | memset (loop, 0, sizeof (struct ev_loop)); |
708 | |
821 | |
709 | loop_init (EV_A_ methods); |
822 | loop_init (EV_A_ methods); |
710 | |
823 | |
711 | if (ev_method (EV_A)) |
824 | if (ev_method (EV_A)) |
712 | return loop; |
825 | return loop; |
… | |
… | |
716 | |
829 | |
717 | void |
830 | void |
718 | ev_loop_destroy (EV_P) |
831 | ev_loop_destroy (EV_P) |
719 | { |
832 | { |
720 | loop_destroy (EV_A); |
833 | loop_destroy (EV_A); |
721 | free (loop); |
834 | ev_free (loop); |
722 | } |
835 | } |
723 | |
836 | |
724 | void |
837 | void |
725 | ev_loop_fork (EV_P) |
838 | ev_loop_fork (EV_P) |
726 | { |
839 | { |
727 | loop_fork (EV_A); |
840 | postfork = 1; |
728 | } |
841 | } |
729 | |
842 | |
730 | #endif |
843 | #endif |
731 | |
844 | |
732 | #if EV_MULTIPLICITY |
845 | #if EV_MULTIPLICITY |
… | |
… | |
755 | |
868 | |
756 | loop_init (EV_A_ methods); |
869 | loop_init (EV_A_ methods); |
757 | |
870 | |
758 | if (ev_method (EV_A)) |
871 | if (ev_method (EV_A)) |
759 | { |
872 | { |
760 | ev_watcher_init (&sigev, sigcb); |
|
|
761 | ev_set_priority (&sigev, EV_MAXPRI); |
|
|
762 | siginit (EV_A); |
873 | siginit (EV_A); |
763 | |
874 | |
764 | #ifndef WIN32 |
875 | #ifndef WIN32 |
765 | ev_signal_init (&childev, childcb, SIGCHLD); |
876 | ev_signal_init (&childev, childcb, SIGCHLD); |
766 | ev_set_priority (&childev, EV_MAXPRI); |
877 | ev_set_priority (&childev, EV_MAXPRI); |
… | |
… | |
780 | { |
891 | { |
781 | #if EV_MULTIPLICITY |
892 | #if EV_MULTIPLICITY |
782 | struct ev_loop *loop = default_loop; |
893 | struct ev_loop *loop = default_loop; |
783 | #endif |
894 | #endif |
784 | |
895 | |
|
|
896 | #ifndef WIN32 |
785 | ev_ref (EV_A); /* child watcher */ |
897 | ev_ref (EV_A); /* child watcher */ |
786 | ev_signal_stop (EV_A_ &childev); |
898 | ev_signal_stop (EV_A_ &childev); |
|
|
899 | #endif |
787 | |
900 | |
788 | ev_ref (EV_A); /* signal watcher */ |
901 | ev_ref (EV_A); /* signal watcher */ |
789 | ev_io_stop (EV_A_ &sigev); |
902 | ev_io_stop (EV_A_ &sigev); |
790 | |
903 | |
791 | close (sigpipe [0]); sigpipe [0] = 0; |
904 | close (sigpipe [0]); sigpipe [0] = 0; |
… | |
… | |
799 | { |
912 | { |
800 | #if EV_MULTIPLICITY |
913 | #if EV_MULTIPLICITY |
801 | struct ev_loop *loop = default_loop; |
914 | struct ev_loop *loop = default_loop; |
802 | #endif |
915 | #endif |
803 | |
916 | |
804 | loop_fork (EV_A); |
917 | if (method) |
805 | |
918 | postfork = 1; |
806 | ev_io_stop (EV_A_ &sigev); |
|
|
807 | close (sigpipe [0]); |
|
|
808 | close (sigpipe [1]); |
|
|
809 | pipe (sigpipe); |
|
|
810 | |
|
|
811 | ev_ref (EV_A); /* signal watcher */ |
|
|
812 | siginit (EV_A); |
|
|
813 | } |
919 | } |
814 | |
920 | |
815 | /*****************************************************************************/ |
921 | /*****************************************************************************/ |
|
|
922 | |
|
|
923 | static int |
|
|
924 | any_pending (EV_P) |
|
|
925 | { |
|
|
926 | int pri; |
|
|
927 | |
|
|
928 | for (pri = NUMPRI; pri--; ) |
|
|
929 | if (pendingcnt [pri]) |
|
|
930 | return 1; |
|
|
931 | |
|
|
932 | return 0; |
|
|
933 | } |
816 | |
934 | |
817 | static void |
935 | static void |
818 | call_pending (EV_P) |
936 | call_pending (EV_P) |
819 | { |
937 | { |
820 | int pri; |
938 | int pri; |
… | |
… | |
849 | downheap ((WT *)timers, timercnt, 0); |
967 | downheap ((WT *)timers, timercnt, 0); |
850 | } |
968 | } |
851 | else |
969 | else |
852 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
970 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
853 | |
971 | |
854 | event (EV_A_ (W)w, EV_TIMEOUT); |
972 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
855 | } |
973 | } |
856 | } |
974 | } |
857 | |
975 | |
858 | static void |
976 | static void |
859 | periodics_reify (EV_P) |
977 | periodics_reify (EV_P) |
… | |
… | |
863 | struct ev_periodic *w = periodics [0]; |
981 | struct ev_periodic *w = periodics [0]; |
864 | |
982 | |
865 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
983 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
866 | |
984 | |
867 | /* first reschedule or stop timer */ |
985 | /* first reschedule or stop timer */ |
|
|
986 | if (w->reschedule_cb) |
|
|
987 | { |
|
|
988 | ev_tstamp at = ((WT)w)->at = w->reschedule_cb (w, rt_now + 0.0001); |
|
|
989 | |
|
|
990 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > rt_now)); |
|
|
991 | downheap ((WT *)periodics, periodiccnt, 0); |
|
|
992 | } |
868 | if (w->interval) |
993 | else if (w->interval) |
869 | { |
994 | { |
870 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
995 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
871 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
996 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
872 | downheap ((WT *)periodics, periodiccnt, 0); |
997 | downheap ((WT *)periodics, periodiccnt, 0); |
873 | } |
998 | } |
874 | else |
999 | else |
875 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1000 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
876 | |
1001 | |
877 | event (EV_A_ (W)w, EV_PERIODIC); |
1002 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
878 | } |
1003 | } |
879 | } |
1004 | } |
880 | |
1005 | |
881 | static void |
1006 | static void |
882 | periodics_reschedule (EV_P) |
1007 | periodics_reschedule (EV_P) |
… | |
… | |
886 | /* adjust periodics after time jump */ |
1011 | /* adjust periodics after time jump */ |
887 | for (i = 0; i < periodiccnt; ++i) |
1012 | for (i = 0; i < periodiccnt; ++i) |
888 | { |
1013 | { |
889 | struct ev_periodic *w = periodics [i]; |
1014 | struct ev_periodic *w = periodics [i]; |
890 | |
1015 | |
|
|
1016 | if (w->reschedule_cb) |
|
|
1017 | ((WT)w)->at = w->reschedule_cb (w, rt_now); |
891 | if (w->interval) |
1018 | else if (w->interval) |
892 | { |
|
|
893 | ev_tstamp diff = ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1019 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
894 | |
|
|
895 | if (fabs (diff) >= 1e-4) |
|
|
896 | { |
|
|
897 | ev_periodic_stop (EV_A_ w); |
|
|
898 | ev_periodic_start (EV_A_ w); |
|
|
899 | |
|
|
900 | i = 0; /* restart loop, inefficient, but time jumps should be rare */ |
|
|
901 | } |
|
|
902 | } |
|
|
903 | } |
1020 | } |
|
|
1021 | |
|
|
1022 | /* now rebuild the heap */ |
|
|
1023 | for (i = periodiccnt >> 1; i--; ) |
|
|
1024 | downheap ((WT *)periodics, periodiccnt, i); |
904 | } |
1025 | } |
905 | |
1026 | |
906 | inline int |
1027 | inline int |
907 | time_update_monotonic (EV_P) |
1028 | time_update_monotonic (EV_P) |
908 | { |
1029 | { |
… | |
… | |
995 | { |
1116 | { |
996 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1117 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
997 | call_pending (EV_A); |
1118 | call_pending (EV_A); |
998 | } |
1119 | } |
999 | |
1120 | |
|
|
1121 | /* we might have forked, so reify kernel state if necessary */ |
|
|
1122 | if (expect_false (postfork)) |
|
|
1123 | loop_fork (EV_A); |
|
|
1124 | |
1000 | /* update fd-related kernel structures */ |
1125 | /* update fd-related kernel structures */ |
1001 | fd_reify (EV_A); |
1126 | fd_reify (EV_A); |
1002 | |
1127 | |
1003 | /* calculate blocking time */ |
1128 | /* calculate blocking time */ |
1004 | |
1129 | |
1005 | /* we only need this for !monotonic clockor timers, but as we basically |
1130 | /* we only need this for !monotonic clock or timers, but as we basically |
1006 | always have timers, we just calculate it always */ |
1131 | always have timers, we just calculate it always */ |
1007 | #if EV_USE_MONOTONIC |
1132 | #if EV_USE_MONOTONIC |
1008 | if (expect_true (have_monotonic)) |
1133 | if (expect_true (have_monotonic)) |
1009 | time_update_monotonic (EV_A); |
1134 | time_update_monotonic (EV_A); |
1010 | else |
1135 | else |
… | |
… | |
1043 | /* queue pending timers and reschedule them */ |
1168 | /* queue pending timers and reschedule them */ |
1044 | timers_reify (EV_A); /* relative timers called last */ |
1169 | timers_reify (EV_A); /* relative timers called last */ |
1045 | periodics_reify (EV_A); /* absolute timers called first */ |
1170 | periodics_reify (EV_A); /* absolute timers called first */ |
1046 | |
1171 | |
1047 | /* queue idle watchers unless io or timers are pending */ |
1172 | /* queue idle watchers unless io or timers are pending */ |
1048 | if (!pendingcnt) |
1173 | if (idlecnt && !any_pending (EV_A)) |
1049 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1174 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1050 | |
1175 | |
1051 | /* queue check watchers, to be executed first */ |
1176 | /* queue check watchers, to be executed first */ |
1052 | if (checkcnt) |
1177 | if (checkcnt) |
1053 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1178 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
… | |
… | |
1128 | return; |
1253 | return; |
1129 | |
1254 | |
1130 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1255 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1131 | |
1256 | |
1132 | ev_start (EV_A_ (W)w, 1); |
1257 | ev_start (EV_A_ (W)w, 1); |
1133 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
1258 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1134 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1259 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1135 | |
1260 | |
1136 | fd_change (EV_A_ fd); |
1261 | fd_change (EV_A_ fd); |
1137 | } |
1262 | } |
1138 | |
1263 | |
… | |
… | |
1158 | ((WT)w)->at += mn_now; |
1283 | ((WT)w)->at += mn_now; |
1159 | |
1284 | |
1160 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1285 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1161 | |
1286 | |
1162 | ev_start (EV_A_ (W)w, ++timercnt); |
1287 | ev_start (EV_A_ (W)w, ++timercnt); |
1163 | array_needsize (timers, timermax, timercnt, ); |
1288 | array_needsize (struct ev_timer *, timers, timermax, timercnt, (void)); |
1164 | timers [timercnt - 1] = w; |
1289 | timers [timercnt - 1] = w; |
1165 | upheap ((WT *)timers, timercnt - 1); |
1290 | upheap ((WT *)timers, timercnt - 1); |
1166 | |
1291 | |
1167 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1292 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1168 | } |
1293 | } |
… | |
… | |
1208 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
1333 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
1209 | { |
1334 | { |
1210 | if (ev_is_active (w)) |
1335 | if (ev_is_active (w)) |
1211 | return; |
1336 | return; |
1212 | |
1337 | |
|
|
1338 | if (w->reschedule_cb) |
|
|
1339 | ((WT)w)->at = w->reschedule_cb (w, rt_now); |
|
|
1340 | else if (w->interval) |
|
|
1341 | { |
1213 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1342 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1214 | |
|
|
1215 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1343 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1216 | if (w->interval) |
|
|
1217 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1344 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
|
|
1345 | } |
1218 | |
1346 | |
1219 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1347 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1220 | array_needsize (periodics, periodicmax, periodiccnt, ); |
1348 | array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void)); |
1221 | periodics [periodiccnt - 1] = w; |
1349 | periodics [periodiccnt - 1] = w; |
1222 | upheap ((WT *)periodics, periodiccnt - 1); |
1350 | upheap ((WT *)periodics, periodiccnt - 1); |
1223 | |
1351 | |
1224 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1352 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1225 | } |
1353 | } |
… | |
… | |
1241 | |
1369 | |
1242 | ev_stop (EV_A_ (W)w); |
1370 | ev_stop (EV_A_ (W)w); |
1243 | } |
1371 | } |
1244 | |
1372 | |
1245 | void |
1373 | void |
|
|
1374 | ev_periodic_again (EV_P_ struct ev_periodic *w) |
|
|
1375 | { |
|
|
1376 | ev_periodic_stop (EV_A_ w); |
|
|
1377 | ev_periodic_start (EV_A_ w); |
|
|
1378 | } |
|
|
1379 | |
|
|
1380 | void |
1246 | ev_idle_start (EV_P_ struct ev_idle *w) |
1381 | ev_idle_start (EV_P_ struct ev_idle *w) |
1247 | { |
1382 | { |
1248 | if (ev_is_active (w)) |
1383 | if (ev_is_active (w)) |
1249 | return; |
1384 | return; |
1250 | |
1385 | |
1251 | ev_start (EV_A_ (W)w, ++idlecnt); |
1386 | ev_start (EV_A_ (W)w, ++idlecnt); |
1252 | array_needsize (idles, idlemax, idlecnt, ); |
1387 | array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void)); |
1253 | idles [idlecnt - 1] = w; |
1388 | idles [idlecnt - 1] = w; |
1254 | } |
1389 | } |
1255 | |
1390 | |
1256 | void |
1391 | void |
1257 | ev_idle_stop (EV_P_ struct ev_idle *w) |
1392 | ev_idle_stop (EV_P_ struct ev_idle *w) |
… | |
… | |
1269 | { |
1404 | { |
1270 | if (ev_is_active (w)) |
1405 | if (ev_is_active (w)) |
1271 | return; |
1406 | return; |
1272 | |
1407 | |
1273 | ev_start (EV_A_ (W)w, ++preparecnt); |
1408 | ev_start (EV_A_ (W)w, ++preparecnt); |
1274 | array_needsize (prepares, preparemax, preparecnt, ); |
1409 | array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void)); |
1275 | prepares [preparecnt - 1] = w; |
1410 | prepares [preparecnt - 1] = w; |
1276 | } |
1411 | } |
1277 | |
1412 | |
1278 | void |
1413 | void |
1279 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1414 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
… | |
… | |
1291 | { |
1426 | { |
1292 | if (ev_is_active (w)) |
1427 | if (ev_is_active (w)) |
1293 | return; |
1428 | return; |
1294 | |
1429 | |
1295 | ev_start (EV_A_ (W)w, ++checkcnt); |
1430 | ev_start (EV_A_ (W)w, ++checkcnt); |
1296 | array_needsize (checks, checkmax, checkcnt, ); |
1431 | array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void)); |
1297 | checks [checkcnt - 1] = w; |
1432 | checks [checkcnt - 1] = w; |
1298 | } |
1433 | } |
1299 | |
1434 | |
1300 | void |
1435 | void |
1301 | ev_check_stop (EV_P_ struct ev_check *w) |
1436 | ev_check_stop (EV_P_ struct ev_check *w) |
… | |
… | |
1322 | return; |
1457 | return; |
1323 | |
1458 | |
1324 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1459 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1325 | |
1460 | |
1326 | ev_start (EV_A_ (W)w, 1); |
1461 | ev_start (EV_A_ (W)w, 1); |
1327 | array_needsize (signals, signalmax, w->signum, signals_init); |
1462 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
1328 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1463 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1329 | |
1464 | |
1330 | if (!((WL)w)->next) |
1465 | if (!((WL)w)->next) |
1331 | { |
1466 | { |
1332 | #if WIN32 |
1467 | #if WIN32 |
… | |
… | |
1395 | void (*cb)(int revents, void *arg) = once->cb; |
1530 | void (*cb)(int revents, void *arg) = once->cb; |
1396 | void *arg = once->arg; |
1531 | void *arg = once->arg; |
1397 | |
1532 | |
1398 | ev_io_stop (EV_A_ &once->io); |
1533 | ev_io_stop (EV_A_ &once->io); |
1399 | ev_timer_stop (EV_A_ &once->to); |
1534 | ev_timer_stop (EV_A_ &once->to); |
1400 | free (once); |
1535 | ev_free (once); |
1401 | |
1536 | |
1402 | cb (revents, arg); |
1537 | cb (revents, arg); |
1403 | } |
1538 | } |
1404 | |
1539 | |
1405 | static void |
1540 | static void |
… | |
… | |
1415 | } |
1550 | } |
1416 | |
1551 | |
1417 | void |
1552 | void |
1418 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1553 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1419 | { |
1554 | { |
1420 | struct ev_once *once = malloc (sizeof (struct ev_once)); |
1555 | struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1421 | |
1556 | |
1422 | if (!once) |
1557 | if (!once) |
1423 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1558 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1424 | else |
1559 | else |
1425 | { |
1560 | { |