… | |
… | |
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 | |
773 | #define DHEAP 4 |
805 | #define DHEAP 4 |
774 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
806 | #define HEAP0 (DHEAP - 1) /* index of first element in heap */ |
775 | |
807 | |
776 | /* towards the root */ |
808 | /* towards the root */ |
777 | void inline_speed |
809 | void inline_speed |
778 | upheap (WT *heap, int k) |
810 | upheap (ANHE *heap, int k) |
779 | { |
811 | { |
780 | WT w = heap [k]; |
812 | ANHE he = heap [k]; |
781 | |
813 | |
782 | for (;;) |
814 | for (;;) |
783 | { |
815 | { |
784 | int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0; |
816 | int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0; |
785 | |
817 | |
786 | if (p >= HEAP0 || heap [p]->at <= w->at) |
818 | if (p == k || ANHE_at (heap [p]) <= ANHE_at (he)) |
787 | break; |
819 | break; |
788 | |
820 | |
789 | heap [k] = heap [p]; |
821 | heap [k] = heap [p]; |
790 | ev_active (heap [k]) = k; |
822 | ev_active (ANHE_w (heap [k])) = k; |
791 | k = p; |
823 | k = p; |
792 | } |
824 | } |
793 | |
825 | |
|
|
826 | ev_active (ANHE_w (he)) = k; |
794 | heap [k] = w; |
827 | heap [k] = he; |
795 | ev_active (heap [k]) = k; |
|
|
796 | } |
828 | } |
797 | |
829 | |
798 | /* away from the root */ |
830 | /* away from the root */ |
799 | void inline_speed |
831 | void inline_speed |
800 | downheap (WT *heap, int N, int k) |
832 | downheap (ANHE *heap, int N, int k) |
801 | { |
833 | { |
802 | WT w = heap [k]; |
834 | ANHE he = heap [k]; |
803 | WT *E = heap + N + HEAP0; |
835 | ANHE *E = heap + N + HEAP0; |
804 | |
836 | |
805 | for (;;) |
837 | for (;;) |
806 | { |
838 | { |
807 | ev_tstamp minat; |
839 | ev_tstamp minat; |
808 | WT *minpos; |
840 | ANHE *minpos; |
809 | WT *pos = heap + DHEAP * (k - HEAP0) + HEAP0; |
841 | ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0; |
810 | |
842 | |
811 | // find minimum child |
843 | // find minimum child |
812 | if (expect_true (pos + DHEAP - 1 < E)) |
844 | if (expect_true (pos + DHEAP - 1 < E)) |
813 | { |
845 | { |
814 | /* fast path */ |
|
|
815 | (minpos = pos + 0), (minat = (*minpos)->at); |
846 | /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
816 | if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
847 | if (ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
817 | if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
848 | if (ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
818 | if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
849 | if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
|
|
850 | } |
|
|
851 | else if (pos < E) |
|
|
852 | { |
|
|
853 | /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); |
|
|
854 | if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); |
|
|
855 | if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); |
|
|
856 | if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); |
819 | } |
857 | } |
820 | else |
858 | else |
821 | { |
|
|
822 | /* slow path */ |
|
|
823 | if (pos >= E) |
|
|
824 | break; |
|
|
825 | (minpos = pos + 0), (minat = (*minpos)->at); |
|
|
826 | if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); |
|
|
827 | if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); |
|
|
828 | if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); |
|
|
829 | } |
|
|
830 | |
|
|
831 | if (w->at <= minat) |
|
|
832 | break; |
859 | break; |
833 | |
860 | |
|
|
861 | if (ANHE_at (he) <= minat) |
|
|
862 | break; |
|
|
863 | |
834 | ev_active (*minpos) = k; |
864 | ev_active (ANHE_w (*minpos)) = k; |
835 | heap [k] = *minpos; |
865 | heap [k] = *minpos; |
836 | |
866 | |
837 | k = minpos - heap; |
867 | k = minpos - heap; |
838 | } |
868 | } |
839 | |
869 | |
|
|
870 | ev_active (ANHE_w (he)) = k; |
840 | heap [k] = w; |
871 | heap [k] = he; |
841 | ev_active (heap [k]) = k; |
|
|
842 | } |
872 | } |
843 | |
873 | |
844 | #else // 4HEAP |
874 | #else // 4HEAP |
845 | |
875 | |
846 | #define HEAP0 1 |
876 | #define HEAP0 1 |
847 | |
877 | |
848 | /* towards the root */ |
878 | /* towards the root */ |
849 | void inline_speed |
879 | void inline_speed |
850 | upheap (WT *heap, int k) |
880 | upheap (ANHE *heap, int k) |
851 | { |
881 | { |
852 | WT w = heap [k]; |
882 | ANHE he = heap [k]; |
853 | |
883 | |
854 | for (;;) |
884 | for (;;) |
855 | { |
885 | { |
856 | int p = k >> 1; |
886 | int p = k >> 1; |
857 | |
887 | |
858 | /* maybe we could use a dummy element at heap [0]? */ |
888 | /* maybe we could use a dummy element at heap [0]? */ |
859 | if (!p || heap [p]->at <= w->at) |
889 | if (!p || ANHE_at (heap [p]) <= ANHE_at (he)) |
860 | break; |
890 | break; |
861 | |
891 | |
862 | heap [k] = heap [p]; |
892 | heap [k] = heap [p]; |
863 | ev_active (heap [k]) = k; |
893 | ev_active (ANHE_w (heap [k])) = k; |
864 | k = p; |
894 | k = p; |
865 | } |
895 | } |
866 | |
896 | |
867 | heap [k] = w; |
897 | heap [k] = he; |
868 | ev_active (heap [k]) = k; |
898 | ev_active (ANHE_w (heap [k])) = k; |
869 | } |
899 | } |
870 | |
900 | |
871 | /* away from the root */ |
901 | /* away from the root */ |
872 | void inline_speed |
902 | void inline_speed |
873 | downheap (WT *heap, int N, int k) |
903 | downheap (ANHE *heap, int N, int k) |
874 | { |
904 | { |
875 | WT w = heap [k]; |
905 | ANHE he = heap [k]; |
876 | |
906 | |
877 | for (;;) |
907 | for (;;) |
878 | { |
908 | { |
879 | int c = k << 1; |
909 | int c = k << 1; |
880 | |
910 | |
881 | if (c > N) |
911 | if (c > N) |
882 | break; |
912 | break; |
883 | |
913 | |
884 | c += c + 1 < N && heap [c]->at > heap [c + 1]->at |
914 | c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) |
885 | ? 1 : 0; |
915 | ? 1 : 0; |
886 | |
916 | |
887 | if (w->at <= heap [c]->at) |
917 | if (ANHE_at (he) <= ANHE_at (heap [c])) |
888 | break; |
918 | break; |
889 | |
919 | |
890 | heap [k] = heap [c]; |
920 | heap [k] = heap [c]; |
891 | ((W)heap [k])->active = k; |
921 | ev_active (ANHE_w (heap [k])) = k; |
892 | |
922 | |
893 | k = c; |
923 | k = c; |
894 | } |
924 | } |
895 | |
925 | |
896 | heap [k] = w; |
926 | heap [k] = he; |
897 | ev_active (heap [k]) = k; |
927 | ev_active (ANHE_w (he)) = k; |
898 | } |
928 | } |
899 | #endif |
929 | #endif |
900 | |
930 | |
901 | void inline_size |
931 | void inline_size |
902 | adjustheap (WT *heap, int N, int k) |
932 | adjustheap (ANHE *heap, int N, int k) |
903 | { |
933 | { |
904 | upheap (heap, k); |
934 | upheap (heap, k); |
905 | downheap (heap, N, k); |
935 | downheap (heap, N, k); |
906 | } |
936 | } |
907 | |
937 | |
… | |
… | |
1571 | #endif |
1601 | #endif |
1572 | |
1602 | |
1573 | void inline_size |
1603 | void inline_size |
1574 | timers_reify (EV_P) |
1604 | timers_reify (EV_P) |
1575 | { |
1605 | { |
1576 | while (timercnt && ev_at (timers [HEAP0]) <= mn_now) |
1606 | while (timercnt && ANHE_at (timers [HEAP0]) < mn_now) |
1577 | { |
1607 | { |
1578 | ev_timer *w = (ev_timer *)timers [HEAP0]; |
1608 | ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); |
1579 | |
1609 | |
1580 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1610 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1581 | |
1611 | |
1582 | /* first reschedule or stop timer */ |
1612 | /* first reschedule or stop timer */ |
1583 | if (w->repeat) |
1613 | if (w->repeat) |
1584 | { |
1614 | { |
1585 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1586 | |
|
|
1587 | ev_at (w) += w->repeat; |
1615 | ev_at (w) += w->repeat; |
1588 | if (ev_at (w) < mn_now) |
1616 | if (ev_at (w) < mn_now) |
1589 | ev_at (w) = mn_now; |
1617 | ev_at (w) = mn_now; |
1590 | |
1618 | |
|
|
1619 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
|
|
1620 | |
|
|
1621 | ANHE_at_set (timers [HEAP0]); |
1591 | downheap (timers, timercnt, HEAP0); |
1622 | downheap (timers, timercnt, HEAP0); |
1592 | } |
1623 | } |
1593 | else |
1624 | else |
1594 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1625 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1595 | |
1626 | |
… | |
… | |
1599 | |
1630 | |
1600 | #if EV_PERIODIC_ENABLE |
1631 | #if EV_PERIODIC_ENABLE |
1601 | void inline_size |
1632 | void inline_size |
1602 | periodics_reify (EV_P) |
1633 | periodics_reify (EV_P) |
1603 | { |
1634 | { |
1604 | while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) |
1635 | while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now) |
1605 | { |
1636 | { |
1606 | ev_periodic *w = (ev_periodic *)periodics [HEAP0]; |
1637 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); |
1607 | |
1638 | |
1608 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1639 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1609 | |
1640 | |
1610 | /* first reschedule or stop timer */ |
1641 | /* first reschedule or stop timer */ |
1611 | if (w->reschedule_cb) |
1642 | if (w->reschedule_cb) |
1612 | { |
1643 | { |
1613 | ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); |
1644 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
|
|
1645 | |
1614 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); |
1646 | assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now)); |
|
|
1647 | |
|
|
1648 | ANHE_at_set (periodics [HEAP0]); |
1615 | downheap (periodics, periodiccnt, 1); |
1649 | downheap (periodics, periodiccnt, HEAP0); |
1616 | } |
1650 | } |
1617 | else if (w->interval) |
1651 | else if (w->interval) |
1618 | { |
1652 | { |
1619 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1653 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1620 | if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; |
1654 | if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; |
|
|
1655 | |
1621 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now)); |
1656 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) >= ev_rt_now)); |
|
|
1657 | |
|
|
1658 | ANHE_at_set (periodics [HEAP0]); |
1622 | downheap (periodics, periodiccnt, HEAP0); |
1659 | downheap (periodics, periodiccnt, HEAP0); |
1623 | } |
1660 | } |
1624 | else |
1661 | else |
1625 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1662 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1626 | |
1663 | |
… | |
… | |
1632 | periodics_reschedule (EV_P) |
1669 | periodics_reschedule (EV_P) |
1633 | { |
1670 | { |
1634 | int i; |
1671 | int i; |
1635 | |
1672 | |
1636 | /* adjust periodics after time jump */ |
1673 | /* adjust periodics after time jump */ |
1637 | for (i = 1; i <= periodiccnt; ++i) |
1674 | for (i = HEAP0; i < periodiccnt + HEAP0; ++i) |
1638 | { |
1675 | { |
1639 | ev_periodic *w = (ev_periodic *)periodics [i]; |
1676 | ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]); |
1640 | |
1677 | |
1641 | if (w->reschedule_cb) |
1678 | if (w->reschedule_cb) |
1642 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1679 | ev_at (w) = w->reschedule_cb (w, ev_rt_now); |
1643 | else if (w->interval) |
1680 | else if (w->interval) |
1644 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1681 | ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
1645 | } |
|
|
1646 | |
1682 | |
1647 | /* now rebuild the heap */ |
1683 | ANHE_at_set (periodics [i]); |
1648 | for (i = periodiccnt >> 1; --i; ) |
1684 | } |
|
|
1685 | |
|
|
1686 | /* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */ |
|
|
1687 | /* also, this is easy and corretc for both 2-heaps and 4-heaps */ |
|
|
1688 | for (i = 0; i < periodiccnt; ++i) |
1649 | downheap (periodics, periodiccnt, i + HEAP0); |
1689 | upheap (periodics, i + HEAP0); |
1650 | } |
1690 | } |
1651 | #endif |
1691 | #endif |
1652 | |
1692 | |
1653 | void inline_speed |
1693 | void inline_speed |
1654 | time_update (EV_P_ ev_tstamp max_block) |
1694 | time_update (EV_P_ ev_tstamp max_block) |
… | |
… | |
1708 | { |
1748 | { |
1709 | #if EV_PERIODIC_ENABLE |
1749 | #if EV_PERIODIC_ENABLE |
1710 | periodics_reschedule (EV_A); |
1750 | periodics_reschedule (EV_A); |
1711 | #endif |
1751 | #endif |
1712 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1752 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1713 | for (i = 1; i <= timercnt; ++i) |
1753 | for (i = 0; i < timercnt; ++i) |
1714 | ev_at (timers [i]) += ev_rt_now - mn_now; |
1754 | { |
|
|
1755 | ANHE *he = timers + i + HEAP0; |
|
|
1756 | ANHE_w (*he)->at += ev_rt_now - mn_now; |
|
|
1757 | ANHE_at_set (*he); |
|
|
1758 | } |
1715 | } |
1759 | } |
1716 | |
1760 | |
1717 | mn_now = ev_rt_now; |
1761 | mn_now = ev_rt_now; |
1718 | } |
1762 | } |
1719 | } |
1763 | } |
… | |
… | |
1789 | |
1833 | |
1790 | waittime = MAX_BLOCKTIME; |
1834 | waittime = MAX_BLOCKTIME; |
1791 | |
1835 | |
1792 | if (timercnt) |
1836 | if (timercnt) |
1793 | { |
1837 | { |
1794 | ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; |
1838 | ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge; |
1795 | if (waittime > to) waittime = to; |
1839 | if (waittime > to) waittime = to; |
1796 | } |
1840 | } |
1797 | |
1841 | |
1798 | #if EV_PERIODIC_ENABLE |
1842 | #if EV_PERIODIC_ENABLE |
1799 | if (periodiccnt) |
1843 | if (periodiccnt) |
1800 | { |
1844 | { |
1801 | ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1845 | ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; |
1802 | if (waittime > to) waittime = to; |
1846 | if (waittime > to) waittime = to; |
1803 | } |
1847 | } |
1804 | #endif |
1848 | #endif |
1805 | |
1849 | |
1806 | if (expect_false (waittime < timeout_blocktime)) |
1850 | if (expect_false (waittime < timeout_blocktime)) |
… | |
… | |
1958 | { |
2002 | { |
1959 | clear_pending (EV_A_ (W)w); |
2003 | clear_pending (EV_A_ (W)w); |
1960 | if (expect_false (!ev_is_active (w))) |
2004 | if (expect_false (!ev_is_active (w))) |
1961 | return; |
2005 | return; |
1962 | |
2006 | |
1963 | assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
2007 | assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1964 | |
2008 | |
1965 | wlist_del (&anfds[w->fd].head, (WL)w); |
2009 | wlist_del (&anfds[w->fd].head, (WL)w); |
1966 | ev_stop (EV_A_ (W)w); |
2010 | ev_stop (EV_A_ (W)w); |
1967 | |
2011 | |
1968 | fd_change (EV_A_ w->fd, 1); |
2012 | fd_change (EV_A_ w->fd, 1); |
… | |
… | |
1977 | ev_at (w) += mn_now; |
2021 | ev_at (w) += mn_now; |
1978 | |
2022 | |
1979 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
2023 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1980 | |
2024 | |
1981 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
2025 | ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); |
1982 | array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); |
2026 | array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); |
1983 | timers [ev_active (w)] = (WT)w; |
2027 | ANHE_w (timers [ev_active (w)]) = (WT)w; |
|
|
2028 | ANHE_at_set (timers [ev_active (w)]); |
1984 | upheap (timers, ev_active (w)); |
2029 | upheap (timers, ev_active (w)); |
1985 | |
2030 | |
1986 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ |
2031 | /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ |
1987 | } |
2032 | } |
1988 | |
2033 | |
1989 | void noinline |
2034 | void noinline |
1990 | ev_timer_stop (EV_P_ ev_timer *w) |
2035 | ev_timer_stop (EV_P_ ev_timer *w) |
1991 | { |
2036 | { |
… | |
… | |
1994 | return; |
2039 | return; |
1995 | |
2040 | |
1996 | { |
2041 | { |
1997 | int active = ev_active (w); |
2042 | int active = ev_active (w); |
1998 | |
2043 | |
1999 | assert (("internal timer heap corruption", timers [active] == (WT)w)); |
2044 | assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); |
2000 | |
2045 | |
2001 | if (expect_true (active < timercnt + HEAP0 - 1)) |
2046 | if (expect_true (active < timercnt + HEAP0 - 1)) |
2002 | { |
2047 | { |
2003 | timers [active] = timers [timercnt + HEAP0 - 1]; |
2048 | timers [active] = timers [timercnt + HEAP0 - 1]; |
2004 | adjustheap (timers, timercnt, active); |
2049 | adjustheap (timers, timercnt, active); |
… | |
… | |
2018 | if (ev_is_active (w)) |
2063 | if (ev_is_active (w)) |
2019 | { |
2064 | { |
2020 | if (w->repeat) |
2065 | if (w->repeat) |
2021 | { |
2066 | { |
2022 | ev_at (w) = mn_now + w->repeat; |
2067 | ev_at (w) = mn_now + w->repeat; |
|
|
2068 | ANHE_at_set (timers [ev_active (w)]); |
2023 | adjustheap (timers, timercnt, ev_active (w)); |
2069 | adjustheap (timers, timercnt, ev_active (w)); |
2024 | } |
2070 | } |
2025 | else |
2071 | else |
2026 | ev_timer_stop (EV_A_ w); |
2072 | ev_timer_stop (EV_A_ w); |
2027 | } |
2073 | } |
… | |
… | |
2049 | } |
2095 | } |
2050 | else |
2096 | else |
2051 | ev_at (w) = w->offset; |
2097 | ev_at (w) = w->offset; |
2052 | |
2098 | |
2053 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
2099 | ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); |
2054 | array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); |
2100 | array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); |
2055 | periodics [ev_active (w)] = (WT)w; |
2101 | ANHE_w (periodics [ev_active (w)]) = (WT)w; |
|
|
2102 | ANHE_at_set (periodics [ev_active (w)]); |
2056 | upheap (periodics, ev_active (w)); |
2103 | upheap (periodics, ev_active (w)); |
2057 | |
2104 | |
2058 | /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ |
2105 | /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ |
2059 | } |
2106 | } |
2060 | |
2107 | |
2061 | void noinline |
2108 | void noinline |
2062 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2109 | ev_periodic_stop (EV_P_ ev_periodic *w) |
2063 | { |
2110 | { |
… | |
… | |
2066 | return; |
2113 | return; |
2067 | |
2114 | |
2068 | { |
2115 | { |
2069 | int active = ev_active (w); |
2116 | int active = ev_active (w); |
2070 | |
2117 | |
2071 | assert (("internal periodic heap corruption", periodics [active] == (WT)w)); |
2118 | assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); |
2072 | |
2119 | |
2073 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
2120 | if (expect_true (active < periodiccnt + HEAP0 - 1)) |
2074 | { |
2121 | { |
2075 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
2122 | periodics [active] = periodics [periodiccnt + HEAP0 - 1]; |
2076 | adjustheap (periodics, periodiccnt, active); |
2123 | adjustheap (periodics, periodiccnt, active); |