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

Comparing libev/ev.c (file contents):
Revision 1.227 by root, Fri May 2 07:20:01 2008 UTC vs.
Revision 1.238 by root, Thu May 8 20:49:12 2008 UTC

… …
325 325
326typedef ev_watcher *W; 326typedef ev_watcher *W;
327typedef ev_watcher_list *WL; 327typedef ev_watcher_list *WL;
328typedef ev_watcher_time *WT; 328typedef ev_watcher_time *WT;
329 329
330#define ev_active(w) ((W)(w))->active
331#define ev_at(w) ((WT)(w))->at
332
330#if EV_USE_MONOTONIC 333#if EV_USE_MONOTONIC
331/* sig_atomic_t is used to avoid per-thread variables or locking but still */ 334/* sig_atomic_t is used to avoid per-thread variables or locking but still */
332/* giving it a reasonably high chance of working on typical architetcures */ 335/* giving it a reasonably high chance of working on typical architetcures */
333static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ 336static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */
334#endif 337#endif
… …
517 } 520 }
518} 521}
519 522
520/*****************************************************************************/ 523/*****************************************************************************/
521 524
525#define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */
526
522int inline_size 527int inline_size
523array_nextsize (int elem, int cur, int cnt) 528array_nextsize (int elem, int cur, int cnt)
524{ 529{
525 int ncur = cur + 1; 530 int ncur = cur + 1;
526 531
527 do 532 do
528 ncur <<= 1; 533 ncur <<= 1;
529 while (cnt > ncur); 534 while (cnt > ncur);
530 535
531 /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ 536 /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */
532 if (elem * ncur > 4096) 537 if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4)
533 { 538 {
534 ncur *= elem; 539 ncur *= elem;
535 ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; 540 ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1);
536 ncur = ncur - sizeof (void *) * 4; 541 ncur = ncur - sizeof (void *) * 4;
537 ncur /= elem; 542 ncur /= elem;
538 } 543 }
539 544
540 return ncur; 545 return ncur;
… …
754 } 759 }
755} 760}
756 761
757/*****************************************************************************/ 762/*****************************************************************************/
758 763
764/*
765 * 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
767 * which is more cache-efficient.
768 * the difference is about 5% with 50000+ watchers.
769 */
770#define USE_4HEAP !EV_MINIMAL
771#define USE_4HEAP 1/* they do not work corretcly */
772#if USE_4HEAP
773
774#define DHEAP 4
775#define HEAP0 (DHEAP - 1) /* index of first element in heap */
776
759/* towards the root */ 777/* towards the root */
760void inline_speed 778void inline_speed
761upheap (WT *heap, int k) 779upheap (WT *heap, int k)
762{ 780{
763 WT w = heap [k]; 781 WT w = heap [k];
764 782
765 while (k) 783 for (;;)
766 { 784 {
767 int p = (k - 1) >> 1; 785 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
768 786
769 if (heap [p]->at <= w->at) 787 if (p == k || heap [p]->at <= w->at)
770 break; 788 break;
771 789
772 heap [k] = heap [p]; 790 heap [k] = heap [p];
773 ((W)heap [k])->active = k + 1; 791 ev_active (heap [k]) = k;
774 k = p; 792 k = p;
775 } 793 }
776 794
777 heap [k] = w; 795 heap [k] = w;
778 ((W)heap [k])->active = k + 1; 796 ev_active (heap [k]) = k;
779} 797}
780 798
781/* away from the root */ 799/* away from the root */
782void inline_speed 800void inline_speed
783downheap (WT *heap, int N, int k) 801downheap (WT *heap, int N, int k)
784{ 802{
785 WT w = heap [k]; 803 WT w = heap [k];
804 WT *E = heap + N + HEAP0;
786 805
787 for (;;) 806 for (;;)
788 { 807 {
808 ev_tstamp minat;
809 WT *minpos;
810 WT *pos = heap + DHEAP * (k - HEAP0) + HEAP0;
811
812 // find minimum child
813 if (expect_true (pos + DHEAP - 1 < E))
814 {
815 /* fast path */
816 (minpos = pos + 0), (minat = (*minpos)->at);
817 if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at);
818 if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at);
819 if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at);
820 }
821 else
822 {
823 /* slow path */
824 if (pos >= E)
825 break;
826 (minpos = pos + 0), (minat = (*minpos)->at);
827 if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at);
828 if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at);
829 if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at);
830 }
831
832 if (w->at <= minat)
833 break;
834
835 ev_active (*minpos) = k;
836 heap [k] = *minpos;
837
838 k = minpos - heap;
839 }
840
841 heap [k] = w;
842 ev_active (heap [k]) = k;
843}
844
845#else // 4HEAP
846
847#define HEAP0 1
848
849/* towards the root */
850void inline_speed
851upheap (WT *heap, int k)
852{
853 WT w = heap [k];
854
855 for (;;)
856 {
857 int p = k >> 1;
858
859 /* maybe we could use a dummy element at heap [0]? */
860 if (!p || heap [p]->at <= w->at)
861 break;
862
863 heap [k] = heap [p];
864 ev_active (heap [k]) = k;
865 k = p;
866 }
867
868 heap [k] = w;
869 ev_active (heap [k]) = k;
870}
871
872/* away from the root */
873void inline_speed
874downheap (WT *heap, int N, int k)
875{
876 WT w = heap [k];
877
878 for (;;)
879 {
789 int c = (k << 1) + 1; 880 int c = k << 1;
790 881
791 if (c >= N) 882 if (c > N)
792 break; 883 break;
793 884
794 c += c + 1 < N && heap [c]->at > heap [c + 1]->at 885 c += c + 1 < N && heap [c]->at > heap [c + 1]->at
795 ? 1 : 0; 886 ? 1 : 0;
796 887
797 if (w->at <= heap [c]->at) 888 if (w->at <= heap [c]->at)
798 break; 889 break;
799 890
800 heap [k] = heap [c]; 891 heap [k] = heap [c];
801 ((W)heap [k])->active = k + 1; 892 ((W)heap [k])->active = k;
802 893
803 k = c; 894 k = c;
804 } 895 }
805 896
806 heap [k] = w; 897 heap [k] = w;
807 ((W)heap [k])->active = k + 1; 898 ev_active (heap [k]) = k;
808} 899}
900#endif
809 901
810void inline_size 902void inline_size
811adjustheap (WT *heap, int N, int k) 903adjustheap (WT *heap, int N, int k)
812{ 904{
813 upheap (heap, k); 905 upheap (heap, k);
… …
908pipecb (EV_P_ ev_io *iow, int revents) 1000pipecb (EV_P_ ev_io *iow, int revents)
909{ 1001{
910#if EV_USE_EVENTFD 1002#if EV_USE_EVENTFD
911 if (evfd >= 0) 1003 if (evfd >= 0)
912 { 1004 {
913 uint64_t counter = 1; 1005 uint64_t counter;
914 read (evfd, &counter, sizeof (uint64_t)); 1006 read (evfd, &counter, sizeof (uint64_t));
915 } 1007 }
916 else 1008 else
917#endif 1009#endif
918 { 1010 {
… …
1364void 1456void
1365ev_loop_fork (EV_P) 1457ev_loop_fork (EV_P)
1366{ 1458{
1367 postfork = 1; /* must be in line with ev_default_fork */ 1459 postfork = 1; /* must be in line with ev_default_fork */
1368} 1460}
1369
1370#endif 1461#endif
1371 1462
1372#if EV_MULTIPLICITY 1463#if EV_MULTIPLICITY
1373struct ev_loop * 1464struct ev_loop *
1374ev_default_loop_init (unsigned int flags) 1465ev_default_loop_init (unsigned int flags)
… …
1455 EV_CB_INVOKE (p->w, p->events); 1546 EV_CB_INVOKE (p->w, p->events);
1456 } 1547 }
1457 } 1548 }
1458} 1549}
1459 1550
1460void inline_size
1461timers_reify (EV_P)
1462{
1463 while (timercnt && ((WT)timers [0])->at <= mn_now)
1464 {
1465 ev_timer *w = (ev_timer *)timers [0];
1466
1467 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1468
1469 /* first reschedule or stop timer */
1470 if (w->repeat)
1471 {
1472 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1473
1474 ((WT)w)->at += w->repeat;
1475 if (((WT)w)->at < mn_now)
1476 ((WT)w)->at = mn_now;
1477
1478 downheap (timers, timercnt, 0);
1479 }
1480 else
1481 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1482
1483 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1484 }
1485}
1486
1487#if EV_PERIODIC_ENABLE
1488void inline_size
1489periodics_reify (EV_P)
1490{
1491 while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now)
1492 {
1493 ev_periodic *w = (ev_periodic *)periodics [0];
1494
1495 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1496
1497 /* first reschedule or stop timer */
1498 if (w->reschedule_cb)
1499 {
1500 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1501 assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now));
1502 downheap (periodics, periodiccnt, 0);
1503 }
1504 else if (w->interval)
1505 {
1506 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1507 if (((WT)w)->at - ev_rt_now <= TIME_EPSILON) ((WT)w)->at += w->interval;
1508 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now));
1509 downheap (periodics, periodiccnt, 0);
1510 }
1511 else
1512 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1513
1514 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1515 }
1516}
1517
1518static void noinline
1519periodics_reschedule (EV_P)
1520{
1521 int i;
1522
1523 /* adjust periodics after time jump */
1524 for (i = 0; i < periodiccnt; ++i)
1525 {
1526 ev_periodic *w = (ev_periodic *)periodics [i];
1527
1528 if (w->reschedule_cb)
1529 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now);
1530 else if (w->interval)
1531 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1532 }
1533
1534 /* now rebuild the heap */
1535 for (i = periodiccnt >> 1; i--; )
1536 downheap (periodics, periodiccnt, i);
1537}
1538#endif
1539
1540#if EV_IDLE_ENABLE 1551#if EV_IDLE_ENABLE
1541void inline_size 1552void inline_size
1542idle_reify (EV_P) 1553idle_reify (EV_P)
1543{ 1554{
1544 if (expect_false (idleall)) 1555 if (expect_false (idleall))
… …
1555 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1566 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1556 break; 1567 break;
1557 } 1568 }
1558 } 1569 }
1559 } 1570 }
1571}
1572#endif
1573
1574void inline_size
1575timers_reify (EV_P)
1576{
1577 while (timercnt && ev_at (timers [HEAP0]) <= mn_now)
1578 {
1579 ev_timer *w = (ev_timer *)timers [HEAP0];
1580
1581 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1582
1583 /* first reschedule or stop timer */
1584 if (w->repeat)
1585 {
1586 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1587
1588 ev_at (w) += w->repeat;
1589 if (ev_at (w) < mn_now)
1590 ev_at (w) = mn_now;
1591
1592 downheap (timers, timercnt, HEAP0);
1593 }
1594 else
1595 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1596
1597 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1598 }
1599}
1600
1601#if EV_PERIODIC_ENABLE
1602void inline_size
1603periodics_reify (EV_P)
1604{
1605 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now)
1606 {
1607 ev_periodic *w = (ev_periodic *)periodics [HEAP0];
1608
1609 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1610
1611 /* first reschedule or stop timer */
1612 if (w->reschedule_cb)
1613 {
1614 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1615 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));
1616 downheap (periodics, periodiccnt, 1);
1617 }
1618 else if (w->interval)
1619 {
1620 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1621 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1622 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));
1623 downheap (periodics, periodiccnt, HEAP0);
1624 }
1625 else
1626 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1627
1628 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1629 }
1630}
1631
1632static void noinline
1633periodics_reschedule (EV_P)
1634{
1635 int i;
1636
1637 /* adjust periodics after time jump */
1638 for (i = 1; i <= periodiccnt; ++i)
1639 {
1640 ev_periodic *w = (ev_periodic *)periodics [i];
1641
1642 if (w->reschedule_cb)
1643 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1644 else if (w->interval)
1645 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1646 }
1647
1648 /* now rebuild the heap */
1649 for (i = periodiccnt >> 1; --i; )
1650 downheap (periodics, periodiccnt, i + HEAP0);
1560} 1651}
1561#endif 1652#endif
1562 1653
1563void inline_speed 1654void inline_speed
1564time_update (EV_P_ ev_tstamp max_block) 1655time_update (EV_P_ ev_tstamp max_block)
… …
1593 */ 1684 */
1594 for (i = 4; --i; ) 1685 for (i = 4; --i; )
1595 { 1686 {
1596 rtmn_diff = ev_rt_now - mn_now; 1687 rtmn_diff = ev_rt_now - mn_now;
1597 1688
1598 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1689 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1599 return; /* all is well */ 1690 return; /* all is well */
1600 1691
1601 ev_rt_now = ev_time (); 1692 ev_rt_now = ev_time ();
1602 mn_now = get_clock (); 1693 mn_now = get_clock ();
1603 now_floor = mn_now; 1694 now_floor = mn_now;
… …
1618 { 1709 {
1619#if EV_PERIODIC_ENABLE 1710#if EV_PERIODIC_ENABLE
1620 periodics_reschedule (EV_A); 1711 periodics_reschedule (EV_A);
1621#endif 1712#endif
1622 /* adjust timers. this is easy, as the offset is the same for all of them */ 1713 /* adjust timers. this is easy, as the offset is the same for all of them */
1623 for (i = 0; i < timercnt; ++i) 1714 for (i = 1; i <= timercnt; ++i)
1624 ((WT)timers [i])->at += ev_rt_now - mn_now; 1715 ev_at (timers [i]) += ev_rt_now - mn_now;
1625 } 1716 }
1626 1717
1627 mn_now = ev_rt_now; 1718 mn_now = ev_rt_now;
1628 } 1719 }
1629} 1720}
… …
1699 1790
1700 waittime = MAX_BLOCKTIME; 1791 waittime = MAX_BLOCKTIME;
1701 1792
1702 if (timercnt) 1793 if (timercnt)
1703 { 1794 {
1704 ev_tstamp to = ((WT)timers [0])->at - mn_now + backend_fudge; 1795 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge;
1705 if (waittime > to) waittime = to; 1796 if (waittime > to) waittime = to;
1706 } 1797 }
1707 1798
1708#if EV_PERIODIC_ENABLE 1799#if EV_PERIODIC_ENABLE
1709 if (periodiccnt) 1800 if (periodiccnt)
1710 { 1801 {
1711 ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + backend_fudge; 1802 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1712 if (waittime > to) waittime = to; 1803 if (waittime > to) waittime = to;
1713 } 1804 }
1714#endif 1805#endif
1715 1806
1716 if (expect_false (waittime < timeout_blocktime)) 1807 if (expect_false (waittime < timeout_blocktime))
… …
1882ev_timer_start (EV_P_ ev_timer *w) 1973ev_timer_start (EV_P_ ev_timer *w)
1883{ 1974{
1884 if (expect_false (ev_is_active (w))) 1975 if (expect_false (ev_is_active (w)))
1885 return; 1976 return;
1886 1977
1887 ((WT)w)->at += mn_now; 1978 ev_at (w) += mn_now;
1888 1979
1889 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 1980 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1890 1981
1891 ev_start (EV_A_ (W)w, ++timercnt); 1982 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);
1892 array_needsize (WT, timers, timermax, timercnt, EMPTY2); 1983 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2);
1893 timers [timercnt - 1] = (WT)w; 1984 timers [ev_active (w)] = (WT)w;
1894 upheap (timers, timercnt - 1); 1985 upheap (timers, ev_active (w));
1895 1986
1896 /*assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w));*/ 1987 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/
1897} 1988}
1898 1989
1899void noinline 1990void noinline
1900ev_timer_stop (EV_P_ ev_timer *w) 1991ev_timer_stop (EV_P_ ev_timer *w)
1901{ 1992{
1902 clear_pending (EV_A_ (W)w); 1993 clear_pending (EV_A_ (W)w);
1903 if (expect_false (!ev_is_active (w))) 1994 if (expect_false (!ev_is_active (w)))
1904 return; 1995 return;
1905 1996
1906 assert (("internal timer heap corruption", timers [((W)w)->active - 1] == (WT)w));
1907
1908 { 1997 {
1909 int active = ((W)w)->active; 1998 int active = ev_active (w);
1910 1999
2000 assert (("internal timer heap corruption", timers [active] == (WT)w));
2001
1911 if (expect_true (--active < --timercnt)) 2002 if (expect_true (active < timercnt + HEAP0 - 1))
1912 { 2003 {
1913 timers [active] = timers [timercnt]; 2004 timers [active] = timers [timercnt + HEAP0 - 1];
1914 adjustheap (timers, timercnt, active); 2005 adjustheap (timers, timercnt, active);
1915 } 2006 }
2007
2008 --timercnt;
1916 } 2009 }
1917 2010
1918 ((WT)w)->at -= mn_now; 2011 ev_at (w) -= mn_now;
1919 2012
1920 ev_stop (EV_A_ (W)w); 2013 ev_stop (EV_A_ (W)w);
1921} 2014}
1922 2015
1923void noinline 2016void noinline
… …
1925{ 2018{
1926 if (ev_is_active (w)) 2019 if (ev_is_active (w))
1927 { 2020 {
1928 if (w->repeat) 2021 if (w->repeat)
1929 { 2022 {
1930 ((WT)w)->at = mn_now + w->repeat; 2023 ev_at (w) = mn_now + w->repeat;
1931 adjustheap (timers, timercnt, ((W)w)->active - 1); 2024 adjustheap (timers, timercnt, ev_active (w));
1932 } 2025 }
1933 else 2026 else
1934 ev_timer_stop (EV_A_ w); 2027 ev_timer_stop (EV_A_ w);
1935 } 2028 }
1936 else if (w->repeat) 2029 else if (w->repeat)
1937 { 2030 {
1938 w->at = w->repeat; 2031 ev_at (w) = w->repeat;
1939 ev_timer_start (EV_A_ w); 2032 ev_timer_start (EV_A_ w);
1940 } 2033 }
1941} 2034}
1942 2035
1943#if EV_PERIODIC_ENABLE 2036#if EV_PERIODIC_ENABLE
… …
1946{ 2039{
1947 if (expect_false (ev_is_active (w))) 2040 if (expect_false (ev_is_active (w)))
1948 return; 2041 return;
1949 2042
1950 if (w->reschedule_cb) 2043 if (w->reschedule_cb)
1951 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); 2044 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1952 else if (w->interval) 2045 else if (w->interval)
1953 { 2046 {
1954 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); 2047 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.));
1955 /* this formula differs from the one in periodic_reify because we do not always round up */ 2048 /* this formula differs from the one in periodic_reify because we do not always round up */
1956 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2049 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1957 } 2050 }
1958 else 2051 else
1959 ((WT)w)->at = w->offset; 2052 ev_at (w) = w->offset;
1960 2053
1961 ev_start (EV_A_ (W)w, ++periodiccnt); 2054 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);
1962 array_needsize (WT, periodics, periodicmax, periodiccnt, EMPTY2); 2055 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2);
1963 periodics [periodiccnt - 1] = (WT)w; 2056 periodics [ev_active (w)] = (WT)w;
1964 upheap (periodics, periodiccnt - 1); 2057 upheap (periodics, ev_active (w));
1965 2058
1966 /*assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));*/ 2059 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/
1967} 2060}
1968 2061
1969void noinline 2062void noinline
1970ev_periodic_stop (EV_P_ ev_periodic *w) 2063ev_periodic_stop (EV_P_ ev_periodic *w)
1971{ 2064{
1972 clear_pending (EV_A_ (W)w); 2065 clear_pending (EV_A_ (W)w);
1973 if (expect_false (!ev_is_active (w))) 2066 if (expect_false (!ev_is_active (w)))
1974 return; 2067 return;
1975 2068
1976 assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == (WT)w));
1977
1978 { 2069 {
1979 int active = ((W)w)->active; 2070 int active = ev_active (w);
1980 2071
2072 assert (("internal periodic heap corruption", periodics [active] == (WT)w));
2073
1981 if (expect_true (--active < --periodiccnt)) 2074 if (expect_true (active < periodiccnt + HEAP0 - 1))
1982 { 2075 {
1983 periodics [active] = periodics [periodiccnt]; 2076 periodics [active] = periodics [periodiccnt + HEAP0 - 1];
1984 adjustheap (periodics, periodiccnt, active); 2077 adjustheap (periodics, periodiccnt, active);
1985 } 2078 }
2079
2080 --periodiccnt;
1986 } 2081 }
1987 2082
1988 ev_stop (EV_A_ (W)w); 2083 ev_stop (EV_A_ (W)w);
1989} 2084}
1990 2085
… …
2106 if (w->wd < 0) 2201 if (w->wd < 0)
2107 { 2202 {
2108 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ 2203 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2109 2204
2110 /* monitor some parent directory for speedup hints */ 2205 /* monitor some parent directory for speedup hints */
2206 /* note that exceeding the hardcoded limit is not a correctness issue, */
2207 /* but an efficiency issue only */
2111 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) 2208 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2112 { 2209 {
2113 char path [4096]; 2210 char path [4096];
2114 strcpy (path, w->path); 2211 strcpy (path, w->path);
2115 2212
… …
2360 clear_pending (EV_A_ (W)w); 2457 clear_pending (EV_A_ (W)w);
2361 if (expect_false (!ev_is_active (w))) 2458 if (expect_false (!ev_is_active (w)))
2362 return; 2459 return;
2363 2460
2364 { 2461 {
2365 int active = ((W)w)->active; 2462 int active = ev_active (w);
2366 2463
2367 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2464 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2368 ((W)idles [ABSPRI (w)][active - 1])->active = active; 2465 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2369 2466
2370 ev_stop (EV_A_ (W)w); 2467 ev_stop (EV_A_ (W)w);
2371 --idleall; 2468 --idleall;
2372 } 2469 }
2373} 2470}
… …
2390 clear_pending (EV_A_ (W)w); 2487 clear_pending (EV_A_ (W)w);
2391 if (expect_false (!ev_is_active (w))) 2488 if (expect_false (!ev_is_active (w)))
2392 return; 2489 return;
2393 2490
2394 { 2491 {
2395 int active = ((W)w)->active; 2492 int active = ev_active (w);
2493
2396 prepares [active - 1] = prepares [--preparecnt]; 2494 prepares [active - 1] = prepares [--preparecnt];
2397 ((W)prepares [active - 1])->active = active; 2495 ev_active (prepares [active - 1]) = active;
2398 } 2496 }
2399 2497
2400 ev_stop (EV_A_ (W)w); 2498 ev_stop (EV_A_ (W)w);
2401} 2499}
2402 2500
… …
2417 clear_pending (EV_A_ (W)w); 2515 clear_pending (EV_A_ (W)w);
2418 if (expect_false (!ev_is_active (w))) 2516 if (expect_false (!ev_is_active (w)))
2419 return; 2517 return;
2420 2518
2421 { 2519 {
2422 int active = ((W)w)->active; 2520 int active = ev_active (w);
2521
2423 checks [active - 1] = checks [--checkcnt]; 2522 checks [active - 1] = checks [--checkcnt];
2424 ((W)checks [active - 1])->active = active; 2523 ev_active (checks [active - 1]) = active;
2425 } 2524 }
2426 2525
2427 ev_stop (EV_A_ (W)w); 2526 ev_stop (EV_A_ (W)w);
2428} 2527}
2429 2528
… …
2525 clear_pending (EV_A_ (W)w); 2624 clear_pending (EV_A_ (W)w);
2526 if (expect_false (!ev_is_active (w))) 2625 if (expect_false (!ev_is_active (w)))
2527 return; 2626 return;
2528 2627
2529 { 2628 {
2530 int active = ((W)w)->active; 2629 int active = ev_active (w);
2630
2531 forks [active - 1] = forks [--forkcnt]; 2631 forks [active - 1] = forks [--forkcnt];
2532 ((W)forks [active - 1])->active = active; 2632 ev_active (forks [active - 1]) = active;
2533 } 2633 }
2534 2634
2535 ev_stop (EV_A_ (W)w); 2635 ev_stop (EV_A_ (W)w);
2536} 2636}
2537#endif 2637#endif
… …
2556 clear_pending (EV_A_ (W)w); 2656 clear_pending (EV_A_ (W)w);
2557 if (expect_false (!ev_is_active (w))) 2657 if (expect_false (!ev_is_active (w)))
2558 return; 2658 return;
2559 2659
2560 { 2660 {
2561 int active = ((W)w)->active; 2661 int active = ev_active (w);
2662
2562 asyncs [active - 1] = asyncs [--asynccnt]; 2663 asyncs [active - 1] = asyncs [--asynccnt];
2563 ((W)asyncs [active - 1])->active = active; 2664 ev_active (asyncs [active - 1]) = active;
2564 } 2665 }
2565 2666
2566 ev_stop (EV_A_ (W)w); 2667 ev_stop (EV_A_ (W)w);
2567} 2668}
2568 2669

Diff Legend

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