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.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
… …
422 W w; 446 W w;
423 int events; 447 int events;
424} ANPENDING; 448} ANPENDING;
425 449
426#if EV_USE_INOTIFY 450#if EV_USE_INOTIFY
451/* hash table entry per inotify-id */
427typedef struct 452typedef struct
428{ 453{
429 WL head; 454 WL head;
430} ANFS; 455} ANFS;
456#endif
457
458/* Heap Entry */
459#if EV_HEAP_CACHE_AT
460 typedef struct {
461 ev_tstamp at;
462 WT w;
463 } ANHE;
464
465 #define ANHE_w(he) (he).w /* access watcher, read-write */
466 #define ANHE_at(he) (he).at /* access cached at, read-only */
467 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
468#else
469 typedef WT ANHE;
470
471 #define ANHE_w(he) (he)
472 #define ANHE_at(he) (he)->at
473 #define ANHE_at_cache(he)
431#endif 474#endif
432 475
433#if EV_MULTIPLICITY 476#if EV_MULTIPLICITY
434 477
435 struct ev_loop 478 struct ev_loop
… …
760} 803}
761 804
762/*****************************************************************************/ 805/*****************************************************************************/
763 806
764/* 807/*
808 * the heap functions want a real array index. array index 0 uis guaranteed to not
809 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
810 * the branching factor of the d-tree.
811 */
812
813/*
765 * at the moment we allow libev the luxury of two heaps, 814 * 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 815 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
767 * which is more cache-efficient. 816 * which is more cache-efficient.
768 * the difference is about 5% with 50000+ watchers. 817 * the difference is about 5% with 50000+ watchers.
769 */ 818 */
770#define USE_4HEAP !EV_MINIMAL
771#if USE_4HEAP 819#if EV_USE_4HEAP
772 820
773#define DHEAP 4 821#define DHEAP 4
774#define HEAP0 (DHEAP - 1) /* index of first element in heap */ 822#define HEAP0 (DHEAP - 1) /* index of first element in heap */
823#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
824#define UPHEAP_DONE(p,k) ((p) == (k))
825
826/* away from the root */
827void inline_speed
828downheap (ANHE *heap, int N, int k)
829{
830 ANHE he = heap [k];
831 ANHE *E = heap + N + HEAP0;
832
833 for (;;)
834 {
835 ev_tstamp minat;
836 ANHE *minpos;
837 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
838
839 /* find minimum child */
840 if (expect_true (pos + DHEAP - 1 < E))
841 {
842 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
843 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
844 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
845 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
846 }
847 else if (pos < E)
848 {
849 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
850 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
851 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
852 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
853 }
854 else
855 break;
856
857 if (ANHE_at (he) <= minat)
858 break;
859
860 heap [k] = *minpos;
861 ev_active (ANHE_w (*minpos)) = k;
862
863 k = minpos - heap;
864 }
865
866 heap [k] = he;
867 ev_active (ANHE_w (he)) = k;
868}
869
870#else /* 4HEAP */
871
872#define HEAP0 1
873#define HPARENT(k) ((k) >> 1)
874#define UPHEAP_DONE(p,k) (!(p))
875
876/* away from the root */
877void inline_speed
878downheap (ANHE *heap, int N, int k)
879{
880 ANHE he = heap [k];
881
882 for (;;)
883 {
884 int c = k << 1;
885
886 if (c > N + HEAP0 - 1)
887 break;
888
889 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
890 ? 1 : 0;
891
892 if (ANHE_at (he) <= ANHE_at (heap [c]))
893 break;
894
895 heap [k] = heap [c];
896 ev_active (ANHE_w (heap [k])) = k;
897
898 k = c;
899 }
900
901 heap [k] = he;
902 ev_active (ANHE_w (he)) = k;
903}
904#endif
775 905
776/* towards the root */ 906/* towards the root */
777void inline_speed 907void inline_speed
778upheap (WT *heap, int k) 908upheap (ANHE *heap, int k)
779{ 909{
780 WT w = heap [k]; 910 ANHE he = heap [k];
781 911
782 for (;;) 912 for (;;)
783 { 913 {
784 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0; 914 int p = HPARENT (k);
785 915
786 if (p == k || heap [p]->at <= w->at) 916 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
787 break; 917 break;
788 918
789 heap [k] = heap [p]; 919 heap [k] = heap [p];
790 ev_active (heap [k]) = k; 920 ev_active (ANHE_w (heap [k])) = k;
791 k = p; 921 k = p;
792 } 922 }
793 923
794 heap [k] = w; 924 heap [k] = he;
795 ev_active (heap [k]) = k; 925 ev_active (ANHE_w (he)) = k;
796} 926}
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 927
901void inline_size 928void inline_size
902adjustheap (WT *heap, int N, int k) 929adjustheap (ANHE *heap, int N, int k)
903{ 930{
931 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
904 upheap (heap, k); 932 upheap (heap, k);
933 else
905 downheap (heap, N, k); 934 downheap (heap, N, k);
906} 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
907 962
908/*****************************************************************************/ 963/*****************************************************************************/
909 964
910typedef struct 965typedef struct
911{ 966{
… …
1428 1483
1429 postfork = 0; 1484 postfork = 0;
1430} 1485}
1431 1486
1432#if EV_MULTIPLICITY 1487#if EV_MULTIPLICITY
1488
1433struct ev_loop * 1489struct ev_loop *
1434ev_loop_new (unsigned int flags) 1490ev_loop_new (unsigned int flags)
1435{ 1491{
1436 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));
1437 1493
… …
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}
1460#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 */
1461 1553
1462#if EV_MULTIPLICITY 1554#if EV_MULTIPLICITY
1463struct ev_loop * 1555struct ev_loop *
1464ev_default_loop_init (unsigned int flags) 1556ev_default_loop_init (unsigned int flags)
1465#else 1557#else
… …
1541 { 1633 {
1542 /*assert (("non-pending watcher on pending list", p->w->pending));*/ 1634 /*assert (("non-pending watcher on pending list", p->w->pending));*/
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);
1638 EV_FREQUENT_CHECK;
1546 } 1639 }
1547 } 1640 }
1548} 1641}
1549 1642
1550#if EV_IDLE_ENABLE 1643#if EV_IDLE_ENABLE
… …
1571#endif 1664#endif
1572 1665
1573void inline_size 1666void inline_size
1574timers_reify (EV_P) 1667timers_reify (EV_P)
1575{ 1668{
1669 EV_FREQUENT_CHECK;
1670
1576 while (timercnt && ev_at (timers [HEAP0]) <= mn_now) 1671 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1577 { 1672 {
1578 ev_timer *w = (ev_timer *)timers [HEAP0]; 1673 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1579 1674
1580 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1675 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1581 1676
1582 /* first reschedule or stop timer */ 1677 /* first reschedule or stop timer */
1583 if (w->repeat) 1678 if (w->repeat)
1584 { 1679 {
1585 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1586
1587 ev_at (w) += w->repeat; 1680 ev_at (w) += w->repeat;
1588 if (ev_at (w) < mn_now) 1681 if (ev_at (w) < mn_now)
1589 ev_at (w) = mn_now; 1682 ev_at (w) = mn_now;
1590 1683
1684 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1685
1686 ANHE_at_cache (timers [HEAP0]);
1591 downheap (timers, timercnt, HEAP0); 1687 downheap (timers, timercnt, HEAP0);
1592 } 1688 }
1593 else 1689 else
1594 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1690 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1595 1691
1692 EV_FREQUENT_CHECK;
1596 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); 1693 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1597 } 1694 }
1598} 1695}
1599 1696
1600#if EV_PERIODIC_ENABLE 1697#if EV_PERIODIC_ENABLE
1601void inline_size 1698void inline_size
1602periodics_reify (EV_P) 1699periodics_reify (EV_P)
1603{ 1700{
1701 EV_FREQUENT_CHECK;
1702
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);
1616 } 1718 }
1617 else if (w->interval) 1719 else if (w->interval)
1618 { 1720 {
1619 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 */
1620 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1724 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)); 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
1735 ANHE_at_cache (periodics [HEAP0]);
1622 downheap (periodics, periodiccnt, HEAP0); 1736 downheap (periodics, periodiccnt, HEAP0);
1623 } 1737 }
1624 else 1738 else
1625 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1739 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1626 1740
1741 EV_FREQUENT_CHECK;
1627 ev_feed_event (EV_A_ (W)w, EV_PERIODIC); 1742 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1628 } 1743 }
1629} 1744}
1630 1745
1631static void noinline 1746static void noinline
1632periodics_reschedule (EV_P) 1747periodics_reschedule (EV_P)
1633{ 1748{
1634 int i; 1749 int i;
1635 1750
1636 /* adjust periodics after time jump */ 1751 /* adjust periodics after time jump */
1637 for (i = 1; i <= periodiccnt; ++i) 1752 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1638 { 1753 {
1639 ev_periodic *w = (ev_periodic *)periodics [i]; 1754 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1640 1755
1641 if (w->reschedule_cb) 1756 if (w->reschedule_cb)
1642 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1757 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1643 else if (w->interval) 1758 else if (w->interval)
1644 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;
1645 }
1646 1760
1647 /* now rebuild the heap */ 1761 ANHE_at_cache (periodics [i]);
1648 for (i = periodiccnt >> 1; --i; ) 1762 }
1763
1649 downheap (periodics, periodiccnt, i + HEAP0); 1764 reheap (periodics, periodiccnt);
1650} 1765}
1651#endif 1766#endif
1652 1767
1653void inline_speed 1768void inline_speed
1654time_update (EV_P_ ev_tstamp max_block) 1769time_update (EV_P_ ev_tstamp max_block)
… …
1708 { 1823 {
1709#if EV_PERIODIC_ENABLE 1824#if EV_PERIODIC_ENABLE
1710 periodics_reschedule (EV_A); 1825 periodics_reschedule (EV_A);
1711#endif 1826#endif
1712 /* 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 */
1713 for (i = 1; i <= timercnt; ++i) 1828 for (i = 0; i < timercnt; ++i)
1714 ev_at (timers [i]) += ev_rt_now - mn_now; 1829 {
1830 ANHE *he = timers + i + HEAP0;
1831 ANHE_w (*he)->at += ev_rt_now - mn_now;
1832 ANHE_at_cache (*he);
1833 }
1715 } 1834 }
1716 1835
1717 mn_now = ev_rt_now; 1836 mn_now = ev_rt_now;
1718 } 1837 }
1719} 1838}
… …
1739 1858
1740 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 */
1741 1860
1742 do 1861 do
1743 { 1862 {
1863#if EV_VERIFY >= 2
1864 ev_loop_verify (EV_A);
1865#endif
1866
1744#ifndef _WIN32 1867#ifndef _WIN32
1745 if (expect_false (curpid)) /* penalise the forking check even more */ 1868 if (expect_false (curpid)) /* penalise the forking check even more */
1746 if (expect_false (getpid () != curpid)) 1869 if (expect_false (getpid () != curpid))
1747 { 1870 {
1748 curpid = getpid (); 1871 curpid = getpid ();
… …
1789 1912
1790 waittime = MAX_BLOCKTIME; 1913 waittime = MAX_BLOCKTIME;
1791 1914
1792 if (timercnt) 1915 if (timercnt)
1793 { 1916 {
1794 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; 1917 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1795 if (waittime > to) waittime = to; 1918 if (waittime > to) waittime = to;
1796 } 1919 }
1797 1920
1798#if EV_PERIODIC_ENABLE 1921#if EV_PERIODIC_ENABLE
1799 if (periodiccnt) 1922 if (periodiccnt)
1800 { 1923 {
1801 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; 1924 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1802 if (waittime > to) waittime = to; 1925 if (waittime > to) waittime = to;
1803 } 1926 }
1804#endif 1927#endif
1805 1928
1806 if (expect_false (waittime < timeout_blocktime)) 1929 if (expect_false (waittime < timeout_blocktime))
… …
1943 if (expect_false (ev_is_active (w))) 2066 if (expect_false (ev_is_active (w)))
1944 return; 2067 return;
1945 2068
1946 assert (("ev_io_start called with negative fd", fd >= 0)); 2069 assert (("ev_io_start called with negative fd", fd >= 0));
1947 2070
2071 EV_FREQUENT_CHECK;
2072
1948 ev_start (EV_A_ (W)w, 1); 2073 ev_start (EV_A_ (W)w, 1);
1949 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2074 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1950 wlist_add (&anfds[fd].head, (WL)w); 2075 wlist_add (&anfds[fd].head, (WL)w);
1951 2076
1952 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2077 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1953 w->events &= ~EV_IOFDSET; 2078 w->events &= ~EV_IOFDSET;
2079
2080 EV_FREQUENT_CHECK;
1954} 2081}
1955 2082
1956void noinline 2083void noinline
1957ev_io_stop (EV_P_ ev_io *w) 2084ev_io_stop (EV_P_ ev_io *w)
1958{ 2085{
1959 clear_pending (EV_A_ (W)w); 2086 clear_pending (EV_A_ (W)w);
1960 if (expect_false (!ev_is_active (w))) 2087 if (expect_false (!ev_is_active (w)))
1961 return; 2088 return;
1962 2089
1963 assert (("ev_io_start 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));
2091
2092 EV_FREQUENT_CHECK;
1964 2093
1965 wlist_del (&anfds[w->fd].head, (WL)w); 2094 wlist_del (&anfds[w->fd].head, (WL)w);
1966 ev_stop (EV_A_ (W)w); 2095 ev_stop (EV_A_ (W)w);
1967 2096
1968 fd_change (EV_A_ w->fd, 1); 2097 fd_change (EV_A_ w->fd, 1);
2098
2099 EV_FREQUENT_CHECK;
1969} 2100}
1970 2101
1971void noinline 2102void noinline
1972ev_timer_start (EV_P_ ev_timer *w) 2103ev_timer_start (EV_P_ ev_timer *w)
1973{ 2104{
… …
1976 2107
1977 ev_at (w) += mn_now; 2108 ev_at (w) += mn_now;
1978 2109
1979 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.));
1980 2111
2112 EV_FREQUENT_CHECK;
2113
2114 ++timercnt;
1981 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2115 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1982 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); 2116 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1983 timers [ev_active (w)] = (WT)w; 2117 ANHE_w (timers [ev_active (w)]) = (WT)w;
2118 ANHE_at_cache (timers [ev_active (w)]);
1984 upheap (timers, ev_active (w)); 2119 upheap (timers, ev_active (w));
1985 2120
2121 EV_FREQUENT_CHECK;
2122
1986 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2123 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1987} 2124}
1988 2125
1989void noinline 2126void noinline
1990ev_timer_stop (EV_P_ ev_timer *w) 2127ev_timer_stop (EV_P_ ev_timer *w)
1991{ 2128{
1992 clear_pending (EV_A_ (W)w); 2129 clear_pending (EV_A_ (W)w);
1993 if (expect_false (!ev_is_active (w))) 2130 if (expect_false (!ev_is_active (w)))
1994 return; 2131 return;
1995 2132
2133 EV_FREQUENT_CHECK;
2134
1996 { 2135 {
1997 int active = ev_active (w); 2136 int active = ev_active (w);
1998 2137
1999 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2138 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2000 2139
2140 --timercnt;
2141
2001 if (expect_true (active < timercnt + HEAP0 - 1)) 2142 if (expect_true (active < timercnt + HEAP0))
2002 { 2143 {
2003 timers [active] = timers [timercnt + HEAP0 - 1]; 2144 timers [active] = timers [timercnt + HEAP0];
2004 adjustheap (timers, timercnt, active); 2145 adjustheap (timers, timercnt, active);
2005 } 2146 }
2006
2007 --timercnt;
2008 } 2147 }
2148
2149 EV_FREQUENT_CHECK;
2009 2150
2010 ev_at (w) -= mn_now; 2151 ev_at (w) -= mn_now;
2011 2152
2012 ev_stop (EV_A_ (W)w); 2153 ev_stop (EV_A_ (W)w);
2013} 2154}
2014 2155
2015void noinline 2156void noinline
2016ev_timer_again (EV_P_ ev_timer *w) 2157ev_timer_again (EV_P_ ev_timer *w)
2017{ 2158{
2159 EV_FREQUENT_CHECK;
2160
2018 if (ev_is_active (w)) 2161 if (ev_is_active (w))
2019 { 2162 {
2020 if (w->repeat) 2163 if (w->repeat)
2021 { 2164 {
2022 ev_at (w) = mn_now + w->repeat; 2165 ev_at (w) = mn_now + w->repeat;
2166 ANHE_at_cache (timers [ev_active (w)]);
2023 adjustheap (timers, timercnt, ev_active (w)); 2167 adjustheap (timers, timercnt, ev_active (w));
2024 } 2168 }
2025 else 2169 else
2026 ev_timer_stop (EV_A_ w); 2170 ev_timer_stop (EV_A_ w);
2027 } 2171 }
2028 else if (w->repeat) 2172 else if (w->repeat)
2029 { 2173 {
2030 ev_at (w) = w->repeat; 2174 ev_at (w) = w->repeat;
2031 ev_timer_start (EV_A_ w); 2175 ev_timer_start (EV_A_ w);
2032 } 2176 }
2177
2178 EV_FREQUENT_CHECK;
2033} 2179}
2034 2180
2035#if EV_PERIODIC_ENABLE 2181#if EV_PERIODIC_ENABLE
2036void noinline 2182void noinline
2037ev_periodic_start (EV_P_ ev_periodic *w) 2183ev_periodic_start (EV_P_ ev_periodic *w)
… …
2048 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;
2049 } 2195 }
2050 else 2196 else
2051 ev_at (w) = w->offset; 2197 ev_at (w) = w->offset;
2052 2198
2199 EV_FREQUENT_CHECK;
2200
2201 ++periodiccnt;
2053 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2202 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2054 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); 2203 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2055 periodics [ev_active (w)] = (WT)w; 2204 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2205 ANHE_at_cache (periodics [ev_active (w)]);
2056 upheap (periodics, ev_active (w)); 2206 upheap (periodics, ev_active (w));
2057 2207
2208 EV_FREQUENT_CHECK;
2209
2058 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2210 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2059} 2211}
2060 2212
2061void noinline 2213void noinline
2062ev_periodic_stop (EV_P_ ev_periodic *w) 2214ev_periodic_stop (EV_P_ ev_periodic *w)
2063{ 2215{
2064 clear_pending (EV_A_ (W)w); 2216 clear_pending (EV_A_ (W)w);
2065 if (expect_false (!ev_is_active (w))) 2217 if (expect_false (!ev_is_active (w)))
2066 return; 2218 return;
2067 2219
2220 EV_FREQUENT_CHECK;
2221
2068 { 2222 {
2069 int active = ev_active (w); 2223 int active = ev_active (w);
2070 2224
2071 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2225 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2072 2226
2227 --periodiccnt;
2228
2073 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2229 if (expect_true (active < periodiccnt + HEAP0))
2074 { 2230 {
2075 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2231 periodics [active] = periodics [periodiccnt + HEAP0];
2076 adjustheap (periodics, periodiccnt, active); 2232 adjustheap (periodics, periodiccnt, active);
2077 } 2233 }
2078
2079 --periodiccnt;
2080 } 2234 }
2235
2236 EV_FREQUENT_CHECK;
2081 2237
2082 ev_stop (EV_A_ (W)w); 2238 ev_stop (EV_A_ (W)w);
2083} 2239}
2084 2240
2085void noinline 2241void noinline
… …
2105 return; 2261 return;
2106 2262
2107 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));
2108 2264
2109 evpipe_init (EV_A); 2265 evpipe_init (EV_A);
2266
2267 EV_FREQUENT_CHECK;
2110 2268
2111 { 2269 {
2112#ifndef _WIN32 2270#ifndef _WIN32
2113 sigset_t full, prev; 2271 sigset_t full, prev;
2114 sigfillset (&full); 2272 sigfillset (&full);
… …
2135 sigfillset (&sa.sa_mask); 2293 sigfillset (&sa.sa_mask);
2136 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 */
2137 sigaction (w->signum, &sa, 0); 2295 sigaction (w->signum, &sa, 0);
2138#endif 2296#endif
2139 } 2297 }
2298
2299 EV_FREQUENT_CHECK;
2140} 2300}
2141 2301
2142void noinline 2302void noinline
2143ev_signal_stop (EV_P_ ev_signal *w) 2303ev_signal_stop (EV_P_ ev_signal *w)
2144{ 2304{
2145 clear_pending (EV_A_ (W)w); 2305 clear_pending (EV_A_ (W)w);
2146 if (expect_false (!ev_is_active (w))) 2306 if (expect_false (!ev_is_active (w)))
2147 return; 2307 return;
2148 2308
2309 EV_FREQUENT_CHECK;
2310
2149 wlist_del (&signals [w->signum - 1].head, (WL)w); 2311 wlist_del (&signals [w->signum - 1].head, (WL)w);
2150 ev_stop (EV_A_ (W)w); 2312 ev_stop (EV_A_ (W)w);
2151 2313
2152 if (!signals [w->signum - 1].head) 2314 if (!signals [w->signum - 1].head)
2153 signal (w->signum, SIG_DFL); 2315 signal (w->signum, SIG_DFL);
2316
2317 EV_FREQUENT_CHECK;
2154} 2318}
2155 2319
2156void 2320void
2157ev_child_start (EV_P_ ev_child *w) 2321ev_child_start (EV_P_ ev_child *w)
2158{ 2322{
… …
2160 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));
2161#endif 2325#endif
2162 if (expect_false (ev_is_active (w))) 2326 if (expect_false (ev_is_active (w)))
2163 return; 2327 return;
2164 2328
2329 EV_FREQUENT_CHECK;
2330
2165 ev_start (EV_A_ (W)w, 1); 2331 ev_start (EV_A_ (W)w, 1);
2166 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;
2167} 2335}
2168 2336
2169void 2337void
2170ev_child_stop (EV_P_ ev_child *w) 2338ev_child_stop (EV_P_ ev_child *w)
2171{ 2339{
2172 clear_pending (EV_A_ (W)w); 2340 clear_pending (EV_A_ (W)w);
2173 if (expect_false (!ev_is_active (w))) 2341 if (expect_false (!ev_is_active (w)))
2174 return; 2342 return;
2175 2343
2344 EV_FREQUENT_CHECK;
2345
2176 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2346 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2177 ev_stop (EV_A_ (W)w); 2347 ev_stop (EV_A_ (W)w);
2348
2349 EV_FREQUENT_CHECK;
2178} 2350}
2179 2351
2180#if EV_STAT_ENABLE 2352#if EV_STAT_ENABLE
2181 2353
2182# ifdef _WIN32 2354# ifdef _WIN32
… …
2410 else 2582 else
2411#endif 2583#endif
2412 ev_timer_start (EV_A_ &w->timer); 2584 ev_timer_start (EV_A_ &w->timer);
2413 2585
2414 ev_start (EV_A_ (W)w, 1); 2586 ev_start (EV_A_ (W)w, 1);
2587
2588 EV_FREQUENT_CHECK;
2415} 2589}
2416 2590
2417void 2591void
2418ev_stat_stop (EV_P_ ev_stat *w) 2592ev_stat_stop (EV_P_ ev_stat *w)
2419{ 2593{
2420 clear_pending (EV_A_ (W)w); 2594 clear_pending (EV_A_ (W)w);
2421 if (expect_false (!ev_is_active (w))) 2595 if (expect_false (!ev_is_active (w)))
2422 return; 2596 return;
2423 2597
2598 EV_FREQUENT_CHECK;
2599
2424#if EV_USE_INOTIFY 2600#if EV_USE_INOTIFY
2425 infy_del (EV_A_ w); 2601 infy_del (EV_A_ w);
2426#endif 2602#endif
2427 ev_timer_stop (EV_A_ &w->timer); 2603 ev_timer_stop (EV_A_ &w->timer);
2428 2604
2429 ev_stop (EV_A_ (W)w); 2605 ev_stop (EV_A_ (W)w);
2606
2607 EV_FREQUENT_CHECK;
2430} 2608}
2431#endif 2609#endif
2432 2610
2433#if EV_IDLE_ENABLE 2611#if EV_IDLE_ENABLE
2434void 2612void
… …
2436{ 2614{
2437 if (expect_false (ev_is_active (w))) 2615 if (expect_false (ev_is_active (w)))
2438 return; 2616 return;
2439 2617
2440 pri_adjust (EV_A_ (W)w); 2618 pri_adjust (EV_A_ (W)w);
2619
2620 EV_FREQUENT_CHECK;
2441 2621
2442 { 2622 {
2443 int active = ++idlecnt [ABSPRI (w)]; 2623 int active = ++idlecnt [ABSPRI (w)];
2444 2624
2445 ++idleall; 2625 ++idleall;
2446 ev_start (EV_A_ (W)w, active); 2626 ev_start (EV_A_ (W)w, active);
2447 2627
2448 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);
2449 idles [ABSPRI (w)][active - 1] = w; 2629 idles [ABSPRI (w)][active - 1] = w;
2450 } 2630 }
2631
2632 EV_FREQUENT_CHECK;
2451} 2633}
2452 2634
2453void 2635void
2454ev_idle_stop (EV_P_ ev_idle *w) 2636ev_idle_stop (EV_P_ ev_idle *w)
2455{ 2637{
2456 clear_pending (EV_A_ (W)w); 2638 clear_pending (EV_A_ (W)w);
2457 if (expect_false (!ev_is_active (w))) 2639 if (expect_false (!ev_is_active (w)))
2458 return; 2640 return;
2459 2641
2642 EV_FREQUENT_CHECK;
2643
2460 { 2644 {
2461 int active = ev_active (w); 2645 int active = ev_active (w);
2462 2646
2463 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2647 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2464 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2648 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2465 2649
2466 ev_stop (EV_A_ (W)w); 2650 ev_stop (EV_A_ (W)w);
2467 --idleall; 2651 --idleall;
2468 } 2652 }
2653
2654 EV_FREQUENT_CHECK;
2469} 2655}
2470#endif 2656#endif
2471 2657
2472void 2658void
2473ev_prepare_start (EV_P_ ev_prepare *w) 2659ev_prepare_start (EV_P_ ev_prepare *w)
2474{ 2660{
2475 if (expect_false (ev_is_active (w))) 2661 if (expect_false (ev_is_active (w)))
2476 return; 2662 return;
2663
2664 EV_FREQUENT_CHECK;
2477 2665
2478 ev_start (EV_A_ (W)w, ++preparecnt); 2666 ev_start (EV_A_ (W)w, ++preparecnt);
2479 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2667 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2480 prepares [preparecnt - 1] = w; 2668 prepares [preparecnt - 1] = w;
2669
2670 EV_FREQUENT_CHECK;
2481} 2671}
2482 2672
2483void 2673void
2484ev_prepare_stop (EV_P_ ev_prepare *w) 2674ev_prepare_stop (EV_P_ ev_prepare *w)
2485{ 2675{
2486 clear_pending (EV_A_ (W)w); 2676 clear_pending (EV_A_ (W)w);
2487 if (expect_false (!ev_is_active (w))) 2677 if (expect_false (!ev_is_active (w)))
2488 return; 2678 return;
2489 2679
2680 EV_FREQUENT_CHECK;
2681
2490 { 2682 {
2491 int active = ev_active (w); 2683 int active = ev_active (w);
2492 2684
2493 prepares [active - 1] = prepares [--preparecnt]; 2685 prepares [active - 1] = prepares [--preparecnt];
2494 ev_active (prepares [active - 1]) = active; 2686 ev_active (prepares [active - 1]) = active;
2495 } 2687 }
2496 2688
2497 ev_stop (EV_A_ (W)w); 2689 ev_stop (EV_A_ (W)w);
2690
2691 EV_FREQUENT_CHECK;
2498} 2692}
2499 2693
2500void 2694void
2501ev_check_start (EV_P_ ev_check *w) 2695ev_check_start (EV_P_ ev_check *w)
2502{ 2696{
2503 if (expect_false (ev_is_active (w))) 2697 if (expect_false (ev_is_active (w)))
2504 return; 2698 return;
2699
2700 EV_FREQUENT_CHECK;
2505 2701
2506 ev_start (EV_A_ (W)w, ++checkcnt); 2702 ev_start (EV_A_ (W)w, ++checkcnt);
2507 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2703 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2508 checks [checkcnt - 1] = w; 2704 checks [checkcnt - 1] = w;
2705
2706 EV_FREQUENT_CHECK;
2509} 2707}
2510 2708
2511void 2709void
2512ev_check_stop (EV_P_ ev_check *w) 2710ev_check_stop (EV_P_ ev_check *w)
2513{ 2711{
2514 clear_pending (EV_A_ (W)w); 2712 clear_pending (EV_A_ (W)w);
2515 if (expect_false (!ev_is_active (w))) 2713 if (expect_false (!ev_is_active (w)))
2516 return; 2714 return;
2517 2715
2716 EV_FREQUENT_CHECK;
2717
2518 { 2718 {
2519 int active = ev_active (w); 2719 int active = ev_active (w);
2520 2720
2521 checks [active - 1] = checks [--checkcnt]; 2721 checks [active - 1] = checks [--checkcnt];
2522 ev_active (checks [active - 1]) = active; 2722 ev_active (checks [active - 1]) = active;
2523 } 2723 }
2524 2724
2525 ev_stop (EV_A_ (W)w); 2725 ev_stop (EV_A_ (W)w);
2726
2727 EV_FREQUENT_CHECK;
2526} 2728}
2527 2729
2528#if EV_EMBED_ENABLE 2730#if EV_EMBED_ENABLE
2529void noinline 2731void noinline
2530ev_embed_sweep (EV_P_ ev_embed *w) 2732ev_embed_sweep (EV_P_ ev_embed *w)
… …
2577 struct ev_loop *loop = w->other; 2779 struct ev_loop *loop = w->other;
2578 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 ()));
2579 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);
2580 } 2782 }
2581 2783
2784 EV_FREQUENT_CHECK;
2785
2582 ev_set_priority (&w->io, ev_priority (w)); 2786 ev_set_priority (&w->io, ev_priority (w));
2583 ev_io_start (EV_A_ &w->io); 2787 ev_io_start (EV_A_ &w->io);
2584 2788
2585 ev_prepare_init (&w->prepare, embed_prepare_cb); 2789 ev_prepare_init (&w->prepare, embed_prepare_cb);
2586 ev_set_priority (&w->prepare, EV_MINPRI); 2790 ev_set_priority (&w->prepare, EV_MINPRI);
2587 ev_prepare_start (EV_A_ &w->prepare); 2791 ev_prepare_start (EV_A_ &w->prepare);
2588 2792
2589 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2793 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2590 2794
2591 ev_start (EV_A_ (W)w, 1); 2795 ev_start (EV_A_ (W)w, 1);
2796
2797 EV_FREQUENT_CHECK;
2592} 2798}
2593 2799
2594void 2800void
2595ev_embed_stop (EV_P_ ev_embed *w) 2801ev_embed_stop (EV_P_ ev_embed *w)
2596{ 2802{
2597 clear_pending (EV_A_ (W)w); 2803 clear_pending (EV_A_ (W)w);
2598 if (expect_false (!ev_is_active (w))) 2804 if (expect_false (!ev_is_active (w)))
2599 return; 2805 return;
2600 2806
2807 EV_FREQUENT_CHECK;
2808
2601 ev_io_stop (EV_A_ &w->io); 2809 ev_io_stop (EV_A_ &w->io);
2602 ev_prepare_stop (EV_A_ &w->prepare); 2810 ev_prepare_stop (EV_A_ &w->prepare);
2603 2811
2604 ev_stop (EV_A_ (W)w); 2812 ev_stop (EV_A_ (W)w);
2813
2814 EV_FREQUENT_CHECK;
2605} 2815}
2606#endif 2816#endif
2607 2817
2608#if EV_FORK_ENABLE 2818#if EV_FORK_ENABLE
2609void 2819void
2610ev_fork_start (EV_P_ ev_fork *w) 2820ev_fork_start (EV_P_ ev_fork *w)
2611{ 2821{
2612 if (expect_false (ev_is_active (w))) 2822 if (expect_false (ev_is_active (w)))
2613 return; 2823 return;
2824
2825 EV_FREQUENT_CHECK;
2614 2826
2615 ev_start (EV_A_ (W)w, ++forkcnt); 2827 ev_start (EV_A_ (W)w, ++forkcnt);
2616 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2828 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2617 forks [forkcnt - 1] = w; 2829 forks [forkcnt - 1] = w;
2830
2831 EV_FREQUENT_CHECK;
2618} 2832}
2619 2833
2620void 2834void
2621ev_fork_stop (EV_P_ ev_fork *w) 2835ev_fork_stop (EV_P_ ev_fork *w)
2622{ 2836{
2623 clear_pending (EV_A_ (W)w); 2837 clear_pending (EV_A_ (W)w);
2624 if (expect_false (!ev_is_active (w))) 2838 if (expect_false (!ev_is_active (w)))
2625 return; 2839 return;
2626 2840
2841 EV_FREQUENT_CHECK;
2842
2627 { 2843 {
2628 int active = ev_active (w); 2844 int active = ev_active (w);
2629 2845
2630 forks [active - 1] = forks [--forkcnt]; 2846 forks [active - 1] = forks [--forkcnt];
2631 ev_active (forks [active - 1]) = active; 2847 ev_active (forks [active - 1]) = active;
2632 } 2848 }
2633 2849
2634 ev_stop (EV_A_ (W)w); 2850 ev_stop (EV_A_ (W)w);
2851
2852 EV_FREQUENT_CHECK;
2635} 2853}
2636#endif 2854#endif
2637 2855
2638#if EV_ASYNC_ENABLE 2856#if EV_ASYNC_ENABLE
2639void 2857void
… …
2641{ 2859{
2642 if (expect_false (ev_is_active (w))) 2860 if (expect_false (ev_is_active (w)))
2643 return; 2861 return;
2644 2862
2645 evpipe_init (EV_A); 2863 evpipe_init (EV_A);
2864
2865 EV_FREQUENT_CHECK;
2646 2866
2647 ev_start (EV_A_ (W)w, ++asynccnt); 2867 ev_start (EV_A_ (W)w, ++asynccnt);
2648 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2868 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2649 asyncs [asynccnt - 1] = w; 2869 asyncs [asynccnt - 1] = w;
2870
2871 EV_FREQUENT_CHECK;
2650} 2872}
2651 2873
2652void 2874void
2653ev_async_stop (EV_P_ ev_async *w) 2875ev_async_stop (EV_P_ ev_async *w)
2654{ 2876{
2655 clear_pending (EV_A_ (W)w); 2877 clear_pending (EV_A_ (W)w);
2656 if (expect_false (!ev_is_active (w))) 2878 if (expect_false (!ev_is_active (w)))
2657 return; 2879 return;
2658 2880
2881 EV_FREQUENT_CHECK;
2882
2659 { 2883 {
2660 int active = ev_active (w); 2884 int active = ev_active (w);
2661 2885
2662 asyncs [active - 1] = asyncs [--asynccnt]; 2886 asyncs [active - 1] = asyncs [--asynccnt];
2663 ev_active (asyncs [active - 1]) = active; 2887 ev_active (asyncs [active - 1]) = active;
2664 } 2888 }
2665 2889
2666 ev_stop (EV_A_ (W)w); 2890 ev_stop (EV_A_ (W)w);
2891
2892 EV_FREQUENT_CHECK;
2667} 2893}
2668 2894
2669void 2895void
2670ev_async_send (EV_P_ ev_async *w) 2896ev_async_send (EV_P_ ev_async *w)
2671{ 2897{

Diff Legend

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