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

Comparing libev/ev.c (file contents):
Revision 1.243 by root, Fri May 9 15:52:13 2008 UTC vs.
Revision 1.251 by root, Thu May 22 03:42:34 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));
849	if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));	845	if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
850	}	846	}
851	else if (pos < E)	847	else if (pos < E)
852	{	848	{
853	/* slow path / (minpos = pos + 0), (minat = ANHE_at (minpos));	849	/* 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));	850	if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (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 (idlemax [i] >= idlecnt [i]);
		1574	array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
		1575	#endif
		1576	}
		1577
		1578	#if EV_FORK_ENABLE
		1579	assert (forkmax >= forkcnt);
		1580	array_verify (EV_A_ (W *)forks, forkcnt);
		1581	#endif
		1582
		1583	#if EV_ASYNC_ENABLE
		1584	assert (asyncmax >= asynccnt);
		1585	array_verify (EV_A_ (W *)asyncs, asynccnt);
		1586	#endif
		1587
		1588	assert (preparemax >= preparecnt);
		1589	array_verify (EV_A_ (W *)prepares, preparecnt);
		1590
		1591	assert (checkmax >= checkcnt);
		1592	array_verify (EV_A_ (W *)checks, checkcnt);
		1593
		1594	# if 0
		1595	for (w = (ev_child )childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child )((WL)w)->next)
		1596	for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1490	#endif	1597	# endif
		1598	#endif
		1599	}
		1600
		1601	#endif /* multiplicity */
1491		1602
1492	#if EV_MULTIPLICITY	1603	#if EV_MULTIPLICITY
1493	struct ev_loop *	1604	struct ev_loop *
1494	ev_default_loop_init (unsigned int flags)	1605	ev_default_loop_init (unsigned int flags)
1495	#else	1606	#else
…		…
1571	{	1682	{
1572	/assert (("non-pending watcher on pending list", p->w->pending));/	1683	/assert (("non-pending watcher on pending list", p->w->pending));/
1573		1684
1574	p->w->pending = 0;	1685	p->w->pending = 0;
1575	EV_CB_INVOKE (p->w, p->events);	1686	EV_CB_INVOKE (p->w, p->events);
		1687	EV_FREQUENT_CHECK;
1576	}	1688	}
1577	}	1689	}
1578	}	1690	}
1579		1691
1580	#if EV_IDLE_ENABLE	1692	#if EV_IDLE_ENABLE
…		…
1601	#endif	1713	#endif
1602		1714
1603	void inline_size	1715	void inline_size
1604	timers_reify (EV_P)	1716	timers_reify (EV_P)
1605	{	1717	{
		1718	EV_FREQUENT_CHECK;
		1719
1606	while (timercnt && ANHE_at (timers [HEAP0]) <= mn_now)	1720	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1607	{	1721	{
1608	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);	1722	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);
1609		1723
1610	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/	1724	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/
1611		1725
…		…
1616	if (ev_at (w) < mn_now)	1730	if (ev_at (w) < mn_now)
1617	ev_at (w) = mn_now;	1731	ev_at (w) = mn_now;
1618		1732
1619	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));	1733	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1620		1734
1621	ANHE_at_set (timers [HEAP0]);	1735	ANHE_at_cache (timers [HEAP0]);
1622	downheap (timers, timercnt, HEAP0);	1736	downheap (timers, timercnt, HEAP0);
1623	}	1737	}
1624	else	1738	else
1625	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */	1739	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1626		1740
		1741	EV_FREQUENT_CHECK;
1627	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);	1742	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1628	}	1743	}
1629	}	1744	}
1630		1745
1631	#if EV_PERIODIC_ENABLE	1746	#if EV_PERIODIC_ENABLE
1632	void inline_size	1747	void inline_size
1633	periodics_reify (EV_P)	1748	periodics_reify (EV_P)
1634	{	1749	{
		1750	EV_FREQUENT_CHECK;
		1751
1635	while (periodiccnt && ANHE_at (periodics [HEAP0]) <= ev_rt_now)	1752	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1636	{	1753	{
1637	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);	1754	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);
1638		1755
1639	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/	1756	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/
1640		1757
1641	/* first reschedule or stop timer */	1758	/* first reschedule or stop timer */
1642	if (w->reschedule_cb)	1759	if (w->reschedule_cb)
1643	{	1760	{
1644	ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);	1761	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1645		1762
1646	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));	1763	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1647		1764
1648	ANHE_at_set (periodics [HEAP0]);	1765	ANHE_at_cache (periodics [HEAP0]);
1649	downheap (periodics, periodiccnt, HEAP0);	1766	downheap (periodics, periodiccnt, HEAP0);
1650	}	1767	}
1651	else if (w->interval)	1768	else if (w->interval)
1652	{	1769	{
1653	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1770	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
		1771	/* if next trigger time is not sufficiently in the future, put it there */
		1772	/* this might happen because of floating point inexactness */
1654	if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;	1773	if (ev_at (w) - ev_rt_now < TIME_EPSILON)
		1774	{
		1775	ev_at (w) += w->interval;
1655		1776
1656	assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));	1777	/* if interval is unreasonably low we might still have a time in the past */
		1778	/* so correct this. this will make the periodic very inexact, but the user */
		1779	/* has effectively asked to get triggered more often than possible */
		1780	if (ev_at (w) < ev_rt_now)
		1781	ev_at (w) = ev_rt_now;
		1782	}
1657		1783
1658	ANHE_at_set (periodics [HEAP0]);	1784	ANHE_at_cache (periodics [HEAP0]);
1659	downheap (periodics, periodiccnt, HEAP0);	1785	downheap (periodics, periodiccnt, HEAP0);
1660	}	1786	}
1661	else	1787	else
1662	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */	1788	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1663		1789
		1790	EV_FREQUENT_CHECK;
1664	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);	1791	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1665	}	1792	}
1666	}	1793	}
1667		1794
1668	static void noinline	1795	static void noinline
…		…
1678	if (w->reschedule_cb)	1805	if (w->reschedule_cb)
1679	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1806	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1680	else if (w->interval)	1807	else if (w->interval)
1681	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1808	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1682		1809
1683	ANHE_at_set (periodics [i]);	1810	ANHE_at_cache (periodics [i]);
1684	}	1811	}
1685		1812
1686	/* we don't use floyds algorithm, uphead is simpler and is more cache-efficient */	1813	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	}	1814	}
1691	#endif	1815	#endif
1692		1816
1693	void inline_speed	1817	void inline_speed
1694	time_update (EV_P_ ev_tstamp max_block)	1818	time_update (EV_P_ ev_tstamp max_block)
…		…
1752	/* adjust timers. this is easy, as the offset is the same for all of them */	1876	/* adjust timers. this is easy, as the offset is the same for all of them */
1753	for (i = 0; i < timercnt; ++i)	1877	for (i = 0; i < timercnt; ++i)
1754	{	1878	{
1755	ANHE *he = timers + i + HEAP0;	1879	ANHE *he = timers + i + HEAP0;
1756	ANHE_w (*he)->at += ev_rt_now - mn_now;	1880	ANHE_w (*he)->at += ev_rt_now - mn_now;
1757	ANHE_at_set (*he);	1881	ANHE_at_cache (*he);
1758	}	1882	}
1759	}	1883	}
1760		1884
1761	mn_now = ev_rt_now;	1885	mn_now = ev_rt_now;
1762	}	1886	}
…		…
1783		1907
1784	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */	1908	call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1785		1909
1786	do	1910	do
1787	{	1911	{
		1912	#if EV_VERIFY >= 2
		1913	ev_loop_verify (EV_A);
		1914	#endif
		1915
1788	#ifndef _WIN32	1916	#ifndef _WIN32
1789	if (expect_false (curpid)) /* penalise the forking check even more */	1917	if (expect_false (curpid)) /* penalise the forking check even more */
1790	if (expect_false (getpid () != curpid))	1918	if (expect_false (getpid () != curpid))
1791	{	1919	{
1792	curpid = getpid ();	1920	curpid = getpid ();
…		…
1987	if (expect_false (ev_is_active (w)))	2115	if (expect_false (ev_is_active (w)))
1988	return;	2116	return;
1989		2117
1990	assert (("ev_io_start called with negative fd", fd >= 0));	2118	assert (("ev_io_start called with negative fd", fd >= 0));
1991		2119
		2120	EV_FREQUENT_CHECK;
		2121
1992	ev_start (EV_A_ (W)w, 1);	2122	ev_start (EV_A_ (W)w, 1);
1993	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);	2123	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1994	wlist_add (&anfds[fd].head, (WL)w);	2124	wlist_add (&anfds[fd].head, (WL)w);
1995		2125
1996	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);	2126	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);
1997	w->events &= ~EV_IOFDSET;	2127	w->events &= ~EV_IOFDSET;
		2128
		2129	EV_FREQUENT_CHECK;
1998	}	2130	}
1999		2131
2000	void noinline	2132	void noinline
2001	ev_io_stop (EV_P_ ev_io *w)	2133	ev_io_stop (EV_P_ ev_io *w)
2002	{	2134	{
…		…
2004	if (expect_false (!ev_is_active (w)))	2136	if (expect_false (!ev_is_active (w)))
2005	return;	2137	return;
2006		2138
2007	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));	2139	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2008		2140
		2141	EV_FREQUENT_CHECK;
		2142
2009	wlist_del (&anfds[w->fd].head, (WL)w);	2143	wlist_del (&anfds[w->fd].head, (WL)w);
2010	ev_stop (EV_A_ (W)w);	2144	ev_stop (EV_A_ (W)w);
2011		2145
2012	fd_change (EV_A_ w->fd, 1);	2146	fd_change (EV_A_ w->fd, 1);
		2147
		2148	EV_FREQUENT_CHECK;
2013	}	2149	}
2014		2150
2015	void noinline	2151	void noinline
2016	ev_timer_start (EV_P_ ev_timer *w)	2152	ev_timer_start (EV_P_ ev_timer *w)
2017	{	2153	{
…		…
2020		2156
2021	ev_at (w) += mn_now;	2157	ev_at (w) += mn_now;
2022		2158
2023	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));	2159	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2024		2160
		2161	EV_FREQUENT_CHECK;
		2162
		2163	++timercnt;
2025	ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);	2164	ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2026	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);	2165	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2027	ANHE_w (timers [ev_active (w)]) = (WT)w;	2166	ANHE_w (timers [ev_active (w)]) = (WT)w;
2028	ANHE_at_set (timers [ev_active (w)]);	2167	ANHE_at_cache (timers [ev_active (w)]);
2029	upheap (timers, ev_active (w));	2168	upheap (timers, ev_active (w));
		2169
		2170	EV_FREQUENT_CHECK;
2030		2171
2031	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/	2172	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/
2032	}	2173	}
2033		2174
2034	void noinline	2175	void noinline
…		…
2036	{	2177	{
2037	clear_pending (EV_A_ (W)w);	2178	clear_pending (EV_A_ (W)w);
2038	if (expect_false (!ev_is_active (w)))	2179	if (expect_false (!ev_is_active (w)))
2039	return;	2180	return;
2040		2181
		2182	EV_FREQUENT_CHECK;
		2183
2041	{	2184	{
2042	int active = ev_active (w);	2185	int active = ev_active (w);
2043		2186
2044	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));	2187	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2045		2188
		2189	--timercnt;
		2190
2046	if (expect_true (active < timercnt + HEAP0 - 1))	2191	if (expect_true (active < timercnt + HEAP0))
2047	{	2192	{
2048	timers [active] = timers [timercnt + HEAP0 - 1];	2193	timers [active] = timers [timercnt + HEAP0];
2049	adjustheap (timers, timercnt, active);	2194	adjustheap (timers, timercnt, active);
2050	}	2195	}
2051
2052	--timercnt;
2053	}	2196	}
		2197
		2198	EV_FREQUENT_CHECK;
2054		2199
2055	ev_at (w) -= mn_now;	2200	ev_at (w) -= mn_now;
2056		2201
2057	ev_stop (EV_A_ (W)w);	2202	ev_stop (EV_A_ (W)w);
2058	}	2203	}
2059		2204
2060	void noinline	2205	void noinline
2061	ev_timer_again (EV_P_ ev_timer *w)	2206	ev_timer_again (EV_P_ ev_timer *w)
2062	{	2207	{
		2208	EV_FREQUENT_CHECK;
		2209
2063	if (ev_is_active (w))	2210	if (ev_is_active (w))
2064	{	2211	{
2065	if (w->repeat)	2212	if (w->repeat)
2066	{	2213	{
2067	ev_at (w) = mn_now + w->repeat;	2214	ev_at (w) = mn_now + w->repeat;
2068	ANHE_at_set (timers [ev_active (w)]);	2215	ANHE_at_cache (timers [ev_active (w)]);
2069	adjustheap (timers, timercnt, ev_active (w));	2216	adjustheap (timers, timercnt, ev_active (w));
2070	}	2217	}
2071	else	2218	else
2072	ev_timer_stop (EV_A_ w);	2219	ev_timer_stop (EV_A_ w);
2073	}	2220	}
2074	else if (w->repeat)	2221	else if (w->repeat)
2075	{	2222	{
2076	ev_at (w) = w->repeat;	2223	ev_at (w) = w->repeat;
2077	ev_timer_start (EV_A_ w);	2224	ev_timer_start (EV_A_ w);
2078	}	2225	}
		2226
		2227	EV_FREQUENT_CHECK;
2079	}	2228	}
2080		2229
2081	#if EV_PERIODIC_ENABLE	2230	#if EV_PERIODIC_ENABLE
2082	void noinline	2231	void noinline
2083	ev_periodic_start (EV_P_ ev_periodic *w)	2232	ev_periodic_start (EV_P_ ev_periodic *w)
…		…
2094	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	2243	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2095	}	2244	}
2096	else	2245	else
2097	ev_at (w) = w->offset;	2246	ev_at (w) = w->offset;
2098		2247
		2248	EV_FREQUENT_CHECK;
		2249
		2250	++periodiccnt;
2099	ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);	2251	ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2100	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);	2252	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2101	ANHE_w (periodics [ev_active (w)]) = (WT)w;	2253	ANHE_w (periodics [ev_active (w)]) = (WT)w;
2102	ANHE_at_set (periodics [ev_active (w)]);	2254	ANHE_at_cache (periodics [ev_active (w)]);
2103	upheap (periodics, ev_active (w));	2255	upheap (periodics, ev_active (w));
		2256
		2257	EV_FREQUENT_CHECK;
2104		2258
2105	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/	2259	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/
2106	}	2260	}
2107		2261
2108	void noinline	2262	void noinline
…		…
2110	{	2264	{
2111	clear_pending (EV_A_ (W)w);	2265	clear_pending (EV_A_ (W)w);
2112	if (expect_false (!ev_is_active (w)))	2266	if (expect_false (!ev_is_active (w)))
2113	return;	2267	return;
2114		2268
		2269	EV_FREQUENT_CHECK;
		2270
2115	{	2271	{
2116	int active = ev_active (w);	2272	int active = ev_active (w);
2117		2273
2118	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));	2274	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2119		2275
		2276	--periodiccnt;
		2277
2120	if (expect_true (active < periodiccnt + HEAP0 - 1))	2278	if (expect_true (active < periodiccnt + HEAP0))
2121	{	2279	{
2122	periodics [active] = periodics [periodiccnt + HEAP0 - 1];	2280	periodics [active] = periodics [periodiccnt + HEAP0];
2123	adjustheap (periodics, periodiccnt, active);	2281	adjustheap (periodics, periodiccnt, active);
2124	}	2282	}
2125
2126	--periodiccnt;
2127	}	2283	}
		2284
		2285	EV_FREQUENT_CHECK;
2128		2286
2129	ev_stop (EV_A_ (W)w);	2287	ev_stop (EV_A_ (W)w);
2130	}	2288	}
2131		2289
2132	void noinline	2290	void noinline
…		…
2152	return;	2310	return;
2153		2311
2154	assert (("ev_signal_start called with illegal signal number", w->signum > 0));	2312	assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2155		2313
2156	evpipe_init (EV_A);	2314	evpipe_init (EV_A);
		2315
		2316	EV_FREQUENT_CHECK;
2157		2317
2158	{	2318	{
2159	#ifndef _WIN32	2319	#ifndef _WIN32
2160	sigset_t full, prev;	2320	sigset_t full, prev;
2161	sigfillset (&full);	2321	sigfillset (&full);
…		…
2182	sigfillset (&sa.sa_mask);	2342	sigfillset (&sa.sa_mask);
2183	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */	2343	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2184	sigaction (w->signum, &sa, 0);	2344	sigaction (w->signum, &sa, 0);
2185	#endif	2345	#endif
2186	}	2346	}
		2347
		2348	EV_FREQUENT_CHECK;
2187	}	2349	}
2188		2350
2189	void noinline	2351	void noinline
2190	ev_signal_stop (EV_P_ ev_signal *w)	2352	ev_signal_stop (EV_P_ ev_signal *w)
2191	{	2353	{
2192	clear_pending (EV_A_ (W)w);	2354	clear_pending (EV_A_ (W)w);
2193	if (expect_false (!ev_is_active (w)))	2355	if (expect_false (!ev_is_active (w)))
2194	return;	2356	return;
2195		2357
		2358	EV_FREQUENT_CHECK;
		2359
2196	wlist_del (&signals [w->signum - 1].head, (WL)w);	2360	wlist_del (&signals [w->signum - 1].head, (WL)w);
2197	ev_stop (EV_A_ (W)w);	2361	ev_stop (EV_A_ (W)w);
2198		2362
2199	if (!signals [w->signum - 1].head)	2363	if (!signals [w->signum - 1].head)
2200	signal (w->signum, SIG_DFL);	2364	signal (w->signum, SIG_DFL);
		2365
		2366	EV_FREQUENT_CHECK;
2201	}	2367	}
2202		2368
2203	void	2369	void
2204	ev_child_start (EV_P_ ev_child *w)	2370	ev_child_start (EV_P_ ev_child *w)
2205	{	2371	{
…		…
2207	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));	2373	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2208	#endif	2374	#endif
2209	if (expect_false (ev_is_active (w)))	2375	if (expect_false (ev_is_active (w)))
2210	return;	2376	return;
2211		2377
		2378	EV_FREQUENT_CHECK;
		2379
2212	ev_start (EV_A_ (W)w, 1);	2380	ev_start (EV_A_ (W)w, 1);
2213	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2381	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
		2382
		2383	EV_FREQUENT_CHECK;
2214	}	2384	}
2215		2385
2216	void	2386	void
2217	ev_child_stop (EV_P_ ev_child *w)	2387	ev_child_stop (EV_P_ ev_child *w)
2218	{	2388	{
2219	clear_pending (EV_A_ (W)w);	2389	clear_pending (EV_A_ (W)w);
2220	if (expect_false (!ev_is_active (w)))	2390	if (expect_false (!ev_is_active (w)))
2221	return;	2391	return;
2222		2392
		2393	EV_FREQUENT_CHECK;
		2394
2223	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2395	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2224	ev_stop (EV_A_ (W)w);	2396	ev_stop (EV_A_ (W)w);
		2397
		2398	EV_FREQUENT_CHECK;
2225	}	2399	}
2226		2400
2227	#if EV_STAT_ENABLE	2401	#if EV_STAT_ENABLE
2228		2402
2229	# ifdef _WIN32	2403	# ifdef _WIN32
…		…
2457	else	2631	else
2458	#endif	2632	#endif
2459	ev_timer_start (EV_A_ &w->timer);	2633	ev_timer_start (EV_A_ &w->timer);
2460		2634
2461	ev_start (EV_A_ (W)w, 1);	2635	ev_start (EV_A_ (W)w, 1);
		2636
		2637	EV_FREQUENT_CHECK;
2462	}	2638	}
2463		2639
2464	void	2640	void
2465	ev_stat_stop (EV_P_ ev_stat *w)	2641	ev_stat_stop (EV_P_ ev_stat *w)
2466	{	2642	{
2467	clear_pending (EV_A_ (W)w);	2643	clear_pending (EV_A_ (W)w);
2468	if (expect_false (!ev_is_active (w)))	2644	if (expect_false (!ev_is_active (w)))
2469	return;	2645	return;
2470		2646
		2647	EV_FREQUENT_CHECK;
		2648
2471	#if EV_USE_INOTIFY	2649	#if EV_USE_INOTIFY
2472	infy_del (EV_A_ w);	2650	infy_del (EV_A_ w);
2473	#endif	2651	#endif
2474	ev_timer_stop (EV_A_ &w->timer);	2652	ev_timer_stop (EV_A_ &w->timer);
2475		2653
2476	ev_stop (EV_A_ (W)w);	2654	ev_stop (EV_A_ (W)w);
		2655
		2656	EV_FREQUENT_CHECK;
2477	}	2657	}
2478	#endif	2658	#endif
2479		2659
2480	#if EV_IDLE_ENABLE	2660	#if EV_IDLE_ENABLE
2481	void	2661	void
…		…
2483	{	2663	{
2484	if (expect_false (ev_is_active (w)))	2664	if (expect_false (ev_is_active (w)))
2485	return;	2665	return;
2486		2666
2487	pri_adjust (EV_A_ (W)w);	2667	pri_adjust (EV_A_ (W)w);
		2668
		2669	EV_FREQUENT_CHECK;
2488		2670
2489	{	2671	{
2490	int active = ++idlecnt [ABSPRI (w)];	2672	int active = ++idlecnt [ABSPRI (w)];
2491		2673
2492	++idleall;	2674	++idleall;
2493	ev_start (EV_A_ (W)w, active);	2675	ev_start (EV_A_ (W)w, active);
2494		2676
2495	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);	2677	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2496	idles [ABSPRI (w)][active - 1] = w;	2678	idles [ABSPRI (w)][active - 1] = w;
2497	}	2679	}
		2680
		2681	EV_FREQUENT_CHECK;
2498	}	2682	}
2499		2683
2500	void	2684	void
2501	ev_idle_stop (EV_P_ ev_idle *w)	2685	ev_idle_stop (EV_P_ ev_idle *w)
2502	{	2686	{
2503	clear_pending (EV_A_ (W)w);	2687	clear_pending (EV_A_ (W)w);
2504	if (expect_false (!ev_is_active (w)))	2688	if (expect_false (!ev_is_active (w)))
2505	return;	2689	return;
2506		2690
		2691	EV_FREQUENT_CHECK;
		2692
2507	{	2693	{
2508	int active = ev_active (w);	2694	int active = ev_active (w);
2509		2695
2510	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];	2696	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2511	ev_active (idles [ABSPRI (w)][active - 1]) = active;	2697	ev_active (idles [ABSPRI (w)][active - 1]) = active;
2512		2698
2513	ev_stop (EV_A_ (W)w);	2699	ev_stop (EV_A_ (W)w);
2514	--idleall;	2700	--idleall;
2515	}	2701	}
		2702
		2703	EV_FREQUENT_CHECK;
2516	}	2704	}
2517	#endif	2705	#endif
2518		2706
2519	void	2707	void
2520	ev_prepare_start (EV_P_ ev_prepare *w)	2708	ev_prepare_start (EV_P_ ev_prepare *w)
2521	{	2709	{
2522	if (expect_false (ev_is_active (w)))	2710	if (expect_false (ev_is_active (w)))
2523	return;	2711	return;
		2712
		2713	EV_FREQUENT_CHECK;
2524		2714
2525	ev_start (EV_A_ (W)w, ++preparecnt);	2715	ev_start (EV_A_ (W)w, ++preparecnt);
2526	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);	2716	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2527	prepares [preparecnt - 1] = w;	2717	prepares [preparecnt - 1] = w;
		2718
		2719	EV_FREQUENT_CHECK;
2528	}	2720	}
2529		2721
2530	void	2722	void
2531	ev_prepare_stop (EV_P_ ev_prepare *w)	2723	ev_prepare_stop (EV_P_ ev_prepare *w)
2532	{	2724	{
2533	clear_pending (EV_A_ (W)w);	2725	clear_pending (EV_A_ (W)w);
2534	if (expect_false (!ev_is_active (w)))	2726	if (expect_false (!ev_is_active (w)))
2535	return;	2727	return;
2536		2728
		2729	EV_FREQUENT_CHECK;
		2730
2537	{	2731	{
2538	int active = ev_active (w);	2732	int active = ev_active (w);
2539		2733
2540	prepares [active - 1] = prepares [--preparecnt];	2734	prepares [active - 1] = prepares [--preparecnt];
2541	ev_active (prepares [active - 1]) = active;	2735	ev_active (prepares [active - 1]) = active;
2542	}	2736	}
2543		2737
2544	ev_stop (EV_A_ (W)w);	2738	ev_stop (EV_A_ (W)w);
		2739
		2740	EV_FREQUENT_CHECK;
2545	}	2741	}
2546		2742
2547	void	2743	void
2548	ev_check_start (EV_P_ ev_check *w)	2744	ev_check_start (EV_P_ ev_check *w)
2549	{	2745	{
2550	if (expect_false (ev_is_active (w)))	2746	if (expect_false (ev_is_active (w)))
2551	return;	2747	return;
		2748
		2749	EV_FREQUENT_CHECK;
2552		2750
2553	ev_start (EV_A_ (W)w, ++checkcnt);	2751	ev_start (EV_A_ (W)w, ++checkcnt);
2554	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);	2752	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2555	checks [checkcnt - 1] = w;	2753	checks [checkcnt - 1] = w;
		2754
		2755	EV_FREQUENT_CHECK;
2556	}	2756	}
2557		2757
2558	void	2758	void
2559	ev_check_stop (EV_P_ ev_check *w)	2759	ev_check_stop (EV_P_ ev_check *w)
2560	{	2760	{
2561	clear_pending (EV_A_ (W)w);	2761	clear_pending (EV_A_ (W)w);
2562	if (expect_false (!ev_is_active (w)))	2762	if (expect_false (!ev_is_active (w)))
2563	return;	2763	return;
2564		2764
		2765	EV_FREQUENT_CHECK;
		2766
2565	{	2767	{
2566	int active = ev_active (w);	2768	int active = ev_active (w);
2567		2769
2568	checks [active - 1] = checks [--checkcnt];	2770	checks [active - 1] = checks [--checkcnt];
2569	ev_active (checks [active - 1]) = active;	2771	ev_active (checks [active - 1]) = active;
2570	}	2772	}
2571		2773
2572	ev_stop (EV_A_ (W)w);	2774	ev_stop (EV_A_ (W)w);
		2775
		2776	EV_FREQUENT_CHECK;
2573	}	2777	}
2574		2778
2575	#if EV_EMBED_ENABLE	2779	#if EV_EMBED_ENABLE
2576	void noinline	2780	void noinline
2577	ev_embed_sweep (EV_P_ ev_embed *w)	2781	ev_embed_sweep (EV_P_ ev_embed *w)
…		…
2624	struct ev_loop *loop = w->other;	2828	struct ev_loop *loop = w->other;
2625	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));	2829	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);	2830	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2627	}	2831	}
2628		2832
		2833	EV_FREQUENT_CHECK;
		2834
2629	ev_set_priority (&w->io, ev_priority (w));	2835	ev_set_priority (&w->io, ev_priority (w));
2630	ev_io_start (EV_A_ &w->io);	2836	ev_io_start (EV_A_ &w->io);
2631		2837
2632	ev_prepare_init (&w->prepare, embed_prepare_cb);	2838	ev_prepare_init (&w->prepare, embed_prepare_cb);
2633	ev_set_priority (&w->prepare, EV_MINPRI);	2839	ev_set_priority (&w->prepare, EV_MINPRI);
2634	ev_prepare_start (EV_A_ &w->prepare);	2840	ev_prepare_start (EV_A_ &w->prepare);
2635		2841
2636	/ev_idle_init (&w->idle, e,bed_idle_cb);/	2842	/ev_idle_init (&w->idle, e,bed_idle_cb);/
2637		2843
2638	ev_start (EV_A_ (W)w, 1);	2844	ev_start (EV_A_ (W)w, 1);
		2845
		2846	EV_FREQUENT_CHECK;
2639	}	2847	}
2640		2848
2641	void	2849	void
2642	ev_embed_stop (EV_P_ ev_embed *w)	2850	ev_embed_stop (EV_P_ ev_embed *w)
2643	{	2851	{
2644	clear_pending (EV_A_ (W)w);	2852	clear_pending (EV_A_ (W)w);
2645	if (expect_false (!ev_is_active (w)))	2853	if (expect_false (!ev_is_active (w)))
2646	return;	2854	return;
2647		2855
		2856	EV_FREQUENT_CHECK;
		2857
2648	ev_io_stop (EV_A_ &w->io);	2858	ev_io_stop (EV_A_ &w->io);
2649	ev_prepare_stop (EV_A_ &w->prepare);	2859	ev_prepare_stop (EV_A_ &w->prepare);
2650		2860
2651	ev_stop (EV_A_ (W)w);	2861	ev_stop (EV_A_ (W)w);
		2862
		2863	EV_FREQUENT_CHECK;
2652	}	2864	}
2653	#endif	2865	#endif
2654		2866
2655	#if EV_FORK_ENABLE	2867	#if EV_FORK_ENABLE
2656	void	2868	void
2657	ev_fork_start (EV_P_ ev_fork *w)	2869	ev_fork_start (EV_P_ ev_fork *w)
2658	{	2870	{
2659	if (expect_false (ev_is_active (w)))	2871	if (expect_false (ev_is_active (w)))
2660	return;	2872	return;
		2873
		2874	EV_FREQUENT_CHECK;
2661		2875
2662	ev_start (EV_A_ (W)w, ++forkcnt);	2876	ev_start (EV_A_ (W)w, ++forkcnt);
2663	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);	2877	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2664	forks [forkcnt - 1] = w;	2878	forks [forkcnt - 1] = w;
		2879
		2880	EV_FREQUENT_CHECK;
2665	}	2881	}
2666		2882
2667	void	2883	void
2668	ev_fork_stop (EV_P_ ev_fork *w)	2884	ev_fork_stop (EV_P_ ev_fork *w)
2669	{	2885	{
2670	clear_pending (EV_A_ (W)w);	2886	clear_pending (EV_A_ (W)w);
2671	if (expect_false (!ev_is_active (w)))	2887	if (expect_false (!ev_is_active (w)))
2672	return;	2888	return;
2673		2889
		2890	EV_FREQUENT_CHECK;
		2891
2674	{	2892	{
2675	int active = ev_active (w);	2893	int active = ev_active (w);
2676		2894
2677	forks [active - 1] = forks [--forkcnt];	2895	forks [active - 1] = forks [--forkcnt];
2678	ev_active (forks [active - 1]) = active;	2896	ev_active (forks [active - 1]) = active;
2679	}	2897	}
2680		2898
2681	ev_stop (EV_A_ (W)w);	2899	ev_stop (EV_A_ (W)w);
		2900
		2901	EV_FREQUENT_CHECK;
2682	}	2902	}
2683	#endif	2903	#endif
2684		2904
2685	#if EV_ASYNC_ENABLE	2905	#if EV_ASYNC_ENABLE
2686	void	2906	void
…		…
2688	{	2908	{
2689	if (expect_false (ev_is_active (w)))	2909	if (expect_false (ev_is_active (w)))
2690	return;	2910	return;
2691		2911
2692	evpipe_init (EV_A);	2912	evpipe_init (EV_A);
		2913
		2914	EV_FREQUENT_CHECK;
2693		2915
2694	ev_start (EV_A_ (W)w, ++asynccnt);	2916	ev_start (EV_A_ (W)w, ++asynccnt);
2695	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);	2917	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2696	asyncs [asynccnt - 1] = w;	2918	asyncs [asynccnt - 1] = w;
		2919
		2920	EV_FREQUENT_CHECK;
2697	}	2921	}
2698		2922
2699	void	2923	void
2700	ev_async_stop (EV_P_ ev_async *w)	2924	ev_async_stop (EV_P_ ev_async *w)
2701	{	2925	{
2702	clear_pending (EV_A_ (W)w);	2926	clear_pending (EV_A_ (W)w);
2703	if (expect_false (!ev_is_active (w)))	2927	if (expect_false (!ev_is_active (w)))
2704	return;	2928	return;
2705		2929
		2930	EV_FREQUENT_CHECK;
		2931
2706	{	2932	{
2707	int active = ev_active (w);	2933	int active = ev_active (w);
2708		2934
2709	asyncs [active - 1] = asyncs [--asynccnt];	2935	asyncs [active - 1] = asyncs [--asynccnt];
2710	ev_active (asyncs [active - 1]) = active;	2936	ev_active (asyncs [active - 1]) = active;
2711	}	2937	}
2712		2938
2713	ev_stop (EV_A_ (W)w);	2939	ev_stop (EV_A_ (W)w);
		2940
		2941	EV_FREQUENT_CHECK;
2714	}	2942	}
2715		2943
2716	void	2944	void
2717	ev_async_send (EV_P_ ev_async *w)	2945	ev_async_send (EV_P_ ev_async *w)
2718	{	2946	{

Diff Legend

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

Comparing libev/ev.c (file contents): Revision 1.243 by root, Fri May 9 15:52:13 2008 UTC vs. Revision 1.251 by root, Thu May 22 03:42:34 2008 UTC

Diff Legend

Comparing libev/ev.c (file contents):
Revision 1.243 by root, Fri May 9 15:52:13 2008 UTC vs.
Revision 1.251 by root, Thu May 22 03:42:34 2008 UTC