… | |
… | |
235 | # else |
235 | # else |
236 | # define EV_USE_EVENTFD 0 |
236 | # define EV_USE_EVENTFD 0 |
237 | # endif |
237 | # endif |
238 | #endif |
238 | #endif |
239 | |
239 | |
|
|
240 | #ifndef EV_USE_4HEAP |
|
|
241 | # define EV_USE_4HEAP !EV_MINIMAL |
|
|
242 | #endif |
|
|
243 | |
|
|
244 | #ifndef EV_HEAP_CACHE_AT |
|
|
245 | # define EV_HEAP_CACHE_AT !EV_MINIMAL |
|
|
246 | #endif |
|
|
247 | |
240 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
248 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
241 | |
249 | |
242 | #ifndef CLOCK_MONOTONIC |
250 | #ifndef CLOCK_MONOTONIC |
243 | # undef EV_USE_MONOTONIC |
251 | # undef EV_USE_MONOTONIC |
244 | # define EV_USE_MONOTONIC 0 |
252 | # define EV_USE_MONOTONIC 0 |
… | |
… | |
300 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
308 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
301 | # define noinline __attribute__ ((noinline)) |
309 | # define noinline __attribute__ ((noinline)) |
302 | #else |
310 | #else |
303 | # define expect(expr,value) (expr) |
311 | # define expect(expr,value) (expr) |
304 | # define noinline |
312 | # define noinline |
305 | # if __STDC_VERSION__ < 199901L |
313 | # if __STDC_VERSION__ < 199901L && __GNUC__ < 2 |
306 | # define inline |
314 | # define inline |
307 | # endif |
315 | # endif |
308 | #endif |
316 | #endif |
309 | |
317 | |
310 | #define expect_false(expr) expect ((expr) != 0, 0) |
318 | #define expect_false(expr) expect ((expr) != 0, 0) |
… | |
… | |
325 | |
333 | |
326 | typedef ev_watcher *W; |
334 | typedef ev_watcher *W; |
327 | typedef ev_watcher_list *WL; |
335 | typedef ev_watcher_list *WL; |
328 | typedef ev_watcher_time *WT; |
336 | typedef ev_watcher_time *WT; |
329 | |
337 | |
|
|
338 | #define ev_active(w) ((W)(w))->active |
|
|
339 | #define ev_at(w) ((WT)(w))->at |
|
|
340 | |
330 | #if EV_USE_MONOTONIC |
341 | #if EV_USE_MONOTONIC |
331 | /* sig_atomic_t is used to avoid per-thread variables or locking but still */ |
342 | /* sig_atomic_t is used to avoid per-thread variables or locking but still */ |
332 | /* giving it a reasonably high chance of working on typical architetcures */ |
343 | /* giving it a reasonably high chance of working on typical architetcures */ |
333 | static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
344 | static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
334 | #endif |
345 | #endif |
… | |
… | |
360 | perror (msg); |
371 | perror (msg); |
361 | abort (); |
372 | abort (); |
362 | } |
373 | } |
363 | } |
374 | } |
364 | |
375 | |
|
|
376 | static void * |
|
|
377 | ev_realloc_emul (void *ptr, long size) |
|
|
378 | { |
|
|
379 | /* some systems, notably openbsd and darwin, fail to properly |
|
|
380 | * implement realloc (x, 0) (as required by both ansi c-98 and |
|
|
381 | * the single unix specification, so work around them here. |
|
|
382 | */ |
|
|
383 | |
|
|
384 | if (size) |
|
|
385 | return realloc (ptr, size); |
|
|
386 | |
|
|
387 | free (ptr); |
|
|
388 | return 0; |
|
|
389 | } |
|
|
390 | |
365 | static void *(*alloc)(void *ptr, long size); |
391 | static void *(*alloc)(void *ptr, long size) = ev_realloc_emul; |
366 | |
392 | |
367 | void |
393 | void |
368 | ev_set_allocator (void *(*cb)(void *ptr, long size)) |
394 | ev_set_allocator (void *(*cb)(void *ptr, long size)) |
369 | { |
395 | { |
370 | alloc = cb; |
396 | alloc = cb; |
371 | } |
397 | } |
372 | |
398 | |
373 | inline_speed void * |
399 | inline_speed void * |
374 | ev_realloc (void *ptr, long size) |
400 | ev_realloc (void *ptr, long size) |
375 | { |
401 | { |
376 | ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
402 | ptr = alloc (ptr, size); |
377 | |
403 | |
378 | if (!ptr && size) |
404 | if (!ptr && size) |
379 | { |
405 | { |
380 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
406 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
381 | abort (); |
407 | abort (); |
… | |
… | |
404 | W w; |
430 | W w; |
405 | int events; |
431 | int events; |
406 | } ANPENDING; |
432 | } ANPENDING; |
407 | |
433 | |
408 | #if EV_USE_INOTIFY |
434 | #if EV_USE_INOTIFY |
|
|
435 | /* hash table entry per inotify-id */ |
409 | typedef struct |
436 | typedef struct |
410 | { |
437 | { |
411 | WL head; |
438 | WL head; |
412 | } ANFS; |
439 | } ANFS; |
|
|
440 | #endif |
|
|
441 | |
|
|
442 | /* Heap Entry */ |
|
|
443 | #if EV_HEAP_CACHE_AT |
|
|
444 | typedef struct { |
|
|
445 | ev_tstamp at; |
|
|
446 | WT w; |
|
|
447 | } ANHE; |
|
|
448 | |
|
|
449 | #define ANHE_w(he) (he).w /* access watcher, read-write */ |
|
|
450 | #define ANHE_at(he) (he).at /* access cached at, read-only */ |
|
|
451 | #define ANHE_at_set(he) (he).at = (he).w->at /* update at from watcher */ |
|
|
452 | #else |
|
|
453 | typedef WT ANHE; |
|
|
454 | |
|
|
455 | #define ANHE_w(he) (he) |
|
|
456 | #define ANHE_at(he) (he)->at |
|
|
457 | #define ANHE_at_set(he) |
413 | #endif |
458 | #endif |
414 | |
459 | |
415 | #if EV_MULTIPLICITY |
460 | #if EV_MULTIPLICITY |
416 | |
461 | |
417 | struct ev_loop |
462 | struct ev_loop |
… | |
… | |
502 | } |
547 | } |
503 | } |
548 | } |
504 | |
549 | |
505 | /*****************************************************************************/ |
550 | /*****************************************************************************/ |
506 | |
551 | |
|
|
552 | #define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */ |
|
|
553 | |
507 | int inline_size |
554 | int inline_size |
508 | array_nextsize (int elem, int cur, int cnt) |
555 | array_nextsize (int elem, int cur, int cnt) |
509 | { |
556 | { |
510 | int ncur = cur + 1; |
557 | int ncur = cur + 1; |
511 | |
558 | |
512 | do |
559 | do |
513 | ncur <<= 1; |
560 | ncur <<= 1; |
514 | while (cnt > ncur); |
561 | while (cnt > ncur); |
515 | |
562 | |
516 | /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ |
563 | /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */ |
517 | if (elem * ncur > 4096) |
564 | if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4) |
518 | { |
565 | { |
519 | ncur *= elem; |
566 | ncur *= elem; |
520 | ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; |
567 | ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1); |
521 | ncur = ncur - sizeof (void *) * 4; |
568 | ncur = ncur - sizeof (void *) * 4; |
522 | ncur /= elem; |
569 | ncur /= elem; |
523 | } |
570 | } |
524 | |
571 | |
525 | return ncur; |
572 | return ncur; |
… | |
… | |
739 | } |
786 | } |
740 | } |
787 | } |
741 | |
788 | |
742 | /*****************************************************************************/ |
789 | /*****************************************************************************/ |
743 | |
790 | |
|
|
791 | /* |
|
|
792 | * the heap functions want a real array index. array index 0 uis guaranteed to not |
|
|
793 | * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives |
|
|
794 | * the branching factor of the d-tree. |
|
|
795 | */ |
|
|
796 | |
|
|
797 | /* |
|
|
798 | * at the moment we allow libev the luxury of two heaps, |
|
|
799 | * a small-code-size 2-heap one and a ~1.5kb larger 4-heap |
|
|
800 | * which is more cache-efficient. |
|
|
801 | * the difference is about 5% with 50000+ watchers. |
|
|
802 | */ |
|
|
803 | #if EV_USE_4HEAP |
|
|
804 | |
|
|
805 | #define DHEAP 4 |
|
|
806 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
|
|
807 | |
|
|
808 | /* towards the root */ |
744 | void inline_speed |
809 | void inline_speed |
745 | upheap (WT *heap, int k) |
810 | upheap (ANHE *heap, int k) |
746 | { |
811 | { |
747 | WT w = heap [k]; |
812 | ANHE he = heap [k]; |
748 | |
813 | |
749 | while (k) |
814 | for (;;) |
750 | { |
815 | { |
751 | int p = (k - 1) >> 1; |
816 | int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0; |
752 | |
817 | |
753 | if (heap [p]->at <= w->at) |
818 | if (p == k || ANHE_at (heap [p]) <= ANHE_at (he)) |
754 | break; |
819 | break; |
755 | |
820 | |
756 | heap [k] = heap [p]; |
821 | heap [k] = heap [p]; |
757 | ((W)heap [k])->active = k + 1; |
822 | ev_active (ANHE_w (heap [k])) = k; |
758 | k = p; |
823 | k = p; |
759 | } |
824 | } |
760 | |
825 | |
|
|
826 | ev_active (ANHE_w (he)) = k; |
761 | heap [k] = w; |
827 | heap [k] = he; |
762 | ((W)heap [k])->active = k + 1; |
|
|
763 | } |
828 | } |
764 | |
829 | |
|
|
830 | /* away from the root */ |
765 | void inline_speed |
831 | void inline_speed |
766 | downheap (WT *heap, int N, int k) |
832 | downheap (ANHE *heap, int N, int k) |
767 | { |
833 | { |
768 | WT w = heap [k]; |
834 | ANHE he = heap [k]; |
|
|
835 | ANHE *E = heap + N + HEAP0; |
769 | |
836 | |
770 | for (;;) |
837 | for (;;) |
771 | { |
838 | { |
772 | int c = (k << 1) + 1; |
839 | ev_tstamp minat; |
|
|
840 | ANHE *minpos; |
|
|
841 | ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0; |
773 | |
842 | |
774 | if (c >= N) |
843 | // find minimum child |
|
|
844 | if (expect_true (pos + DHEAP - 1 < E)) |
|
|
845 | { |
|
|
846 | /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
847 | if (ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
848 | if (ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
849 | if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
850 | } |
|
|
851 | else if (pos < E) |
|
|
852 | { |
|
|
853 | /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
854 | if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
855 | if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
856 | if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
857 | } |
|
|
858 | else |
775 | break; |
859 | break; |
776 | |
860 | |
|
|
861 | if (ANHE_at (he) <= minat) |
|
|
862 | break; |
|
|
863 | |
|
|
864 | ev_active (ANHE_w (*minpos)) = k; |
|
|
865 | heap [k] = *minpos; |
|
|
866 | |
|
|
867 | k = minpos - heap; |
|
|
868 | } |
|
|
869 | |
|
|
870 | ev_active (ANHE_w (he)) = k; |
|
|
871 | heap [k] = he; |
|
|
872 | } |
|
|
873 | |
|
|
874 | #else // 4HEAP |
|
|
875 | |
|
|
876 | #define HEAP0 1 |
|
|
877 | |
|
|
878 | /* towards the root */ |
|
|
879 | void inline_speed |
|
|
880 | upheap (ANHE *heap, int k) |
|
|
881 | { |
|
|
882 | ANHE he = heap [k]; |
|
|
883 | |
|
|
884 | for (;;) |
|
|
885 | { |
|
|
886 | int p = k >> 1; |
|
|
887 | |
|
|
888 | /* maybe we could use a dummy element at heap [0]? */ |
|
|
889 | if (!p || ANHE_at (heap [p]) <= ANHE_at (he)) |
|
|
890 | break; |
|
|
891 | |
|
|
892 | heap [k] = heap [p]; |
|
|
893 | ev_active (ANHE_w (heap [k])) = k; |
|
|
894 | k = p; |
|
|
895 | } |
|
|
896 | |
|
|
897 | heap [k] = he; |
|
|
898 | ev_active (ANHE_w (heap [k])) = k; |
|
|
899 | } |
|
|
900 | |
|
|
901 | /* away from the root */ |
|
|
902 | void inline_speed |
|
|
903 | downheap (ANHE *heap, int N, int k) |
|
|
904 | { |
|
|
905 | ANHE he = heap [k]; |
|
|
906 | |
|
|
907 | for (;;) |
|
|
908 | { |
|
|
909 | int c = k << 1; |
|
|
910 | |
|
|
911 | if (c > N) |
|
|
912 | break; |
|
|
913 | |
777 | c += c + 1 < N && heap [c]->at > heap [c + 1]->at |
914 | c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) |
778 | ? 1 : 0; |
915 | ? 1 : 0; |
779 | |
916 | |
780 | if (w->at <= heap [c]->at) |
917 | if (ANHE_at (he) <= ANHE_at (heap [c])) |
781 | break; |
918 | break; |
782 | |
919 | |
783 | heap [k] = heap [c]; |
920 | heap [k] = heap [c]; |
784 | ((W)heap [k])->active = k + 1; |
921 | ev_active (ANHE_w (heap [k])) = k; |
785 | |
922 | |
786 | k = c; |
923 | k = c; |
787 | } |
924 | } |
788 | |
925 | |
789 | heap [k] = w; |
926 | heap [k] = he; |
790 | ((W)heap [k])->active = k + 1; |
927 | ev_active (ANHE_w (he)) = k; |
791 | } |
928 | } |
|
|
929 | #endif |
792 | |
930 | |
793 | void inline_size |
931 | void inline_size |
794 | adjustheap (WT *heap, int N, int k) |
932 | adjustheap (ANHE *heap, int N, int k) |
795 | { |
933 | { |
796 | upheap (heap, k); |
934 | upheap (heap, k); |
797 | downheap (heap, N, k); |
935 | downheap (heap, N, k); |
798 | } |
936 | } |
799 | |
937 | |
… | |
… | |
891 | pipecb (EV_P_ ev_io *iow, int revents) |
1029 | pipecb (EV_P_ ev_io *iow, int revents) |
892 | { |
1030 | { |
893 | #if EV_USE_EVENTFD |
1031 | #if EV_USE_EVENTFD |
894 | if (evfd >= 0) |
1032 | if (evfd >= 0) |
895 | { |
1033 | { |
896 | uint64_t counter = 1; |
1034 | uint64_t counter; |
897 | read (evfd, &counter, sizeof (uint64_t)); |
1035 | read (evfd, &counter, sizeof (uint64_t)); |
898 | } |
1036 | } |
899 | else |
1037 | else |
900 | #endif |
1038 | #endif |
901 | { |
1039 | { |
… | |
… | |
1170 | if (!(flags & EVFLAG_NOENV) |
1308 | if (!(flags & EVFLAG_NOENV) |
1171 | && !enable_secure () |
1309 | && !enable_secure () |
1172 | && getenv ("LIBEV_FLAGS")) |
1310 | && getenv ("LIBEV_FLAGS")) |
1173 | flags = atoi (getenv ("LIBEV_FLAGS")); |
1311 | flags = atoi (getenv ("LIBEV_FLAGS")); |
1174 | |
1312 | |
1175 | if (!(flags & 0x0000ffffUL)) |
1313 | if (!(flags & 0x0000ffffU)) |
1176 | flags |= ev_recommended_backends (); |
1314 | flags |= ev_recommended_backends (); |
1177 | |
1315 | |
1178 | #if EV_USE_PORT |
1316 | #if EV_USE_PORT |
1179 | if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags); |
1317 | if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags); |
1180 | #endif |
1318 | #endif |
… | |
… | |
1268 | #endif |
1406 | #endif |
1269 | |
1407 | |
1270 | backend = 0; |
1408 | backend = 0; |
1271 | } |
1409 | } |
1272 | |
1410 | |
|
|
1411 | #if EV_USE_INOTIFY |
1273 | void inline_size infy_fork (EV_P); |
1412 | void inline_size infy_fork (EV_P); |
|
|
1413 | #endif |
1274 | |
1414 | |
1275 | void inline_size |
1415 | void inline_size |
1276 | loop_fork (EV_P) |
1416 | loop_fork (EV_P) |
1277 | { |
1417 | { |
1278 | #if EV_USE_PORT |
1418 | #if EV_USE_PORT |
… | |
… | |
1345 | void |
1485 | void |
1346 | ev_loop_fork (EV_P) |
1486 | ev_loop_fork (EV_P) |
1347 | { |
1487 | { |
1348 | postfork = 1; /* must be in line with ev_default_fork */ |
1488 | postfork = 1; /* must be in line with ev_default_fork */ |
1349 | } |
1489 | } |
1350 | |
|
|
1351 | #endif |
1490 | #endif |
1352 | |
1491 | |
1353 | #if EV_MULTIPLICITY |
1492 | #if EV_MULTIPLICITY |
1354 | struct ev_loop * |
1493 | struct ev_loop * |
1355 | ev_default_loop_init (unsigned int flags) |
1494 | ev_default_loop_init (unsigned int flags) |
… | |
… | |
1436 | EV_CB_INVOKE (p->w, p->events); |
1575 | EV_CB_INVOKE (p->w, p->events); |
1437 | } |
1576 | } |
1438 | } |
1577 | } |
1439 | } |
1578 | } |
1440 | |
1579 | |
1441 | void inline_size |
|
|
1442 | timers_reify (EV_P) |
|
|
1443 | { |
|
|
1444 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
|
|
1445 | { |
|
|
1446 | ev_timer *w = (ev_timer *)timers [0]; |
|
|
1447 | |
|
|
1448 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
|
|
1449 | |
|
|
1450 | /* first reschedule or stop timer */ |
|
|
1451 | if (w->repeat) |
|
|
1452 | { |
|
|
1453 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1454 | |
|
|
1455 | ((WT)w)->at += w->repeat; |
|
|
1456 | if (((WT)w)->at < mn_now) |
|
|
1457 | ((WT)w)->at = mn_now; |
|
|
1458 | |
|
|
1459 | downheap (timers, timercnt, 0); |
|
|
1460 | } |
|
|
1461 | else |
|
|
1462 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
1463 | |
|
|
1464 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
|
|
1465 | } |
|
|
1466 | } |
|
|
1467 | |
|
|
1468 | #if EV_PERIODIC_ENABLE |
|
|
1469 | void inline_size |
|
|
1470 | periodics_reify (EV_P) |
|
|
1471 | { |
|
|
1472 | while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now) |
|
|
1473 | { |
|
|
1474 | ev_periodic *w = (ev_periodic *)periodics [0]; |
|
|
1475 | |
|
|
1476 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
|
|
1477 | |
|
|
1478 | /* first reschedule or stop timer */ |
|
|
1479 | if (w->reschedule_cb) |
|
|
1480 | { |
|
|
1481 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); |
|
|
1482 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
|
|
1483 | downheap (periodics, periodiccnt, 0); |
|
|
1484 | } |
|
|
1485 | else if (w->interval) |
|
|
1486 | { |
|
|
1487 | ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1488 | if (((WT)w)->at - ev_rt_now <= TIME_EPSILON) ((WT)w)->at += w->interval; |
|
|
1489 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
|
|
1490 | downheap (periodics, periodiccnt, 0); |
|
|
1491 | } |
|
|
1492 | else |
|
|
1493 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
1494 | |
|
|
1495 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
|
|
1496 | } |
|
|
1497 | } |
|
|
1498 | |
|
|
1499 | static void noinline |
|
|
1500 | periodics_reschedule (EV_P) |
|
|
1501 | { |
|
|
1502 | int i; |
|
|
1503 | |
|
|
1504 | /* adjust periodics after time jump */ |
|
|
1505 | for (i = 0; i < periodiccnt; ++i) |
|
|
1506 | { |
|
|
1507 | ev_periodic *w = (ev_periodic *)periodics [i]; |
|
|
1508 | |
|
|
1509 | if (w->reschedule_cb) |
|
|
1510 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
|
|
1511 | else if (w->interval) |
|
|
1512 | ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1513 | } |
|
|
1514 | |
|
|
1515 | /* now rebuild the heap */ |
|
|
1516 | for (i = periodiccnt >> 1; i--; ) |
|
|
1517 | downheap (periodics, periodiccnt, i); |
|
|
1518 | } |
|
|
1519 | #endif |
|
|
1520 | |
|
|
1521 | #if EV_IDLE_ENABLE |
1580 | #if EV_IDLE_ENABLE |
1522 | void inline_size |
1581 | void inline_size |
1523 | idle_reify (EV_P) |
1582 | idle_reify (EV_P) |
1524 | { |
1583 | { |
1525 | if (expect_false (idleall)) |
1584 | if (expect_false (idleall)) |
… | |
… | |
1536 | queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); |
1595 | queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); |
1537 | break; |
1596 | break; |
1538 | } |
1597 | } |
1539 | } |
1598 | } |
1540 | } |
1599 | } |
|
|
1600 | } |
|
|
1601 | #endif |
|
|
1602 | |
|
|
1603 | void inline_size |
|
|
1604 | timers_reify (EV_P) |
|
|
1605 | { |
|
|
1606 | while (timercnt && ANHE_at (timers [HEAP0]) < mn_now) |
|
|
1607 | { |
|
|
1608 | ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); |
|
|
1609 | |
|
|
1610 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
|
|
1611 | |
|
|
1612 | /* first reschedule or stop timer */ |
|
|
1613 | if (w->repeat) |
|
|
1614 | { |
|
|
1615 | ev_at (w) += w->repeat; |
|
|
1616 | if (ev_at (w) < mn_now) |
|
|
1617 | ev_at (w) = mn_now; |
|
|
1618 | |
|
|
1619 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1620 | |
|
|
1621 | ANHE_at_set (timers [HEAP0]); |
|
|
1622 | downheap (timers, timercnt, HEAP0); |
|
|
1623 | } |
|
|
1624 | else |
|
|
1625 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
1626 | |
|
|
1627 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
|
|
1628 | } |
|
|
1629 | } |
|
|
1630 | |
|
|
1631 | #if EV_PERIODIC_ENABLE |
|
|
1632 | void inline_size |
|
|
1633 | periodics_reify (EV_P) |
|
|
1634 | { |
|
|
1635 | while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now) |
|
|
1636 | { |
|
|
1637 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); |
|
|
1638 | |
|
|
1639 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
|
|
1640 | |
|
|
1641 | /* first reschedule or stop timer */ |
|
|
1642 | if (w->reschedule_cb) |
|
|
1643 | { |
|
|
1644 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
|
|
1645 | |
|
|
1646 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now)); |
|
|
1647 | |
|
|
1648 | ANHE_at_set (periodics [HEAP0]); |
|
|
1649 | downheap (periodics, periodiccnt, HEAP0); |
|
|
1650 | } |
|
|
1651 | else if (w->interval) |
|
|
1652 | { |
|
|
1653 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1654 | if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; |
|
|
1655 | |
|
|
1656 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) >= ev_rt_now)); |
|
|
1657 | |
|
|
1658 | ANHE_at_set (periodics [HEAP0]); |
|
|
1659 | downheap (periodics, periodiccnt, HEAP0); |
|
|
1660 | } |
|
|
1661 | else |
|
|
1662 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
1663 | |
|
|
1664 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
|
|
1665 | } |
|
|
1666 | } |
|
|
1667 | |
|
|
1668 | static void noinline |
|
|
1669 | periodics_reschedule (EV_P) |
|
|
1670 | { |
|
|
1671 | int i; |
|
|
1672 | |
|
|
1673 | /* adjust periodics after time jump */ |
|
|
1674 | for (i = HEAP0; i < periodiccnt + HEAP0; ++i) |
|
|
1675 | { |
|
|
1676 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]); |
|
|
1677 | |
|
|
1678 | if (w->reschedule_cb) |
|
|
1679 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
|
|
1680 | else if (w->interval) |
|
|
1681 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1682 | |
|
|
1683 | ANHE_at_set (periodics [i]); |
|
|
1684 | } |
|
|
1685 | |
|
|
1686 | /* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */ |
|
|
1687 | /* also, this is easy and corretc for both 2-heaps and 4-heaps */ |
|
|
1688 | for (i = 0; i < periodiccnt; ++i) |
|
|
1689 | upheap (periodics, i + HEAP0); |
1541 | } |
1690 | } |
1542 | #endif |
1691 | #endif |
1543 | |
1692 | |
1544 | void inline_speed |
1693 | void inline_speed |
1545 | time_update (EV_P_ ev_tstamp max_block) |
1694 | time_update (EV_P_ ev_tstamp max_block) |
… | |
… | |
1574 | */ |
1723 | */ |
1575 | for (i = 4; --i; ) |
1724 | for (i = 4; --i; ) |
1576 | { |
1725 | { |
1577 | rtmn_diff = ev_rt_now - mn_now; |
1726 | rtmn_diff = ev_rt_now - mn_now; |
1578 | |
1727 | |
1579 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1728 | if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP)) |
1580 | return; /* all is well */ |
1729 | return; /* all is well */ |
1581 | |
1730 | |
1582 | ev_rt_now = ev_time (); |
1731 | ev_rt_now = ev_time (); |
1583 | mn_now = get_clock (); |
1732 | mn_now = get_clock (); |
1584 | now_floor = mn_now; |
1733 | now_floor = mn_now; |
… | |
… | |
1600 | #if EV_PERIODIC_ENABLE |
1749 | #if EV_PERIODIC_ENABLE |
1601 | periodics_reschedule (EV_A); |
1750 | periodics_reschedule (EV_A); |
1602 | #endif |
1751 | #endif |
1603 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1752 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1604 | for (i = 0; i < timercnt; ++i) |
1753 | for (i = 0; i < timercnt; ++i) |
|
|
1754 | { |
|
|
1755 | ANHE *he = timers + i + HEAP0; |
1605 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
1756 | ANHE_w (*he)->at += ev_rt_now - mn_now; |
|
|
1757 | ANHE_at_set (*he); |
|
|
1758 | } |
1606 | } |
1759 | } |
1607 | |
1760 | |
1608 | mn_now = ev_rt_now; |
1761 | mn_now = ev_rt_now; |
1609 | } |
1762 | } |
1610 | } |
1763 | } |
… | |
… | |
1680 | |
1833 | |
1681 | waittime = MAX_BLOCKTIME; |
1834 | waittime = MAX_BLOCKTIME; |
1682 | |
1835 | |
1683 | if (timercnt) |
1836 | if (timercnt) |
1684 | { |
1837 | { |
1685 | ev_tstamp to = ((WT)timers [0])->at - mn_now + backend_fudge; |
1838 | ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge; |
1686 | if (waittime > to) waittime = to; |
1839 | if (waittime > to) waittime = to; |
1687 | } |
1840 | } |
1688 | |
1841 | |
1689 | #if EV_PERIODIC_ENABLE |
1842 | #if EV_PERIODIC_ENABLE |
1690 | if (periodiccnt) |
1843 | if (periodiccnt) |
1691 | { |
1844 | { |
1692 | ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + backend_fudge; |
1845 | ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1693 | if (waittime > to) waittime = to; |
1846 | if (waittime > to) waittime = to; |
1694 | } |
1847 | } |
1695 | #endif |
1848 | #endif |
1696 | |
1849 | |
1697 | if (expect_false (waittime < timeout_blocktime)) |
1850 | if (expect_false (waittime < timeout_blocktime)) |
… | |
… | |
1849 | { |
2002 | { |
1850 | clear_pending (EV_A_ (W)w); |
2003 | clear_pending (EV_A_ (W)w); |
1851 | if (expect_false (!ev_is_active (w))) |
2004 | if (expect_false (!ev_is_active (w))) |
1852 | return; |
2005 | return; |
1853 | |
2006 | |
1854 | assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
2007 | assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1855 | |
2008 | |
1856 | wlist_del (&anfds[w->fd].head, (WL)w); |
2009 | wlist_del (&anfds[w->fd].head, (WL)w); |
1857 | ev_stop (EV_A_ (W)w); |
2010 | ev_stop (EV_A_ (W)w); |
1858 | |
2011 | |
1859 | fd_change (EV_A_ w->fd, 1); |
2012 | fd_change (EV_A_ w->fd, 1); |
… | |
… | |
1863 | ev_timer_start (EV_P_ ev_timer *w) |
2016 | ev_timer_start (EV_P_ ev_timer *w) |
1864 | { |
2017 | { |
1865 | if (expect_false (ev_is_active (w))) |
2018 | if (expect_false (ev_is_active (w))) |
1866 | return; |
2019 | return; |
1867 | |
2020 | |
1868 | ((WT)w)->at += mn_now; |
2021 | ev_at (w) += mn_now; |
1869 | |
2022 | |
1870 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
2023 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1871 | |
2024 | |
1872 | ev_start (EV_A_ (W)w, ++timercnt); |
2025 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
1873 | array_needsize (WT, timers, timermax, timercnt, EMPTY2); |
2026 | array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); |
1874 | timers [timercnt - 1] = (WT)w; |
2027 | ANHE_w (timers [ev_active (w)]) = (WT)w; |
1875 | upheap (timers, timercnt - 1); |
2028 | ANHE_at_set (timers [ev_active (w)]); |
|
|
2029 | upheap (timers, ev_active (w)); |
1876 | |
2030 | |
1877 | /*assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w));*/ |
2031 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ |
1878 | } |
2032 | } |
1879 | |
2033 | |
1880 | void noinline |
2034 | void noinline |
1881 | ev_timer_stop (EV_P_ ev_timer *w) |
2035 | ev_timer_stop (EV_P_ ev_timer *w) |
1882 | { |
2036 | { |
1883 | clear_pending (EV_A_ (W)w); |
2037 | clear_pending (EV_A_ (W)w); |
1884 | if (expect_false (!ev_is_active (w))) |
2038 | if (expect_false (!ev_is_active (w))) |
1885 | return; |
2039 | return; |
1886 | |
2040 | |
1887 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == (WT)w)); |
|
|
1888 | |
|
|
1889 | { |
2041 | { |
1890 | int active = ((W)w)->active; |
2042 | int active = ev_active (w); |
1891 | |
2043 | |
|
|
2044 | assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); |
|
|
2045 | |
1892 | if (expect_true (--active < --timercnt)) |
2046 | if (expect_true (active < timercnt + HEAP0 - 1)) |
1893 | { |
2047 | { |
1894 | timers [active] = timers [timercnt]; |
2048 | timers [active] = timers [timercnt + HEAP0 - 1]; |
1895 | adjustheap (timers, timercnt, active); |
2049 | adjustheap (timers, timercnt, active); |
1896 | } |
2050 | } |
|
|
2051 | |
|
|
2052 | --timercnt; |
1897 | } |
2053 | } |
1898 | |
2054 | |
1899 | ((WT)w)->at -= mn_now; |
2055 | ev_at (w) -= mn_now; |
1900 | |
2056 | |
1901 | ev_stop (EV_A_ (W)w); |
2057 | ev_stop (EV_A_ (W)w); |
1902 | } |
2058 | } |
1903 | |
2059 | |
1904 | void noinline |
2060 | void noinline |
… | |
… | |
1906 | { |
2062 | { |
1907 | if (ev_is_active (w)) |
2063 | if (ev_is_active (w)) |
1908 | { |
2064 | { |
1909 | if (w->repeat) |
2065 | if (w->repeat) |
1910 | { |
2066 | { |
1911 | ((WT)w)->at = mn_now + w->repeat; |
2067 | ev_at (w) = mn_now + w->repeat; |
|
|
2068 | ANHE_at_set (timers [ev_active (w)]); |
1912 | adjustheap (timers, timercnt, ((W)w)->active - 1); |
2069 | adjustheap (timers, timercnt, ev_active (w)); |
1913 | } |
2070 | } |
1914 | else |
2071 | else |
1915 | ev_timer_stop (EV_A_ w); |
2072 | ev_timer_stop (EV_A_ w); |
1916 | } |
2073 | } |
1917 | else if (w->repeat) |
2074 | else if (w->repeat) |
1918 | { |
2075 | { |
1919 | w->at = w->repeat; |
2076 | ev_at (w) = w->repeat; |
1920 | ev_timer_start (EV_A_ w); |
2077 | ev_timer_start (EV_A_ w); |
1921 | } |
2078 | } |
1922 | } |
2079 | } |
1923 | |
2080 | |
1924 | #if EV_PERIODIC_ENABLE |
2081 | #if EV_PERIODIC_ENABLE |
… | |
… | |
1927 | { |
2084 | { |
1928 | if (expect_false (ev_is_active (w))) |
2085 | if (expect_false (ev_is_active (w))) |
1929 | return; |
2086 | return; |
1930 | |
2087 | |
1931 | if (w->reschedule_cb) |
2088 | if (w->reschedule_cb) |
1932 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
2089 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1933 | else if (w->interval) |
2090 | else if (w->interval) |
1934 | { |
2091 | { |
1935 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
2092 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1936 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
2093 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1937 | ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
2094 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1938 | } |
2095 | } |
1939 | else |
2096 | else |
1940 | ((WT)w)->at = w->offset; |
2097 | ev_at (w) = w->offset; |
1941 | |
2098 | |
1942 | ev_start (EV_A_ (W)w, ++periodiccnt); |
2099 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
1943 | array_needsize (WT, periodics, periodicmax, periodiccnt, EMPTY2); |
2100 | array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); |
1944 | periodics [periodiccnt - 1] = (WT)w; |
2101 | ANHE_w (periodics [ev_active (w)]) = (WT)w; |
1945 | upheap (periodics, periodiccnt - 1); |
2102 | ANHE_at_set (periodics [ev_active (w)]); |
|
|
2103 | upheap (periodics, ev_active (w)); |
1946 | |
2104 | |
1947 | /*assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));*/ |
2105 | /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ |
1948 | } |
2106 | } |
1949 | |
2107 | |
1950 | void noinline |
2108 | void noinline |
1951 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2109 | ev_periodic_stop (EV_P_ ev_periodic *w) |
1952 | { |
2110 | { |
1953 | clear_pending (EV_A_ (W)w); |
2111 | clear_pending (EV_A_ (W)w); |
1954 | if (expect_false (!ev_is_active (w))) |
2112 | if (expect_false (!ev_is_active (w))) |
1955 | return; |
2113 | return; |
1956 | |
2114 | |
1957 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == (WT)w)); |
|
|
1958 | |
|
|
1959 | { |
2115 | { |
1960 | int active = ((W)w)->active; |
2116 | int active = ev_active (w); |
1961 | |
2117 | |
|
|
2118 | assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); |
|
|
2119 | |
1962 | if (expect_true (--active < --periodiccnt)) |
2120 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
1963 | { |
2121 | { |
1964 | periodics [active] = periodics [periodiccnt]; |
2122 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
1965 | adjustheap (periodics, periodiccnt, active); |
2123 | adjustheap (periodics, periodiccnt, active); |
1966 | } |
2124 | } |
|
|
2125 | |
|
|
2126 | --periodiccnt; |
1967 | } |
2127 | } |
1968 | |
2128 | |
1969 | ev_stop (EV_A_ (W)w); |
2129 | ev_stop (EV_A_ (W)w); |
1970 | } |
2130 | } |
1971 | |
2131 | |
… | |
… | |
2087 | if (w->wd < 0) |
2247 | if (w->wd < 0) |
2088 | { |
2248 | { |
2089 | ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ |
2249 | ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ |
2090 | |
2250 | |
2091 | /* monitor some parent directory for speedup hints */ |
2251 | /* monitor some parent directory for speedup hints */ |
|
|
2252 | /* note that exceeding the hardcoded limit is not a correctness issue, */ |
|
|
2253 | /* but an efficiency issue only */ |
2092 | if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) |
2254 | if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) |
2093 | { |
2255 | { |
2094 | char path [4096]; |
2256 | char path [4096]; |
2095 | strcpy (path, w->path); |
2257 | strcpy (path, w->path); |
2096 | |
2258 | |
… | |
… | |
2341 | clear_pending (EV_A_ (W)w); |
2503 | clear_pending (EV_A_ (W)w); |
2342 | if (expect_false (!ev_is_active (w))) |
2504 | if (expect_false (!ev_is_active (w))) |
2343 | return; |
2505 | return; |
2344 | |
2506 | |
2345 | { |
2507 | { |
2346 | int active = ((W)w)->active; |
2508 | int active = ev_active (w); |
2347 | |
2509 | |
2348 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
2510 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
2349 | ((W)idles [ABSPRI (w)][active - 1])->active = active; |
2511 | ev_active (idles [ABSPRI (w)][active - 1]) = active; |
2350 | |
2512 | |
2351 | ev_stop (EV_A_ (W)w); |
2513 | ev_stop (EV_A_ (W)w); |
2352 | --idleall; |
2514 | --idleall; |
2353 | } |
2515 | } |
2354 | } |
2516 | } |
… | |
… | |
2371 | clear_pending (EV_A_ (W)w); |
2533 | clear_pending (EV_A_ (W)w); |
2372 | if (expect_false (!ev_is_active (w))) |
2534 | if (expect_false (!ev_is_active (w))) |
2373 | return; |
2535 | return; |
2374 | |
2536 | |
2375 | { |
2537 | { |
2376 | int active = ((W)w)->active; |
2538 | int active = ev_active (w); |
|
|
2539 | |
2377 | prepares [active - 1] = prepares [--preparecnt]; |
2540 | prepares [active - 1] = prepares [--preparecnt]; |
2378 | ((W)prepares [active - 1])->active = active; |
2541 | ev_active (prepares [active - 1]) = active; |
2379 | } |
2542 | } |
2380 | |
2543 | |
2381 | ev_stop (EV_A_ (W)w); |
2544 | ev_stop (EV_A_ (W)w); |
2382 | } |
2545 | } |
2383 | |
2546 | |
… | |
… | |
2398 | clear_pending (EV_A_ (W)w); |
2561 | clear_pending (EV_A_ (W)w); |
2399 | if (expect_false (!ev_is_active (w))) |
2562 | if (expect_false (!ev_is_active (w))) |
2400 | return; |
2563 | return; |
2401 | |
2564 | |
2402 | { |
2565 | { |
2403 | int active = ((W)w)->active; |
2566 | int active = ev_active (w); |
|
|
2567 | |
2404 | checks [active - 1] = checks [--checkcnt]; |
2568 | checks [active - 1] = checks [--checkcnt]; |
2405 | ((W)checks [active - 1])->active = active; |
2569 | ev_active (checks [active - 1]) = active; |
2406 | } |
2570 | } |
2407 | |
2571 | |
2408 | ev_stop (EV_A_ (W)w); |
2572 | ev_stop (EV_A_ (W)w); |
2409 | } |
2573 | } |
2410 | |
2574 | |
… | |
… | |
2506 | clear_pending (EV_A_ (W)w); |
2670 | clear_pending (EV_A_ (W)w); |
2507 | if (expect_false (!ev_is_active (w))) |
2671 | if (expect_false (!ev_is_active (w))) |
2508 | return; |
2672 | return; |
2509 | |
2673 | |
2510 | { |
2674 | { |
2511 | int active = ((W)w)->active; |
2675 | int active = ev_active (w); |
|
|
2676 | |
2512 | forks [active - 1] = forks [--forkcnt]; |
2677 | forks [active - 1] = forks [--forkcnt]; |
2513 | ((W)forks [active - 1])->active = active; |
2678 | ev_active (forks [active - 1]) = active; |
2514 | } |
2679 | } |
2515 | |
2680 | |
2516 | ev_stop (EV_A_ (W)w); |
2681 | ev_stop (EV_A_ (W)w); |
2517 | } |
2682 | } |
2518 | #endif |
2683 | #endif |
… | |
… | |
2537 | clear_pending (EV_A_ (W)w); |
2702 | clear_pending (EV_A_ (W)w); |
2538 | if (expect_false (!ev_is_active (w))) |
2703 | if (expect_false (!ev_is_active (w))) |
2539 | return; |
2704 | return; |
2540 | |
2705 | |
2541 | { |
2706 | { |
2542 | int active = ((W)w)->active; |
2707 | int active = ev_active (w); |
|
|
2708 | |
2543 | asyncs [active - 1] = asyncs [--asynccnt]; |
2709 | asyncs [active - 1] = asyncs [--asynccnt]; |
2544 | ((W)asyncs [active - 1])->active = active; |
2710 | ev_active (asyncs [active - 1]) = active; |
2545 | } |
2711 | } |
2546 | |
2712 | |
2547 | ev_stop (EV_A_ (W)w); |
2713 | ev_stop (EV_A_ (W)w); |
2548 | } |
2714 | } |
2549 | |
2715 | |