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

Comparing libev/ev.c (file contents):
Revision 1.230 by root, Fri May 2 08:13:16 2008 UTC vs.
Revision 1.252 by root, Thu May 22 03:43:32 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
… …
520 } 563 }
521} 564}
522 565
523/*****************************************************************************/ 566/*****************************************************************************/
524 567
568#define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */
569
525int inline_size 570int inline_size
526array_nextsize (int elem, int cur, int cnt) 571array_nextsize (int elem, int cur, int cnt)
527{ 572{
528 int ncur = cur + 1; 573 int ncur = cur + 1;
529 574
530 do 575 do
531 ncur <<= 1; 576 ncur <<= 1;
532 while (cnt > ncur); 577 while (cnt > ncur);
533 578
534 /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ 579 /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */
535 if (elem * ncur > 4096) 580 if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4)
536 { 581 {
537 ncur *= elem; 582 ncur *= elem;
538 ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; 583 ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1);
539 ncur = ncur - sizeof (void *) * 4; 584 ncur = ncur - sizeof (void *) * 4;
540 ncur /= elem; 585 ncur /= elem;
541 } 586 }
542 587
543 return ncur; 588 return ncur;
… …
757 } 802 }
758} 803}
759 804
760/*****************************************************************************/ 805/*****************************************************************************/
761 806
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/*
814 * at the moment we allow libev the luxury of two heaps,
815 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
816 * which is more cache-efficient.
817 * the difference is about 5% with 50000+ watchers.
818 */
819#if EV_USE_4HEAP
820
821#define DHEAP 4
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
905
762/* towards the root */ 906/* towards the root */
763void inline_speed 907void inline_speed
764upheap (WT *heap, int k) 908upheap (ANHE *heap, int k)
765{ 909{
766 WT w = heap [k]; 910 ANHE he = heap [k];
767 911
768 for (;;) 912 for (;;)
769 { 913 {
770 int p = k >> 1; 914 int p = HPARENT (k);
771 915
772 /* maybe we could use a dummy element at heap [0]? */ 916 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
773 if (!p || heap [p]->at <= w->at)
774 break; 917 break;
775 918
776 heap [k] = heap [p]; 919 heap [k] = heap [p];
777 ev_active (heap [k]) = k; 920 ev_active (ANHE_w (heap [k])) = k;
778 k = p; 921 k = p;
779 } 922 }
780 923
781 heap [k] = w; 924 heap [k] = he;
782 ev_active (heap [k]) = k; 925 ev_active (ANHE_w (he)) = k;
783}
784
785/* away from the root */
786void inline_speed
787downheap (WT *heap, int N, int k)
788{
789 WT w = heap [k];
790
791 for (;;)
792 {
793 int c = k << 1;
794
795 if (c > N)
796 break;
797
798 c += c < N && heap [c]->at > heap [c + 1]->at
799 ? 1 : 0;
800
801 if (w->at <= heap [c]->at)
802 break;
803
804 heap [k] = heap [c];
805 ev_active (heap [k]) = k;
806
807 k = c;
808 }
809
810 heap [k] = w;
811 ev_active (heap [k]) = k;
812} 926}
813 927
814void inline_size 928void inline_size
815adjustheap (WT *heap, int N, int k) 929adjustheap (ANHE *heap, int N, int k)
816{ 930{
931 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
817 upheap (heap, k); 932 upheap (heap, k);
933 else
818 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);
819} 947}
820 948
821/*****************************************************************************/ 949/*****************************************************************************/
822 950
823typedef struct 951typedef struct
… …
912pipecb (EV_P_ ev_io *iow, int revents) 1040pipecb (EV_P_ ev_io *iow, int revents)
913{ 1041{
914#if EV_USE_EVENTFD 1042#if EV_USE_EVENTFD
915 if (evfd >= 0) 1043 if (evfd >= 0)
916 { 1044 {
917 uint64_t counter = 1; 1045 uint64_t counter;
918 read (evfd, &counter, sizeof (uint64_t)); 1046 read (evfd, &counter, sizeof (uint64_t));
919 } 1047 }
920 else 1048 else
921#endif 1049#endif
922 { 1050 {
… …
1341 1469
1342 postfork = 0; 1470 postfork = 0;
1343} 1471}
1344 1472
1345#if EV_MULTIPLICITY 1473#if EV_MULTIPLICITY
1474
1346struct ev_loop * 1475struct ev_loop *
1347ev_loop_new (unsigned int flags) 1476ev_loop_new (unsigned int flags)
1348{ 1477{
1349 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));
1350 1479
… …
1369ev_loop_fork (EV_P) 1498ev_loop_fork (EV_P)
1370{ 1499{
1371 postfork = 1; /* must be in line with ev_default_fork */ 1500 postfork = 1; /* must be in line with ev_default_fork */
1372} 1501}
1373 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 (idleall >= 0);
1574 assert (idlemax [i] >= idlecnt [i]);
1575 array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
1576#endif
1577 }
1578
1579#if EV_FORK_ENABLE
1580 assert (forkmax >= forkcnt);
1581 array_verify (EV_A_ (W *)forks, forkcnt);
1582#endif
1583
1584#if EV_ASYNC_ENABLE
1585 assert (asyncmax >= asynccnt);
1586 array_verify (EV_A_ (W *)asyncs, asynccnt);
1587#endif
1588
1589 assert (preparemax >= preparecnt);
1590 array_verify (EV_A_ (W *)prepares, preparecnt);
1591
1592 assert (checkmax >= checkcnt);
1593 array_verify (EV_A_ (W *)checks, checkcnt);
1594
1595# if 0
1596 for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next)
1597 for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1374#endif 1598# endif
1599#endif
1600}
1601
1602#endif /* multiplicity */
1375 1603
1376#if EV_MULTIPLICITY 1604#if EV_MULTIPLICITY
1377struct ev_loop * 1605struct ev_loop *
1378ev_default_loop_init (unsigned int flags) 1606ev_default_loop_init (unsigned int flags)
1379#else 1607#else
… …
1455 { 1683 {
1456 /*assert (("non-pending watcher on pending list", p->w->pending));*/ 1684 /*assert (("non-pending watcher on pending list", p->w->pending));*/
1457 1685
1458 p->w->pending = 0; 1686 p->w->pending = 0;
1459 EV_CB_INVOKE (p->w, p->events); 1687 EV_CB_INVOKE (p->w, p->events);
1688 EV_FREQUENT_CHECK;
1460 } 1689 }
1461 } 1690 }
1462} 1691}
1463
1464void inline_size
1465timers_reify (EV_P)
1466{
1467 while (timercnt && ev_at (timers [1]) <= mn_now)
1468 {
1469 ev_timer *w = (ev_timer *)timers [1];
1470
1471 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1472
1473 /* first reschedule or stop timer */
1474 if (w->repeat)
1475 {
1476 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1477
1478 ev_at (w) += w->repeat;
1479 if (ev_at (w) < mn_now)
1480 ev_at (w) = mn_now;
1481
1482 downheap (timers, timercnt, 1);
1483 }
1484 else
1485 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1486
1487 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1488 }
1489}
1490
1491#if EV_PERIODIC_ENABLE
1492void inline_size
1493periodics_reify (EV_P)
1494{
1495 while (periodiccnt && ev_at (periodics [1]) <= ev_rt_now)
1496 {
1497 ev_periodic *w = (ev_periodic *)periodics [1];
1498
1499 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1500
1501 /* first reschedule or stop timer */
1502 if (w->reschedule_cb)
1503 {
1504 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1505 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));
1506 downheap (periodics, periodiccnt, 1);
1507 }
1508 else if (w->interval)
1509 {
1510 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1511 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1512 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));
1513 downheap (periodics, periodiccnt, 1);
1514 }
1515 else
1516 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1517
1518 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1519 }
1520}
1521
1522static void noinline
1523periodics_reschedule (EV_P)
1524{
1525 int i;
1526
1527 /* adjust periodics after time jump */
1528 for (i = 0; i < periodiccnt; ++i)
1529 {
1530 ev_periodic *w = (ev_periodic *)periodics [i];
1531
1532 if (w->reschedule_cb)
1533 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1534 else if (w->interval)
1535 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1536 }
1537
1538 /* now rebuild the heap */
1539 for (i = periodiccnt >> 1; i--; )
1540 downheap (periodics, periodiccnt, i);
1541}
1542#endif
1543 1692
1544#if EV_IDLE_ENABLE 1693#if EV_IDLE_ENABLE
1545void inline_size 1694void inline_size
1546idle_reify (EV_P) 1695idle_reify (EV_P)
1547{ 1696{
… …
1559 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1708 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1560 break; 1709 break;
1561 } 1710 }
1562 } 1711 }
1563 } 1712 }
1713}
1714#endif
1715
1716void inline_size
1717timers_reify (EV_P)
1718{
1719 EV_FREQUENT_CHECK;
1720
1721 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1722 {
1723 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1724
1725 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1726
1727 /* first reschedule or stop timer */
1728 if (w->repeat)
1729 {
1730 ev_at (w) += w->repeat;
1731 if (ev_at (w) < mn_now)
1732 ev_at (w) = mn_now;
1733
1734 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1735
1736 ANHE_at_cache (timers [HEAP0]);
1737 downheap (timers, timercnt, HEAP0);
1738 }
1739 else
1740 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1741
1742 EV_FREQUENT_CHECK;
1743 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1744 }
1745}
1746
1747#if EV_PERIODIC_ENABLE
1748void inline_size
1749periodics_reify (EV_P)
1750{
1751 EV_FREQUENT_CHECK;
1752
1753 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1754 {
1755 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1756
1757 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1758
1759 /* first reschedule or stop timer */
1760 if (w->reschedule_cb)
1761 {
1762 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1763
1764 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1765
1766 ANHE_at_cache (periodics [HEAP0]);
1767 downheap (periodics, periodiccnt, HEAP0);
1768 }
1769 else if (w->interval)
1770 {
1771 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1772 /* if next trigger time is not sufficiently in the future, put it there */
1773 /* this might happen because of floating point inexactness */
1774 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1775 {
1776 ev_at (w) += w->interval;
1777
1778 /* if interval is unreasonably low we might still have a time in the past */
1779 /* so correct this. this will make the periodic very inexact, but the user */
1780 /* has effectively asked to get triggered more often than possible */
1781 if (ev_at (w) < ev_rt_now)
1782 ev_at (w) = ev_rt_now;
1783 }
1784
1785 ANHE_at_cache (periodics [HEAP0]);
1786 downheap (periodics, periodiccnt, HEAP0);
1787 }
1788 else
1789 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1790
1791 EV_FREQUENT_CHECK;
1792 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1793 }
1794}
1795
1796static void noinline
1797periodics_reschedule (EV_P)
1798{
1799 int i;
1800
1801 /* adjust periodics after time jump */
1802 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1803 {
1804 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1805
1806 if (w->reschedule_cb)
1807 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1808 else if (w->interval)
1809 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1810
1811 ANHE_at_cache (periodics [i]);
1812 }
1813
1814 reheap (periodics, periodiccnt);
1564} 1815}
1565#endif 1816#endif
1566 1817
1567void inline_speed 1818void inline_speed
1568time_update (EV_P_ ev_tstamp max_block) 1819time_update (EV_P_ ev_tstamp max_block)
… …
1597 */ 1848 */
1598 for (i = 4; --i; ) 1849 for (i = 4; --i; )
1599 { 1850 {
1600 rtmn_diff = ev_rt_now - mn_now; 1851 rtmn_diff = ev_rt_now - mn_now;
1601 1852
1602 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1853 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1603 return; /* all is well */ 1854 return; /* all is well */
1604 1855
1605 ev_rt_now = ev_time (); 1856 ev_rt_now = ev_time ();
1606 mn_now = get_clock (); 1857 mn_now = get_clock ();
1607 now_floor = mn_now; 1858 now_floor = mn_now;
… …
1622 { 1873 {
1623#if EV_PERIODIC_ENABLE 1874#if EV_PERIODIC_ENABLE
1624 periodics_reschedule (EV_A); 1875 periodics_reschedule (EV_A);
1625#endif 1876#endif
1626 /* adjust timers. this is easy, as the offset is the same for all of them */ 1877 /* adjust timers. this is easy, as the offset is the same for all of them */
1627 for (i = 1; i <= timercnt; ++i) 1878 for (i = 0; i < timercnt; ++i)
1628 ev_at (timers [i]) += ev_rt_now - mn_now; 1879 {
1880 ANHE *he = timers + i + HEAP0;
1881 ANHE_w (*he)->at += ev_rt_now - mn_now;
1882 ANHE_at_cache (*he);
1883 }
1629 } 1884 }
1630 1885
1631 mn_now = ev_rt_now; 1886 mn_now = ev_rt_now;
1632 } 1887 }
1633} 1888}
… …
1653 1908
1654 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ 1909 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1655 1910
1656 do 1911 do
1657 { 1912 {
1913#if EV_VERIFY >= 2
1914 ev_loop_verify (EV_A);
1915#endif
1916
1658#ifndef _WIN32 1917#ifndef _WIN32
1659 if (expect_false (curpid)) /* penalise the forking check even more */ 1918 if (expect_false (curpid)) /* penalise the forking check even more */
1660 if (expect_false (getpid () != curpid)) 1919 if (expect_false (getpid () != curpid))
1661 { 1920 {
1662 curpid = getpid (); 1921 curpid = getpid ();
… …
1703 1962
1704 waittime = MAX_BLOCKTIME; 1963 waittime = MAX_BLOCKTIME;
1705 1964
1706 if (timercnt) 1965 if (timercnt)
1707 { 1966 {
1708 ev_tstamp to = ev_at (timers [1]) - mn_now + backend_fudge; 1967 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1709 if (waittime > to) waittime = to; 1968 if (waittime > to) waittime = to;
1710 } 1969 }
1711 1970
1712#if EV_PERIODIC_ENABLE 1971#if EV_PERIODIC_ENABLE
1713 if (periodiccnt) 1972 if (periodiccnt)
1714 { 1973 {
1715 ev_tstamp to = ev_at (periodics [1]) - ev_rt_now + backend_fudge; 1974 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1716 if (waittime > to) waittime = to; 1975 if (waittime > to) waittime = to;
1717 } 1976 }
1718#endif 1977#endif
1719 1978
1720 if (expect_false (waittime < timeout_blocktime)) 1979 if (expect_false (waittime < timeout_blocktime))
… …
1857 if (expect_false (ev_is_active (w))) 2116 if (expect_false (ev_is_active (w)))
1858 return; 2117 return;
1859 2118
1860 assert (("ev_io_start called with negative fd", fd >= 0)); 2119 assert (("ev_io_start called with negative fd", fd >= 0));
1861 2120
2121 EV_FREQUENT_CHECK;
2122
1862 ev_start (EV_A_ (W)w, 1); 2123 ev_start (EV_A_ (W)w, 1);
1863 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2124 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1864 wlist_add (&anfds[fd].head, (WL)w); 2125 wlist_add (&anfds[fd].head, (WL)w);
1865 2126
1866 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2127 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1867 w->events &= ~EV_IOFDSET; 2128 w->events &= ~EV_IOFDSET;
2129
2130 EV_FREQUENT_CHECK;
1868} 2131}
1869 2132
1870void noinline 2133void noinline
1871ev_io_stop (EV_P_ ev_io *w) 2134ev_io_stop (EV_P_ ev_io *w)
1872{ 2135{
1873 clear_pending (EV_A_ (W)w); 2136 clear_pending (EV_A_ (W)w);
1874 if (expect_false (!ev_is_active (w))) 2137 if (expect_false (!ev_is_active (w)))
1875 return; 2138 return;
1876 2139
1877 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2140 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2141
2142 EV_FREQUENT_CHECK;
1878 2143
1879 wlist_del (&anfds[w->fd].head, (WL)w); 2144 wlist_del (&anfds[w->fd].head, (WL)w);
1880 ev_stop (EV_A_ (W)w); 2145 ev_stop (EV_A_ (W)w);
1881 2146
1882 fd_change (EV_A_ w->fd, 1); 2147 fd_change (EV_A_ w->fd, 1);
2148
2149 EV_FREQUENT_CHECK;
1883} 2150}
1884 2151
1885void noinline 2152void noinline
1886ev_timer_start (EV_P_ ev_timer *w) 2153ev_timer_start (EV_P_ ev_timer *w)
1887{ 2154{
… …
1890 2157
1891 ev_at (w) += mn_now; 2158 ev_at (w) += mn_now;
1892 2159
1893 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2160 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1894 2161
2162 EV_FREQUENT_CHECK;
2163
2164 ++timercnt;
1895 ev_start (EV_A_ (W)w, ++timercnt); 2165 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1896 array_needsize (WT, timers, timermax, timercnt + 1, EMPTY2); 2166 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1897 timers [timercnt] = (WT)w; 2167 ANHE_w (timers [ev_active (w)]) = (WT)w;
2168 ANHE_at_cache (timers [ev_active (w)]);
1898 upheap (timers, timercnt); 2169 upheap (timers, ev_active (w));
1899 2170
2171 EV_FREQUENT_CHECK;
2172
1900 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2173 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1901} 2174}
1902 2175
1903void noinline 2176void noinline
1904ev_timer_stop (EV_P_ ev_timer *w) 2177ev_timer_stop (EV_P_ ev_timer *w)
1905{ 2178{
1906 clear_pending (EV_A_ (W)w); 2179 clear_pending (EV_A_ (W)w);
1907 if (expect_false (!ev_is_active (w))) 2180 if (expect_false (!ev_is_active (w)))
1908 return; 2181 return;
1909 2182
2183 EV_FREQUENT_CHECK;
2184
1910 { 2185 {
1911 int active = ev_active (w); 2186 int active = ev_active (w);
1912 2187
1913 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2188 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
1914 2189
2190 --timercnt;
2191
1915 if (expect_true (active < timercnt)) 2192 if (expect_true (active < timercnt + HEAP0))
1916 { 2193 {
1917 timers [active] = timers [timercnt]; 2194 timers [active] = timers [timercnt + HEAP0];
1918 adjustheap (timers, timercnt, active); 2195 adjustheap (timers, timercnt, active);
1919 } 2196 }
1920
1921 --timercnt;
1922 } 2197 }
2198
2199 EV_FREQUENT_CHECK;
1923 2200
1924 ev_at (w) -= mn_now; 2201 ev_at (w) -= mn_now;
1925 2202
1926 ev_stop (EV_A_ (W)w); 2203 ev_stop (EV_A_ (W)w);
1927} 2204}
1928 2205
1929void noinline 2206void noinline
1930ev_timer_again (EV_P_ ev_timer *w) 2207ev_timer_again (EV_P_ ev_timer *w)
1931{ 2208{
2209 EV_FREQUENT_CHECK;
2210
1932 if (ev_is_active (w)) 2211 if (ev_is_active (w))
1933 { 2212 {
1934 if (w->repeat) 2213 if (w->repeat)
1935 { 2214 {
1936 ev_at (w) = mn_now + w->repeat; 2215 ev_at (w) = mn_now + w->repeat;
2216 ANHE_at_cache (timers [ev_active (w)]);
1937 adjustheap (timers, timercnt, ev_active (w)); 2217 adjustheap (timers, timercnt, ev_active (w));
1938 } 2218 }
1939 else 2219 else
1940 ev_timer_stop (EV_A_ w); 2220 ev_timer_stop (EV_A_ w);
1941 } 2221 }
1942 else if (w->repeat) 2222 else if (w->repeat)
1943 { 2223 {
1944 ev_at (w) = w->repeat; 2224 ev_at (w) = w->repeat;
1945 ev_timer_start (EV_A_ w); 2225 ev_timer_start (EV_A_ w);
1946 } 2226 }
2227
2228 EV_FREQUENT_CHECK;
1947} 2229}
1948 2230
1949#if EV_PERIODIC_ENABLE 2231#if EV_PERIODIC_ENABLE
1950void noinline 2232void noinline
1951ev_periodic_start (EV_P_ ev_periodic *w) 2233ev_periodic_start (EV_P_ ev_periodic *w)
… …
1962 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2244 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1963 } 2245 }
1964 else 2246 else
1965 ev_at (w) = w->offset; 2247 ev_at (w) = w->offset;
1966 2248
2249 EV_FREQUENT_CHECK;
2250
2251 ++periodiccnt;
1967 ev_start (EV_A_ (W)w, ++periodiccnt); 2252 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
1968 array_needsize (WT, periodics, periodicmax, periodiccnt + 1, EMPTY2); 2253 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
1969 periodics [periodiccnt] = (WT)w; 2254 ANHE_w (periodics [ev_active (w)]) = (WT)w;
1970 upheap (periodics, periodiccnt); 2255 ANHE_at_cache (periodics [ev_active (w)]);
2256 upheap (periodics, ev_active (w));
1971 2257
2258 EV_FREQUENT_CHECK;
2259
1972 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2260 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
1973} 2261}
1974 2262
1975void noinline 2263void noinline
1976ev_periodic_stop (EV_P_ ev_periodic *w) 2264ev_periodic_stop (EV_P_ ev_periodic *w)
1977{ 2265{
1978 clear_pending (EV_A_ (W)w); 2266 clear_pending (EV_A_ (W)w);
1979 if (expect_false (!ev_is_active (w))) 2267 if (expect_false (!ev_is_active (w)))
1980 return; 2268 return;
1981 2269
2270 EV_FREQUENT_CHECK;
2271
1982 { 2272 {
1983 int active = ev_active (w); 2273 int active = ev_active (w);
1984 2274
1985 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2275 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
1986 2276
2277 --periodiccnt;
2278
1987 if (expect_true (active < periodiccnt)) 2279 if (expect_true (active < periodiccnt + HEAP0))
1988 { 2280 {
1989 periodics [active] = periodics [periodiccnt]; 2281 periodics [active] = periodics [periodiccnt + HEAP0];
1990 adjustheap (periodics, periodiccnt, active); 2282 adjustheap (periodics, periodiccnt, active);
1991 } 2283 }
1992
1993 --periodiccnt;
1994 } 2284 }
2285
2286 EV_FREQUENT_CHECK;
1995 2287
1996 ev_stop (EV_A_ (W)w); 2288 ev_stop (EV_A_ (W)w);
1997} 2289}
1998 2290
1999void noinline 2291void noinline
… …
2019 return; 2311 return;
2020 2312
2021 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2313 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2022 2314
2023 evpipe_init (EV_A); 2315 evpipe_init (EV_A);
2316
2317 EV_FREQUENT_CHECK;
2024 2318
2025 { 2319 {
2026#ifndef _WIN32 2320#ifndef _WIN32
2027 sigset_t full, prev; 2321 sigset_t full, prev;
2028 sigfillset (&full); 2322 sigfillset (&full);
… …
2049 sigfillset (&sa.sa_mask); 2343 sigfillset (&sa.sa_mask);
2050 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2344 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2051 sigaction (w->signum, &sa, 0); 2345 sigaction (w->signum, &sa, 0);
2052#endif 2346#endif
2053 } 2347 }
2348
2349 EV_FREQUENT_CHECK;
2054} 2350}
2055 2351
2056void noinline 2352void noinline
2057ev_signal_stop (EV_P_ ev_signal *w) 2353ev_signal_stop (EV_P_ ev_signal *w)
2058{ 2354{
2059 clear_pending (EV_A_ (W)w); 2355 clear_pending (EV_A_ (W)w);
2060 if (expect_false (!ev_is_active (w))) 2356 if (expect_false (!ev_is_active (w)))
2061 return; 2357 return;
2062 2358
2359 EV_FREQUENT_CHECK;
2360
2063 wlist_del (&signals [w->signum - 1].head, (WL)w); 2361 wlist_del (&signals [w->signum - 1].head, (WL)w);
2064 ev_stop (EV_A_ (W)w); 2362 ev_stop (EV_A_ (W)w);
2065 2363
2066 if (!signals [w->signum - 1].head) 2364 if (!signals [w->signum - 1].head)
2067 signal (w->signum, SIG_DFL); 2365 signal (w->signum, SIG_DFL);
2366
2367 EV_FREQUENT_CHECK;
2068} 2368}
2069 2369
2070void 2370void
2071ev_child_start (EV_P_ ev_child *w) 2371ev_child_start (EV_P_ ev_child *w)
2072{ 2372{
… …
2074 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2374 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2075#endif 2375#endif
2076 if (expect_false (ev_is_active (w))) 2376 if (expect_false (ev_is_active (w)))
2077 return; 2377 return;
2078 2378
2379 EV_FREQUENT_CHECK;
2380
2079 ev_start (EV_A_ (W)w, 1); 2381 ev_start (EV_A_ (W)w, 1);
2080 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2382 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2383
2384 EV_FREQUENT_CHECK;
2081} 2385}
2082 2386
2083void 2387void
2084ev_child_stop (EV_P_ ev_child *w) 2388ev_child_stop (EV_P_ ev_child *w)
2085{ 2389{
2086 clear_pending (EV_A_ (W)w); 2390 clear_pending (EV_A_ (W)w);
2087 if (expect_false (!ev_is_active (w))) 2391 if (expect_false (!ev_is_active (w)))
2088 return; 2392 return;
2089 2393
2394 EV_FREQUENT_CHECK;
2395
2090 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2396 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2091 ev_stop (EV_A_ (W)w); 2397 ev_stop (EV_A_ (W)w);
2398
2399 EV_FREQUENT_CHECK;
2092} 2400}
2093 2401
2094#if EV_STAT_ENABLE 2402#if EV_STAT_ENABLE
2095 2403
2096# ifdef _WIN32 2404# ifdef _WIN32
… …
2114 if (w->wd < 0) 2422 if (w->wd < 0)
2115 { 2423 {
2116 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ 2424 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2117 2425
2118 /* monitor some parent directory for speedup hints */ 2426 /* monitor some parent directory for speedup hints */
2427 /* note that exceeding the hardcoded limit is not a correctness issue, */
2428 /* but an efficiency issue only */
2119 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) 2429 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2120 { 2430 {
2121 char path [4096]; 2431 char path [4096];
2122 strcpy (path, w->path); 2432 strcpy (path, w->path);
2123 2433
… …
2322 else 2632 else
2323#endif 2633#endif
2324 ev_timer_start (EV_A_ &w->timer); 2634 ev_timer_start (EV_A_ &w->timer);
2325 2635
2326 ev_start (EV_A_ (W)w, 1); 2636 ev_start (EV_A_ (W)w, 1);
2637
2638 EV_FREQUENT_CHECK;
2327} 2639}
2328 2640
2329void 2641void
2330ev_stat_stop (EV_P_ ev_stat *w) 2642ev_stat_stop (EV_P_ ev_stat *w)
2331{ 2643{
2332 clear_pending (EV_A_ (W)w); 2644 clear_pending (EV_A_ (W)w);
2333 if (expect_false (!ev_is_active (w))) 2645 if (expect_false (!ev_is_active (w)))
2334 return; 2646 return;
2335 2647
2648 EV_FREQUENT_CHECK;
2649
2336#if EV_USE_INOTIFY 2650#if EV_USE_INOTIFY
2337 infy_del (EV_A_ w); 2651 infy_del (EV_A_ w);
2338#endif 2652#endif
2339 ev_timer_stop (EV_A_ &w->timer); 2653 ev_timer_stop (EV_A_ &w->timer);
2340 2654
2341 ev_stop (EV_A_ (W)w); 2655 ev_stop (EV_A_ (W)w);
2656
2657 EV_FREQUENT_CHECK;
2342} 2658}
2343#endif 2659#endif
2344 2660
2345#if EV_IDLE_ENABLE 2661#if EV_IDLE_ENABLE
2346void 2662void
… …
2348{ 2664{
2349 if (expect_false (ev_is_active (w))) 2665 if (expect_false (ev_is_active (w)))
2350 return; 2666 return;
2351 2667
2352 pri_adjust (EV_A_ (W)w); 2668 pri_adjust (EV_A_ (W)w);
2669
2670 EV_FREQUENT_CHECK;
2353 2671
2354 { 2672 {
2355 int active = ++idlecnt [ABSPRI (w)]; 2673 int active = ++idlecnt [ABSPRI (w)];
2356 2674
2357 ++idleall; 2675 ++idleall;
2358 ev_start (EV_A_ (W)w, active); 2676 ev_start (EV_A_ (W)w, active);
2359 2677
2360 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2678 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2361 idles [ABSPRI (w)][active - 1] = w; 2679 idles [ABSPRI (w)][active - 1] = w;
2362 } 2680 }
2681
2682 EV_FREQUENT_CHECK;
2363} 2683}
2364 2684
2365void 2685void
2366ev_idle_stop (EV_P_ ev_idle *w) 2686ev_idle_stop (EV_P_ ev_idle *w)
2367{ 2687{
2368 clear_pending (EV_A_ (W)w); 2688 clear_pending (EV_A_ (W)w);
2369 if (expect_false (!ev_is_active (w))) 2689 if (expect_false (!ev_is_active (w)))
2370 return; 2690 return;
2371 2691
2692 EV_FREQUENT_CHECK;
2693
2372 { 2694 {
2373 int active = ev_active (w); 2695 int active = ev_active (w);
2374 2696
2375 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2697 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2376 ev_active (idles [ABSPRI (w)][active - 1]) = active; 2698 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2377 2699
2378 ev_stop (EV_A_ (W)w); 2700 ev_stop (EV_A_ (W)w);
2379 --idleall; 2701 --idleall;
2380 } 2702 }
2703
2704 EV_FREQUENT_CHECK;
2381} 2705}
2382#endif 2706#endif
2383 2707
2384void 2708void
2385ev_prepare_start (EV_P_ ev_prepare *w) 2709ev_prepare_start (EV_P_ ev_prepare *w)
2386{ 2710{
2387 if (expect_false (ev_is_active (w))) 2711 if (expect_false (ev_is_active (w)))
2388 return; 2712 return;
2713
2714 EV_FREQUENT_CHECK;
2389 2715
2390 ev_start (EV_A_ (W)w, ++preparecnt); 2716 ev_start (EV_A_ (W)w, ++preparecnt);
2391 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2717 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2392 prepares [preparecnt - 1] = w; 2718 prepares [preparecnt - 1] = w;
2719
2720 EV_FREQUENT_CHECK;
2393} 2721}
2394 2722
2395void 2723void
2396ev_prepare_stop (EV_P_ ev_prepare *w) 2724ev_prepare_stop (EV_P_ ev_prepare *w)
2397{ 2725{
2398 clear_pending (EV_A_ (W)w); 2726 clear_pending (EV_A_ (W)w);
2399 if (expect_false (!ev_is_active (w))) 2727 if (expect_false (!ev_is_active (w)))
2400 return; 2728 return;
2401 2729
2730 EV_FREQUENT_CHECK;
2731
2402 { 2732 {
2403 int active = ev_active (w); 2733 int active = ev_active (w);
2404 2734
2405 prepares [active - 1] = prepares [--preparecnt]; 2735 prepares [active - 1] = prepares [--preparecnt];
2406 ev_active (prepares [active - 1]) = active; 2736 ev_active (prepares [active - 1]) = active;
2407 } 2737 }
2408 2738
2409 ev_stop (EV_A_ (W)w); 2739 ev_stop (EV_A_ (W)w);
2740
2741 EV_FREQUENT_CHECK;
2410} 2742}
2411 2743
2412void 2744void
2413ev_check_start (EV_P_ ev_check *w) 2745ev_check_start (EV_P_ ev_check *w)
2414{ 2746{
2415 if (expect_false (ev_is_active (w))) 2747 if (expect_false (ev_is_active (w)))
2416 return; 2748 return;
2749
2750 EV_FREQUENT_CHECK;
2417 2751
2418 ev_start (EV_A_ (W)w, ++checkcnt); 2752 ev_start (EV_A_ (W)w, ++checkcnt);
2419 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2753 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2420 checks [checkcnt - 1] = w; 2754 checks [checkcnt - 1] = w;
2755
2756 EV_FREQUENT_CHECK;
2421} 2757}
2422 2758
2423void 2759void
2424ev_check_stop (EV_P_ ev_check *w) 2760ev_check_stop (EV_P_ ev_check *w)
2425{ 2761{
2426 clear_pending (EV_A_ (W)w); 2762 clear_pending (EV_A_ (W)w);
2427 if (expect_false (!ev_is_active (w))) 2763 if (expect_false (!ev_is_active (w)))
2428 return; 2764 return;
2429 2765
2766 EV_FREQUENT_CHECK;
2767
2430 { 2768 {
2431 int active = ev_active (w); 2769 int active = ev_active (w);
2432 2770
2433 checks [active - 1] = checks [--checkcnt]; 2771 checks [active - 1] = checks [--checkcnt];
2434 ev_active (checks [active - 1]) = active; 2772 ev_active (checks [active - 1]) = active;
2435 } 2773 }
2436 2774
2437 ev_stop (EV_A_ (W)w); 2775 ev_stop (EV_A_ (W)w);
2776
2777 EV_FREQUENT_CHECK;
2438} 2778}
2439 2779
2440#if EV_EMBED_ENABLE 2780#if EV_EMBED_ENABLE
2441void noinline 2781void noinline
2442ev_embed_sweep (EV_P_ ev_embed *w) 2782ev_embed_sweep (EV_P_ ev_embed *w)
… …
2489 struct ev_loop *loop = w->other; 2829 struct ev_loop *loop = w->other;
2490 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2830 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2491 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); 2831 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2492 } 2832 }
2493 2833
2834 EV_FREQUENT_CHECK;
2835
2494 ev_set_priority (&w->io, ev_priority (w)); 2836 ev_set_priority (&w->io, ev_priority (w));
2495 ev_io_start (EV_A_ &w->io); 2837 ev_io_start (EV_A_ &w->io);
2496 2838
2497 ev_prepare_init (&w->prepare, embed_prepare_cb); 2839 ev_prepare_init (&w->prepare, embed_prepare_cb);
2498 ev_set_priority (&w->prepare, EV_MINPRI); 2840 ev_set_priority (&w->prepare, EV_MINPRI);
2499 ev_prepare_start (EV_A_ &w->prepare); 2841 ev_prepare_start (EV_A_ &w->prepare);
2500 2842
2501 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2843 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2502 2844
2503 ev_start (EV_A_ (W)w, 1); 2845 ev_start (EV_A_ (W)w, 1);
2846
2847 EV_FREQUENT_CHECK;
2504} 2848}
2505 2849
2506void 2850void
2507ev_embed_stop (EV_P_ ev_embed *w) 2851ev_embed_stop (EV_P_ ev_embed *w)
2508{ 2852{
2509 clear_pending (EV_A_ (W)w); 2853 clear_pending (EV_A_ (W)w);
2510 if (expect_false (!ev_is_active (w))) 2854 if (expect_false (!ev_is_active (w)))
2511 return; 2855 return;
2512 2856
2857 EV_FREQUENT_CHECK;
2858
2513 ev_io_stop (EV_A_ &w->io); 2859 ev_io_stop (EV_A_ &w->io);
2514 ev_prepare_stop (EV_A_ &w->prepare); 2860 ev_prepare_stop (EV_A_ &w->prepare);
2515 2861
2516 ev_stop (EV_A_ (W)w); 2862 ev_stop (EV_A_ (W)w);
2863
2864 EV_FREQUENT_CHECK;
2517} 2865}
2518#endif 2866#endif
2519 2867
2520#if EV_FORK_ENABLE 2868#if EV_FORK_ENABLE
2521void 2869void
2522ev_fork_start (EV_P_ ev_fork *w) 2870ev_fork_start (EV_P_ ev_fork *w)
2523{ 2871{
2524 if (expect_false (ev_is_active (w))) 2872 if (expect_false (ev_is_active (w)))
2525 return; 2873 return;
2874
2875 EV_FREQUENT_CHECK;
2526 2876
2527 ev_start (EV_A_ (W)w, ++forkcnt); 2877 ev_start (EV_A_ (W)w, ++forkcnt);
2528 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2878 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2529 forks [forkcnt - 1] = w; 2879 forks [forkcnt - 1] = w;
2880
2881 EV_FREQUENT_CHECK;
2530} 2882}
2531 2883
2532void 2884void
2533ev_fork_stop (EV_P_ ev_fork *w) 2885ev_fork_stop (EV_P_ ev_fork *w)
2534{ 2886{
2535 clear_pending (EV_A_ (W)w); 2887 clear_pending (EV_A_ (W)w);
2536 if (expect_false (!ev_is_active (w))) 2888 if (expect_false (!ev_is_active (w)))
2537 return; 2889 return;
2538 2890
2891 EV_FREQUENT_CHECK;
2892
2539 { 2893 {
2540 int active = ev_active (w); 2894 int active = ev_active (w);
2541 2895
2542 forks [active - 1] = forks [--forkcnt]; 2896 forks [active - 1] = forks [--forkcnt];
2543 ev_active (forks [active - 1]) = active; 2897 ev_active (forks [active - 1]) = active;
2544 } 2898 }
2545 2899
2546 ev_stop (EV_A_ (W)w); 2900 ev_stop (EV_A_ (W)w);
2901
2902 EV_FREQUENT_CHECK;
2547} 2903}
2548#endif 2904#endif
2549 2905
2550#if EV_ASYNC_ENABLE 2906#if EV_ASYNC_ENABLE
2551void 2907void
… …
2553{ 2909{
2554 if (expect_false (ev_is_active (w))) 2910 if (expect_false (ev_is_active (w)))
2555 return; 2911 return;
2556 2912
2557 evpipe_init (EV_A); 2913 evpipe_init (EV_A);
2914
2915 EV_FREQUENT_CHECK;
2558 2916
2559 ev_start (EV_A_ (W)w, ++asynccnt); 2917 ev_start (EV_A_ (W)w, ++asynccnt);
2560 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2918 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2561 asyncs [asynccnt - 1] = w; 2919 asyncs [asynccnt - 1] = w;
2920
2921 EV_FREQUENT_CHECK;
2562} 2922}
2563 2923
2564void 2924void
2565ev_async_stop (EV_P_ ev_async *w) 2925ev_async_stop (EV_P_ ev_async *w)
2566{ 2926{
2567 clear_pending (EV_A_ (W)w); 2927 clear_pending (EV_A_ (W)w);
2568 if (expect_false (!ev_is_active (w))) 2928 if (expect_false (!ev_is_active (w)))
2569 return; 2929 return;
2570 2930
2931 EV_FREQUENT_CHECK;
2932
2571 { 2933 {
2572 int active = ev_active (w); 2934 int active = ev_active (w);
2573 2935
2574 asyncs [active - 1] = asyncs [--asynccnt]; 2936 asyncs [active - 1] = asyncs [--asynccnt];
2575 ev_active (asyncs [active - 1]) = active; 2937 ev_active (asyncs [active - 1]) = active;
2576 } 2938 }
2577 2939
2578 ev_stop (EV_A_ (W)w); 2940 ev_stop (EV_A_ (W)w);
2941
2942 EV_FREQUENT_CHECK;
2579} 2943}
2580 2944
2581void 2945void
2582ev_async_send (EV_P_ ev_async *w) 2946ev_async_send (EV_P_ ev_async *w)
2583{ 2947{

Diff Legend

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