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

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

Diff Legend

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