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

Comparing libev/ev.c (file contents):
Revision 1.242 by root, Fri May 9 14:07:19 2008 UTC vs.
Revision 1.249 by root, Wed May 21 23:30:52 2008 UTC

…		…
235	# else	235	# else
236	# define EV_USE_EVENTFD 0	236	# define EV_USE_EVENTFD 0
237	# endif	237	# endif
238	#endif	238	#endif
239		239
		240	#if 0 /* debugging */
		241	# define EV_VERIFY 1
		242	# define EV_USE_4HEAP 1
		243	# define EV_HEAP_CACHE_AT 1
		244	#endif
		245
		246	#ifndef EV_USE_4HEAP
		247	# define EV_USE_4HEAP !EV_MINIMAL
		248	#endif
		249
		250	#ifndef EV_HEAP_CACHE_AT
		251	# define EV_HEAP_CACHE_AT !EV_MINIMAL
		252	#endif
		253
240	/* this block fixes any misconfiguration where we know we run into trouble otherwise */	254	/* this block fixes any misconfiguration where we know we run into trouble otherwise */
241		255
242	#ifndef CLOCK_MONOTONIC	256	#ifndef CLOCK_MONOTONIC
243	# undef EV_USE_MONOTONIC	257	# undef EV_USE_MONOTONIC
244	# define EV_USE_MONOTONIC 0	258	# define EV_USE_MONOTONIC 0
…		…
279	}	293	}
280	# endif	294	# endif
281	#endif	295	#endif
282		296
283	/**/	297	/**/
		298
		299	/* EV_VERIFY: enable internal consistency checks
		300	* undefined or zero: no verification done or available
		301	* 1 or higher: ev_loop_verify function available
		302	* 2 or higher: ev_loop_verify is called frequently
		303	*/
		304	#if EV_VERIFY >= 1
		305	# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
		306	#else
		307	# define EV_FREQUENT_CHECK do { } while (0)
		308	#endif
284		309
285	/*	310	/*
286	* This is used to avoid floating point rounding problems.	311	* This is used to avoid floating point rounding problems.
287	* It is added to ev_rt_now when scheduling periodics	312	* It is added to ev_rt_now when scheduling periodics
288	* to ensure progress, time-wise, even when rounding	313	* to ensure progress, time-wise, even when rounding
…		…
430	WL head;	455	WL head;
431	} ANFS;	456	} ANFS;
432	#endif	457	#endif
433		458
434	/* Heap Entry */	459	/* Heap Entry */
435	#define EV_HEAP_CACHE_AT 0
436	#if EV_HEAP_CACHE_AT	460	#if EV_HEAP_CACHE_AT
437	typedef struct {	461	typedef struct {
		462	ev_tstamp at;
438	WT w;	463	WT w;
439	ev_tstamp at;
440	} ANHE;	464	} ANHE;
441		465
442	#define ANHE_w(he) (he).w /* access watcher, read-write */	466	#define ANHE_w(he) (he).w /* access watcher, read-write */
443	#define ANHE_at(he) (he).at /* access cached at, read-only */	467	#define ANHE_at(he) (he).at /* access cached at, read-only */
444	#define ANHE_at_set(he) (he).at = (he).w->at /* update at from watcher */	468	#define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
445	#else	469	#else
446	typedef WT ANHE;	470	typedef WT ANHE;
447		471
448	#define ANHE_w(he) (he)	472	#define ANHE_w(he) (he)
449	#define ANHE_at(he) (he)->at	473	#define ANHE_at(he) (he)->at
450	#define ANHE_at_set(he)	474	#define ANHE_at_cache(he)
451	#endif	475	#endif
452		476
453	#if EV_MULTIPLICITY	477	#if EV_MULTIPLICITY
454		478
455	struct ev_loop	479	struct ev_loop
…		…
791	* at the moment we allow libev the luxury of two heaps,	815	* at the moment we allow libev the luxury of two heaps,
792	* a small-code-size 2-heap one and a ~1.5kb larger 4-heap	816	* a small-code-size 2-heap one and a ~1.5kb larger 4-heap
793	* which is more cache-efficient.	817	* which is more cache-efficient.
794	* the difference is about 5% with 50000+ watchers.	818	* the difference is about 5% with 50000+ watchers.
795	*/	819	*/
796	#define EV_USE_4HEAP !EV_MINIMAL
797	#if EV_USE_4HEAP	820	#if EV_USE_4HEAP
798		821
799	#define DHEAP 4	822	#define DHEAP 4
800	#define HEAP0 (DHEAP - 1) /* index of first element in heap */	823	#define HEAP0 (DHEAP - 1) /* index of first element in heap */
801		824	#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
802	/* towards the root */	825	#define UPHEAP_DONE(p,k) ((p) == (k))
803	void inline_speed
804	upheap (ANHE *heap, int k)
805	{
806	ANHE he = heap [k];
807
808	for (;;)
809	{
810	int p = ((k - HEAP0 - 1) / DHEAP) + HEAP0;
811
812	if (p == k \|\| ANHE_at (heap [p]) <= ANHE_at (he))
813	break;
814
815	heap [k] = heap [p];
816	ev_active (ANHE_w (heap [k])) = k;
817	k = p;
818	}
819
820	ev_active (ANHE_w (he)) = k;
821	heap [k] = he;
822	}
823		826
824	/* away from the root */	827	/* away from the root */
825	void inline_speed	828	void inline_speed
826	downheap (ANHE *heap, int N, int k)	829	downheap (ANHE *heap, int N, int k)
827	{	830	{
…		…
830		833
831	for (;;)	834	for (;;)
832	{	835	{
833	ev_tstamp minat;	836	ev_tstamp minat;
834	ANHE *minpos;	837	ANHE *minpos;
835	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0;	838	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0 + 1;
836		839
837	// find minimum child	840	/* find minimum child */
838	if (expect_true (pos + DHEAP - 1 < E))	841	if (expect_true (pos + DHEAP - 1 < E))
839	{	842	{
840	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));	843	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));
841	if (ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));	844	if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
842	if (ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));	845	if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
843	if (ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));	846	if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
844	}	847	}
845	else if (pos < E)	848	else if (pos < E)
846	{	849	{
847	/* slow path / (minpos = pos + 0), (minat = ANHE_at (minpos));	850	/* slow path / (minpos = pos + 0), (minat = ANHE_at (minpos));
848	if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));	851	if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
…		…
853	break;	856	break;
854		857
855	if (ANHE_at (he) <= minat)	858	if (ANHE_at (he) <= minat)
856	break;	859	break;
857		860
		861	heap [k] = *minpos;
858	ev_active (ANHE_w (*minpos)) = k;	862	ev_active (ANHE_w (*minpos)) = k;
859	heap [k] = *minpos;
860		863
861	k = minpos - heap;	864	k = minpos - heap;
862	}	865	}
863		866
		867	heap [k] = he;
864	ev_active (ANHE_w (he)) = k;	868	ev_active (ANHE_w (he)) = k;
865	heap [k] = he;
866	}	869	}
867		870
868	#else // 4HEAP	871	#else /* 4HEAP */
869		872
870	#define HEAP0 1	873	#define HEAP0 1
871		874	#define HPARENT(k) ((k) >> 1)
872	/* towards the root */	875	#define UPHEAP_DONE(p,k) (!(p))
873	void inline_speed
874	upheap (ANHE *heap, int k)
875	{
876	ANHE he = heap [k];
877
878	for (;;)
879	{
880	int p = k >> 1;
881
882	/* maybe we could use a dummy element at heap [0]? */
883	if (!p \|\| ANHE_at (heap [p]) <= ANHE_at (he))
884	break;
885
886	heap [k] = heap [p];
887	ev_active (ANHE_w (heap [k])) = k;
888	k = p;
889	}
890
891	heap [k] = w;
892	ev_active (ANHE_w (heap [k])) = k;
893	}
894		876
895	/* away from the root */	877	/* away from the root */
896	void inline_speed	878	void inline_speed
897	downheap (ANHE *heap, int N, int k)	879	downheap (ANHE *heap, int N, int k)
898	{	880	{
…		…
900		882
901	for (;;)	883	for (;;)
902	{	884	{
903	int c = k << 1;	885	int c = k << 1;
904		886
905	if (c > N)	887	if (c > N + HEAP0 - 1)
906	break;	888	break;
907		889
908	c += c + 1 < N && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])	890	c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
909	? 1 : 0;	891	? 1 : 0;
910		892
911	if (w->at <= ANHE_at (heap [c]))	893	if (ANHE_at (he) <= ANHE_at (heap [c]))
912	break;	894	break;
913		895
914	heap [k] = heap [c];	896	heap [k] = heap [c];
915	ev_active (ANHE_w (heap [k])) = k;	897	ev_active (ANHE_w (heap [k])) = k;
916		898
…		…
920	heap [k] = he;	902	heap [k] = he;
921	ev_active (ANHE_w (he)) = k;	903	ev_active (ANHE_w (he)) = k;
922	}	904	}
923	#endif	905	#endif
924		906
		907	/* towards the root */
		908	void inline_speed
		909	upheap (ANHE *heap, int k)
		910	{
		911	ANHE he = heap [k];
		912
		913	for (;;)
		914	{
		915	int p = HPARENT (k);
		916
		917	if (UPHEAP_DONE (p, k) \|\| ANHE_at (heap [p]) <= ANHE_at (he))
		918	break;
		919
		920	heap [k] = heap [p];
		921	ev_active (ANHE_w (heap [k])) = k;
		922	k = p;
		923	}
		924
		925	heap [k] = he;
		926	ev_active (ANHE_w (he)) = k;
		927	}
		928
925	void inline_size	929	void inline_size
926	adjustheap (ANHE *heap, int N, int k)	930	adjustheap (ANHE *heap, int N, int k)
927	{	931	{
		932	if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
928	upheap (heap, k);	933	upheap (heap, k);
		934	else
929	downheap (heap, N, k);	935	downheap (heap, N, k);
930	}	936	}
		937
		938	/* rebuild the heap: this function is used only once and executed rarely */
		939	void inline_size
		940	reheap (ANHE *heap, int N)
		941	{
		942	int i;
		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);
		947	}
		948
		949	#if EV_VERIFY
		950	static void
		951	checkheap (ANHE *heap, int N)
		952	{
		953	int i;
		954
		955	for (i = HEAP0; i < N + HEAP0; ++i)
		956	{
		957	assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
		958	assert (("heap condition violated", i == HEAP0 \|\| ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
		959	assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
		960	}
		961	}
		962	#endif
931		963
932	/*****************************************************************************/	964	/*****************************************************************************/
933		965
934	typedef struct	966	typedef struct
935	{	967	{
…		…
1479	void	1511	void
1480	ev_loop_fork (EV_P)	1512	ev_loop_fork (EV_P)
1481	{	1513	{
1482	postfork = 1; /* must be in line with ev_default_fork */	1514	postfork = 1; /* must be in line with ev_default_fork */
1483	}	1515	}
		1516
		1517	#if EV_VERIFY
		1518	static void
		1519	array_check (W **ws, int cnt)
		1520	{
		1521	while (cnt--)
		1522	assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
		1523	}
		1524
		1525	static void
		1526	ev_loop_verify (EV_P)
		1527	{
		1528	int i;
		1529
		1530	checkheap (timers, timercnt);
		1531	#if EV_PERIODIC_ENABLE
		1532	checkheap (periodics, periodiccnt);
		1533	#endif
		1534
		1535	#if EV_IDLE_ENABLE
		1536	for (i = NUMPRI; i--; )
		1537	array_check ((W **)idles [i], idlecnt [i]);
		1538	#endif
		1539	#if EV_FORK_ENABLE
		1540	array_check ((W **)forks, forkcnt);
		1541	#endif
		1542	array_check ((W **)prepares, preparecnt);
		1543	array_check ((W **)checks, checkcnt);
		1544	#if EV_ASYNC_ENABLE
		1545	array_check ((W **)asyncs, asynccnt);
		1546	#endif
		1547	}
		1548	#endif
		1549
1484	#endif	1550	#endif
1485		1551
1486	#if EV_MULTIPLICITY	1552	#if EV_MULTIPLICITY
1487	struct ev_loop *	1553	struct ev_loop *
1488	ev_default_loop_init (unsigned int flags)	1554	ev_default_loop_init (unsigned int flags)
…		…
1554	void inline_speed	1620	void inline_speed
1555	call_pending (EV_P)	1621	call_pending (EV_P)
1556	{	1622	{
1557	int pri;	1623	int pri;
1558		1624
		1625	EV_FREQUENT_CHECK;
		1626
1559	for (pri = NUMPRI; pri--; )	1627	for (pri = NUMPRI; pri--; )
1560	while (pendingcnt [pri])	1628	while (pendingcnt [pri])
1561	{	1629	{
1562	ANPENDING *p = pendings [pri] + --pendingcnt [pri];	1630	ANPENDING *p = pendings [pri] + --pendingcnt [pri];
1563		1631
…		…
1567		1635
1568	p->w->pending = 0;	1636	p->w->pending = 0;
1569	EV_CB_INVOKE (p->w, p->events);	1637	EV_CB_INVOKE (p->w, p->events);
1570	}	1638	}
1571	}	1639	}
		1640
		1641	EV_FREQUENT_CHECK;
1572	}	1642	}
1573		1643
1574	#if EV_IDLE_ENABLE	1644	#if EV_IDLE_ENABLE
1575	void inline_size	1645	void inline_size
1576	idle_reify (EV_P)	1646	idle_reify (EV_P)
…		…
1595	#endif	1665	#endif
1596		1666
1597	void inline_size	1667	void inline_size
1598	timers_reify (EV_P)	1668	timers_reify (EV_P)
1599	{	1669	{
		1670	EV_FREQUENT_CHECK;
		1671
1600	while (timercnt && ANHE_at (timers [HEAP0]) <= mn_now)	1672	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1601	{	1673	{
1602	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);	1674	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);
1603		1675
1604	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/	1676	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/
1605		1677
1606	/* first reschedule or stop timer */	1678	/* first reschedule or stop timer */
1607	if (w->repeat)	1679	if (w->repeat)
1608	{	1680	{
1609	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1610
1611	ev_at (w) += w->repeat;	1681	ev_at (w) += w->repeat;
1612	if (ev_at (w) < mn_now)	1682	if (ev_at (w) < mn_now)
1613	ev_at (w) = mn_now;	1683	ev_at (w) = mn_now;
1614		1684
		1685	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
		1686
1615	ANHE_at_set (timers [HEAP0]);	1687	ANHE_at_cache (timers [HEAP0]);
1616	downheap (timers, timercnt, HEAP0);	1688	downheap (timers, timercnt, HEAP0);
1617	}	1689	}
1618	else	1690	else
1619	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */	1691	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1620		1692
		1693	EV_FREQUENT_CHECK;
1621	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);	1694	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1622	}	1695	}
1623	}	1696	}
1624		1697
1625	#if EV_PERIODIC_ENABLE	1698	#if EV_PERIODIC_ENABLE
1626	void inline_size	1699	void inline_size
1627	periodics_reify (EV_P)	1700	periodics_reify (EV_P)
1628	{	1701	{
		1702	EV_FREQUENT_CHECK;
1629	while (periodiccnt && ANHE_at (periodics [HEAP0]) <= ev_rt_now)	1703	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1630	{	1704	{
1631	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);	1705	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);
1632		1706
1633	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/	1707	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/
1634		1708
1635	/* first reschedule or stop timer */	1709	/* first reschedule or stop timer */
1636	if (w->reschedule_cb)	1710	if (w->reschedule_cb)
1637	{	1711	{
1638	ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);	1712	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
		1713
1639	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));	1714	assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
		1715
1640	ANHE_at_set (periodics [HEAP0]);	1716	ANHE_at_cache (periodics [HEAP0]);
1641	downheap (periodics, periodiccnt, HEAP0);	1717	downheap (periodics, periodiccnt, HEAP0);
		1718	EV_FREQUENT_CHECK;
1642	}	1719	}
1643	else if (w->interval)	1720	else if (w->interval)
1644	{	1721	{
1645	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1722	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
		1723	/* if next trigger time is not sufficiently in the future, put it there */
		1724	/* this might happen because of floating point inexactness */
1646	if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;	1725	if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1647	assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));	1726	{
		1727	ev_at (w) += w->interval;
		1728
		1729	/* if interval is unreasonably low we might still have a time in the past */
		1730	/* so correct this. this will make the periodic very inexact, but the user */
		1731	/* has effectively asked to get triggered more often than possible */
		1732	if (ev_at (w) < ev_rt_now)
		1733	ev_at (w) = ev_rt_now;
		1734	}
		1735
1648	ANHE_at_set (periodics [HEAP0]);	1736	ANHE_at_cache (periodics [HEAP0]);
1649	downheap (periodics, periodiccnt, HEAP0);	1737	downheap (periodics, periodiccnt, HEAP0);
1650	}	1738	}
1651	else	1739	else
1652	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */	1740	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1653		1741
		1742	EV_FREQUENT_CHECK;
1654	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);	1743	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1655	}	1744	}
1656	}	1745	}
1657		1746
1658	static void noinline	1747	static void noinline
…		…
1668	if (w->reschedule_cb)	1757	if (w->reschedule_cb)
1669	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1758	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1670	else if (w->interval)	1759	else if (w->interval)
1671	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	1760	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1672		1761
1673	ANHE_at_set (periodics [i]);	1762	ANHE_at_cache (periodics [i]);
1674	}	1763	}
1675		1764
1676	/* now rebuild the heap, this for the 2-heap, inefficient for the 4-heap, but correct */
1677	for (i = periodiccnt >> 1; --i; )
1678	downheap (periodics, periodiccnt, i + HEAP0);	1765	reheap (periodics, periodiccnt);
1679	}	1766	}
1680	#endif	1767	#endif
1681		1768
1682	void inline_speed	1769	void inline_speed
1683	time_update (EV_P_ ev_tstamp max_block)	1770	time_update (EV_P_ ev_tstamp max_block)
…		…
1741	/* adjust timers. this is easy, as the offset is the same for all of them */	1828	/* adjust timers. this is easy, as the offset is the same for all of them */
1742	for (i = 0; i < timercnt; ++i)	1829	for (i = 0; i < timercnt; ++i)
1743	{	1830	{
1744	ANHE *he = timers + i + HEAP0;	1831	ANHE *he = timers + i + HEAP0;
1745	ANHE_w (*he)->at += ev_rt_now - mn_now;	1832	ANHE_w (*he)->at += ev_rt_now - mn_now;
1746	ANHE_at_set (*he);	1833	ANHE_at_cache (*he);
1747	}	1834	}
1748	}	1835	}
1749		1836
1750	mn_now = ev_rt_now;	1837	mn_now = ev_rt_now;
1751	}	1838	}
…		…
1976	if (expect_false (ev_is_active (w)))	2063	if (expect_false (ev_is_active (w)))
1977	return;	2064	return;
1978		2065
1979	assert (("ev_io_start called with negative fd", fd >= 0));	2066	assert (("ev_io_start called with negative fd", fd >= 0));
1980		2067
		2068	EV_FREQUENT_CHECK;
		2069
1981	ev_start (EV_A_ (W)w, 1);	2070	ev_start (EV_A_ (W)w, 1);
1982	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);	2071	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1983	wlist_add (&anfds[fd].head, (WL)w);	2072	wlist_add (&anfds[fd].head, (WL)w);
1984		2073
1985	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);	2074	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);
1986	w->events &= ~EV_IOFDSET;	2075	w->events &= ~EV_IOFDSET;
		2076
		2077	EV_FREQUENT_CHECK;
1987	}	2078	}
1988		2079
1989	void noinline	2080	void noinline
1990	ev_io_stop (EV_P_ ev_io *w)	2081	ev_io_stop (EV_P_ ev_io *w)
1991	{	2082	{
…		…
1993	if (expect_false (!ev_is_active (w)))	2084	if (expect_false (!ev_is_active (w)))
1994	return;	2085	return;
1995		2086
1996	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));	2087	assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
1997		2088
		2089	EV_FREQUENT_CHECK;
		2090
1998	wlist_del (&anfds[w->fd].head, (WL)w);	2091	wlist_del (&anfds[w->fd].head, (WL)w);
1999	ev_stop (EV_A_ (W)w);	2092	ev_stop (EV_A_ (W)w);
2000		2093
2001	fd_change (EV_A_ w->fd, 1);	2094	fd_change (EV_A_ w->fd, 1);
		2095
		2096	EV_FREQUENT_CHECK;
2002	}	2097	}
2003		2098
2004	void noinline	2099	void noinline
2005	ev_timer_start (EV_P_ ev_timer *w)	2100	ev_timer_start (EV_P_ ev_timer *w)
2006	{	2101	{
…		…
2009		2104
2010	ev_at (w) += mn_now;	2105	ev_at (w) += mn_now;
2011		2106
2012	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));	2107	assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
2013		2108
		2109	EV_FREQUENT_CHECK;
		2110
		2111	++timercnt;
2014	ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);	2112	ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2015	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);	2113	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2016	ANHE_w (timers [ev_active (w)]) = (WT)w;	2114	ANHE_w (timers [ev_active (w)]) = (WT)w;
2017	ANHE_at_set (timers [ev_active (w)]);	2115	ANHE_at_cache (timers [ev_active (w)]);
2018	upheap (timers, ev_active (w));	2116	upheap (timers, ev_active (w));
		2117
		2118	EV_FREQUENT_CHECK;
2019		2119
2020	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/	2120	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/
2021	}	2121	}
2022		2122
2023	void noinline	2123	void noinline
…		…
2025	{	2125	{
2026	clear_pending (EV_A_ (W)w);	2126	clear_pending (EV_A_ (W)w);
2027	if (expect_false (!ev_is_active (w)))	2127	if (expect_false (!ev_is_active (w)))
2028	return;	2128	return;
2029		2129
		2130	EV_FREQUENT_CHECK;
		2131
2030	{	2132	{
2031	int active = ev_active (w);	2133	int active = ev_active (w);
2032		2134
2033	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));	2135	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2034		2136
		2137	--timercnt;
		2138
2035	if (expect_true (active < timercnt + HEAP0 - 1))	2139	if (expect_true (active < timercnt + HEAP0))
2036	{	2140	{
2037	timers [active] = timers [timercnt + HEAP0 - 1];	2141	timers [active] = timers [timercnt + HEAP0];
2038	adjustheap (timers, timercnt, active);	2142	adjustheap (timers, timercnt, active);
2039	}	2143	}
2040
2041	--timercnt;
2042	}	2144	}
		2145
		2146	EV_FREQUENT_CHECK;
2043		2147
2044	ev_at (w) -= mn_now;	2148	ev_at (w) -= mn_now;
2045		2149
2046	ev_stop (EV_A_ (W)w);	2150	ev_stop (EV_A_ (W)w);
2047	}	2151	}
2048		2152
2049	void noinline	2153	void noinline
2050	ev_timer_again (EV_P_ ev_timer *w)	2154	ev_timer_again (EV_P_ ev_timer *w)
2051	{	2155	{
		2156	EV_FREQUENT_CHECK;
		2157
2052	if (ev_is_active (w))	2158	if (ev_is_active (w))
2053	{	2159	{
2054	if (w->repeat)	2160	if (w->repeat)
2055	{	2161	{
2056	ev_at (w) = mn_now + w->repeat;	2162	ev_at (w) = mn_now + w->repeat;
2057	ANHE_at_set (timers [ev_active (w)]);	2163	ANHE_at_cache (timers [ev_active (w)]);
2058	adjustheap (timers, timercnt, ev_active (w));	2164	adjustheap (timers, timercnt, ev_active (w));
2059	}	2165	}
2060	else	2166	else
2061	ev_timer_stop (EV_A_ w);	2167	ev_timer_stop (EV_A_ w);
2062	}	2168	}
2063	else if (w->repeat)	2169	else if (w->repeat)
2064	{	2170	{
2065	ev_at (w) = w->repeat;	2171	ev_at (w) = w->repeat;
2066	ev_timer_start (EV_A_ w);	2172	ev_timer_start (EV_A_ w);
2067	}	2173	}
		2174
		2175	EV_FREQUENT_CHECK;
2068	}	2176	}
2069		2177
2070	#if EV_PERIODIC_ENABLE	2178	#if EV_PERIODIC_ENABLE
2071	void noinline	2179	void noinline
2072	ev_periodic_start (EV_P_ ev_periodic *w)	2180	ev_periodic_start (EV_P_ ev_periodic *w)
…		…
2083	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;	2191	ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
2084	}	2192	}
2085	else	2193	else
2086	ev_at (w) = w->offset;	2194	ev_at (w) = w->offset;
2087		2195
		2196	EV_FREQUENT_CHECK;
		2197
		2198	++periodiccnt;
2088	ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);	2199	ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2089	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);	2200	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2090	ANHE_w (periodics [ev_active (w)]) = (WT)w;	2201	ANHE_w (periodics [ev_active (w)]) = (WT)w;
		2202	ANHE_at_cache (periodics [ev_active (w)]);
2091	upheap (periodics, ev_active (w));	2203	upheap (periodics, ev_active (w));
		2204
		2205	EV_FREQUENT_CHECK;
2092		2206
2093	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/	2207	/assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));/
2094	}	2208	}
2095		2209
2096	void noinline	2210	void noinline
…		…
2098	{	2212	{
2099	clear_pending (EV_A_ (W)w);	2213	clear_pending (EV_A_ (W)w);
2100	if (expect_false (!ev_is_active (w)))	2214	if (expect_false (!ev_is_active (w)))
2101	return;	2215	return;
2102		2216
		2217	EV_FREQUENT_CHECK;
		2218
2103	{	2219	{
2104	int active = ev_active (w);	2220	int active = ev_active (w);
2105		2221
2106	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));	2222	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2107		2223
		2224	--periodiccnt;
		2225
2108	if (expect_true (active < periodiccnt + HEAP0 - 1))	2226	if (expect_true (active < periodiccnt + HEAP0))
2109	{	2227	{
2110	periodics [active] = periodics [periodiccnt + HEAP0 - 1];	2228	periodics [active] = periodics [periodiccnt + HEAP0];
2111	adjustheap (periodics, periodiccnt, active);	2229	adjustheap (periodics, periodiccnt, active);
2112	}	2230	}
2113
2114	--periodiccnt;
2115	}	2231	}
		2232
		2233	EV_FREQUENT_CHECK;
2116		2234
2117	ev_stop (EV_A_ (W)w);	2235	ev_stop (EV_A_ (W)w);
2118	}	2236	}
2119		2237
2120	void noinline	2238	void noinline
…		…
2140	return;	2258	return;
2141		2259
2142	assert (("ev_signal_start called with illegal signal number", w->signum > 0));	2260	assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2143		2261
2144	evpipe_init (EV_A);	2262	evpipe_init (EV_A);
		2263
		2264	EV_FREQUENT_CHECK;
2145		2265
2146	{	2266	{
2147	#ifndef _WIN32	2267	#ifndef _WIN32
2148	sigset_t full, prev;	2268	sigset_t full, prev;
2149	sigfillset (&full);	2269	sigfillset (&full);
…		…
2170	sigfillset (&sa.sa_mask);	2290	sigfillset (&sa.sa_mask);
2171	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */	2291	sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2172	sigaction (w->signum, &sa, 0);	2292	sigaction (w->signum, &sa, 0);
2173	#endif	2293	#endif
2174	}	2294	}
		2295
		2296	EV_FREQUENT_CHECK;
2175	}	2297	}
2176		2298
2177	void noinline	2299	void noinline
2178	ev_signal_stop (EV_P_ ev_signal *w)	2300	ev_signal_stop (EV_P_ ev_signal *w)
2179	{	2301	{
2180	clear_pending (EV_A_ (W)w);	2302	clear_pending (EV_A_ (W)w);
2181	if (expect_false (!ev_is_active (w)))	2303	if (expect_false (!ev_is_active (w)))
2182	return;	2304	return;
2183		2305
		2306	EV_FREQUENT_CHECK;
		2307
2184	wlist_del (&signals [w->signum - 1].head, (WL)w);	2308	wlist_del (&signals [w->signum - 1].head, (WL)w);
2185	ev_stop (EV_A_ (W)w);	2309	ev_stop (EV_A_ (W)w);
2186		2310
2187	if (!signals [w->signum - 1].head)	2311	if (!signals [w->signum - 1].head)
2188	signal (w->signum, SIG_DFL);	2312	signal (w->signum, SIG_DFL);
		2313
		2314	EV_FREQUENT_CHECK;
2189	}	2315	}
2190		2316
2191	void	2317	void
2192	ev_child_start (EV_P_ ev_child *w)	2318	ev_child_start (EV_P_ ev_child *w)
2193	{	2319	{
…		…
2195	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));	2321	assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2196	#endif	2322	#endif
2197	if (expect_false (ev_is_active (w)))	2323	if (expect_false (ev_is_active (w)))
2198	return;	2324	return;
2199		2325
		2326	EV_FREQUENT_CHECK;
		2327
2200	ev_start (EV_A_ (W)w, 1);	2328	ev_start (EV_A_ (W)w, 1);
2201	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2329	wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
		2330
		2331	EV_FREQUENT_CHECK;
2202	}	2332	}
2203		2333
2204	void	2334	void
2205	ev_child_stop (EV_P_ ev_child *w)	2335	ev_child_stop (EV_P_ ev_child *w)
2206	{	2336	{
2207	clear_pending (EV_A_ (W)w);	2337	clear_pending (EV_A_ (W)w);
2208	if (expect_false (!ev_is_active (w)))	2338	if (expect_false (!ev_is_active (w)))
2209	return;	2339	return;
2210		2340
		2341	EV_FREQUENT_CHECK;
		2342
2211	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2343	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2212	ev_stop (EV_A_ (W)w);	2344	ev_stop (EV_A_ (W)w);
		2345
		2346	EV_FREQUENT_CHECK;
2213	}	2347	}
2214		2348
2215	#if EV_STAT_ENABLE	2349	#if EV_STAT_ENABLE
2216		2350
2217	# ifdef _WIN32	2351	# ifdef _WIN32
…		…
2445	else	2579	else
2446	#endif	2580	#endif
2447	ev_timer_start (EV_A_ &w->timer);	2581	ev_timer_start (EV_A_ &w->timer);
2448		2582
2449	ev_start (EV_A_ (W)w, 1);	2583	ev_start (EV_A_ (W)w, 1);
		2584
		2585	EV_FREQUENT_CHECK;
2450	}	2586	}
2451		2587
2452	void	2588	void
2453	ev_stat_stop (EV_P_ ev_stat *w)	2589	ev_stat_stop (EV_P_ ev_stat *w)
2454	{	2590	{
2455	clear_pending (EV_A_ (W)w);	2591	clear_pending (EV_A_ (W)w);
2456	if (expect_false (!ev_is_active (w)))	2592	if (expect_false (!ev_is_active (w)))
2457	return;	2593	return;
2458		2594
		2595	EV_FREQUENT_CHECK;
		2596
2459	#if EV_USE_INOTIFY	2597	#if EV_USE_INOTIFY
2460	infy_del (EV_A_ w);	2598	infy_del (EV_A_ w);
2461	#endif	2599	#endif
2462	ev_timer_stop (EV_A_ &w->timer);	2600	ev_timer_stop (EV_A_ &w->timer);
2463		2601
2464	ev_stop (EV_A_ (W)w);	2602	ev_stop (EV_A_ (W)w);
		2603
		2604	EV_FREQUENT_CHECK;
2465	}	2605	}
2466	#endif	2606	#endif
2467		2607
2468	#if EV_IDLE_ENABLE	2608	#if EV_IDLE_ENABLE
2469	void	2609	void
…		…
2471	{	2611	{
2472	if (expect_false (ev_is_active (w)))	2612	if (expect_false (ev_is_active (w)))
2473	return;	2613	return;
2474		2614
2475	pri_adjust (EV_A_ (W)w);	2615	pri_adjust (EV_A_ (W)w);
		2616
		2617	EV_FREQUENT_CHECK;
2476		2618
2477	{	2619	{
2478	int active = ++idlecnt [ABSPRI (w)];	2620	int active = ++idlecnt [ABSPRI (w)];
2479		2621
2480	++idleall;	2622	++idleall;
2481	ev_start (EV_A_ (W)w, active);	2623	ev_start (EV_A_ (W)w, active);
2482		2624
2483	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);	2625	array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2484	idles [ABSPRI (w)][active - 1] = w;	2626	idles [ABSPRI (w)][active - 1] = w;
2485	}	2627	}
		2628
		2629	EV_FREQUENT_CHECK;
2486	}	2630	}
2487		2631
2488	void	2632	void
2489	ev_idle_stop (EV_P_ ev_idle *w)	2633	ev_idle_stop (EV_P_ ev_idle *w)
2490	{	2634	{
2491	clear_pending (EV_A_ (W)w);	2635	clear_pending (EV_A_ (W)w);
2492	if (expect_false (!ev_is_active (w)))	2636	if (expect_false (!ev_is_active (w)))
2493	return;	2637	return;
2494		2638
		2639	EV_FREQUENT_CHECK;
		2640
2495	{	2641	{
2496	int active = ev_active (w);	2642	int active = ev_active (w);
2497		2643
2498	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];	2644	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2499	ev_active (idles [ABSPRI (w)][active - 1]) = active;	2645	ev_active (idles [ABSPRI (w)][active - 1]) = active;
2500		2646
2501	ev_stop (EV_A_ (W)w);	2647	ev_stop (EV_A_ (W)w);
2502	--idleall;	2648	--idleall;
2503	}	2649	}
		2650
		2651	EV_FREQUENT_CHECK;
2504	}	2652	}
2505	#endif	2653	#endif
2506		2654
2507	void	2655	void
2508	ev_prepare_start (EV_P_ ev_prepare *w)	2656	ev_prepare_start (EV_P_ ev_prepare *w)
2509	{	2657	{
2510	if (expect_false (ev_is_active (w)))	2658	if (expect_false (ev_is_active (w)))
2511	return;	2659	return;
		2660
		2661	EV_FREQUENT_CHECK;
2512		2662
2513	ev_start (EV_A_ (W)w, ++preparecnt);	2663	ev_start (EV_A_ (W)w, ++preparecnt);
2514	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);	2664	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2515	prepares [preparecnt - 1] = w;	2665	prepares [preparecnt - 1] = w;
		2666
		2667	EV_FREQUENT_CHECK;
2516	}	2668	}
2517		2669
2518	void	2670	void
2519	ev_prepare_stop (EV_P_ ev_prepare *w)	2671	ev_prepare_stop (EV_P_ ev_prepare *w)
2520	{	2672	{
2521	clear_pending (EV_A_ (W)w);	2673	clear_pending (EV_A_ (W)w);
2522	if (expect_false (!ev_is_active (w)))	2674	if (expect_false (!ev_is_active (w)))
2523	return;	2675	return;
2524		2676
		2677	EV_FREQUENT_CHECK;
		2678
2525	{	2679	{
2526	int active = ev_active (w);	2680	int active = ev_active (w);
2527		2681
2528	prepares [active - 1] = prepares [--preparecnt];	2682	prepares [active - 1] = prepares [--preparecnt];
2529	ev_active (prepares [active - 1]) = active;	2683	ev_active (prepares [active - 1]) = active;
2530	}	2684	}
2531		2685
2532	ev_stop (EV_A_ (W)w);	2686	ev_stop (EV_A_ (W)w);
		2687
		2688	EV_FREQUENT_CHECK;
2533	}	2689	}
2534		2690
2535	void	2691	void
2536	ev_check_start (EV_P_ ev_check *w)	2692	ev_check_start (EV_P_ ev_check *w)
2537	{	2693	{
2538	if (expect_false (ev_is_active (w)))	2694	if (expect_false (ev_is_active (w)))
2539	return;	2695	return;
		2696
		2697	EV_FREQUENT_CHECK;
2540		2698
2541	ev_start (EV_A_ (W)w, ++checkcnt);	2699	ev_start (EV_A_ (W)w, ++checkcnt);
2542	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);	2700	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2543	checks [checkcnt - 1] = w;	2701	checks [checkcnt - 1] = w;
		2702
		2703	EV_FREQUENT_CHECK;
2544	}	2704	}
2545		2705
2546	void	2706	void
2547	ev_check_stop (EV_P_ ev_check *w)	2707	ev_check_stop (EV_P_ ev_check *w)
2548	{	2708	{
2549	clear_pending (EV_A_ (W)w);	2709	clear_pending (EV_A_ (W)w);
2550	if (expect_false (!ev_is_active (w)))	2710	if (expect_false (!ev_is_active (w)))
2551	return;	2711	return;
2552		2712
		2713	EV_FREQUENT_CHECK;
		2714
2553	{	2715	{
2554	int active = ev_active (w);	2716	int active = ev_active (w);
2555		2717
2556	checks [active - 1] = checks [--checkcnt];	2718	checks [active - 1] = checks [--checkcnt];
2557	ev_active (checks [active - 1]) = active;	2719	ev_active (checks [active - 1]) = active;
2558	}	2720	}
2559		2721
2560	ev_stop (EV_A_ (W)w);	2722	ev_stop (EV_A_ (W)w);
		2723
		2724	EV_FREQUENT_CHECK;
2561	}	2725	}
2562		2726
2563	#if EV_EMBED_ENABLE	2727	#if EV_EMBED_ENABLE
2564	void noinline	2728	void noinline
2565	ev_embed_sweep (EV_P_ ev_embed *w)	2729	ev_embed_sweep (EV_P_ ev_embed *w)
…		…
2612	struct ev_loop *loop = w->other;	2776	struct ev_loop *loop = w->other;
2613	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));	2777	assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2614	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);	2778	ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2615	}	2779	}
2616		2780
		2781	EV_FREQUENT_CHECK;
		2782
2617	ev_set_priority (&w->io, ev_priority (w));	2783	ev_set_priority (&w->io, ev_priority (w));
2618	ev_io_start (EV_A_ &w->io);	2784	ev_io_start (EV_A_ &w->io);
2619		2785
2620	ev_prepare_init (&w->prepare, embed_prepare_cb);	2786	ev_prepare_init (&w->prepare, embed_prepare_cb);
2621	ev_set_priority (&w->prepare, EV_MINPRI);	2787	ev_set_priority (&w->prepare, EV_MINPRI);
2622	ev_prepare_start (EV_A_ &w->prepare);	2788	ev_prepare_start (EV_A_ &w->prepare);
2623		2789
2624	/ev_idle_init (&w->idle, e,bed_idle_cb);/	2790	/ev_idle_init (&w->idle, e,bed_idle_cb);/
2625		2791
2626	ev_start (EV_A_ (W)w, 1);	2792	ev_start (EV_A_ (W)w, 1);
		2793
		2794	EV_FREQUENT_CHECK;
2627	}	2795	}
2628		2796
2629	void	2797	void
2630	ev_embed_stop (EV_P_ ev_embed *w)	2798	ev_embed_stop (EV_P_ ev_embed *w)
2631	{	2799	{
2632	clear_pending (EV_A_ (W)w);	2800	clear_pending (EV_A_ (W)w);
2633	if (expect_false (!ev_is_active (w)))	2801	if (expect_false (!ev_is_active (w)))
2634	return;	2802	return;
2635		2803
		2804	EV_FREQUENT_CHECK;
		2805
2636	ev_io_stop (EV_A_ &w->io);	2806	ev_io_stop (EV_A_ &w->io);
2637	ev_prepare_stop (EV_A_ &w->prepare);	2807	ev_prepare_stop (EV_A_ &w->prepare);
2638		2808
2639	ev_stop (EV_A_ (W)w);	2809	ev_stop (EV_A_ (W)w);
		2810
		2811	EV_FREQUENT_CHECK;
2640	}	2812	}
2641	#endif	2813	#endif
2642		2814
2643	#if EV_FORK_ENABLE	2815	#if EV_FORK_ENABLE
2644	void	2816	void
2645	ev_fork_start (EV_P_ ev_fork *w)	2817	ev_fork_start (EV_P_ ev_fork *w)
2646	{	2818	{
2647	if (expect_false (ev_is_active (w)))	2819	if (expect_false (ev_is_active (w)))
2648	return;	2820	return;
		2821
		2822	EV_FREQUENT_CHECK;
2649		2823
2650	ev_start (EV_A_ (W)w, ++forkcnt);	2824	ev_start (EV_A_ (W)w, ++forkcnt);
2651	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);	2825	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2652	forks [forkcnt - 1] = w;	2826	forks [forkcnt - 1] = w;
		2827
		2828	EV_FREQUENT_CHECK;
2653	}	2829	}
2654		2830
2655	void	2831	void
2656	ev_fork_stop (EV_P_ ev_fork *w)	2832	ev_fork_stop (EV_P_ ev_fork *w)
2657	{	2833	{
2658	clear_pending (EV_A_ (W)w);	2834	clear_pending (EV_A_ (W)w);
2659	if (expect_false (!ev_is_active (w)))	2835	if (expect_false (!ev_is_active (w)))
2660	return;	2836	return;
2661		2837
		2838	EV_FREQUENT_CHECK;
		2839
2662	{	2840	{
2663	int active = ev_active (w);	2841	int active = ev_active (w);
2664		2842
2665	forks [active - 1] = forks [--forkcnt];	2843	forks [active - 1] = forks [--forkcnt];
2666	ev_active (forks [active - 1]) = active;	2844	ev_active (forks [active - 1]) = active;
2667	}	2845	}
2668		2846
2669	ev_stop (EV_A_ (W)w);	2847	ev_stop (EV_A_ (W)w);
		2848
		2849	EV_FREQUENT_CHECK;
2670	}	2850	}
2671	#endif	2851	#endif
2672		2852
2673	#if EV_ASYNC_ENABLE	2853	#if EV_ASYNC_ENABLE
2674	void	2854	void
…		…
2676	{	2856	{
2677	if (expect_false (ev_is_active (w)))	2857	if (expect_false (ev_is_active (w)))
2678	return;	2858	return;
2679		2859
2680	evpipe_init (EV_A);	2860	evpipe_init (EV_A);
		2861
		2862	EV_FREQUENT_CHECK;
2681		2863
2682	ev_start (EV_A_ (W)w, ++asynccnt);	2864	ev_start (EV_A_ (W)w, ++asynccnt);
2683	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);	2865	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2684	asyncs [asynccnt - 1] = w;	2866	asyncs [asynccnt - 1] = w;
		2867
		2868	EV_FREQUENT_CHECK;
2685	}	2869	}
2686		2870
2687	void	2871	void
2688	ev_async_stop (EV_P_ ev_async *w)	2872	ev_async_stop (EV_P_ ev_async *w)
2689	{	2873	{
2690	clear_pending (EV_A_ (W)w);	2874	clear_pending (EV_A_ (W)w);
2691	if (expect_false (!ev_is_active (w)))	2875	if (expect_false (!ev_is_active (w)))
2692	return;	2876	return;
2693		2877
		2878	EV_FREQUENT_CHECK;
		2879
2694	{	2880	{
2695	int active = ev_active (w);	2881	int active = ev_active (w);
2696		2882
2697	asyncs [active - 1] = asyncs [--asynccnt];	2883	asyncs [active - 1] = asyncs [--asynccnt];
2698	ev_active (asyncs [active - 1]) = active;	2884	ev_active (asyncs [active - 1]) = active;
2699	}	2885	}
2700		2886
2701	ev_stop (EV_A_ (W)w);	2887	ev_stop (EV_A_ (W)w);
		2888
		2889	EV_FREQUENT_CHECK;
2702	}	2890	}
2703		2891
2704	void	2892	void
2705	ev_async_send (EV_P_ ev_async *w)	2893	ev_async_send (EV_P_ ev_async *w)
2706	{	2894	{

Diff Legend

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

Comparing libev/ev.c (file contents): Revision 1.242 by root, Fri May 9 14:07:19 2008 UTC vs. Revision 1.249 by root, Wed May 21 23:30:52 2008 UTC

Diff Legend

Comparing libev/ev.c (file contents):
Revision 1.242 by root, Fri May 9 14:07:19 2008 UTC vs.
Revision 1.249 by root, Wed May 21 23:30:52 2008 UTC