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