[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.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
		250	#ifndef EV_USE_4HEAP
		251	# define EV_USE_4HEAP !EV_MINIMAL
		252	#endif
		253
		254	#ifndef EV_HEAP_CACHE_AT
		255	# define EV_HEAP_CACHE_AT !EV_MINIMAL
		256	#endif
		257
240	/* this block fixes any misconfiguration where we know we run into trouble otherwise */	258	/* this block fixes any misconfiguration where we know we run into trouble otherwise */
241		259
242	#ifndef CLOCK_MONOTONIC	260	#ifndef CLOCK_MONOTONIC
243	# undef EV_USE_MONOTONIC	261	# undef EV_USE_MONOTONIC
244	# define EV_USE_MONOTONIC 0	262	# define EV_USE_MONOTONIC 0
…		…
279	}	297	}
280	# endif	298	# endif
281	#endif	299	#endif
282		300
283	/**/	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
284		308
285	/*	309	/*
286	* This is used to avoid floating point rounding problems.	310	* This is used to avoid floating point rounding problems.
287	* It is added to ev_rt_now when scheduling periodics	311	* It is added to ev_rt_now when scheduling periodics
288	* to ensure progress, time-wise, even when rounding	312	* to ensure progress, time-wise, even when rounding
…		…
430	WL head;	454	WL head;
431	} ANFS;	455	} ANFS;
432	#endif	456	#endif
433		457
434	/* Heap Entry */	458	/* Heap Entry */
435	#define EV_HEAP_CACHE_AT 0
436	#if EV_HEAP_CACHE_AT	459	#if EV_HEAP_CACHE_AT
437	typedef struct {	460	typedef struct {
		461	ev_tstamp at;
438	WT w;	462	WT w;
439	ev_tstamp at;
440	} ANHE;	463	} ANHE;
441		464
442	#define ANHE_w(he) (he).w /* access watcher, read-write */	465	#define ANHE_w(he) (he).w /* access watcher, read-write */
443	#define ANHE_at(he) (he).at /* access cached at, read-only */	466	#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 */	467	#define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
445	#else	468	#else
446	typedef WT ANHE;	469	typedef WT ANHE;
447		470
448	#define ANHE_w(he) (he)	471	#define ANHE_w(he) (he)
449	#define ANHE_at(he) (he)->at	472	#define ANHE_at(he) (he)->at
450	#define ANHE_at_set(he)	473	#define ANHE_at_cache(he)
451	#endif	474	#endif
452		475
453	#if EV_MULTIPLICITY	476	#if EV_MULTIPLICITY
454		477
455	struct ev_loop	478	struct ev_loop
…		…
791	* at the moment we allow libev the luxury of two heaps,	814	* 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	815	* a small-code-size 2-heap one and a ~1.5kb larger 4-heap
793	* which is more cache-efficient.	816	* which is more cache-efficient.
794	* the difference is about 5% with 50000+ watchers.	817	* the difference is about 5% with 50000+ watchers.
795	*/	818	*/
796	#define EV_USE_4HEAP !EV_MINIMAL
797	#if EV_USE_4HEAP	819	#if EV_USE_4HEAP
798		820
799	#define DHEAP 4	821	#define DHEAP 4
800	#define HEAP0 (DHEAP - 1) /* index of first element in heap */	822	#define HEAP0 (DHEAP - 1) /* index of first element in heap */
801		823	#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
802	/* towards the root */	824	#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		825
824	/* away from the root */	826	/* away from the root */
825	void inline_speed	827	void inline_speed
826	downheap (ANHE *heap, int N, int k)	828	downheap (ANHE *heap, int N, int k)
827	{	829	{
…		…
830		832
831	for (;;)	833	for (;;)
832	{	834	{
833	ev_tstamp minat;	835	ev_tstamp minat;
834	ANHE *minpos;	836	ANHE *minpos;
835	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0;	837	ANHE pos = heap + DHEAP (k - HEAP0) + HEAP0 + 1;
836		838
837	// find minimum child	839	/* find minimum child */
838	if (expect_true (pos + DHEAP - 1 < E))	840	if (expect_true (pos + DHEAP - 1 < E))
839	{	841	{
840	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));	842	/* fast path / (minpos = pos + 0), (minat = ANHE_at (minpos));
841	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));
842	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));
843	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));
844	}	846	}
845	else if (pos < E)	847	else if (pos < E)
846	{	848	{
847	/* slow path / (minpos = pos + 0), (minat = ANHE_at (minpos));	849	/* 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));	850	if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
…		…
853	break;	855	break;
854		856
855	if (ANHE_at (he) <= minat)	857	if (ANHE_at (he) <= minat)
856	break;	858	break;
857		859
		860	heap [k] = *minpos;
858	ev_active (ANHE_w (*minpos)) = k;	861	ev_active (ANHE_w (*minpos)) = k;
859	heap [k] = *minpos;
860		862
861	k = minpos - heap;	863	k = minpos - heap;
862	}	864	}
863		865
		866	heap [k] = he;
864	ev_active (ANHE_w (he)) = k;	867	ev_active (ANHE_w (he)) = k;
865	heap [k] = he;
866	}	868	}
867		869
868	#else // 4HEAP	870	#else /* 4HEAP */
869		871
870	#define HEAP0 1	872	#define HEAP0 1
871		873	#define HPARENT(k) ((k) >> 1)
872	/* towards the root */	874	#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		875
895	/* away from the root */	876	/* away from the root */
896	void inline_speed	877	void inline_speed
897	downheap (ANHE *heap, int N, int k)	878	downheap (ANHE *heap, int N, int k)
898	{	879	{
…		…
900		881
901	for (;;)	882	for (;;)
902	{	883	{
903	int c = k << 1;	884	int c = k << 1;
904		885
905	if (c > N)	886	if (c > N + HEAP0 - 1)
906	break;	887	break;
907		888
908	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])
909	? 1 : 0;	890	? 1 : 0;
910		891
911	if (w->at <= ANHE_at (heap [c]))	892	if (ANHE_at (he) <= ANHE_at (heap [c]))
912	break;	893	break;
913		894
914	heap [k] = heap [c];	895	heap [k] = heap [c];
915	ev_active (ANHE_w (heap [k])) = k;	896	ev_active (ANHE_w (heap [k])) = k;
916		897
…		…
920	heap [k] = he;	901	heap [k] = he;
921	ev_active (ANHE_w (he)) = k;	902	ev_active (ANHE_w (he)) = k;
922	}	903	}
923	#endif	904	#endif
924		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
925	void inline_size	928	void inline_size
926	adjustheap (ANHE *heap, int N, int k)	929	adjustheap (ANHE *heap, int N, int k)
927	{	930	{
		931	if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
928	upheap (heap, k);	932	upheap (heap, k);
		933	else
929	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);
930	}	947	}
931		948
932	/*****************************************************************************/	949	/*****************************************************************************/
933		950
934	typedef struct	951	typedef struct
…		…
1452		1469
1453	postfork = 0;	1470	postfork = 0;
1454	}	1471	}
1455		1472
1456	#if EV_MULTIPLICITY	1473	#if EV_MULTIPLICITY
		1474
1457	struct ev_loop *	1475	struct ev_loop *
1458	ev_loop_new (unsigned int flags)	1476	ev_loop_new (unsigned int flags)
1459	{	1477	{
1460	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));
1461		1479
…		…
1479	void	1497	void
1480	ev_loop_fork (EV_P)	1498	ev_loop_fork (EV_P)
1481	{	1499	{
1482	postfork = 1; /* must be in line with ev_default_fork */	1500	postfork = 1; /* must be in line with ev_default_fork */
1483	}	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)
1484	#endif	1598	# endif
		1599	#endif
		1600	}
		1601
		1602	#endif /* multiplicity */
1485		1603
1486	#if EV_MULTIPLICITY	1604	#if EV_MULTIPLICITY
1487	struct ev_loop *	1605	struct ev_loop *
1488	ev_default_loop_init (unsigned int flags)	1606	ev_default_loop_init (unsigned int flags)
1489	#else	1607	#else
…		…
1565	{	1683	{
1566	/assert (("non-pending watcher on pending list", p->w->pending));/	1684	/assert (("non-pending watcher on pending list", p->w->pending));/
1567		1685
1568	p->w->pending = 0;	1686	p->w->pending = 0;
1569	EV_CB_INVOKE (p->w, p->events);	1687	EV_CB_INVOKE (p->w, p->events);
		1688	EV_FREQUENT_CHECK;
1570	}	1689	}
1571	}	1690	}
1572	}	1691	}
1573		1692
1574	#if EV_IDLE_ENABLE	1693	#if EV_IDLE_ENABLE
…		…
1595	#endif	1714	#endif
1596		1715
1597	void inline_size	1716	void inline_size
1598	timers_reify (EV_P)	1717	timers_reify (EV_P)
1599	{	1718	{
		1719	EV_FREQUENT_CHECK;
		1720
1600	while (timercnt && ANHE_at (timers [HEAP0]) <= mn_now)	1721	while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1601	{	1722	{
1602	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);	1723	ev_timer w = (ev_timer )ANHE_w (timers [HEAP0]);
1603		1724
1604	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/	1725	/assert (("inactive timer on timer heap detected", ev_is_active (w)));/
1605		1726
1606	/* first reschedule or stop timer */	1727	/* first reschedule or stop timer */
1607	if (w->repeat)	1728	if (w->repeat)
1608	{	1729	{
1609	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1610
1611	ev_at (w) += w->repeat;	1730	ev_at (w) += w->repeat;
1612	if (ev_at (w) < mn_now)	1731	if (ev_at (w) < mn_now)
1613	ev_at (w) = mn_now;	1732	ev_at (w) = mn_now;
1614		1733
		1734	assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
		1735
1615	ANHE_at_set (timers [HEAP0]);	1736	ANHE_at_cache (timers [HEAP0]);
1616	downheap (timers, timercnt, HEAP0);	1737	downheap (timers, timercnt, HEAP0);
1617	}	1738	}
1618	else	1739	else
1619	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */	1740	ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1620		1741
		1742	EV_FREQUENT_CHECK;
1621	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);	1743	ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1622	}	1744	}
1623	}	1745	}
1624		1746
1625	#if EV_PERIODIC_ENABLE	1747	#if EV_PERIODIC_ENABLE
1626	void inline_size	1748	void inline_size
1627	periodics_reify (EV_P)	1749	periodics_reify (EV_P)
1628	{	1750	{
		1751	EV_FREQUENT_CHECK;
		1752
1629	while (periodiccnt && ANHE_at (periodics [HEAP0]) <= ev_rt_now)	1753	while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1630	{	1754	{
1631	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);	1755	ev_periodic w = (ev_periodic )ANHE_w (periodics [HEAP0]);
1632		1756
1633	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/	1757	/assert (("inactive timer on periodic heap detected", ev_is_active (w)));/
1634		1758
1635	/* first reschedule or stop timer */	1759	/* first reschedule or stop timer */
1636	if (w->reschedule_cb)	1760	if (w->reschedule_cb)
1637	{	1761	{
1638	ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);	1762	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
		1763
1639	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));
		1765
1640	ANHE_at_set (periodics [HEAP0]);	1766	ANHE_at_cache (periodics [HEAP0]);
1641	downheap (periodics, periodiccnt, HEAP0);	1767	downheap (periodics, periodiccnt, HEAP0);
1642	}	1768	}
1643	else if (w->interval)	1769	else if (w->interval)
1644	{	1770	{
1645	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;
		1772	/* if next trigger time is not sufficiently in the future, put it there */
		1773	/* this might happen because of floating point inexactness */
1646	if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;	1774	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));	1775	{
		1776	ev_at (w) += w->interval;
		1777
		1778	/* if interval is unreasonably low we might still have a time in the past */
		1779	/* so correct this. this will make the periodic very inexact, but the user */
		1780	/* has effectively asked to get triggered more often than possible */
		1781	if (ev_at (w) < ev_rt_now)
		1782	ev_at (w) = ev_rt_now;
		1783	}
		1784
1648	ANHE_at_set (periodics [HEAP0]);	1785	ANHE_at_cache (periodics [HEAP0]);
1649	downheap (periodics, periodiccnt, HEAP0);	1786	downheap (periodics, periodiccnt, HEAP0);
1650	}	1787	}
1651	else	1788	else
1652	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */	1789	ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1653		1790
		1791	EV_FREQUENT_CHECK;
1654	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);	1792	ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1655	}	1793	}
1656	}	1794	}
1657		1795
1658	static void noinline	1796	static void noinline
…		…
1668	if (w->reschedule_cb)	1806	if (w->reschedule_cb)
1669	ev_at (w) = w->reschedule_cb (w, ev_rt_now);	1807	ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1670	else if (w->interval)	1808	else if (w->interval)
1671	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;
1672		1810
1673	ANHE_at_set (periodics [i]);	1811	ANHE_at_cache (periodics [i]);
1674	}	1812	}
1675		1813
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);	1814	reheap (periodics, periodiccnt);
1679	}	1815	}
1680	#endif	1816	#endif
1681		1817
1682	void inline_speed	1818	void inline_speed
1683	time_update (EV_P_ ev_tstamp max_block)	1819	time_update (EV_P_ ev_tstamp max_block)
…		…
1741	/* 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 */
1742	for (i = 0; i < timercnt; ++i)	1878	for (i = 0; i < timercnt; ++i)
1743	{	1879	{
1744	ANHE *he = timers + i + HEAP0;	1880	ANHE *he = timers + i + HEAP0;
1745	ANHE_w (*he)->at += ev_rt_now - mn_now;	1881	ANHE_w (*he)->at += ev_rt_now - mn_now;
1746	ANHE_at_set (*he);	1882	ANHE_at_cache (*he);
1747	}	1883	}
1748	}	1884	}
1749		1885
1750	mn_now = ev_rt_now;	1886	mn_now = ev_rt_now;
1751	}	1887	}
…		…
1772		1908
1773	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 */
1774		1910
1775	do	1911	do
1776	{	1912	{
		1913	#if EV_VERIFY >= 2
		1914	ev_loop_verify (EV_A);
		1915	#endif
		1916
1777	#ifndef _WIN32	1917	#ifndef _WIN32
1778	if (expect_false (curpid)) /* penalise the forking check even more */	1918	if (expect_false (curpid)) /* penalise the forking check even more */
1779	if (expect_false (getpid () != curpid))	1919	if (expect_false (getpid () != curpid))
1780	{	1920	{
1781	curpid = getpid ();	1921	curpid = getpid ();
…		…
1976	if (expect_false (ev_is_active (w)))	2116	if (expect_false (ev_is_active (w)))
1977	return;	2117	return;
1978		2118
1979	assert (("ev_io_start called with negative fd", fd >= 0));	2119	assert (("ev_io_start called with negative fd", fd >= 0));
1980		2120
		2121	EV_FREQUENT_CHECK;
		2122
1981	ev_start (EV_A_ (W)w, 1);	2123	ev_start (EV_A_ (W)w, 1);
1982	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);	2124	array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1983	wlist_add (&anfds[fd].head, (WL)w);	2125	wlist_add (&anfds[fd].head, (WL)w);
1984		2126
1985	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);	2127	fd_change (EV_A_ fd, w->events & EV_IOFDSET \| 1);
1986	w->events &= ~EV_IOFDSET;	2128	w->events &= ~EV_IOFDSET;
		2129
		2130	EV_FREQUENT_CHECK;
1987	}	2131	}
1988		2132
1989	void noinline	2133	void noinline
1990	ev_io_stop (EV_P_ ev_io *w)	2134	ev_io_stop (EV_P_ ev_io *w)
1991	{	2135	{
…		…
1993	if (expect_false (!ev_is_active (w)))	2137	if (expect_false (!ev_is_active (w)))
1994	return;	2138	return;
1995		2139
1996	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));
1997		2141
		2142	EV_FREQUENT_CHECK;
		2143
1998	wlist_del (&anfds[w->fd].head, (WL)w);	2144	wlist_del (&anfds[w->fd].head, (WL)w);
1999	ev_stop (EV_A_ (W)w);	2145	ev_stop (EV_A_ (W)w);
2000		2146
2001	fd_change (EV_A_ w->fd, 1);	2147	fd_change (EV_A_ w->fd, 1);
		2148
		2149	EV_FREQUENT_CHECK;
2002	}	2150	}
2003		2151
2004	void noinline	2152	void noinline
2005	ev_timer_start (EV_P_ ev_timer *w)	2153	ev_timer_start (EV_P_ ev_timer *w)
2006	{	2154	{
…		…
2009		2157
2010	ev_at (w) += mn_now;	2158	ev_at (w) += mn_now;
2011		2159
2012	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.));
2013		2161
		2162	EV_FREQUENT_CHECK;
		2163
		2164	++timercnt;
2014	ev_start (EV_A_ (W)w, ++timercnt + HEAP0 - 1);	2165	ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
2015	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);	2166	array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
2016	ANHE_w (timers [ev_active (w)]) = (WT)w;	2167	ANHE_w (timers [ev_active (w)]) = (WT)w;
2017	ANHE_at_set (timers [ev_active (w)]);	2168	ANHE_at_cache (timers [ev_active (w)]);
2018	upheap (timers, ev_active (w));	2169	upheap (timers, ev_active (w));
		2170
		2171	EV_FREQUENT_CHECK;
2019		2172
2020	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/	2173	/assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));/
2021	}	2174	}
2022		2175
2023	void noinline	2176	void noinline
…		…
2025	{	2178	{
2026	clear_pending (EV_A_ (W)w);	2179	clear_pending (EV_A_ (W)w);
2027	if (expect_false (!ev_is_active (w)))	2180	if (expect_false (!ev_is_active (w)))
2028	return;	2181	return;
2029		2182
		2183	EV_FREQUENT_CHECK;
		2184
2030	{	2185	{
2031	int active = ev_active (w);	2186	int active = ev_active (w);
2032		2187
2033	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));	2188	assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2034		2189
		2190	--timercnt;
		2191
2035	if (expect_true (active < timercnt + HEAP0 - 1))	2192	if (expect_true (active < timercnt + HEAP0))
2036	{	2193	{
2037	timers [active] = timers [timercnt + HEAP0 - 1];	2194	timers [active] = timers [timercnt + HEAP0];
2038	adjustheap (timers, timercnt, active);	2195	adjustheap (timers, timercnt, active);
2039	}	2196	}
2040
2041	--timercnt;
2042	}	2197	}
		2198
		2199	EV_FREQUENT_CHECK;
2043		2200
2044	ev_at (w) -= mn_now;	2201	ev_at (w) -= mn_now;
2045		2202
2046	ev_stop (EV_A_ (W)w);	2203	ev_stop (EV_A_ (W)w);
2047	}	2204	}
2048		2205
2049	void noinline	2206	void noinline
2050	ev_timer_again (EV_P_ ev_timer *w)	2207	ev_timer_again (EV_P_ ev_timer *w)
2051	{	2208	{
		2209	EV_FREQUENT_CHECK;
		2210
2052	if (ev_is_active (w))	2211	if (ev_is_active (w))
2053	{	2212	{
2054	if (w->repeat)	2213	if (w->repeat)
2055	{	2214	{
2056	ev_at (w) = mn_now + w->repeat;	2215	ev_at (w) = mn_now + w->repeat;
2057	ANHE_at_set (timers [ev_active (w)]);	2216	ANHE_at_cache (timers [ev_active (w)]);
2058	adjustheap (timers, timercnt, ev_active (w));	2217	adjustheap (timers, timercnt, ev_active (w));
2059	}	2218	}
2060	else	2219	else
2061	ev_timer_stop (EV_A_ w);	2220	ev_timer_stop (EV_A_ w);
2062	}	2221	}
2063	else if (w->repeat)	2222	else if (w->repeat)
2064	{	2223	{
2065	ev_at (w) = w->repeat;	2224	ev_at (w) = w->repeat;
2066	ev_timer_start (EV_A_ w);	2225	ev_timer_start (EV_A_ w);
2067	}	2226	}
		2227
		2228	EV_FREQUENT_CHECK;
2068	}	2229	}
2069		2230
2070	#if EV_PERIODIC_ENABLE	2231	#if EV_PERIODIC_ENABLE
2071	void noinline	2232	void noinline
2072	ev_periodic_start (EV_P_ ev_periodic *w)	2233	ev_periodic_start (EV_P_ ev_periodic *w)
…		…
2083	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;
2084	}	2245	}
2085	else	2246	else
2086	ev_at (w) = w->offset;	2247	ev_at (w) = w->offset;
2087		2248
		2249	EV_FREQUENT_CHECK;
		2250
		2251	++periodiccnt;
2088	ev_start (EV_A_ (W)w, ++periodiccnt + HEAP0 - 1);	2252	ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
2089	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);	2253	array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
2090	ANHE_w (periodics [ev_active (w)]) = (WT)w;	2254	ANHE_w (periodics [ev_active (w)]) = (WT)w;
		2255	ANHE_at_cache (periodics [ev_active (w)]);
2091	upheap (periodics, ev_active (w));	2256	upheap (periodics, ev_active (w));
		2257
		2258	EV_FREQUENT_CHECK;
2092		2259
2093	/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));/
2094	}	2261	}
2095		2262
2096	void noinline	2263	void noinline
…		…
2098	{	2265	{
2099	clear_pending (EV_A_ (W)w);	2266	clear_pending (EV_A_ (W)w);
2100	if (expect_false (!ev_is_active (w)))	2267	if (expect_false (!ev_is_active (w)))
2101	return;	2268	return;
2102		2269
		2270	EV_FREQUENT_CHECK;
		2271
2103	{	2272	{
2104	int active = ev_active (w);	2273	int active = ev_active (w);
2105		2274
2106	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));	2275	assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2107		2276
		2277	--periodiccnt;
		2278
2108	if (expect_true (active < periodiccnt + HEAP0 - 1))	2279	if (expect_true (active < periodiccnt + HEAP0))
2109	{	2280	{
2110	periodics [active] = periodics [periodiccnt + HEAP0 - 1];	2281	periodics [active] = periodics [periodiccnt + HEAP0];
2111	adjustheap (periodics, periodiccnt, active);	2282	adjustheap (periodics, periodiccnt, active);
2112	}	2283	}
2113
2114	--periodiccnt;
2115	}	2284	}
		2285
		2286	EV_FREQUENT_CHECK;
2116		2287
2117	ev_stop (EV_A_ (W)w);	2288	ev_stop (EV_A_ (W)w);
2118	}	2289	}
2119		2290
2120	void noinline	2291	void noinline
…		…
2140	return;	2311	return;
2141		2312
2142	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));
2143		2314
2144	evpipe_init (EV_A);	2315	evpipe_init (EV_A);
		2316
		2317	EV_FREQUENT_CHECK;
2145		2318
2146	{	2319	{
2147	#ifndef _WIN32	2320	#ifndef _WIN32
2148	sigset_t full, prev;	2321	sigset_t full, prev;
2149	sigfillset (&full);	2322	sigfillset (&full);
…		…
2170	sigfillset (&sa.sa_mask);	2343	sigfillset (&sa.sa_mask);
2171	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 */
2172	sigaction (w->signum, &sa, 0);	2345	sigaction (w->signum, &sa, 0);
2173	#endif	2346	#endif
2174	}	2347	}
		2348
		2349	EV_FREQUENT_CHECK;
2175	}	2350	}
2176		2351
2177	void noinline	2352	void noinline
2178	ev_signal_stop (EV_P_ ev_signal *w)	2353	ev_signal_stop (EV_P_ ev_signal *w)
2179	{	2354	{
2180	clear_pending (EV_A_ (W)w);	2355	clear_pending (EV_A_ (W)w);
2181	if (expect_false (!ev_is_active (w)))	2356	if (expect_false (!ev_is_active (w)))
2182	return;	2357	return;
2183		2358
		2359	EV_FREQUENT_CHECK;
		2360
2184	wlist_del (&signals [w->signum - 1].head, (WL)w);	2361	wlist_del (&signals [w->signum - 1].head, (WL)w);
2185	ev_stop (EV_A_ (W)w);	2362	ev_stop (EV_A_ (W)w);
2186		2363
2187	if (!signals [w->signum - 1].head)	2364	if (!signals [w->signum - 1].head)
2188	signal (w->signum, SIG_DFL);	2365	signal (w->signum, SIG_DFL);
		2366
		2367	EV_FREQUENT_CHECK;
2189	}	2368	}
2190		2369
2191	void	2370	void
2192	ev_child_start (EV_P_ ev_child *w)	2371	ev_child_start (EV_P_ ev_child *w)
2193	{	2372	{
…		…
2195	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));
2196	#endif	2375	#endif
2197	if (expect_false (ev_is_active (w)))	2376	if (expect_false (ev_is_active (w)))
2198	return;	2377	return;
2199		2378
		2379	EV_FREQUENT_CHECK;
		2380
2200	ev_start (EV_A_ (W)w, 1);	2381	ev_start (EV_A_ (W)w, 1);
2201	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;
2202	}	2385	}
2203		2386
2204	void	2387	void
2205	ev_child_stop (EV_P_ ev_child *w)	2388	ev_child_stop (EV_P_ ev_child *w)
2206	{	2389	{
2207	clear_pending (EV_A_ (W)w);	2390	clear_pending (EV_A_ (W)w);
2208	if (expect_false (!ev_is_active (w)))	2391	if (expect_false (!ev_is_active (w)))
2209	return;	2392	return;
2210		2393
		2394	EV_FREQUENT_CHECK;
		2395
2211	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);	2396	wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2212	ev_stop (EV_A_ (W)w);	2397	ev_stop (EV_A_ (W)w);
		2398
		2399	EV_FREQUENT_CHECK;
2213	}	2400	}
2214		2401
2215	#if EV_STAT_ENABLE	2402	#if EV_STAT_ENABLE
2216		2403
2217	# ifdef _WIN32	2404	# ifdef _WIN32
…		…
2445	else	2632	else
2446	#endif	2633	#endif
2447	ev_timer_start (EV_A_ &w->timer);	2634	ev_timer_start (EV_A_ &w->timer);
2448		2635
2449	ev_start (EV_A_ (W)w, 1);	2636	ev_start (EV_A_ (W)w, 1);
		2637
		2638	EV_FREQUENT_CHECK;
2450	}	2639	}
2451		2640
2452	void	2641	void
2453	ev_stat_stop (EV_P_ ev_stat *w)	2642	ev_stat_stop (EV_P_ ev_stat *w)
2454	{	2643	{
2455	clear_pending (EV_A_ (W)w);	2644	clear_pending (EV_A_ (W)w);
2456	if (expect_false (!ev_is_active (w)))	2645	if (expect_false (!ev_is_active (w)))
2457	return;	2646	return;
2458		2647
		2648	EV_FREQUENT_CHECK;
		2649
2459	#if EV_USE_INOTIFY	2650	#if EV_USE_INOTIFY
2460	infy_del (EV_A_ w);	2651	infy_del (EV_A_ w);
2461	#endif	2652	#endif
2462	ev_timer_stop (EV_A_ &w->timer);	2653	ev_timer_stop (EV_A_ &w->timer);
2463		2654
2464	ev_stop (EV_A_ (W)w);	2655	ev_stop (EV_A_ (W)w);
		2656
		2657	EV_FREQUENT_CHECK;
2465	}	2658	}
2466	#endif	2659	#endif
2467		2660
2468	#if EV_IDLE_ENABLE	2661	#if EV_IDLE_ENABLE
2469	void	2662	void
…		…
2471	{	2664	{
2472	if (expect_false (ev_is_active (w)))	2665	if (expect_false (ev_is_active (w)))
2473	return;	2666	return;
2474		2667
2475	pri_adjust (EV_A_ (W)w);	2668	pri_adjust (EV_A_ (W)w);
		2669
		2670	EV_FREQUENT_CHECK;
2476		2671
2477	{	2672	{
2478	int active = ++idlecnt [ABSPRI (w)];	2673	int active = ++idlecnt [ABSPRI (w)];
2479		2674
2480	++idleall;	2675	++idleall;
2481	ev_start (EV_A_ (W)w, active);	2676	ev_start (EV_A_ (W)w, active);
2482		2677
2483	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);
2484	idles [ABSPRI (w)][active - 1] = w;	2679	idles [ABSPRI (w)][active - 1] = w;
2485	}	2680	}
		2681
		2682	EV_FREQUENT_CHECK;
2486	}	2683	}
2487		2684
2488	void	2685	void
2489	ev_idle_stop (EV_P_ ev_idle *w)	2686	ev_idle_stop (EV_P_ ev_idle *w)
2490	{	2687	{
2491	clear_pending (EV_A_ (W)w);	2688	clear_pending (EV_A_ (W)w);
2492	if (expect_false (!ev_is_active (w)))	2689	if (expect_false (!ev_is_active (w)))
2493	return;	2690	return;
2494		2691
		2692	EV_FREQUENT_CHECK;
		2693
2495	{	2694	{
2496	int active = ev_active (w);	2695	int active = ev_active (w);
2497		2696
2498	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];	2697	idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2499	ev_active (idles [ABSPRI (w)][active - 1]) = active;	2698	ev_active (idles [ABSPRI (w)][active - 1]) = active;
2500		2699
2501	ev_stop (EV_A_ (W)w);	2700	ev_stop (EV_A_ (W)w);
2502	--idleall;	2701	--idleall;
2503	}	2702	}
		2703
		2704	EV_FREQUENT_CHECK;
2504	}	2705	}
2505	#endif	2706	#endif
2506		2707
2507	void	2708	void
2508	ev_prepare_start (EV_P_ ev_prepare *w)	2709	ev_prepare_start (EV_P_ ev_prepare *w)
2509	{	2710	{
2510	if (expect_false (ev_is_active (w)))	2711	if (expect_false (ev_is_active (w)))
2511	return;	2712	return;
		2713
		2714	EV_FREQUENT_CHECK;
2512		2715
2513	ev_start (EV_A_ (W)w, ++preparecnt);	2716	ev_start (EV_A_ (W)w, ++preparecnt);
2514	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);	2717	array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2515	prepares [preparecnt - 1] = w;	2718	prepares [preparecnt - 1] = w;
		2719
		2720	EV_FREQUENT_CHECK;
2516	}	2721	}
2517		2722
2518	void	2723	void
2519	ev_prepare_stop (EV_P_ ev_prepare *w)	2724	ev_prepare_stop (EV_P_ ev_prepare *w)
2520	{	2725	{
2521	clear_pending (EV_A_ (W)w);	2726	clear_pending (EV_A_ (W)w);
2522	if (expect_false (!ev_is_active (w)))	2727	if (expect_false (!ev_is_active (w)))
2523	return;	2728	return;
2524		2729
		2730	EV_FREQUENT_CHECK;
		2731
2525	{	2732	{
2526	int active = ev_active (w);	2733	int active = ev_active (w);
2527		2734
2528	prepares [active - 1] = prepares [--preparecnt];	2735	prepares [active - 1] = prepares [--preparecnt];
2529	ev_active (prepares [active - 1]) = active;	2736	ev_active (prepares [active - 1]) = active;
2530	}	2737	}
2531		2738
2532	ev_stop (EV_A_ (W)w);	2739	ev_stop (EV_A_ (W)w);
		2740
		2741	EV_FREQUENT_CHECK;
2533	}	2742	}
2534		2743
2535	void	2744	void
2536	ev_check_start (EV_P_ ev_check *w)	2745	ev_check_start (EV_P_ ev_check *w)
2537	{	2746	{
2538	if (expect_false (ev_is_active (w)))	2747	if (expect_false (ev_is_active (w)))
2539	return;	2748	return;
		2749
		2750	EV_FREQUENT_CHECK;
2540		2751
2541	ev_start (EV_A_ (W)w, ++checkcnt);	2752	ev_start (EV_A_ (W)w, ++checkcnt);
2542	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);	2753	array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2543	checks [checkcnt - 1] = w;	2754	checks [checkcnt - 1] = w;
		2755
		2756	EV_FREQUENT_CHECK;
2544	}	2757	}
2545		2758
2546	void	2759	void
2547	ev_check_stop (EV_P_ ev_check *w)	2760	ev_check_stop (EV_P_ ev_check *w)
2548	{	2761	{
2549	clear_pending (EV_A_ (W)w);	2762	clear_pending (EV_A_ (W)w);
2550	if (expect_false (!ev_is_active (w)))	2763	if (expect_false (!ev_is_active (w)))
2551	return;	2764	return;
2552		2765
		2766	EV_FREQUENT_CHECK;
		2767
2553	{	2768	{
2554	int active = ev_active (w);	2769	int active = ev_active (w);
2555		2770
2556	checks [active - 1] = checks [--checkcnt];	2771	checks [active - 1] = checks [--checkcnt];
2557	ev_active (checks [active - 1]) = active;	2772	ev_active (checks [active - 1]) = active;
2558	}	2773	}
2559		2774
2560	ev_stop (EV_A_ (W)w);	2775	ev_stop (EV_A_ (W)w);
		2776
		2777	EV_FREQUENT_CHECK;
2561	}	2778	}
2562		2779
2563	#if EV_EMBED_ENABLE	2780	#if EV_EMBED_ENABLE
2564	void noinline	2781	void noinline
2565	ev_embed_sweep (EV_P_ ev_embed *w)	2782	ev_embed_sweep (EV_P_ ev_embed *w)
…		…
2612	struct ev_loop *loop = w->other;	2829	struct ev_loop *loop = w->other;
2613	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 ()));
2614	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);
2615	}	2832	}
2616		2833
		2834	EV_FREQUENT_CHECK;
		2835
2617	ev_set_priority (&w->io, ev_priority (w));	2836	ev_set_priority (&w->io, ev_priority (w));
2618	ev_io_start (EV_A_ &w->io);	2837	ev_io_start (EV_A_ &w->io);
2619		2838
2620	ev_prepare_init (&w->prepare, embed_prepare_cb);	2839	ev_prepare_init (&w->prepare, embed_prepare_cb);
2621	ev_set_priority (&w->prepare, EV_MINPRI);	2840	ev_set_priority (&w->prepare, EV_MINPRI);
2622	ev_prepare_start (EV_A_ &w->prepare);	2841	ev_prepare_start (EV_A_ &w->prepare);
2623		2842
2624	/ev_idle_init (&w->idle, e,bed_idle_cb);/	2843	/ev_idle_init (&w->idle, e,bed_idle_cb);/
2625		2844
2626	ev_start (EV_A_ (W)w, 1);	2845	ev_start (EV_A_ (W)w, 1);
		2846
		2847	EV_FREQUENT_CHECK;
2627	}	2848	}
2628		2849
2629	void	2850	void
2630	ev_embed_stop (EV_P_ ev_embed *w)	2851	ev_embed_stop (EV_P_ ev_embed *w)
2631	{	2852	{
2632	clear_pending (EV_A_ (W)w);	2853	clear_pending (EV_A_ (W)w);
2633	if (expect_false (!ev_is_active (w)))	2854	if (expect_false (!ev_is_active (w)))
2634	return;	2855	return;
2635		2856
		2857	EV_FREQUENT_CHECK;
		2858
2636	ev_io_stop (EV_A_ &w->io);	2859	ev_io_stop (EV_A_ &w->io);
2637	ev_prepare_stop (EV_A_ &w->prepare);	2860	ev_prepare_stop (EV_A_ &w->prepare);
2638		2861
2639	ev_stop (EV_A_ (W)w);	2862	ev_stop (EV_A_ (W)w);
		2863
		2864	EV_FREQUENT_CHECK;
2640	}	2865	}
2641	#endif	2866	#endif
2642		2867
2643	#if EV_FORK_ENABLE	2868	#if EV_FORK_ENABLE
2644	void	2869	void
2645	ev_fork_start (EV_P_ ev_fork *w)	2870	ev_fork_start (EV_P_ ev_fork *w)
2646	{	2871	{
2647	if (expect_false (ev_is_active (w)))	2872	if (expect_false (ev_is_active (w)))
2648	return;	2873	return;
		2874
		2875	EV_FREQUENT_CHECK;
2649		2876
2650	ev_start (EV_A_ (W)w, ++forkcnt);	2877	ev_start (EV_A_ (W)w, ++forkcnt);
2651	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);	2878	array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2652	forks [forkcnt - 1] = w;	2879	forks [forkcnt - 1] = w;
		2880
		2881	EV_FREQUENT_CHECK;
2653	}	2882	}
2654		2883
2655	void	2884	void
2656	ev_fork_stop (EV_P_ ev_fork *w)	2885	ev_fork_stop (EV_P_ ev_fork *w)
2657	{	2886	{
2658	clear_pending (EV_A_ (W)w);	2887	clear_pending (EV_A_ (W)w);
2659	if (expect_false (!ev_is_active (w)))	2888	if (expect_false (!ev_is_active (w)))
2660	return;	2889	return;
2661		2890
		2891	EV_FREQUENT_CHECK;
		2892
2662	{	2893	{
2663	int active = ev_active (w);	2894	int active = ev_active (w);
2664		2895
2665	forks [active - 1] = forks [--forkcnt];	2896	forks [active - 1] = forks [--forkcnt];
2666	ev_active (forks [active - 1]) = active;	2897	ev_active (forks [active - 1]) = active;
2667	}	2898	}
2668		2899
2669	ev_stop (EV_A_ (W)w);	2900	ev_stop (EV_A_ (W)w);
		2901
		2902	EV_FREQUENT_CHECK;
2670	}	2903	}
2671	#endif	2904	#endif
2672		2905
2673	#if EV_ASYNC_ENABLE	2906	#if EV_ASYNC_ENABLE
2674	void	2907	void
…		…
2676	{	2909	{
2677	if (expect_false (ev_is_active (w)))	2910	if (expect_false (ev_is_active (w)))
2678	return;	2911	return;
2679		2912
2680	evpipe_init (EV_A);	2913	evpipe_init (EV_A);
		2914
		2915	EV_FREQUENT_CHECK;
2681		2916
2682	ev_start (EV_A_ (W)w, ++asynccnt);	2917	ev_start (EV_A_ (W)w, ++asynccnt);
2683	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);	2918	array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2684	asyncs [asynccnt - 1] = w;	2919	asyncs [asynccnt - 1] = w;
		2920
		2921	EV_FREQUENT_CHECK;
2685	}	2922	}
2686		2923
2687	void	2924	void
2688	ev_async_stop (EV_P_ ev_async *w)	2925	ev_async_stop (EV_P_ ev_async *w)
2689	{	2926	{
2690	clear_pending (EV_A_ (W)w);	2927	clear_pending (EV_A_ (W)w);
2691	if (expect_false (!ev_is_active (w)))	2928	if (expect_false (!ev_is_active (w)))
2692	return;	2929	return;
2693		2930
		2931	EV_FREQUENT_CHECK;
		2932
2694	{	2933	{
2695	int active = ev_active (w);	2934	int active = ev_active (w);
2696		2935
2697	asyncs [active - 1] = asyncs [--asynccnt];	2936	asyncs [active - 1] = asyncs [--asynccnt];
2698	ev_active (asyncs [active - 1]) = active;	2937	ev_active (asyncs [active - 1]) = active;
2699	}	2938	}
2700		2939
2701	ev_stop (EV_A_ (W)w);	2940	ev_stop (EV_A_ (W)w);
		2941
		2942	EV_FREQUENT_CHECK;
2702	}	2943	}
2703		2944
2704	void	2945	void
2705	ev_async_send (EV_P_ ev_async *w)	2946	ev_async_send (EV_P_ ev_async *w)
2706	{	2947	{

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.252 by root, Thu May 22 03:43:32 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.252 by root, Thu May 22 03:43:32 2008 UTC