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

Comparing libev/ev.c (file contents):
Revision 1.240 by root, Thu May 8 21:21:41 2008 UTC vs.
Revision 1.246 by root, Wed May 21 12:51:38 2008 UTC

… …
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#ifndef EV_USE_4HEAP
241# define EV_USE_4HEAP !EV_MINIMAL
242#endif
243
244#ifndef EV_HEAP_CACHE_AT
245# define EV_HEAP_CACHE_AT !EV_MINIMAL
246#endif
247
240/* this block fixes any misconfiguration where we know we run into trouble otherwise */ 248/* this block fixes any misconfiguration where we know we run into trouble otherwise */
241 249
242#ifndef CLOCK_MONOTONIC 250#ifndef CLOCK_MONOTONIC
243# undef EV_USE_MONOTONIC 251# undef EV_USE_MONOTONIC
244# define EV_USE_MONOTONIC 0 252# define EV_USE_MONOTONIC 0
… …
422 W w; 430 W w;
423 int events; 431 int events;
424} ANPENDING; 432} ANPENDING;
425 433
426#if EV_USE_INOTIFY 434#if EV_USE_INOTIFY
435/* hash table entry per inotify-id */
427typedef struct 436typedef struct
428{ 437{
429 WL head; 438 WL head;
430} ANFS; 439} ANFS;
440#endif
441
442/* Heap Entry */
443#if EV_HEAP_CACHE_AT
444 typedef struct {
445 ev_tstamp at;
446 WT w;
447 } ANHE;
448
449 #define ANHE_w(he) (he).w /* access watcher, read-write */
450 #define ANHE_at(he) (he).at /* access cached at, read-only */
451 #define ANHE_at_set(he) (he).at = (he).w->at /* update at from watcher */
452#else
453 typedef WT ANHE;
454
455 #define ANHE_w(he) (he)
456 #define ANHE_at(he) (he)->at
457 #define ANHE_at_set(he)
431#endif 458#endif
432 459
433#if EV_MULTIPLICITY 460#if EV_MULTIPLICITY
434 461
435 struct ev_loop 462 struct ev_loop
… …
760} 787}
761 788
762/*****************************************************************************/ 789/*****************************************************************************/
763 790
764/* 791/*
792 * the heap functions want a real array index. array index 0 uis guaranteed to not
793 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
794 * the branching factor of the d-tree.
795 */
796
797/*
765 * at the moment we allow libev the luxury of two heaps, 798 * 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 799 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
767 * which is more cache-efficient. 800 * which is more cache-efficient.
768 * the difference is about 5% with 50000+ watchers. 801 * the difference is about 5% with 50000+ watchers.
769 */ 802 */
770#define USE_4HEAP !EV_MINIMAL
771#if USE_4HEAP 803#if EV_USE_4HEAP
772 804
773#define DHEAP 4 805#define DHEAP 4
774#define HEAP0 (DHEAP - 1) /* index of first element in heap */ 806#define HEAP0 (DHEAP - 1) /* index of first element in heap */
775 807
776/* towards the root */ 808/* towards the root */
777void inline_speed 809void inline_speed
778upheap (WT *heap, int k) 810upheap (ANHE *heap, int k)
779{ 811{
780 WT w = heap [k]; 812 ANHE he = heap [k];
781 ev_tstamp w_at = w->at;
782 813
783 for (;;) 814 for (;;)
784 { 815 {
785 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0; 816 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
786 817
787 if (p == k || heap [p]->at <= w_at) 818 if (p == k || ANHE_at (heap [p]) <= ANHE_at (he))
788 break; 819 break;
789 820
790 heap [k] = heap [p]; 821 heap [k] = heap [p];
791 ev_active (heap [k]) = k; 822 ev_active (ANHE_w (heap [k])) = k;
792 k = p; 823 k = p;
793 } 824 }
794 825
826 ev_active (ANHE_w (he)) = k;
795 heap [k] = w; 827 heap [k] = he;
796 ev_active (heap [k]) = k;
797} 828}
798 829
799/* away from the root */ 830/* away from the root */
800void inline_speed 831void inline_speed
801downheap (WT *heap, int N, int k) 832downheap (ANHE *heap, int N, int k)
802{ 833{
803 WT w = heap [k]; 834 ANHE he = heap [k];
804 WT *E = heap + N + HEAP0; 835 ANHE *E = heap + N + HEAP0;
805 836
806 for (;;) 837 for (;;)
807 { 838 {
808 ev_tstamp minat; 839 ev_tstamp minat;
809 WT *minpos; 840 ANHE *minpos;
810 WT *pos = heap + DHEAP * (k - HEAP0) + HEAP0; 841 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0;
811 842
812 // find minimum child 843 // find minimum child
813 if (expect_true (pos + DHEAP - 1 < E)) 844 if (expect_true (pos + DHEAP - 1 < E))
814 { 845 {
815 /* fast path */ (minpos = pos + 0), (minat = (*minpos)->at); 846 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
816 if (pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); 847 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
817 if (pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); 848 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
818 if (pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); 849 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
819 } 850 }
820 else if (pos < E) 851 else if (pos < E)
821 { 852 {
822 /* slow path */ (minpos = pos + 0), (minat = (*minpos)->at); 853 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
823 if (pos + 1 < E && pos [1]->at < minat) (minpos = pos + 1), (minat = (*minpos)->at); 854 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
824 if (pos + 2 < E && pos [2]->at < minat) (minpos = pos + 2), (minat = (*minpos)->at); 855 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
825 if (pos + 3 < E && pos [3]->at < minat) (minpos = pos + 3), (minat = (*minpos)->at); 856 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
826 } 857 }
827 else 858 else
828 break; 859 break;
829 860
830 if (w->at <= minat) 861 if (ANHE_at (he) <= minat)
831 break; 862 break;
832 863
833 ev_active (*minpos) = k; 864 ev_active (ANHE_w (*minpos)) = k;
834 heap [k] = *minpos; 865 heap [k] = *minpos;
835 866
836 k = minpos - heap; 867 k = minpos - heap;
837 } 868 }
838 869
870 ev_active (ANHE_w (he)) = k;
839 heap [k] = w; 871 heap [k] = he;
840 ev_active (heap [k]) = k;
841} 872}
842 873
843#else // 4HEAP 874#else // 4HEAP
844 875
845#define HEAP0 1 876#define HEAP0 1
846 877
847/* towards the root */ 878/* towards the root */
848void inline_speed 879void inline_speed
849upheap (WT *heap, int k) 880upheap (ANHE *heap, int k)
850{ 881{
851 WT w = heap [k]; 882 ANHE he = heap [k];
852 883
853 for (;;) 884 for (;;)
854 { 885 {
855 int p = k >> 1; 886 int p = k >> 1;
856 887
857 /* maybe we could use a dummy element at heap [0]? */ 888 /* maybe we could use a dummy element at heap [0]? */
858 if (!p || heap [p]->at <= w->at) 889 if (!p || ANHE_at (heap [p]) <= ANHE_at (he))
859 break; 890 break;
860 891
861 heap [k] = heap [p]; 892 heap [k] = heap [p];
862 ev_active (heap [k]) = k; 893 ev_active (ANHE_w (heap [k])) = k;
863 k = p; 894 k = p;
864 } 895 }
865 896
866 heap [k] = w; 897 heap [k] = he;
867 ev_active (heap [k]) = k; 898 ev_active (ANHE_w (heap [k])) = k;
868} 899}
869 900
870/* away from the root */ 901/* away from the root */
871void inline_speed 902void inline_speed
872downheap (WT *heap, int N, int k) 903downheap (ANHE *heap, int N, int k)
873{ 904{
874 WT w = heap [k]; 905 ANHE he = heap [k];
875 906
876 for (;;) 907 for (;;)
877 { 908 {
878 int c = k << 1; 909 int c = k << 1;
879 910
880 if (c > N) 911 if (c > N)
881 break; 912 break;
882 913
883 c += c + 1 < N && heap [c]->at > heap [c + 1]->at 914 c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
884 ? 1 : 0; 915 ? 1 : 0;
885 916
886 if (w->at <= heap [c]->at) 917 if (ANHE_at (he) <= ANHE_at (heap [c]))
887 break; 918 break;
888 919
889 heap [k] = heap [c]; 920 heap [k] = heap [c];
890 ((W)heap [k])->active = k; 921 ev_active (ANHE_w (heap [k])) = k;
891 922
892 k = c; 923 k = c;
893 } 924 }
894 925
895 heap [k] = w; 926 heap [k] = he;
896 ev_active (heap [k]) = k; 927 ev_active (ANHE_w (he)) = k;
897} 928}
898#endif 929#endif
899 930
900void inline_size 931void inline_size
901adjustheap (WT *heap, int N, int k) 932adjustheap (ANHE *heap, int N, int k)
902{ 933{
903 upheap (heap, k); 934 upheap (heap, k);
904 downheap (heap, N, k); 935 downheap (heap, N, k);
905} 936}
906 937
… …
1570#endif 1601#endif
1571 1602
1572void inline_size 1603void inline_size
1573timers_reify (EV_P) 1604timers_reify (EV_P)
1574{ 1605{
1575 while (timercnt && ev_at (timers [HEAP0]) <= mn_now) 1606 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1576 { 1607 {
1577 ev_timer *w = (ev_timer *)timers [HEAP0]; 1608 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1578 1609
1579 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ 1610 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1580 1611
1581 /* first reschedule or stop timer */ 1612 /* first reschedule or stop timer */
1582 if (w->repeat) 1613 if (w->repeat)
1583 { 1614 {
1584 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1585
1586 ev_at (w) += w->repeat; 1615 ev_at (w) += w->repeat;
1587 if (ev_at (w) < mn_now) 1616 if (ev_at (w) < mn_now)
1588 ev_at (w) = mn_now; 1617 ev_at (w) = mn_now;
1589 1618
1619 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1620
1621 ANHE_at_set (timers [HEAP0]);
1590 downheap (timers, timercnt, HEAP0); 1622 downheap (timers, timercnt, HEAP0);
1591 } 1623 }
1592 else 1624 else
1593 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ 1625 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1594 1626
… …
1598 1630
1599#if EV_PERIODIC_ENABLE 1631#if EV_PERIODIC_ENABLE
1600void inline_size 1632void inline_size
1601periodics_reify (EV_P) 1633periodics_reify (EV_P)
1602{ 1634{
1603 while (periodiccnt && ev_at (periodics [HEAP0]) <= ev_rt_now) 1635 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1604 { 1636 {
1605 ev_periodic *w = (ev_periodic *)periodics [HEAP0]; 1637 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1606 1638
1607 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ 1639 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1608 1640
1609 /* first reschedule or stop timer */ 1641 /* first reschedule or stop timer */
1610 if (w->reschedule_cb) 1642 if (w->reschedule_cb)
1611 { 1643 {
1612 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); 1644 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1645
1613 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now)); 1646 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1647
1648 ANHE_at_set (periodics [HEAP0]);
1614 downheap (periodics, periodiccnt, 1); 1649 downheap (periodics, periodiccnt, HEAP0);
1615 } 1650 }
1616 else if (w->interval) 1651 else if (w->interval)
1617 { 1652 {
1618 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1653 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1654 /* if next trigger time is not sufficiently in the future, put it there */
1655 /* this might happen because of floating point inexactness */
1619 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval; 1656 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1620 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now)); 1657 {
1658 ev_at (w) += w->interval;
1659
1660 /* if interval is unreasonably low we might still have a time in the past */
1661 /* so correct this. this will make the periodic very inexact, but the user */
1662 /* has effectively asked to get triggered more often than possible */
1663 if (ev_at (w) < ev_rt_now)
1664 ev_at (w) = ev_rt_now;
1665 }
1666
1667 ANHE_at_set (periodics [HEAP0]);
1621 downheap (periodics, periodiccnt, HEAP0); 1668 downheap (periodics, periodiccnt, HEAP0);
1622 } 1669 }
1623 else 1670 else
1624 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ 1671 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1625 1672
… …
1631periodics_reschedule (EV_P) 1678periodics_reschedule (EV_P)
1632{ 1679{
1633 int i; 1680 int i;
1634 1681
1635 /* adjust periodics after time jump */ 1682 /* adjust periodics after time jump */
1636 for (i = 1; i <= periodiccnt; ++i) 1683 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1637 { 1684 {
1638 ev_periodic *w = (ev_periodic *)periodics [i]; 1685 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1639 1686
1640 if (w->reschedule_cb) 1687 if (w->reschedule_cb)
1641 ev_at (w) = w->reschedule_cb (w, ev_rt_now); 1688 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1642 else if (w->interval) 1689 else if (w->interval)
1643 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 1690 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1644 }
1645 1691
1646 /* now rebuild the heap */ 1692 ANHE_at_set (periodics [i]);
1647 for (i = periodiccnt >> 1; --i; ) 1693 }
1694
1695 /* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */
1696 /* also, this is easy and corretc for both 2-heaps and 4-heaps */
1697 for (i = 0; i < periodiccnt; ++i)
1648 downheap (periodics, periodiccnt, i + HEAP0); 1698 upheap (periodics, i + HEAP0);
1649} 1699}
1650#endif 1700#endif
1651 1701
1652void inline_speed 1702void inline_speed
1653time_update (EV_P_ ev_tstamp max_block) 1703time_update (EV_P_ ev_tstamp max_block)
… …
1707 { 1757 {
1708#if EV_PERIODIC_ENABLE 1758#if EV_PERIODIC_ENABLE
1709 periodics_reschedule (EV_A); 1759 periodics_reschedule (EV_A);
1710#endif 1760#endif
1711 /* adjust timers. this is easy, as the offset is the same for all of them */ 1761 /* adjust timers. this is easy, as the offset is the same for all of them */
1712 for (i = 1; i <= timercnt; ++i) 1762 for (i = 0; i < timercnt; ++i)
1713 ev_at (timers [i]) += ev_rt_now - mn_now; 1763 {
1764 ANHE *he = timers + i + HEAP0;
1765 ANHE_w (*he)->at += ev_rt_now - mn_now;
1766 ANHE_at_set (*he);
1767 }
1714 } 1768 }
1715 1769
1716 mn_now = ev_rt_now; 1770 mn_now = ev_rt_now;
1717 } 1771 }
1718} 1772}
… …
1788 1842
1789 waittime = MAX_BLOCKTIME; 1843 waittime = MAX_BLOCKTIME;
1790 1844
1791 if (timercnt) 1845 if (timercnt)
1792 { 1846 {
1793 ev_tstamp to = ev_at (timers [HEAP0]) - mn_now + backend_fudge; 1847 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1794 if (waittime > to) waittime = to; 1848 if (waittime > to) waittime = to;
1795 } 1849 }
1796 1850
1797#if EV_PERIODIC_ENABLE 1851#if EV_PERIODIC_ENABLE
1798 if (periodiccnt) 1852 if (periodiccnt)
1799 { 1853 {
1800 ev_tstamp to = ev_at (periodics [HEAP0]) - ev_rt_now + backend_fudge; 1854 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1801 if (waittime > to) waittime = to; 1855 if (waittime > to) waittime = to;
1802 } 1856 }
1803#endif 1857#endif
1804 1858
1805 if (expect_false (waittime < timeout_blocktime)) 1859 if (expect_false (waittime < timeout_blocktime))
… …
1957{ 2011{
1958 clear_pending (EV_A_ (W)w); 2012 clear_pending (EV_A_ (W)w);
1959 if (expect_false (!ev_is_active (w))) 2013 if (expect_false (!ev_is_active (w)))
1960 return; 2014 return;
1961 2015
1962 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2016 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
1963 2017
1964 wlist_del (&anfds[w->fd].head, (WL)w); 2018 wlist_del (&anfds[w->fd].head, (WL)w);
1965 ev_stop (EV_A_ (W)w); 2019 ev_stop (EV_A_ (W)w);
1966 2020
1967 fd_change (EV_A_ w->fd, 1); 2021 fd_change (EV_A_ w->fd, 1);
… …
1976 ev_at (w) += mn_now; 2030 ev_at (w) += mn_now;
1977 2031
1978 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2032 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1979 2033
1980 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1); 2034 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);
1981 array_needsize (WT, timers, timermax, timercnt + HEAP0, EMPTY2); 2035 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1982 timers [ev_active (w)] = (WT)w; 2036 ANHE_w (timers [ev_active (w)]) = (WT)w;
2037 ANHE_at_set (timers [ev_active (w)]);
1983 upheap (timers, ev_active (w)); 2038 upheap (timers, ev_active (w));
1984 2039
1985 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2040 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1986} 2041}
1987 2042
1988void noinline 2043void noinline
1989ev_timer_stop (EV_P_ ev_timer *w) 2044ev_timer_stop (EV_P_ ev_timer *w)
1990{ 2045{
… …
1993 return; 2048 return;
1994 2049
1995 { 2050 {
1996 int active = ev_active (w); 2051 int active = ev_active (w);
1997 2052
1998 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2053 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
1999 2054
2000 if (expect_true (active < timercnt + HEAP0 - 1)) 2055 if (expect_true (active < timercnt + HEAP0 - 1))
2001 { 2056 {
2002 timers [active] = timers [timercnt + HEAP0 - 1]; 2057 timers [active] = timers [timercnt + HEAP0 - 1];
2003 adjustheap (timers, timercnt, active); 2058 adjustheap (timers, timercnt, active);
… …
2017 if (ev_is_active (w)) 2072 if (ev_is_active (w))
2018 { 2073 {
2019 if (w->repeat) 2074 if (w->repeat)
2020 { 2075 {
2021 ev_at (w) = mn_now + w->repeat; 2076 ev_at (w) = mn_now + w->repeat;
2077 ANHE_at_set (timers [ev_active (w)]);
2022 adjustheap (timers, timercnt, ev_active (w)); 2078 adjustheap (timers, timercnt, ev_active (w));
2023 } 2079 }
2024 else 2080 else
2025 ev_timer_stop (EV_A_ w); 2081 ev_timer_stop (EV_A_ w);
2026 } 2082 }
… …
2048 } 2104 }
2049 else 2105 else
2050 ev_at (w) = w->offset; 2106 ev_at (w) = w->offset;
2051 2107
2052 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1); 2108 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);
2053 array_needsize (WT, periodics, periodicmax, periodiccnt + HEAP0, EMPTY2); 2109 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2054 periodics [ev_active (w)] = (WT)w; 2110 ANHE_w (periodics [ev_active (w)]) = (WT)w;
2111 ANHE_at_set (periodics [ev_active (w)]);
2055 upheap (periodics, ev_active (w)); 2112 upheap (periodics, ev_active (w));
2056 2113
2057 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2114 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
2058} 2115}
2059 2116
2060void noinline 2117void noinline
2061ev_periodic_stop (EV_P_ ev_periodic *w) 2118ev_periodic_stop (EV_P_ ev_periodic *w)
2062{ 2119{
… …
2065 return; 2122 return;
2066 2123
2067 { 2124 {
2068 int active = ev_active (w); 2125 int active = ev_active (w);
2069 2126
2070 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2127 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2071 2128
2072 if (expect_true (active < periodiccnt + HEAP0 - 1)) 2129 if (expect_true (active < periodiccnt + HEAP0 - 1))
2073 { 2130 {
2074 periodics [active] = periodics [periodiccnt + HEAP0 - 1]; 2131 periodics [active] = periodics [periodiccnt + HEAP0 - 1];
2075 adjustheap (periodics, periodiccnt, active); 2132 adjustheap (periodics, periodiccnt, active);

Diff Legend

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