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

Comparing libev/ev.c (file contents):
Revision 1.242 by root, Fri May 9 14:07:19 2008 UTC vs.
Revision 1.250 by root, Thu May 22 02:44:57 2008 UTC

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
430 WL head; 454 WL head;
431} ANFS; 455} ANFS;
432#endif 456#endif
433 457
434/* Heap Entry */ 458/* Heap Entry */
435#define EV_HEAP_CACHE_AT 0
436#if EV_HEAP_CACHE_AT 459#if EV_HEAP_CACHE_AT
437 typedef struct { 460 typedef struct {
461 ev_tstamp at;
438 WT w; 462 WT w;
439 ev_tstamp at;
440 } ANHE; 463 } ANHE;
441 464
442 #define ANHE_w(he) (he).w /* access watcher, read-write */ 465 #define ANHE_w(he) (he).w /* access watcher, read-write */
443 #define ANHE_at(he) (he).at /* access cached at, read-only */ 466 #define ANHE_at(he) (he).at /* access cached at, read-only */
444 #define ANHE_at_set(he) (he).at = (he).w->at /* update at from watcher */ 467 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
445#else 468#else
446 typedef WT ANHE; 469 typedef WT ANHE;
447 470
448 #define ANHE_w(he) (he) 471 #define ANHE_w(he) (he)
449 #define ANHE_at(he) (he)->at 472 #define ANHE_at(he) (he)->at
450 #define ANHE_at_set(he) 473 #define ANHE_at_cache(he)
451#endif 474#endif
452 475
453#if EV_MULTIPLICITY 476#if EV_MULTIPLICITY
454 477
455 struct ev_loop 478 struct ev_loop
791 * at the moment we allow libev the luxury of two heaps, 814 * at the moment we allow libev the luxury of two heaps,
792 * 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
793 * which is more cache-efficient. 816 * which is more cache-efficient.
794 * the difference is about 5% with 50000+ watchers. 817 * the difference is about 5% with 50000+ watchers.
795 */ 818 */
796#define EV_USE_4HEAP !EV_MINIMAL
797#if EV_USE_4HEAP 819#if EV_USE_4HEAP
798 820
799#define DHEAP 4 821#define DHEAP 4
800#define HEAP0 (DHEAP - 1) /* index of first element in heap */ 822#define HEAP0 (DHEAP - 1) /* index of first element in heap */
801 823#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
802/* towards the root */ 824#define UPHEAP_DONE(p,k) ((p) == (k))
803void inline_speed
804upheap (ANHE *heap, int k)
805{
806 ANHE he = heap [k];
807
808 for (;;)
809 {
810 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
811
812 if (p == k || ANHE_at (heap [p]) <= ANHE_at (he))
813 break;
814
815 heap [k] = heap [p];
816 ev_active (ANHE_w (heap [k])) = k;
817 k = p;
818 }
819
820 ev_active (ANHE_w (he)) = k;
821 heap [k] = he;
822}
823 825
824/* away from the root */ 826/* away from the root */
825void inline_speed 827void inline_speed
826downheap (ANHE *heap, int N, int k) 828downheap (ANHE *heap, int N, int k)
827{ 829{
830 832
831 for (;;) 833 for (;;)
832 { 834 {
833 ev_tstamp minat; 835 ev_tstamp minat;
834 ANHE *minpos; 836 ANHE *minpos;
835 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0; 837 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
836 838
837 // find minimum child 839 /* find minimum child */
838 if (expect_true (pos + DHEAP - 1 < E)) 840 if (expect_true (pos + DHEAP - 1 < E))
839 { 841 {
840 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); 842 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
841 if (ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); 843 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
842 if (ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos)); 844 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
843 if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos)); 845 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
844 } 846 }
845 else if (pos < E) 847 else if (pos < E)
846 { 848 {
847 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos)); 849 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
848 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos)); 850 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
853 break; 855 break;
854 856
855 if (ANHE_at (he) <= minat) 857 if (ANHE_at (he) <= minat)
856 break; 858 break;
857 859
860 heap [k] = *minpos;
858 ev_active (ANHE_w (*minpos)) = k; 861 ev_active (ANHE_w (*minpos)) = k;
859 heap [k] = *minpos;
860 862
861 k = minpos - heap; 863 k = minpos - heap;
862 } 864 }
863 865
866 heap [k] = he;
864 ev_active (ANHE_w (he)) = k; 867 ev_active (ANHE_w (he)) = k;
865 heap [k] = he;
866} 868}
867 869
868#else // 4HEAP 870#else /* 4HEAP */
869 871
870#define HEAP0 1 872#define HEAP0 1
871 873#define HPARENT(k) ((k) >> 1)
872/* towards the root */ 874#define UPHEAP_DONE(p,k) (!(p))
873void inline_speed
874upheap (ANHE *heap, int k)
875{
876 ANHE he = heap [k];
877
878 for (;;)
879 {
880 int p = k >> 1;
881
882 /* maybe we could use a dummy element at heap [0]? */
883 if (!p || ANHE_at (heap [p]) <= ANHE_at (he))
884 break;
885
886 heap [k] = heap [p];
887 ev_active (ANHE_w (heap [k])) = k;
888 k = p;
889 }
890
891 heap [k] = w;
892 ev_active (ANHE_w (heap [k])) = k;
893}
894 875
895/* away from the root */ 876/* away from the root */
896void inline_speed 877void inline_speed
897downheap (ANHE *heap, int N, int k) 878downheap (ANHE *heap, int N, int k)
898{ 879{
900 881
901 for (;;) 882 for (;;)
902 { 883 {
903 int c = k << 1; 884 int c = k << 1;
904 885
905 if (c > N) 886 if (c > N + HEAP0 - 1)
906 break; 887 break;
907 888
908 c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) 889 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
909 ? 1 : 0; 890 ? 1 : 0;
910 891
911 if (w->at <= ANHE_at (heap [c])) 892 if (ANHE_at (he) <= ANHE_at (heap [c]))
912 break; 893 break;
913 894
914 heap [k] = heap [c]; 895 heap [k] = heap [c];
915 ev_active (ANHE_w (heap [k])) = k; 896 ev_active (ANHE_w (heap [k])) = k;
916 897
920 heap [k] = he; 901 heap [k] = he;
921 ev_active (ANHE_w (he)) = k; 902 ev_active (ANHE_w (he)) = k;
922} 903}
923#endif 904#endif
924 905
906/* towards the root */
907void inline_speed
908upheap (ANHE *heap, int k)
909{
910 ANHE he = heap [k];
911
912 for (;;)
913 {
914 int p = HPARENT (k);
915
916 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
917 break;
918
919 heap [k] = heap [p];
920 ev_active (ANHE_w (heap [k])) = k;
921 k = p;
922 }
923
924 heap [k] = he;
925 ev_active (ANHE_w (he)) = k;
926}
927
925void inline_size 928void inline_size
926adjustheap (ANHE *heap, int N, int k) 929adjustheap (ANHE *heap, int N, int k)
927{ 930{
931 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
928 upheap (heap, k); 932 upheap (heap, k);
933 else
929 downheap (heap, N, k); 934 downheap (heap, N, k);
930} 935}
936
937/* rebuild the heap: this function is used only once and executed rarely */
938void inline_size
939reheap (ANHE *heap, int N)
940{
941 int i;
942 /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
943 /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
944 for (i = 0; i < N; ++i)
945 upheap (heap, i + HEAP0);
946}
947
948#if EV_VERIFY
949static void
950checkheap (ANHE *heap, int N)
951{
952 int i;
953
954 for (i = HEAP0; i < N + HEAP0; ++i)
955 {
956 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
957 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
958 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
959 }
960}
961#endif
931 962
932/*****************************************************************************/ 963/*****************************************************************************/
933 964
934typedef struct 965typedef struct
935{ 966{
1452 1483
1453 postfork = 0; 1484 postfork = 0;
1454} 1485}
1455 1486
1456#if EV_MULTIPLICITY 1487#if EV_MULTIPLICITY
1488
1457struct ev_loop * 1489struct ev_loop *
1458ev_loop_new (unsigned int flags) 1490ev_loop_new (unsigned int flags)
1459{ 1491{
1460 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); 1492 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop));
1461 1493
1479void 1511void
1480ev_loop_fork (EV_P) 1512ev_loop_fork (EV_P)
1481{ 1513{
1482 postfork = 1; /* must be in line with ev_default_fork */ 1514 postfork = 1; /* must be in line with ev_default_fork */
1483} 1515}
1516
1517#if EV_VERIFY
1518static void
1519array_check (W **ws, int cnt)
1520{
1521 while (cnt--)
1522 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1523}
1484#endif 1524#endif
1525
1526void
1527ev_loop_verify (EV_P)
1528{
1529#if EV_VERIFY
1530 int i;
1531
1532 checkheap (timers, timercnt);
1533#if EV_PERIODIC_ENABLE
1534 checkheap (periodics, periodiccnt);
1535#endif
1536
1537#if EV_IDLE_ENABLE
1538 for (i = NUMPRI; i--; )
1539 array_check ((W **)idles [i], idlecnt [i]);
1540#endif
1541#if EV_FORK_ENABLE
1542 array_check ((W **)forks, forkcnt);
1543#endif
1544#if EV_ASYNC_ENABLE
1545 array_check ((W **)asyncs, asynccnt);
1546#endif
1547 array_check ((W **)prepares, preparecnt);
1548 array_check ((W **)checks, checkcnt);
1549#endif
1550}
1551
1552#endif /* multiplicity */
1485 1553
1486#if EV_MULTIPLICITY 1554#if EV_MULTIPLICITY
1487struct ev_loop * 1555struct ev_loop *
1488ev_default_loop_init (unsigned int flags) 1556ev_default_loop_init (unsigned int flags)
1489#else 1557#else
1565 { 1633 {
1566 /*assert (("non-pending watcher on pending list", p->w->pending));*/ 1634 /*assert (("non-pending watcher on pending list", p->w->pending));*/
1567 1635
1568 p->w->pending = 0; 1636 p->w->pending = 0;
1569 EV_CB_INVOKE (p->w, p->events); 1637 EV_CB_INVOKE (p->w, p->events);
1638 EV_FREQUENT_CHECK;
1570 } 1639 }
1571 } 1640 }
1572} 1641}
1573 1642
1574#if EV_IDLE_ENABLE 1643#if EV_IDLE_ENABLE
1595#endif 1664#endif
1596 1665
1597void inline_size 1666void inline_size
1598timers_reify (EV_P) 1667timers_reify (EV_P)
1599{ 1668{
1669 EV_FREQUENT_CHECK;
1670
1600 while (timercnt && ANHE_at (timers [HEAP0]) <= mn_now) 1671 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1601 { 1672 {
1602 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]); 1673 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1603 1674
1604 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1675 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1605 1676
1606 /* first reschedule or stop timer */ 1677 /* first reschedule or stop timer */
1607 if (w->repeat) 1678 if (w->repeat)
1608 { 1679 {
1609 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1610
1611 ev_at (w) += w->repeat; 1680 ev_at (w) += w->repeat;
1612 if (ev_at (w) < mn_now) 1681 if (ev_at (w) < mn_now)
1613 ev_at (w) = mn_now; 1682 ev_at (w) = mn_now;
1614 1683
1684 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1685
1615 ANHE_at_set (timers [HEAP0]); 1686 ANHE_at_cache (timers [HEAP0]);
1616 downheap (timers, timercnt, HEAP0); 1687 downheap (timers, timercnt, HEAP0);
1617 } 1688 }
1618 else 1689 else
1619 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1690 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1620 1691
1692 EV_FREQUENT_CHECK;
1621 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); 1693 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1622 } 1694 }
1623} 1695}
1624 1696
1625#if EV_PERIODIC_ENABLE 1697#if EV_PERIODIC_ENABLE
1626void inline_size 1698void inline_size
1627periodics_reify (EV_P) 1699periodics_reify (EV_P)
1628{ 1700{
1701 EV_FREQUENT_CHECK;
1702
1629 while (periodiccnt && ANHE_at (periodics [HEAP0]) <= ev_rt_now) 1703 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1630 { 1704 {
1631 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]); 1705 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1632 1706
1633 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ 1707 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1634 1708
1635 /* first reschedule or stop timer */ 1709 /* first reschedule or stop timer */
1636 if (w->reschedule_cb) 1710 if (w->reschedule_cb)
1637 { 1711 {
1638 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); 1712 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1713
1639 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); 1714 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1715
1640 ANHE_at_set (periodics [HEAP0]); 1716 ANHE_at_cache (periodics [HEAP0]);
1641 downheap (periodics, periodiccnt, HEAP0); 1717 downheap (periodics, periodiccnt, HEAP0);
1642 } 1718 }
1643 else if (w->interval) 1719 else if (w->interval)
1644 { 1720 {
1645 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1721 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1722 /* if next trigger time is not sufficiently in the future, put it there */
1723 /* this might happen because of floating point inexactness */
1646 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1724 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1647 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now)); 1725 {
1726 ev_at (w) += w->interval;
1727
1728 /* if interval is unreasonably low we might still have a time in the past */
1729 /* so correct this. this will make the periodic very inexact, but the user */
1730 /* has effectively asked to get triggered more often than possible */
1731 if (ev_at (w) < ev_rt_now)
1732 ev_at (w) = ev_rt_now;
1733 }
1734
1648 ANHE_at_set (periodics [HEAP0]); 1735 ANHE_at_cache (periodics [HEAP0]);
1649 downheap (periodics, periodiccnt, HEAP0); 1736 downheap (periodics, periodiccnt, HEAP0);
1650 } 1737 }
1651 else 1738 else
1652 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1739 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1653 1740
1741 EV_FREQUENT_CHECK;
1654 ev_feed_event (EV_A_ (W)w, EV_PERIODIC); 1742 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1655 } 1743 }
1656} 1744}
1657 1745
1658static void noinline 1746static void noinline
1668 if (w->reschedule_cb) 1756 if (w->reschedule_cb)
1669 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1757 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1670 else if (w->interval) 1758 else if (w->interval)
1671 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1759 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1672 1760
1673 ANHE_at_set (periodics [i]); 1761 ANHE_at_cache (periodics [i]);
1674 } 1762 }
1675 1763
1676 /* now rebuild the heap, this for the 2-heap, inefficient for the 4-heap, but correct */
1677 for (i = periodiccnt >> 1; --i; )
1678 downheap (periodics, periodiccnt, i + HEAP0); 1764 reheap (periodics, periodiccnt);
1679} 1765}
1680#endif 1766#endif
1681 1767
1682void inline_speed 1768void inline_speed
1683time_update (EV_P_ ev_tstamp max_block) 1769time_update (EV_P_ ev_tstamp max_block)
1741 /* adjust timers. this is easy, as the offset is the same for all of them */ 1827 /* adjust timers. this is easy, as the offset is the same for all of them */
1742 for (i = 0; i < timercnt; ++i) 1828 for (i = 0; i < timercnt; ++i)
1743 { 1829 {
1744 ANHE *he = timers + i + HEAP0; 1830 ANHE *he = timers + i + HEAP0;
1745 ANHE_w (*he)->at += ev_rt_now - mn_now; 1831 ANHE_w (*he)->at += ev_rt_now - mn_now;
1746 ANHE_at_set (*he); 1832 ANHE_at_cache (*he);
1747 } 1833 }
1748 } 1834 }
1749 1835
1750 mn_now = ev_rt_now; 1836 mn_now = ev_rt_now;
1751 } 1837 }
1772 1858
1773 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ 1859 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1774 1860
1775 do 1861 do
1776 { 1862 {
1863#if EV_VERIFY >= 2
1864 ev_loop_verify (EV_A);
1865#endif
1866
1777#ifndef _WIN32 1867#ifndef _WIN32
1778 if (expect_false (curpid)) /* penalise the forking check even more */ 1868 if (expect_false (curpid)) /* penalise the forking check even more */
1779 if (expect_false (getpid () != curpid)) 1869 if (expect_false (getpid () != curpid))
1780 { 1870 {
1781 curpid = getpid (); 1871 curpid = getpid ();
1976 if (expect_false (ev_is_active (w))) 2066 if (expect_false (ev_is_active (w)))
1977 return; 2067 return;
1978 2068
1979 assert (("ev_io_start called with negative fd", fd >= 0)); 2069 assert (("ev_io_start called with negative fd", fd >= 0));
1980 2070
2071 EV_FREQUENT_CHECK;
2072
1981 ev_start (EV_A_ (W)w, 1); 2073 ev_start (EV_A_ (W)w, 1);
1982 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2074 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1983 wlist_add (&anfds[fd].head, (WL)w); 2075 wlist_add (&anfds[fd].head, (WL)w);
1984 2076
1985 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2077 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1986 w->events &= ~EV_IOFDSET; 2078 w->events &= ~EV_IOFDSET;
2079
2080 EV_FREQUENT_CHECK;
1987} 2081}
1988 2082
1989void noinline 2083void noinline
1990ev_io_stop (EV_P_ ev_io *w) 2084ev_io_stop (EV_P_ ev_io *w)
1991{ 2085{
1993 if (expect_false (!ev_is_active (w))) 2087 if (expect_false (!ev_is_active (w)))
1994 return; 2088 return;
1995 2089
1996 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2090 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
1997 2091
2092 EV_FREQUENT_CHECK;
2093
1998 wlist_del (&anfds[w->fd].head, (WL)w); 2094 wlist_del (&anfds[w->fd].head, (WL)w);
1999 ev_stop (EV_A_ (W)w); 2095 ev_stop (EV_A_ (W)w);
2000 2096
2001 fd_change (EV_A_ w->fd, 1); 2097 fd_change (EV_A_ w->fd, 1);
2098
2099 EV_FREQUENT_CHECK;
2002} 2100}
2003 2101
2004void noinline 2102void noinline
2005ev_timer_start (EV_P_ ev_timer *w) 2103ev_timer_start (EV_P_ ev_timer *w)
2006{ 2104{
2009 2107
2010 ev_at (w) += mn_now; 2108 ev_at (w) += mn_now;
2011 2109
2012 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2110 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2013 2111
2112 EV_FREQUENT_CHECK;
2113
2114 ++timercnt;
2014 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2115 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2015 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2); 2116 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2016 ANHE_w (timers [ev_active (w)]) = (WT)w; 2117 ANHE_w (timers [ev_active (w)]) = (WT)w;
2017 ANHE_at_set (timers [ev_active (w)]); 2118 ANHE_at_cache (timers [ev_active (w)]);
2018 upheap (timers, ev_active (w)); 2119 upheap (timers, ev_active (w));
2120
2121 EV_FREQUENT_CHECK;
2019 2122
2020 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/ 2123 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
2021} 2124}
2022 2125
2023void noinline 2126void noinline
2025{ 2128{
2026 clear_pending (EV_A_ (W)w); 2129 clear_pending (EV_A_ (W)w);
2027 if (expect_false (!ev_is_active (w))) 2130 if (expect_false (!ev_is_active (w)))
2028 return; 2131 return;
2029 2132
2133 EV_FREQUENT_CHECK;
2134
2030 { 2135 {
2031 int active = ev_active (w); 2136 int active = ev_active (w);
2032 2137
2033 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w)); 2138 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2034 2139
2140 --timercnt;
2141
2035 if (expect_true (active < timercnt + HEAP0 - 1)) 2142 if (expect_true (active < timercnt + HEAP0))
2036 { 2143 {
2037 timers [active] = timers [timercnt + HEAP0 - 1]; 2144 timers [active] = timers [timercnt + HEAP0];
2038 adjustheap (timers, timercnt, active); 2145 adjustheap (timers, timercnt, active);
2039 } 2146 }
2040
2041 --timercnt;
2042 } 2147 }
2148
2149 EV_FREQUENT_CHECK;
2043 2150
2044 ev_at (w) -= mn_now; 2151 ev_at (w) -= mn_now;
2045 2152
2046 ev_stop (EV_A_ (W)w); 2153 ev_stop (EV_A_ (W)w);
2047} 2154}
2048 2155
2049void noinline 2156void noinline
2050ev_timer_again (EV_P_ ev_timer *w) 2157ev_timer_again (EV_P_ ev_timer *w)
2051{ 2158{
2159 EV_FREQUENT_CHECK;
2160
2052 if (ev_is_active (w)) 2161 if (ev_is_active (w))
2053 { 2162 {
2054 if (w->repeat) 2163 if (w->repeat)
2055 { 2164 {
2056 ev_at (w) = mn_now + w->repeat; 2165 ev_at (w) = mn_now + w->repeat;
2057 ANHE_at_set (timers [ev_active (w)]); 2166 ANHE_at_cache (timers [ev_active (w)]);
2058 adjustheap (timers, timercnt, ev_active (w)); 2167 adjustheap (timers, timercnt, ev_active (w));
2059 } 2168 }
2060 else 2169 else
2061 ev_timer_stop (EV_A_ w); 2170 ev_timer_stop (EV_A_ w);
2062 } 2171 }
2063 else if (w->repeat) 2172 else if (w->repeat)
2064 { 2173 {
2065 ev_at (w) = w->repeat; 2174 ev_at (w) = w->repeat;
2066 ev_timer_start (EV_A_ w); 2175 ev_timer_start (EV_A_ w);
2067 } 2176 }
2177
2178 EV_FREQUENT_CHECK;
2068} 2179}
2069 2180
2070#if EV_PERIODIC_ENABLE 2181#if EV_PERIODIC_ENABLE
2071void noinline 2182void noinline
2072ev_periodic_start (EV_P_ ev_periodic *w) 2183ev_periodic_start (EV_P_ ev_periodic *w)
2083 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2194 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2084 } 2195 }
2085 else 2196 else
2086 ev_at (w) = w->offset; 2197 ev_at (w) = w->offset;
2087 2198
2199 EV_FREQUENT_CHECK;
2200
2201 ++periodiccnt;
2088 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2202 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2089 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2); 2203 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2090 ANHE_w (periodics [ev_active (w)]) = (WT)w; 2204 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2205 ANHE_at_cache (periodics [ev_active (w)]);
2091 upheap (periodics, ev_active (w)); 2206 upheap (periodics, ev_active (w));
2207
2208 EV_FREQUENT_CHECK;
2092 2209
2093 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/ 2210 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2094} 2211}
2095 2212
2096void noinline 2213void noinline
2098{ 2215{
2099 clear_pending (EV_A_ (W)w); 2216 clear_pending (EV_A_ (W)w);
2100 if (expect_false (!ev_is_active (w))) 2217 if (expect_false (!ev_is_active (w)))
2101 return; 2218 return;
2102 2219
2220 EV_FREQUENT_CHECK;
2221
2103 { 2222 {
2104 int active = ev_active (w); 2223 int active = ev_active (w);
2105 2224
2106 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w)); 2225 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2107 2226
2227 --periodiccnt;
2228
2108 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2229 if (expect_true (active < periodiccnt + HEAP0))
2109 { 2230 {
2110 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2231 periodics [active] = periodics [periodiccnt + HEAP0];
2111 adjustheap (periodics, periodiccnt, active); 2232 adjustheap (periodics, periodiccnt, active);
2112 } 2233 }
2113
2114 --periodiccnt;
2115 } 2234 }
2235
2236 EV_FREQUENT_CHECK;
2116 2237
2117 ev_stop (EV_A_ (W)w); 2238 ev_stop (EV_A_ (W)w);
2118} 2239}
2119 2240
2120void noinline 2241void noinline
2140 return; 2261 return;
2141 2262
2142 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2263 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2143 2264
2144 evpipe_init (EV_A); 2265 evpipe_init (EV_A);
2266
2267 EV_FREQUENT_CHECK;
2145 2268
2146 { 2269 {
2147#ifndef _WIN32 2270#ifndef _WIN32
2148 sigset_t full, prev; 2271 sigset_t full, prev;
2149 sigfillset (&full); 2272 sigfillset (&full);
2170 sigfillset (&sa.sa_mask); 2293 sigfillset (&sa.sa_mask);
2171 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2294 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2172 sigaction (w->signum, &sa, 0); 2295 sigaction (w->signum, &sa, 0);
2173#endif 2296#endif
2174 } 2297 }
2298
2299 EV_FREQUENT_CHECK;
2175} 2300}
2176 2301
2177void noinline 2302void noinline
2178ev_signal_stop (EV_P_ ev_signal *w) 2303ev_signal_stop (EV_P_ ev_signal *w)
2179{ 2304{
2180 clear_pending (EV_A_ (W)w); 2305 clear_pending (EV_A_ (W)w);
2181 if (expect_false (!ev_is_active (w))) 2306 if (expect_false (!ev_is_active (w)))
2182 return; 2307 return;
2183 2308
2309 EV_FREQUENT_CHECK;
2310
2184 wlist_del (&signals [w->signum - 1].head, (WL)w); 2311 wlist_del (&signals [w->signum - 1].head, (WL)w);
2185 ev_stop (EV_A_ (W)w); 2312 ev_stop (EV_A_ (W)w);
2186 2313
2187 if (!signals [w->signum - 1].head) 2314 if (!signals [w->signum - 1].head)
2188 signal (w->signum, SIG_DFL); 2315 signal (w->signum, SIG_DFL);
2316
2317 EV_FREQUENT_CHECK;
2189} 2318}
2190 2319
2191void 2320void
2192ev_child_start (EV_P_ ev_child *w) 2321ev_child_start (EV_P_ ev_child *w)
2193{ 2322{
2195 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2324 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2196#endif 2325#endif
2197 if (expect_false (ev_is_active (w))) 2326 if (expect_false (ev_is_active (w)))
2198 return; 2327 return;
2199 2328
2329 EV_FREQUENT_CHECK;
2330
2200 ev_start (EV_A_ (W)w, 1); 2331 ev_start (EV_A_ (W)w, 1);
2201 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2332 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2333
2334 EV_FREQUENT_CHECK;
2202} 2335}
2203 2336
2204void 2337void
2205ev_child_stop (EV_P_ ev_child *w) 2338ev_child_stop (EV_P_ ev_child *w)
2206{ 2339{
2207 clear_pending (EV_A_ (W)w); 2340 clear_pending (EV_A_ (W)w);
2208 if (expect_false (!ev_is_active (w))) 2341 if (expect_false (!ev_is_active (w)))
2209 return; 2342 return;
2210 2343
2344 EV_FREQUENT_CHECK;
2345
2211 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2346 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2212 ev_stop (EV_A_ (W)w); 2347 ev_stop (EV_A_ (W)w);
2348
2349 EV_FREQUENT_CHECK;
2213} 2350}
2214 2351
2215#if EV_STAT_ENABLE 2352#if EV_STAT_ENABLE
2216 2353
2217# ifdef _WIN32 2354# ifdef _WIN32
2445 else 2582 else
2446#endif 2583#endif
2447 ev_timer_start (EV_A_ &w->timer); 2584 ev_timer_start (EV_A_ &w->timer);
2448 2585
2449 ev_start (EV_A_ (W)w, 1); 2586 ev_start (EV_A_ (W)w, 1);
2587
2588 EV_FREQUENT_CHECK;
2450} 2589}
2451 2590
2452void 2591void
2453ev_stat_stop (EV_P_ ev_stat *w) 2592ev_stat_stop (EV_P_ ev_stat *w)
2454{ 2593{
2455 clear_pending (EV_A_ (W)w); 2594 clear_pending (EV_A_ (W)w);
2456 if (expect_false (!ev_is_active (w))) 2595 if (expect_false (!ev_is_active (w)))
2457 return; 2596 return;
2458 2597
2598 EV_FREQUENT_CHECK;
2599
2459#if EV_USE_INOTIFY 2600#if EV_USE_INOTIFY
2460 infy_del (EV_A_ w); 2601 infy_del (EV_A_ w);
2461#endif 2602#endif
2462 ev_timer_stop (EV_A_ &w->timer); 2603 ev_timer_stop (EV_A_ &w->timer);
2463 2604
2464 ev_stop (EV_A_ (W)w); 2605 ev_stop (EV_A_ (W)w);
2606
2607 EV_FREQUENT_CHECK;
2465} 2608}
2466#endif 2609#endif
2467 2610
2468#if EV_IDLE_ENABLE 2611#if EV_IDLE_ENABLE
2469void 2612void
2471{ 2614{
2472 if (expect_false (ev_is_active (w))) 2615 if (expect_false (ev_is_active (w)))
2473 return; 2616 return;
2474 2617
2475 pri_adjust (EV_A_ (W)w); 2618 pri_adjust (EV_A_ (W)w);
2619
2620 EV_FREQUENT_CHECK;
2476 2621
2477 { 2622 {
2478 int active = ++idlecnt [ABSPRI (w)]; 2623 int active = ++idlecnt [ABSPRI (w)];
2479 2624
2480 ++idleall; 2625 ++idleall;
2481 ev_start (EV_A_ (W)w, active); 2626 ev_start (EV_A_ (W)w, active);
2482 2627
2483 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2628 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2484 idles [ABSPRI (w)][active - 1] = w; 2629 idles [ABSPRI (w)][active - 1] = w;
2485 } 2630 }
2631
2632 EV_FREQUENT_CHECK;
2486} 2633}
2487 2634
2488void 2635void
2489ev_idle_stop (EV_P_ ev_idle *w) 2636ev_idle_stop (EV_P_ ev_idle *w)
2490{ 2637{
2491 clear_pending (EV_A_ (W)w); 2638 clear_pending (EV_A_ (W)w);
2492 if (expect_false (!ev_is_active (w))) 2639 if (expect_false (!ev_is_active (w)))
2493 return; 2640 return;
2494 2641
2642 EV_FREQUENT_CHECK;
2643
2495 { 2644 {
2496 int active = ev_active (w); 2645 int active = ev_active (w);
2497 2646
2498 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2647 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2499 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2648 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2500 2649
2501 ev_stop (EV_A_ (W)w); 2650 ev_stop (EV_A_ (W)w);
2502 --idleall; 2651 --idleall;
2503 } 2652 }
2653
2654 EV_FREQUENT_CHECK;
2504} 2655}
2505#endif 2656#endif
2506 2657
2507void 2658void
2508ev_prepare_start (EV_P_ ev_prepare *w) 2659ev_prepare_start (EV_P_ ev_prepare *w)
2509{ 2660{
2510 if (expect_false (ev_is_active (w))) 2661 if (expect_false (ev_is_active (w)))
2511 return; 2662 return;
2663
2664 EV_FREQUENT_CHECK;
2512 2665
2513 ev_start (EV_A_ (W)w, ++preparecnt); 2666 ev_start (EV_A_ (W)w, ++preparecnt);
2514 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2667 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2515 prepares [preparecnt - 1] = w; 2668 prepares [preparecnt - 1] = w;
2669
2670 EV_FREQUENT_CHECK;
2516} 2671}
2517 2672
2518void 2673void
2519ev_prepare_stop (EV_P_ ev_prepare *w) 2674ev_prepare_stop (EV_P_ ev_prepare *w)
2520{ 2675{
2521 clear_pending (EV_A_ (W)w); 2676 clear_pending (EV_A_ (W)w);
2522 if (expect_false (!ev_is_active (w))) 2677 if (expect_false (!ev_is_active (w)))
2523 return; 2678 return;
2524 2679
2680 EV_FREQUENT_CHECK;
2681
2525 { 2682 {
2526 int active = ev_active (w); 2683 int active = ev_active (w);
2527 2684
2528 prepares [active - 1] = prepares [--preparecnt]; 2685 prepares [active - 1] = prepares [--preparecnt];
2529 ev_active (prepares [active - 1]) = active; 2686 ev_active (prepares [active - 1]) = active;
2530 } 2687 }
2531 2688
2532 ev_stop (EV_A_ (W)w); 2689 ev_stop (EV_A_ (W)w);
2690
2691 EV_FREQUENT_CHECK;
2533} 2692}
2534 2693
2535void 2694void
2536ev_check_start (EV_P_ ev_check *w) 2695ev_check_start (EV_P_ ev_check *w)
2537{ 2696{
2538 if (expect_false (ev_is_active (w))) 2697 if (expect_false (ev_is_active (w)))
2539 return; 2698 return;
2699
2700 EV_FREQUENT_CHECK;
2540 2701
2541 ev_start (EV_A_ (W)w, ++checkcnt); 2702 ev_start (EV_A_ (W)w, ++checkcnt);
2542 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2703 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2543 checks [checkcnt - 1] = w; 2704 checks [checkcnt - 1] = w;
2705
2706 EV_FREQUENT_CHECK;
2544} 2707}
2545 2708
2546void 2709void
2547ev_check_stop (EV_P_ ev_check *w) 2710ev_check_stop (EV_P_ ev_check *w)
2548{ 2711{
2549 clear_pending (EV_A_ (W)w); 2712 clear_pending (EV_A_ (W)w);
2550 if (expect_false (!ev_is_active (w))) 2713 if (expect_false (!ev_is_active (w)))
2551 return; 2714 return;
2552 2715
2716 EV_FREQUENT_CHECK;
2717
2553 { 2718 {
2554 int active = ev_active (w); 2719 int active = ev_active (w);
2555 2720
2556 checks [active - 1] = checks [--checkcnt]; 2721 checks [active - 1] = checks [--checkcnt];
2557 ev_active (checks [active - 1]) = active; 2722 ev_active (checks [active - 1]) = active;
2558 } 2723 }
2559 2724
2560 ev_stop (EV_A_ (W)w); 2725 ev_stop (EV_A_ (W)w);
2726
2727 EV_FREQUENT_CHECK;
2561} 2728}
2562 2729
2563#if EV_EMBED_ENABLE 2730#if EV_EMBED_ENABLE
2564void noinline 2731void noinline
2565ev_embed_sweep (EV_P_ ev_embed *w) 2732ev_embed_sweep (EV_P_ ev_embed *w)
2612 struct ev_loop *loop = w->other; 2779 struct ev_loop *loop = w->other;
2613 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2780 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2614 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); 2781 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2615 } 2782 }
2616 2783
2784 EV_FREQUENT_CHECK;
2785
2617 ev_set_priority (&w->io, ev_priority (w)); 2786 ev_set_priority (&w->io, ev_priority (w));
2618 ev_io_start (EV_A_ &w->io); 2787 ev_io_start (EV_A_ &w->io);
2619 2788
2620 ev_prepare_init (&w->prepare, embed_prepare_cb); 2789 ev_prepare_init (&w->prepare, embed_prepare_cb);
2621 ev_set_priority (&w->prepare, EV_MINPRI); 2790 ev_set_priority (&w->prepare, EV_MINPRI);
2622 ev_prepare_start (EV_A_ &w->prepare); 2791 ev_prepare_start (EV_A_ &w->prepare);
2623 2792
2624 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2793 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2625 2794
2626 ev_start (EV_A_ (W)w, 1); 2795 ev_start (EV_A_ (W)w, 1);
2796
2797 EV_FREQUENT_CHECK;
2627} 2798}
2628 2799
2629void 2800void
2630ev_embed_stop (EV_P_ ev_embed *w) 2801ev_embed_stop (EV_P_ ev_embed *w)
2631{ 2802{
2632 clear_pending (EV_A_ (W)w); 2803 clear_pending (EV_A_ (W)w);
2633 if (expect_false (!ev_is_active (w))) 2804 if (expect_false (!ev_is_active (w)))
2634 return; 2805 return;
2635 2806
2807 EV_FREQUENT_CHECK;
2808
2636 ev_io_stop (EV_A_ &w->io); 2809 ev_io_stop (EV_A_ &w->io);
2637 ev_prepare_stop (EV_A_ &w->prepare); 2810 ev_prepare_stop (EV_A_ &w->prepare);
2638 2811
2639 ev_stop (EV_A_ (W)w); 2812 ev_stop (EV_A_ (W)w);
2813
2814 EV_FREQUENT_CHECK;
2640} 2815}
2641#endif 2816#endif
2642 2817
2643#if EV_FORK_ENABLE 2818#if EV_FORK_ENABLE
2644void 2819void
2645ev_fork_start (EV_P_ ev_fork *w) 2820ev_fork_start (EV_P_ ev_fork *w)
2646{ 2821{
2647 if (expect_false (ev_is_active (w))) 2822 if (expect_false (ev_is_active (w)))
2648 return; 2823 return;
2824
2825 EV_FREQUENT_CHECK;
2649 2826
2650 ev_start (EV_A_ (W)w, ++forkcnt); 2827 ev_start (EV_A_ (W)w, ++forkcnt);
2651 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2828 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2652 forks [forkcnt - 1] = w; 2829 forks [forkcnt - 1] = w;
2830
2831 EV_FREQUENT_CHECK;
2653} 2832}
2654 2833
2655void 2834void
2656ev_fork_stop (EV_P_ ev_fork *w) 2835ev_fork_stop (EV_P_ ev_fork *w)
2657{ 2836{
2658 clear_pending (EV_A_ (W)w); 2837 clear_pending (EV_A_ (W)w);
2659 if (expect_false (!ev_is_active (w))) 2838 if (expect_false (!ev_is_active (w)))
2660 return; 2839 return;
2661 2840
2841 EV_FREQUENT_CHECK;
2842
2662 { 2843 {
2663 int active = ev_active (w); 2844 int active = ev_active (w);
2664 2845
2665 forks [active - 1] = forks [--forkcnt]; 2846 forks [active - 1] = forks [--forkcnt];
2666 ev_active (forks [active - 1]) = active; 2847 ev_active (forks [active - 1]) = active;
2667 } 2848 }
2668 2849
2669 ev_stop (EV_A_ (W)w); 2850 ev_stop (EV_A_ (W)w);
2851
2852 EV_FREQUENT_CHECK;
2670} 2853}
2671#endif 2854#endif
2672 2855
2673#if EV_ASYNC_ENABLE 2856#if EV_ASYNC_ENABLE
2674void 2857void
2676{ 2859{
2677 if (expect_false (ev_is_active (w))) 2860 if (expect_false (ev_is_active (w)))
2678 return; 2861 return;
2679 2862
2680 evpipe_init (EV_A); 2863 evpipe_init (EV_A);
2864
2865 EV_FREQUENT_CHECK;
2681 2866
2682 ev_start (EV_A_ (W)w, ++asynccnt); 2867 ev_start (EV_A_ (W)w, ++asynccnt);
2683 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2868 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2684 asyncs [asynccnt - 1] = w; 2869 asyncs [asynccnt - 1] = w;
2870
2871 EV_FREQUENT_CHECK;
2685} 2872}
2686 2873
2687void 2874void
2688ev_async_stop (EV_P_ ev_async *w) 2875ev_async_stop (EV_P_ ev_async *w)
2689{ 2876{
2690 clear_pending (EV_A_ (W)w); 2877 clear_pending (EV_A_ (W)w);
2691 if (expect_false (!ev_is_active (w))) 2878 if (expect_false (!ev_is_active (w)))
2692 return; 2879 return;
2693 2880
2881 EV_FREQUENT_CHECK;
2882
2694 { 2883 {
2695 int active = ev_active (w); 2884 int active = ev_active (w);
2696 2885
2697 asyncs [active - 1] = asyncs [--asynccnt]; 2886 asyncs [active - 1] = asyncs [--asynccnt];
2698 ev_active (asyncs [active - 1]) = active; 2887 ev_active (asyncs [active - 1]) = active;
2699 } 2888 }
2700 2889
2701 ev_stop (EV_A_ (W)w); 2890 ev_stop (EV_A_ (W)w);
2891
2892 EV_FREQUENT_CHECK;
2702} 2893}
2703 2894
2704void 2895void
2705ev_async_send (EV_P_ ev_async *w) 2896ev_async_send (EV_P_ ev_async *w)
2706{ 2897{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines