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

Comparing libev/ev.c (file contents):
Revision 1.225 by root, Wed Apr 16 01:37:14 2008 UTC vs.
Revision 1.235 by root, Wed May 7 14:45:17 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#if USE_4HEAP
772
773#define HEAP0 3 /* index of first element in heap */
774
775/* towards the root */
759void inline_speed 776void inline_speed
760upheap (WT *heap, int k) 777upheap (WT *heap, int k)
761{ 778{
762 WT w = heap [k]; 779 WT w = heap [k];
763 780
764 while (k) 781 for (;;)
765 { 782 {
766 int p = (k - 1) >> 1; 783 int p = ((k - HEAP0 - 1) / 4) + HEAP0;
767 784
768 if (heap [p]->at <= w->at) 785 if (p >= HEAP0 || heap [p]->at <= w->at)
769 break; 786 break;
770 787
771 heap [k] = heap [p]; 788 heap [k] = heap [p];
772 ((W)heap [k])->active = k + 1; 789 ev_active (heap [k]) = k;
773 k = p; 790 k = p;
774 } 791 }
775 792
776 heap [k] = w; 793 heap [k] = w;
777 ((W)heap [k])->active = k + 1; 794 ev_active (heap [k]) = k;
778} 795}
779 796
797/* away from the root */
780void inline_speed 798void inline_speed
781downheap (WT *heap, int N, int k) 799downheap (WT *heap, int N, int k)
782{ 800{
783 WT w = heap [k]; 801 WT w = heap [k];
802 WT *E = heap + N + HEAP0;
784 803
785 for (;;) 804 for (;;)
786 { 805 {
806 ev_tstamp minat;
807 WT *minpos;
808 WT *pos = heap + 4 * (k - HEAP0) + HEAP0;
809
810 // find minimum child
811 if (expect_true (pos +3 < E))
812 {
813 (minpos = pos + 0), (minat = (*minpos)->at);
814 if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at);
815 if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at);
816 if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at);
817 }
818 else
819 {
820 if (pos >= E)
821 break;
822
823 (minpos = pos + 0), (minat = (*minpos)->at);
824 if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at);
825 if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at);
826 if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at);
827 }
828
829 if (w->at <= minat)
830 break;
831
832 ev_active (*minpos) = k;
833 heap [k] = *minpos;
834
835 k = minpos - heap;
836 }
837
838 heap [k] = w;
839 ev_active (heap [k]) = k;
840}
841
842#else // 4HEAP
843
844#define HEAP0 1
845
846/* towards the root */
847void inline_speed
848upheap (WT *heap, int k)
849{
850 WT w = heap [k];
851
852 for (;;)
853 {
854 int p = k >> 1;
855
856 /* maybe we could use a dummy element at heap [0]? */
857 if (!p || heap [p]->at <= w->at)
858 break;
859
860 heap [k] = heap [p];
861 ev_active (heap [k]) = k;
862 k = p;
863 }
864
865 heap [k] = w;
866 ev_active (heap [k]) = k;
867}
868
869/* away from the root */
870void inline_speed
871downheap (WT *heap, int N, int k)
872{
873 WT w = heap [k];
874
875 for (;;)
876 {
787 int c = (k << 1) + 1; 877 int c = k << 1;
788 878
789 if (c >= N) 879 if (c > N)
790 break; 880 break;
791 881
792 c += c + 1 < N && heap [c]->at > heap [c + 1]->at 882 c += c + 1 < N && heap [c]->at > heap [c + 1]->at
793 ? 1 : 0; 883 ? 1 : 0;
794 884
795 if (w->at <= heap [c]->at) 885 if (w->at <= heap [c]->at)
796 break; 886 break;
797 887
798 heap [k] = heap [c]; 888 heap [k] = heap [c];
799 ((W)heap [k])->active = k + 1; 889 ((W)heap [k])->active = k;
800 890
801 k = c; 891 k = c;
802 } 892 }
803 893
804 heap [k] = w; 894 heap [k] = w;
805 ((W)heap [k])->active = k + 1; 895 ev_active (heap [k]) = k;
806} 896}
897#endif
807 898
808void inline_size 899void inline_size
809adjustheap (WT *heap, int N, int k) 900adjustheap (WT *heap, int N, int k)
810{ 901{
811 upheap (heap, k); 902 upheap (heap, k);
… …
906pipecb (EV_P_ ev_io *iow, int revents) 997pipecb (EV_P_ ev_io *iow, int revents)
907{ 998{
908#if EV_USE_EVENTFD 999#if EV_USE_EVENTFD
909 if (evfd >= 0) 1000 if (evfd >= 0)
910 { 1001 {
911 uint64_t counter = 1; 1002 uint64_t counter;
912 read (evfd, &counter, sizeof (uint64_t)); 1003 read (evfd, &counter, sizeof (uint64_t));
913 } 1004 }
914 else 1005 else
915#endif 1006#endif
916 { 1007 {
… …
1283#endif 1374#endif
1284 1375
1285 backend = 0; 1376 backend = 0;
1286} 1377}
1287 1378
1379#if EV_USE_INOTIFY
1288void inline_size infy_fork (EV_P); 1380void inline_size infy_fork (EV_P);
1381#endif
1289 1382
1290void inline_size 1383void inline_size
1291loop_fork (EV_P) 1384loop_fork (EV_P)
1292{ 1385{
1293#if EV_USE_PORT 1386#if EV_USE_PORT
… …
1360void 1453void
1361ev_loop_fork (EV_P) 1454ev_loop_fork (EV_P)
1362{ 1455{
1363 postfork = 1; /* must be in line with ev_default_fork */ 1456 postfork = 1; /* must be in line with ev_default_fork */
1364} 1457}
1365
1366#endif 1458#endif
1367 1459
1368#if EV_MULTIPLICITY 1460#if EV_MULTIPLICITY
1369struct ev_loop * 1461struct ev_loop *
1370ev_default_loop_init (unsigned int flags) 1462ev_default_loop_init (unsigned int flags)
… …
1451 EV_CB_INVOKE (p->w, p->events); 1543 EV_CB_INVOKE (p->w, p->events);
1452 } 1544 }
1453 } 1545 }
1454} 1546}
1455 1547
1456void inline_size
1457timers_reify (EV_P)
1458{
1459 while (timercnt && ((WT)timers [0])->at <= mn_now)
1460 {
1461 ev_timer *w = (ev_timer *)timers [0];
1462
1463 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1464
1465 /* first reschedule or stop timer */
1466 if (w->repeat)
1467 {
1468 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1469
1470 ((WT)w)->at += w->repeat;
1471 if (((WT)w)->at < mn_now)
1472 ((WT)w)->at = mn_now;
1473
1474 downheap (timers, timercnt, 0);
1475 }
1476 else
1477 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1478
1479 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1480 }
1481}
1482
1483#if EV_PERIODIC_ENABLE
1484void inline_size
1485periodics_reify (EV_P)
1486{
1487 while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now)
1488 {
1489 ev_periodic *w = (ev_periodic *)periodics [0];
1490
1491 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1492
1493 /* first reschedule or stop timer */
1494 if (w->reschedule_cb)
1495 {
1496 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1497 assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now));
1498 downheap (periodics, periodiccnt, 0);
1499 }
1500 else if (w->interval)
1501 {
1502 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1503 if (((WT)w)->at - ev_rt_now <= TIME_EPSILON) ((WT)w)->at += w->interval;
1504 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now));
1505 downheap (periodics, periodiccnt, 0);
1506 }
1507 else
1508 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1509
1510 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1511 }
1512}
1513
1514static void noinline
1515periodics_reschedule (EV_P)
1516{
1517 int i;
1518
1519 /* adjust periodics after time jump */
1520 for (i = 0; i < periodiccnt; ++i)
1521 {
1522 ev_periodic *w = (ev_periodic *)periodics [i];
1523
1524 if (w->reschedule_cb)
1525 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now);
1526 else if (w->interval)
1527 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1528 }
1529
1530 /* now rebuild the heap */
1531 for (i = periodiccnt >> 1; i--; )
1532 downheap (periodics, periodiccnt, i);
1533}
1534#endif
1535
1536#if EV_IDLE_ENABLE 1548#if EV_IDLE_ENABLE
1537void inline_size 1549void inline_size
1538idle_reify (EV_P) 1550idle_reify (EV_P)
1539{ 1551{
1540 if (expect_false (idleall)) 1552 if (expect_false (idleall))
… …
1551 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1563 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1552 break; 1564 break;
1553 } 1565 }
1554 } 1566 }
1555 } 1567 }
1568}
1569#endif
1570
1571void inline_size
1572timers_reify (EV_P)
1573{
1574 while (timercnt && ev_at (timers [HEAP0]) <= mn_now)
1575 {
1576 ev_timer *w = (ev_timer *)timers [HEAP0];
1577
1578 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1579
1580 /* first reschedule or stop timer */
1581 if (w->repeat)
1582 {
1583 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1584
1585 ev_at (w) += w->repeat;
1586 if (ev_at (w) < mn_now)
1587 ev_at (w) = mn_now;
1588
1589 downheap (timers, timercnt, HEAP0);
1590 }
1591 else
1592 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1593
1594 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1595 }
1596}
1597
1598#if EV_PERIODIC_ENABLE
1599void inline_size
1600periodics_reify (EV_P)
1601{
1602 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now)
1603 {
1604 ev_periodic *w = (ev_periodic *)periodics [HEAP0];
1605
1606 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1607
1608 /* first reschedule or stop timer */
1609 if (w->reschedule_cb)
1610 {
1611 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1612 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));
1613 downheap (periodics, periodiccnt, 1);
1614 }
1615 else if (w->interval)
1616 {
1617 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1618 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1619 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));
1620 downheap (periodics, periodiccnt, HEAP0);
1621 }
1622 else
1623 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1624
1625 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1626 }
1627}
1628
1629static void noinline
1630periodics_reschedule (EV_P)
1631{
1632 int i;
1633
1634 /* adjust periodics after time jump */
1635 for (i = 1; i <= periodiccnt; ++i)
1636 {
1637 ev_periodic *w = (ev_periodic *)periodics [i];
1638
1639 if (w->reschedule_cb)
1640 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1641 else if (w->interval)
1642 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1643 }
1644
1645 /* now rebuild the heap */
1646 for (i = periodiccnt >> 1; --i; )
1647 downheap (periodics, periodiccnt, i + HEAP0);
1556} 1648}
1557#endif 1649#endif
1558 1650
1559void inline_speed 1651void inline_speed
1560time_update (EV_P_ ev_tstamp max_block) 1652time_update (EV_P_ ev_tstamp max_block)
… …
1589 */ 1681 */
1590 for (i = 4; --i; ) 1682 for (i = 4; --i; )
1591 { 1683 {
1592 rtmn_diff = ev_rt_now - mn_now; 1684 rtmn_diff = ev_rt_now - mn_now;
1593 1685
1594 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1686 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1595 return; /* all is well */ 1687 return; /* all is well */
1596 1688
1597 ev_rt_now = ev_time (); 1689 ev_rt_now = ev_time ();
1598 mn_now = get_clock (); 1690 mn_now = get_clock ();
1599 now_floor = mn_now; 1691 now_floor = mn_now;
… …
1614 { 1706 {
1615#if EV_PERIODIC_ENABLE 1707#if EV_PERIODIC_ENABLE
1616 periodics_reschedule (EV_A); 1708 periodics_reschedule (EV_A);
1617#endif 1709#endif
1618 /* adjust timers. this is easy, as the offset is the same for all of them */ 1710 /* adjust timers. this is easy, as the offset is the same for all of them */
1619 for (i = 0; i < timercnt; ++i) 1711 for (i = 1; i <= timercnt; ++i)
1620 ((WT)timers [i])->at += ev_rt_now - mn_now; 1712 ev_at (timers [i]) += ev_rt_now - mn_now;
1621 } 1713 }
1622 1714
1623 mn_now = ev_rt_now; 1715 mn_now = ev_rt_now;
1624 } 1716 }
1625} 1717}
… …
1695 1787
1696 waittime = MAX_BLOCKTIME; 1788 waittime = MAX_BLOCKTIME;
1697 1789
1698 if (timercnt) 1790 if (timercnt)
1699 { 1791 {
1700 ev_tstamp to = ((WT)timers [0])->at - mn_now + backend_fudge; 1792 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge;
1701 if (waittime > to) waittime = to; 1793 if (waittime > to) waittime = to;
1702 } 1794 }
1703 1795
1704#if EV_PERIODIC_ENABLE 1796#if EV_PERIODIC_ENABLE
1705 if (periodiccnt) 1797 if (periodiccnt)
1706 { 1798 {
1707 ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + backend_fudge; 1799 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1708 if (waittime > to) waittime = to; 1800 if (waittime > to) waittime = to;
1709 } 1801 }
1710#endif 1802#endif
1711 1803
1712 if (expect_false (waittime < timeout_blocktime)) 1804 if (expect_false (waittime < timeout_blocktime))
… …
1878ev_timer_start (EV_P_ ev_timer *w) 1970ev_timer_start (EV_P_ ev_timer *w)
1879{ 1971{
1880 if (expect_false (ev_is_active (w))) 1972 if (expect_false (ev_is_active (w)))
1881 return; 1973 return;
1882 1974
1883 ((WT)w)->at += mn_now; 1975 ev_at (w) += mn_now;
1884 1976
1885 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 1977 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1886 1978
1887 ev_start (EV_A_ (W)w, ++timercnt); 1979 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);
1888 array_needsize (WT, timers, timermax, timercnt, EMPTY2); 1980 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2);
1889 timers [timercnt - 1] = (WT)w; 1981 timers [ev_active (w)] = (WT)w;
1890 upheap (timers, timercnt - 1); 1982 upheap (timers, ev_active (w));
1891 1983
1892 /*assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w));*/ 1984 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/
1893} 1985}
1894 1986
1895void noinline 1987void noinline
1896ev_timer_stop (EV_P_ ev_timer *w) 1988ev_timer_stop (EV_P_ ev_timer *w)
1897{ 1989{
1898 clear_pending (EV_A_ (W)w); 1990 clear_pending (EV_A_ (W)w);
1899 if (expect_false (!ev_is_active (w))) 1991 if (expect_false (!ev_is_active (w)))
1900 return; 1992 return;
1901 1993
1902 assert (("internal timer heap corruption", timers [((W)w)->active - 1] == (WT)w));
1903
1904 { 1994 {
1905 int active = ((W)w)->active; 1995 int active = ev_active (w);
1906 1996
1997 assert (("internal timer heap corruption", timers [active] == (WT)w));
1998
1907 if (expect_true (--active < --timercnt)) 1999 if (expect_true (active < timercnt + HEAP0 - 1))
1908 { 2000 {
1909 timers [active] = timers [timercnt]; 2001 timers [active] = timers [timercnt + HEAP0 - 1];
1910 adjustheap (timers, timercnt, active); 2002 adjustheap (timers, timercnt, active);
1911 } 2003 }
2004
2005 --timercnt;
1912 } 2006 }
1913 2007
1914 ((WT)w)->at -= mn_now; 2008 ev_at (w) -= mn_now;
1915 2009
1916 ev_stop (EV_A_ (W)w); 2010 ev_stop (EV_A_ (W)w);
1917} 2011}
1918 2012
1919void noinline 2013void noinline
… …
1921{ 2015{
1922 if (ev_is_active (w)) 2016 if (ev_is_active (w))
1923 { 2017 {
1924 if (w->repeat) 2018 if (w->repeat)
1925 { 2019 {
1926 ((WT)w)->at = mn_now + w->repeat; 2020 ev_at (w) = mn_now + w->repeat;
1927 adjustheap (timers, timercnt, ((W)w)->active - 1); 2021 adjustheap (timers, timercnt, ev_active (w));
1928 } 2022 }
1929 else 2023 else
1930 ev_timer_stop (EV_A_ w); 2024 ev_timer_stop (EV_A_ w);
1931 } 2025 }
1932 else if (w->repeat) 2026 else if (w->repeat)
1933 { 2027 {
1934 w->at = w->repeat; 2028 ev_at (w) = w->repeat;
1935 ev_timer_start (EV_A_ w); 2029 ev_timer_start (EV_A_ w);
1936 } 2030 }
1937} 2031}
1938 2032
1939#if EV_PERIODIC_ENABLE 2033#if EV_PERIODIC_ENABLE
… …
1942{ 2036{
1943 if (expect_false (ev_is_active (w))) 2037 if (expect_false (ev_is_active (w)))
1944 return; 2038 return;
1945 2039
1946 if (w->reschedule_cb) 2040 if (w->reschedule_cb)
1947 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); 2041 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1948 else if (w->interval) 2042 else if (w->interval)
1949 { 2043 {
1950 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); 2044 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.));
1951 /* this formula differs from the one in periodic_reify because we do not always round up */ 2045 /* this formula differs from the one in periodic_reify because we do not always round up */
1952 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2046 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1953 } 2047 }
1954 else 2048 else
1955 ((WT)w)->at = w->offset; 2049 ev_at (w) = w->offset;
1956 2050
1957 ev_start (EV_A_ (W)w, ++periodiccnt); 2051 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);
1958 array_needsize (WT, periodics, periodicmax, periodiccnt, EMPTY2); 2052 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2);
1959 periodics [periodiccnt - 1] = (WT)w; 2053 periodics [ev_active (w)] = (WT)w;
1960 upheap (periodics, periodiccnt - 1); 2054 upheap (periodics, ev_active (w));
1961 2055
1962 /*assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));*/ 2056 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/
1963} 2057}
1964 2058
1965void noinline 2059void noinline
1966ev_periodic_stop (EV_P_ ev_periodic *w) 2060ev_periodic_stop (EV_P_ ev_periodic *w)
1967{ 2061{
1968 clear_pending (EV_A_ (W)w); 2062 clear_pending (EV_A_ (W)w);
1969 if (expect_false (!ev_is_active (w))) 2063 if (expect_false (!ev_is_active (w)))
1970 return; 2064 return;
1971 2065
1972 assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == (WT)w));
1973
1974 { 2066 {
1975 int active = ((W)w)->active; 2067 int active = ev_active (w);
1976 2068
2069 assert (("internal periodic heap corruption", periodics [active] == (WT)w));
2070
1977 if (expect_true (--active < --periodiccnt)) 2071 if (expect_true (active < periodiccnt + HEAP0 - 1))
1978 { 2072 {
1979 periodics [active] = periodics [periodiccnt]; 2073 periodics [active] = periodics [periodiccnt + HEAP0 - 1];
1980 adjustheap (periodics, periodiccnt, active); 2074 adjustheap (periodics, periodiccnt, active);
1981 } 2075 }
2076
2077 --periodiccnt;
1982 } 2078 }
1983 2079
1984 ev_stop (EV_A_ (W)w); 2080 ev_stop (EV_A_ (W)w);
1985} 2081}
1986 2082
… …
2102 if (w->wd < 0) 2198 if (w->wd < 0)
2103 { 2199 {
2104 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ 2200 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2105 2201
2106 /* monitor some parent directory for speedup hints */ 2202 /* monitor some parent directory for speedup hints */
2203 /* note that exceeding the hardcoded limit is not a correctness issue, */
2204 /* but an efficiency issue only */
2107 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) 2205 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2108 { 2206 {
2109 char path [4096]; 2207 char path [4096];
2110 strcpy (path, w->path); 2208 strcpy (path, w->path);
2111 2209
… …
2356 clear_pending (EV_A_ (W)w); 2454 clear_pending (EV_A_ (W)w);
2357 if (expect_false (!ev_is_active (w))) 2455 if (expect_false (!ev_is_active (w)))
2358 return; 2456 return;
2359 2457
2360 { 2458 {
2361 int active = ((W)w)->active; 2459 int active = ev_active (w);
2362 2460
2363 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2461 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2364 ((W)idles [ABSPRI (w)][active - 1])->active = active; 2462 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2365 2463
2366 ev_stop (EV_A_ (W)w); 2464 ev_stop (EV_A_ (W)w);
2367 --idleall; 2465 --idleall;
2368 } 2466 }
2369} 2467}
… …
2386 clear_pending (EV_A_ (W)w); 2484 clear_pending (EV_A_ (W)w);
2387 if (expect_false (!ev_is_active (w))) 2485 if (expect_false (!ev_is_active (w)))
2388 return; 2486 return;
2389 2487
2390 { 2488 {
2391 int active = ((W)w)->active; 2489 int active = ev_active (w);
2490
2392 prepares [active - 1] = prepares [--preparecnt]; 2491 prepares [active - 1] = prepares [--preparecnt];
2393 ((W)prepares [active - 1])->active = active; 2492 ev_active (prepares [active - 1]) = active;
2394 } 2493 }
2395 2494
2396 ev_stop (EV_A_ (W)w); 2495 ev_stop (EV_A_ (W)w);
2397} 2496}
2398 2497
… …
2413 clear_pending (EV_A_ (W)w); 2512 clear_pending (EV_A_ (W)w);
2414 if (expect_false (!ev_is_active (w))) 2513 if (expect_false (!ev_is_active (w)))
2415 return; 2514 return;
2416 2515
2417 { 2516 {
2418 int active = ((W)w)->active; 2517 int active = ev_active (w);
2518
2419 checks [active - 1] = checks [--checkcnt]; 2519 checks [active - 1] = checks [--checkcnt];
2420 ((W)checks [active - 1])->active = active; 2520 ev_active (checks [active - 1]) = active;
2421 } 2521 }
2422 2522
2423 ev_stop (EV_A_ (W)w); 2523 ev_stop (EV_A_ (W)w);
2424} 2524}
2425 2525
… …
2521 clear_pending (EV_A_ (W)w); 2621 clear_pending (EV_A_ (W)w);
2522 if (expect_false (!ev_is_active (w))) 2622 if (expect_false (!ev_is_active (w)))
2523 return; 2623 return;
2524 2624
2525 { 2625 {
2526 int active = ((W)w)->active; 2626 int active = ev_active (w);
2627
2527 forks [active - 1] = forks [--forkcnt]; 2628 forks [active - 1] = forks [--forkcnt];
2528 ((W)forks [active - 1])->active = active; 2629 ev_active (forks [active - 1]) = active;
2529 } 2630 }
2530 2631
2531 ev_stop (EV_A_ (W)w); 2632 ev_stop (EV_A_ (W)w);
2532} 2633}
2533#endif 2634#endif
… …
2552 clear_pending (EV_A_ (W)w); 2653 clear_pending (EV_A_ (W)w);
2553 if (expect_false (!ev_is_active (w))) 2654 if (expect_false (!ev_is_active (w)))
2554 return; 2655 return;
2555 2656
2556 { 2657 {
2557 int active = ((W)w)->active; 2658 int active = ev_active (w);
2659
2558 asyncs [active - 1] = asyncs [--asynccnt]; 2660 asyncs [active - 1] = asyncs [--asynccnt];
2559 ((W)asyncs [active - 1])->active = active; 2661 ev_active (asyncs [active - 1]) = active;
2560 } 2662 }
2561 2663
2562 ev_stop (EV_A_ (W)w); 2664 ev_stop (EV_A_ (W)w);
2563} 2665}
2564 2666

Diff Legend

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