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.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
822#define DHEAP 4
773#define HEAP0 3 /* 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
774 906
775/* towards the root */ 907/* towards the root */
776void inline_speed 908void inline_speed
777upheap (WT *heap, int k) 909upheap (ANHE *heap, int k)
778{ 910{
779 WT w = heap [k]; 911 ANHE he = heap [k];
780 912
781 for (;;) 913 for (;;)
782 { 914 {
783 int p = ((k - HEAP0 - 1) / 4) + HEAP0; 915 int p = HPARENT (k);
784 916
785 if (p >= HEAP0 || heap [p]->at <= w->at) 917 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
786 break; 918 break;
787 919
788 heap [k] = heap [p]; 920 heap [k] = heap [p];
789 ev_active (heap [k]) = k; 921 ev_active (ANHE_w (heap [k])) = k;
790 k = p; 922 k = p;
791 } 923 }
792 924
793 heap [k] = w; 925 heap [k] = he;
794 ev_active (heap [k]) = k; 926 ev_active (ANHE_w (he)) = k;
795} 927}
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 928
900void inline_size 929void inline_size
901adjustheap (WT *heap, int N, int k) 930adjustheap (ANHE *heap, int N, int k)
902{ 931{
932 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
903 upheap (heap, k); 933 upheap (heap, k);
934 else
904 downheap (heap, N, k); 935 downheap (heap, N, k);
905} 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
906 963
907/*****************************************************************************/ 964/*****************************************************************************/
908 965
909typedef struct 966typedef struct
910{ 967{
… …
1454void 1511void
1455ev_loop_fork (EV_P) 1512ev_loop_fork (EV_P)
1456{ 1513{
1457 postfork = 1; /* must be in line with ev_default_fork */ 1514 postfork = 1; /* must be in line with ev_default_fork */
1458} 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
1459#endif 1550#endif
1460 1551
1461#if EV_MULTIPLICITY 1552#if EV_MULTIPLICITY
1462struct ev_loop * 1553struct ev_loop *
1463ev_default_loop_init (unsigned int flags) 1554ev_default_loop_init (unsigned int flags)
… …
1529void inline_speed 1620void inline_speed
1530call_pending (EV_P) 1621call_pending (EV_P)
1531{ 1622{
1532 int pri; 1623 int pri;
1533 1624
1625 EV_FREQUENT_CHECK;
1626
1534 for (pri = NUMPRI; pri--; ) 1627 for (pri = NUMPRI; pri--; )
1535 while (pendingcnt [pri]) 1628 while (pendingcnt [pri])
1536 { 1629 {
1537 ANPENDING *p = pendings [pri] + --pendingcnt [pri]; 1630 ANPENDING *p = pendings [pri] + --pendingcnt [pri];
1538 1631
… …
1542 1635
1543 p->w->pending = 0; 1636 p->w->pending = 0;
1544 EV_CB_INVOKE (p->w, p->events); 1637 EV_CB_INVOKE (p->w, p->events);
1545 } 1638 }
1546 } 1639 }
1640
1641 EV_FREQUENT_CHECK;
1547} 1642}
1548 1643
1549#if EV_IDLE_ENABLE 1644#if EV_IDLE_ENABLE
1550void inline_size 1645void inline_size
1551idle_reify (EV_P) 1646idle_reify (EV_P)
… …
1570#endif 1665#endif
1571 1666
1572void inline_size 1667void inline_size
1573timers_reify (EV_P) 1668timers_reify (EV_P)
1574{ 1669{
1670 EV_FREQUENT_CHECK;
1671
1575 while (timercnt && ev_at (timers [HEAP0]) <= mn_now) 1672 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1576 { 1673 {
1577 ev_timer *w = (ev_timer *)timers [HEAP0]; 1674 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1578 1675
1579 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1676 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1580 1677
1581 /* first reschedule or stop timer */ 1678 /* first reschedule or stop timer */
1582 if (w->repeat) 1679 if (w->repeat)
1583 { 1680 {
1584 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1585
1586 ev_at (w) += w->repeat; 1681 ev_at (w) += w->repeat;
1587 if (ev_at (w) < mn_now) 1682 if (ev_at (w) < mn_now)
1588 ev_at (w) = mn_now; 1683 ev_at (w) = mn_now;
1589 1684
1685 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1686
1687 ANHE_at_cache (timers [HEAP0]);
1590 downheap (timers, timercnt, HEAP0); 1688 downheap (timers, timercnt, HEAP0);
1591 } 1689 }
1592 else 1690 else
1593 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1691 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1594 1692
1693 EV_FREQUENT_CHECK;
1595 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); 1694 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1596 } 1695 }
1597} 1696}
1598 1697
1599#if EV_PERIODIC_ENABLE 1698#if EV_PERIODIC_ENABLE
1600void inline_size 1699void inline_size
1601periodics_reify (EV_P) 1700periodics_reify (EV_P)
1602{ 1701{
1702 EV_FREQUENT_CHECK;
1603 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) 1703 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1604 { 1704 {
1605 ev_periodic *w = (ev_periodic *)periodics [HEAP0]; 1705 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1606 1706
1607 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ 1707 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1608 1708
1609 /* first reschedule or stop timer */ 1709 /* first reschedule or stop timer */
1610 if (w->reschedule_cb) 1710 if (w->reschedule_cb)
1611 { 1711 {
1612 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); 1712 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1713
1613 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]);
1614 downheap (periodics, periodiccnt, 1); 1717 downheap (periodics, periodiccnt, HEAP0);
1718 EV_FREQUENT_CHECK;
1615 } 1719 }
1616 else if (w->interval) 1720 else if (w->interval)
1617 { 1721 {
1618 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 */
1619 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1725 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)); 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]);
1621 downheap (periodics, periodiccnt, HEAP0); 1737 downheap (periodics, periodiccnt, HEAP0);
1622 } 1738 }
1623 else 1739 else
1624 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1740 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1625 1741
1742 EV_FREQUENT_CHECK;
1626 ev_feed_event (EV_A_ (W)w, EV_PERIODIC); 1743 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1627 } 1744 }
1628} 1745}
1629 1746
1630static void noinline 1747static void noinline
1631periodics_reschedule (EV_P) 1748periodics_reschedule (EV_P)
1632{ 1749{
1633 int i; 1750 int i;
1634 1751
1635 /* adjust periodics after time jump */ 1752 /* adjust periodics after time jump */
1636 for (i = 1; i <= periodiccnt; ++i) 1753 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1637 { 1754 {
1638 ev_periodic *w = (ev_periodic *)periodics [i]; 1755 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1639 1756
1640 if (w->reschedule_cb) 1757 if (w->reschedule_cb)
1641 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1758 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1642 else if (w->interval) 1759 else if (w->interval)
1643 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;
1644 }
1645 1761
1646 /* now rebuild the heap */ 1762 ANHE_at_cache (periodics [i]);
1647 for (i = periodiccnt >> 1; --i; ) 1763 }
1764
1648 downheap (periodics, periodiccnt, i + HEAP0); 1765 reheap (periodics, periodiccnt);
1649} 1766}
1650#endif 1767#endif
1651 1768
1652void inline_speed 1769void inline_speed
1653time_update (EV_P_ ev_tstamp max_block) 1770time_update (EV_P_ ev_tstamp max_block)
… …
1707 { 1824 {
1708#if EV_PERIODIC_ENABLE 1825#if EV_PERIODIC_ENABLE
1709 periodics_reschedule (EV_A); 1826 periodics_reschedule (EV_A);
1710#endif 1827#endif
1711 /* 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 */
1712 for (i = 1; i <= timercnt; ++i) 1829 for (i = 0; i < timercnt; ++i)
1713 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 }
1714 } 1835 }
1715 1836
1716 mn_now = ev_rt_now; 1837 mn_now = ev_rt_now;
1717 } 1838 }
1718} 1839}
… …
1788 1909
1789 waittime = MAX_BLOCKTIME; 1910 waittime = MAX_BLOCKTIME;
1790 1911
1791 if (timercnt) 1912 if (timercnt)
1792 { 1913 {
1793 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; 1914 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1794 if (waittime > to) waittime = to; 1915 if (waittime > to) waittime = to;
1795 } 1916 }
1796 1917
1797#if EV_PERIODIC_ENABLE 1918#if EV_PERIODIC_ENABLE
1798 if (periodiccnt) 1919 if (periodiccnt)
1799 { 1920 {
1800 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;
1801 if (waittime > to) waittime = to; 1922 if (waittime > to) waittime = to;
1802 } 1923 }
1803#endif 1924#endif
1804 1925
1805 if (expect_false (waittime < timeout_blocktime)) 1926 if (expect_false (waittime < timeout_blocktime))
… …
1942 if (expect_false (ev_is_active (w))) 2063 if (expect_false (ev_is_active (w)))
1943 return; 2064 return;
1944 2065
1945 assert (("ev_io_start called with negative fd", fd >= 0)); 2066 assert (("ev_io_start called with negative fd", fd >= 0));
1946 2067
2068 EV_FREQUENT_CHECK;
2069
1947 ev_start (EV_A_ (W)w, 1); 2070 ev_start (EV_A_ (W)w, 1);
1948 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2071 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1949 wlist_add (&anfds[fd].head, (WL)w); 2072 wlist_add (&anfds[fd].head, (WL)w);
1950 2073
1951 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2074 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1952 w->events &= ~EV_IOFDSET; 2075 w->events &= ~EV_IOFDSET;
2076
2077 EV_FREQUENT_CHECK;
1953} 2078}
1954 2079
1955void noinline 2080void noinline
1956ev_io_stop (EV_P_ ev_io *w) 2081ev_io_stop (EV_P_ ev_io *w)
1957{ 2082{
1958 clear_pending (EV_A_ (W)w); 2083 clear_pending (EV_A_ (W)w);
1959 if (expect_false (!ev_is_active (w))) 2084 if (expect_false (!ev_is_active (w)))
1960 return; 2085 return;
1961 2086
1962 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;
1963 2090
1964 wlist_del (&anfds[w->fd].head, (WL)w); 2091 wlist_del (&anfds[w->fd].head, (WL)w);
1965 ev_stop (EV_A_ (W)w); 2092 ev_stop (EV_A_ (W)w);
1966 2093
1967 fd_change (EV_A_ w->fd, 1); 2094 fd_change (EV_A_ w->fd, 1);
2095
2096 EV_FREQUENT_CHECK;
1968} 2097}
1969 2098
1970void noinline 2099void noinline
1971ev_timer_start (EV_P_ ev_timer *w) 2100ev_timer_start (EV_P_ ev_timer *w)
1972{ 2101{
… …
1975 2104
1976 ev_at (w) += mn_now; 2105 ev_at (w) += mn_now;
1977 2106
1978 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.));
1979 2108
2109 EV_FREQUENT_CHECK;
2110
2111 ++timercnt;
1980 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2112 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1981 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); 2113 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1982 timers [ev_active (w)] = (WT)w; 2114 ANHE_w (timers [ev_active (w)]) = (WT)w;
2115 ANHE_at_cache (timers [ev_active (w)]);
1983 upheap (timers, ev_active (w)); 2116 upheap (timers, ev_active (w));
1984 2117
2118 EV_FREQUENT_CHECK;
2119
1985 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2120 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1986} 2121}
1987 2122
1988void noinline 2123void noinline
1989ev_timer_stop (EV_P_ ev_timer *w) 2124ev_timer_stop (EV_P_ ev_timer *w)
1990{ 2125{
1991 clear_pending (EV_A_ (W)w); 2126 clear_pending (EV_A_ (W)w);
1992 if (expect_false (!ev_is_active (w))) 2127 if (expect_false (!ev_is_active (w)))
1993 return; 2128 return;
1994 2129
2130 EV_FREQUENT_CHECK;
2131
1995 { 2132 {
1996 int active = ev_active (w); 2133 int active = ev_active (w);
1997 2134
1998 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2135 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
1999 2136
2137 --timercnt;
2138
2000 if (expect_true (active < timercnt + HEAP0 - 1)) 2139 if (expect_true (active < timercnt + HEAP0))
2001 { 2140 {
2002 timers [active] = timers [timercnt + HEAP0 - 1]; 2141 timers [active] = timers [timercnt + HEAP0];
2003 adjustheap (timers, timercnt, active); 2142 adjustheap (timers, timercnt, active);
2004 } 2143 }
2005
2006 --timercnt;
2007 } 2144 }
2145
2146 EV_FREQUENT_CHECK;
2008 2147
2009 ev_at (w) -= mn_now; 2148 ev_at (w) -= mn_now;
2010 2149
2011 ev_stop (EV_A_ (W)w); 2150 ev_stop (EV_A_ (W)w);
2012} 2151}
2013 2152
2014void noinline 2153void noinline
2015ev_timer_again (EV_P_ ev_timer *w) 2154ev_timer_again (EV_P_ ev_timer *w)
2016{ 2155{
2156 EV_FREQUENT_CHECK;
2157
2017 if (ev_is_active (w)) 2158 if (ev_is_active (w))
2018 { 2159 {
2019 if (w->repeat) 2160 if (w->repeat)
2020 { 2161 {
2021 ev_at (w) = mn_now + w->repeat; 2162 ev_at (w) = mn_now + w->repeat;
2163 ANHE_at_cache (timers [ev_active (w)]);
2022 adjustheap (timers, timercnt, ev_active (w)); 2164 adjustheap (timers, timercnt, ev_active (w));
2023 } 2165 }
2024 else 2166 else
2025 ev_timer_stop (EV_A_ w); 2167 ev_timer_stop (EV_A_ w);
2026 } 2168 }
2027 else if (w->repeat) 2169 else if (w->repeat)
2028 { 2170 {
2029 ev_at (w) = w->repeat; 2171 ev_at (w) = w->repeat;
2030 ev_timer_start (EV_A_ w); 2172 ev_timer_start (EV_A_ w);
2031 } 2173 }
2174
2175 EV_FREQUENT_CHECK;
2032} 2176}
2033 2177
2034#if EV_PERIODIC_ENABLE 2178#if EV_PERIODIC_ENABLE
2035void noinline 2179void noinline
2036ev_periodic_start (EV_P_ ev_periodic *w) 2180ev_periodic_start (EV_P_ ev_periodic *w)
… …
2047 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;
2048 } 2192 }
2049 else 2193 else
2050 ev_at (w) = w->offset; 2194 ev_at (w) = w->offset;
2051 2195
2196 EV_FREQUENT_CHECK;
2197
2198 ++periodiccnt;
2052 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2199 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2053 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); 2200 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2054 periodics [ev_active (w)] = (WT)w; 2201 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2202 ANHE_at_cache (periodics [ev_active (w)]);
2055 upheap (periodics, ev_active (w)); 2203 upheap (periodics, ev_active (w));
2056 2204
2205 EV_FREQUENT_CHECK;
2206
2057 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2207 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2058} 2208}
2059 2209
2060void noinline 2210void noinline
2061ev_periodic_stop (EV_P_ ev_periodic *w) 2211ev_periodic_stop (EV_P_ ev_periodic *w)
2062{ 2212{
2063 clear_pending (EV_A_ (W)w); 2213 clear_pending (EV_A_ (W)w);
2064 if (expect_false (!ev_is_active (w))) 2214 if (expect_false (!ev_is_active (w)))
2065 return; 2215 return;
2066 2216
2217 EV_FREQUENT_CHECK;
2218
2067 { 2219 {
2068 int active = ev_active (w); 2220 int active = ev_active (w);
2069 2221
2070 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2222 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2071 2223
2224 --periodiccnt;
2225
2072 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2226 if (expect_true (active < periodiccnt + HEAP0))
2073 { 2227 {
2074 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2228 periodics [active] = periodics [periodiccnt + HEAP0];
2075 adjustheap (periodics, periodiccnt, active); 2229 adjustheap (periodics, periodiccnt, active);
2076 } 2230 }
2077
2078 --periodiccnt;
2079 } 2231 }
2232
2233 EV_FREQUENT_CHECK;
2080 2234
2081 ev_stop (EV_A_ (W)w); 2235 ev_stop (EV_A_ (W)w);
2082} 2236}
2083 2237
2084void noinline 2238void noinline
… …
2104 return; 2258 return;
2105 2259
2106 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));
2107 2261
2108 evpipe_init (EV_A); 2262 evpipe_init (EV_A);
2263
2264 EV_FREQUENT_CHECK;
2109 2265
2110 { 2266 {
2111#ifndef _WIN32 2267#ifndef _WIN32
2112 sigset_t full, prev; 2268 sigset_t full, prev;
2113 sigfillset (&full); 2269 sigfillset (&full);
… …
2134 sigfillset (&sa.sa_mask); 2290 sigfillset (&sa.sa_mask);
2135 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 */
2136 sigaction (w->signum, &sa, 0); 2292 sigaction (w->signum, &sa, 0);
2137#endif 2293#endif
2138 } 2294 }
2295
2296 EV_FREQUENT_CHECK;
2139} 2297}
2140 2298
2141void noinline 2299void noinline
2142ev_signal_stop (EV_P_ ev_signal *w) 2300ev_signal_stop (EV_P_ ev_signal *w)
2143{ 2301{
2144 clear_pending (EV_A_ (W)w); 2302 clear_pending (EV_A_ (W)w);
2145 if (expect_false (!ev_is_active (w))) 2303 if (expect_false (!ev_is_active (w)))
2146 return; 2304 return;
2147 2305
2306 EV_FREQUENT_CHECK;
2307
2148 wlist_del (&signals [w->signum - 1].head, (WL)w); 2308 wlist_del (&signals [w->signum - 1].head, (WL)w);
2149 ev_stop (EV_A_ (W)w); 2309 ev_stop (EV_A_ (W)w);
2150 2310
2151 if (!signals [w->signum - 1].head) 2311 if (!signals [w->signum - 1].head)
2152 signal (w->signum, SIG_DFL); 2312 signal (w->signum, SIG_DFL);
2313
2314 EV_FREQUENT_CHECK;
2153} 2315}
2154 2316
2155void 2317void
2156ev_child_start (EV_P_ ev_child *w) 2318ev_child_start (EV_P_ ev_child *w)
2157{ 2319{
… …
2159 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));
2160#endif 2322#endif
2161 if (expect_false (ev_is_active (w))) 2323 if (expect_false (ev_is_active (w)))
2162 return; 2324 return;
2163 2325
2326 EV_FREQUENT_CHECK;
2327
2164 ev_start (EV_A_ (W)w, 1); 2328 ev_start (EV_A_ (W)w, 1);
2165 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;
2166} 2332}
2167 2333
2168void 2334void
2169ev_child_stop (EV_P_ ev_child *w) 2335ev_child_stop (EV_P_ ev_child *w)
2170{ 2336{
2171 clear_pending (EV_A_ (W)w); 2337 clear_pending (EV_A_ (W)w);
2172 if (expect_false (!ev_is_active (w))) 2338 if (expect_false (!ev_is_active (w)))
2173 return; 2339 return;
2174 2340
2341 EV_FREQUENT_CHECK;
2342
2175 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2343 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2176 ev_stop (EV_A_ (W)w); 2344 ev_stop (EV_A_ (W)w);
2345
2346 EV_FREQUENT_CHECK;
2177} 2347}
2178 2348
2179#if EV_STAT_ENABLE 2349#if EV_STAT_ENABLE
2180 2350
2181# ifdef _WIN32 2351# ifdef _WIN32
… …
2409 else 2579 else
2410#endif 2580#endif
2411 ev_timer_start (EV_A_ &w->timer); 2581 ev_timer_start (EV_A_ &w->timer);
2412 2582
2413 ev_start (EV_A_ (W)w, 1); 2583 ev_start (EV_A_ (W)w, 1);
2584
2585 EV_FREQUENT_CHECK;
2414} 2586}
2415 2587
2416void 2588void
2417ev_stat_stop (EV_P_ ev_stat *w) 2589ev_stat_stop (EV_P_ ev_stat *w)
2418{ 2590{
2419 clear_pending (EV_A_ (W)w); 2591 clear_pending (EV_A_ (W)w);
2420 if (expect_false (!ev_is_active (w))) 2592 if (expect_false (!ev_is_active (w)))
2421 return; 2593 return;
2422 2594
2595 EV_FREQUENT_CHECK;
2596
2423#if EV_USE_INOTIFY 2597#if EV_USE_INOTIFY
2424 infy_del (EV_A_ w); 2598 infy_del (EV_A_ w);
2425#endif 2599#endif
2426 ev_timer_stop (EV_A_ &w->timer); 2600 ev_timer_stop (EV_A_ &w->timer);
2427 2601
2428 ev_stop (EV_A_ (W)w); 2602 ev_stop (EV_A_ (W)w);
2603
2604 EV_FREQUENT_CHECK;
2429} 2605}
2430#endif 2606#endif
2431 2607
2432#if EV_IDLE_ENABLE 2608#if EV_IDLE_ENABLE
2433void 2609void
… …
2435{ 2611{
2436 if (expect_false (ev_is_active (w))) 2612 if (expect_false (ev_is_active (w)))
2437 return; 2613 return;
2438 2614
2439 pri_adjust (EV_A_ (W)w); 2615 pri_adjust (EV_A_ (W)w);
2616
2617 EV_FREQUENT_CHECK;
2440 2618
2441 { 2619 {
2442 int active = ++idlecnt [ABSPRI (w)]; 2620 int active = ++idlecnt [ABSPRI (w)];
2443 2621
2444 ++idleall; 2622 ++idleall;
2445 ev_start (EV_A_ (W)w, active); 2623 ev_start (EV_A_ (W)w, active);
2446 2624
2447 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);
2448 idles [ABSPRI (w)][active - 1] = w; 2626 idles [ABSPRI (w)][active - 1] = w;
2449 } 2627 }
2628
2629 EV_FREQUENT_CHECK;
2450} 2630}
2451 2631
2452void 2632void
2453ev_idle_stop (EV_P_ ev_idle *w) 2633ev_idle_stop (EV_P_ ev_idle *w)
2454{ 2634{
2455 clear_pending (EV_A_ (W)w); 2635 clear_pending (EV_A_ (W)w);
2456 if (expect_false (!ev_is_active (w))) 2636 if (expect_false (!ev_is_active (w)))
2457 return; 2637 return;
2458 2638
2639 EV_FREQUENT_CHECK;
2640
2459 { 2641 {
2460 int active = ev_active (w); 2642 int active = ev_active (w);
2461 2643
2462 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2644 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2463 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2645 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2464 2646
2465 ev_stop (EV_A_ (W)w); 2647 ev_stop (EV_A_ (W)w);
2466 --idleall; 2648 --idleall;
2467 } 2649 }
2650
2651 EV_FREQUENT_CHECK;
2468} 2652}
2469#endif 2653#endif
2470 2654
2471void 2655void
2472ev_prepare_start (EV_P_ ev_prepare *w) 2656ev_prepare_start (EV_P_ ev_prepare *w)
2473{ 2657{
2474 if (expect_false (ev_is_active (w))) 2658 if (expect_false (ev_is_active (w)))
2475 return; 2659 return;
2660
2661 EV_FREQUENT_CHECK;
2476 2662
2477 ev_start (EV_A_ (W)w, ++preparecnt); 2663 ev_start (EV_A_ (W)w, ++preparecnt);
2478 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2664 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2479 prepares [preparecnt - 1] = w; 2665 prepares [preparecnt - 1] = w;
2666
2667 EV_FREQUENT_CHECK;
2480} 2668}
2481 2669
2482void 2670void
2483ev_prepare_stop (EV_P_ ev_prepare *w) 2671ev_prepare_stop (EV_P_ ev_prepare *w)
2484{ 2672{
2485 clear_pending (EV_A_ (W)w); 2673 clear_pending (EV_A_ (W)w);
2486 if (expect_false (!ev_is_active (w))) 2674 if (expect_false (!ev_is_active (w)))
2487 return; 2675 return;
2488 2676
2677 EV_FREQUENT_CHECK;
2678
2489 { 2679 {
2490 int active = ev_active (w); 2680 int active = ev_active (w);
2491 2681
2492 prepares [active - 1] = prepares [--preparecnt]; 2682 prepares [active - 1] = prepares [--preparecnt];
2493 ev_active (prepares [active - 1]) = active; 2683 ev_active (prepares [active - 1]) = active;
2494 } 2684 }
2495 2685
2496 ev_stop (EV_A_ (W)w); 2686 ev_stop (EV_A_ (W)w);
2687
2688 EV_FREQUENT_CHECK;
2497} 2689}
2498 2690
2499void 2691void
2500ev_check_start (EV_P_ ev_check *w) 2692ev_check_start (EV_P_ ev_check *w)
2501{ 2693{
2502 if (expect_false (ev_is_active (w))) 2694 if (expect_false (ev_is_active (w)))
2503 return; 2695 return;
2696
2697 EV_FREQUENT_CHECK;
2504 2698
2505 ev_start (EV_A_ (W)w, ++checkcnt); 2699 ev_start (EV_A_ (W)w, ++checkcnt);
2506 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2700 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2507 checks [checkcnt - 1] = w; 2701 checks [checkcnt - 1] = w;
2702
2703 EV_FREQUENT_CHECK;
2508} 2704}
2509 2705
2510void 2706void
2511ev_check_stop (EV_P_ ev_check *w) 2707ev_check_stop (EV_P_ ev_check *w)
2512{ 2708{
2513 clear_pending (EV_A_ (W)w); 2709 clear_pending (EV_A_ (W)w);
2514 if (expect_false (!ev_is_active (w))) 2710 if (expect_false (!ev_is_active (w)))
2515 return; 2711 return;
2516 2712
2713 EV_FREQUENT_CHECK;
2714
2517 { 2715 {
2518 int active = ev_active (w); 2716 int active = ev_active (w);
2519 2717
2520 checks [active - 1] = checks [--checkcnt]; 2718 checks [active - 1] = checks [--checkcnt];
2521 ev_active (checks [active - 1]) = active; 2719 ev_active (checks [active - 1]) = active;
2522 } 2720 }
2523 2721
2524 ev_stop (EV_A_ (W)w); 2722 ev_stop (EV_A_ (W)w);
2723
2724 EV_FREQUENT_CHECK;
2525} 2725}
2526 2726
2527#if EV_EMBED_ENABLE 2727#if EV_EMBED_ENABLE
2528void noinline 2728void noinline
2529ev_embed_sweep (EV_P_ ev_embed *w) 2729ev_embed_sweep (EV_P_ ev_embed *w)
… …
2576 struct ev_loop *loop = w->other; 2776 struct ev_loop *loop = w->other;
2577 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 ()));
2578 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);
2579 } 2779 }
2580 2780
2781 EV_FREQUENT_CHECK;
2782
2581 ev_set_priority (&w->io, ev_priority (w)); 2783 ev_set_priority (&w->io, ev_priority (w));
2582 ev_io_start (EV_A_ &w->io); 2784 ev_io_start (EV_A_ &w->io);
2583 2785
2584 ev_prepare_init (&w->prepare, embed_prepare_cb); 2786 ev_prepare_init (&w->prepare, embed_prepare_cb);
2585 ev_set_priority (&w->prepare, EV_MINPRI); 2787 ev_set_priority (&w->prepare, EV_MINPRI);
2586 ev_prepare_start (EV_A_ &w->prepare); 2788 ev_prepare_start (EV_A_ &w->prepare);
2587 2789
2588 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2790 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2589 2791
2590 ev_start (EV_A_ (W)w, 1); 2792 ev_start (EV_A_ (W)w, 1);
2793
2794 EV_FREQUENT_CHECK;
2591} 2795}
2592 2796
2593void 2797void
2594ev_embed_stop (EV_P_ ev_embed *w) 2798ev_embed_stop (EV_P_ ev_embed *w)
2595{ 2799{
2596 clear_pending (EV_A_ (W)w); 2800 clear_pending (EV_A_ (W)w);
2597 if (expect_false (!ev_is_active (w))) 2801 if (expect_false (!ev_is_active (w)))
2598 return; 2802 return;
2599 2803
2804 EV_FREQUENT_CHECK;
2805
2600 ev_io_stop (EV_A_ &w->io); 2806 ev_io_stop (EV_A_ &w->io);
2601 ev_prepare_stop (EV_A_ &w->prepare); 2807 ev_prepare_stop (EV_A_ &w->prepare);
2602 2808
2603 ev_stop (EV_A_ (W)w); 2809 ev_stop (EV_A_ (W)w);
2810
2811 EV_FREQUENT_CHECK;
2604} 2812}
2605#endif 2813#endif
2606 2814
2607#if EV_FORK_ENABLE 2815#if EV_FORK_ENABLE
2608void 2816void
2609ev_fork_start (EV_P_ ev_fork *w) 2817ev_fork_start (EV_P_ ev_fork *w)
2610{ 2818{
2611 if (expect_false (ev_is_active (w))) 2819 if (expect_false (ev_is_active (w)))
2612 return; 2820 return;
2821
2822 EV_FREQUENT_CHECK;
2613 2823
2614 ev_start (EV_A_ (W)w, ++forkcnt); 2824 ev_start (EV_A_ (W)w, ++forkcnt);
2615 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2825 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2616 forks [forkcnt - 1] = w; 2826 forks [forkcnt - 1] = w;
2827
2828 EV_FREQUENT_CHECK;
2617} 2829}
2618 2830
2619void 2831void
2620ev_fork_stop (EV_P_ ev_fork *w) 2832ev_fork_stop (EV_P_ ev_fork *w)
2621{ 2833{
2622 clear_pending (EV_A_ (W)w); 2834 clear_pending (EV_A_ (W)w);
2623 if (expect_false (!ev_is_active (w))) 2835 if (expect_false (!ev_is_active (w)))
2624 return; 2836 return;
2625 2837
2838 EV_FREQUENT_CHECK;
2839
2626 { 2840 {
2627 int active = ev_active (w); 2841 int active = ev_active (w);
2628 2842
2629 forks [active - 1] = forks [--forkcnt]; 2843 forks [active - 1] = forks [--forkcnt];
2630 ev_active (forks [active - 1]) = active; 2844 ev_active (forks [active - 1]) = active;
2631 } 2845 }
2632 2846
2633 ev_stop (EV_A_ (W)w); 2847 ev_stop (EV_A_ (W)w);
2848
2849 EV_FREQUENT_CHECK;
2634} 2850}
2635#endif 2851#endif
2636 2852
2637#if EV_ASYNC_ENABLE 2853#if EV_ASYNC_ENABLE
2638void 2854void
… …
2640{ 2856{
2641 if (expect_false (ev_is_active (w))) 2857 if (expect_false (ev_is_active (w)))
2642 return; 2858 return;
2643 2859
2644 evpipe_init (EV_A); 2860 evpipe_init (EV_A);
2861
2862 EV_FREQUENT_CHECK;
2645 2863
2646 ev_start (EV_A_ (W)w, ++asynccnt); 2864 ev_start (EV_A_ (W)w, ++asynccnt);
2647 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2865 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2648 asyncs [asynccnt - 1] = w; 2866 asyncs [asynccnt - 1] = w;
2867
2868 EV_FREQUENT_CHECK;
2649} 2869}
2650 2870
2651void 2871void
2652ev_async_stop (EV_P_ ev_async *w) 2872ev_async_stop (EV_P_ ev_async *w)
2653{ 2873{
2654 clear_pending (EV_A_ (W)w); 2874 clear_pending (EV_A_ (W)w);
2655 if (expect_false (!ev_is_active (w))) 2875 if (expect_false (!ev_is_active (w)))
2656 return; 2876 return;
2657 2877
2878 EV_FREQUENT_CHECK;
2879
2658 { 2880 {
2659 int active = ev_active (w); 2881 int active = ev_active (w);
2660 2882
2661 asyncs [active - 1] = asyncs [--asynccnt]; 2883 asyncs [active - 1] = asyncs [--asynccnt];
2662 ev_active (asyncs [active - 1]) = active; 2884 ev_active (asyncs [active - 1]) = active;
2663 } 2885 }
2664 2886
2665 ev_stop (EV_A_ (W)w); 2887 ev_stop (EV_A_ (W)w);
2888
2889 EV_FREQUENT_CHECK;
2666} 2890}
2667 2891
2668void 2892void
2669ev_async_send (EV_P_ ev_async *w) 2893ev_async_send (EV_P_ ev_async *w)
2670{ 2894{

Diff Legend

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