… | |
… | |
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
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. |
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 | */ |
30 | */ |
31 | #ifndef EV_STANDALONE |
31 | #ifndef EV_STANDALONE |
32 | # include "config.h" |
32 | # include "config.h" |
|
|
33 | |
|
|
34 | # if HAVE_CLOCK_GETTIME |
|
|
35 | # define EV_USE_MONOTONIC 1 |
|
|
36 | # define EV_USE_REALTIME 1 |
|
|
37 | # endif |
|
|
38 | |
|
|
39 | # if HAVE_SELECT && HAVE_SYS_SELECT_H |
|
|
40 | # define EV_USE_SELECT 1 |
|
|
41 | # endif |
|
|
42 | |
|
|
43 | # if HAVE_POLL && HAVE_POLL_H |
|
|
44 | # define EV_USE_POLL 1 |
|
|
45 | # endif |
|
|
46 | |
|
|
47 | # if HAVE_EPOLL && HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H |
|
|
48 | # define EV_USE_EPOLL 1 |
|
|
49 | # endif |
|
|
50 | |
|
|
51 | # if HAVE_KQUEUE && HAVE_WORKING_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H |
|
|
52 | # define EV_USE_KQUEUE 1 |
|
|
53 | # endif |
|
|
54 | |
33 | #endif |
55 | #endif |
34 | |
56 | |
35 | #include <math.h> |
57 | #include <math.h> |
36 | #include <stdlib.h> |
58 | #include <stdlib.h> |
37 | #include <unistd.h> |
|
|
38 | #include <fcntl.h> |
59 | #include <fcntl.h> |
39 | #include <signal.h> |
|
|
40 | #include <stddef.h> |
60 | #include <stddef.h> |
41 | |
61 | |
42 | #include <stdio.h> |
62 | #include <stdio.h> |
43 | |
63 | |
44 | #include <assert.h> |
64 | #include <assert.h> |
45 | #include <errno.h> |
65 | #include <errno.h> |
46 | #include <sys/types.h> |
66 | #include <sys/types.h> |
|
|
67 | #include <time.h> |
|
|
68 | |
|
|
69 | #include <signal.h> |
|
|
70 | |
47 | #ifndef WIN32 |
71 | #ifndef WIN32 |
|
|
72 | # include <unistd.h> |
|
|
73 | # include <sys/time.h> |
48 | # include <sys/wait.h> |
74 | # include <sys/wait.h> |
49 | #endif |
75 | #endif |
50 | #include <sys/time.h> |
|
|
51 | #include <time.h> |
|
|
52 | |
|
|
53 | /**/ |
76 | /**/ |
54 | |
77 | |
55 | #ifndef EV_USE_MONOTONIC |
78 | #ifndef EV_USE_MONOTONIC |
56 | # define EV_USE_MONOTONIC 1 |
79 | # define EV_USE_MONOTONIC 1 |
57 | #endif |
80 | #endif |
58 | |
81 | |
59 | #ifndef EV_USE_SELECT |
82 | #ifndef EV_USE_SELECT |
60 | # define EV_USE_SELECT 1 |
83 | # define EV_USE_SELECT 1 |
61 | #endif |
84 | #endif |
62 | |
85 | |
63 | #ifndef EV_USEV_POLL |
86 | #ifndef EV_USE_POLL |
64 | # define EV_USEV_POLL 0 /* poll is usually slower than select, and not as well tested */ |
87 | # define EV_USE_POLL 0 /* poll is usually slower than select, and not as well tested */ |
65 | #endif |
88 | #endif |
66 | |
89 | |
67 | #ifndef EV_USE_EPOLL |
90 | #ifndef EV_USE_EPOLL |
68 | # define EV_USE_EPOLL 0 |
91 | # define EV_USE_EPOLL 0 |
69 | #endif |
92 | #endif |
70 | |
93 | |
71 | #ifndef EV_USE_KQUEUE |
94 | #ifndef EV_USE_KQUEUE |
72 | # define EV_USE_KQUEUE 0 |
95 | # define EV_USE_KQUEUE 0 |
|
|
96 | #endif |
|
|
97 | |
|
|
98 | #ifndef EV_USE_WIN32 |
|
|
99 | # ifdef WIN32 |
|
|
100 | # define EV_USE_WIN32 0 /* it does not exist, use select */ |
|
|
101 | # undef EV_USE_SELECT |
|
|
102 | # define EV_USE_SELECT 1 |
|
|
103 | # else |
|
|
104 | # define EV_USE_WIN32 0 |
|
|
105 | # endif |
73 | #endif |
106 | #endif |
74 | |
107 | |
75 | #ifndef EV_USE_REALTIME |
108 | #ifndef EV_USE_REALTIME |
76 | # define EV_USE_REALTIME 1 |
109 | # define EV_USE_REALTIME 1 |
77 | #endif |
110 | #endif |
… | |
… | |
115 | typedef struct ev_watcher_list *WL; |
148 | typedef struct ev_watcher_list *WL; |
116 | typedef struct ev_watcher_time *WT; |
149 | typedef struct ev_watcher_time *WT; |
117 | |
150 | |
118 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
151 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
119 | |
152 | |
|
|
153 | #include "ev_win32.c" |
|
|
154 | |
120 | /*****************************************************************************/ |
155 | /*****************************************************************************/ |
121 | |
156 | |
|
|
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) |
|
|
202 | |
|
|
203 | /*****************************************************************************/ |
|
|
204 | |
122 | typedef struct |
205 | typedef struct |
123 | { |
206 | { |
124 | struct ev_watcher_list *head; |
207 | WL head; |
125 | unsigned char events; |
208 | unsigned char events; |
126 | unsigned char reify; |
209 | unsigned char reify; |
127 | } ANFD; |
210 | } ANFD; |
128 | |
211 | |
129 | typedef struct |
212 | typedef struct |
… | |
… | |
185 | ev_now (EV_P) |
268 | ev_now (EV_P) |
186 | { |
269 | { |
187 | return rt_now; |
270 | return rt_now; |
188 | } |
271 | } |
189 | |
272 | |
190 | #define array_roundsize(base,n) ((n) | 4 & ~3) |
273 | #define array_roundsize(type,n) ((n) | 4 & ~3) |
191 | |
274 | |
192 | #define array_needsize(base,cur,cnt,init) \ |
275 | #define array_needsize(type,base,cur,cnt,init) \ |
193 | if (expect_false ((cnt) > cur)) \ |
276 | if (expect_false ((cnt) > cur)) \ |
194 | { \ |
277 | { \ |
195 | int newcnt = cur; \ |
278 | int newcnt = cur; \ |
196 | do \ |
279 | do \ |
197 | { \ |
280 | { \ |
198 | newcnt = array_roundsize (base, newcnt << 1); \ |
281 | newcnt = array_roundsize (type, newcnt << 1); \ |
199 | } \ |
282 | } \ |
200 | while ((cnt) > newcnt); \ |
283 | while ((cnt) > newcnt); \ |
201 | \ |
284 | \ |
202 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
285 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
203 | init (base + cur, newcnt - cur); \ |
286 | init (base + cur, newcnt - cur); \ |
204 | cur = newcnt; \ |
287 | cur = newcnt; \ |
205 | } |
288 | } |
|
|
289 | |
|
|
290 | #define array_slim(type,stem) \ |
|
|
291 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
|
|
292 | { \ |
|
|
293 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
|
|
294 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
|
|
295 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
|
|
296 | } |
|
|
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 | |
|
|
303 | #define array_free(stem, idx) \ |
|
|
304 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
206 | |
305 | |
207 | /*****************************************************************************/ |
306 | /*****************************************************************************/ |
208 | |
307 | |
209 | static void |
308 | static void |
210 | anfds_init (ANFD *base, int count) |
309 | anfds_init (ANFD *base, int count) |
… | |
… | |
227 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
326 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
228 | return; |
327 | return; |
229 | } |
328 | } |
230 | |
329 | |
231 | w->pending = ++pendingcnt [ABSPRI (w)]; |
330 | w->pending = ++pendingcnt [ABSPRI (w)]; |
232 | array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], ); |
331 | array_needsize (ANPENDING, pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], (void)); |
233 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
332 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
234 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
333 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
235 | } |
334 | } |
236 | |
335 | |
237 | static void |
336 | static void |
… | |
… | |
276 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
375 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
277 | events |= w->events; |
376 | events |= w->events; |
278 | |
377 | |
279 | anfd->reify = 0; |
378 | anfd->reify = 0; |
280 | |
379 | |
281 | if (anfd->events != events) |
|
|
282 | { |
|
|
283 | method_modify (EV_A_ fd, anfd->events, events); |
380 | method_modify (EV_A_ fd, anfd->events, events); |
284 | anfd->events = events; |
381 | anfd->events = events; |
285 | } |
|
|
286 | } |
382 | } |
287 | |
383 | |
288 | fdchangecnt = 0; |
384 | fdchangecnt = 0; |
289 | } |
385 | } |
290 | |
386 | |
291 | static void |
387 | static void |
292 | fd_change (EV_P_ int fd) |
388 | fd_change (EV_P_ int fd) |
293 | { |
389 | { |
294 | if (anfds [fd].reify || fdchangecnt < 0) |
390 | if (anfds [fd].reify) |
295 | return; |
391 | return; |
296 | |
392 | |
297 | anfds [fd].reify = 1; |
393 | anfds [fd].reify = 1; |
298 | |
394 | |
299 | ++fdchangecnt; |
395 | ++fdchangecnt; |
300 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
396 | array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void)); |
301 | fdchanges [fdchangecnt - 1] = fd; |
397 | fdchanges [fdchangecnt - 1] = fd; |
302 | } |
398 | } |
303 | |
399 | |
304 | static void |
400 | static void |
305 | fd_kill (EV_P_ int fd) |
401 | fd_kill (EV_P_ int fd) |
… | |
… | |
311 | ev_io_stop (EV_A_ w); |
407 | ev_io_stop (EV_A_ w); |
312 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
408 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
313 | } |
409 | } |
314 | } |
410 | } |
315 | |
411 | |
|
|
412 | static int |
|
|
413 | fd_valid (int fd) |
|
|
414 | { |
|
|
415 | #ifdef WIN32 |
|
|
416 | return !!win32_get_osfhandle (fd); |
|
|
417 | #else |
|
|
418 | return fcntl (fd, F_GETFD) != -1; |
|
|
419 | #endif |
|
|
420 | } |
|
|
421 | |
316 | /* called on EBADF to verify fds */ |
422 | /* called on EBADF to verify fds */ |
317 | static void |
423 | static void |
318 | fd_ebadf (EV_P) |
424 | fd_ebadf (EV_P) |
319 | { |
425 | { |
320 | int fd; |
426 | int fd; |
321 | |
427 | |
322 | for (fd = 0; fd < anfdmax; ++fd) |
428 | for (fd = 0; fd < anfdmax; ++fd) |
323 | if (anfds [fd].events) |
429 | if (anfds [fd].events) |
324 | if (fcntl (fd, F_GETFD) == -1 && errno == EBADF) |
430 | if (!fd_valid (fd) == -1 && errno == EBADF) |
325 | fd_kill (EV_A_ fd); |
431 | fd_kill (EV_A_ fd); |
326 | } |
432 | } |
327 | |
433 | |
328 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
434 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
329 | static void |
435 | static void |
330 | fd_enomem (EV_P) |
436 | fd_enomem (EV_P) |
331 | { |
437 | { |
332 | int fd = anfdmax; |
438 | int fd; |
333 | |
439 | |
334 | while (fd--) |
440 | for (fd = anfdmax; fd--; ) |
335 | if (anfds [fd].events) |
441 | if (anfds [fd].events) |
336 | { |
442 | { |
337 | close (fd); |
|
|
338 | fd_kill (EV_A_ fd); |
443 | fd_kill (EV_A_ fd); |
339 | return; |
444 | return; |
340 | } |
445 | } |
341 | } |
446 | } |
342 | |
447 | |
343 | /* susually called after fork if method needs to re-arm all fds from scratch */ |
448 | /* usually called after fork if method needs to re-arm all fds from scratch */ |
344 | static void |
449 | static void |
345 | fd_rearm_all (EV_P) |
450 | fd_rearm_all (EV_P) |
346 | { |
451 | { |
347 | int fd; |
452 | int fd; |
348 | |
453 | |
349 | /* this should be highly optimised to not do anything but set a flag */ |
454 | /* this should be highly optimised to not do anything but set a flag */ |
350 | for (fd = 0; fd < anfdmax; ++fd) |
455 | for (fd = 0; fd < anfdmax; ++fd) |
351 | if (anfds [fd].events) |
456 | if (anfds [fd].events) |
352 | { |
457 | { |
353 | anfds [fd].events = 0; |
458 | anfds [fd].events = 0; |
354 | fd_change (fd); |
459 | fd_change (EV_A_ fd); |
355 | } |
460 | } |
356 | } |
461 | } |
357 | |
462 | |
358 | /*****************************************************************************/ |
463 | /*****************************************************************************/ |
359 | |
464 | |
… | |
… | |
363 | WT w = heap [k]; |
468 | WT w = heap [k]; |
364 | |
469 | |
365 | while (k && heap [k >> 1]->at > w->at) |
470 | while (k && heap [k >> 1]->at > w->at) |
366 | { |
471 | { |
367 | heap [k] = heap [k >> 1]; |
472 | heap [k] = heap [k >> 1]; |
368 | heap [k]->active = k + 1; |
473 | ((W)heap [k])->active = k + 1; |
369 | k >>= 1; |
474 | k >>= 1; |
370 | } |
475 | } |
371 | |
476 | |
372 | heap [k] = w; |
477 | heap [k] = w; |
373 | heap [k]->active = k + 1; |
478 | ((W)heap [k])->active = k + 1; |
374 | |
479 | |
375 | } |
480 | } |
376 | |
481 | |
377 | static void |
482 | static void |
378 | downheap (WT *heap, int N, int k) |
483 | downheap (WT *heap, int N, int k) |
… | |
… | |
388 | |
493 | |
389 | if (w->at <= heap [j]->at) |
494 | if (w->at <= heap [j]->at) |
390 | break; |
495 | break; |
391 | |
496 | |
392 | heap [k] = heap [j]; |
497 | heap [k] = heap [j]; |
393 | heap [k]->active = k + 1; |
498 | ((W)heap [k])->active = k + 1; |
394 | k = j; |
499 | k = j; |
395 | } |
500 | } |
396 | |
501 | |
397 | heap [k] = w; |
502 | heap [k] = w; |
398 | heap [k]->active = k + 1; |
503 | ((W)heap [k])->active = k + 1; |
399 | } |
504 | } |
400 | |
505 | |
401 | /*****************************************************************************/ |
506 | /*****************************************************************************/ |
402 | |
507 | |
403 | typedef struct |
508 | typedef struct |
404 | { |
509 | { |
405 | struct ev_watcher_list *head; |
510 | WL head; |
406 | sig_atomic_t volatile gotsig; |
511 | sig_atomic_t volatile gotsig; |
407 | } ANSIG; |
512 | } ANSIG; |
408 | |
513 | |
409 | static ANSIG *signals; |
514 | static ANSIG *signals; |
410 | static int signalmax; |
515 | static int signalmax; |
411 | |
516 | |
412 | static int sigpipe [2]; |
517 | static int sigpipe [2]; |
413 | static sig_atomic_t volatile gotsig; |
518 | static sig_atomic_t volatile gotsig; |
|
|
519 | static struct ev_io sigev; |
414 | |
520 | |
415 | static void |
521 | static void |
416 | signals_init (ANSIG *base, int count) |
522 | signals_init (ANSIG *base, int count) |
417 | { |
523 | { |
418 | while (count--) |
524 | while (count--) |
… | |
… | |
425 | } |
531 | } |
426 | |
532 | |
427 | static void |
533 | static void |
428 | sighandler (int signum) |
534 | sighandler (int signum) |
429 | { |
535 | { |
|
|
536 | #if WIN32 |
|
|
537 | signal (signum, sighandler); |
|
|
538 | #endif |
|
|
539 | |
430 | signals [signum - 1].gotsig = 1; |
540 | signals [signum - 1].gotsig = 1; |
431 | |
541 | |
432 | if (!gotsig) |
542 | if (!gotsig) |
433 | { |
543 | { |
434 | int old_errno = errno; |
544 | int old_errno = errno; |
435 | gotsig = 1; |
545 | gotsig = 1; |
|
|
546 | #ifdef WIN32 |
|
|
547 | send (sigpipe [1], &signum, 1, MSG_DONTWAIT); |
|
|
548 | #else |
436 | write (sigpipe [1], &signum, 1); |
549 | write (sigpipe [1], &signum, 1); |
|
|
550 | #endif |
437 | errno = old_errno; |
551 | errno = old_errno; |
438 | } |
552 | } |
439 | } |
553 | } |
440 | |
554 | |
441 | static void |
555 | static void |
442 | sigcb (EV_P_ struct ev_io *iow, int revents) |
556 | sigcb (EV_P_ struct ev_io *iow, int revents) |
443 | { |
557 | { |
444 | struct ev_watcher_list *w; |
558 | WL w; |
445 | int signum; |
559 | int signum; |
446 | |
560 | |
|
|
561 | #ifdef WIN32 |
|
|
562 | recv (sigpipe [0], &revents, 1, MSG_DONTWAIT); |
|
|
563 | #else |
447 | read (sigpipe [0], &revents, 1); |
564 | read (sigpipe [0], &revents, 1); |
|
|
565 | #endif |
448 | gotsig = 0; |
566 | gotsig = 0; |
449 | |
567 | |
450 | for (signum = signalmax; signum--; ) |
568 | for (signum = signalmax; signum--; ) |
451 | if (signals [signum].gotsig) |
569 | if (signals [signum].gotsig) |
452 | { |
570 | { |
… | |
… | |
474 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
592 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
475 | } |
593 | } |
476 | |
594 | |
477 | /*****************************************************************************/ |
595 | /*****************************************************************************/ |
478 | |
596 | |
|
|
597 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
598 | |
479 | #ifndef WIN32 |
599 | #ifndef WIN32 |
|
|
600 | |
|
|
601 | static struct ev_signal childev; |
480 | |
602 | |
481 | #ifndef WCONTINUED |
603 | #ifndef WCONTINUED |
482 | # define WCONTINUED 0 |
604 | # define WCONTINUED 0 |
483 | #endif |
605 | #endif |
484 | |
606 | |
… | |
… | |
488 | struct ev_child *w; |
610 | struct ev_child *w; |
489 | |
611 | |
490 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
612 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
491 | if (w->pid == pid || !w->pid) |
613 | if (w->pid == pid || !w->pid) |
492 | { |
614 | { |
493 | w->priority = sw->priority; /* need to do it *now* */ |
615 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
494 | w->rpid = pid; |
616 | w->rpid = pid; |
495 | w->rstatus = status; |
617 | w->rstatus = status; |
496 | event (EV_A_ (W)w, EV_CHILD); |
618 | event (EV_A_ (W)w, EV_CHILD); |
497 | } |
619 | } |
498 | } |
620 | } |
499 | |
621 | |
500 | static void |
622 | static void |
… | |
… | |
520 | # include "ev_kqueue.c" |
642 | # include "ev_kqueue.c" |
521 | #endif |
643 | #endif |
522 | #if EV_USE_EPOLL |
644 | #if EV_USE_EPOLL |
523 | # include "ev_epoll.c" |
645 | # include "ev_epoll.c" |
524 | #endif |
646 | #endif |
525 | #if EV_USEV_POLL |
647 | #if EV_USE_POLL |
526 | # include "ev_poll.c" |
648 | # include "ev_poll.c" |
527 | #endif |
649 | #endif |
528 | #if EV_USE_SELECT |
650 | #if EV_USE_SELECT |
529 | # include "ev_select.c" |
651 | # include "ev_select.c" |
530 | #endif |
652 | #endif |
… | |
… | |
582 | methods = atoi (getenv ("LIBEV_METHODS")); |
704 | methods = atoi (getenv ("LIBEV_METHODS")); |
583 | else |
705 | else |
584 | methods = EVMETHOD_ANY; |
706 | methods = EVMETHOD_ANY; |
585 | |
707 | |
586 | method = 0; |
708 | method = 0; |
|
|
709 | #if EV_USE_WIN32 |
|
|
710 | if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
|
|
711 | #endif |
587 | #if EV_USE_KQUEUE |
712 | #if EV_USE_KQUEUE |
588 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
713 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
589 | #endif |
714 | #endif |
590 | #if EV_USE_EPOLL |
715 | #if EV_USE_EPOLL |
591 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
716 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
592 | #endif |
717 | #endif |
593 | #if EV_USEV_POLL |
718 | #if EV_USE_POLL |
594 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
719 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
595 | #endif |
720 | #endif |
596 | #if EV_USE_SELECT |
721 | #if EV_USE_SELECT |
597 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
722 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
598 | #endif |
723 | #endif |
|
|
724 | |
|
|
725 | ev_watcher_init (&sigev, sigcb); |
|
|
726 | ev_set_priority (&sigev, EV_MAXPRI); |
599 | } |
727 | } |
600 | } |
728 | } |
601 | |
729 | |
602 | void |
730 | void |
603 | loop_destroy (EV_P) |
731 | loop_destroy (EV_P) |
604 | { |
732 | { |
|
|
733 | int i; |
|
|
734 | |
|
|
735 | #if EV_USE_WIN32 |
|
|
736 | if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
|
|
737 | #endif |
605 | #if EV_USE_KQUEUE |
738 | #if EV_USE_KQUEUE |
606 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
739 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
607 | #endif |
740 | #endif |
608 | #if EV_USE_EPOLL |
741 | #if EV_USE_EPOLL |
609 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
742 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
610 | #endif |
743 | #endif |
611 | #if EV_USEV_POLL |
744 | #if EV_USE_POLL |
612 | if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
745 | if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
613 | #endif |
746 | #endif |
614 | #if EV_USE_SELECT |
747 | #if EV_USE_SELECT |
615 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
748 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
616 | #endif |
749 | #endif |
617 | |
750 | |
|
|
751 | for (i = NUMPRI; i--; ) |
|
|
752 | array_free (pending, [i]); |
|
|
753 | |
|
|
754 | /* have to use the microsoft-never-gets-it-right macro */ |
|
|
755 | array_free_microshit (fdchange); |
|
|
756 | array_free_microshit (timer); |
|
|
757 | array_free_microshit (periodic); |
|
|
758 | array_free_microshit (idle); |
|
|
759 | array_free_microshit (prepare); |
|
|
760 | array_free_microshit (check); |
|
|
761 | |
618 | method = 0; |
762 | method = 0; |
619 | /*TODO*/ |
|
|
620 | } |
763 | } |
621 | |
764 | |
622 | void |
765 | static void |
623 | loop_fork (EV_P) |
766 | loop_fork (EV_P) |
624 | { |
767 | { |
625 | /*TODO*/ |
|
|
626 | #if EV_USE_EPOLL |
768 | #if EV_USE_EPOLL |
627 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
769 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
628 | #endif |
770 | #endif |
629 | #if EV_USE_KQUEUE |
771 | #if EV_USE_KQUEUE |
630 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
772 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
631 | #endif |
773 | #endif |
|
|
774 | |
|
|
775 | if (ev_is_active (&sigev)) |
|
|
776 | { |
|
|
777 | /* default loop */ |
|
|
778 | |
|
|
779 | ev_ref (EV_A); |
|
|
780 | ev_io_stop (EV_A_ &sigev); |
|
|
781 | close (sigpipe [0]); |
|
|
782 | close (sigpipe [1]); |
|
|
783 | |
|
|
784 | while (pipe (sigpipe)) |
|
|
785 | syserr ("(libev) error creating pipe"); |
|
|
786 | |
|
|
787 | siginit (EV_A); |
|
|
788 | } |
|
|
789 | |
|
|
790 | postfork = 0; |
632 | } |
791 | } |
633 | |
792 | |
634 | #if EV_MULTIPLICITY |
793 | #if EV_MULTIPLICITY |
635 | struct ev_loop * |
794 | struct ev_loop * |
636 | ev_loop_new (int methods) |
795 | ev_loop_new (int methods) |
637 | { |
796 | { |
638 | struct ev_loop *loop = (struct ev_loop *)calloc (1, sizeof (struct ev_loop)); |
797 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
798 | |
|
|
799 | memset (loop, 0, sizeof (struct ev_loop)); |
639 | |
800 | |
640 | loop_init (EV_A_ methods); |
801 | loop_init (EV_A_ methods); |
641 | |
802 | |
642 | if (ev_methods (EV_A)) |
803 | if (ev_method (EV_A)) |
643 | return loop; |
804 | return loop; |
644 | |
805 | |
645 | return 0; |
806 | return 0; |
646 | } |
807 | } |
647 | |
808 | |
648 | void |
809 | void |
649 | ev_loop_destroy (EV_P) |
810 | ev_loop_destroy (EV_P) |
650 | { |
811 | { |
651 | loop_destroy (EV_A); |
812 | loop_destroy (EV_A); |
652 | free (loop); |
813 | ev_free (loop); |
653 | } |
814 | } |
654 | |
815 | |
655 | void |
816 | void |
656 | ev_loop_fork (EV_P) |
817 | ev_loop_fork (EV_P) |
657 | { |
818 | { |
658 | loop_fork (EV_A); |
819 | postfork = 1; |
659 | } |
820 | } |
660 | |
821 | |
661 | #endif |
822 | #endif |
662 | |
823 | |
663 | #if EV_MULTIPLICITY |
824 | #if EV_MULTIPLICITY |
… | |
… | |
686 | |
847 | |
687 | loop_init (EV_A_ methods); |
848 | loop_init (EV_A_ methods); |
688 | |
849 | |
689 | if (ev_method (EV_A)) |
850 | if (ev_method (EV_A)) |
690 | { |
851 | { |
691 | ev_watcher_init (&sigev, sigcb); |
|
|
692 | ev_set_priority (&sigev, EV_MAXPRI); |
|
|
693 | siginit (EV_A); |
852 | siginit (EV_A); |
694 | |
853 | |
695 | #ifndef WIN32 |
854 | #ifndef WIN32 |
696 | ev_signal_init (&childev, childcb, SIGCHLD); |
855 | ev_signal_init (&childev, childcb, SIGCHLD); |
697 | ev_set_priority (&childev, EV_MAXPRI); |
856 | ev_set_priority (&childev, EV_MAXPRI); |
… | |
… | |
711 | { |
870 | { |
712 | #if EV_MULTIPLICITY |
871 | #if EV_MULTIPLICITY |
713 | struct ev_loop *loop = default_loop; |
872 | struct ev_loop *loop = default_loop; |
714 | #endif |
873 | #endif |
715 | |
874 | |
|
|
875 | #ifndef WIN32 |
716 | ev_ref (EV_A); /* child watcher */ |
876 | ev_ref (EV_A); /* child watcher */ |
717 | ev_signal_stop (EV_A_ &childev); |
877 | ev_signal_stop (EV_A_ &childev); |
|
|
878 | #endif |
718 | |
879 | |
719 | ev_ref (EV_A); /* signal watcher */ |
880 | ev_ref (EV_A); /* signal watcher */ |
720 | ev_io_stop (EV_A_ &sigev); |
881 | ev_io_stop (EV_A_ &sigev); |
721 | |
882 | |
722 | close (sigpipe [0]); sigpipe [0] = 0; |
883 | close (sigpipe [0]); sigpipe [0] = 0; |
… | |
… | |
724 | |
885 | |
725 | loop_destroy (EV_A); |
886 | loop_destroy (EV_A); |
726 | } |
887 | } |
727 | |
888 | |
728 | void |
889 | void |
729 | ev_default_fork (EV_P) |
890 | ev_default_fork (void) |
730 | { |
891 | { |
731 | loop_fork (EV_A); |
892 | #if EV_MULTIPLICITY |
|
|
893 | struct ev_loop *loop = default_loop; |
|
|
894 | #endif |
732 | |
895 | |
733 | ev_io_stop (EV_A_ &sigev); |
896 | if (method) |
734 | close (sigpipe [0]); |
897 | postfork = 1; |
735 | close (sigpipe [1]); |
|
|
736 | pipe (sigpipe); |
|
|
737 | |
|
|
738 | ev_ref (EV_A); /* signal watcher */ |
|
|
739 | siginit (EV_A); |
|
|
740 | } |
898 | } |
741 | |
899 | |
742 | /*****************************************************************************/ |
900 | /*****************************************************************************/ |
|
|
901 | |
|
|
902 | static int |
|
|
903 | any_pending (EV_P) |
|
|
904 | { |
|
|
905 | int pri; |
|
|
906 | |
|
|
907 | for (pri = NUMPRI; pri--; ) |
|
|
908 | if (pendingcnt [pri]) |
|
|
909 | return 1; |
|
|
910 | |
|
|
911 | return 0; |
|
|
912 | } |
743 | |
913 | |
744 | static void |
914 | static void |
745 | call_pending (EV_P) |
915 | call_pending (EV_P) |
746 | { |
916 | { |
747 | int pri; |
917 | int pri; |
… | |
… | |
760 | } |
930 | } |
761 | |
931 | |
762 | static void |
932 | static void |
763 | timers_reify (EV_P) |
933 | timers_reify (EV_P) |
764 | { |
934 | { |
765 | while (timercnt && timers [0]->at <= mn_now) |
935 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
766 | { |
936 | { |
767 | struct ev_timer *w = timers [0]; |
937 | struct ev_timer *w = timers [0]; |
|
|
938 | |
|
|
939 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
768 | |
940 | |
769 | /* first reschedule or stop timer */ |
941 | /* first reschedule or stop timer */ |
770 | if (w->repeat) |
942 | if (w->repeat) |
771 | { |
943 | { |
772 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
944 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
773 | w->at = mn_now + w->repeat; |
945 | ((WT)w)->at = mn_now + w->repeat; |
774 | downheap ((WT *)timers, timercnt, 0); |
946 | downheap ((WT *)timers, timercnt, 0); |
775 | } |
947 | } |
776 | else |
948 | else |
777 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
949 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
778 | |
950 | |
… | |
… | |
781 | } |
953 | } |
782 | |
954 | |
783 | static void |
955 | static void |
784 | periodics_reify (EV_P) |
956 | periodics_reify (EV_P) |
785 | { |
957 | { |
786 | while (periodiccnt && periodics [0]->at <= rt_now) |
958 | while (periodiccnt && ((WT)periodics [0])->at <= rt_now) |
787 | { |
959 | { |
788 | struct ev_periodic *w = periodics [0]; |
960 | struct ev_periodic *w = periodics [0]; |
|
|
961 | |
|
|
962 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
789 | |
963 | |
790 | /* first reschedule or stop timer */ |
964 | /* first reschedule or stop timer */ |
791 | if (w->interval) |
965 | if (w->interval) |
792 | { |
966 | { |
793 | w->at += floor ((rt_now - w->at) / w->interval + 1.) * w->interval; |
967 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
794 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", w->at > rt_now)); |
968 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
795 | downheap ((WT *)periodics, periodiccnt, 0); |
969 | downheap ((WT *)periodics, periodiccnt, 0); |
796 | } |
970 | } |
797 | else |
971 | else |
798 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
972 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
799 | |
973 | |
… | |
… | |
811 | { |
985 | { |
812 | struct ev_periodic *w = periodics [i]; |
986 | struct ev_periodic *w = periodics [i]; |
813 | |
987 | |
814 | if (w->interval) |
988 | if (w->interval) |
815 | { |
989 | { |
816 | ev_tstamp diff = ceil ((rt_now - w->at) / w->interval) * w->interval; |
990 | ev_tstamp diff = ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
817 | |
991 | |
818 | if (fabs (diff) >= 1e-4) |
992 | if (fabs (diff) >= 1e-4) |
819 | { |
993 | { |
820 | ev_periodic_stop (EV_A_ w); |
994 | ev_periodic_stop (EV_A_ w); |
821 | ev_periodic_start (EV_A_ w); |
995 | ev_periodic_start (EV_A_ w); |
… | |
… | |
882 | { |
1056 | { |
883 | periodics_reschedule (EV_A); |
1057 | periodics_reschedule (EV_A); |
884 | |
1058 | |
885 | /* adjust timers. this is easy, as the offset is the same for all */ |
1059 | /* adjust timers. this is easy, as the offset is the same for all */ |
886 | for (i = 0; i < timercnt; ++i) |
1060 | for (i = 0; i < timercnt; ++i) |
887 | timers [i]->at += rt_now - mn_now; |
1061 | ((WT)timers [i])->at += rt_now - mn_now; |
888 | } |
1062 | } |
889 | |
1063 | |
890 | mn_now = rt_now; |
1064 | mn_now = rt_now; |
891 | } |
1065 | } |
892 | } |
1066 | } |
… | |
… | |
918 | { |
1092 | { |
919 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1093 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
920 | call_pending (EV_A); |
1094 | call_pending (EV_A); |
921 | } |
1095 | } |
922 | |
1096 | |
|
|
1097 | /* we might have forked, so reify kernel state if necessary */ |
|
|
1098 | if (expect_false (postfork)) |
|
|
1099 | loop_fork (EV_A); |
|
|
1100 | |
923 | /* update fd-related kernel structures */ |
1101 | /* update fd-related kernel structures */ |
924 | fd_reify (EV_A); |
1102 | fd_reify (EV_A); |
925 | |
1103 | |
926 | /* calculate blocking time */ |
1104 | /* calculate blocking time */ |
927 | |
1105 | |
928 | /* we only need this for !monotonic clockor timers, but as we basically |
1106 | /* we only need this for !monotonic clock or timers, but as we basically |
929 | always have timers, we just calculate it always */ |
1107 | always have timers, we just calculate it always */ |
930 | #if EV_USE_MONOTONIC |
1108 | #if EV_USE_MONOTONIC |
931 | if (expect_true (have_monotonic)) |
1109 | if (expect_true (have_monotonic)) |
932 | time_update_monotonic (EV_A); |
1110 | time_update_monotonic (EV_A); |
933 | else |
1111 | else |
… | |
… | |
943 | { |
1121 | { |
944 | block = MAX_BLOCKTIME; |
1122 | block = MAX_BLOCKTIME; |
945 | |
1123 | |
946 | if (timercnt) |
1124 | if (timercnt) |
947 | { |
1125 | { |
948 | ev_tstamp to = timers [0]->at - mn_now + method_fudge; |
1126 | ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
949 | if (block > to) block = to; |
1127 | if (block > to) block = to; |
950 | } |
1128 | } |
951 | |
1129 | |
952 | if (periodiccnt) |
1130 | if (periodiccnt) |
953 | { |
1131 | { |
954 | ev_tstamp to = periodics [0]->at - rt_now + method_fudge; |
1132 | ev_tstamp to = ((WT)periodics [0])->at - rt_now + method_fudge; |
955 | if (block > to) block = to; |
1133 | if (block > to) block = to; |
956 | } |
1134 | } |
957 | |
1135 | |
958 | if (block < 0.) block = 0.; |
1136 | if (block < 0.) block = 0.; |
959 | } |
1137 | } |
… | |
… | |
966 | /* queue pending timers and reschedule them */ |
1144 | /* queue pending timers and reschedule them */ |
967 | timers_reify (EV_A); /* relative timers called last */ |
1145 | timers_reify (EV_A); /* relative timers called last */ |
968 | periodics_reify (EV_A); /* absolute timers called first */ |
1146 | periodics_reify (EV_A); /* absolute timers called first */ |
969 | |
1147 | |
970 | /* queue idle watchers unless io or timers are pending */ |
1148 | /* queue idle watchers unless io or timers are pending */ |
971 | if (!pendingcnt) |
1149 | if (idlecnt && !any_pending (EV_A)) |
972 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1150 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
973 | |
1151 | |
974 | /* queue check watchers, to be executed first */ |
1152 | /* queue check watchers, to be executed first */ |
975 | if (checkcnt) |
1153 | if (checkcnt) |
976 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1154 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
… | |
… | |
1051 | return; |
1229 | return; |
1052 | |
1230 | |
1053 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1231 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1054 | |
1232 | |
1055 | ev_start (EV_A_ (W)w, 1); |
1233 | ev_start (EV_A_ (W)w, 1); |
1056 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
1234 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1057 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1235 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1058 | |
1236 | |
1059 | fd_change (EV_A_ fd); |
1237 | fd_change (EV_A_ fd); |
1060 | } |
1238 | } |
1061 | |
1239 | |
… | |
… | |
1076 | ev_timer_start (EV_P_ struct ev_timer *w) |
1254 | ev_timer_start (EV_P_ struct ev_timer *w) |
1077 | { |
1255 | { |
1078 | if (ev_is_active (w)) |
1256 | if (ev_is_active (w)) |
1079 | return; |
1257 | return; |
1080 | |
1258 | |
1081 | w->at += mn_now; |
1259 | ((WT)w)->at += mn_now; |
1082 | |
1260 | |
1083 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1261 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1084 | |
1262 | |
1085 | ev_start (EV_A_ (W)w, ++timercnt); |
1263 | ev_start (EV_A_ (W)w, ++timercnt); |
1086 | array_needsize (timers, timermax, timercnt, ); |
1264 | array_needsize (struct ev_timer *, timers, timermax, timercnt, (void)); |
1087 | timers [timercnt - 1] = w; |
1265 | timers [timercnt - 1] = w; |
1088 | upheap ((WT *)timers, timercnt - 1); |
1266 | upheap ((WT *)timers, timercnt - 1); |
|
|
1267 | |
|
|
1268 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1089 | } |
1269 | } |
1090 | |
1270 | |
1091 | void |
1271 | void |
1092 | ev_timer_stop (EV_P_ struct ev_timer *w) |
1272 | ev_timer_stop (EV_P_ struct ev_timer *w) |
1093 | { |
1273 | { |
1094 | ev_clear_pending (EV_A_ (W)w); |
1274 | ev_clear_pending (EV_A_ (W)w); |
1095 | if (!ev_is_active (w)) |
1275 | if (!ev_is_active (w)) |
1096 | return; |
1276 | return; |
1097 | |
1277 | |
|
|
1278 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1279 | |
1098 | if (w->active < timercnt--) |
1280 | if (((W)w)->active < timercnt--) |
1099 | { |
1281 | { |
1100 | timers [w->active - 1] = timers [timercnt]; |
1282 | timers [((W)w)->active - 1] = timers [timercnt]; |
1101 | downheap ((WT *)timers, timercnt, w->active - 1); |
1283 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1102 | } |
1284 | } |
1103 | |
1285 | |
1104 | w->at = w->repeat; |
1286 | ((WT)w)->at = w->repeat; |
1105 | |
1287 | |
1106 | ev_stop (EV_A_ (W)w); |
1288 | ev_stop (EV_A_ (W)w); |
1107 | } |
1289 | } |
1108 | |
1290 | |
1109 | void |
1291 | void |
… | |
… | |
1111 | { |
1293 | { |
1112 | if (ev_is_active (w)) |
1294 | if (ev_is_active (w)) |
1113 | { |
1295 | { |
1114 | if (w->repeat) |
1296 | if (w->repeat) |
1115 | { |
1297 | { |
1116 | w->at = mn_now + w->repeat; |
1298 | ((WT)w)->at = mn_now + w->repeat; |
1117 | downheap ((WT *)timers, timercnt, w->active - 1); |
1299 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1118 | } |
1300 | } |
1119 | else |
1301 | else |
1120 | ev_timer_stop (EV_A_ w); |
1302 | ev_timer_stop (EV_A_ w); |
1121 | } |
1303 | } |
1122 | else if (w->repeat) |
1304 | else if (w->repeat) |
… | |
… | |
1131 | |
1313 | |
1132 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1314 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1133 | |
1315 | |
1134 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1316 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1135 | if (w->interval) |
1317 | if (w->interval) |
1136 | w->at += ceil ((rt_now - w->at) / w->interval) * w->interval; |
1318 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1137 | |
1319 | |
1138 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1320 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1139 | array_needsize (periodics, periodicmax, periodiccnt, ); |
1321 | array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void)); |
1140 | periodics [periodiccnt - 1] = w; |
1322 | periodics [periodiccnt - 1] = w; |
1141 | upheap ((WT *)periodics, periodiccnt - 1); |
1323 | upheap ((WT *)periodics, periodiccnt - 1); |
|
|
1324 | |
|
|
1325 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1142 | } |
1326 | } |
1143 | |
1327 | |
1144 | void |
1328 | void |
1145 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1329 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1146 | { |
1330 | { |
1147 | ev_clear_pending (EV_A_ (W)w); |
1331 | ev_clear_pending (EV_A_ (W)w); |
1148 | if (!ev_is_active (w)) |
1332 | if (!ev_is_active (w)) |
1149 | return; |
1333 | return; |
1150 | |
1334 | |
|
|
1335 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
|
|
1336 | |
1151 | if (w->active < periodiccnt--) |
1337 | if (((W)w)->active < periodiccnt--) |
1152 | { |
1338 | { |
1153 | periodics [w->active - 1] = periodics [periodiccnt]; |
1339 | periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
1154 | downheap ((WT *)periodics, periodiccnt, w->active - 1); |
1340 | downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
1155 | } |
1341 | } |
1156 | |
1342 | |
1157 | ev_stop (EV_A_ (W)w); |
1343 | ev_stop (EV_A_ (W)w); |
1158 | } |
1344 | } |
1159 | |
1345 | |
… | |
… | |
1162 | { |
1348 | { |
1163 | if (ev_is_active (w)) |
1349 | if (ev_is_active (w)) |
1164 | return; |
1350 | return; |
1165 | |
1351 | |
1166 | ev_start (EV_A_ (W)w, ++idlecnt); |
1352 | ev_start (EV_A_ (W)w, ++idlecnt); |
1167 | array_needsize (idles, idlemax, idlecnt, ); |
1353 | array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void)); |
1168 | idles [idlecnt - 1] = w; |
1354 | idles [idlecnt - 1] = w; |
1169 | } |
1355 | } |
1170 | |
1356 | |
1171 | void |
1357 | void |
1172 | ev_idle_stop (EV_P_ struct ev_idle *w) |
1358 | ev_idle_stop (EV_P_ struct ev_idle *w) |
1173 | { |
1359 | { |
1174 | ev_clear_pending (EV_A_ (W)w); |
1360 | ev_clear_pending (EV_A_ (W)w); |
1175 | if (ev_is_active (w)) |
1361 | if (ev_is_active (w)) |
1176 | return; |
1362 | return; |
1177 | |
1363 | |
1178 | idles [w->active - 1] = idles [--idlecnt]; |
1364 | idles [((W)w)->active - 1] = idles [--idlecnt]; |
1179 | ev_stop (EV_A_ (W)w); |
1365 | ev_stop (EV_A_ (W)w); |
1180 | } |
1366 | } |
1181 | |
1367 | |
1182 | void |
1368 | void |
1183 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
1369 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
1184 | { |
1370 | { |
1185 | if (ev_is_active (w)) |
1371 | if (ev_is_active (w)) |
1186 | return; |
1372 | return; |
1187 | |
1373 | |
1188 | ev_start (EV_A_ (W)w, ++preparecnt); |
1374 | ev_start (EV_A_ (W)w, ++preparecnt); |
1189 | array_needsize (prepares, preparemax, preparecnt, ); |
1375 | array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void)); |
1190 | prepares [preparecnt - 1] = w; |
1376 | prepares [preparecnt - 1] = w; |
1191 | } |
1377 | } |
1192 | |
1378 | |
1193 | void |
1379 | void |
1194 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1380 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1195 | { |
1381 | { |
1196 | ev_clear_pending (EV_A_ (W)w); |
1382 | ev_clear_pending (EV_A_ (W)w); |
1197 | if (ev_is_active (w)) |
1383 | if (ev_is_active (w)) |
1198 | return; |
1384 | return; |
1199 | |
1385 | |
1200 | prepares [w->active - 1] = prepares [--preparecnt]; |
1386 | prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
1201 | ev_stop (EV_A_ (W)w); |
1387 | ev_stop (EV_A_ (W)w); |
1202 | } |
1388 | } |
1203 | |
1389 | |
1204 | void |
1390 | void |
1205 | ev_check_start (EV_P_ struct ev_check *w) |
1391 | ev_check_start (EV_P_ struct ev_check *w) |
1206 | { |
1392 | { |
1207 | if (ev_is_active (w)) |
1393 | if (ev_is_active (w)) |
1208 | return; |
1394 | return; |
1209 | |
1395 | |
1210 | ev_start (EV_A_ (W)w, ++checkcnt); |
1396 | ev_start (EV_A_ (W)w, ++checkcnt); |
1211 | array_needsize (checks, checkmax, checkcnt, ); |
1397 | array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void)); |
1212 | checks [checkcnt - 1] = w; |
1398 | checks [checkcnt - 1] = w; |
1213 | } |
1399 | } |
1214 | |
1400 | |
1215 | void |
1401 | void |
1216 | ev_check_stop (EV_P_ struct ev_check *w) |
1402 | ev_check_stop (EV_P_ struct ev_check *w) |
1217 | { |
1403 | { |
1218 | ev_clear_pending (EV_A_ (W)w); |
1404 | ev_clear_pending (EV_A_ (W)w); |
1219 | if (ev_is_active (w)) |
1405 | if (ev_is_active (w)) |
1220 | return; |
1406 | return; |
1221 | |
1407 | |
1222 | checks [w->active - 1] = checks [--checkcnt]; |
1408 | checks [((W)w)->active - 1] = checks [--checkcnt]; |
1223 | ev_stop (EV_A_ (W)w); |
1409 | ev_stop (EV_A_ (W)w); |
1224 | } |
1410 | } |
1225 | |
1411 | |
1226 | #ifndef SA_RESTART |
1412 | #ifndef SA_RESTART |
1227 | # define SA_RESTART 0 |
1413 | # define SA_RESTART 0 |
… | |
… | |
1237 | return; |
1423 | return; |
1238 | |
1424 | |
1239 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1425 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1240 | |
1426 | |
1241 | ev_start (EV_A_ (W)w, 1); |
1427 | ev_start (EV_A_ (W)w, 1); |
1242 | array_needsize (signals, signalmax, w->signum, signals_init); |
1428 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
1243 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1429 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1244 | |
1430 | |
1245 | if (!w->next) |
1431 | if (!((WL)w)->next) |
1246 | { |
1432 | { |
|
|
1433 | #if WIN32 |
|
|
1434 | signal (w->signum, sighandler); |
|
|
1435 | #else |
1247 | struct sigaction sa; |
1436 | struct sigaction sa; |
1248 | sa.sa_handler = sighandler; |
1437 | sa.sa_handler = sighandler; |
1249 | sigfillset (&sa.sa_mask); |
1438 | sigfillset (&sa.sa_mask); |
1250 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1439 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1251 | sigaction (w->signum, &sa, 0); |
1440 | sigaction (w->signum, &sa, 0); |
|
|
1441 | #endif |
1252 | } |
1442 | } |
1253 | } |
1443 | } |
1254 | |
1444 | |
1255 | void |
1445 | void |
1256 | ev_signal_stop (EV_P_ struct ev_signal *w) |
1446 | ev_signal_stop (EV_P_ struct ev_signal *w) |
… | |
… | |
1306 | void (*cb)(int revents, void *arg) = once->cb; |
1496 | void (*cb)(int revents, void *arg) = once->cb; |
1307 | void *arg = once->arg; |
1497 | void *arg = once->arg; |
1308 | |
1498 | |
1309 | ev_io_stop (EV_A_ &once->io); |
1499 | ev_io_stop (EV_A_ &once->io); |
1310 | ev_timer_stop (EV_A_ &once->to); |
1500 | ev_timer_stop (EV_A_ &once->to); |
1311 | free (once); |
1501 | ev_free (once); |
1312 | |
1502 | |
1313 | cb (revents, arg); |
1503 | cb (revents, arg); |
1314 | } |
1504 | } |
1315 | |
1505 | |
1316 | static void |
1506 | static void |
… | |
… | |
1326 | } |
1516 | } |
1327 | |
1517 | |
1328 | void |
1518 | void |
1329 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1519 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1330 | { |
1520 | { |
1331 | struct ev_once *once = malloc (sizeof (struct ev_once)); |
1521 | struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1332 | |
1522 | |
1333 | if (!once) |
1523 | if (!once) |
1334 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1524 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1335 | else |
1525 | else |
1336 | { |
1526 | { |