… | |
… | |
126 | # define EV_USE_EVENTFD 1 |
126 | # define EV_USE_EVENTFD 1 |
127 | # else |
127 | # else |
128 | # define EV_USE_EVENTFD 0 |
128 | # define EV_USE_EVENTFD 0 |
129 | # endif |
129 | # endif |
130 | # endif |
130 | # endif |
131 | |
131 | |
132 | #endif |
132 | #endif |
133 | |
133 | |
134 | #include <math.h> |
134 | #include <math.h> |
135 | #include <stdlib.h> |
135 | #include <stdlib.h> |
136 | #include <fcntl.h> |
136 | #include <fcntl.h> |
… | |
… | |
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 | #if 0 /* debugging */ |
|
|
241 | # define EV_VERIFY 3 |
|
|
242 | # define EV_USE_4HEAP 1 |
|
|
243 | # define EV_HEAP_CACHE_AT 1 |
|
|
244 | #endif |
|
|
245 | |
|
|
246 | #ifndef EV_VERIFY |
|
|
247 | # define EV_VERIFY !EV_MINIMAL |
|
|
248 | #endif |
|
|
249 | |
|
|
250 | #ifndef EV_USE_4HEAP |
|
|
251 | # define EV_USE_4HEAP !EV_MINIMAL |
|
|
252 | #endif |
|
|
253 | |
|
|
254 | #ifndef EV_HEAP_CACHE_AT |
|
|
255 | # define EV_HEAP_CACHE_AT !EV_MINIMAL |
|
|
256 | #endif |
|
|
257 | |
240 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
258 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
241 | |
259 | |
242 | #ifndef CLOCK_MONOTONIC |
260 | #ifndef CLOCK_MONOTONIC |
243 | # undef EV_USE_MONOTONIC |
261 | # undef EV_USE_MONOTONIC |
244 | # define EV_USE_MONOTONIC 0 |
262 | # define EV_USE_MONOTONIC 0 |
… | |
… | |
279 | } |
297 | } |
280 | # endif |
298 | # endif |
281 | #endif |
299 | #endif |
282 | |
300 | |
283 | /**/ |
301 | /**/ |
|
|
302 | |
|
|
303 | #if EV_VERIFY >= 3 |
|
|
304 | # define EV_FREQUENT_CHECK ev_loop_verify (EV_A) |
|
|
305 | #else |
|
|
306 | # define EV_FREQUENT_CHECK do { } while (0) |
|
|
307 | #endif |
284 | |
308 | |
285 | /* |
309 | /* |
286 | * This is used to avoid floating point rounding problems. |
310 | * This is used to avoid floating point rounding problems. |
287 | * It is added to ev_rt_now when scheduling periodics |
311 | * It is added to ev_rt_now when scheduling periodics |
288 | * to ensure progress, time-wise, even when rounding |
312 | * to ensure progress, time-wise, even when rounding |
… | |
… | |
422 | W w; |
446 | W w; |
423 | int events; |
447 | int events; |
424 | } ANPENDING; |
448 | } ANPENDING; |
425 | |
449 | |
426 | #if EV_USE_INOTIFY |
450 | #if EV_USE_INOTIFY |
|
|
451 | /* hash table entry per inotify-id */ |
427 | typedef struct |
452 | typedef struct |
428 | { |
453 | { |
429 | WL head; |
454 | WL head; |
430 | } ANFS; |
455 | } ANFS; |
|
|
456 | #endif |
|
|
457 | |
|
|
458 | /* Heap Entry */ |
|
|
459 | #if EV_HEAP_CACHE_AT |
|
|
460 | typedef struct { |
|
|
461 | ev_tstamp at; |
|
|
462 | WT w; |
|
|
463 | } ANHE; |
|
|
464 | |
|
|
465 | #define ANHE_w(he) (he).w /* access watcher, read-write */ |
|
|
466 | #define ANHE_at(he) (he).at /* access cached at, read-only */ |
|
|
467 | #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */ |
|
|
468 | #else |
|
|
469 | typedef WT ANHE; |
|
|
470 | |
|
|
471 | #define ANHE_w(he) (he) |
|
|
472 | #define ANHE_at(he) (he)->at |
|
|
473 | #define ANHE_at_cache(he) |
431 | #endif |
474 | #endif |
432 | |
475 | |
433 | #if EV_MULTIPLICITY |
476 | #if EV_MULTIPLICITY |
434 | |
477 | |
435 | struct ev_loop |
478 | struct ev_loop |
… | |
… | |
760 | } |
803 | } |
761 | |
804 | |
762 | /*****************************************************************************/ |
805 | /*****************************************************************************/ |
763 | |
806 | |
764 | /* |
807 | /* |
|
|
808 | * the heap functions want a real array index. array index 0 uis guaranteed to not |
|
|
809 | * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives |
|
|
810 | * the branching factor of the d-tree. |
|
|
811 | */ |
|
|
812 | |
|
|
813 | /* |
765 | * at the moment we allow libev the luxury of two heaps, |
814 | * at the moment we allow libev the luxury of two heaps, |
766 | * a small-code-size 2-heap one and a ~1.5kb larger 4-heap |
815 | * a small-code-size 2-heap one and a ~1.5kb larger 4-heap |
767 | * which is more cache-efficient. |
816 | * which is more cache-efficient. |
768 | * the difference is about 5% with 50000+ watchers. |
817 | * the difference is about 5% with 50000+ watchers. |
769 | */ |
818 | */ |
770 | #define USE_4HEAP !EV_MINIMAL |
|
|
771 | #if USE_4HEAP |
819 | #if EV_USE_4HEAP |
772 | |
820 | |
|
|
821 | #define DHEAP 4 |
773 | #define HEAP0 3 /* index of first element in heap */ |
822 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
|
|
823 | #define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0) |
|
|
824 | #define UPHEAP_DONE(p,k) ((p) == (k)) |
|
|
825 | |
|
|
826 | /* away from the root */ |
|
|
827 | void inline_speed |
|
|
828 | downheap (ANHE *heap, int N, int k) |
|
|
829 | { |
|
|
830 | ANHE he = heap [k]; |
|
|
831 | ANHE *E = heap + N + HEAP0; |
|
|
832 | |
|
|
833 | for (;;) |
|
|
834 | { |
|
|
835 | ev_tstamp minat; |
|
|
836 | ANHE *minpos; |
|
|
837 | ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1; |
|
|
838 | |
|
|
839 | /* find minimum child */ |
|
|
840 | if (expect_true (pos + DHEAP - 1 < E)) |
|
|
841 | { |
|
|
842 | /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
843 | if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
844 | if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
845 | if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
846 | } |
|
|
847 | else if (pos < E) |
|
|
848 | { |
|
|
849 | /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
850 | if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
851 | if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
852 | if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
853 | } |
|
|
854 | else |
|
|
855 | break; |
|
|
856 | |
|
|
857 | if (ANHE_at (he) <= minat) |
|
|
858 | break; |
|
|
859 | |
|
|
860 | heap [k] = *minpos; |
|
|
861 | ev_active (ANHE_w (*minpos)) = k; |
|
|
862 | |
|
|
863 | k = minpos - heap; |
|
|
864 | } |
|
|
865 | |
|
|
866 | heap [k] = he; |
|
|
867 | ev_active (ANHE_w (he)) = k; |
|
|
868 | } |
|
|
869 | |
|
|
870 | #else /* 4HEAP */ |
|
|
871 | |
|
|
872 | #define HEAP0 1 |
|
|
873 | #define HPARENT(k) ((k) >> 1) |
|
|
874 | #define UPHEAP_DONE(p,k) (!(p)) |
|
|
875 | |
|
|
876 | /* away from the root */ |
|
|
877 | void inline_speed |
|
|
878 | downheap (ANHE *heap, int N, int k) |
|
|
879 | { |
|
|
880 | ANHE he = heap [k]; |
|
|
881 | |
|
|
882 | for (;;) |
|
|
883 | { |
|
|
884 | int c = k << 1; |
|
|
885 | |
|
|
886 | if (c > N + HEAP0 - 1) |
|
|
887 | break; |
|
|
888 | |
|
|
889 | c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) |
|
|
890 | ? 1 : 0; |
|
|
891 | |
|
|
892 | if (ANHE_at (he) <= ANHE_at (heap [c])) |
|
|
893 | break; |
|
|
894 | |
|
|
895 | heap [k] = heap [c]; |
|
|
896 | ev_active (ANHE_w (heap [k])) = k; |
|
|
897 | |
|
|
898 | k = c; |
|
|
899 | } |
|
|
900 | |
|
|
901 | heap [k] = he; |
|
|
902 | ev_active (ANHE_w (he)) = k; |
|
|
903 | } |
|
|
904 | #endif |
774 | |
905 | |
775 | /* towards the root */ |
906 | /* towards the root */ |
776 | void inline_speed |
907 | void inline_speed |
777 | upheap (WT *heap, int k) |
908 | upheap (ANHE *heap, int k) |
778 | { |
909 | { |
779 | WT w = heap [k]; |
910 | ANHE he = heap [k]; |
780 | |
911 | |
781 | for (;;) |
912 | for (;;) |
782 | { |
913 | { |
783 | int p = ((k - HEAP0 - 1) / 4) + HEAP0; |
914 | int p = HPARENT (k); |
784 | |
915 | |
785 | if (p >= HEAP0 || heap [p]->at <= w->at) |
916 | if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he)) |
786 | break; |
917 | break; |
787 | |
918 | |
788 | heap [k] = heap [p]; |
919 | heap [k] = heap [p]; |
789 | ev_active (heap [k]) = k; |
920 | ev_active (ANHE_w (heap [k])) = k; |
790 | k = p; |
921 | k = p; |
791 | } |
922 | } |
792 | |
923 | |
793 | heap [k] = w; |
924 | heap [k] = he; |
794 | ev_active (heap [k]) = k; |
925 | ev_active (ANHE_w (he)) = k; |
795 | } |
926 | } |
796 | |
|
|
797 | /* away from the root */ |
|
|
798 | void inline_speed |
|
|
799 | downheap (WT *heap, int N, int k) |
|
|
800 | { |
|
|
801 | WT w = heap [k]; |
|
|
802 | WT *E = heap + N + HEAP0; |
|
|
803 | |
|
|
804 | for (;;) |
|
|
805 | { |
|
|
806 | ev_tstamp minat; |
|
|
807 | WT *minpos; |
|
|
808 | WT *pos = heap + 4 * (k - HEAP0) + HEAP0; |
|
|
809 | |
|
|
810 | // find minimum child |
|
|
811 | if (expect_true (pos +3 < E)) |
|
|
812 | { |
|
|
813 | (minpos = pos + 0), (minat = (*minpos)->at); |
|
|
814 | if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
|
|
815 | if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
|
|
816 | if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
|
|
817 | } |
|
|
818 | else |
|
|
819 | { |
|
|
820 | if (pos >= E) |
|
|
821 | break; |
|
|
822 | |
|
|
823 | (minpos = pos + 0), (minat = (*minpos)->at); |
|
|
824 | if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
|
|
825 | if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
|
|
826 | if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
|
|
827 | } |
|
|
828 | |
|
|
829 | if (w->at <= minat) |
|
|
830 | break; |
|
|
831 | |
|
|
832 | ev_active (*minpos) = k; |
|
|
833 | heap [k] = *minpos; |
|
|
834 | |
|
|
835 | k = minpos - heap; |
|
|
836 | } |
|
|
837 | |
|
|
838 | heap [k] = w; |
|
|
839 | ev_active (heap [k]) = k; |
|
|
840 | } |
|
|
841 | |
|
|
842 | #else // 4HEAP |
|
|
843 | |
|
|
844 | #define HEAP0 1 |
|
|
845 | |
|
|
846 | /* towards the root */ |
|
|
847 | void inline_speed |
|
|
848 | upheap (WT *heap, int k) |
|
|
849 | { |
|
|
850 | WT w = heap [k]; |
|
|
851 | |
|
|
852 | for (;;) |
|
|
853 | { |
|
|
854 | int p = k >> 1; |
|
|
855 | |
|
|
856 | /* maybe we could use a dummy element at heap [0]? */ |
|
|
857 | if (!p || heap [p]->at <= w->at) |
|
|
858 | break; |
|
|
859 | |
|
|
860 | heap [k] = heap [p]; |
|
|
861 | ev_active (heap [k]) = k; |
|
|
862 | k = p; |
|
|
863 | } |
|
|
864 | |
|
|
865 | heap [k] = w; |
|
|
866 | ev_active (heap [k]) = k; |
|
|
867 | } |
|
|
868 | |
|
|
869 | /* away from the root */ |
|
|
870 | void inline_speed |
|
|
871 | downheap (WT *heap, int N, int k) |
|
|
872 | { |
|
|
873 | WT w = heap [k]; |
|
|
874 | |
|
|
875 | for (;;) |
|
|
876 | { |
|
|
877 | int c = k << 1; |
|
|
878 | |
|
|
879 | if (c > N) |
|
|
880 | break; |
|
|
881 | |
|
|
882 | c += c + 1 < N && heap [c]->at > heap [c + 1]->at |
|
|
883 | ? 1 : 0; |
|
|
884 | |
|
|
885 | if (w->at <= heap [c]->at) |
|
|
886 | break; |
|
|
887 | |
|
|
888 | heap [k] = heap [c]; |
|
|
889 | ((W)heap [k])->active = k; |
|
|
890 | |
|
|
891 | k = c; |
|
|
892 | } |
|
|
893 | |
|
|
894 | heap [k] = w; |
|
|
895 | ev_active (heap [k]) = k; |
|
|
896 | } |
|
|
897 | #endif |
|
|
898 | |
927 | |
899 | void inline_size |
928 | void inline_size |
900 | adjustheap (WT *heap, int N, int k) |
929 | adjustheap (ANHE *heap, int N, int k) |
901 | { |
930 | { |
|
|
931 | if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k])) |
902 | upheap (heap, k); |
932 | upheap (heap, k); |
|
|
933 | else |
903 | downheap (heap, N, k); |
934 | downheap (heap, N, k); |
|
|
935 | } |
|
|
936 | |
|
|
937 | /* rebuild the heap: this function is used only once and executed rarely */ |
|
|
938 | void inline_size |
|
|
939 | reheap (ANHE *heap, int N) |
|
|
940 | { |
|
|
941 | int i; |
|
|
942 | |
|
|
943 | /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */ |
|
|
944 | /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */ |
|
|
945 | for (i = 0; i < N; ++i) |
|
|
946 | upheap (heap, i + HEAP0); |
904 | } |
947 | } |
905 | |
948 | |
906 | /*****************************************************************************/ |
949 | /*****************************************************************************/ |
907 | |
950 | |
908 | typedef struct |
951 | typedef struct |
… | |
… | |
1426 | |
1469 | |
1427 | postfork = 0; |
1470 | postfork = 0; |
1428 | } |
1471 | } |
1429 | |
1472 | |
1430 | #if EV_MULTIPLICITY |
1473 | #if EV_MULTIPLICITY |
|
|
1474 | |
1431 | struct ev_loop * |
1475 | struct ev_loop * |
1432 | ev_loop_new (unsigned int flags) |
1476 | ev_loop_new (unsigned int flags) |
1433 | { |
1477 | { |
1434 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
1478 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
1435 | |
1479 | |
… | |
… | |
1453 | void |
1497 | void |
1454 | ev_loop_fork (EV_P) |
1498 | ev_loop_fork (EV_P) |
1455 | { |
1499 | { |
1456 | postfork = 1; /* must be in line with ev_default_fork */ |
1500 | postfork = 1; /* must be in line with ev_default_fork */ |
1457 | } |
1501 | } |
|
|
1502 | |
|
|
1503 | #if EV_VERIFY |
|
|
1504 | void noinline |
|
|
1505 | verify_watcher (EV_P_ W w) |
|
|
1506 | { |
|
|
1507 | assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI)); |
|
|
1508 | |
|
|
1509 | if (w->pending) |
|
|
1510 | assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w)); |
|
|
1511 | } |
|
|
1512 | |
|
|
1513 | static void noinline |
|
|
1514 | verify_heap (EV_P_ ANHE *heap, int N) |
|
|
1515 | { |
|
|
1516 | int i; |
|
|
1517 | |
|
|
1518 | for (i = HEAP0; i < N + HEAP0; ++i) |
|
|
1519 | { |
|
|
1520 | assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i)); |
|
|
1521 | assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i]))); |
|
|
1522 | assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i])))); |
|
|
1523 | |
|
|
1524 | verify_watcher (EV_A_ (W)ANHE_w (heap [i])); |
|
|
1525 | } |
|
|
1526 | } |
|
|
1527 | |
|
|
1528 | static void noinline |
|
|
1529 | array_verify (EV_P_ W *ws, int cnt) |
|
|
1530 | { |
|
|
1531 | while (cnt--) |
|
|
1532 | { |
|
|
1533 | assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1)); |
|
|
1534 | verify_watcher (EV_A_ ws [cnt]); |
|
|
1535 | } |
|
|
1536 | } |
|
|
1537 | #endif |
|
|
1538 | |
|
|
1539 | void |
|
|
1540 | ev_loop_verify (EV_P) |
|
|
1541 | { |
|
|
1542 | #if EV_VERIFY |
|
|
1543 | int i; |
|
|
1544 | WL w; |
|
|
1545 | |
|
|
1546 | assert (activecnt >= -1); |
|
|
1547 | |
|
|
1548 | assert (fdchangemax >= fdchangecnt); |
|
|
1549 | for (i = 0; i < fdchangecnt; ++i) |
|
|
1550 | assert (("negative fd in fdchanges", fdchanges [i] >= 0)); |
|
|
1551 | |
|
|
1552 | assert (anfdmax >= 0); |
|
|
1553 | for (i = 0; i < anfdmax; ++i) |
|
|
1554 | for (w = anfds [i].head; w; w = w->next) |
|
|
1555 | { |
|
|
1556 | verify_watcher (EV_A_ (W)w); |
|
|
1557 | assert (("inactive fd watcher on anfd list", ev_active (w) == 1)); |
|
|
1558 | assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i)); |
|
|
1559 | } |
|
|
1560 | |
|
|
1561 | assert (timermax >= timercnt); |
|
|
1562 | verify_heap (EV_A_ timers, timercnt); |
|
|
1563 | |
|
|
1564 | #if EV_PERIODIC_ENABLE |
|
|
1565 | assert (periodicmax >= periodiccnt); |
|
|
1566 | verify_heap (EV_A_ periodics, periodiccnt); |
|
|
1567 | #endif |
|
|
1568 | |
|
|
1569 | for (i = NUMPRI; i--; ) |
|
|
1570 | { |
|
|
1571 | assert (pendingmax [i] >= pendingcnt [i]); |
|
|
1572 | #if EV_IDLE_ENABLE |
|
|
1573 | assert (idlemax [i] >= idlecnt [i]); |
|
|
1574 | array_verify (EV_A_ (W *)idles [i], idlecnt [i]); |
|
|
1575 | #endif |
|
|
1576 | } |
|
|
1577 | |
|
|
1578 | #if EV_FORK_ENABLE |
|
|
1579 | assert (forkmax >= forkcnt); |
|
|
1580 | array_verify (EV_A_ (W *)forks, forkcnt); |
|
|
1581 | #endif |
|
|
1582 | |
|
|
1583 | #if EV_ASYNC_ENABLE |
|
|
1584 | assert (asyncmax >= asynccnt); |
|
|
1585 | array_verify (EV_A_ (W *)asyncs, asynccnt); |
|
|
1586 | #endif |
|
|
1587 | |
|
|
1588 | assert (preparemax >= preparecnt); |
|
|
1589 | array_verify (EV_A_ (W *)prepares, preparecnt); |
|
|
1590 | |
|
|
1591 | assert (checkmax >= checkcnt); |
|
|
1592 | array_verify (EV_A_ (W *)checks, checkcnt); |
|
|
1593 | |
|
|
1594 | # if 0 |
|
|
1595 | for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next) |
|
|
1596 | for (signum = signalmax; signum--; ) if (signals [signum].gotsig) |
1458 | #endif |
1597 | # endif |
|
|
1598 | #endif |
|
|
1599 | } |
|
|
1600 | |
|
|
1601 | #endif /* multiplicity */ |
1459 | |
1602 | |
1460 | #if EV_MULTIPLICITY |
1603 | #if EV_MULTIPLICITY |
1461 | struct ev_loop * |
1604 | struct ev_loop * |
1462 | ev_default_loop_init (unsigned int flags) |
1605 | ev_default_loop_init (unsigned int flags) |
1463 | #else |
1606 | #else |
… | |
… | |
1539 | { |
1682 | { |
1540 | /*assert (("non-pending watcher on pending list", p->w->pending));*/ |
1683 | /*assert (("non-pending watcher on pending list", p->w->pending));*/ |
1541 | |
1684 | |
1542 | p->w->pending = 0; |
1685 | p->w->pending = 0; |
1543 | EV_CB_INVOKE (p->w, p->events); |
1686 | EV_CB_INVOKE (p->w, p->events); |
|
|
1687 | EV_FREQUENT_CHECK; |
1544 | } |
1688 | } |
1545 | } |
1689 | } |
1546 | } |
1690 | } |
1547 | |
1691 | |
1548 | #if EV_IDLE_ENABLE |
1692 | #if EV_IDLE_ENABLE |
… | |
… | |
1569 | #endif |
1713 | #endif |
1570 | |
1714 | |
1571 | void inline_size |
1715 | void inline_size |
1572 | timers_reify (EV_P) |
1716 | timers_reify (EV_P) |
1573 | { |
1717 | { |
|
|
1718 | EV_FREQUENT_CHECK; |
|
|
1719 | |
1574 | while (timercnt && ev_at (timers [HEAP0]) <= mn_now) |
1720 | while (timercnt && ANHE_at (timers [HEAP0]) < mn_now) |
1575 | { |
1721 | { |
1576 | ev_timer *w = (ev_timer *)timers [HEAP0]; |
1722 | ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); |
1577 | |
1723 | |
1578 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1724 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1579 | |
1725 | |
1580 | /* first reschedule or stop timer */ |
1726 | /* first reschedule or stop timer */ |
1581 | if (w->repeat) |
1727 | if (w->repeat) |
1582 | { |
1728 | { |
1583 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1584 | |
|
|
1585 | ev_at (w) += w->repeat; |
1729 | ev_at (w) += w->repeat; |
1586 | if (ev_at (w) < mn_now) |
1730 | if (ev_at (w) < mn_now) |
1587 | ev_at (w) = mn_now; |
1731 | ev_at (w) = mn_now; |
1588 | |
1732 | |
|
|
1733 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1734 | |
|
|
1735 | ANHE_at_cache (timers [HEAP0]); |
1589 | downheap (timers, timercnt, HEAP0); |
1736 | downheap (timers, timercnt, HEAP0); |
1590 | } |
1737 | } |
1591 | else |
1738 | else |
1592 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1739 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1593 | |
1740 | |
|
|
1741 | EV_FREQUENT_CHECK; |
1594 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
1742 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
1595 | } |
1743 | } |
1596 | } |
1744 | } |
1597 | |
1745 | |
1598 | #if EV_PERIODIC_ENABLE |
1746 | #if EV_PERIODIC_ENABLE |
1599 | void inline_size |
1747 | void inline_size |
1600 | periodics_reify (EV_P) |
1748 | periodics_reify (EV_P) |
1601 | { |
1749 | { |
|
|
1750 | EV_FREQUENT_CHECK; |
|
|
1751 | |
1602 | while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) |
1752 | while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now) |
1603 | { |
1753 | { |
1604 | ev_periodic *w = (ev_periodic *)periodics [HEAP0]; |
1754 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); |
1605 | |
1755 | |
1606 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1756 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1607 | |
1757 | |
1608 | /* first reschedule or stop timer */ |
1758 | /* first reschedule or stop timer */ |
1609 | if (w->reschedule_cb) |
1759 | if (w->reschedule_cb) |
1610 | { |
1760 | { |
1611 | ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); |
1761 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
|
|
1762 | |
1612 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); |
1763 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now)); |
|
|
1764 | |
|
|
1765 | ANHE_at_cache (periodics [HEAP0]); |
1613 | downheap (periodics, periodiccnt, 1); |
1766 | downheap (periodics, periodiccnt, HEAP0); |
1614 | } |
1767 | } |
1615 | else if (w->interval) |
1768 | else if (w->interval) |
1616 | { |
1769 | { |
1617 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1770 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1771 | /* if next trigger time is not sufficiently in the future, put it there */ |
|
|
1772 | /* this might happen because of floating point inexactness */ |
1618 | if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; |
1773 | if (ev_at (w) - ev_rt_now < TIME_EPSILON) |
1619 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now)); |
1774 | { |
|
|
1775 | ev_at (w) += w->interval; |
|
|
1776 | |
|
|
1777 | /* if interval is unreasonably low we might still have a time in the past */ |
|
|
1778 | /* so correct this. this will make the periodic very inexact, but the user */ |
|
|
1779 | /* has effectively asked to get triggered more often than possible */ |
|
|
1780 | if (ev_at (w) < ev_rt_now) |
|
|
1781 | ev_at (w) = ev_rt_now; |
|
|
1782 | } |
|
|
1783 | |
|
|
1784 | ANHE_at_cache (periodics [HEAP0]); |
1620 | downheap (periodics, periodiccnt, HEAP0); |
1785 | downheap (periodics, periodiccnt, HEAP0); |
1621 | } |
1786 | } |
1622 | else |
1787 | else |
1623 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1788 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1624 | |
1789 | |
|
|
1790 | EV_FREQUENT_CHECK; |
1625 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1791 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1626 | } |
1792 | } |
1627 | } |
1793 | } |
1628 | |
1794 | |
1629 | static void noinline |
1795 | static void noinline |
1630 | periodics_reschedule (EV_P) |
1796 | periodics_reschedule (EV_P) |
1631 | { |
1797 | { |
1632 | int i; |
1798 | int i; |
1633 | |
1799 | |
1634 | /* adjust periodics after time jump */ |
1800 | /* adjust periodics after time jump */ |
1635 | for (i = 1; i <= periodiccnt; ++i) |
1801 | for (i = HEAP0; i < periodiccnt + HEAP0; ++i) |
1636 | { |
1802 | { |
1637 | ev_periodic *w = (ev_periodic *)periodics [i]; |
1803 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]); |
1638 | |
1804 | |
1639 | if (w->reschedule_cb) |
1805 | if (w->reschedule_cb) |
1640 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1806 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1641 | else if (w->interval) |
1807 | else if (w->interval) |
1642 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1808 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1643 | } |
|
|
1644 | |
1809 | |
1645 | /* now rebuild the heap */ |
1810 | ANHE_at_cache (periodics [i]); |
1646 | for (i = periodiccnt >> 1; --i; ) |
1811 | } |
|
|
1812 | |
1647 | downheap (periodics, periodiccnt, i + HEAP0); |
1813 | reheap (periodics, periodiccnt); |
1648 | } |
1814 | } |
1649 | #endif |
1815 | #endif |
1650 | |
1816 | |
1651 | void inline_speed |
1817 | void inline_speed |
1652 | time_update (EV_P_ ev_tstamp max_block) |
1818 | time_update (EV_P_ ev_tstamp max_block) |
… | |
… | |
1706 | { |
1872 | { |
1707 | #if EV_PERIODIC_ENABLE |
1873 | #if EV_PERIODIC_ENABLE |
1708 | periodics_reschedule (EV_A); |
1874 | periodics_reschedule (EV_A); |
1709 | #endif |
1875 | #endif |
1710 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1876 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1711 | for (i = 1; i <= timercnt; ++i) |
1877 | for (i = 0; i < timercnt; ++i) |
1712 | ev_at (timers [i]) += ev_rt_now - mn_now; |
1878 | { |
|
|
1879 | ANHE *he = timers + i + HEAP0; |
|
|
1880 | ANHE_w (*he)->at += ev_rt_now - mn_now; |
|
|
1881 | ANHE_at_cache (*he); |
|
|
1882 | } |
1713 | } |
1883 | } |
1714 | |
1884 | |
1715 | mn_now = ev_rt_now; |
1885 | mn_now = ev_rt_now; |
1716 | } |
1886 | } |
1717 | } |
1887 | } |
… | |
… | |
1737 | |
1907 | |
1738 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
1908 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
1739 | |
1909 | |
1740 | do |
1910 | do |
1741 | { |
1911 | { |
|
|
1912 | #if EV_VERIFY >= 2 |
|
|
1913 | ev_loop_verify (EV_A); |
|
|
1914 | #endif |
|
|
1915 | |
1742 | #ifndef _WIN32 |
1916 | #ifndef _WIN32 |
1743 | if (expect_false (curpid)) /* penalise the forking check even more */ |
1917 | if (expect_false (curpid)) /* penalise the forking check even more */ |
1744 | if (expect_false (getpid () != curpid)) |
1918 | if (expect_false (getpid () != curpid)) |
1745 | { |
1919 | { |
1746 | curpid = getpid (); |
1920 | curpid = getpid (); |
… | |
… | |
1787 | |
1961 | |
1788 | waittime = MAX_BLOCKTIME; |
1962 | waittime = MAX_BLOCKTIME; |
1789 | |
1963 | |
1790 | if (timercnt) |
1964 | if (timercnt) |
1791 | { |
1965 | { |
1792 | ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; |
1966 | ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge; |
1793 | if (waittime > to) waittime = to; |
1967 | if (waittime > to) waittime = to; |
1794 | } |
1968 | } |
1795 | |
1969 | |
1796 | #if EV_PERIODIC_ENABLE |
1970 | #if EV_PERIODIC_ENABLE |
1797 | if (periodiccnt) |
1971 | if (periodiccnt) |
1798 | { |
1972 | { |
1799 | ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1973 | ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1800 | if (waittime > to) waittime = to; |
1974 | if (waittime > to) waittime = to; |
1801 | } |
1975 | } |
1802 | #endif |
1976 | #endif |
1803 | |
1977 | |
1804 | if (expect_false (waittime < timeout_blocktime)) |
1978 | if (expect_false (waittime < timeout_blocktime)) |
… | |
… | |
1941 | if (expect_false (ev_is_active (w))) |
2115 | if (expect_false (ev_is_active (w))) |
1942 | return; |
2116 | return; |
1943 | |
2117 | |
1944 | assert (("ev_io_start called with negative fd", fd >= 0)); |
2118 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1945 | |
2119 | |
|
|
2120 | EV_FREQUENT_CHECK; |
|
|
2121 | |
1946 | ev_start (EV_A_ (W)w, 1); |
2122 | ev_start (EV_A_ (W)w, 1); |
1947 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
2123 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1948 | wlist_add (&anfds[fd].head, (WL)w); |
2124 | wlist_add (&anfds[fd].head, (WL)w); |
1949 | |
2125 | |
1950 | fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); |
2126 | fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); |
1951 | w->events &= ~EV_IOFDSET; |
2127 | w->events &= ~EV_IOFDSET; |
|
|
2128 | |
|
|
2129 | EV_FREQUENT_CHECK; |
1952 | } |
2130 | } |
1953 | |
2131 | |
1954 | void noinline |
2132 | void noinline |
1955 | ev_io_stop (EV_P_ ev_io *w) |
2133 | ev_io_stop (EV_P_ ev_io *w) |
1956 | { |
2134 | { |
1957 | clear_pending (EV_A_ (W)w); |
2135 | clear_pending (EV_A_ (W)w); |
1958 | if (expect_false (!ev_is_active (w))) |
2136 | if (expect_false (!ev_is_active (w))) |
1959 | return; |
2137 | return; |
1960 | |
2138 | |
1961 | assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
2139 | assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
|
|
2140 | |
|
|
2141 | EV_FREQUENT_CHECK; |
1962 | |
2142 | |
1963 | wlist_del (&anfds[w->fd].head, (WL)w); |
2143 | wlist_del (&anfds[w->fd].head, (WL)w); |
1964 | ev_stop (EV_A_ (W)w); |
2144 | ev_stop (EV_A_ (W)w); |
1965 | |
2145 | |
1966 | fd_change (EV_A_ w->fd, 1); |
2146 | fd_change (EV_A_ w->fd, 1); |
|
|
2147 | |
|
|
2148 | EV_FREQUENT_CHECK; |
1967 | } |
2149 | } |
1968 | |
2150 | |
1969 | void noinline |
2151 | void noinline |
1970 | ev_timer_start (EV_P_ ev_timer *w) |
2152 | ev_timer_start (EV_P_ ev_timer *w) |
1971 | { |
2153 | { |
… | |
… | |
1974 | |
2156 | |
1975 | ev_at (w) += mn_now; |
2157 | ev_at (w) += mn_now; |
1976 | |
2158 | |
1977 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
2159 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1978 | |
2160 | |
|
|
2161 | EV_FREQUENT_CHECK; |
|
|
2162 | |
|
|
2163 | ++timercnt; |
1979 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
2164 | ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1); |
1980 | array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); |
2165 | array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); |
1981 | timers [ev_active (w)] = (WT)w; |
2166 | ANHE_w (timers [ev_active (w)]) = (WT)w; |
|
|
2167 | ANHE_at_cache (timers [ev_active (w)]); |
1982 | upheap (timers, ev_active (w)); |
2168 | upheap (timers, ev_active (w)); |
1983 | |
2169 | |
|
|
2170 | EV_FREQUENT_CHECK; |
|
|
2171 | |
1984 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ |
2172 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ |
1985 | } |
2173 | } |
1986 | |
2174 | |
1987 | void noinline |
2175 | void noinline |
1988 | ev_timer_stop (EV_P_ ev_timer *w) |
2176 | ev_timer_stop (EV_P_ ev_timer *w) |
1989 | { |
2177 | { |
1990 | clear_pending (EV_A_ (W)w); |
2178 | clear_pending (EV_A_ (W)w); |
1991 | if (expect_false (!ev_is_active (w))) |
2179 | if (expect_false (!ev_is_active (w))) |
1992 | return; |
2180 | return; |
1993 | |
2181 | |
|
|
2182 | EV_FREQUENT_CHECK; |
|
|
2183 | |
1994 | { |
2184 | { |
1995 | int active = ev_active (w); |
2185 | int active = ev_active (w); |
1996 | |
2186 | |
1997 | assert (("internal timer heap corruption", timers [active] == (WT)w)); |
2187 | assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); |
1998 | |
2188 | |
|
|
2189 | --timercnt; |
|
|
2190 | |
1999 | if (expect_true (active < timercnt + HEAP0 - 1)) |
2191 | if (expect_true (active < timercnt + HEAP0)) |
2000 | { |
2192 | { |
2001 | timers [active] = timers [timercnt + HEAP0 - 1]; |
2193 | timers [active] = timers [timercnt + HEAP0]; |
2002 | adjustheap (timers, timercnt, active); |
2194 | adjustheap (timers, timercnt, active); |
2003 | } |
2195 | } |
2004 | |
|
|
2005 | --timercnt; |
|
|
2006 | } |
2196 | } |
|
|
2197 | |
|
|
2198 | EV_FREQUENT_CHECK; |
2007 | |
2199 | |
2008 | ev_at (w) -= mn_now; |
2200 | ev_at (w) -= mn_now; |
2009 | |
2201 | |
2010 | ev_stop (EV_A_ (W)w); |
2202 | ev_stop (EV_A_ (W)w); |
2011 | } |
2203 | } |
2012 | |
2204 | |
2013 | void noinline |
2205 | void noinline |
2014 | ev_timer_again (EV_P_ ev_timer *w) |
2206 | ev_timer_again (EV_P_ ev_timer *w) |
2015 | { |
2207 | { |
|
|
2208 | EV_FREQUENT_CHECK; |
|
|
2209 | |
2016 | if (ev_is_active (w)) |
2210 | if (ev_is_active (w)) |
2017 | { |
2211 | { |
2018 | if (w->repeat) |
2212 | if (w->repeat) |
2019 | { |
2213 | { |
2020 | ev_at (w) = mn_now + w->repeat; |
2214 | ev_at (w) = mn_now + w->repeat; |
|
|
2215 | ANHE_at_cache (timers [ev_active (w)]); |
2021 | adjustheap (timers, timercnt, ev_active (w)); |
2216 | adjustheap (timers, timercnt, ev_active (w)); |
2022 | } |
2217 | } |
2023 | else |
2218 | else |
2024 | ev_timer_stop (EV_A_ w); |
2219 | ev_timer_stop (EV_A_ w); |
2025 | } |
2220 | } |
2026 | else if (w->repeat) |
2221 | else if (w->repeat) |
2027 | { |
2222 | { |
2028 | ev_at (w) = w->repeat; |
2223 | ev_at (w) = w->repeat; |
2029 | ev_timer_start (EV_A_ w); |
2224 | ev_timer_start (EV_A_ w); |
2030 | } |
2225 | } |
|
|
2226 | |
|
|
2227 | EV_FREQUENT_CHECK; |
2031 | } |
2228 | } |
2032 | |
2229 | |
2033 | #if EV_PERIODIC_ENABLE |
2230 | #if EV_PERIODIC_ENABLE |
2034 | void noinline |
2231 | void noinline |
2035 | ev_periodic_start (EV_P_ ev_periodic *w) |
2232 | ev_periodic_start (EV_P_ ev_periodic *w) |
… | |
… | |
2046 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
2243 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
2047 | } |
2244 | } |
2048 | else |
2245 | else |
2049 | ev_at (w) = w->offset; |
2246 | ev_at (w) = w->offset; |
2050 | |
2247 | |
|
|
2248 | EV_FREQUENT_CHECK; |
|
|
2249 | |
|
|
2250 | ++periodiccnt; |
2051 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
2251 | ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1); |
2052 | array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); |
2252 | array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); |
2053 | periodics [ev_active (w)] = (WT)w; |
2253 | ANHE_w (periodics [ev_active (w)]) = (WT)w; |
|
|
2254 | ANHE_at_cache (periodics [ev_active (w)]); |
2054 | upheap (periodics, ev_active (w)); |
2255 | upheap (periodics, ev_active (w)); |
2055 | |
2256 | |
|
|
2257 | EV_FREQUENT_CHECK; |
|
|
2258 | |
2056 | /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ |
2259 | /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ |
2057 | } |
2260 | } |
2058 | |
2261 | |
2059 | void noinline |
2262 | void noinline |
2060 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2263 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2061 | { |
2264 | { |
2062 | clear_pending (EV_A_ (W)w); |
2265 | clear_pending (EV_A_ (W)w); |
2063 | if (expect_false (!ev_is_active (w))) |
2266 | if (expect_false (!ev_is_active (w))) |
2064 | return; |
2267 | return; |
2065 | |
2268 | |
|
|
2269 | EV_FREQUENT_CHECK; |
|
|
2270 | |
2066 | { |
2271 | { |
2067 | int active = ev_active (w); |
2272 | int active = ev_active (w); |
2068 | |
2273 | |
2069 | assert (("internal periodic heap corruption", periodics [active] == (WT)w)); |
2274 | assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); |
2070 | |
2275 | |
|
|
2276 | --periodiccnt; |
|
|
2277 | |
2071 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
2278 | if (expect_true (active < periodiccnt + HEAP0)) |
2072 | { |
2279 | { |
2073 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
2280 | periodics [active] = periodics [periodiccnt + HEAP0]; |
2074 | adjustheap (periodics, periodiccnt, active); |
2281 | adjustheap (periodics, periodiccnt, active); |
2075 | } |
2282 | } |
2076 | |
|
|
2077 | --periodiccnt; |
|
|
2078 | } |
2283 | } |
|
|
2284 | |
|
|
2285 | EV_FREQUENT_CHECK; |
2079 | |
2286 | |
2080 | ev_stop (EV_A_ (W)w); |
2287 | ev_stop (EV_A_ (W)w); |
2081 | } |
2288 | } |
2082 | |
2289 | |
2083 | void noinline |
2290 | void noinline |
… | |
… | |
2103 | return; |
2310 | return; |
2104 | |
2311 | |
2105 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
2312 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
2106 | |
2313 | |
2107 | evpipe_init (EV_A); |
2314 | evpipe_init (EV_A); |
|
|
2315 | |
|
|
2316 | EV_FREQUENT_CHECK; |
2108 | |
2317 | |
2109 | { |
2318 | { |
2110 | #ifndef _WIN32 |
2319 | #ifndef _WIN32 |
2111 | sigset_t full, prev; |
2320 | sigset_t full, prev; |
2112 | sigfillset (&full); |
2321 | sigfillset (&full); |
… | |
… | |
2133 | sigfillset (&sa.sa_mask); |
2342 | sigfillset (&sa.sa_mask); |
2134 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
2343 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
2135 | sigaction (w->signum, &sa, 0); |
2344 | sigaction (w->signum, &sa, 0); |
2136 | #endif |
2345 | #endif |
2137 | } |
2346 | } |
|
|
2347 | |
|
|
2348 | EV_FREQUENT_CHECK; |
2138 | } |
2349 | } |
2139 | |
2350 | |
2140 | void noinline |
2351 | void noinline |
2141 | ev_signal_stop (EV_P_ ev_signal *w) |
2352 | ev_signal_stop (EV_P_ ev_signal *w) |
2142 | { |
2353 | { |
2143 | clear_pending (EV_A_ (W)w); |
2354 | clear_pending (EV_A_ (W)w); |
2144 | if (expect_false (!ev_is_active (w))) |
2355 | if (expect_false (!ev_is_active (w))) |
2145 | return; |
2356 | return; |
2146 | |
2357 | |
|
|
2358 | EV_FREQUENT_CHECK; |
|
|
2359 | |
2147 | wlist_del (&signals [w->signum - 1].head, (WL)w); |
2360 | wlist_del (&signals [w->signum - 1].head, (WL)w); |
2148 | ev_stop (EV_A_ (W)w); |
2361 | ev_stop (EV_A_ (W)w); |
2149 | |
2362 | |
2150 | if (!signals [w->signum - 1].head) |
2363 | if (!signals [w->signum - 1].head) |
2151 | signal (w->signum, SIG_DFL); |
2364 | signal (w->signum, SIG_DFL); |
|
|
2365 | |
|
|
2366 | EV_FREQUENT_CHECK; |
2152 | } |
2367 | } |
2153 | |
2368 | |
2154 | void |
2369 | void |
2155 | ev_child_start (EV_P_ ev_child *w) |
2370 | ev_child_start (EV_P_ ev_child *w) |
2156 | { |
2371 | { |
… | |
… | |
2158 | assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
2373 | assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); |
2159 | #endif |
2374 | #endif |
2160 | if (expect_false (ev_is_active (w))) |
2375 | if (expect_false (ev_is_active (w))) |
2161 | return; |
2376 | return; |
2162 | |
2377 | |
|
|
2378 | EV_FREQUENT_CHECK; |
|
|
2379 | |
2163 | ev_start (EV_A_ (W)w, 1); |
2380 | ev_start (EV_A_ (W)w, 1); |
2164 | wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
2381 | wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
|
|
2382 | |
|
|
2383 | EV_FREQUENT_CHECK; |
2165 | } |
2384 | } |
2166 | |
2385 | |
2167 | void |
2386 | void |
2168 | ev_child_stop (EV_P_ ev_child *w) |
2387 | ev_child_stop (EV_P_ ev_child *w) |
2169 | { |
2388 | { |
2170 | clear_pending (EV_A_ (W)w); |
2389 | clear_pending (EV_A_ (W)w); |
2171 | if (expect_false (!ev_is_active (w))) |
2390 | if (expect_false (!ev_is_active (w))) |
2172 | return; |
2391 | return; |
2173 | |
2392 | |
|
|
2393 | EV_FREQUENT_CHECK; |
|
|
2394 | |
2174 | wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
2395 | wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); |
2175 | ev_stop (EV_A_ (W)w); |
2396 | ev_stop (EV_A_ (W)w); |
|
|
2397 | |
|
|
2398 | EV_FREQUENT_CHECK; |
2176 | } |
2399 | } |
2177 | |
2400 | |
2178 | #if EV_STAT_ENABLE |
2401 | #if EV_STAT_ENABLE |
2179 | |
2402 | |
2180 | # ifdef _WIN32 |
2403 | # ifdef _WIN32 |
… | |
… | |
2408 | else |
2631 | else |
2409 | #endif |
2632 | #endif |
2410 | ev_timer_start (EV_A_ &w->timer); |
2633 | ev_timer_start (EV_A_ &w->timer); |
2411 | |
2634 | |
2412 | ev_start (EV_A_ (W)w, 1); |
2635 | ev_start (EV_A_ (W)w, 1); |
|
|
2636 | |
|
|
2637 | EV_FREQUENT_CHECK; |
2413 | } |
2638 | } |
2414 | |
2639 | |
2415 | void |
2640 | void |
2416 | ev_stat_stop (EV_P_ ev_stat *w) |
2641 | ev_stat_stop (EV_P_ ev_stat *w) |
2417 | { |
2642 | { |
2418 | clear_pending (EV_A_ (W)w); |
2643 | clear_pending (EV_A_ (W)w); |
2419 | if (expect_false (!ev_is_active (w))) |
2644 | if (expect_false (!ev_is_active (w))) |
2420 | return; |
2645 | return; |
2421 | |
2646 | |
|
|
2647 | EV_FREQUENT_CHECK; |
|
|
2648 | |
2422 | #if EV_USE_INOTIFY |
2649 | #if EV_USE_INOTIFY |
2423 | infy_del (EV_A_ w); |
2650 | infy_del (EV_A_ w); |
2424 | #endif |
2651 | #endif |
2425 | ev_timer_stop (EV_A_ &w->timer); |
2652 | ev_timer_stop (EV_A_ &w->timer); |
2426 | |
2653 | |
2427 | ev_stop (EV_A_ (W)w); |
2654 | ev_stop (EV_A_ (W)w); |
|
|
2655 | |
|
|
2656 | EV_FREQUENT_CHECK; |
2428 | } |
2657 | } |
2429 | #endif |
2658 | #endif |
2430 | |
2659 | |
2431 | #if EV_IDLE_ENABLE |
2660 | #if EV_IDLE_ENABLE |
2432 | void |
2661 | void |
… | |
… | |
2434 | { |
2663 | { |
2435 | if (expect_false (ev_is_active (w))) |
2664 | if (expect_false (ev_is_active (w))) |
2436 | return; |
2665 | return; |
2437 | |
2666 | |
2438 | pri_adjust (EV_A_ (W)w); |
2667 | pri_adjust (EV_A_ (W)w); |
|
|
2668 | |
|
|
2669 | EV_FREQUENT_CHECK; |
2439 | |
2670 | |
2440 | { |
2671 | { |
2441 | int active = ++idlecnt [ABSPRI (w)]; |
2672 | int active = ++idlecnt [ABSPRI (w)]; |
2442 | |
2673 | |
2443 | ++idleall; |
2674 | ++idleall; |
2444 | ev_start (EV_A_ (W)w, active); |
2675 | ev_start (EV_A_ (W)w, active); |
2445 | |
2676 | |
2446 | array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); |
2677 | array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); |
2447 | idles [ABSPRI (w)][active - 1] = w; |
2678 | idles [ABSPRI (w)][active - 1] = w; |
2448 | } |
2679 | } |
|
|
2680 | |
|
|
2681 | EV_FREQUENT_CHECK; |
2449 | } |
2682 | } |
2450 | |
2683 | |
2451 | void |
2684 | void |
2452 | ev_idle_stop (EV_P_ ev_idle *w) |
2685 | ev_idle_stop (EV_P_ ev_idle *w) |
2453 | { |
2686 | { |
2454 | clear_pending (EV_A_ (W)w); |
2687 | clear_pending (EV_A_ (W)w); |
2455 | if (expect_false (!ev_is_active (w))) |
2688 | if (expect_false (!ev_is_active (w))) |
2456 | return; |
2689 | return; |
2457 | |
2690 | |
|
|
2691 | EV_FREQUENT_CHECK; |
|
|
2692 | |
2458 | { |
2693 | { |
2459 | int active = ev_active (w); |
2694 | int active = ev_active (w); |
2460 | |
2695 | |
2461 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
2696 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
2462 | ev_active (idles [ABSPRI (w)][active - 1]) = active; |
2697 | ev_active (idles [ABSPRI (w)][active - 1]) = active; |
2463 | |
2698 | |
2464 | ev_stop (EV_A_ (W)w); |
2699 | ev_stop (EV_A_ (W)w); |
2465 | --idleall; |
2700 | --idleall; |
2466 | } |
2701 | } |
|
|
2702 | |
|
|
2703 | EV_FREQUENT_CHECK; |
2467 | } |
2704 | } |
2468 | #endif |
2705 | #endif |
2469 | |
2706 | |
2470 | void |
2707 | void |
2471 | ev_prepare_start (EV_P_ ev_prepare *w) |
2708 | ev_prepare_start (EV_P_ ev_prepare *w) |
2472 | { |
2709 | { |
2473 | if (expect_false (ev_is_active (w))) |
2710 | if (expect_false (ev_is_active (w))) |
2474 | return; |
2711 | return; |
|
|
2712 | |
|
|
2713 | EV_FREQUENT_CHECK; |
2475 | |
2714 | |
2476 | ev_start (EV_A_ (W)w, ++preparecnt); |
2715 | ev_start (EV_A_ (W)w, ++preparecnt); |
2477 | array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); |
2716 | array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); |
2478 | prepares [preparecnt - 1] = w; |
2717 | prepares [preparecnt - 1] = w; |
|
|
2718 | |
|
|
2719 | EV_FREQUENT_CHECK; |
2479 | } |
2720 | } |
2480 | |
2721 | |
2481 | void |
2722 | void |
2482 | ev_prepare_stop (EV_P_ ev_prepare *w) |
2723 | ev_prepare_stop (EV_P_ ev_prepare *w) |
2483 | { |
2724 | { |
2484 | clear_pending (EV_A_ (W)w); |
2725 | clear_pending (EV_A_ (W)w); |
2485 | if (expect_false (!ev_is_active (w))) |
2726 | if (expect_false (!ev_is_active (w))) |
2486 | return; |
2727 | return; |
2487 | |
2728 | |
|
|
2729 | EV_FREQUENT_CHECK; |
|
|
2730 | |
2488 | { |
2731 | { |
2489 | int active = ev_active (w); |
2732 | int active = ev_active (w); |
2490 | |
2733 | |
2491 | prepares [active - 1] = prepares [--preparecnt]; |
2734 | prepares [active - 1] = prepares [--preparecnt]; |
2492 | ev_active (prepares [active - 1]) = active; |
2735 | ev_active (prepares [active - 1]) = active; |
2493 | } |
2736 | } |
2494 | |
2737 | |
2495 | ev_stop (EV_A_ (W)w); |
2738 | ev_stop (EV_A_ (W)w); |
|
|
2739 | |
|
|
2740 | EV_FREQUENT_CHECK; |
2496 | } |
2741 | } |
2497 | |
2742 | |
2498 | void |
2743 | void |
2499 | ev_check_start (EV_P_ ev_check *w) |
2744 | ev_check_start (EV_P_ ev_check *w) |
2500 | { |
2745 | { |
2501 | if (expect_false (ev_is_active (w))) |
2746 | if (expect_false (ev_is_active (w))) |
2502 | return; |
2747 | return; |
|
|
2748 | |
|
|
2749 | EV_FREQUENT_CHECK; |
2503 | |
2750 | |
2504 | ev_start (EV_A_ (W)w, ++checkcnt); |
2751 | ev_start (EV_A_ (W)w, ++checkcnt); |
2505 | array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); |
2752 | array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); |
2506 | checks [checkcnt - 1] = w; |
2753 | checks [checkcnt - 1] = w; |
|
|
2754 | |
|
|
2755 | EV_FREQUENT_CHECK; |
2507 | } |
2756 | } |
2508 | |
2757 | |
2509 | void |
2758 | void |
2510 | ev_check_stop (EV_P_ ev_check *w) |
2759 | ev_check_stop (EV_P_ ev_check *w) |
2511 | { |
2760 | { |
2512 | clear_pending (EV_A_ (W)w); |
2761 | clear_pending (EV_A_ (W)w); |
2513 | if (expect_false (!ev_is_active (w))) |
2762 | if (expect_false (!ev_is_active (w))) |
2514 | return; |
2763 | return; |
2515 | |
2764 | |
|
|
2765 | EV_FREQUENT_CHECK; |
|
|
2766 | |
2516 | { |
2767 | { |
2517 | int active = ev_active (w); |
2768 | int active = ev_active (w); |
2518 | |
2769 | |
2519 | checks [active - 1] = checks [--checkcnt]; |
2770 | checks [active - 1] = checks [--checkcnt]; |
2520 | ev_active (checks [active - 1]) = active; |
2771 | ev_active (checks [active - 1]) = active; |
2521 | } |
2772 | } |
2522 | |
2773 | |
2523 | ev_stop (EV_A_ (W)w); |
2774 | ev_stop (EV_A_ (W)w); |
|
|
2775 | |
|
|
2776 | EV_FREQUENT_CHECK; |
2524 | } |
2777 | } |
2525 | |
2778 | |
2526 | #if EV_EMBED_ENABLE |
2779 | #if EV_EMBED_ENABLE |
2527 | void noinline |
2780 | void noinline |
2528 | ev_embed_sweep (EV_P_ ev_embed *w) |
2781 | ev_embed_sweep (EV_P_ ev_embed *w) |
… | |
… | |
2575 | struct ev_loop *loop = w->other; |
2828 | struct ev_loop *loop = w->other; |
2576 | assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); |
2829 | assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); |
2577 | ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); |
2830 | ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); |
2578 | } |
2831 | } |
2579 | |
2832 | |
|
|
2833 | EV_FREQUENT_CHECK; |
|
|
2834 | |
2580 | ev_set_priority (&w->io, ev_priority (w)); |
2835 | ev_set_priority (&w->io, ev_priority (w)); |
2581 | ev_io_start (EV_A_ &w->io); |
2836 | ev_io_start (EV_A_ &w->io); |
2582 | |
2837 | |
2583 | ev_prepare_init (&w->prepare, embed_prepare_cb); |
2838 | ev_prepare_init (&w->prepare, embed_prepare_cb); |
2584 | ev_set_priority (&w->prepare, EV_MINPRI); |
2839 | ev_set_priority (&w->prepare, EV_MINPRI); |
2585 | ev_prepare_start (EV_A_ &w->prepare); |
2840 | ev_prepare_start (EV_A_ &w->prepare); |
2586 | |
2841 | |
2587 | /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ |
2842 | /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ |
2588 | |
2843 | |
2589 | ev_start (EV_A_ (W)w, 1); |
2844 | ev_start (EV_A_ (W)w, 1); |
|
|
2845 | |
|
|
2846 | EV_FREQUENT_CHECK; |
2590 | } |
2847 | } |
2591 | |
2848 | |
2592 | void |
2849 | void |
2593 | ev_embed_stop (EV_P_ ev_embed *w) |
2850 | ev_embed_stop (EV_P_ ev_embed *w) |
2594 | { |
2851 | { |
2595 | clear_pending (EV_A_ (W)w); |
2852 | clear_pending (EV_A_ (W)w); |
2596 | if (expect_false (!ev_is_active (w))) |
2853 | if (expect_false (!ev_is_active (w))) |
2597 | return; |
2854 | return; |
2598 | |
2855 | |
|
|
2856 | EV_FREQUENT_CHECK; |
|
|
2857 | |
2599 | ev_io_stop (EV_A_ &w->io); |
2858 | ev_io_stop (EV_A_ &w->io); |
2600 | ev_prepare_stop (EV_A_ &w->prepare); |
2859 | ev_prepare_stop (EV_A_ &w->prepare); |
2601 | |
2860 | |
2602 | ev_stop (EV_A_ (W)w); |
2861 | ev_stop (EV_A_ (W)w); |
|
|
2862 | |
|
|
2863 | EV_FREQUENT_CHECK; |
2603 | } |
2864 | } |
2604 | #endif |
2865 | #endif |
2605 | |
2866 | |
2606 | #if EV_FORK_ENABLE |
2867 | #if EV_FORK_ENABLE |
2607 | void |
2868 | void |
2608 | ev_fork_start (EV_P_ ev_fork *w) |
2869 | ev_fork_start (EV_P_ ev_fork *w) |
2609 | { |
2870 | { |
2610 | if (expect_false (ev_is_active (w))) |
2871 | if (expect_false (ev_is_active (w))) |
2611 | return; |
2872 | return; |
|
|
2873 | |
|
|
2874 | EV_FREQUENT_CHECK; |
2612 | |
2875 | |
2613 | ev_start (EV_A_ (W)w, ++forkcnt); |
2876 | ev_start (EV_A_ (W)w, ++forkcnt); |
2614 | array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); |
2877 | array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); |
2615 | forks [forkcnt - 1] = w; |
2878 | forks [forkcnt - 1] = w; |
|
|
2879 | |
|
|
2880 | EV_FREQUENT_CHECK; |
2616 | } |
2881 | } |
2617 | |
2882 | |
2618 | void |
2883 | void |
2619 | ev_fork_stop (EV_P_ ev_fork *w) |
2884 | ev_fork_stop (EV_P_ ev_fork *w) |
2620 | { |
2885 | { |
2621 | clear_pending (EV_A_ (W)w); |
2886 | clear_pending (EV_A_ (W)w); |
2622 | if (expect_false (!ev_is_active (w))) |
2887 | if (expect_false (!ev_is_active (w))) |
2623 | return; |
2888 | return; |
2624 | |
2889 | |
|
|
2890 | EV_FREQUENT_CHECK; |
|
|
2891 | |
2625 | { |
2892 | { |
2626 | int active = ev_active (w); |
2893 | int active = ev_active (w); |
2627 | |
2894 | |
2628 | forks [active - 1] = forks [--forkcnt]; |
2895 | forks [active - 1] = forks [--forkcnt]; |
2629 | ev_active (forks [active - 1]) = active; |
2896 | ev_active (forks [active - 1]) = active; |
2630 | } |
2897 | } |
2631 | |
2898 | |
2632 | ev_stop (EV_A_ (W)w); |
2899 | ev_stop (EV_A_ (W)w); |
|
|
2900 | |
|
|
2901 | EV_FREQUENT_CHECK; |
2633 | } |
2902 | } |
2634 | #endif |
2903 | #endif |
2635 | |
2904 | |
2636 | #if EV_ASYNC_ENABLE |
2905 | #if EV_ASYNC_ENABLE |
2637 | void |
2906 | void |
… | |
… | |
2639 | { |
2908 | { |
2640 | if (expect_false (ev_is_active (w))) |
2909 | if (expect_false (ev_is_active (w))) |
2641 | return; |
2910 | return; |
2642 | |
2911 | |
2643 | evpipe_init (EV_A); |
2912 | evpipe_init (EV_A); |
|
|
2913 | |
|
|
2914 | EV_FREQUENT_CHECK; |
2644 | |
2915 | |
2645 | ev_start (EV_A_ (W)w, ++asynccnt); |
2916 | ev_start (EV_A_ (W)w, ++asynccnt); |
2646 | array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); |
2917 | array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); |
2647 | asyncs [asynccnt - 1] = w; |
2918 | asyncs [asynccnt - 1] = w; |
|
|
2919 | |
|
|
2920 | EV_FREQUENT_CHECK; |
2648 | } |
2921 | } |
2649 | |
2922 | |
2650 | void |
2923 | void |
2651 | ev_async_stop (EV_P_ ev_async *w) |
2924 | ev_async_stop (EV_P_ ev_async *w) |
2652 | { |
2925 | { |
2653 | clear_pending (EV_A_ (W)w); |
2926 | clear_pending (EV_A_ (W)w); |
2654 | if (expect_false (!ev_is_active (w))) |
2927 | if (expect_false (!ev_is_active (w))) |
2655 | return; |
2928 | return; |
2656 | |
2929 | |
|
|
2930 | EV_FREQUENT_CHECK; |
|
|
2931 | |
2657 | { |
2932 | { |
2658 | int active = ev_active (w); |
2933 | int active = ev_active (w); |
2659 | |
2934 | |
2660 | asyncs [active - 1] = asyncs [--asynccnt]; |
2935 | asyncs [active - 1] = asyncs [--asynccnt]; |
2661 | ev_active (asyncs [active - 1]) = active; |
2936 | ev_active (asyncs [active - 1]) = active; |
2662 | } |
2937 | } |
2663 | |
2938 | |
2664 | ev_stop (EV_A_ (W)w); |
2939 | ev_stop (EV_A_ (W)w); |
|
|
2940 | |
|
|
2941 | EV_FREQUENT_CHECK; |
2665 | } |
2942 | } |
2666 | |
2943 | |
2667 | void |
2944 | void |
2668 | ev_async_send (EV_P_ ev_async *w) |
2945 | ev_async_send (EV_P_ ev_async *w) |
2669 | { |
2946 | { |