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.251 by root, Thu May 22 03:42:34 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);
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
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);
906} 947}
907 948
908/*****************************************************************************/ 949/*****************************************************************************/
909 950
910typedef struct 951typedef struct
… …
1428 1469
1429 postfork = 0; 1470 postfork = 0;
1430} 1471}
1431 1472
1432#if EV_MULTIPLICITY 1473#if EV_MULTIPLICITY
1474
1433struct ev_loop * 1475struct ev_loop *
1434ev_loop_new (unsigned int flags) 1476ev_loop_new (unsigned int flags)
1435{ 1477{
1436 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); 1478 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop));
1437 1479
… …
1455void 1497void
1456ev_loop_fork (EV_P) 1498ev_loop_fork (EV_P)
1457{ 1499{
1458 postfork = 1; /* must be in line with ev_default_fork */ 1500 postfork = 1; /* must be in line with ev_default_fork */
1459} 1501}
1502
1503#if EV_VERIFY
1504void noinline
1505verify_watcher (EV_P_ W w)
1506{
1507 assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI));
1508
1509 if (w->pending)
1510 assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w));
1511}
1512
1513static void noinline
1514verify_heap (EV_P_ ANHE *heap, int N)
1515{
1516 int i;
1517
1518 for (i = HEAP0; i < N + HEAP0; ++i)
1519 {
1520 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
1521 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
1522 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
1523
1524 verify_watcher (EV_A_ (W)ANHE_w (heap [i]));
1525 }
1526}
1527
1528static void noinline
1529array_verify (EV_P_ W *ws, int cnt)
1530{
1531 while (cnt--)
1532 {
1533 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1534 verify_watcher (EV_A_ ws [cnt]);
1535 }
1536}
1537#endif
1538
1539void
1540ev_loop_verify (EV_P)
1541{
1542#if EV_VERIFY
1543 int i;
1544 WL w;
1545
1546 assert (activecnt >= -1);
1547
1548 assert (fdchangemax >= fdchangecnt);
1549 for (i = 0; i < fdchangecnt; ++i)
1550 assert (("negative fd in fdchanges", fdchanges [i] >= 0));
1551
1552 assert (anfdmax >= 0);
1553 for (i = 0; i < anfdmax; ++i)
1554 for (w = anfds [i].head; w; w = w->next)
1555 {
1556 verify_watcher (EV_A_ (W)w);
1557 assert (("inactive fd watcher on anfd list", ev_active (w) == 1));
1558 assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i));
1559 }
1560
1561 assert (timermax >= timercnt);
1562 verify_heap (EV_A_ timers, timercnt);
1563
1564#if EV_PERIODIC_ENABLE
1565 assert (periodicmax >= periodiccnt);
1566 verify_heap (EV_A_ periodics, periodiccnt);
1567#endif
1568
1569 for (i = NUMPRI; i--; )
1570 {
1571 assert (pendingmax [i] >= pendingcnt [i]);
1572#if EV_IDLE_ENABLE
1573 assert (idlemax [i] >= idlecnt [i]);
1574 array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
1575#endif
1576 }
1577
1578#if EV_FORK_ENABLE
1579 assert (forkmax >= forkcnt);
1580 array_verify (EV_A_ (W *)forks, forkcnt);
1581#endif
1582
1583#if EV_ASYNC_ENABLE
1584 assert (asyncmax >= asynccnt);
1585 array_verify (EV_A_ (W *)asyncs, asynccnt);
1586#endif
1587
1588 assert (preparemax >= preparecnt);
1589 array_verify (EV_A_ (W *)prepares, preparecnt);
1590
1591 assert (checkmax >= checkcnt);
1592 array_verify (EV_A_ (W *)checks, checkcnt);
1593
1594# if 0
1595 for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next)
1596 for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1460#endif 1597# endif
1598#endif
1599}
1600
1601#endif /* multiplicity */
1461 1602
1462#if EV_MULTIPLICITY 1603#if EV_MULTIPLICITY
1463struct ev_loop * 1604struct ev_loop *
1464ev_default_loop_init (unsigned int flags) 1605ev_default_loop_init (unsigned int flags)
1465#else 1606#else
… …
1541 { 1682 {
1542 /*assert (("non-pending watcher on pending list", p->w->pending));*/ 1683 /*assert (("non-pending watcher on pending list", p->w->pending));*/
1543 1684
1544 p->w->pending = 0; 1685 p->w->pending = 0;
1545 EV_CB_INVOKE (p->w, p->events); 1686 EV_CB_INVOKE (p->w, p->events);
1687 EV_FREQUENT_CHECK;
1546 } 1688 }
1547 } 1689 }
1548} 1690}
1549 1691
1550#if EV_IDLE_ENABLE 1692#if EV_IDLE_ENABLE
… …
1571#endif 1713#endif
1572 1714
1573void inline_size 1715void inline_size
1574timers_reify (EV_P) 1716timers_reify (EV_P)
1575{ 1717{
1718 EV_FREQUENT_CHECK;
1719
1576 while (timercnt && ev_at (timers [HEAP0]) <= mn_now) 1720 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1577 { 1721 {
1578 ev_timer *w = (ev_timer *)timers [HEAP0]; 1722 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1579 1723
1580 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1724 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1581 1725
1582 /* first reschedule or stop timer */ 1726 /* first reschedule or stop timer */
1583 if (w->repeat) 1727 if (w->repeat)
1584 { 1728 {
1585 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1586
1587 ev_at (w) += w->repeat; 1729 ev_at (w) += w->repeat;
1588 if (ev_at (w) < mn_now) 1730 if (ev_at (w) < mn_now)
1589 ev_at (w) = mn_now; 1731 ev_at (w) = mn_now;
1590 1732
1733 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1734
1735 ANHE_at_cache (timers [HEAP0]);
1591 downheap (timers, timercnt, HEAP0); 1736 downheap (timers, timercnt, HEAP0);
1592 } 1737 }
1593 else 1738 else
1594 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1739 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1595 1740
1741 EV_FREQUENT_CHECK;
1596 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); 1742 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1597 } 1743 }
1598} 1744}
1599 1745
1600#if EV_PERIODIC_ENABLE 1746#if EV_PERIODIC_ENABLE
1601void inline_size 1747void inline_size
1602periodics_reify (EV_P) 1748periodics_reify (EV_P)
1603{ 1749{
1750 EV_FREQUENT_CHECK;
1751
1604 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) 1752 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1605 { 1753 {
1606 ev_periodic *w = (ev_periodic *)periodics [HEAP0]; 1754 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1607 1755
1608 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ 1756 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1609 1757
1610 /* first reschedule or stop timer */ 1758 /* first reschedule or stop timer */
1611 if (w->reschedule_cb) 1759 if (w->reschedule_cb)
1612 { 1760 {
1613 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); 1761 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1762
1614 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); 1763 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1764
1765 ANHE_at_cache (periodics [HEAP0]);
1615 downheap (periodics, periodiccnt, 1); 1766 downheap (periodics, periodiccnt, HEAP0);
1616 } 1767 }
1617 else if (w->interval) 1768 else if (w->interval)
1618 { 1769 {
1619 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1770 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1771 /* if next trigger time is not sufficiently in the future, put it there */
1772 /* this might happen because of floating point inexactness */
1620 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1773 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)); 1774 {
1775 ev_at (w) += w->interval;
1776
1777 /* if interval is unreasonably low we might still have a time in the past */
1778 /* so correct this. this will make the periodic very inexact, but the user */
1779 /* has effectively asked to get triggered more often than possible */
1780 if (ev_at (w) < ev_rt_now)
1781 ev_at (w) = ev_rt_now;
1782 }
1783
1784 ANHE_at_cache (periodics [HEAP0]);
1622 downheap (periodics, periodiccnt, HEAP0); 1785 downheap (periodics, periodiccnt, HEAP0);
1623 } 1786 }
1624 else 1787 else
1625 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1788 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1626 1789
1790 EV_FREQUENT_CHECK;
1627 ev_feed_event (EV_A_ (W)w, EV_PERIODIC); 1791 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1628 } 1792 }
1629} 1793}
1630 1794
1631static void noinline 1795static void noinline
1632periodics_reschedule (EV_P) 1796periodics_reschedule (EV_P)
1633{ 1797{
1634 int i; 1798 int i;
1635 1799
1636 /* adjust periodics after time jump */ 1800 /* adjust periodics after time jump */
1637 for (i = 1; i <= periodiccnt; ++i) 1801 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1638 { 1802 {
1639 ev_periodic *w = (ev_periodic *)periodics [i]; 1803 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1640 1804
1641 if (w->reschedule_cb) 1805 if (w->reschedule_cb)
1642 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1806 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1643 else if (w->interval) 1807 else if (w->interval)
1644 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1808 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1645 }
1646 1809
1647 /* now rebuild the heap */ 1810 ANHE_at_cache (periodics [i]);
1648 for (i = periodiccnt >> 1; --i; ) 1811 }
1812
1649 downheap (periodics, periodiccnt, i + HEAP0); 1813 reheap (periodics, periodiccnt);
1650} 1814}
1651#endif 1815#endif
1652 1816
1653void inline_speed 1817void inline_speed
1654time_update (EV_P_ ev_tstamp max_block) 1818time_update (EV_P_ ev_tstamp max_block)
… …
1708 { 1872 {
1709#if EV_PERIODIC_ENABLE 1873#if EV_PERIODIC_ENABLE
1710 periodics_reschedule (EV_A); 1874 periodics_reschedule (EV_A);
1711#endif 1875#endif
1712 /* adjust timers. this is easy, as the offset is the same for all of them */ 1876 /* adjust timers. this is easy, as the offset is the same for all of them */
1713 for (i = 1; i <= timercnt; ++i) 1877 for (i = 0; i < timercnt; ++i)
1714 ev_at (timers [i]) += ev_rt_now - mn_now; 1878 {
1879 ANHE *he = timers + i + HEAP0;
1880 ANHE_w (*he)->at += ev_rt_now - mn_now;
1881 ANHE_at_cache (*he);
1882 }
1715 } 1883 }
1716 1884
1717 mn_now = ev_rt_now; 1885 mn_now = ev_rt_now;
1718 } 1886 }
1719} 1887}
… …
1739 1907
1740 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ 1908 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1741 1909
1742 do 1910 do
1743 { 1911 {
1912#if EV_VERIFY >= 2
1913 ev_loop_verify (EV_A);
1914#endif
1915
1744#ifndef _WIN32 1916#ifndef _WIN32
1745 if (expect_false (curpid)) /* penalise the forking check even more */ 1917 if (expect_false (curpid)) /* penalise the forking check even more */
1746 if (expect_false (getpid () != curpid)) 1918 if (expect_false (getpid () != curpid))
1747 { 1919 {
1748 curpid = getpid (); 1920 curpid = getpid ();
… …
1789 1961
1790 waittime = MAX_BLOCKTIME; 1962 waittime = MAX_BLOCKTIME;
1791 1963
1792 if (timercnt) 1964 if (timercnt)
1793 { 1965 {
1794 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; 1966 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1795 if (waittime > to) waittime = to; 1967 if (waittime > to) waittime = to;
1796 } 1968 }
1797 1969
1798#if EV_PERIODIC_ENABLE 1970#if EV_PERIODIC_ENABLE
1799 if (periodiccnt) 1971 if (periodiccnt)
1800 { 1972 {
1801 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; 1973 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1802 if (waittime > to) waittime = to; 1974 if (waittime > to) waittime = to;
1803 } 1975 }
1804#endif 1976#endif
1805 1977
1806 if (expect_false (waittime < timeout_blocktime)) 1978 if (expect_false (waittime < timeout_blocktime))
… …
1943 if (expect_false (ev_is_active (w))) 2115 if (expect_false (ev_is_active (w)))
1944 return; 2116 return;
1945 2117
1946 assert (("ev_io_start called with negative fd", fd >= 0)); 2118 assert (("ev_io_start called with negative fd", fd >= 0));
1947 2119
2120 EV_FREQUENT_CHECK;
2121
1948 ev_start (EV_A_ (W)w, 1); 2122 ev_start (EV_A_ (W)w, 1);
1949 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2123 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1950 wlist_add (&anfds[fd].head, (WL)w); 2124 wlist_add (&anfds[fd].head, (WL)w);
1951 2125
1952 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2126 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1953 w->events &= ~EV_IOFDSET; 2127 w->events &= ~EV_IOFDSET;
2128
2129 EV_FREQUENT_CHECK;
1954} 2130}
1955 2131
1956void noinline 2132void noinline
1957ev_io_stop (EV_P_ ev_io *w) 2133ev_io_stop (EV_P_ ev_io *w)
1958{ 2134{
1959 clear_pending (EV_A_ (W)w); 2135 clear_pending (EV_A_ (W)w);
1960 if (expect_false (!ev_is_active (w))) 2136 if (expect_false (!ev_is_active (w)))
1961 return; 2137 return;
1962 2138
1963 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2139 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2140
2141 EV_FREQUENT_CHECK;
1964 2142
1965 wlist_del (&anfds[w->fd].head, (WL)w); 2143 wlist_del (&anfds[w->fd].head, (WL)w);
1966 ev_stop (EV_A_ (W)w); 2144 ev_stop (EV_A_ (W)w);
1967 2145
1968 fd_change (EV_A_ w->fd, 1); 2146 fd_change (EV_A_ w->fd, 1);
2147
2148 EV_FREQUENT_CHECK;
1969} 2149}
1970 2150
1971void noinline 2151void noinline
1972ev_timer_start (EV_P_ ev_timer *w) 2152ev_timer_start (EV_P_ ev_timer *w)
1973{ 2153{
… …
1976 2156
1977 ev_at (w) += mn_now; 2157 ev_at (w) += mn_now;
1978 2158
1979 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2159 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1980 2160
2161 EV_FREQUENT_CHECK;
2162
2163 ++timercnt;
1981 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2164 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1982 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); 2165 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1983 timers [ev_active (w)] = (WT)w; 2166 ANHE_w (timers [ev_active (w)]) = (WT)w;
2167 ANHE_at_cache (timers [ev_active (w)]);
1984 upheap (timers, ev_active (w)); 2168 upheap (timers, ev_active (w));
1985 2169
2170 EV_FREQUENT_CHECK;
2171
1986 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2172 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1987} 2173}
1988 2174
1989void noinline 2175void noinline
1990ev_timer_stop (EV_P_ ev_timer *w) 2176ev_timer_stop (EV_P_ ev_timer *w)
1991{ 2177{
1992 clear_pending (EV_A_ (W)w); 2178 clear_pending (EV_A_ (W)w);
1993 if (expect_false (!ev_is_active (w))) 2179 if (expect_false (!ev_is_active (w)))
1994 return; 2180 return;
1995 2181
2182 EV_FREQUENT_CHECK;
2183
1996 { 2184 {
1997 int active = ev_active (w); 2185 int active = ev_active (w);
1998 2186
1999 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2187 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2000 2188
2189 --timercnt;
2190
2001 if (expect_true (active < timercnt + HEAP0 - 1)) 2191 if (expect_true (active < timercnt + HEAP0))
2002 { 2192 {
2003 timers [active] = timers [timercnt + HEAP0 - 1]; 2193 timers [active] = timers [timercnt + HEAP0];
2004 adjustheap (timers, timercnt, active); 2194 adjustheap (timers, timercnt, active);
2005 } 2195 }
2006
2007 --timercnt;
2008 } 2196 }
2197
2198 EV_FREQUENT_CHECK;
2009 2199
2010 ev_at (w) -= mn_now; 2200 ev_at (w) -= mn_now;
2011 2201
2012 ev_stop (EV_A_ (W)w); 2202 ev_stop (EV_A_ (W)w);
2013} 2203}
2014 2204
2015void noinline 2205void noinline
2016ev_timer_again (EV_P_ ev_timer *w) 2206ev_timer_again (EV_P_ ev_timer *w)
2017{ 2207{
2208 EV_FREQUENT_CHECK;
2209
2018 if (ev_is_active (w)) 2210 if (ev_is_active (w))
2019 { 2211 {
2020 if (w->repeat) 2212 if (w->repeat)
2021 { 2213 {
2022 ev_at (w) = mn_now + w->repeat; 2214 ev_at (w) = mn_now + w->repeat;
2215 ANHE_at_cache (timers [ev_active (w)]);
2023 adjustheap (timers, timercnt, ev_active (w)); 2216 adjustheap (timers, timercnt, ev_active (w));
2024 } 2217 }
2025 else 2218 else
2026 ev_timer_stop (EV_A_ w); 2219 ev_timer_stop (EV_A_ w);
2027 } 2220 }
2028 else if (w->repeat) 2221 else if (w->repeat)
2029 { 2222 {
2030 ev_at (w) = w->repeat; 2223 ev_at (w) = w->repeat;
2031 ev_timer_start (EV_A_ w); 2224 ev_timer_start (EV_A_ w);
2032 } 2225 }
2226
2227 EV_FREQUENT_CHECK;
2033} 2228}
2034 2229
2035#if EV_PERIODIC_ENABLE 2230#if EV_PERIODIC_ENABLE
2036void noinline 2231void noinline
2037ev_periodic_start (EV_P_ ev_periodic *w) 2232ev_periodic_start (EV_P_ ev_periodic *w)
… …
2048 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2243 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2049 } 2244 }
2050 else 2245 else
2051 ev_at (w) = w->offset; 2246 ev_at (w) = w->offset;
2052 2247
2248 EV_FREQUENT_CHECK;
2249
2250 ++periodiccnt;
2053 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2251 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2054 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); 2252 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2055 periodics [ev_active (w)] = (WT)w; 2253 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2254 ANHE_at_cache (periodics [ev_active (w)]);
2056 upheap (periodics, ev_active (w)); 2255 upheap (periodics, ev_active (w));
2057 2256
2257 EV_FREQUENT_CHECK;
2258
2058 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2259 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2059} 2260}
2060 2261
2061void noinline 2262void noinline
2062ev_periodic_stop (EV_P_ ev_periodic *w) 2263ev_periodic_stop (EV_P_ ev_periodic *w)
2063{ 2264{
2064 clear_pending (EV_A_ (W)w); 2265 clear_pending (EV_A_ (W)w);
2065 if (expect_false (!ev_is_active (w))) 2266 if (expect_false (!ev_is_active (w)))
2066 return; 2267 return;
2067 2268
2269 EV_FREQUENT_CHECK;
2270
2068 { 2271 {
2069 int active = ev_active (w); 2272 int active = ev_active (w);
2070 2273
2071 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2274 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2072 2275
2276 --periodiccnt;
2277
2073 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2278 if (expect_true (active < periodiccnt + HEAP0))
2074 { 2279 {
2075 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2280 periodics [active] = periodics [periodiccnt + HEAP0];
2076 adjustheap (periodics, periodiccnt, active); 2281 adjustheap (periodics, periodiccnt, active);
2077 } 2282 }
2078
2079 --periodiccnt;
2080 } 2283 }
2284
2285 EV_FREQUENT_CHECK;
2081 2286
2082 ev_stop (EV_A_ (W)w); 2287 ev_stop (EV_A_ (W)w);
2083} 2288}
2084 2289
2085void noinline 2290void noinline
… …
2105 return; 2310 return;
2106 2311
2107 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2312 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2108 2313
2109 evpipe_init (EV_A); 2314 evpipe_init (EV_A);
2315
2316 EV_FREQUENT_CHECK;
2110 2317
2111 { 2318 {
2112#ifndef _WIN32 2319#ifndef _WIN32
2113 sigset_t full, prev; 2320 sigset_t full, prev;
2114 sigfillset (&full); 2321 sigfillset (&full);
… …
2135 sigfillset (&sa.sa_mask); 2342 sigfillset (&sa.sa_mask);
2136 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2343 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2137 sigaction (w->signum, &sa, 0); 2344 sigaction (w->signum, &sa, 0);
2138#endif 2345#endif
2139 } 2346 }
2347
2348 EV_FREQUENT_CHECK;
2140} 2349}
2141 2350
2142void noinline 2351void noinline
2143ev_signal_stop (EV_P_ ev_signal *w) 2352ev_signal_stop (EV_P_ ev_signal *w)
2144{ 2353{
2145 clear_pending (EV_A_ (W)w); 2354 clear_pending (EV_A_ (W)w);
2146 if (expect_false (!ev_is_active (w))) 2355 if (expect_false (!ev_is_active (w)))
2147 return; 2356 return;
2148 2357
2358 EV_FREQUENT_CHECK;
2359
2149 wlist_del (&signals [w->signum - 1].head, (WL)w); 2360 wlist_del (&signals [w->signum - 1].head, (WL)w);
2150 ev_stop (EV_A_ (W)w); 2361 ev_stop (EV_A_ (W)w);
2151 2362
2152 if (!signals [w->signum - 1].head) 2363 if (!signals [w->signum - 1].head)
2153 signal (w->signum, SIG_DFL); 2364 signal (w->signum, SIG_DFL);
2365
2366 EV_FREQUENT_CHECK;
2154} 2367}
2155 2368
2156void 2369void
2157ev_child_start (EV_P_ ev_child *w) 2370ev_child_start (EV_P_ ev_child *w)
2158{ 2371{
… …
2160 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2373 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2161#endif 2374#endif
2162 if (expect_false (ev_is_active (w))) 2375 if (expect_false (ev_is_active (w)))
2163 return; 2376 return;
2164 2377
2378 EV_FREQUENT_CHECK;
2379
2165 ev_start (EV_A_ (W)w, 1); 2380 ev_start (EV_A_ (W)w, 1);
2166 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2381 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2382
2383 EV_FREQUENT_CHECK;
2167} 2384}
2168 2385
2169void 2386void
2170ev_child_stop (EV_P_ ev_child *w) 2387ev_child_stop (EV_P_ ev_child *w)
2171{ 2388{
2172 clear_pending (EV_A_ (W)w); 2389 clear_pending (EV_A_ (W)w);
2173 if (expect_false (!ev_is_active (w))) 2390 if (expect_false (!ev_is_active (w)))
2174 return; 2391 return;
2175 2392
2393 EV_FREQUENT_CHECK;
2394
2176 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2395 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2177 ev_stop (EV_A_ (W)w); 2396 ev_stop (EV_A_ (W)w);
2397
2398 EV_FREQUENT_CHECK;
2178} 2399}
2179 2400
2180#if EV_STAT_ENABLE 2401#if EV_STAT_ENABLE
2181 2402
2182# ifdef _WIN32 2403# ifdef _WIN32
… …
2410 else 2631 else
2411#endif 2632#endif
2412 ev_timer_start (EV_A_ &w->timer); 2633 ev_timer_start (EV_A_ &w->timer);
2413 2634
2414 ev_start (EV_A_ (W)w, 1); 2635 ev_start (EV_A_ (W)w, 1);
2636
2637 EV_FREQUENT_CHECK;
2415} 2638}
2416 2639
2417void 2640void
2418ev_stat_stop (EV_P_ ev_stat *w) 2641ev_stat_stop (EV_P_ ev_stat *w)
2419{ 2642{
2420 clear_pending (EV_A_ (W)w); 2643 clear_pending (EV_A_ (W)w);
2421 if (expect_false (!ev_is_active (w))) 2644 if (expect_false (!ev_is_active (w)))
2422 return; 2645 return;
2423 2646
2647 EV_FREQUENT_CHECK;
2648
2424#if EV_USE_INOTIFY 2649#if EV_USE_INOTIFY
2425 infy_del (EV_A_ w); 2650 infy_del (EV_A_ w);
2426#endif 2651#endif
2427 ev_timer_stop (EV_A_ &w->timer); 2652 ev_timer_stop (EV_A_ &w->timer);
2428 2653
2429 ev_stop (EV_A_ (W)w); 2654 ev_stop (EV_A_ (W)w);
2655
2656 EV_FREQUENT_CHECK;
2430} 2657}
2431#endif 2658#endif
2432 2659
2433#if EV_IDLE_ENABLE 2660#if EV_IDLE_ENABLE
2434void 2661void
… …
2436{ 2663{
2437 if (expect_false (ev_is_active (w))) 2664 if (expect_false (ev_is_active (w)))
2438 return; 2665 return;
2439 2666
2440 pri_adjust (EV_A_ (W)w); 2667 pri_adjust (EV_A_ (W)w);
2668
2669 EV_FREQUENT_CHECK;
2441 2670
2442 { 2671 {
2443 int active = ++idlecnt [ABSPRI (w)]; 2672 int active = ++idlecnt [ABSPRI (w)];
2444 2673
2445 ++idleall; 2674 ++idleall;
2446 ev_start (EV_A_ (W)w, active); 2675 ev_start (EV_A_ (W)w, active);
2447 2676
2448 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2677 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2449 idles [ABSPRI (w)][active - 1] = w; 2678 idles [ABSPRI (w)][active - 1] = w;
2450 } 2679 }
2680
2681 EV_FREQUENT_CHECK;
2451} 2682}
2452 2683
2453void 2684void
2454ev_idle_stop (EV_P_ ev_idle *w) 2685ev_idle_stop (EV_P_ ev_idle *w)
2455{ 2686{
2456 clear_pending (EV_A_ (W)w); 2687 clear_pending (EV_A_ (W)w);
2457 if (expect_false (!ev_is_active (w))) 2688 if (expect_false (!ev_is_active (w)))
2458 return; 2689 return;
2459 2690
2691 EV_FREQUENT_CHECK;
2692
2460 { 2693 {
2461 int active = ev_active (w); 2694 int active = ev_active (w);
2462 2695
2463 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2696 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2464 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2697 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2465 2698
2466 ev_stop (EV_A_ (W)w); 2699 ev_stop (EV_A_ (W)w);
2467 --idleall; 2700 --idleall;
2468 } 2701 }
2702
2703 EV_FREQUENT_CHECK;
2469} 2704}
2470#endif 2705#endif
2471 2706
2472void 2707void
2473ev_prepare_start (EV_P_ ev_prepare *w) 2708ev_prepare_start (EV_P_ ev_prepare *w)
2474{ 2709{
2475 if (expect_false (ev_is_active (w))) 2710 if (expect_false (ev_is_active (w)))
2476 return; 2711 return;
2712
2713 EV_FREQUENT_CHECK;
2477 2714
2478 ev_start (EV_A_ (W)w, ++preparecnt); 2715 ev_start (EV_A_ (W)w, ++preparecnt);
2479 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2716 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2480 prepares [preparecnt - 1] = w; 2717 prepares [preparecnt - 1] = w;
2718
2719 EV_FREQUENT_CHECK;
2481} 2720}
2482 2721
2483void 2722void
2484ev_prepare_stop (EV_P_ ev_prepare *w) 2723ev_prepare_stop (EV_P_ ev_prepare *w)
2485{ 2724{
2486 clear_pending (EV_A_ (W)w); 2725 clear_pending (EV_A_ (W)w);
2487 if (expect_false (!ev_is_active (w))) 2726 if (expect_false (!ev_is_active (w)))
2488 return; 2727 return;
2489 2728
2729 EV_FREQUENT_CHECK;
2730
2490 { 2731 {
2491 int active = ev_active (w); 2732 int active = ev_active (w);
2492 2733
2493 prepares [active - 1] = prepares [--preparecnt]; 2734 prepares [active - 1] = prepares [--preparecnt];
2494 ev_active (prepares [active - 1]) = active; 2735 ev_active (prepares [active - 1]) = active;
2495 } 2736 }
2496 2737
2497 ev_stop (EV_A_ (W)w); 2738 ev_stop (EV_A_ (W)w);
2739
2740 EV_FREQUENT_CHECK;
2498} 2741}
2499 2742
2500void 2743void
2501ev_check_start (EV_P_ ev_check *w) 2744ev_check_start (EV_P_ ev_check *w)
2502{ 2745{
2503 if (expect_false (ev_is_active (w))) 2746 if (expect_false (ev_is_active (w)))
2504 return; 2747 return;
2748
2749 EV_FREQUENT_CHECK;
2505 2750
2506 ev_start (EV_A_ (W)w, ++checkcnt); 2751 ev_start (EV_A_ (W)w, ++checkcnt);
2507 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2752 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2508 checks [checkcnt - 1] = w; 2753 checks [checkcnt - 1] = w;
2754
2755 EV_FREQUENT_CHECK;
2509} 2756}
2510 2757
2511void 2758void
2512ev_check_stop (EV_P_ ev_check *w) 2759ev_check_stop (EV_P_ ev_check *w)
2513{ 2760{
2514 clear_pending (EV_A_ (W)w); 2761 clear_pending (EV_A_ (W)w);
2515 if (expect_false (!ev_is_active (w))) 2762 if (expect_false (!ev_is_active (w)))
2516 return; 2763 return;
2517 2764
2765 EV_FREQUENT_CHECK;
2766
2518 { 2767 {
2519 int active = ev_active (w); 2768 int active = ev_active (w);
2520 2769
2521 checks [active - 1] = checks [--checkcnt]; 2770 checks [active - 1] = checks [--checkcnt];
2522 ev_active (checks [active - 1]) = active; 2771 ev_active (checks [active - 1]) = active;
2523 } 2772 }
2524 2773
2525 ev_stop (EV_A_ (W)w); 2774 ev_stop (EV_A_ (W)w);
2775
2776 EV_FREQUENT_CHECK;
2526} 2777}
2527 2778
2528#if EV_EMBED_ENABLE 2779#if EV_EMBED_ENABLE
2529void noinline 2780void noinline
2530ev_embed_sweep (EV_P_ ev_embed *w) 2781ev_embed_sweep (EV_P_ ev_embed *w)
… …
2577 struct ev_loop *loop = w->other; 2828 struct ev_loop *loop = w->other;
2578 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2829 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); 2830 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2580 } 2831 }
2581 2832
2833 EV_FREQUENT_CHECK;
2834
2582 ev_set_priority (&w->io, ev_priority (w)); 2835 ev_set_priority (&w->io, ev_priority (w));
2583 ev_io_start (EV_A_ &w->io); 2836 ev_io_start (EV_A_ &w->io);
2584 2837
2585 ev_prepare_init (&w->prepare, embed_prepare_cb); 2838 ev_prepare_init (&w->prepare, embed_prepare_cb);
2586 ev_set_priority (&w->prepare, EV_MINPRI); 2839 ev_set_priority (&w->prepare, EV_MINPRI);
2587 ev_prepare_start (EV_A_ &w->prepare); 2840 ev_prepare_start (EV_A_ &w->prepare);
2588 2841
2589 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2842 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2590 2843
2591 ev_start (EV_A_ (W)w, 1); 2844 ev_start (EV_A_ (W)w, 1);
2845
2846 EV_FREQUENT_CHECK;
2592} 2847}
2593 2848
2594void 2849void
2595ev_embed_stop (EV_P_ ev_embed *w) 2850ev_embed_stop (EV_P_ ev_embed *w)
2596{ 2851{
2597 clear_pending (EV_A_ (W)w); 2852 clear_pending (EV_A_ (W)w);
2598 if (expect_false (!ev_is_active (w))) 2853 if (expect_false (!ev_is_active (w)))
2599 return; 2854 return;
2600 2855
2856 EV_FREQUENT_CHECK;
2857
2601 ev_io_stop (EV_A_ &w->io); 2858 ev_io_stop (EV_A_ &w->io);
2602 ev_prepare_stop (EV_A_ &w->prepare); 2859 ev_prepare_stop (EV_A_ &w->prepare);
2603 2860
2604 ev_stop (EV_A_ (W)w); 2861 ev_stop (EV_A_ (W)w);
2862
2863 EV_FREQUENT_CHECK;
2605} 2864}
2606#endif 2865#endif
2607 2866
2608#if EV_FORK_ENABLE 2867#if EV_FORK_ENABLE
2609void 2868void
2610ev_fork_start (EV_P_ ev_fork *w) 2869ev_fork_start (EV_P_ ev_fork *w)
2611{ 2870{
2612 if (expect_false (ev_is_active (w))) 2871 if (expect_false (ev_is_active (w)))
2613 return; 2872 return;
2873
2874 EV_FREQUENT_CHECK;
2614 2875
2615 ev_start (EV_A_ (W)w, ++forkcnt); 2876 ev_start (EV_A_ (W)w, ++forkcnt);
2616 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2877 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2617 forks [forkcnt - 1] = w; 2878 forks [forkcnt - 1] = w;
2879
2880 EV_FREQUENT_CHECK;
2618} 2881}
2619 2882
2620void 2883void
2621ev_fork_stop (EV_P_ ev_fork *w) 2884ev_fork_stop (EV_P_ ev_fork *w)
2622{ 2885{
2623 clear_pending (EV_A_ (W)w); 2886 clear_pending (EV_A_ (W)w);
2624 if (expect_false (!ev_is_active (w))) 2887 if (expect_false (!ev_is_active (w)))
2625 return; 2888 return;
2626 2889
2890 EV_FREQUENT_CHECK;
2891
2627 { 2892 {
2628 int active = ev_active (w); 2893 int active = ev_active (w);
2629 2894
2630 forks [active - 1] = forks [--forkcnt]; 2895 forks [active - 1] = forks [--forkcnt];
2631 ev_active (forks [active - 1]) = active; 2896 ev_active (forks [active - 1]) = active;
2632 } 2897 }
2633 2898
2634 ev_stop (EV_A_ (W)w); 2899 ev_stop (EV_A_ (W)w);
2900
2901 EV_FREQUENT_CHECK;
2635} 2902}
2636#endif 2903#endif
2637 2904
2638#if EV_ASYNC_ENABLE 2905#if EV_ASYNC_ENABLE
2639void 2906void
… …
2641{ 2908{
2642 if (expect_false (ev_is_active (w))) 2909 if (expect_false (ev_is_active (w)))
2643 return; 2910 return;
2644 2911
2645 evpipe_init (EV_A); 2912 evpipe_init (EV_A);
2913
2914 EV_FREQUENT_CHECK;
2646 2915
2647 ev_start (EV_A_ (W)w, ++asynccnt); 2916 ev_start (EV_A_ (W)w, ++asynccnt);
2648 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2917 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2649 asyncs [asynccnt - 1] = w; 2918 asyncs [asynccnt - 1] = w;
2919
2920 EV_FREQUENT_CHECK;
2650} 2921}
2651 2922
2652void 2923void
2653ev_async_stop (EV_P_ ev_async *w) 2924ev_async_stop (EV_P_ ev_async *w)
2654{ 2925{
2655 clear_pending (EV_A_ (W)w); 2926 clear_pending (EV_A_ (W)w);
2656 if (expect_false (!ev_is_active (w))) 2927 if (expect_false (!ev_is_active (w)))
2657 return; 2928 return;
2658 2929
2930 EV_FREQUENT_CHECK;
2931
2659 { 2932 {
2660 int active = ev_active (w); 2933 int active = ev_active (w);
2661 2934
2662 asyncs [active - 1] = asyncs [--asynccnt]; 2935 asyncs [active - 1] = asyncs [--asynccnt];
2663 ev_active (asyncs [active - 1]) = active; 2936 ev_active (asyncs [active - 1]) = active;
2664 } 2937 }
2665 2938
2666 ev_stop (EV_A_ (W)w); 2939 ev_stop (EV_A_ (W)w);
2940
2941 EV_FREQUENT_CHECK;
2667} 2942}
2668 2943
2669void 2944void
2670ev_async_send (EV_P_ ev_async *w) 2945ev_async_send (EV_P_ ev_async *w)
2671{ 2946{

Diff Legend

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