ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
(Generate patch)

Comparing libev/ev.c (file contents):
Revision 1.236 by root, Wed May 7 14:46:22 2008 UTC vs.
Revision 1.248 by root, Wed May 21 23:25:21 2008 UTC

… …
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
… …
279} 287}
280# endif 288# endif
281#endif 289#endif
282 290
283/**/ 291/**/
292
293/* undefined or zero: no verification done or available */
294/* 1 or higher: ev_loop_verify function available */
295/* 2 or higher: ev_loop_verify is called frequently */
296#define EV_VERIFY 1
297
298#if EV_VERIFY > 1
299# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
300#else
301# define EV_FREQUENT_CHECK do { } while (0)
302#endif
284 303
285/* 304/*
286 * This is used to avoid floating point rounding problems. 305 * This is used to avoid floating point rounding problems.
287 * It is added to ev_rt_now when scheduling periodics 306 * It is added to ev_rt_now when scheduling periodics
288 * to ensure progress, time-wise, even when rounding 307 * to ensure progress, time-wise, even when rounding
… …
422 W w; 441 W w;
423 int events; 442 int events;
424} ANPENDING; 443} ANPENDING;
425 444
426#if EV_USE_INOTIFY 445#if EV_USE_INOTIFY
446/* hash table entry per inotify-id */
427typedef struct 447typedef struct
428{ 448{
429 WL head; 449 WL head;
430} ANFS; 450} ANFS;
451#endif
452
453/* Heap Entry */
454#if EV_HEAP_CACHE_AT
455 typedef struct {
456 ev_tstamp at;
457 WT w;
458 } ANHE;
459
460 #define ANHE_w(he) (he).w /* access watcher, read-write */
461 #define ANHE_at(he) (he).at /* access cached at, read-only */
462 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
463#else
464 typedef WT ANHE;
465
466 #define ANHE_w(he) (he)
467 #define ANHE_at(he) (he)->at
468 #define ANHE_at_cache(he)
431#endif 469#endif
432 470
433#if EV_MULTIPLICITY 471#if EV_MULTIPLICITY
434 472
435 struct ev_loop 473 struct ev_loop
… …
760} 798}
761 799
762/*****************************************************************************/ 800/*****************************************************************************/
763 801
764/* 802/*
803 * the heap functions want a real array index. array index 0 uis guaranteed to not
804 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
805 * the branching factor of the d-tree.
806 */
807
808/*
765 * at the moment we allow libev the luxury of two heaps, 809 * 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 810 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
767 * which is more cache-efficient. 811 * which is more cache-efficient.
768 * the difference is about 5% with 50000+ watchers. 812 * the difference is about 5% with 50000+ watchers.
769 */ 813 */
770#define USE_4HEAP !EV_MINIMAL
771#if USE_4HEAP 814#if EV_USE_4HEAP
772 815
816#define DHEAP 4
773#define HEAP0 3 /* index of first element in heap */ 817#define HEAP0 (DHEAP - 1) /* index of first element in heap */
818#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
819#define UPHEAP_DONE(p,k) ((p) == (k))
820
821/* away from the root */
822void inline_speed
823downheap (ANHE *heap, int N, int k)
824{
825 ANHE he = heap [k];
826 ANHE *E = heap + N + HEAP0;
827
828 for (;;)
829 {
830 ev_tstamp minat;
831 ANHE *minpos;
832 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
833
834 /* find minimum child */
835 if (expect_true (pos + DHEAP - 1 < E))
836 {
837 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
838 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
839 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
840 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
841 }
842 else if (pos < E)
843 {
844 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
845 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
846 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
847 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
848 }
849 else
850 break;
851
852 if (ANHE_at (he) <= minat)
853 break;
854
855 heap [k] = *minpos;
856 ev_active (ANHE_w (*minpos)) = k;
857
858 k = minpos - heap;
859 }
860
861 heap [k] = he;
862 ev_active (ANHE_w (he)) = k;
863}
864
865#else /* 4HEAP */
866
867#define HEAP0 1
868#define HPARENT(k) ((k) >> 1)
869#define UPHEAP_DONE(p,k) (!(p))
870
871/* away from the root */
872void inline_speed
873downheap (ANHE *heap, int N, int k)
874{
875 ANHE he = heap [k];
876
877 for (;;)
878 {
879 int c = k << 1;
880
881 if (c > N + HEAP0 - 1)
882 break;
883
884 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
885 ? 1 : 0;
886
887 if (ANHE_at (he) <= ANHE_at (heap [c]))
888 break;
889
890 heap [k] = heap [c];
891 ev_active (ANHE_w (heap [k])) = k;
892
893 k = c;
894 }
895
896 heap [k] = he;
897 ev_active (ANHE_w (he)) = k;
898}
899#endif
774 900
775/* towards the root */ 901/* towards the root */
776void inline_speed 902void inline_speed
777upheap (WT *heap, int k) 903upheap (ANHE *heap, int k)
778{ 904{
779 WT w = heap [k]; 905 ANHE he = heap [k];
780 906
781 for (;;) 907 for (;;)
782 { 908 {
783 int p = ((k - HEAP0 - 1) / 4) + HEAP0; 909 int p = HPARENT (k);
784 910
785 if (p >= HEAP0 || heap [p]->at <= w->at) 911 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
786 break; 912 break;
787 913
788 heap [k] = heap [p]; 914 heap [k] = heap [p];
789 ev_active (heap [k]) = k; 915 ev_active (ANHE_w (heap [k])) = k;
790 k = p; 916 k = p;
791 } 917 }
792 918
793 heap [k] = w; 919 heap [k] = he;
794 ev_active (heap [k]) = k; 920 ev_active (ANHE_w (he)) = k;
795} 921}
796
797/* away from the root */
798void inline_speed
799downheap (WT *heap, int N, int k)
800{
801 WT w = heap [k];
802 WT *E = heap + N + HEAP0;
803
804 for (;;)
805 {
806 ev_tstamp minat;
807 WT *minpos;
808 WT *pos = heap + 4 * (k - HEAP0) + HEAP0;
809
810 // find minimum child
811 if (expect_true (pos +3 < E))
812 {
813 /* fast path */
814 (minpos = pos + 0), (minat = (*minpos)->at);
815 if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at);
816 if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at);
817 if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at);
818 }
819 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;
832
833 ev_active (*minpos) = k;
834 heap [k] = *minpos;
835
836 k = minpos - heap;
837 }
838
839 heap [k] = w;
840 ev_active (heap [k]) = k;
841}
842
843#else // 4HEAP
844
845#define HEAP0 1
846
847/* towards the root */
848void inline_speed
849upheap (WT *heap, int k)
850{
851 WT w = heap [k];
852
853 for (;;)
854 {
855 int p = k >> 1;
856
857 /* maybe we could use a dummy element at heap [0]? */
858 if (!p || heap [p]->at <= w->at)
859 break;
860
861 heap [k] = heap [p];
862 ev_active (heap [k]) = k;
863 k = p;
864 }
865
866 heap [k] = w;
867 ev_active (heap [k]) = k;
868}
869
870/* away from the root */
871void inline_speed
872downheap (WT *heap, int N, int k)
873{
874 WT w = heap [k];
875
876 for (;;)
877 {
878 int c = k << 1;
879
880 if (c > N)
881 break;
882
883 c += c + 1 < N && heap [c]->at > heap [c + 1]->at
884 ? 1 : 0;
885
886 if (w->at <= heap [c]->at)
887 break;
888
889 heap [k] = heap [c];
890 ((W)heap [k])->active = k;
891
892 k = c;
893 }
894
895 heap [k] = w;
896 ev_active (heap [k]) = k;
897}
898#endif
899 922
900void inline_size 923void inline_size
901adjustheap (WT *heap, int N, int k) 924adjustheap (ANHE *heap, int N, int k)
902{ 925{
926 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
903 upheap (heap, k); 927 upheap (heap, k);
928 else
904 downheap (heap, N, k); 929 downheap (heap, N, k);
905} 930}
931
932/* rebuild the heap: this function is used only once and executed rarely */
933void inline_size
934reheap (ANHE *heap, int N)
935{
936 int i;
937 /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
938 /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
939 for (i = 0; i < N; ++i)
940 upheap (heap, i + HEAP0);
941}
942
943#if EV_VERIFY
944static void
945checkheap (ANHE *heap, int N)
946{
947 int i;
948
949 for (i = HEAP0; i < N + HEAP0; ++i)
950 {
951 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
952 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
953 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
954 }
955}
956#endif
906 957
907/*****************************************************************************/ 958/*****************************************************************************/
908 959
909typedef struct 960typedef struct
910{ 961{
… …
1454void 1505void
1455ev_loop_fork (EV_P) 1506ev_loop_fork (EV_P)
1456{ 1507{
1457 postfork = 1; /* must be in line with ev_default_fork */ 1508 postfork = 1; /* must be in line with ev_default_fork */
1458} 1509}
1510
1511#if EV_VERIFY
1512static void
1513array_check (W **ws, int cnt)
1514{
1515 while (cnt--)
1516 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1517}
1518
1519static void
1520ev_loop_verify (EV_P)
1521{
1522 int i;
1523
1524 checkheap (timers, timercnt);
1525#if EV_PERIODIC_ENABLE
1526 checkheap (periodics, periodiccnt);
1527#endif
1528
1529#if EV_IDLE_ENABLE
1530 for (i = NUMPRI; i--; )
1531 array_check ((W **)idles [i], idlecnt [i]);
1532#endif
1533#if EV_FORK_ENABLE
1534 array_check ((W **)forks, forkcnt);
1535#endif
1536 array_check ((W **)prepares, preparecnt);
1537 array_check ((W **)checks, checkcnt);
1538#if EV_ASYNC_ENABLE
1539 array_check ((W **)asyncs, asynccnt);
1540#endif
1541}
1542#endif
1543
1459#endif 1544#endif
1460 1545
1461#if EV_MULTIPLICITY 1546#if EV_MULTIPLICITY
1462struct ev_loop * 1547struct ev_loop *
1463ev_default_loop_init (unsigned int flags) 1548ev_default_loop_init (unsigned int flags)
… …
1529void inline_speed 1614void inline_speed
1530call_pending (EV_P) 1615call_pending (EV_P)
1531{ 1616{
1532 int pri; 1617 int pri;
1533 1618
1619 EV_FREQUENT_CHECK;
1620
1534 for (pri = NUMPRI; pri--; ) 1621 for (pri = NUMPRI; pri--; )
1535 while (pendingcnt [pri]) 1622 while (pendingcnt [pri])
1536 { 1623 {
1537 ANPENDING *p = pendings [pri] + --pendingcnt [pri]; 1624 ANPENDING *p = pendings [pri] + --pendingcnt [pri];
1538 1625
… …
1542 1629
1543 p->w->pending = 0; 1630 p->w->pending = 0;
1544 EV_CB_INVOKE (p->w, p->events); 1631 EV_CB_INVOKE (p->w, p->events);
1545 } 1632 }
1546 } 1633 }
1634
1635 EV_FREQUENT_CHECK;
1547} 1636}
1548 1637
1549#if EV_IDLE_ENABLE 1638#if EV_IDLE_ENABLE
1550void inline_size 1639void inline_size
1551idle_reify (EV_P) 1640idle_reify (EV_P)
… …
1570#endif 1659#endif
1571 1660
1572void inline_size 1661void inline_size
1573timers_reify (EV_P) 1662timers_reify (EV_P)
1574{ 1663{
1664 EV_FREQUENT_CHECK;
1665
1575 while (timercnt && ev_at (timers [HEAP0]) <= mn_now) 1666 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1576 { 1667 {
1577 ev_timer *w = (ev_timer *)timers [HEAP0]; 1668 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1578 1669
1579 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1670 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1580 1671
1581 /* first reschedule or stop timer */ 1672 /* first reschedule or stop timer */
1582 if (w->repeat) 1673 if (w->repeat)
1583 { 1674 {
1584 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1585
1586 ev_at (w) += w->repeat; 1675 ev_at (w) += w->repeat;
1587 if (ev_at (w) < mn_now) 1676 if (ev_at (w) < mn_now)
1588 ev_at (w) = mn_now; 1677 ev_at (w) = mn_now;
1589 1678
1679 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1680
1681 ANHE_at_cache (timers [HEAP0]);
1590 downheap (timers, timercnt, HEAP0); 1682 downheap (timers, timercnt, HEAP0);
1591 } 1683 }
1592 else 1684 else
1593 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1685 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1594 1686
1687 EV_FREQUENT_CHECK;
1595 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); 1688 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1596 } 1689 }
1597} 1690}
1598 1691
1599#if EV_PERIODIC_ENABLE 1692#if EV_PERIODIC_ENABLE
1600void inline_size 1693void inline_size
1601periodics_reify (EV_P) 1694periodics_reify (EV_P)
1602{ 1695{
1696 EV_FREQUENT_CHECK;
1603 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) 1697 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1604 { 1698 {
1605 ev_periodic *w = (ev_periodic *)periodics [HEAP0]; 1699 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1606 1700
1607 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ 1701 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1608 1702
1609 /* first reschedule or stop timer */ 1703 /* first reschedule or stop timer */
1610 if (w->reschedule_cb) 1704 if (w->reschedule_cb)
1611 { 1705 {
1612 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); 1706 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1707
1613 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); 1708 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1709
1710 ANHE_at_cache (periodics [HEAP0]);
1614 downheap (periodics, periodiccnt, 1); 1711 downheap (periodics, periodiccnt, HEAP0);
1712 EV_FREQUENT_CHECK;
1615 } 1713 }
1616 else if (w->interval) 1714 else if (w->interval)
1617 { 1715 {
1618 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1716 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1717 /* if next trigger time is not sufficiently in the future, put it there */
1718 /* this might happen because of floating point inexactness */
1619 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1719 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)); 1720 {
1721 ev_at (w) += w->interval;
1722
1723 /* if interval is unreasonably low we might still have a time in the past */
1724 /* so correct this. this will make the periodic very inexact, but the user */
1725 /* has effectively asked to get triggered more often than possible */
1726 if (ev_at (w) < ev_rt_now)
1727 ev_at (w) = ev_rt_now;
1728 }
1729
1730 ANHE_at_cache (periodics [HEAP0]);
1621 downheap (periodics, periodiccnt, HEAP0); 1731 downheap (periodics, periodiccnt, HEAP0);
1622 } 1732 }
1623 else 1733 else
1624 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1734 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1625 1735
1736 EV_FREQUENT_CHECK;
1626 ev_feed_event (EV_A_ (W)w, EV_PERIODIC); 1737 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1627 } 1738 }
1628} 1739}
1629 1740
1630static void noinline 1741static void noinline
1631periodics_reschedule (EV_P) 1742periodics_reschedule (EV_P)
1632{ 1743{
1633 int i; 1744 int i;
1634 1745
1635 /* adjust periodics after time jump */ 1746 /* adjust periodics after time jump */
1636 for (i = 1; i <= periodiccnt; ++i) 1747 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1637 { 1748 {
1638 ev_periodic *w = (ev_periodic *)periodics [i]; 1749 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1639 1750
1640 if (w->reschedule_cb) 1751 if (w->reschedule_cb)
1641 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1752 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1642 else if (w->interval) 1753 else if (w->interval)
1643 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1754 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1644 }
1645 1755
1646 /* now rebuild the heap */ 1756 ANHE_at_cache (periodics [i]);
1647 for (i = periodiccnt >> 1; --i; ) 1757 }
1758
1648 downheap (periodics, periodiccnt, i + HEAP0); 1759 reheap (periodics, periodiccnt);
1649} 1760}
1650#endif 1761#endif
1651 1762
1652void inline_speed 1763void inline_speed
1653time_update (EV_P_ ev_tstamp max_block) 1764time_update (EV_P_ ev_tstamp max_block)
… …
1707 { 1818 {
1708#if EV_PERIODIC_ENABLE 1819#if EV_PERIODIC_ENABLE
1709 periodics_reschedule (EV_A); 1820 periodics_reschedule (EV_A);
1710#endif 1821#endif
1711 /* adjust timers. this is easy, as the offset is the same for all of them */ 1822 /* adjust timers. this is easy, as the offset is the same for all of them */
1712 for (i = 1; i <= timercnt; ++i) 1823 for (i = 0; i < timercnt; ++i)
1713 ev_at (timers [i]) += ev_rt_now - mn_now; 1824 {
1825 ANHE *he = timers + i + HEAP0;
1826 ANHE_w (*he)->at += ev_rt_now - mn_now;
1827 ANHE_at_cache (*he);
1828 }
1714 } 1829 }
1715 1830
1716 mn_now = ev_rt_now; 1831 mn_now = ev_rt_now;
1717 } 1832 }
1718} 1833}
… …
1788 1903
1789 waittime = MAX_BLOCKTIME; 1904 waittime = MAX_BLOCKTIME;
1790 1905
1791 if (timercnt) 1906 if (timercnt)
1792 { 1907 {
1793 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; 1908 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1794 if (waittime > to) waittime = to; 1909 if (waittime > to) waittime = to;
1795 } 1910 }
1796 1911
1797#if EV_PERIODIC_ENABLE 1912#if EV_PERIODIC_ENABLE
1798 if (periodiccnt) 1913 if (periodiccnt)
1799 { 1914 {
1800 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; 1915 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1801 if (waittime > to) waittime = to; 1916 if (waittime > to) waittime = to;
1802 } 1917 }
1803#endif 1918#endif
1804 1919
1805 if (expect_false (waittime < timeout_blocktime)) 1920 if (expect_false (waittime < timeout_blocktime))
… …
1942 if (expect_false (ev_is_active (w))) 2057 if (expect_false (ev_is_active (w)))
1943 return; 2058 return;
1944 2059
1945 assert (("ev_io_start called with negative fd", fd >= 0)); 2060 assert (("ev_io_start called with negative fd", fd >= 0));
1946 2061
2062 EV_FREQUENT_CHECK;
2063
1947 ev_start (EV_A_ (W)w, 1); 2064 ev_start (EV_A_ (W)w, 1);
1948 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2065 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1949 wlist_add (&anfds[fd].head, (WL)w); 2066 wlist_add (&anfds[fd].head, (WL)w);
1950 2067
1951 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2068 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1952 w->events &= ~EV_IOFDSET; 2069 w->events &= ~EV_IOFDSET;
2070
2071 EV_FREQUENT_CHECK;
1953} 2072}
1954 2073
1955void noinline 2074void noinline
1956ev_io_stop (EV_P_ ev_io *w) 2075ev_io_stop (EV_P_ ev_io *w)
1957{ 2076{
1958 clear_pending (EV_A_ (W)w); 2077 clear_pending (EV_A_ (W)w);
1959 if (expect_false (!ev_is_active (w))) 2078 if (expect_false (!ev_is_active (w)))
1960 return; 2079 return;
1961 2080
1962 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2081 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2082
2083 EV_FREQUENT_CHECK;
1963 2084
1964 wlist_del (&anfds[w->fd].head, (WL)w); 2085 wlist_del (&anfds[w->fd].head, (WL)w);
1965 ev_stop (EV_A_ (W)w); 2086 ev_stop (EV_A_ (W)w);
1966 2087
1967 fd_change (EV_A_ w->fd, 1); 2088 fd_change (EV_A_ w->fd, 1);
2089
2090 EV_FREQUENT_CHECK;
1968} 2091}
1969 2092
1970void noinline 2093void noinline
1971ev_timer_start (EV_P_ ev_timer *w) 2094ev_timer_start (EV_P_ ev_timer *w)
1972{ 2095{
… …
1975 2098
1976 ev_at (w) += mn_now; 2099 ev_at (w) += mn_now;
1977 2100
1978 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2101 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1979 2102
2103 EV_FREQUENT_CHECK;
2104
2105 ++timercnt;
1980 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2106 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1981 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); 2107 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1982 timers [ev_active (w)] = (WT)w; 2108 ANHE_w (timers [ev_active (w)]) = (WT)w;
2109 ANHE_at_cache (timers [ev_active (w)]);
1983 upheap (timers, ev_active (w)); 2110 upheap (timers, ev_active (w));
1984 2111
2112 EV_FREQUENT_CHECK;
2113
1985 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2114 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1986} 2115}
1987 2116
1988void noinline 2117void noinline
1989ev_timer_stop (EV_P_ ev_timer *w) 2118ev_timer_stop (EV_P_ ev_timer *w)
1990{ 2119{
1991 clear_pending (EV_A_ (W)w); 2120 clear_pending (EV_A_ (W)w);
1992 if (expect_false (!ev_is_active (w))) 2121 if (expect_false (!ev_is_active (w)))
1993 return; 2122 return;
1994 2123
2124 EV_FREQUENT_CHECK;
2125
1995 { 2126 {
1996 int active = ev_active (w); 2127 int active = ev_active (w);
1997 2128
1998 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2129 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
1999 2130
2131 --timercnt;
2132
2000 if (expect_true (active < timercnt + HEAP0 - 1)) 2133 if (expect_true (active < timercnt + HEAP0))
2001 { 2134 {
2002 timers [active] = timers [timercnt + HEAP0 - 1]; 2135 timers [active] = timers [timercnt + HEAP0];
2003 adjustheap (timers, timercnt, active); 2136 adjustheap (timers, timercnt, active);
2004 } 2137 }
2005
2006 --timercnt;
2007 } 2138 }
2139
2140 EV_FREQUENT_CHECK;
2008 2141
2009 ev_at (w) -= mn_now; 2142 ev_at (w) -= mn_now;
2010 2143
2011 ev_stop (EV_A_ (W)w); 2144 ev_stop (EV_A_ (W)w);
2012} 2145}
2013 2146
2014void noinline 2147void noinline
2015ev_timer_again (EV_P_ ev_timer *w) 2148ev_timer_again (EV_P_ ev_timer *w)
2016{ 2149{
2150 EV_FREQUENT_CHECK;
2151
2017 if (ev_is_active (w)) 2152 if (ev_is_active (w))
2018 { 2153 {
2019 if (w->repeat) 2154 if (w->repeat)
2020 { 2155 {
2021 ev_at (w) = mn_now + w->repeat; 2156 ev_at (w) = mn_now + w->repeat;
2157 ANHE_at_cache (timers [ev_active (w)]);
2022 adjustheap (timers, timercnt, ev_active (w)); 2158 adjustheap (timers, timercnt, ev_active (w));
2023 } 2159 }
2024 else 2160 else
2025 ev_timer_stop (EV_A_ w); 2161 ev_timer_stop (EV_A_ w);
2026 } 2162 }
2027 else if (w->repeat) 2163 else if (w->repeat)
2028 { 2164 {
2029 ev_at (w) = w->repeat; 2165 ev_at (w) = w->repeat;
2030 ev_timer_start (EV_A_ w); 2166 ev_timer_start (EV_A_ w);
2031 } 2167 }
2168
2169 EV_FREQUENT_CHECK;
2032} 2170}
2033 2171
2034#if EV_PERIODIC_ENABLE 2172#if EV_PERIODIC_ENABLE
2035void noinline 2173void noinline
2036ev_periodic_start (EV_P_ ev_periodic *w) 2174ev_periodic_start (EV_P_ ev_periodic *w)
… …
2047 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2185 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2048 } 2186 }
2049 else 2187 else
2050 ev_at (w) = w->offset; 2188 ev_at (w) = w->offset;
2051 2189
2190 EV_FREQUENT_CHECK;
2191
2192 ++periodiccnt;
2052 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2193 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2053 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); 2194 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2054 periodics [ev_active (w)] = (WT)w; 2195 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2196 ANHE_at_cache (periodics [ev_active (w)]);
2055 upheap (periodics, ev_active (w)); 2197 upheap (periodics, ev_active (w));
2056 2198
2199 EV_FREQUENT_CHECK;
2200
2057 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2201 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2058} 2202}
2059 2203
2060void noinline 2204void noinline
2061ev_periodic_stop (EV_P_ ev_periodic *w) 2205ev_periodic_stop (EV_P_ ev_periodic *w)
2062{ 2206{
2063 clear_pending (EV_A_ (W)w); 2207 clear_pending (EV_A_ (W)w);
2064 if (expect_false (!ev_is_active (w))) 2208 if (expect_false (!ev_is_active (w)))
2065 return; 2209 return;
2066 2210
2211 EV_FREQUENT_CHECK;
2212
2067 { 2213 {
2068 int active = ev_active (w); 2214 int active = ev_active (w);
2069 2215
2070 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2216 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2071 2217
2218 --periodiccnt;
2219
2072 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2220 if (expect_true (active < periodiccnt + HEAP0))
2073 { 2221 {
2074 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2222 periodics [active] = periodics [periodiccnt + HEAP0];
2075 adjustheap (periodics, periodiccnt, active); 2223 adjustheap (periodics, periodiccnt, active);
2076 } 2224 }
2077
2078 --periodiccnt;
2079 } 2225 }
2226
2227 EV_FREQUENT_CHECK;
2080 2228
2081 ev_stop (EV_A_ (W)w); 2229 ev_stop (EV_A_ (W)w);
2082} 2230}
2083 2231
2084void noinline 2232void noinline
… …
2104 return; 2252 return;
2105 2253
2106 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2254 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2107 2255
2108 evpipe_init (EV_A); 2256 evpipe_init (EV_A);
2257
2258 EV_FREQUENT_CHECK;
2109 2259
2110 { 2260 {
2111#ifndef _WIN32 2261#ifndef _WIN32
2112 sigset_t full, prev; 2262 sigset_t full, prev;
2113 sigfillset (&full); 2263 sigfillset (&full);
… …
2134 sigfillset (&sa.sa_mask); 2284 sigfillset (&sa.sa_mask);
2135 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2285 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2136 sigaction (w->signum, &sa, 0); 2286 sigaction (w->signum, &sa, 0);
2137#endif 2287#endif
2138 } 2288 }
2289
2290 EV_FREQUENT_CHECK;
2139} 2291}
2140 2292
2141void noinline 2293void noinline
2142ev_signal_stop (EV_P_ ev_signal *w) 2294ev_signal_stop (EV_P_ ev_signal *w)
2143{ 2295{
2144 clear_pending (EV_A_ (W)w); 2296 clear_pending (EV_A_ (W)w);
2145 if (expect_false (!ev_is_active (w))) 2297 if (expect_false (!ev_is_active (w)))
2146 return; 2298 return;
2147 2299
2300 EV_FREQUENT_CHECK;
2301
2148 wlist_del (&signals [w->signum - 1].head, (WL)w); 2302 wlist_del (&signals [w->signum - 1].head, (WL)w);
2149 ev_stop (EV_A_ (W)w); 2303 ev_stop (EV_A_ (W)w);
2150 2304
2151 if (!signals [w->signum - 1].head) 2305 if (!signals [w->signum - 1].head)
2152 signal (w->signum, SIG_DFL); 2306 signal (w->signum, SIG_DFL);
2307
2308 EV_FREQUENT_CHECK;
2153} 2309}
2154 2310
2155void 2311void
2156ev_child_start (EV_P_ ev_child *w) 2312ev_child_start (EV_P_ ev_child *w)
2157{ 2313{
… …
2159 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2315 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2160#endif 2316#endif
2161 if (expect_false (ev_is_active (w))) 2317 if (expect_false (ev_is_active (w)))
2162 return; 2318 return;
2163 2319
2320 EV_FREQUENT_CHECK;
2321
2164 ev_start (EV_A_ (W)w, 1); 2322 ev_start (EV_A_ (W)w, 1);
2165 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2323 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2324
2325 EV_FREQUENT_CHECK;
2166} 2326}
2167 2327
2168void 2328void
2169ev_child_stop (EV_P_ ev_child *w) 2329ev_child_stop (EV_P_ ev_child *w)
2170{ 2330{
2171 clear_pending (EV_A_ (W)w); 2331 clear_pending (EV_A_ (W)w);
2172 if (expect_false (!ev_is_active (w))) 2332 if (expect_false (!ev_is_active (w)))
2173 return; 2333 return;
2174 2334
2335 EV_FREQUENT_CHECK;
2336
2175 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2337 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2176 ev_stop (EV_A_ (W)w); 2338 ev_stop (EV_A_ (W)w);
2339
2340 EV_FREQUENT_CHECK;
2177} 2341}
2178 2342
2179#if EV_STAT_ENABLE 2343#if EV_STAT_ENABLE
2180 2344
2181# ifdef _WIN32 2345# ifdef _WIN32
… …
2409 else 2573 else
2410#endif 2574#endif
2411 ev_timer_start (EV_A_ &w->timer); 2575 ev_timer_start (EV_A_ &w->timer);
2412 2576
2413 ev_start (EV_A_ (W)w, 1); 2577 ev_start (EV_A_ (W)w, 1);
2578
2579 EV_FREQUENT_CHECK;
2414} 2580}
2415 2581
2416void 2582void
2417ev_stat_stop (EV_P_ ev_stat *w) 2583ev_stat_stop (EV_P_ ev_stat *w)
2418{ 2584{
2419 clear_pending (EV_A_ (W)w); 2585 clear_pending (EV_A_ (W)w);
2420 if (expect_false (!ev_is_active (w))) 2586 if (expect_false (!ev_is_active (w)))
2421 return; 2587 return;
2422 2588
2589 EV_FREQUENT_CHECK;
2590
2423#if EV_USE_INOTIFY 2591#if EV_USE_INOTIFY
2424 infy_del (EV_A_ w); 2592 infy_del (EV_A_ w);
2425#endif 2593#endif
2426 ev_timer_stop (EV_A_ &w->timer); 2594 ev_timer_stop (EV_A_ &w->timer);
2427 2595
2428 ev_stop (EV_A_ (W)w); 2596 ev_stop (EV_A_ (W)w);
2597
2598 EV_FREQUENT_CHECK;
2429} 2599}
2430#endif 2600#endif
2431 2601
2432#if EV_IDLE_ENABLE 2602#if EV_IDLE_ENABLE
2433void 2603void
… …
2435{ 2605{
2436 if (expect_false (ev_is_active (w))) 2606 if (expect_false (ev_is_active (w)))
2437 return; 2607 return;
2438 2608
2439 pri_adjust (EV_A_ (W)w); 2609 pri_adjust (EV_A_ (W)w);
2610
2611 EV_FREQUENT_CHECK;
2440 2612
2441 { 2613 {
2442 int active = ++idlecnt [ABSPRI (w)]; 2614 int active = ++idlecnt [ABSPRI (w)];
2443 2615
2444 ++idleall; 2616 ++idleall;
2445 ev_start (EV_A_ (W)w, active); 2617 ev_start (EV_A_ (W)w, active);
2446 2618
2447 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2619 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2448 idles [ABSPRI (w)][active - 1] = w; 2620 idles [ABSPRI (w)][active - 1] = w;
2449 } 2621 }
2622
2623 EV_FREQUENT_CHECK;
2450} 2624}
2451 2625
2452void 2626void
2453ev_idle_stop (EV_P_ ev_idle *w) 2627ev_idle_stop (EV_P_ ev_idle *w)
2454{ 2628{
2455 clear_pending (EV_A_ (W)w); 2629 clear_pending (EV_A_ (W)w);
2456 if (expect_false (!ev_is_active (w))) 2630 if (expect_false (!ev_is_active (w)))
2457 return; 2631 return;
2458 2632
2633 EV_FREQUENT_CHECK;
2634
2459 { 2635 {
2460 int active = ev_active (w); 2636 int active = ev_active (w);
2461 2637
2462 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2638 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2463 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2639 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2464 2640
2465 ev_stop (EV_A_ (W)w); 2641 ev_stop (EV_A_ (W)w);
2466 --idleall; 2642 --idleall;
2467 } 2643 }
2644
2645 EV_FREQUENT_CHECK;
2468} 2646}
2469#endif 2647#endif
2470 2648
2471void 2649void
2472ev_prepare_start (EV_P_ ev_prepare *w) 2650ev_prepare_start (EV_P_ ev_prepare *w)
2473{ 2651{
2474 if (expect_false (ev_is_active (w))) 2652 if (expect_false (ev_is_active (w)))
2475 return; 2653 return;
2654
2655 EV_FREQUENT_CHECK;
2476 2656
2477 ev_start (EV_A_ (W)w, ++preparecnt); 2657 ev_start (EV_A_ (W)w, ++preparecnt);
2478 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2658 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2479 prepares [preparecnt - 1] = w; 2659 prepares [preparecnt - 1] = w;
2660
2661 EV_FREQUENT_CHECK;
2480} 2662}
2481 2663
2482void 2664void
2483ev_prepare_stop (EV_P_ ev_prepare *w) 2665ev_prepare_stop (EV_P_ ev_prepare *w)
2484{ 2666{
2485 clear_pending (EV_A_ (W)w); 2667 clear_pending (EV_A_ (W)w);
2486 if (expect_false (!ev_is_active (w))) 2668 if (expect_false (!ev_is_active (w)))
2487 return; 2669 return;
2488 2670
2671 EV_FREQUENT_CHECK;
2672
2489 { 2673 {
2490 int active = ev_active (w); 2674 int active = ev_active (w);
2491 2675
2492 prepares [active - 1] = prepares [--preparecnt]; 2676 prepares [active - 1] = prepares [--preparecnt];
2493 ev_active (prepares [active - 1]) = active; 2677 ev_active (prepares [active - 1]) = active;
2494 } 2678 }
2495 2679
2496 ev_stop (EV_A_ (W)w); 2680 ev_stop (EV_A_ (W)w);
2681
2682 EV_FREQUENT_CHECK;
2497} 2683}
2498 2684
2499void 2685void
2500ev_check_start (EV_P_ ev_check *w) 2686ev_check_start (EV_P_ ev_check *w)
2501{ 2687{
2502 if (expect_false (ev_is_active (w))) 2688 if (expect_false (ev_is_active (w)))
2503 return; 2689 return;
2690
2691 EV_FREQUENT_CHECK;
2504 2692
2505 ev_start (EV_A_ (W)w, ++checkcnt); 2693 ev_start (EV_A_ (W)w, ++checkcnt);
2506 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2694 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2507 checks [checkcnt - 1] = w; 2695 checks [checkcnt - 1] = w;
2696
2697 EV_FREQUENT_CHECK;
2508} 2698}
2509 2699
2510void 2700void
2511ev_check_stop (EV_P_ ev_check *w) 2701ev_check_stop (EV_P_ ev_check *w)
2512{ 2702{
2513 clear_pending (EV_A_ (W)w); 2703 clear_pending (EV_A_ (W)w);
2514 if (expect_false (!ev_is_active (w))) 2704 if (expect_false (!ev_is_active (w)))
2515 return; 2705 return;
2516 2706
2707 EV_FREQUENT_CHECK;
2708
2517 { 2709 {
2518 int active = ev_active (w); 2710 int active = ev_active (w);
2519 2711
2520 checks [active - 1] = checks [--checkcnt]; 2712 checks [active - 1] = checks [--checkcnt];
2521 ev_active (checks [active - 1]) = active; 2713 ev_active (checks [active - 1]) = active;
2522 } 2714 }
2523 2715
2524 ev_stop (EV_A_ (W)w); 2716 ev_stop (EV_A_ (W)w);
2717
2718 EV_FREQUENT_CHECK;
2525} 2719}
2526 2720
2527#if EV_EMBED_ENABLE 2721#if EV_EMBED_ENABLE
2528void noinline 2722void noinline
2529ev_embed_sweep (EV_P_ ev_embed *w) 2723ev_embed_sweep (EV_P_ ev_embed *w)
… …
2576 struct ev_loop *loop = w->other; 2770 struct ev_loop *loop = w->other;
2577 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2771 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2578 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); 2772 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2579 } 2773 }
2580 2774
2775 EV_FREQUENT_CHECK;
2776
2581 ev_set_priority (&w->io, ev_priority (w)); 2777 ev_set_priority (&w->io, ev_priority (w));
2582 ev_io_start (EV_A_ &w->io); 2778 ev_io_start (EV_A_ &w->io);
2583 2779
2584 ev_prepare_init (&w->prepare, embed_prepare_cb); 2780 ev_prepare_init (&w->prepare, embed_prepare_cb);
2585 ev_set_priority (&w->prepare, EV_MINPRI); 2781 ev_set_priority (&w->prepare, EV_MINPRI);
2586 ev_prepare_start (EV_A_ &w->prepare); 2782 ev_prepare_start (EV_A_ &w->prepare);
2587 2783
2588 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2784 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2589 2785
2590 ev_start (EV_A_ (W)w, 1); 2786 ev_start (EV_A_ (W)w, 1);
2787
2788 EV_FREQUENT_CHECK;
2591} 2789}
2592 2790
2593void 2791void
2594ev_embed_stop (EV_P_ ev_embed *w) 2792ev_embed_stop (EV_P_ ev_embed *w)
2595{ 2793{
2596 clear_pending (EV_A_ (W)w); 2794 clear_pending (EV_A_ (W)w);
2597 if (expect_false (!ev_is_active (w))) 2795 if (expect_false (!ev_is_active (w)))
2598 return; 2796 return;
2599 2797
2798 EV_FREQUENT_CHECK;
2799
2600 ev_io_stop (EV_A_ &w->io); 2800 ev_io_stop (EV_A_ &w->io);
2601 ev_prepare_stop (EV_A_ &w->prepare); 2801 ev_prepare_stop (EV_A_ &w->prepare);
2602 2802
2603 ev_stop (EV_A_ (W)w); 2803 ev_stop (EV_A_ (W)w);
2804
2805 EV_FREQUENT_CHECK;
2604} 2806}
2605#endif 2807#endif
2606 2808
2607#if EV_FORK_ENABLE 2809#if EV_FORK_ENABLE
2608void 2810void
2609ev_fork_start (EV_P_ ev_fork *w) 2811ev_fork_start (EV_P_ ev_fork *w)
2610{ 2812{
2611 if (expect_false (ev_is_active (w))) 2813 if (expect_false (ev_is_active (w)))
2612 return; 2814 return;
2815
2816 EV_FREQUENT_CHECK;
2613 2817
2614 ev_start (EV_A_ (W)w, ++forkcnt); 2818 ev_start (EV_A_ (W)w, ++forkcnt);
2615 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2819 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2616 forks [forkcnt - 1] = w; 2820 forks [forkcnt - 1] = w;
2821
2822 EV_FREQUENT_CHECK;
2617} 2823}
2618 2824
2619void 2825void
2620ev_fork_stop (EV_P_ ev_fork *w) 2826ev_fork_stop (EV_P_ ev_fork *w)
2621{ 2827{
2622 clear_pending (EV_A_ (W)w); 2828 clear_pending (EV_A_ (W)w);
2623 if (expect_false (!ev_is_active (w))) 2829 if (expect_false (!ev_is_active (w)))
2624 return; 2830 return;
2625 2831
2832 EV_FREQUENT_CHECK;
2833
2626 { 2834 {
2627 int active = ev_active (w); 2835 int active = ev_active (w);
2628 2836
2629 forks [active - 1] = forks [--forkcnt]; 2837 forks [active - 1] = forks [--forkcnt];
2630 ev_active (forks [active - 1]) = active; 2838 ev_active (forks [active - 1]) = active;
2631 } 2839 }
2632 2840
2633 ev_stop (EV_A_ (W)w); 2841 ev_stop (EV_A_ (W)w);
2842
2843 EV_FREQUENT_CHECK;
2634} 2844}
2635#endif 2845#endif
2636 2846
2637#if EV_ASYNC_ENABLE 2847#if EV_ASYNC_ENABLE
2638void 2848void
… …
2640{ 2850{
2641 if (expect_false (ev_is_active (w))) 2851 if (expect_false (ev_is_active (w)))
2642 return; 2852 return;
2643 2853
2644 evpipe_init (EV_A); 2854 evpipe_init (EV_A);
2855
2856 EV_FREQUENT_CHECK;
2645 2857
2646 ev_start (EV_A_ (W)w, ++asynccnt); 2858 ev_start (EV_A_ (W)w, ++asynccnt);
2647 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2859 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2648 asyncs [asynccnt - 1] = w; 2860 asyncs [asynccnt - 1] = w;
2861
2862 EV_FREQUENT_CHECK;
2649} 2863}
2650 2864
2651void 2865void
2652ev_async_stop (EV_P_ ev_async *w) 2866ev_async_stop (EV_P_ ev_async *w)
2653{ 2867{
2654 clear_pending (EV_A_ (W)w); 2868 clear_pending (EV_A_ (W)w);
2655 if (expect_false (!ev_is_active (w))) 2869 if (expect_false (!ev_is_active (w)))
2656 return; 2870 return;
2657 2871
2872 EV_FREQUENT_CHECK;
2873
2658 { 2874 {
2659 int active = ev_active (w); 2875 int active = ev_active (w);
2660 2876
2661 asyncs [active - 1] = asyncs [--asynccnt]; 2877 asyncs [active - 1] = asyncs [--asynccnt];
2662 ev_active (asyncs [active - 1]) = active; 2878 ev_active (asyncs [active - 1]) = active;
2663 } 2879 }
2664 2880
2665 ev_stop (EV_A_ (W)w); 2881 ev_stop (EV_A_ (W)w);
2882
2883 EV_FREQUENT_CHECK;
2666} 2884}
2667 2885
2668void 2886void
2669ev_async_send (EV_P_ ev_async *w) 2887ev_async_send (EV_P_ ev_async *w)
2670{ 2888{

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines