… | |
… | |
235 | # else |
235 | # else |
236 | # define EV_USE_EVENTFD 0 |
236 | # define EV_USE_EVENTFD 0 |
237 | # endif |
237 | # endif |
238 | #endif |
238 | #endif |
239 | |
239 | |
|
|
240 | #ifndef EV_USE_4HEAP |
|
|
241 | # define EV_USE_4HEAP !EV_MINIMAL |
|
|
242 | #endif |
|
|
243 | |
|
|
244 | #ifndef EV_HEAP_CACHE_AT |
|
|
245 | # define EV_HEAP_CACHE_AT !EV_MINIMAL |
|
|
246 | #endif |
|
|
247 | |
240 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
248 | /* this block fixes any misconfiguration where we know we run into trouble otherwise */ |
241 | |
249 | |
242 | #ifndef CLOCK_MONOTONIC |
250 | #ifndef CLOCK_MONOTONIC |
243 | # undef EV_USE_MONOTONIC |
251 | # undef EV_USE_MONOTONIC |
244 | # define EV_USE_MONOTONIC 0 |
252 | # define EV_USE_MONOTONIC 0 |
… | |
… | |
422 | W w; |
430 | W w; |
423 | int events; |
431 | int events; |
424 | } ANPENDING; |
432 | } ANPENDING; |
425 | |
433 | |
426 | #if EV_USE_INOTIFY |
434 | #if EV_USE_INOTIFY |
|
|
435 | /* hash table entry per inotify-id */ |
427 | typedef struct |
436 | typedef struct |
428 | { |
437 | { |
429 | WL head; |
438 | WL head; |
430 | } ANFS; |
439 | } ANFS; |
|
|
440 | #endif |
|
|
441 | |
|
|
442 | /* Heap Entry */ |
|
|
443 | #if EV_HEAP_CACHE_AT |
|
|
444 | typedef struct { |
|
|
445 | ev_tstamp at; |
|
|
446 | WT w; |
|
|
447 | } ANHE; |
|
|
448 | |
|
|
449 | #define ANHE_w(he) (he).w /* access watcher, read-write */ |
|
|
450 | #define ANHE_at(he) (he).at /* access cached at, read-only */ |
|
|
451 | #define ANHE_at_set(he) (he).at = (he).w->at /* update at from watcher */ |
|
|
452 | #else |
|
|
453 | typedef WT ANHE; |
|
|
454 | |
|
|
455 | #define ANHE_w(he) (he) |
|
|
456 | #define ANHE_at(he) (he)->at |
|
|
457 | #define ANHE_at_set(he) |
431 | #endif |
458 | #endif |
432 | |
459 | |
433 | #if EV_MULTIPLICITY |
460 | #if EV_MULTIPLICITY |
434 | |
461 | |
435 | struct ev_loop |
462 | struct ev_loop |
… | |
… | |
760 | } |
787 | } |
761 | |
788 | |
762 | /*****************************************************************************/ |
789 | /*****************************************************************************/ |
763 | |
790 | |
764 | /* |
791 | /* |
|
|
792 | * the heap functions want a real array index. array index 0 uis guaranteed to not |
|
|
793 | * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives |
|
|
794 | * the branching factor of the d-tree. |
|
|
795 | */ |
|
|
796 | |
|
|
797 | /* |
765 | * at the moment we allow libev the luxury of two heaps, |
798 | * 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 |
799 | * a small-code-size 2-heap one and a ~1.5kb larger 4-heap |
767 | * which is more cache-efficient. |
800 | * which is more cache-efficient. |
768 | * the difference is about 5% with 50000+ watchers. |
801 | * the difference is about 5% with 50000+ watchers. |
769 | */ |
802 | */ |
770 | #define USE_4HEAP !EV_MINIMAL |
|
|
771 | #if USE_4HEAP |
803 | #if EV_USE_4HEAP |
772 | |
804 | |
|
|
805 | #define DHEAP 4 |
773 | #define HEAP0 3 /* index of first element in heap */ |
806 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
|
|
807 | #define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0) |
774 | |
808 | |
775 | /* towards the root */ |
809 | /* towards the root */ |
776 | void inline_speed |
810 | void inline_speed |
777 | upheap (WT *heap, int k) |
811 | upheap (ANHE *heap, int k) |
778 | { |
812 | { |
779 | WT w = heap [k]; |
813 | ANHE he = heap [k]; |
780 | |
814 | |
781 | for (;;) |
815 | for (;;) |
782 | { |
816 | { |
783 | int p = ((k - HEAP0 - 1) / 4) + HEAP0; |
817 | int p = HPARENT (k); |
784 | |
818 | |
785 | if (p >= HEAP0 || heap [p]->at <= w->at) |
819 | if (p == k || ANHE_at (heap [p]) <= ANHE_at (he)) |
786 | break; |
820 | break; |
787 | |
821 | |
788 | heap [k] = heap [p]; |
822 | heap [k] = heap [p]; |
789 | ev_active (heap [k]) = k; |
823 | ev_active (ANHE_w (heap [k])) = k; |
790 | k = p; |
824 | k = p; |
791 | } |
825 | } |
792 | |
826 | |
793 | heap [k] = w; |
827 | heap [k] = he; |
794 | ev_active (heap [k]) = k; |
828 | ev_active (ANHE_w (he)) = k; |
795 | } |
829 | } |
796 | |
830 | |
797 | /* away from the root */ |
831 | /* away from the root */ |
798 | void inline_speed |
832 | void inline_speed |
799 | downheap (WT *heap, int N, int k) |
833 | downheap (ANHE *heap, int N, int k) |
800 | { |
834 | { |
801 | WT w = heap [k]; |
835 | ANHE he = heap [k]; |
802 | WT *E = heap + N + HEAP0; |
836 | ANHE *E = heap + N + HEAP0; |
803 | |
837 | |
804 | for (;;) |
838 | for (;;) |
805 | { |
839 | { |
806 | ev_tstamp minat; |
840 | ev_tstamp minat; |
807 | WT *minpos; |
841 | ANHE *minpos; |
808 | WT *pos = heap + 4 * (k - HEAP0) + HEAP0; |
842 | ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0; |
809 | |
843 | |
810 | // find minimum child |
844 | // find minimum child |
811 | if (expect_true (pos +3 < E)) |
845 | if (expect_true (pos + DHEAP - 1 < E)) |
812 | { |
846 | { |
813 | /* fast path */ |
|
|
814 | (minpos = pos + 0), (minat = (*minpos)->at); |
847 | /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
815 | if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
848 | if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
816 | if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
849 | if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
817 | if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
850 | if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
851 | } |
|
|
852 | else if (pos < E) |
|
|
853 | { |
|
|
854 | /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
855 | if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
856 | if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
857 | if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
818 | } |
858 | } |
819 | else |
859 | else |
820 | { |
|
|
821 | /* slow path */ |
|
|
822 | if (pos >= E) |
|
|
823 | break; |
|
|
824 | (minpos = pos + 0), (minat = (*minpos)->at); |
|
|
825 | if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
|
|
826 | if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
|
|
827 | if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
|
|
828 | } |
|
|
829 | |
|
|
830 | if (w->at <= minat) |
|
|
831 | break; |
860 | break; |
832 | |
861 | |
833 | ev_active (*minpos) = k; |
862 | if (ANHE_at (he) <= minat) |
|
|
863 | break; |
|
|
864 | |
834 | heap [k] = *minpos; |
865 | heap [k] = *minpos; |
|
|
866 | ev_active (ANHE_w (*minpos)) = k; |
835 | |
867 | |
836 | k = minpos - heap; |
868 | k = minpos - heap; |
837 | } |
869 | } |
838 | |
870 | |
839 | heap [k] = w; |
871 | heap [k] = he; |
840 | ev_active (heap [k]) = k; |
872 | ev_active (ANHE_w (he)) = k; |
841 | } |
873 | } |
842 | |
874 | |
843 | #else // 4HEAP |
875 | #else // 4HEAP |
844 | |
876 | |
845 | #define HEAP0 1 |
877 | #define HEAP0 1 |
|
|
878 | #define HPARENT(k) ((k) >> 1) |
846 | |
879 | |
847 | /* towards the root */ |
880 | /* towards the root */ |
848 | void inline_speed |
881 | void inline_speed |
849 | upheap (WT *heap, int k) |
882 | upheap (ANHE *heap, int k) |
850 | { |
883 | { |
851 | WT w = heap [k]; |
884 | ANHE he = heap [k]; |
852 | |
885 | |
853 | for (;;) |
886 | for (;;) |
854 | { |
887 | { |
855 | int p = k >> 1; |
888 | int p = HPARENT (k); |
856 | |
889 | |
857 | /* maybe we could use a dummy element at heap [0]? */ |
890 | /* maybe we could use a dummy element at heap [0]? */ |
858 | if (!p || heap [p]->at <= w->at) |
891 | if (!p || ANHE_at (heap [p]) <= ANHE_at (he)) |
859 | break; |
892 | break; |
860 | |
893 | |
861 | heap [k] = heap [p]; |
894 | heap [k] = heap [p]; |
862 | ev_active (heap [k]) = k; |
895 | ev_active (ANHE_w (heap [k])) = k; |
863 | k = p; |
896 | k = p; |
864 | } |
897 | } |
865 | |
898 | |
866 | heap [k] = w; |
899 | heap [k] = he; |
867 | ev_active (heap [k]) = k; |
900 | ev_active (ANHE_w (heap [k])) = k; |
868 | } |
901 | } |
869 | |
902 | |
870 | /* away from the root */ |
903 | /* away from the root */ |
871 | void inline_speed |
904 | void inline_speed |
872 | downheap (WT *heap, int N, int k) |
905 | downheap (ANHE *heap, int N, int k) |
873 | { |
906 | { |
874 | WT w = heap [k]; |
907 | ANHE he = heap [k]; |
875 | |
908 | |
876 | for (;;) |
909 | for (;;) |
877 | { |
910 | { |
878 | int c = k << 1; |
911 | int c = k << 1; |
879 | |
912 | |
880 | if (c > N) |
913 | if (c > N) |
881 | break; |
914 | break; |
882 | |
915 | |
883 | c += c + 1 < N && heap [c]->at > heap [c + 1]->at |
916 | c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) |
884 | ? 1 : 0; |
917 | ? 1 : 0; |
885 | |
918 | |
886 | if (w->at <= heap [c]->at) |
919 | if (ANHE_at (he) <= ANHE_at (heap [c])) |
887 | break; |
920 | break; |
888 | |
921 | |
889 | heap [k] = heap [c]; |
922 | heap [k] = heap [c]; |
890 | ((W)heap [k])->active = k; |
923 | ev_active (ANHE_w (heap [k])) = k; |
891 | |
924 | |
892 | k = c; |
925 | k = c; |
893 | } |
926 | } |
894 | |
927 | |
895 | heap [k] = w; |
928 | heap [k] = he; |
896 | ev_active (heap [k]) = k; |
929 | ev_active (ANHE_w (he)) = k; |
897 | } |
930 | } |
898 | #endif |
931 | #endif |
899 | |
932 | |
900 | void inline_size |
933 | void inline_size |
901 | adjustheap (WT *heap, int N, int k) |
934 | adjustheap (ANHE *heap, int N, int k) |
902 | { |
935 | { |
|
|
936 | if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k])) |
903 | upheap (heap, k); |
937 | upheap (heap, k); |
|
|
938 | else |
904 | downheap (heap, N, k); |
939 | downheap (heap, N, k); |
905 | } |
940 | } |
906 | |
941 | |
907 | /*****************************************************************************/ |
942 | /*****************************************************************************/ |
908 | |
943 | |
909 | typedef struct |
944 | typedef struct |
… | |
… | |
1570 | #endif |
1605 | #endif |
1571 | |
1606 | |
1572 | void inline_size |
1607 | void inline_size |
1573 | timers_reify (EV_P) |
1608 | timers_reify (EV_P) |
1574 | { |
1609 | { |
1575 | while (timercnt && ev_at (timers [HEAP0]) <= mn_now) |
1610 | while (timercnt && ANHE_at (timers [HEAP0]) < mn_now) |
1576 | { |
1611 | { |
1577 | ev_timer *w = (ev_timer *)timers [HEAP0]; |
1612 | ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); |
1578 | |
1613 | |
1579 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1614 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1580 | |
1615 | |
1581 | /* first reschedule or stop timer */ |
1616 | /* first reschedule or stop timer */ |
1582 | if (w->repeat) |
1617 | if (w->repeat) |
1583 | { |
1618 | { |
1584 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1585 | |
|
|
1586 | ev_at (w) += w->repeat; |
1619 | ev_at (w) += w->repeat; |
1587 | if (ev_at (w) < mn_now) |
1620 | if (ev_at (w) < mn_now) |
1588 | ev_at (w) = mn_now; |
1621 | ev_at (w) = mn_now; |
1589 | |
1622 | |
|
|
1623 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1624 | |
|
|
1625 | ANHE_at_set (timers [HEAP0]); |
1590 | downheap (timers, timercnt, HEAP0); |
1626 | downheap (timers, timercnt, HEAP0); |
1591 | } |
1627 | } |
1592 | else |
1628 | else |
1593 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1629 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1594 | |
1630 | |
… | |
… | |
1598 | |
1634 | |
1599 | #if EV_PERIODIC_ENABLE |
1635 | #if EV_PERIODIC_ENABLE |
1600 | void inline_size |
1636 | void inline_size |
1601 | periodics_reify (EV_P) |
1637 | periodics_reify (EV_P) |
1602 | { |
1638 | { |
1603 | while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) |
1639 | while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now) |
1604 | { |
1640 | { |
1605 | ev_periodic *w = (ev_periodic *)periodics [HEAP0]; |
1641 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); |
1606 | |
1642 | |
1607 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1643 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1608 | |
1644 | |
1609 | /* first reschedule or stop timer */ |
1645 | /* first reschedule or stop timer */ |
1610 | if (w->reschedule_cb) |
1646 | if (w->reschedule_cb) |
1611 | { |
1647 | { |
1612 | ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); |
1648 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
|
|
1649 | |
1613 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); |
1650 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now)); |
|
|
1651 | |
|
|
1652 | ANHE_at_set (periodics [HEAP0]); |
1614 | downheap (periodics, periodiccnt, 1); |
1653 | downheap (periodics, periodiccnt, HEAP0); |
1615 | } |
1654 | } |
1616 | else if (w->interval) |
1655 | else if (w->interval) |
1617 | { |
1656 | { |
1618 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1657 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1658 | /* if next trigger time is not sufficiently in the future, put it there */ |
|
|
1659 | /* this might happen because of floating point inexactness */ |
1619 | if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; |
1660 | if (ev_at (w) - ev_rt_now < TIME_EPSILON) |
1620 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now)); |
1661 | { |
|
|
1662 | ev_at (w) += w->interval; |
|
|
1663 | |
|
|
1664 | /* if interval is unreasonably low we might still have a time in the past */ |
|
|
1665 | /* so correct this. this will make the periodic very inexact, but the user */ |
|
|
1666 | /* has effectively asked to get triggered more often than possible */ |
|
|
1667 | if (ev_at (w) < ev_rt_now) |
|
|
1668 | ev_at (w) = ev_rt_now; |
|
|
1669 | } |
|
|
1670 | |
|
|
1671 | ANHE_at_set (periodics [HEAP0]); |
1621 | downheap (periodics, periodiccnt, HEAP0); |
1672 | downheap (periodics, periodiccnt, HEAP0); |
1622 | } |
1673 | } |
1623 | else |
1674 | else |
1624 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1675 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1625 | |
1676 | |
… | |
… | |
1631 | periodics_reschedule (EV_P) |
1682 | periodics_reschedule (EV_P) |
1632 | { |
1683 | { |
1633 | int i; |
1684 | int i; |
1634 | |
1685 | |
1635 | /* adjust periodics after time jump */ |
1686 | /* adjust periodics after time jump */ |
1636 | for (i = 1; i <= periodiccnt; ++i) |
1687 | for (i = HEAP0; i < periodiccnt + HEAP0; ++i) |
1637 | { |
1688 | { |
1638 | ev_periodic *w = (ev_periodic *)periodics [i]; |
1689 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]); |
1639 | |
1690 | |
1640 | if (w->reschedule_cb) |
1691 | if (w->reschedule_cb) |
1641 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1692 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1642 | else if (w->interval) |
1693 | else if (w->interval) |
1643 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1694 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1644 | } |
|
|
1645 | |
1695 | |
1646 | /* now rebuild the heap */ |
1696 | ANHE_at_set (periodics [i]); |
1647 | for (i = periodiccnt >> 1; --i; ) |
1697 | } |
|
|
1698 | |
|
|
1699 | /* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */ |
|
|
1700 | /* also, this is easy and corretc for both 2-heaps and 4-heaps */ |
|
|
1701 | for (i = 0; i < periodiccnt; ++i) |
1648 | downheap (periodics, periodiccnt, i + HEAP0); |
1702 | upheap (periodics, i + HEAP0); |
1649 | } |
1703 | } |
1650 | #endif |
1704 | #endif |
1651 | |
1705 | |
1652 | void inline_speed |
1706 | void inline_speed |
1653 | time_update (EV_P_ ev_tstamp max_block) |
1707 | time_update (EV_P_ ev_tstamp max_block) |
… | |
… | |
1707 | { |
1761 | { |
1708 | #if EV_PERIODIC_ENABLE |
1762 | #if EV_PERIODIC_ENABLE |
1709 | periodics_reschedule (EV_A); |
1763 | periodics_reschedule (EV_A); |
1710 | #endif |
1764 | #endif |
1711 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1765 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1712 | for (i = 1; i <= timercnt; ++i) |
1766 | for (i = 0; i < timercnt; ++i) |
1713 | ev_at (timers [i]) += ev_rt_now - mn_now; |
1767 | { |
|
|
1768 | ANHE *he = timers + i + HEAP0; |
|
|
1769 | ANHE_w (*he)->at += ev_rt_now - mn_now; |
|
|
1770 | ANHE_at_set (*he); |
|
|
1771 | } |
1714 | } |
1772 | } |
1715 | |
1773 | |
1716 | mn_now = ev_rt_now; |
1774 | mn_now = ev_rt_now; |
1717 | } |
1775 | } |
1718 | } |
1776 | } |
… | |
… | |
1788 | |
1846 | |
1789 | waittime = MAX_BLOCKTIME; |
1847 | waittime = MAX_BLOCKTIME; |
1790 | |
1848 | |
1791 | if (timercnt) |
1849 | if (timercnt) |
1792 | { |
1850 | { |
1793 | ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; |
1851 | ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge; |
1794 | if (waittime > to) waittime = to; |
1852 | if (waittime > to) waittime = to; |
1795 | } |
1853 | } |
1796 | |
1854 | |
1797 | #if EV_PERIODIC_ENABLE |
1855 | #if EV_PERIODIC_ENABLE |
1798 | if (periodiccnt) |
1856 | if (periodiccnt) |
1799 | { |
1857 | { |
1800 | ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1858 | ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1801 | if (waittime > to) waittime = to; |
1859 | if (waittime > to) waittime = to; |
1802 | } |
1860 | } |
1803 | #endif |
1861 | #endif |
1804 | |
1862 | |
1805 | if (expect_false (waittime < timeout_blocktime)) |
1863 | if (expect_false (waittime < timeout_blocktime)) |
… | |
… | |
1957 | { |
2015 | { |
1958 | clear_pending (EV_A_ (W)w); |
2016 | clear_pending (EV_A_ (W)w); |
1959 | if (expect_false (!ev_is_active (w))) |
2017 | if (expect_false (!ev_is_active (w))) |
1960 | return; |
2018 | return; |
1961 | |
2019 | |
1962 | assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
2020 | assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1963 | |
2021 | |
1964 | wlist_del (&anfds[w->fd].head, (WL)w); |
2022 | wlist_del (&anfds[w->fd].head, (WL)w); |
1965 | ev_stop (EV_A_ (W)w); |
2023 | ev_stop (EV_A_ (W)w); |
1966 | |
2024 | |
1967 | fd_change (EV_A_ w->fd, 1); |
2025 | fd_change (EV_A_ w->fd, 1); |
… | |
… | |
1976 | ev_at (w) += mn_now; |
2034 | ev_at (w) += mn_now; |
1977 | |
2035 | |
1978 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
2036 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1979 | |
2037 | |
1980 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
2038 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
1981 | array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); |
2039 | array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); |
1982 | timers [ev_active (w)] = (WT)w; |
2040 | ANHE_w (timers [ev_active (w)]) = (WT)w; |
|
|
2041 | ANHE_at_set (timers [ev_active (w)]); |
1983 | upheap (timers, ev_active (w)); |
2042 | upheap (timers, ev_active (w)); |
1984 | |
2043 | |
1985 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ |
2044 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ |
1986 | } |
2045 | } |
1987 | |
2046 | |
1988 | void noinline |
2047 | void noinline |
1989 | ev_timer_stop (EV_P_ ev_timer *w) |
2048 | ev_timer_stop (EV_P_ ev_timer *w) |
1990 | { |
2049 | { |
… | |
… | |
1993 | return; |
2052 | return; |
1994 | |
2053 | |
1995 | { |
2054 | { |
1996 | int active = ev_active (w); |
2055 | int active = ev_active (w); |
1997 | |
2056 | |
1998 | assert (("internal timer heap corruption", timers [active] == (WT)w)); |
2057 | assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); |
1999 | |
2058 | |
2000 | if (expect_true (active < timercnt + HEAP0 - 1)) |
2059 | if (expect_true (active < timercnt + HEAP0 - 1)) |
2001 | { |
2060 | { |
2002 | timers [active] = timers [timercnt + HEAP0 - 1]; |
2061 | timers [active] = timers [timercnt + HEAP0 - 1]; |
2003 | adjustheap (timers, timercnt, active); |
2062 | adjustheap (timers, timercnt, active); |
… | |
… | |
2017 | if (ev_is_active (w)) |
2076 | if (ev_is_active (w)) |
2018 | { |
2077 | { |
2019 | if (w->repeat) |
2078 | if (w->repeat) |
2020 | { |
2079 | { |
2021 | ev_at (w) = mn_now + w->repeat; |
2080 | ev_at (w) = mn_now + w->repeat; |
|
|
2081 | ANHE_at_set (timers [ev_active (w)]); |
2022 | adjustheap (timers, timercnt, ev_active (w)); |
2082 | adjustheap (timers, timercnt, ev_active (w)); |
2023 | } |
2083 | } |
2024 | else |
2084 | else |
2025 | ev_timer_stop (EV_A_ w); |
2085 | ev_timer_stop (EV_A_ w); |
2026 | } |
2086 | } |
… | |
… | |
2048 | } |
2108 | } |
2049 | else |
2109 | else |
2050 | ev_at (w) = w->offset; |
2110 | ev_at (w) = w->offset; |
2051 | |
2111 | |
2052 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
2112 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
2053 | array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); |
2113 | array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); |
2054 | periodics [ev_active (w)] = (WT)w; |
2114 | ANHE_w (periodics [ev_active (w)]) = (WT)w; |
|
|
2115 | ANHE_at_set (periodics [ev_active (w)]); |
2055 | upheap (periodics, ev_active (w)); |
2116 | upheap (periodics, ev_active (w)); |
2056 | |
2117 | |
2057 | /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ |
2118 | /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ |
2058 | } |
2119 | } |
2059 | |
2120 | |
2060 | void noinline |
2121 | void noinline |
2061 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2122 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2062 | { |
2123 | { |
… | |
… | |
2065 | return; |
2126 | return; |
2066 | |
2127 | |
2067 | { |
2128 | { |
2068 | int active = ev_active (w); |
2129 | int active = ev_active (w); |
2069 | |
2130 | |
2070 | assert (("internal periodic heap corruption", periodics [active] == (WT)w)); |
2131 | assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); |
2071 | |
2132 | |
2072 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
2133 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
2073 | { |
2134 | { |
2074 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
2135 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
2075 | adjustheap (periodics, periodiccnt, active); |
2136 | adjustheap (periodics, periodiccnt, active); |