[ViewVC] Diff of: cvs/libev/ev.c

Comparing libev/ev.c (file contents):
Revision 1.245 by root, Wed May 21 00:26:01 2008 UTC vs.
Revision 1.253 by root, Sat May 31 03:13:27 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>
…		…
164	#endif	164	#endif
165		165
166	/* this block tries to deduce configuration from header-defined symbols and defaults */	166	/* this block tries to deduce configuration from header-defined symbols and defaults */
167		167
168	#ifndef EV_USE_MONOTONIC	168	#ifndef EV_USE_MONOTONIC
		169	# if defined (_POSIX_MONOTONIC_CLOCK) && _POSIX_MONOTONIC_CLOCK >= 0
		170	# define EV_USE_MONOTONIC 1
		171	# else
169	# define EV_USE_MONOTONIC 0	172	# define EV_USE_MONOTONIC 0
		173	# endif
170	#endif	174	#endif
171		175
172	#ifndef EV_USE_REALTIME	176	#ifndef EV_USE_REALTIME
173	# define EV_USE_REALTIME 0	177	# define EV_USE_REALTIME 0
174	#endif	178	#endif
175		179
176	#ifndef EV_USE_NANOSLEEP	180	#ifndef EV_USE_NANOSLEEP
		181	# if _POSIX_C_SOURCE >= 199309L
		182	# define EV_USE_NANOSLEEP 1
		183	# else
177	# define EV_USE_NANOSLEEP 0	184	# define EV_USE_NANOSLEEP 0
		185	# endif
178	#endif	186	#endif
179		187
180	#ifndef EV_USE_SELECT	188	#ifndef EV_USE_SELECT
181	# define EV_USE_SELECT 1	189	# define EV_USE_SELECT 1
182	#endif	190	#endif
…		…
233	# if __linux && (__GLIBC__ > 2 \|\| (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7))	241	# if __linux && (__GLIBC__ > 2 \|\| (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7))
234	# define EV_USE_EVENTFD 1	242	# define EV_USE_EVENTFD 1
235	# else	243	# else
236	# define EV_USE_EVENTFD 0	244	# define EV_USE_EVENTFD 0
237	# endif	245	# endif
		246	#endif
		247
		248	#if 0 /* debugging */
		249	# define EV_VERIFY 3
		250	# define EV_USE_4HEAP 1
		251	# define EV_HEAP_CACHE_AT 1
		252	#endif
		253
		254	#ifndef EV_VERIFY
		255	# define EV_VERIFY !EV_MINIMAL
238	#endif	256	#endif
239		257
240	#ifndef EV_USE_4HEAP	258	#ifndef EV_USE_4HEAP
241	# define EV_USE_4HEAP !EV_MINIMAL	259	# define EV_USE_4HEAP !EV_MINIMAL
242	#endif	260	#endif
…		…
287	}	305	}
288	# endif	306	# endif
289	#endif	307	#endif
290		308
291	/**/	309	/**/
		310
		311	#if EV_VERIFY >= 3
		312	# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
		313	#else
		314	# define EV_FREQUENT_CHECK do { } while (0)
		315	#endif
292		316
293	/*	317	/*
294	* This is used to avoid floating point rounding problems.	318	* This is used to avoid floating point rounding problems.
295	* It is added to ev_rt_now when scheduling periodics	319	* It is added to ev_rt_now when scheduling periodics
296	* to ensure progress, time-wise, even when rounding	320	* to ensure progress, time-wise, even when rounding
…		…
444	typedef struct {	468	typedef struct {
445	ev_tstamp at;	469	ev_tstamp at;
446	WT w;	470	WT w;
447	} ANHE;	471	} ANHE;
448		472
449	#define ANHE_w(he) (he).w /* access watcher, read-write */	473	#define ANHE_w(he) (he).w /* access watcher, read-write */
450	#define ANHE_at(he) (he).at /* access cached at, read-only */	474	#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 */	475	#define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
452	#else	476	#else
453	typedef WT ANHE;	477	typedef WT ANHE;
454		478
455	#define ANHE_w(he) (he)	479	#define ANHE_w(he) (he)
456	#define ANHE_at(he) (he)->at	480	#define ANHE_at(he) (he)->at
457	#define ANHE_at_set(he)	481	#define ANHE_at_cache(he)
458	#endif	482	#endif
459		483
460	#if EV_MULTIPLICITY	484	#if EV_MULTIPLICITY
461		485
462	struct ev_loop	486	struct ev_loop
…		…
802	*/	826	*/
803	#if EV_USE_4HEAP	827	#if EV_USE_4HEAP
804		828
805	#define DHEAP 4	829	#define DHEAP 4
806	#define HEAP0 (DHEAP - 1) /* index of first element in heap */	830	#define HEAP0 (DHEAP - 1) /* index of first element in heap */
807		831	#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
808	/* towards the root */	832	#define UPHEAP_DONE(p,k) ((p) == (k))
809	void inline_speed
810	upheap (ANHE *heap, int k)
811	{
812	ANHE he = heap [k];
813
814	for (;;)
815	{
816	int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
817
818	if (p == k \|\| ANHE_at (heap [p]) <= ANHE_at (he))
819	break;
820
821	heap [k] = heap [p];
822	ev_active (ANHE_w (heap [k])) = k;
823	k = p;
824	}
825
826	ev_active (ANHE_w (he)) = k;
827	heap [k] = he;
828	}
829		833
830	/* away from the root */	834	/* away from the root */
831	void inline_speed	835	void inline_speed
832	downheap (ANHE *heap, int N, int k)	836	downheap (ANHE *heap, int N, int k)
833	{	837	{
…		…
836		840
837	for (;;)	841	for (;;)
838	{	842	{
839	ev_tstamp minat;	843	ev_tstamp minat;
840	ANHE *minpos;	844	ANHE *minpos;
841	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0;	845	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0 + 1;
842		846
843	// find minimum child	847	/* find minimum child */
844	if (expect_true (pos + DHEAP - 1 < E))	848	if (expect_true (pos + DHEAP - 1 < E))
845	{	849	{
846	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));	850	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));
847	if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));	851	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));	852	if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
…		…
859	break;	863	break;
860		864
861	if (ANHE_at (he) <= minat)	865	if (ANHE_at (he) <= minat)
862	break;	866	break;
863		867
		868	heap [k] = *minpos;
864	ev_active (ANHE_w (*minpos)) = k;	869	ev_active (ANHE_w (*minpos)) = k;
865	heap [k] = *minpos;
866		870
867	k = minpos - heap;	871	k = minpos - heap;
868	}	872	}
869		873
		874	heap [k] = he;
870	ev_active (ANHE_w (he)) = k;	875	ev_active (ANHE_w (he)) = k;
871	heap [k] = he;
872	}	876	}
873		877
874	#else // 4HEAP	878	#else /* 4HEAP */
875		879
876	#define HEAP0 1	880	#define HEAP0 1
877		881	#define HPARENT(k) ((k) >> 1)
878	/* towards the root */	882	#define UPHEAP_DONE(p,k) (!(p))
879	void inline_speed
880	upheap (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		883
901	/* away from the root */	884	/* away from the root */
902	void inline_speed	885	void inline_speed
903	downheap (ANHE *heap, int N, int k)	886	downheap (ANHE *heap, int N, int k)
904	{	887	{
…		…
906		889
907	for (;;)	890	for (;;)
908	{	891	{
909	int c = k << 1;	892	int c = k << 1;
910		893
911	if (c > N)	894	if (c > N + HEAP0 - 1)
912	break;	895	break;
913		896
914	c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])	897	c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
915	? 1 : 0;	898	? 1 : 0;
916		899
917	if (ANHE_at (he) <= ANHE_at (heap [c]))	900	if (ANHE_at (he) <= ANHE_at (heap [c]))
918	break;	901	break;
919		902
…		…
926	heap [k] = he;	909	heap [k] = he;
927	ev_active (ANHE_w (he)) = k;	910	ev_active (ANHE_w (he)) = k;
928	}	911	}
929	#endif	912	#endif
930		913
		914	/* towards the root */
		915	void inline_speed
		916	upheap (ANHE *heap, int k)
		917	{
		918	ANHE he = heap [k];
		919
		920	for (;;)
		921	{
		922	int p = HPARENT (k);
		923
		924	if (UPHEAP_DONE (p, k) \|\| ANHE_at (heap [p]) <= ANHE_at (he))
		925	break;
		926
		927	heap [k] = heap [p];
		928	ev_active (ANHE_w (heap [k])) = k;
		929	k = p;
		930	}
		931
		932	heap [k] = he;
		933	ev_active (ANHE_w (he)) = k;
		934	}
		935
931	void inline_size	936	void inline_size
932	adjustheap (ANHE *heap, int N, int k)	937	adjustheap (ANHE *heap, int N, int k)
933	{	938	{
		939	if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
934	upheap (heap, k);	940	upheap (heap, k);
		941	else
935	downheap (heap, N, k);	942	downheap (heap, N, k);
		943	}
		944
		945	/* rebuild the heap: this function is used only once and executed rarely */
		946	void inline_size
		947	reheap (ANHE *heap, int N)
		948	{
		949	int i;
		950
		951	/* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
		952	/* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
		953	for (i = 0; i < N; ++i)
		954	upheap (heap, i + HEAP0);
936	}	955	}
937		956
938	/*****************************************************************************/	957	/*****************************************************************************/
939		958
940	typedef struct	959	typedef struct
…		…
1458		1477
1459	postfork = 0;	1478	postfork = 0;
1460	}	1479	}
1461		1480
1462	#if EV_MULTIPLICITY	1481	#if EV_MULTIPLICITY
		1482
1463	struct ev_loop *	1483	struct ev_loop *
1464	ev_loop_new (unsigned int flags)	1484	ev_loop_new (unsigned int flags)
1465	{	1485	{
1466	struct ev_loop loop = (struct ev_loop )ev_malloc (sizeof (struct ev_loop));	1486	struct ev_loop loop = (struct ev_loop )ev_malloc (sizeof (struct ev_loop));
1467		1487
…		…
1485	void	1505	void
1486	ev_loop_fork (EV_P)	1506	ev_loop_fork (EV_P)
1487	{	1507	{
1488	postfork = 1; /* must be in line with ev_default_fork */	1508	postfork = 1; /* must be in line with ev_default_fork */
1489	}	1509	}
		1510
		1511	#if EV_VERIFY
		1512	void noinline
		1513	verify_watcher (EV_P_ W w)
		1514	{
		1515	assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI));
		1516
		1517	if (w->pending)
		1518	assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w));
		1519	}
		1520
		1521	static void noinline
		1522	verify_heap (EV_P_ ANHE *heap, int N)
		1523	{
		1524	int i;
		1525
		1526	for (i = HEAP0; i < N + HEAP0; ++i)
		1527	{
		1528	assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
		1529	assert (("heap condition violated", i == HEAP0 \|\| ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
		1530	assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
		1531
		1532	verify_watcher (EV_A_ (W)ANHE_w (heap [i]));
		1533	}
		1534	}
		1535
		1536	static void noinline
		1537	array_verify (EV_P_ W *ws, int cnt)
		1538	{
		1539	while (cnt--)
		1540	{
		1541	assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
		1542	verify_watcher (EV_A_ ws [cnt]);
		1543	}
		1544	}
		1545	#endif
		1546
		1547	void
		1548	ev_loop_verify (EV_P)
		1549	{
		1550	#if EV_VERIFY
		1551	int i;
		1552	WL w;
		1553
		1554	assert (activecnt >= -1);
		1555
		1556	assert (fdchangemax >= fdchangecnt);
		1557	for (i = 0; i < fdchangecnt; ++i)
		1558	assert (("negative fd in fdchanges", fdchanges [i] >= 0));
		1559
		1560	assert (anfdmax >= 0);
		1561	for (i = 0; i < anfdmax; ++i)
		1562	for (w = anfds [i].head; w; w = w->next)
		1563	{
		1564	verify_watcher (EV_A_ (W)w);
		1565	assert (("inactive fd watcher on anfd list", ev_active (w) == 1));
		1566	assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i));
		1567	}
		1568
		1569	assert (timermax >= timercnt);
		1570	verify_heap (EV_A_ timers, timercnt);
		1571
		1572	#if EV_PERIODIC_ENABLE
		1573	assert (periodicmax >= periodiccnt);
		1574	verify_heap (EV_A_ periodics, periodiccnt);
		1575	#endif
		1576
		1577	for (i = NUMPRI; i--; )
		1578	{
		1579	assert (pendingmax [i] >= pendingcnt [i]);
		1580	#if EV_IDLE_ENABLE
		1581	assert (idleall >= 0);
		1582	assert (idlemax [i] >= idlecnt [i]);
		1583	array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
		1584	#endif
		1585	}
		1586
		1587	#if EV_FORK_ENABLE
		1588	assert (forkmax >= forkcnt);
		1589	array_verify (EV_A_ (W *)forks, forkcnt);
		1590	#endif
		1591
		1592	#if EV_ASYNC_ENABLE
		1593	assert (asyncmax >= asynccnt);
		1594	array_verify (EV_A_ (W *)asyncs, asynccnt);
		1595	#endif
		1596
		1597	assert (preparemax >= preparecnt);
		1598	array_verify (EV_A_ (W *)prepares, preparecnt);
		1599
		1600	assert (checkmax >= checkcnt);
		1601	array_verify (EV_A_ (W *)checks, checkcnt);
		1602
		1603	# if 0
		1604	for (w = (ev_child )childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child )((WL)w)->next)
		1605	for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1490	#endif	1606	# endif
		1607	#endif
		1608	}
		1609
		1610	#endif /* multiplicity */
1491		1611
1492	#if EV_MULTIPLICITY	1612	#if EV_MULTIPLICITY
1493	struct ev_loop *	1613	struct ev_loop *
1494	ev_default_loop_init (unsigned int flags)	1614	ev_default_loop_init (unsigned int flags)
1495	#else	1615	#else
…		…
1571	{	1691	{
1572	/assert (("non-pending watcher on pending list", p->w->pending));/	1692	/assert (("non-pending watcher on pending list", p->w->pending));/
1573		1693
1574	p->w->pending = 0;	1694	p->w->pending = 0;
1575	EV_CB_INVOKE (p->w, p->events);	1695	EV_CB_INVOKE (p->w, p->events);
		1696	EV_FREQUENT_CHECK;
1576	}	1697	}
1577	}	1698	}
1578	}	1699	}
1579		1700
1580	#if EV_IDLE_ENABLE	1701	#if EV_IDLE_ENABLE
…		…
1601	#endif	1722	#endif
1602		1723
1603	void inline_size	1724	void inline_size
1604	timers_reify (EV_P)	1725	timers_reify (EV_P)
1605	{	1726	{
		1727	EV_FREQUENT_CHECK;
		1728
1606	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)	1729	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1607	{	1730	{
1608	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);	1731	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);
1609		1732
1610	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/	1733	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/
…		…
1616	if (ev_at (w) < mn_now)	1739	if (ev_at (w) < mn_now)
1617	ev_at (w) = mn_now;	1740	ev_at (w) = mn_now;
1618		1741
1619	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));	1742	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1620		1743
1621	ANHE_at_set (timers [HEAP0]);	1744	ANHE_at_cache (timers [HEAP0]);
1622	downheap (timers, timercnt, HEAP0);	1745	downheap (timers, timercnt, HEAP0);
1623	}	1746	}
1624	else	1747	else
1625	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */	1748	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1626		1749
		1750	EV_FREQUENT_CHECK;
1627	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);	1751	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1628	}	1752	}
1629	}	1753	}
1630		1754
1631	#if EV_PERIODIC_ENABLE	1755	#if EV_PERIODIC_ENABLE
1632	void inline_size	1756	void inline_size
1633	periodics_reify (EV_P)	1757	periodics_reify (EV_P)
1634	{	1758	{
		1759	EV_FREQUENT_CHECK;
		1760
1635	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)	1761	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1636	{	1762	{
1637	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);	1763	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);
1638		1764
1639	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/	1765	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/
…		…
1643	{	1769	{
1644	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1770	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1645		1771
1646	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));	1772	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1647		1773
1648	ANHE_at_set (periodics [HEAP0]);	1774	ANHE_at_cache (periodics [HEAP0]);
1649	downheap (periodics, periodiccnt, HEAP0);	1775	downheap (periodics, periodiccnt, HEAP0);
1650	}	1776	}
1651	else if (w->interval)	1777	else if (w->interval)
1652	{	1778	{
1653	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1779	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
		1780	/* if next trigger time is not sufficiently in the future, put it there */
		1781	/* this might happen because of floating point inexactness */
1654	if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;	1782	if (ev_at (w) - ev_rt_now < TIME_EPSILON)
		1783	{
		1784	ev_at (w) += w->interval;
1655		1785
1656	assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) >= ev_rt_now));	1786	/* if interval is unreasonably low we might still have a time in the past */
		1787	/* so correct this. this will make the periodic very inexact, but the user */
		1788	/* has effectively asked to get triggered more often than possible */
		1789	if (ev_at (w) < ev_rt_now)
		1790	ev_at (w) = ev_rt_now;
		1791	}
1657		1792
1658	ANHE_at_set (periodics [HEAP0]);	1793	ANHE_at_cache (periodics [HEAP0]);
1659	downheap (periodics, periodiccnt, HEAP0);	1794	downheap (periodics, periodiccnt, HEAP0);
1660	}	1795	}
1661	else	1796	else
1662	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */	1797	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1663		1798
		1799	EV_FREQUENT_CHECK;
1664	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);	1800	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1665	}	1801	}
1666	}	1802	}
1667		1803
1668	static void noinline	1804	static void noinline
…		…
1678	if (w->reschedule_cb)	1814	if (w->reschedule_cb)
1679	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1815	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1680	else if (w->interval)	1816	else if (w->interval)
1681	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1817	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1682		1818
1683	ANHE_at_set (periodics [i]);	1819	ANHE_at_cache (periodics [i]);
1684	}	1820	}
1685		1821
1686	/* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */	1822	reheap (periodics, periodiccnt);
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);
1690	}	1823	}
1691	#endif	1824	#endif
1692		1825
1693	void inline_speed	1826	void inline_speed
1694	time_update (EV_P_ ev_tstamp max_block)	1827	time_update (EV_P_ ev_tstamp max_block)
…		…
1752	/* adjust timers. this is easy, as the offset is the same for all of them */	1885	/* adjust timers. this is easy, as the offset is the same for all of them */
1753	for (i = 0; i < timercnt; ++i)	1886	for (i = 0; i < timercnt; ++i)
1754	{	1887	{
1755	ANHE *he = timers + i + HEAP0;	1888	ANHE *he = timers + i + HEAP0;
1756	ANHE_w (*he)->at += ev_rt_now - mn_now;	1889	ANHE_w (*he)->at += ev_rt_now - mn_now;
1757	ANHE_at_set (*he);	1890	ANHE_at_cache (*he);
1758	}	1891	}
1759	}	1892	}
1760		1893
1761	mn_now = ev_rt_now;	1894	mn_now = ev_rt_now;
1762	}	1895	}
…		…
1783		1916
1784	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */	1917	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1785		1918
1786	do	1919	do
1787	{	1920	{
		1921	#if EV_VERIFY >= 2
		1922	ev_loop_verify (EV_A);
		1923	#endif
		1924
1788	#ifndef _WIN32	1925	#ifndef _WIN32
1789	if (expect_false (curpid)) /* penalise the forking check even more */	1926	if (expect_false (curpid)) /* penalise the forking check even more */
1790	if (expect_false (getpid () != curpid))	1927	if (expect_false (getpid () != curpid))
1791	{	1928	{
1792	curpid = getpid ();	1929	curpid = getpid ();
…		…
1987	if (expect_false (ev_is_active (w)))	2124	if (expect_false (ev_is_active (w)))
1988	return;	2125	return;
1989		2126
1990	assert (("ev_io_start called with negative fd", fd >= 0));	2127	assert (("ev_io_start called with negative fd", fd >= 0));
1991		2128
		2129	EV_FREQUENT_CHECK;
		2130
1992	ev_start (EV_A_ (W)w, 1);	2131	ev_start (EV_A_ (W)w, 1);
1993	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);	2132	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1994	wlist_add (&anfds[fd].head, (WL)w);	2133	wlist_add (&anfds[fd].head, (WL)w);
1995		2134
1996	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);	2135	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);
1997	w->events &= ~EV_IOFDSET;	2136	w->events &= ~EV_IOFDSET;
		2137
		2138	EV_FREQUENT_CHECK;
1998	}	2139	}
1999		2140
2000	void noinline	2141	void noinline
2001	ev_io_stop (EV_P_ ev_io *w)	2142	ev_io_stop (EV_P_ ev_io *w)
2002	{	2143	{
…		…
2004	if (expect_false (!ev_is_active (w)))	2145	if (expect_false (!ev_is_active (w)))
2005	return;	2146	return;
2006		2147
2007	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));	2148	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2008		2149
		2150	EV_FREQUENT_CHECK;
		2151
2009	wlist_del (&anfds[w->fd].head, (WL)w);	2152	wlist_del (&anfds[w->fd].head, (WL)w);
2010	ev_stop (EV_A_ (W)w);	2153	ev_stop (EV_A_ (W)w);
2011		2154
2012	fd_change (EV_A_ w->fd, 1);	2155	fd_change (EV_A_ w->fd, 1);
		2156
		2157	EV_FREQUENT_CHECK;
2013	}	2158	}
2014		2159
2015	void noinline	2160	void noinline
2016	ev_timer_start (EV_P_ ev_timer *w)	2161	ev_timer_start (EV_P_ ev_timer *w)
2017	{	2162	{
…		…
2020		2165
2021	ev_at (w) += mn_now;	2166	ev_at (w) += mn_now;
2022		2167
2023	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));	2168	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2024		2169
		2170	EV_FREQUENT_CHECK;
		2171
		2172	++timercnt;
2025	ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);	2173	ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2026	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);	2174	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2027	ANHE_w (timers [ev_active (w)]) = (WT)w;	2175	ANHE_w (timers [ev_active (w)]) = (WT)w;
2028	ANHE_at_set (timers [ev_active (w)]);	2176	ANHE_at_cache (timers [ev_active (w)]);
2029	upheap (timers, ev_active (w));	2177	upheap (timers, ev_active (w));
		2178
		2179	EV_FREQUENT_CHECK;
2030		2180
2031	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/	2181	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/
2032	}	2182	}
2033		2183
2034	void noinline	2184	void noinline
…		…
2036	{	2186	{
2037	clear_pending (EV_A_ (W)w);	2187	clear_pending (EV_A_ (W)w);
2038	if (expect_false (!ev_is_active (w)))	2188	if (expect_false (!ev_is_active (w)))
2039	return;	2189	return;
2040		2190
		2191	EV_FREQUENT_CHECK;
		2192
2041	{	2193	{
2042	int active = ev_active (w);	2194	int active = ev_active (w);
2043		2195
2044	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));	2196	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2045		2197
		2198	--timercnt;
		2199
2046	if (expect_true (active < timercnt + HEAP0 - 1))	2200	if (expect_true (active < timercnt + HEAP0))
2047	{	2201	{
2048	timers [active] = timers [timercnt + HEAP0 - 1];	2202	timers [active] = timers [timercnt + HEAP0];
2049	adjustheap (timers, timercnt, active);	2203	adjustheap (timers, timercnt, active);
2050	}	2204	}
2051
2052	--timercnt;
2053	}	2205	}
		2206
		2207	EV_FREQUENT_CHECK;
2054		2208
2055	ev_at (w) -= mn_now;	2209	ev_at (w) -= mn_now;
2056		2210
2057	ev_stop (EV_A_ (W)w);	2211	ev_stop (EV_A_ (W)w);
2058	}	2212	}
2059		2213
2060	void noinline	2214	void noinline
2061	ev_timer_again (EV_P_ ev_timer *w)	2215	ev_timer_again (EV_P_ ev_timer *w)
2062	{	2216	{
		2217	EV_FREQUENT_CHECK;
		2218
2063	if (ev_is_active (w))	2219	if (ev_is_active (w))
2064	{	2220	{
2065	if (w->repeat)	2221	if (w->repeat)
2066	{	2222	{
2067	ev_at (w) = mn_now + w->repeat;	2223	ev_at (w) = mn_now + w->repeat;
2068	ANHE_at_set (timers [ev_active (w)]);	2224	ANHE_at_cache (timers [ev_active (w)]);
2069	adjustheap (timers, timercnt, ev_active (w));	2225	adjustheap (timers, timercnt, ev_active (w));
2070	}	2226	}
2071	else	2227	else
2072	ev_timer_stop (EV_A_ w);	2228	ev_timer_stop (EV_A_ w);
2073	}	2229	}
2074	else if (w->repeat)	2230	else if (w->repeat)
2075	{	2231	{
2076	ev_at (w) = w->repeat;	2232	ev_at (w) = w->repeat;
2077	ev_timer_start (EV_A_ w);	2233	ev_timer_start (EV_A_ w);
2078	}	2234	}
		2235
		2236	EV_FREQUENT_CHECK;
2079	}	2237	}
2080		2238
2081	#if EV_PERIODIC_ENABLE	2239	#if EV_PERIODIC_ENABLE
2082	void noinline	2240	void noinline
2083	ev_periodic_start (EV_P_ ev_periodic *w)	2241	ev_periodic_start (EV_P_ ev_periodic *w)
…		…
2094	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	2252	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2095	}	2253	}
2096	else	2254	else
2097	ev_at (w) = w->offset;	2255	ev_at (w) = w->offset;
2098		2256
		2257	EV_FREQUENT_CHECK;
		2258
		2259	++periodiccnt;
2099	ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);	2260	ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2100	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);	2261	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2101	ANHE_w (periodics [ev_active (w)]) = (WT)w;	2262	ANHE_w (periodics [ev_active (w)]) = (WT)w;
2102	ANHE_at_set (periodics [ev_active (w)]);	2263	ANHE_at_cache (periodics [ev_active (w)]);
2103	upheap (periodics, ev_active (w));	2264	upheap (periodics, ev_active (w));
		2265
		2266	EV_FREQUENT_CHECK;
2104		2267
2105	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/	2268	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/
2106	}	2269	}
2107		2270
2108	void noinline	2271	void noinline
…		…
2110	{	2273	{
2111	clear_pending (EV_A_ (W)w);	2274	clear_pending (EV_A_ (W)w);
2112	if (expect_false (!ev_is_active (w)))	2275	if (expect_false (!ev_is_active (w)))
2113	return;	2276	return;
2114		2277
		2278	EV_FREQUENT_CHECK;
		2279
2115	{	2280	{
2116	int active = ev_active (w);	2281	int active = ev_active (w);
2117		2282
2118	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));	2283	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2119		2284
		2285	--periodiccnt;
		2286
2120	if (expect_true (active < periodiccnt + HEAP0 - 1))	2287	if (expect_true (active < periodiccnt + HEAP0))
2121	{	2288	{
2122	periodics [active] = periodics [periodiccnt + HEAP0 - 1];	2289	periodics [active] = periodics [periodiccnt + HEAP0];
2123	adjustheap (periodics, periodiccnt, active);	2290	adjustheap (periodics, periodiccnt, active);
2124	}	2291	}
2125
2126	--periodiccnt;
2127	}	2292	}
		2293
		2294	EV_FREQUENT_CHECK;
2128		2295
2129	ev_stop (EV_A_ (W)w);	2296	ev_stop (EV_A_ (W)w);
2130	}	2297	}
2131		2298
2132	void noinline	2299	void noinline
…		…
2152	return;	2319	return;
2153		2320
2154	assert (("ev_signal_start called with illegal signal number", w->signum > 0));	2321	assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2155		2322
2156	evpipe_init (EV_A);	2323	evpipe_init (EV_A);
		2324
		2325	EV_FREQUENT_CHECK;
2157		2326
2158	{	2327	{
2159	#ifndef _WIN32	2328	#ifndef _WIN32
2160	sigset_t full, prev;	2329	sigset_t full, prev;
2161	sigfillset (&full);	2330	sigfillset (&full);
…		…
2182	sigfillset (&sa.sa_mask);	2351	sigfillset (&sa.sa_mask);
2183	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */	2352	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2184	sigaction (w->signum, &sa, 0);	2353	sigaction (w->signum, &sa, 0);
2185	#endif	2354	#endif
2186	}	2355	}
		2356
		2357	EV_FREQUENT_CHECK;
2187	}	2358	}
2188		2359
2189	void noinline	2360	void noinline
2190	ev_signal_stop (EV_P_ ev_signal *w)	2361	ev_signal_stop (EV_P_ ev_signal *w)
2191	{	2362	{
2192	clear_pending (EV_A_ (W)w);	2363	clear_pending (EV_A_ (W)w);
2193	if (expect_false (!ev_is_active (w)))	2364	if (expect_false (!ev_is_active (w)))
2194	return;	2365	return;
2195		2366
		2367	EV_FREQUENT_CHECK;
		2368
2196	wlist_del (&signals [w->signum - 1].head, (WL)w);	2369	wlist_del (&signals [w->signum - 1].head, (WL)w);
2197	ev_stop (EV_A_ (W)w);	2370	ev_stop (EV_A_ (W)w);
2198		2371
2199	if (!signals [w->signum - 1].head)	2372	if (!signals [w->signum - 1].head)
2200	signal (w->signum, SIG_DFL);	2373	signal (w->signum, SIG_DFL);
		2374
		2375	EV_FREQUENT_CHECK;
2201	}	2376	}
2202		2377
2203	void	2378	void
2204	ev_child_start (EV_P_ ev_child *w)	2379	ev_child_start (EV_P_ ev_child *w)
2205	{	2380	{
…		…
2207	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));	2382	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2208	#endif	2383	#endif
2209	if (expect_false (ev_is_active (w)))	2384	if (expect_false (ev_is_active (w)))
2210	return;	2385	return;
2211		2386
		2387	EV_FREQUENT_CHECK;
		2388
2212	ev_start (EV_A_ (W)w, 1);	2389	ev_start (EV_A_ (W)w, 1);
2213	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2390	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
		2391
		2392	EV_FREQUENT_CHECK;
2214	}	2393	}
2215		2394
2216	void	2395	void
2217	ev_child_stop (EV_P_ ev_child *w)	2396	ev_child_stop (EV_P_ ev_child *w)
2218	{	2397	{
2219	clear_pending (EV_A_ (W)w);	2398	clear_pending (EV_A_ (W)w);
2220	if (expect_false (!ev_is_active (w)))	2399	if (expect_false (!ev_is_active (w)))
2221	return;	2400	return;
2222		2401
		2402	EV_FREQUENT_CHECK;
		2403
2223	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2404	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2224	ev_stop (EV_A_ (W)w);	2405	ev_stop (EV_A_ (W)w);
		2406
		2407	EV_FREQUENT_CHECK;
2225	}	2408	}
2226		2409
2227	#if EV_STAT_ENABLE	2410	#if EV_STAT_ENABLE
2228		2411
2229	# ifdef _WIN32	2412	# ifdef _WIN32
…		…
2457	else	2640	else
2458	#endif	2641	#endif
2459	ev_timer_start (EV_A_ &w->timer);	2642	ev_timer_start (EV_A_ &w->timer);
2460		2643
2461	ev_start (EV_A_ (W)w, 1);	2644	ev_start (EV_A_ (W)w, 1);
		2645
		2646	EV_FREQUENT_CHECK;
2462	}	2647	}
2463		2648
2464	void	2649	void
2465	ev_stat_stop (EV_P_ ev_stat *w)	2650	ev_stat_stop (EV_P_ ev_stat *w)
2466	{	2651	{
2467	clear_pending (EV_A_ (W)w);	2652	clear_pending (EV_A_ (W)w);
2468	if (expect_false (!ev_is_active (w)))	2653	if (expect_false (!ev_is_active (w)))
2469	return;	2654	return;
2470		2655
		2656	EV_FREQUENT_CHECK;
		2657
2471	#if EV_USE_INOTIFY	2658	#if EV_USE_INOTIFY
2472	infy_del (EV_A_ w);	2659	infy_del (EV_A_ w);
2473	#endif	2660	#endif
2474	ev_timer_stop (EV_A_ &w->timer);	2661	ev_timer_stop (EV_A_ &w->timer);
2475		2662
2476	ev_stop (EV_A_ (W)w);	2663	ev_stop (EV_A_ (W)w);
		2664
		2665	EV_FREQUENT_CHECK;
2477	}	2666	}
2478	#endif	2667	#endif
2479		2668
2480	#if EV_IDLE_ENABLE	2669	#if EV_IDLE_ENABLE
2481	void	2670	void
…		…
2483	{	2672	{
2484	if (expect_false (ev_is_active (w)))	2673	if (expect_false (ev_is_active (w)))
2485	return;	2674	return;
2486		2675
2487	pri_adjust (EV_A_ (W)w);	2676	pri_adjust (EV_A_ (W)w);
		2677
		2678	EV_FREQUENT_CHECK;
2488		2679
2489	{	2680	{
2490	int active = ++idlecnt [ABSPRI (w)];	2681	int active = ++idlecnt [ABSPRI (w)];
2491		2682
2492	++idleall;	2683	++idleall;
2493	ev_start (EV_A_ (W)w, active);	2684	ev_start (EV_A_ (W)w, active);
2494		2685
2495	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);	2686	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2496	idles [ABSPRI (w)][active - 1] = w;	2687	idles [ABSPRI (w)][active - 1] = w;
2497	}	2688	}
		2689
		2690	EV_FREQUENT_CHECK;
2498	}	2691	}
2499		2692
2500	void	2693	void
2501	ev_idle_stop (EV_P_ ev_idle *w)	2694	ev_idle_stop (EV_P_ ev_idle *w)
2502	{	2695	{
2503	clear_pending (EV_A_ (W)w);	2696	clear_pending (EV_A_ (W)w);
2504	if (expect_false (!ev_is_active (w)))	2697	if (expect_false (!ev_is_active (w)))
2505	return;	2698	return;
2506		2699
		2700	EV_FREQUENT_CHECK;
		2701
2507	{	2702	{
2508	int active = ev_active (w);	2703	int active = ev_active (w);
2509		2704
2510	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];	2705	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2511	ev_active (idles [ABSPRI (w)][active - 1]) = active;	2706	ev_active (idles [ABSPRI (w)][active - 1]) = active;
2512		2707
2513	ev_stop (EV_A_ (W)w);	2708	ev_stop (EV_A_ (W)w);
2514	--idleall;	2709	--idleall;
2515	}	2710	}
		2711
		2712	EV_FREQUENT_CHECK;
2516	}	2713	}
2517	#endif	2714	#endif
2518		2715
2519	void	2716	void
2520	ev_prepare_start (EV_P_ ev_prepare *w)	2717	ev_prepare_start (EV_P_ ev_prepare *w)
2521	{	2718	{
2522	if (expect_false (ev_is_active (w)))	2719	if (expect_false (ev_is_active (w)))
2523	return;	2720	return;
		2721
		2722	EV_FREQUENT_CHECK;
2524		2723
2525	ev_start (EV_A_ (W)w, ++preparecnt);	2724	ev_start (EV_A_ (W)w, ++preparecnt);
2526	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);	2725	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2527	prepares [preparecnt - 1] = w;	2726	prepares [preparecnt - 1] = w;
		2727
		2728	EV_FREQUENT_CHECK;
2528	}	2729	}
2529		2730
2530	void	2731	void
2531	ev_prepare_stop (EV_P_ ev_prepare *w)	2732	ev_prepare_stop (EV_P_ ev_prepare *w)
2532	{	2733	{
2533	clear_pending (EV_A_ (W)w);	2734	clear_pending (EV_A_ (W)w);
2534	if (expect_false (!ev_is_active (w)))	2735	if (expect_false (!ev_is_active (w)))
2535	return;	2736	return;
2536		2737
		2738	EV_FREQUENT_CHECK;
		2739
2537	{	2740	{
2538	int active = ev_active (w);	2741	int active = ev_active (w);
2539		2742
2540	prepares [active - 1] = prepares [--preparecnt];	2743	prepares [active - 1] = prepares [--preparecnt];
2541	ev_active (prepares [active - 1]) = active;	2744	ev_active (prepares [active - 1]) = active;
2542	}	2745	}
2543		2746
2544	ev_stop (EV_A_ (W)w);	2747	ev_stop (EV_A_ (W)w);
		2748
		2749	EV_FREQUENT_CHECK;
2545	}	2750	}
2546		2751
2547	void	2752	void
2548	ev_check_start (EV_P_ ev_check *w)	2753	ev_check_start (EV_P_ ev_check *w)
2549	{	2754	{
2550	if (expect_false (ev_is_active (w)))	2755	if (expect_false (ev_is_active (w)))
2551	return;	2756	return;
		2757
		2758	EV_FREQUENT_CHECK;
2552		2759
2553	ev_start (EV_A_ (W)w, ++checkcnt);	2760	ev_start (EV_A_ (W)w, ++checkcnt);
2554	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);	2761	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2555	checks [checkcnt - 1] = w;	2762	checks [checkcnt - 1] = w;
		2763
		2764	EV_FREQUENT_CHECK;
2556	}	2765	}
2557		2766
2558	void	2767	void
2559	ev_check_stop (EV_P_ ev_check *w)	2768	ev_check_stop (EV_P_ ev_check *w)
2560	{	2769	{
2561	clear_pending (EV_A_ (W)w);	2770	clear_pending (EV_A_ (W)w);
2562	if (expect_false (!ev_is_active (w)))	2771	if (expect_false (!ev_is_active (w)))
2563	return;	2772	return;
2564		2773
		2774	EV_FREQUENT_CHECK;
		2775
2565	{	2776	{
2566	int active = ev_active (w);	2777	int active = ev_active (w);
2567		2778
2568	checks [active - 1] = checks [--checkcnt];	2779	checks [active - 1] = checks [--checkcnt];
2569	ev_active (checks [active - 1]) = active;	2780	ev_active (checks [active - 1]) = active;
2570	}	2781	}
2571		2782
2572	ev_stop (EV_A_ (W)w);	2783	ev_stop (EV_A_ (W)w);
		2784
		2785	EV_FREQUENT_CHECK;
2573	}	2786	}
2574		2787
2575	#if EV_EMBED_ENABLE	2788	#if EV_EMBED_ENABLE
2576	void noinline	2789	void noinline
2577	ev_embed_sweep (EV_P_ ev_embed *w)	2790	ev_embed_sweep (EV_P_ ev_embed *w)
…		…
2624	struct ev_loop *loop = w->other;	2837	struct ev_loop *loop = w->other;
2625	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));	2838	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2626	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);	2839	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2627	}	2840	}
2628		2841
		2842	EV_FREQUENT_CHECK;
		2843
2629	ev_set_priority (&w->io, ev_priority (w));	2844	ev_set_priority (&w->io, ev_priority (w));
2630	ev_io_start (EV_A_ &w->io);	2845	ev_io_start (EV_A_ &w->io);
2631		2846
2632	ev_prepare_init (&w->prepare, embed_prepare_cb);	2847	ev_prepare_init (&w->prepare, embed_prepare_cb);
2633	ev_set_priority (&w->prepare, EV_MINPRI);	2848	ev_set_priority (&w->prepare, EV_MINPRI);
2634	ev_prepare_start (EV_A_ &w->prepare);	2849	ev_prepare_start (EV_A_ &w->prepare);
2635		2850
2636	/ev_idle_init (&w->idle, e,bed_idle_cb);/	2851	/ev_idle_init (&w->idle, e,bed_idle_cb);/
2637		2852
2638	ev_start (EV_A_ (W)w, 1);	2853	ev_start (EV_A_ (W)w, 1);
		2854
		2855	EV_FREQUENT_CHECK;
2639	}	2856	}
2640		2857
2641	void	2858	void
2642	ev_embed_stop (EV_P_ ev_embed *w)	2859	ev_embed_stop (EV_P_ ev_embed *w)
2643	{	2860	{
2644	clear_pending (EV_A_ (W)w);	2861	clear_pending (EV_A_ (W)w);
2645	if (expect_false (!ev_is_active (w)))	2862	if (expect_false (!ev_is_active (w)))
2646	return;	2863	return;
2647		2864
		2865	EV_FREQUENT_CHECK;
		2866
2648	ev_io_stop (EV_A_ &w->io);	2867	ev_io_stop (EV_A_ &w->io);
2649	ev_prepare_stop (EV_A_ &w->prepare);	2868	ev_prepare_stop (EV_A_ &w->prepare);
2650		2869
2651	ev_stop (EV_A_ (W)w);	2870	ev_stop (EV_A_ (W)w);
		2871
		2872	EV_FREQUENT_CHECK;
2652	}	2873	}
2653	#endif	2874	#endif
2654		2875
2655	#if EV_FORK_ENABLE	2876	#if EV_FORK_ENABLE
2656	void	2877	void
2657	ev_fork_start (EV_P_ ev_fork *w)	2878	ev_fork_start (EV_P_ ev_fork *w)
2658	{	2879	{
2659	if (expect_false (ev_is_active (w)))	2880	if (expect_false (ev_is_active (w)))
2660	return;	2881	return;
		2882
		2883	EV_FREQUENT_CHECK;
2661		2884
2662	ev_start (EV_A_ (W)w, ++forkcnt);	2885	ev_start (EV_A_ (W)w, ++forkcnt);
2663	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);	2886	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2664	forks [forkcnt - 1] = w;	2887	forks [forkcnt - 1] = w;
		2888
		2889	EV_FREQUENT_CHECK;
2665	}	2890	}
2666		2891
2667	void	2892	void
2668	ev_fork_stop (EV_P_ ev_fork *w)	2893	ev_fork_stop (EV_P_ ev_fork *w)
2669	{	2894	{
2670	clear_pending (EV_A_ (W)w);	2895	clear_pending (EV_A_ (W)w);
2671	if (expect_false (!ev_is_active (w)))	2896	if (expect_false (!ev_is_active (w)))
2672	return;	2897	return;
2673		2898
		2899	EV_FREQUENT_CHECK;
		2900
2674	{	2901	{
2675	int active = ev_active (w);	2902	int active = ev_active (w);
2676		2903
2677	forks [active - 1] = forks [--forkcnt];	2904	forks [active - 1] = forks [--forkcnt];
2678	ev_active (forks [active - 1]) = active;	2905	ev_active (forks [active - 1]) = active;
2679	}	2906	}
2680		2907
2681	ev_stop (EV_A_ (W)w);	2908	ev_stop (EV_A_ (W)w);
		2909
		2910	EV_FREQUENT_CHECK;
2682	}	2911	}
2683	#endif	2912	#endif
2684		2913
2685	#if EV_ASYNC_ENABLE	2914	#if EV_ASYNC_ENABLE
2686	void	2915	void
…		…
2688	{	2917	{
2689	if (expect_false (ev_is_active (w)))	2918	if (expect_false (ev_is_active (w)))
2690	return;	2919	return;
2691		2920
2692	evpipe_init (EV_A);	2921	evpipe_init (EV_A);
		2922
		2923	EV_FREQUENT_CHECK;
2693		2924
2694	ev_start (EV_A_ (W)w, ++asynccnt);	2925	ev_start (EV_A_ (W)w, ++asynccnt);
2695	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);	2926	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2696	asyncs [asynccnt - 1] = w;	2927	asyncs [asynccnt - 1] = w;
		2928
		2929	EV_FREQUENT_CHECK;
2697	}	2930	}
2698		2931
2699	void	2932	void
2700	ev_async_stop (EV_P_ ev_async *w)	2933	ev_async_stop (EV_P_ ev_async *w)
2701	{	2934	{
2702	clear_pending (EV_A_ (W)w);	2935	clear_pending (EV_A_ (W)w);
2703	if (expect_false (!ev_is_active (w)))	2936	if (expect_false (!ev_is_active (w)))
2704	return;	2937	return;
2705		2938
		2939	EV_FREQUENT_CHECK;
		2940
2706	{	2941	{
2707	int active = ev_active (w);	2942	int active = ev_active (w);
2708		2943
2709	asyncs [active - 1] = asyncs [--asynccnt];	2944	asyncs [active - 1] = asyncs [--asynccnt];
2710	ev_active (asyncs [active - 1]) = active;	2945	ev_active (asyncs [active - 1]) = active;
2711	}	2946	}
2712		2947
2713	ev_stop (EV_A_ (W)w);	2948	ev_stop (EV_A_ (W)w);
		2949
		2950	EV_FREQUENT_CHECK;
2714	}	2951	}
2715		2952
2716	void	2953	void
2717	ev_async_send (EV_P_ ev_async *w)	2954	ev_async_send (EV_P_ ev_async *w)
2718	{	2955	{

Diff Legend

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

Comparing libev/ev.c (file contents): Revision 1.245 by root, Wed May 21 00:26:01 2008 UTC vs. Revision 1.253 by root, Sat May 31 03:13:27 2008 UTC

Diff Legend

Comparing libev/ev.c (file contents):
Revision 1.245 by root, Wed May 21 00:26:01 2008 UTC vs.
Revision 1.253 by root, Sat May 31 03:13:27 2008 UTC