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

Comparing libev/ev.c (file contents):
Revision 1.233 by root, Tue May 6 23:34:16 2008 UTC vs.
Revision 1.244 by root, Tue May 20 23:49:41 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
… …
759 } 786 }
760} 787}
761 788
762/*****************************************************************************/ 789/*****************************************************************************/
763 790
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/*
798 * at the moment we allow libev the luxury of two heaps,
799 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
800 * which is more cache-efficient.
801 * the difference is about 5% with 50000+ watchers.
802 */
803#if EV_USE_4HEAP
804
805#define DHEAP 4
806#define HEAP0 (DHEAP - 1) /* index of first element in heap */
807
764/* towards the root */ 808/* towards the root */
765void inline_speed 809void inline_speed
766upheap (WT *heap, int k) 810upheap (ANHE *heap, int k)
767{ 811{
768 WT w = heap [k]; 812 ANHE he = heap [k];
769 813
770 for (;;) 814 for (;;)
771 { 815 {
772 int p = k >> 1; 816 int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
773 817
774 /* maybe we could use a dummy element at heap [0]? */ 818 if (p == k || ANHE_at (heap [p]) <= ANHE_at (he))
775 if (!p || heap [p]->at <= w->at)
776 break; 819 break;
777 820
778 heap [k] = heap [p]; 821 heap [k] = heap [p];
779 ev_active (heap [k]) = k; 822 ev_active (ANHE_w (heap [k])) = k;
780 k = p; 823 k = p;
781 } 824 }
782 825
826 ev_active (ANHE_w (he)) = k;
783 heap [k] = w; 827 heap [k] = he;
784 ev_active (heap [k]) = k;
785} 828}
786 829
787/* away from the root */ 830/* away from the root */
788void inline_speed 831void inline_speed
789downheap (WT *heap, int N, int k) 832downheap (ANHE *heap, int N, int k)
790{ 833{
791 WT w = heap [k]; 834 ANHE he = heap [k];
835 ANHE *E = heap + N + HEAP0;
836
837 for (;;)
838 {
839 ev_tstamp minat;
840 ANHE *minpos;
841 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0;
842
843 // find minimum child
844 if (expect_true (pos + DHEAP - 1 < E))
845 {
846 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
847 if (ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
848 if (ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
849 if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
850 }
851 else if (pos < E)
852 {
853 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
854 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
855 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
856 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
857 }
858 else
859 break;
860
861 if (ANHE_at (he) <= minat)
862 break;
863
864 ev_active (ANHE_w (*minpos)) = k;
865 heap [k] = *minpos;
866
867 k = minpos - heap;
868 }
869
870 ev_active (ANHE_w (he)) = k;
871 heap [k] = he;
872}
873
874#else // 4HEAP
875
876#define HEAP0 1
877
878/* towards the root */
879void inline_speed
880upheap (ANHE *heap, int k)
881{
882 ANHE he = heap [k];
883
884 for (;;)
885 {
886 int p = k >> 1;
887
888 /* maybe we could use a dummy element at heap [0]? */
889 if (!p || ANHE_at (heap [p]) <= ANHE_at (he))
890 break;
891
892 heap [k] = heap [p];
893 ev_active (ANHE_w (heap [k])) = k;
894 k = p;
895 }
896
897 heap [k] = he;
898 ev_active (ANHE_w (heap [k])) = k;
899}
900
901/* away from the root */
902void inline_speed
903downheap (ANHE *heap, int N, int k)
904{
905 ANHE he = heap [k];
792 906
793 for (;;) 907 for (;;)
794 { 908 {
795 int c = k << 1; 909 int c = k << 1;
796 910
797 if (c > N) 911 if (c > N)
798 break; 912 break;
799 913
800 c += c < N && heap [c]->at > heap [c + 1]->at 914 c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
801 ? 1 : 0; 915 ? 1 : 0;
802 916
803 if (w->at <= heap [c]->at) 917 if (ANHE_at (he) <= ANHE_at (heap [c]))
804 break; 918 break;
805 919
806 heap [k] = heap [c]; 920 heap [k] = heap [c];
807 ev_active (heap [k]) = k; 921 ev_active (ANHE_w (heap [k])) = k;
808 922
809 k = c; 923 k = c;
810 } 924 }
811 925
812 heap [k] = w; 926 heap [k] = he;
813 ev_active (heap [k]) = k; 927 ev_active (ANHE_w (he)) = k;
814} 928}
929#endif
815 930
816void inline_size 931void inline_size
817adjustheap (WT *heap, int N, int k) 932adjustheap (ANHE *heap, int N, int k)
818{ 933{
819 upheap (heap, k); 934 upheap (heap, k);
820 downheap (heap, N, k); 935 downheap (heap, N, k);
821} 936}
822 937
… …
1370void 1485void
1371ev_loop_fork (EV_P) 1486ev_loop_fork (EV_P)
1372{ 1487{
1373 postfork = 1; /* must be in line with ev_default_fork */ 1488 postfork = 1; /* must be in line with ev_default_fork */
1374} 1489}
1375
1376#endif 1490#endif
1377 1491
1378#if EV_MULTIPLICITY 1492#if EV_MULTIPLICITY
1379struct ev_loop * 1493struct ev_loop *
1380ev_default_loop_init (unsigned int flags) 1494ev_default_loop_init (unsigned int flags)
… …
1461 EV_CB_INVOKE (p->w, p->events); 1575 EV_CB_INVOKE (p->w, p->events);
1462 } 1576 }
1463 } 1577 }
1464} 1578}
1465 1579
1466void inline_size
1467timers_reify (EV_P)
1468{
1469 while (timercnt && ev_at (timers [1]) <= mn_now)
1470 {
1471 ev_timer *w = (ev_timer *)timers [1];
1472
1473 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1474
1475 /* first reschedule or stop timer */
1476 if (w->repeat)
1477 {
1478 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1479
1480 ev_at (w) += w->repeat;
1481 if (ev_at (w) < mn_now)
1482 ev_at (w) = mn_now;
1483
1484 downheap (timers, timercnt, 1);
1485 }
1486 else
1487 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1488
1489 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1490 }
1491}
1492
1493#if EV_PERIODIC_ENABLE
1494void inline_size
1495periodics_reify (EV_P)
1496{
1497 while (periodiccnt && ev_at (periodics [1]) <= ev_rt_now)
1498 {
1499 ev_periodic *w = (ev_periodic *)periodics [1];
1500
1501 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1502
1503 /* first reschedule or stop timer */
1504 if (w->reschedule_cb)
1505 {
1506 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1507 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));
1508 downheap (periodics, periodiccnt, 1);
1509 }
1510 else if (w->interval)
1511 {
1512 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1513 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1514 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));
1515 downheap (periodics, periodiccnt, 1);
1516 }
1517 else
1518 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1519
1520 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1521 }
1522}
1523
1524static void noinline
1525periodics_reschedule (EV_P)
1526{
1527 int i;
1528
1529 /* adjust periodics after time jump */
1530 for (i = 1; i <= periodiccnt; ++i)
1531 {
1532 ev_periodic *w = (ev_periodic *)periodics [i];
1533
1534 if (w->reschedule_cb)
1535 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1536 else if (w->interval)
1537 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1538 }
1539
1540 /* now rebuild the heap */
1541 for (i = periodiccnt >> 1; i--; )
1542 downheap (periodics, periodiccnt, i);
1543}
1544#endif
1545
1546#if EV_IDLE_ENABLE 1580#if EV_IDLE_ENABLE
1547void inline_size 1581void inline_size
1548idle_reify (EV_P) 1582idle_reify (EV_P)
1549{ 1583{
1550 if (expect_false (idleall)) 1584 if (expect_false (idleall))
… …
1561 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1595 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1562 break; 1596 break;
1563 } 1597 }
1564 } 1598 }
1565 } 1599 }
1600}
1601#endif
1602
1603void inline_size
1604timers_reify (EV_P)
1605{
1606 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1607 {
1608 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1609
1610 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1611
1612 /* first reschedule or stop timer */
1613 if (w->repeat)
1614 {
1615 ev_at (w) += w->repeat;
1616 if (ev_at (w) < mn_now)
1617 ev_at (w) = mn_now;
1618
1619 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1620
1621 ANHE_at_set (timers [HEAP0]);
1622 downheap (timers, timercnt, HEAP0);
1623 }
1624 else
1625 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1626
1627 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1628 }
1629}
1630
1631#if EV_PERIODIC_ENABLE
1632void inline_size
1633periodics_reify (EV_P)
1634{
1635 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1636 {
1637 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1638
1639 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1640
1641 /* first reschedule or stop timer */
1642 if (w->reschedule_cb)
1643 {
1644 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1645
1646 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1647
1648 ANHE_at_set (periodics [HEAP0]);
1649 downheap (periodics, periodiccnt, HEAP0);
1650 }
1651 else if (w->interval)
1652 {
1653 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1654 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1655
1656 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) >= ev_rt_now));
1657
1658 ANHE_at_set (periodics [HEAP0]);
1659 downheap (periodics, periodiccnt, HEAP0);
1660 }
1661 else
1662 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1663
1664 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1665 }
1666}
1667
1668static void noinline
1669periodics_reschedule (EV_P)
1670{
1671 int i;
1672
1673 /* adjust periodics after time jump */
1674 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1675 {
1676 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1677
1678 if (w->reschedule_cb)
1679 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1680 else if (w->interval)
1681 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1682
1683 ANHE_at_set (periodics [i]);
1684 }
1685
1686 /* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */
1687 /* also, this is easy and corretc for both 2-heaps and 4-heaps */
1688 for (i = 0; i < periodiccnt; ++i)
1689 upheap (periodics, i + HEAP0);
1566} 1690}
1567#endif 1691#endif
1568 1692
1569void inline_speed 1693void inline_speed
1570time_update (EV_P_ ev_tstamp max_block) 1694time_update (EV_P_ ev_tstamp max_block)
… …
1599 */ 1723 */
1600 for (i = 4; --i; ) 1724 for (i = 4; --i; )
1601 { 1725 {
1602 rtmn_diff = ev_rt_now - mn_now; 1726 rtmn_diff = ev_rt_now - mn_now;
1603 1727
1604 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1728 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1605 return; /* all is well */ 1729 return; /* all is well */
1606 1730
1607 ev_rt_now = ev_time (); 1731 ev_rt_now = ev_time ();
1608 mn_now = get_clock (); 1732 mn_now = get_clock ();
1609 now_floor = mn_now; 1733 now_floor = mn_now;
… …
1624 { 1748 {
1625#if EV_PERIODIC_ENABLE 1749#if EV_PERIODIC_ENABLE
1626 periodics_reschedule (EV_A); 1750 periodics_reschedule (EV_A);
1627#endif 1751#endif
1628 /* adjust timers. this is easy, as the offset is the same for all of them */ 1752 /* adjust timers. this is easy, as the offset is the same for all of them */
1629 for (i = 1; i <= timercnt; ++i) 1753 for (i = 0; i < timercnt; ++i)
1630 ev_at (timers [i]) += ev_rt_now - mn_now; 1754 {
1755 ANHE *he = timers + i + HEAP0;
1756 ANHE_w (*he)->at += ev_rt_now - mn_now;
1757 ANHE_at_set (*he);
1758 }
1631 } 1759 }
1632 1760
1633 mn_now = ev_rt_now; 1761 mn_now = ev_rt_now;
1634 } 1762 }
1635} 1763}
… …
1705 1833
1706 waittime = MAX_BLOCKTIME; 1834 waittime = MAX_BLOCKTIME;
1707 1835
1708 if (timercnt) 1836 if (timercnt)
1709 { 1837 {
1710 ev_tstamp to = ev_at (timers [1]) - mn_now + backend_fudge; 1838 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1711 if (waittime > to) waittime = to; 1839 if (waittime > to) waittime = to;
1712 } 1840 }
1713 1841
1714#if EV_PERIODIC_ENABLE 1842#if EV_PERIODIC_ENABLE
1715 if (periodiccnt) 1843 if (periodiccnt)
1716 { 1844 {
1717 ev_tstamp to = ev_at (periodics [1]) - ev_rt_now + backend_fudge; 1845 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1718 if (waittime > to) waittime = to; 1846 if (waittime > to) waittime = to;
1719 } 1847 }
1720#endif 1848#endif
1721 1849
1722 if (expect_false (waittime < timeout_blocktime)) 1850 if (expect_false (waittime < timeout_blocktime))
… …
1874{ 2002{
1875 clear_pending (EV_A_ (W)w); 2003 clear_pending (EV_A_ (W)w);
1876 if (expect_false (!ev_is_active (w))) 2004 if (expect_false (!ev_is_active (w)))
1877 return; 2005 return;
1878 2006
1879 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2007 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
1880 2008
1881 wlist_del (&anfds[w->fd].head, (WL)w); 2009 wlist_del (&anfds[w->fd].head, (WL)w);
1882 ev_stop (EV_A_ (W)w); 2010 ev_stop (EV_A_ (W)w);
1883 2011
1884 fd_change (EV_A_ w->fd, 1); 2012 fd_change (EV_A_ w->fd, 1);
… …
1892 2020
1893 ev_at (w) += mn_now; 2021 ev_at (w) += mn_now;
1894 2022
1895 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2023 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1896 2024
1897 ev_start (EV_A_ (W)w, ++timercnt); 2025 ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);
1898 array_needsize (WT, timers, timermax, timercnt + 1, EMPTY2); 2026 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1899 timers [timercnt] = (WT)w; 2027 ANHE_w (timers [ev_active (w)]) = (WT)w;
2028 ANHE_at_set (timers [ev_active (w)]);
1900 upheap (timers, timercnt); 2029 upheap (timers, ev_active (w));
1901 2030
1902 /*assert (("internal timer heap corruption", timers [ev_active (w)] == w));*/ 2031 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1903} 2032}
1904 2033
1905void noinline 2034void noinline
1906ev_timer_stop (EV_P_ ev_timer *w) 2035ev_timer_stop (EV_P_ ev_timer *w)
1907{ 2036{
… …
1910 return; 2039 return;
1911 2040
1912 { 2041 {
1913 int active = ev_active (w); 2042 int active = ev_active (w);
1914 2043
1915 assert (("internal timer heap corruption", timers [active] == (WT)w)); 2044 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
1916 2045
1917 if (expect_true (active < timercnt)) 2046 if (expect_true (active < timercnt + HEAP0 - 1))
1918 { 2047 {
1919 timers [active] = timers [timercnt]; 2048 timers [active] = timers [timercnt + HEAP0 - 1];
1920 adjustheap (timers, timercnt, active); 2049 adjustheap (timers, timercnt, active);
1921 } 2050 }
1922 2051
1923 --timercnt; 2052 --timercnt;
1924 } 2053 }
… …
1934 if (ev_is_active (w)) 2063 if (ev_is_active (w))
1935 { 2064 {
1936 if (w->repeat) 2065 if (w->repeat)
1937 { 2066 {
1938 ev_at (w) = mn_now + w->repeat; 2067 ev_at (w) = mn_now + w->repeat;
2068 ANHE_at_set (timers [ev_active (w)]);
1939 adjustheap (timers, timercnt, ev_active (w)); 2069 adjustheap (timers, timercnt, ev_active (w));
1940 } 2070 }
1941 else 2071 else
1942 ev_timer_stop (EV_A_ w); 2072 ev_timer_stop (EV_A_ w);
1943 } 2073 }
… …
1964 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2094 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1965 } 2095 }
1966 else 2096 else
1967 ev_at (w) = w->offset; 2097 ev_at (w) = w->offset;
1968 2098
1969 ev_start (EV_A_ (W)w, ++periodiccnt); 2099 ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);
1970 array_needsize (WT, periodics, periodicmax, periodiccnt + 1, EMPTY2); 2100 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
1971 periodics [periodiccnt] = (WT)w; 2101 ANHE_w (periodics [ev_active (w)]) = (WT)w;
1972 upheap (periodics, periodiccnt); 2102 ANHE_at_set (periodics [ev_active (w)]);
2103 upheap (periodics, ev_active (w));
1973 2104
1974 /*assert (("internal periodic heap corruption", periodics [ev_active (w)] == w));*/ 2105 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
1975} 2106}
1976 2107
1977void noinline 2108void noinline
1978ev_periodic_stop (EV_P_ ev_periodic *w) 2109ev_periodic_stop (EV_P_ ev_periodic *w)
1979{ 2110{
… …
1982 return; 2113 return;
1983 2114
1984 { 2115 {
1985 int active = ev_active (w); 2116 int active = ev_active (w);
1986 2117
1987 assert (("internal periodic heap corruption", periodics [active] == (WT)w)); 2118 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
1988 2119
1989 if (expect_true (active < periodiccnt)) 2120 if (expect_true (active < periodiccnt + HEAP0 - 1))
1990 { 2121 {
1991 periodics [active] = periodics [periodiccnt]; 2122 periodics [active] = periodics [periodiccnt + HEAP0 - 1];
1992 adjustheap (periodics, periodiccnt, active); 2123 adjustheap (periodics, periodiccnt, active);
1993 } 2124 }
1994 2125
1995 --periodiccnt; 2126 --periodiccnt;
1996 } 2127 }

Diff Legend

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