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

Comparing libev/ev.c (file contents):
Revision 1.246 by root, Wed May 21 12:51:38 2008 UTC vs.
Revision 1.252 by root, Thu May 22 03:43:32 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>
…		…
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	#if 0 /* debugging */
		241	# define EV_VERIFY 3
		242	# define EV_USE_4HEAP 1
		243	# define EV_HEAP_CACHE_AT 1
		244	#endif
		245
		246	#ifndef EV_VERIFY
		247	# define EV_VERIFY !EV_MINIMAL
		248	#endif
		249
240	#ifndef EV_USE_4HEAP	250	#ifndef EV_USE_4HEAP
241	# define EV_USE_4HEAP !EV_MINIMAL	251	# define EV_USE_4HEAP !EV_MINIMAL
242	#endif	252	#endif
243		253
244	#ifndef EV_HEAP_CACHE_AT	254	#ifndef EV_HEAP_CACHE_AT
…		…
287	}	297	}
288	# endif	298	# endif
289	#endif	299	#endif
290		300
291	/**/	301	/**/
		302
		303	#if EV_VERIFY >= 3
		304	# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
		305	#else
		306	# define EV_FREQUENT_CHECK do { } while (0)
		307	#endif
292		308
293	/*	309	/*
294	* This is used to avoid floating point rounding problems.	310	* This is used to avoid floating point rounding problems.
295	* It is added to ev_rt_now when scheduling periodics	311	* It is added to ev_rt_now when scheduling periodics
296	* to ensure progress, time-wise, even when rounding	312	* to ensure progress, time-wise, even when rounding
…		…
444	typedef struct {	460	typedef struct {
445	ev_tstamp at;	461	ev_tstamp at;
446	WT w;	462	WT w;
447	} ANHE;	463	} ANHE;
448		464
449	#define ANHE_w(he) (he).w /* access watcher, read-write */	465	#define ANHE_w(he) (he).w /* access watcher, read-write */
450	#define ANHE_at(he) (he).at /* access cached at, read-only */	466	#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 */	467	#define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
452	#else	468	#else
453	typedef WT ANHE;	469	typedef WT ANHE;
454		470
455	#define ANHE_w(he) (he)	471	#define ANHE_w(he) (he)
456	#define ANHE_at(he) (he)->at	472	#define ANHE_at(he) (he)->at
457	#define ANHE_at_set(he)	473	#define ANHE_at_cache(he)
458	#endif	474	#endif
459		475
460	#if EV_MULTIPLICITY	476	#if EV_MULTIPLICITY
461		477
462	struct ev_loop	478	struct ev_loop
…		…
802	*/	818	*/
803	#if EV_USE_4HEAP	819	#if EV_USE_4HEAP
804		820
805	#define DHEAP 4	821	#define DHEAP 4
806	#define HEAP0 (DHEAP - 1) /* index of first element in heap */	822	#define HEAP0 (DHEAP - 1) /* index of first element in heap */
807		823	#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
808	/* towards the root */	824	#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		825
830	/* away from the root */	826	/* away from the root */
831	void inline_speed	827	void inline_speed
832	downheap (ANHE *heap, int N, int k)	828	downheap (ANHE *heap, int N, int k)
833	{	829	{
…		…
836		832
837	for (;;)	833	for (;;)
838	{	834	{
839	ev_tstamp minat;	835	ev_tstamp minat;
840	ANHE *minpos;	836	ANHE *minpos;
841	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0;	837	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0 + 1;
842		838
843	// find minimum child	839	/* find minimum child */
844	if (expect_true (pos + DHEAP - 1 < E))	840	if (expect_true (pos + DHEAP - 1 < E))
845	{	841	{
846	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));	842	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));
847	if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));	843	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));	844	if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
…		…
859	break;	855	break;
860		856
861	if (ANHE_at (he) <= minat)	857	if (ANHE_at (he) <= minat)
862	break;	858	break;
863		859
		860	heap [k] = *minpos;
864	ev_active (ANHE_w (*minpos)) = k;	861	ev_active (ANHE_w (*minpos)) = k;
865	heap [k] = *minpos;
866		862
867	k = minpos - heap;	863	k = minpos - heap;
868	}	864	}
869		865
		866	heap [k] = he;
870	ev_active (ANHE_w (he)) = k;	867	ev_active (ANHE_w (he)) = k;
871	heap [k] = he;
872	}	868	}
873		869
874	#else // 4HEAP	870	#else /* 4HEAP */
875		871
876	#define HEAP0 1	872	#define HEAP0 1
877		873	#define HPARENT(k) ((k) >> 1)
878	/* towards the root */	874	#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		875
901	/* away from the root */	876	/* away from the root */
902	void inline_speed	877	void inline_speed
903	downheap (ANHE *heap, int N, int k)	878	downheap (ANHE *heap, int N, int k)
904	{	879	{
…		…
906		881
907	for (;;)	882	for (;;)
908	{	883	{
909	int c = k << 1;	884	int c = k << 1;
910		885
911	if (c > N)	886	if (c > N + HEAP0 - 1)
912	break;	887	break;
913		888
914	c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])	889	c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
915	? 1 : 0;	890	? 1 : 0;
916		891
917	if (ANHE_at (he) <= ANHE_at (heap [c]))	892	if (ANHE_at (he) <= ANHE_at (heap [c]))
918	break;	893	break;
919		894
…		…
926	heap [k] = he;	901	heap [k] = he;
927	ev_active (ANHE_w (he)) = k;	902	ev_active (ANHE_w (he)) = k;
928	}	903	}
929	#endif	904	#endif
930		905
		906	/* towards the root */
		907	void inline_speed
		908	upheap (ANHE *heap, int k)
		909	{
		910	ANHE he = heap [k];
		911
		912	for (;;)
		913	{
		914	int p = HPARENT (k);
		915
		916	if (UPHEAP_DONE (p, k) \|\| ANHE_at (heap [p]) <= ANHE_at (he))
		917	break;
		918
		919	heap [k] = heap [p];
		920	ev_active (ANHE_w (heap [k])) = k;
		921	k = p;
		922	}
		923
		924	heap [k] = he;
		925	ev_active (ANHE_w (he)) = k;
		926	}
		927
931	void inline_size	928	void inline_size
932	adjustheap (ANHE *heap, int N, int k)	929	adjustheap (ANHE *heap, int N, int k)
933	{	930	{
		931	if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
934	upheap (heap, k);	932	upheap (heap, k);
		933	else
935	downheap (heap, N, k);	934	downheap (heap, N, k);
		935	}
		936
		937	/* rebuild the heap: this function is used only once and executed rarely */
		938	void inline_size
		939	reheap (ANHE *heap, int N)
		940	{
		941	int i;
		942
		943	/* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
		944	/* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
		945	for (i = 0; i < N; ++i)
		946	upheap (heap, i + HEAP0);
936	}	947	}
937		948
938	/*****************************************************************************/	949	/*****************************************************************************/
939		950
940	typedef struct	951	typedef struct
…		…
1458		1469
1459	postfork = 0;	1470	postfork = 0;
1460	}	1471	}
1461		1472
1462	#if EV_MULTIPLICITY	1473	#if EV_MULTIPLICITY
		1474
1463	struct ev_loop *	1475	struct ev_loop *
1464	ev_loop_new (unsigned int flags)	1476	ev_loop_new (unsigned int flags)
1465	{	1477	{
1466	struct ev_loop loop = (struct ev_loop )ev_malloc (sizeof (struct ev_loop));	1478	struct ev_loop loop = (struct ev_loop )ev_malloc (sizeof (struct ev_loop));
1467		1479
…		…
1485	void	1497	void
1486	ev_loop_fork (EV_P)	1498	ev_loop_fork (EV_P)
1487	{	1499	{
1488	postfork = 1; /* must be in line with ev_default_fork */	1500	postfork = 1; /* must be in line with ev_default_fork */
1489	}	1501	}
		1502
		1503	#if EV_VERIFY
		1504	void noinline
		1505	verify_watcher (EV_P_ W w)
		1506	{
		1507	assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI));
		1508
		1509	if (w->pending)
		1510	assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w));
		1511	}
		1512
		1513	static void noinline
		1514	verify_heap (EV_P_ ANHE *heap, int N)
		1515	{
		1516	int i;
		1517
		1518	for (i = HEAP0; i < N + HEAP0; ++i)
		1519	{
		1520	assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
		1521	assert (("heap condition violated", i == HEAP0 \|\| ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
		1522	assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
		1523
		1524	verify_watcher (EV_A_ (W)ANHE_w (heap [i]));
		1525	}
		1526	}
		1527
		1528	static void noinline
		1529	array_verify (EV_P_ W *ws, int cnt)
		1530	{
		1531	while (cnt--)
		1532	{
		1533	assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
		1534	verify_watcher (EV_A_ ws [cnt]);
		1535	}
		1536	}
		1537	#endif
		1538
		1539	void
		1540	ev_loop_verify (EV_P)
		1541	{
		1542	#if EV_VERIFY
		1543	int i;
		1544	WL w;
		1545
		1546	assert (activecnt >= -1);
		1547
		1548	assert (fdchangemax >= fdchangecnt);
		1549	for (i = 0; i < fdchangecnt; ++i)
		1550	assert (("negative fd in fdchanges", fdchanges [i] >= 0));
		1551
		1552	assert (anfdmax >= 0);
		1553	for (i = 0; i < anfdmax; ++i)
		1554	for (w = anfds [i].head; w; w = w->next)
		1555	{
		1556	verify_watcher (EV_A_ (W)w);
		1557	assert (("inactive fd watcher on anfd list", ev_active (w) == 1));
		1558	assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i));
		1559	}
		1560
		1561	assert (timermax >= timercnt);
		1562	verify_heap (EV_A_ timers, timercnt);
		1563
		1564	#if EV_PERIODIC_ENABLE
		1565	assert (periodicmax >= periodiccnt);
		1566	verify_heap (EV_A_ periodics, periodiccnt);
		1567	#endif
		1568
		1569	for (i = NUMPRI; i--; )
		1570	{
		1571	assert (pendingmax [i] >= pendingcnt [i]);
		1572	#if EV_IDLE_ENABLE
		1573	assert (idleall >= 0);
		1574	assert (idlemax [i] >= idlecnt [i]);
		1575	array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
		1576	#endif
		1577	}
		1578
		1579	#if EV_FORK_ENABLE
		1580	assert (forkmax >= forkcnt);
		1581	array_verify (EV_A_ (W *)forks, forkcnt);
		1582	#endif
		1583
		1584	#if EV_ASYNC_ENABLE
		1585	assert (asyncmax >= asynccnt);
		1586	array_verify (EV_A_ (W *)asyncs, asynccnt);
		1587	#endif
		1588
		1589	assert (preparemax >= preparecnt);
		1590	array_verify (EV_A_ (W *)prepares, preparecnt);
		1591
		1592	assert (checkmax >= checkcnt);
		1593	array_verify (EV_A_ (W *)checks, checkcnt);
		1594
		1595	# if 0
		1596	for (w = (ev_child )childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child )((WL)w)->next)
		1597	for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1490	#endif	1598	# endif
		1599	#endif
		1600	}
		1601
		1602	#endif /* multiplicity */
1491		1603
1492	#if EV_MULTIPLICITY	1604	#if EV_MULTIPLICITY
1493	struct ev_loop *	1605	struct ev_loop *
1494	ev_default_loop_init (unsigned int flags)	1606	ev_default_loop_init (unsigned int flags)
1495	#else	1607	#else
…		…
1571	{	1683	{
1572	/assert (("non-pending watcher on pending list", p->w->pending));/	1684	/assert (("non-pending watcher on pending list", p->w->pending));/
1573		1685
1574	p->w->pending = 0;	1686	p->w->pending = 0;
1575	EV_CB_INVOKE (p->w, p->events);	1687	EV_CB_INVOKE (p->w, p->events);
		1688	EV_FREQUENT_CHECK;
1576	}	1689	}
1577	}	1690	}
1578	}	1691	}
1579		1692
1580	#if EV_IDLE_ENABLE	1693	#if EV_IDLE_ENABLE
…		…
1601	#endif	1714	#endif
1602		1715
1603	void inline_size	1716	void inline_size
1604	timers_reify (EV_P)	1717	timers_reify (EV_P)
1605	{	1718	{
		1719	EV_FREQUENT_CHECK;
		1720
1606	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)	1721	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1607	{	1722	{
1608	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);	1723	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);
1609		1724
1610	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/	1725	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/
…		…
1616	if (ev_at (w) < mn_now)	1731	if (ev_at (w) < mn_now)
1617	ev_at (w) = mn_now;	1732	ev_at (w) = mn_now;
1618		1733
1619	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));	1734	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1620		1735
1621	ANHE_at_set (timers [HEAP0]);	1736	ANHE_at_cache (timers [HEAP0]);
1622	downheap (timers, timercnt, HEAP0);	1737	downheap (timers, timercnt, HEAP0);
1623	}	1738	}
1624	else	1739	else
1625	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */	1740	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1626		1741
		1742	EV_FREQUENT_CHECK;
1627	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);	1743	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1628	}	1744	}
1629	}	1745	}
1630		1746
1631	#if EV_PERIODIC_ENABLE	1747	#if EV_PERIODIC_ENABLE
1632	void inline_size	1748	void inline_size
1633	periodics_reify (EV_P)	1749	periodics_reify (EV_P)
1634	{	1750	{
		1751	EV_FREQUENT_CHECK;
		1752
1635	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)	1753	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1636	{	1754	{
1637	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);	1755	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);
1638		1756
1639	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/	1757	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/
…		…
1643	{	1761	{
1644	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1762	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1645		1763
1646	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));	1764	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1647		1765
1648	ANHE_at_set (periodics [HEAP0]);	1766	ANHE_at_cache (periodics [HEAP0]);
1649	downheap (periodics, periodiccnt, HEAP0);	1767	downheap (periodics, periodiccnt, HEAP0);
1650	}	1768	}
1651	else if (w->interval)	1769	else if (w->interval)
1652	{	1770	{
1653	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1771	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
…		…
1662	/* has effectively asked to get triggered more often than possible */	1780	/* has effectively asked to get triggered more often than possible */
1663	if (ev_at (w) < ev_rt_now)	1781	if (ev_at (w) < ev_rt_now)
1664	ev_at (w) = ev_rt_now;	1782	ev_at (w) = ev_rt_now;
1665	}	1783	}
1666		1784
1667	ANHE_at_set (periodics [HEAP0]);	1785	ANHE_at_cache (periodics [HEAP0]);
1668	downheap (periodics, periodiccnt, HEAP0);	1786	downheap (periodics, periodiccnt, HEAP0);
1669	}	1787	}
1670	else	1788	else
1671	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */	1789	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1672		1790
		1791	EV_FREQUENT_CHECK;
1673	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);	1792	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1674	}	1793	}
1675	}	1794	}
1676		1795
1677	static void noinline	1796	static void noinline
…		…
1687	if (w->reschedule_cb)	1806	if (w->reschedule_cb)
1688	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1807	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1689	else if (w->interval)	1808	else if (w->interval)
1690	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1809	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1691		1810
1692	ANHE_at_set (periodics [i]);	1811	ANHE_at_cache (periodics [i]);
1693	}	1812	}
1694		1813
1695	/* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */	1814	reheap (periodics, periodiccnt);
1696	/* also, this is easy and corretc for both 2-heaps and 4-heaps */
1697	for (i = 0; i < periodiccnt; ++i)
1698	upheap (periodics, i + HEAP0);
1699	}	1815	}
1700	#endif	1816	#endif
1701		1817
1702	void inline_speed	1818	void inline_speed
1703	time_update (EV_P_ ev_tstamp max_block)	1819	time_update (EV_P_ ev_tstamp max_block)
…		…
1761	/* adjust timers. this is easy, as the offset is the same for all of them */	1877	/* adjust timers. this is easy, as the offset is the same for all of them */
1762	for (i = 0; i < timercnt; ++i)	1878	for (i = 0; i < timercnt; ++i)
1763	{	1879	{
1764	ANHE *he = timers + i + HEAP0;	1880	ANHE *he = timers + i + HEAP0;
1765	ANHE_w (*he)->at += ev_rt_now - mn_now;	1881	ANHE_w (*he)->at += ev_rt_now - mn_now;
1766	ANHE_at_set (*he);	1882	ANHE_at_cache (*he);
1767	}	1883	}
1768	}	1884	}
1769		1885
1770	mn_now = ev_rt_now;	1886	mn_now = ev_rt_now;
1771	}	1887	}
…		…
1792		1908
1793	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */	1909	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1794		1910
1795	do	1911	do
1796	{	1912	{
		1913	#if EV_VERIFY >= 2
		1914	ev_loop_verify (EV_A);
		1915	#endif
		1916
1797	#ifndef _WIN32	1917	#ifndef _WIN32
1798	if (expect_false (curpid)) /* penalise the forking check even more */	1918	if (expect_false (curpid)) /* penalise the forking check even more */
1799	if (expect_false (getpid () != curpid))	1919	if (expect_false (getpid () != curpid))
1800	{	1920	{
1801	curpid = getpid ();	1921	curpid = getpid ();
…		…
1996	if (expect_false (ev_is_active (w)))	2116	if (expect_false (ev_is_active (w)))
1997	return;	2117	return;
1998		2118
1999	assert (("ev_io_start called with negative fd", fd >= 0));	2119	assert (("ev_io_start called with negative fd", fd >= 0));
2000		2120
		2121	EV_FREQUENT_CHECK;
		2122
2001	ev_start (EV_A_ (W)w, 1);	2123	ev_start (EV_A_ (W)w, 1);
2002	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);	2124	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
2003	wlist_add (&anfds[fd].head, (WL)w);	2125	wlist_add (&anfds[fd].head, (WL)w);
2004		2126
2005	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);	2127	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);
2006	w->events &= ~EV_IOFDSET;	2128	w->events &= ~EV_IOFDSET;
		2129
		2130	EV_FREQUENT_CHECK;
2007	}	2131	}
2008		2132
2009	void noinline	2133	void noinline
2010	ev_io_stop (EV_P_ ev_io *w)	2134	ev_io_stop (EV_P_ ev_io *w)
2011	{	2135	{
…		…
2013	if (expect_false (!ev_is_active (w)))	2137	if (expect_false (!ev_is_active (w)))
2014	return;	2138	return;
2015		2139
2016	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));	2140	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2017		2141
		2142	EV_FREQUENT_CHECK;
		2143
2018	wlist_del (&anfds[w->fd].head, (WL)w);	2144	wlist_del (&anfds[w->fd].head, (WL)w);
2019	ev_stop (EV_A_ (W)w);	2145	ev_stop (EV_A_ (W)w);
2020		2146
2021	fd_change (EV_A_ w->fd, 1);	2147	fd_change (EV_A_ w->fd, 1);
		2148
		2149	EV_FREQUENT_CHECK;
2022	}	2150	}
2023		2151
2024	void noinline	2152	void noinline
2025	ev_timer_start (EV_P_ ev_timer *w)	2153	ev_timer_start (EV_P_ ev_timer *w)
2026	{	2154	{
…		…
2029		2157
2030	ev_at (w) += mn_now;	2158	ev_at (w) += mn_now;
2031		2159
2032	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));	2160	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2033		2161
		2162	EV_FREQUENT_CHECK;
		2163
		2164	++timercnt;
2034	ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);	2165	ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2035	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);	2166	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2036	ANHE_w (timers [ev_active (w)]) = (WT)w;	2167	ANHE_w (timers [ev_active (w)]) = (WT)w;
2037	ANHE_at_set (timers [ev_active (w)]);	2168	ANHE_at_cache (timers [ev_active (w)]);
2038	upheap (timers, ev_active (w));	2169	upheap (timers, ev_active (w));
		2170
		2171	EV_FREQUENT_CHECK;
2039		2172
2040	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/	2173	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/
2041	}	2174	}
2042		2175
2043	void noinline	2176	void noinline
…		…
2045	{	2178	{
2046	clear_pending (EV_A_ (W)w);	2179	clear_pending (EV_A_ (W)w);
2047	if (expect_false (!ev_is_active (w)))	2180	if (expect_false (!ev_is_active (w)))
2048	return;	2181	return;
2049		2182
		2183	EV_FREQUENT_CHECK;
		2184
2050	{	2185	{
2051	int active = ev_active (w);	2186	int active = ev_active (w);
2052		2187
2053	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));	2188	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2054		2189
		2190	--timercnt;
		2191
2055	if (expect_true (active < timercnt + HEAP0 - 1))	2192	if (expect_true (active < timercnt + HEAP0))
2056	{	2193	{
2057	timers [active] = timers [timercnt + HEAP0 - 1];	2194	timers [active] = timers [timercnt + HEAP0];
2058	adjustheap (timers, timercnt, active);	2195	adjustheap (timers, timercnt, active);
2059	}	2196	}
2060
2061	--timercnt;
2062	}	2197	}
		2198
		2199	EV_FREQUENT_CHECK;
2063		2200
2064	ev_at (w) -= mn_now;	2201	ev_at (w) -= mn_now;
2065		2202
2066	ev_stop (EV_A_ (W)w);	2203	ev_stop (EV_A_ (W)w);
2067	}	2204	}
2068		2205
2069	void noinline	2206	void noinline
2070	ev_timer_again (EV_P_ ev_timer *w)	2207	ev_timer_again (EV_P_ ev_timer *w)
2071	{	2208	{
		2209	EV_FREQUENT_CHECK;
		2210
2072	if (ev_is_active (w))	2211	if (ev_is_active (w))
2073	{	2212	{
2074	if (w->repeat)	2213	if (w->repeat)
2075	{	2214	{
2076	ev_at (w) = mn_now + w->repeat;	2215	ev_at (w) = mn_now + w->repeat;
2077	ANHE_at_set (timers [ev_active (w)]);	2216	ANHE_at_cache (timers [ev_active (w)]);
2078	adjustheap (timers, timercnt, ev_active (w));	2217	adjustheap (timers, timercnt, ev_active (w));
2079	}	2218	}
2080	else	2219	else
2081	ev_timer_stop (EV_A_ w);	2220	ev_timer_stop (EV_A_ w);
2082	}	2221	}
2083	else if (w->repeat)	2222	else if (w->repeat)
2084	{	2223	{
2085	ev_at (w) = w->repeat;	2224	ev_at (w) = w->repeat;
2086	ev_timer_start (EV_A_ w);	2225	ev_timer_start (EV_A_ w);
2087	}	2226	}
		2227
		2228	EV_FREQUENT_CHECK;
2088	}	2229	}
2089		2230
2090	#if EV_PERIODIC_ENABLE	2231	#if EV_PERIODIC_ENABLE
2091	void noinline	2232	void noinline
2092	ev_periodic_start (EV_P_ ev_periodic *w)	2233	ev_periodic_start (EV_P_ ev_periodic *w)
…		…
2103	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	2244	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2104	}	2245	}
2105	else	2246	else
2106	ev_at (w) = w->offset;	2247	ev_at (w) = w->offset;
2107		2248
		2249	EV_FREQUENT_CHECK;
		2250
		2251	++periodiccnt;
2108	ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);	2252	ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2109	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);	2253	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2110	ANHE_w (periodics [ev_active (w)]) = (WT)w;	2254	ANHE_w (periodics [ev_active (w)]) = (WT)w;
2111	ANHE_at_set (periodics [ev_active (w)]);	2255	ANHE_at_cache (periodics [ev_active (w)]);
2112	upheap (periodics, ev_active (w));	2256	upheap (periodics, ev_active (w));
		2257
		2258	EV_FREQUENT_CHECK;
2113		2259
2114	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/	2260	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/
2115	}	2261	}
2116		2262
2117	void noinline	2263	void noinline
…		…
2119	{	2265	{
2120	clear_pending (EV_A_ (W)w);	2266	clear_pending (EV_A_ (W)w);
2121	if (expect_false (!ev_is_active (w)))	2267	if (expect_false (!ev_is_active (w)))
2122	return;	2268	return;
2123		2269
		2270	EV_FREQUENT_CHECK;
		2271
2124	{	2272	{
2125	int active = ev_active (w);	2273	int active = ev_active (w);
2126		2274
2127	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));	2275	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2128		2276
		2277	--periodiccnt;
		2278
2129	if (expect_true (active < periodiccnt + HEAP0 - 1))	2279	if (expect_true (active < periodiccnt + HEAP0))
2130	{	2280	{
2131	periodics [active] = periodics [periodiccnt + HEAP0 - 1];	2281	periodics [active] = periodics [periodiccnt + HEAP0];
2132	adjustheap (periodics, periodiccnt, active);	2282	adjustheap (periodics, periodiccnt, active);
2133	}	2283	}
2134
2135	--periodiccnt;
2136	}	2284	}
		2285
		2286	EV_FREQUENT_CHECK;
2137		2287
2138	ev_stop (EV_A_ (W)w);	2288	ev_stop (EV_A_ (W)w);
2139	}	2289	}
2140		2290
2141	void noinline	2291	void noinline
…		…
2161	return;	2311	return;
2162		2312
2163	assert (("ev_signal_start called with illegal signal number", w->signum > 0));	2313	assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2164		2314
2165	evpipe_init (EV_A);	2315	evpipe_init (EV_A);
		2316
		2317	EV_FREQUENT_CHECK;
2166		2318
2167	{	2319	{
2168	#ifndef _WIN32	2320	#ifndef _WIN32
2169	sigset_t full, prev;	2321	sigset_t full, prev;
2170	sigfillset (&full);	2322	sigfillset (&full);
…		…
2191	sigfillset (&sa.sa_mask);	2343	sigfillset (&sa.sa_mask);
2192	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */	2344	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2193	sigaction (w->signum, &sa, 0);	2345	sigaction (w->signum, &sa, 0);
2194	#endif	2346	#endif
2195	}	2347	}
		2348
		2349	EV_FREQUENT_CHECK;
2196	}	2350	}
2197		2351
2198	void noinline	2352	void noinline
2199	ev_signal_stop (EV_P_ ev_signal *w)	2353	ev_signal_stop (EV_P_ ev_signal *w)
2200	{	2354	{
2201	clear_pending (EV_A_ (W)w);	2355	clear_pending (EV_A_ (W)w);
2202	if (expect_false (!ev_is_active (w)))	2356	if (expect_false (!ev_is_active (w)))
2203	return;	2357	return;
2204		2358
		2359	EV_FREQUENT_CHECK;
		2360
2205	wlist_del (&signals [w->signum - 1].head, (WL)w);	2361	wlist_del (&signals [w->signum - 1].head, (WL)w);
2206	ev_stop (EV_A_ (W)w);	2362	ev_stop (EV_A_ (W)w);
2207		2363
2208	if (!signals [w->signum - 1].head)	2364	if (!signals [w->signum - 1].head)
2209	signal (w->signum, SIG_DFL);	2365	signal (w->signum, SIG_DFL);
		2366
		2367	EV_FREQUENT_CHECK;
2210	}	2368	}
2211		2369
2212	void	2370	void
2213	ev_child_start (EV_P_ ev_child *w)	2371	ev_child_start (EV_P_ ev_child *w)
2214	{	2372	{
…		…
2216	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));	2374	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2217	#endif	2375	#endif
2218	if (expect_false (ev_is_active (w)))	2376	if (expect_false (ev_is_active (w)))
2219	return;	2377	return;
2220		2378
		2379	EV_FREQUENT_CHECK;
		2380
2221	ev_start (EV_A_ (W)w, 1);	2381	ev_start (EV_A_ (W)w, 1);
2222	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2382	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
		2383
		2384	EV_FREQUENT_CHECK;
2223	}	2385	}
2224		2386
2225	void	2387	void
2226	ev_child_stop (EV_P_ ev_child *w)	2388	ev_child_stop (EV_P_ ev_child *w)
2227	{	2389	{
2228	clear_pending (EV_A_ (W)w);	2390	clear_pending (EV_A_ (W)w);
2229	if (expect_false (!ev_is_active (w)))	2391	if (expect_false (!ev_is_active (w)))
2230	return;	2392	return;
2231		2393
		2394	EV_FREQUENT_CHECK;
		2395
2232	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2396	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2233	ev_stop (EV_A_ (W)w);	2397	ev_stop (EV_A_ (W)w);
		2398
		2399	EV_FREQUENT_CHECK;
2234	}	2400	}
2235		2401
2236	#if EV_STAT_ENABLE	2402	#if EV_STAT_ENABLE
2237		2403
2238	# ifdef _WIN32	2404	# ifdef _WIN32
…		…
2466	else	2632	else
2467	#endif	2633	#endif
2468	ev_timer_start (EV_A_ &w->timer);	2634	ev_timer_start (EV_A_ &w->timer);
2469		2635
2470	ev_start (EV_A_ (W)w, 1);	2636	ev_start (EV_A_ (W)w, 1);
		2637
		2638	EV_FREQUENT_CHECK;
2471	}	2639	}
2472		2640
2473	void	2641	void
2474	ev_stat_stop (EV_P_ ev_stat *w)	2642	ev_stat_stop (EV_P_ ev_stat *w)
2475	{	2643	{
2476	clear_pending (EV_A_ (W)w);	2644	clear_pending (EV_A_ (W)w);
2477	if (expect_false (!ev_is_active (w)))	2645	if (expect_false (!ev_is_active (w)))
2478	return;	2646	return;
2479		2647
		2648	EV_FREQUENT_CHECK;
		2649
2480	#if EV_USE_INOTIFY	2650	#if EV_USE_INOTIFY
2481	infy_del (EV_A_ w);	2651	infy_del (EV_A_ w);
2482	#endif	2652	#endif
2483	ev_timer_stop (EV_A_ &w->timer);	2653	ev_timer_stop (EV_A_ &w->timer);
2484		2654
2485	ev_stop (EV_A_ (W)w);	2655	ev_stop (EV_A_ (W)w);
		2656
		2657	EV_FREQUENT_CHECK;
2486	}	2658	}
2487	#endif	2659	#endif
2488		2660
2489	#if EV_IDLE_ENABLE	2661	#if EV_IDLE_ENABLE
2490	void	2662	void
…		…
2492	{	2664	{
2493	if (expect_false (ev_is_active (w)))	2665	if (expect_false (ev_is_active (w)))
2494	return;	2666	return;
2495		2667
2496	pri_adjust (EV_A_ (W)w);	2668	pri_adjust (EV_A_ (W)w);
		2669
		2670	EV_FREQUENT_CHECK;
2497		2671
2498	{	2672	{
2499	int active = ++idlecnt [ABSPRI (w)];	2673	int active = ++idlecnt [ABSPRI (w)];
2500		2674
2501	++idleall;	2675	++idleall;
2502	ev_start (EV_A_ (W)w, active);	2676	ev_start (EV_A_ (W)w, active);
2503		2677
2504	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);	2678	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2505	idles [ABSPRI (w)][active - 1] = w;	2679	idles [ABSPRI (w)][active - 1] = w;
2506	}	2680	}
		2681
		2682	EV_FREQUENT_CHECK;
2507	}	2683	}
2508		2684
2509	void	2685	void
2510	ev_idle_stop (EV_P_ ev_idle *w)	2686	ev_idle_stop (EV_P_ ev_idle *w)
2511	{	2687	{
2512	clear_pending (EV_A_ (W)w);	2688	clear_pending (EV_A_ (W)w);
2513	if (expect_false (!ev_is_active (w)))	2689	if (expect_false (!ev_is_active (w)))
2514	return;	2690	return;
2515		2691
		2692	EV_FREQUENT_CHECK;
		2693
2516	{	2694	{
2517	int active = ev_active (w);	2695	int active = ev_active (w);
2518		2696
2519	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];	2697	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2520	ev_active (idles [ABSPRI (w)][active - 1]) = active;	2698	ev_active (idles [ABSPRI (w)][active - 1]) = active;
2521		2699
2522	ev_stop (EV_A_ (W)w);	2700	ev_stop (EV_A_ (W)w);
2523	--idleall;	2701	--idleall;
2524	}	2702	}
		2703
		2704	EV_FREQUENT_CHECK;
2525	}	2705	}
2526	#endif	2706	#endif
2527		2707
2528	void	2708	void
2529	ev_prepare_start (EV_P_ ev_prepare *w)	2709	ev_prepare_start (EV_P_ ev_prepare *w)
2530	{	2710	{
2531	if (expect_false (ev_is_active (w)))	2711	if (expect_false (ev_is_active (w)))
2532	return;	2712	return;
		2713
		2714	EV_FREQUENT_CHECK;
2533		2715
2534	ev_start (EV_A_ (W)w, ++preparecnt);	2716	ev_start (EV_A_ (W)w, ++preparecnt);
2535	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);	2717	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2536	prepares [preparecnt - 1] = w;	2718	prepares [preparecnt - 1] = w;
		2719
		2720	EV_FREQUENT_CHECK;
2537	}	2721	}
2538		2722
2539	void	2723	void
2540	ev_prepare_stop (EV_P_ ev_prepare *w)	2724	ev_prepare_stop (EV_P_ ev_prepare *w)
2541	{	2725	{
2542	clear_pending (EV_A_ (W)w);	2726	clear_pending (EV_A_ (W)w);
2543	if (expect_false (!ev_is_active (w)))	2727	if (expect_false (!ev_is_active (w)))
2544	return;	2728	return;
2545		2729
		2730	EV_FREQUENT_CHECK;
		2731
2546	{	2732	{
2547	int active = ev_active (w);	2733	int active = ev_active (w);
2548		2734
2549	prepares [active - 1] = prepares [--preparecnt];	2735	prepares [active - 1] = prepares [--preparecnt];
2550	ev_active (prepares [active - 1]) = active;	2736	ev_active (prepares [active - 1]) = active;
2551	}	2737	}
2552		2738
2553	ev_stop (EV_A_ (W)w);	2739	ev_stop (EV_A_ (W)w);
		2740
		2741	EV_FREQUENT_CHECK;
2554	}	2742	}
2555		2743
2556	void	2744	void
2557	ev_check_start (EV_P_ ev_check *w)	2745	ev_check_start (EV_P_ ev_check *w)
2558	{	2746	{
2559	if (expect_false (ev_is_active (w)))	2747	if (expect_false (ev_is_active (w)))
2560	return;	2748	return;
		2749
		2750	EV_FREQUENT_CHECK;
2561		2751
2562	ev_start (EV_A_ (W)w, ++checkcnt);	2752	ev_start (EV_A_ (W)w, ++checkcnt);
2563	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);	2753	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2564	checks [checkcnt - 1] = w;	2754	checks [checkcnt - 1] = w;
		2755
		2756	EV_FREQUENT_CHECK;
2565	}	2757	}
2566		2758
2567	void	2759	void
2568	ev_check_stop (EV_P_ ev_check *w)	2760	ev_check_stop (EV_P_ ev_check *w)
2569	{	2761	{
2570	clear_pending (EV_A_ (W)w);	2762	clear_pending (EV_A_ (W)w);
2571	if (expect_false (!ev_is_active (w)))	2763	if (expect_false (!ev_is_active (w)))
2572	return;	2764	return;
2573		2765
		2766	EV_FREQUENT_CHECK;
		2767
2574	{	2768	{
2575	int active = ev_active (w);	2769	int active = ev_active (w);
2576		2770
2577	checks [active - 1] = checks [--checkcnt];	2771	checks [active - 1] = checks [--checkcnt];
2578	ev_active (checks [active - 1]) = active;	2772	ev_active (checks [active - 1]) = active;
2579	}	2773	}
2580		2774
2581	ev_stop (EV_A_ (W)w);	2775	ev_stop (EV_A_ (W)w);
		2776
		2777	EV_FREQUENT_CHECK;
2582	}	2778	}
2583		2779
2584	#if EV_EMBED_ENABLE	2780	#if EV_EMBED_ENABLE
2585	void noinline	2781	void noinline
2586	ev_embed_sweep (EV_P_ ev_embed *w)	2782	ev_embed_sweep (EV_P_ ev_embed *w)
…		…
2633	struct ev_loop *loop = w->other;	2829	struct ev_loop *loop = w->other;
2634	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));	2830	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2635	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);	2831	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2636	}	2832	}
2637		2833
		2834	EV_FREQUENT_CHECK;
		2835
2638	ev_set_priority (&w->io, ev_priority (w));	2836	ev_set_priority (&w->io, ev_priority (w));
2639	ev_io_start (EV_A_ &w->io);	2837	ev_io_start (EV_A_ &w->io);
2640		2838
2641	ev_prepare_init (&w->prepare, embed_prepare_cb);	2839	ev_prepare_init (&w->prepare, embed_prepare_cb);
2642	ev_set_priority (&w->prepare, EV_MINPRI);	2840	ev_set_priority (&w->prepare, EV_MINPRI);
2643	ev_prepare_start (EV_A_ &w->prepare);	2841	ev_prepare_start (EV_A_ &w->prepare);
2644		2842
2645	/ev_idle_init (&w->idle, e,bed_idle_cb);/	2843	/ev_idle_init (&w->idle, e,bed_idle_cb);/
2646		2844
2647	ev_start (EV_A_ (W)w, 1);	2845	ev_start (EV_A_ (W)w, 1);
		2846
		2847	EV_FREQUENT_CHECK;
2648	}	2848	}
2649		2849
2650	void	2850	void
2651	ev_embed_stop (EV_P_ ev_embed *w)	2851	ev_embed_stop (EV_P_ ev_embed *w)
2652	{	2852	{
2653	clear_pending (EV_A_ (W)w);	2853	clear_pending (EV_A_ (W)w);
2654	if (expect_false (!ev_is_active (w)))	2854	if (expect_false (!ev_is_active (w)))
2655	return;	2855	return;
2656		2856
		2857	EV_FREQUENT_CHECK;
		2858
2657	ev_io_stop (EV_A_ &w->io);	2859	ev_io_stop (EV_A_ &w->io);
2658	ev_prepare_stop (EV_A_ &w->prepare);	2860	ev_prepare_stop (EV_A_ &w->prepare);
2659		2861
2660	ev_stop (EV_A_ (W)w);	2862	ev_stop (EV_A_ (W)w);
		2863
		2864	EV_FREQUENT_CHECK;
2661	}	2865	}
2662	#endif	2866	#endif
2663		2867
2664	#if EV_FORK_ENABLE	2868	#if EV_FORK_ENABLE
2665	void	2869	void
2666	ev_fork_start (EV_P_ ev_fork *w)	2870	ev_fork_start (EV_P_ ev_fork *w)
2667	{	2871	{
2668	if (expect_false (ev_is_active (w)))	2872	if (expect_false (ev_is_active (w)))
2669	return;	2873	return;
		2874
		2875	EV_FREQUENT_CHECK;
2670		2876
2671	ev_start (EV_A_ (W)w, ++forkcnt);	2877	ev_start (EV_A_ (W)w, ++forkcnt);
2672	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);	2878	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2673	forks [forkcnt - 1] = w;	2879	forks [forkcnt - 1] = w;
		2880
		2881	EV_FREQUENT_CHECK;
2674	}	2882	}
2675		2883
2676	void	2884	void
2677	ev_fork_stop (EV_P_ ev_fork *w)	2885	ev_fork_stop (EV_P_ ev_fork *w)
2678	{	2886	{
2679	clear_pending (EV_A_ (W)w);	2887	clear_pending (EV_A_ (W)w);
2680	if (expect_false (!ev_is_active (w)))	2888	if (expect_false (!ev_is_active (w)))
2681	return;	2889	return;
2682		2890
		2891	EV_FREQUENT_CHECK;
		2892
2683	{	2893	{
2684	int active = ev_active (w);	2894	int active = ev_active (w);
2685		2895
2686	forks [active - 1] = forks [--forkcnt];	2896	forks [active - 1] = forks [--forkcnt];
2687	ev_active (forks [active - 1]) = active;	2897	ev_active (forks [active - 1]) = active;
2688	}	2898	}
2689		2899
2690	ev_stop (EV_A_ (W)w);	2900	ev_stop (EV_A_ (W)w);
		2901
		2902	EV_FREQUENT_CHECK;
2691	}	2903	}
2692	#endif	2904	#endif
2693		2905
2694	#if EV_ASYNC_ENABLE	2906	#if EV_ASYNC_ENABLE
2695	void	2907	void
…		…
2697	{	2909	{
2698	if (expect_false (ev_is_active (w)))	2910	if (expect_false (ev_is_active (w)))
2699	return;	2911	return;
2700		2912
2701	evpipe_init (EV_A);	2913	evpipe_init (EV_A);
		2914
		2915	EV_FREQUENT_CHECK;
2702		2916
2703	ev_start (EV_A_ (W)w, ++asynccnt);	2917	ev_start (EV_A_ (W)w, ++asynccnt);
2704	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);	2918	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2705	asyncs [asynccnt - 1] = w;	2919	asyncs [asynccnt - 1] = w;
		2920
		2921	EV_FREQUENT_CHECK;
2706	}	2922	}
2707		2923
2708	void	2924	void
2709	ev_async_stop (EV_P_ ev_async *w)	2925	ev_async_stop (EV_P_ ev_async *w)
2710	{	2926	{
2711	clear_pending (EV_A_ (W)w);	2927	clear_pending (EV_A_ (W)w);
2712	if (expect_false (!ev_is_active (w)))	2928	if (expect_false (!ev_is_active (w)))
2713	return;	2929	return;
2714		2930
		2931	EV_FREQUENT_CHECK;
		2932
2715	{	2933	{
2716	int active = ev_active (w);	2934	int active = ev_active (w);
2717		2935
2718	asyncs [active - 1] = asyncs [--asynccnt];	2936	asyncs [active - 1] = asyncs [--asynccnt];
2719	ev_active (asyncs [active - 1]) = active;	2937	ev_active (asyncs [active - 1]) = active;
2720	}	2938	}
2721		2939
2722	ev_stop (EV_A_ (W)w);	2940	ev_stop (EV_A_ (W)w);
		2941
		2942	EV_FREQUENT_CHECK;
2723	}	2943	}
2724		2944
2725	void	2945	void
2726	ev_async_send (EV_P_ ev_async *w)	2946	ev_async_send (EV_P_ ev_async *w)
2727	{	2947	{

Diff Legend

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

Comparing libev/ev.c (file contents): Revision 1.246 by root, Wed May 21 12:51:38 2008 UTC vs. Revision 1.252 by root, Thu May 22 03:43:32 2008 UTC

Diff Legend

Comparing libev/ev.c (file contents):
Revision 1.246 by root, Wed May 21 12:51:38 2008 UTC vs.
Revision 1.252 by root, Thu May 22 03:43:32 2008 UTC