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

Comparing libev/ev.pod (file contents):
Revision 1.239 by root, Tue Apr 21 14:14:19 2009 UTC vs.
Revision 1.260 by root, Sun Jul 19 21:18:03 2009 UTC

…		…
362	flag.	362	flag.
363		363
364	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	364	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365	environment variable.	365	environment variable.
366		366
		367	=item C<EVFLAG_NOINOTIFY>
		368
		369	When this flag is specified, then libev will not attempt to use the
		370	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
		371	testing, this flag can be useful to conserve inotify file descriptors, as
		372	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
		373
		374	=item C<EVFLAG_NOSIGNALFD>
		375
		376	When this flag is specified, then libev will not attempt to use the
		377	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This is
		378	probably only useful to work around any bugs in libev. Consequently, this
		379	flag might go away once the signalfd functionality is considered stable,
		380	so it's useful mostly in environment variables and not in program code.
		381
367	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	382	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368		383
369	This is your standard select(2) backend. Not I<completely> standard, as	384	This is your standard select(2) backend. Not I<completely> standard, as
370	libev tries to roll its own fd_set with no limits on the number of fds,	385	libev tries to roll its own fd_set with no limits on the number of fds,
371	but if that fails, expect a fairly low limit on the number of fds when	386	but if that fails, expect a fairly low limit on the number of fds when
…		…
518		533
519	It is definitely not recommended to use this flag.	534	It is definitely not recommended to use this flag.
520		535
521	=back	536	=back
522		537
523	If one or more of these are or'ed into the flags value, then only these	538	If one or more of the backend flags are or'ed into the flags value,
524	backends will be tried (in the reverse order as listed here). If none are	539	then only these backends will be tried (in the reverse order as listed
525	specified, all backends in C<ev_recommended_backends ()> will be tried.	540	here). If none are specified, all backends in C<ev_recommended_backends
		541	()> will be tried.
526		542
527	Example: This is the most typical usage.	543	Example: This is the most typical usage.
528		544
529	if (!ev_default_loop (0))	545	if (!ev_default_loop (0))
530	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	546	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
…		…
620	happily wraps around with enough iterations.	636	happily wraps around with enough iterations.
621		637
622	This value can sometimes be useful as a generation counter of sorts (it	638	This value can sometimes be useful as a generation counter of sorts (it
623	"ticks" the number of loop iterations), as it roughly corresponds with	639	"ticks" the number of loop iterations), as it roughly corresponds with
624	C<ev_prepare> and C<ev_check> calls.	640	C<ev_prepare> and C<ev_check> calls.
		641
		642	=item unsigned int ev_loop_depth (loop)
		643
		644	Returns the number of times C<ev_loop> was entered minus the number of
		645	times C<ev_loop> was exited, in other words, the recursion depth.
		646
		647	Outside C<ev_loop>, this number is zero. In a callback, this number is
		648	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
		649	in which case it is higher.
		650
		651	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
		652	etc.), doesn't count as exit.
625		653
626	=item unsigned int ev_backend (loop)	654	=item unsigned int ev_backend (loop)
627		655
628	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	656	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629	use.	657	use.
…		…
811		839
812	By setting a higher I<io collect interval> you allow libev to spend more	840	By setting a higher I<io collect interval> you allow libev to spend more
813	time collecting I/O events, so you can handle more events per iteration,	841	time collecting I/O events, so you can handle more events per iteration,
814	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	842	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
815	C<ev_timer>) will be not affected. Setting this to a non-null value will	843	C<ev_timer>) will be not affected. Setting this to a non-null value will
816	introduce an additional C<ev_sleep ()> call into most loop iterations.	844	introduce an additional C<ev_sleep ()> call into most loop iterations. The
		845	sleep time ensures that libev will not poll for I/O events more often then
		846	once per this interval, on average.
817		847
818	Likewise, by setting a higher I<timeout collect interval> you allow libev	848	Likewise, by setting a higher I<timeout collect interval> you allow libev
819	to spend more time collecting timeouts, at the expense of increased	849	to spend more time collecting timeouts, at the expense of increased
820	latency/jitter/inexactness (the watcher callback will be called	850	latency/jitter/inexactness (the watcher callback will be called
821	later). C<ev_io> watchers will not be affected. Setting this to a non-null	851	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
823		853
824	Many (busy) programs can usually benefit by setting the I/O collect	854	Many (busy) programs can usually benefit by setting the I/O collect
825	interval to a value near C<0.1> or so, which is often enough for	855	interval to a value near C<0.1> or so, which is often enough for
826	interactive servers (of course not for games), likewise for timeouts. It	856	interactive servers (of course not for games), likewise for timeouts. It
827	usually doesn't make much sense to set it to a lower value than C<0.01>,	857	usually doesn't make much sense to set it to a lower value than C<0.01>,
828	as this approaches the timing granularity of most systems.	858	as this approaches the timing granularity of most systems. Note that if
		859	you do transactions with the outside world and you can't increase the
		860	parallelity, then this setting will limit your transaction rate (if you
		861	need to poll once per transaction and the I/O collect interval is 0.01,
		862	then you can't do more than 100 transations per second).
829		863
830	Setting the I<timeout collect interval> can improve the opportunity for	864	Setting the I<timeout collect interval> can improve the opportunity for
831	saving power, as the program will "bundle" timer callback invocations that	865	saving power, as the program will "bundle" timer callback invocations that
832	are "near" in time together, by delaying some, thus reducing the number of	866	are "near" in time together, by delaying some, thus reducing the number of
833	times the process sleeps and wakes up again. Another useful technique to	867	times the process sleeps and wakes up again. Another useful technique to
834	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure	868	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
835	they fire on, say, one-second boundaries only.	869	they fire on, say, one-second boundaries only.
		870
		871	Example: we only need 0.1s timeout granularity, and we wish not to poll
		872	more often than 100 times per second:
		873
		874	ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
		875	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
		876
		877	=item ev_invoke_pending (loop)
		878
		879	This call will simply invoke all pending watchers while resetting their
		880	pending state. Normally, C<ev_loop> does this automatically when required,
		881	but when overriding the invoke callback this call comes handy.
		882
		883	=item int ev_pending_count (loop)
		884
		885	Returns the number of pending watchers - zero indicates that no watchers
		886	are pending.
		887
		888	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
		889
		890	This overrides the invoke pending functionality of the loop: Instead of
		891	invoking all pending watchers when there are any, C<ev_loop> will call
		892	this callback instead. This is useful, for example, when you want to
		893	invoke the actual watchers inside another context (another thread etc.).
		894
		895	If you want to reset the callback, use C<ev_invoke_pending> as new
		896	callback.
		897
		898	=item ev_set_loop_release_cb (loop, void (release)(EV_P), void (acquire)(EV_P))
		899
		900	Sometimes you want to share the same loop between multiple threads. This
		901	can be done relatively simply by putting mutex_lock/unlock calls around
		902	each call to a libev function.
		903
		904	However, C<ev_loop> can run an indefinite time, so it is not feasible to
		905	wait for it to return. One way around this is to wake up the loop via
		906	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
		907	and I<acquire> callbacks on the loop.
		908
		909	When set, then C<release> will be called just before the thread is
		910	suspended waiting for new events, and C<acquire> is called just
		911	afterwards.
		912
		913	Ideally, C<release> will just call your mutex_unlock function, and
		914	C<acquire> will just call the mutex_lock function again.
		915
		916	While event loop modifications are allowed between invocations of
		917	C<release> and C<acquire> (that's their only purpose after all), no
		918	modifications done will affect the event loop, i.e. adding watchers will
		919	have no effect on the set of file descriptors being watched, or the time
		920	waited. USe an C<ev_async> watcher to wake up C<ev_loop> when you want it
		921	to take note of any changes you made.
		922
		923	In theory, threads executing C<ev_loop> will be async-cancel safe between
		924	invocations of C<release> and C<acquire>.
		925
		926	See also the locking example in the C<THREADS> section later in this
		927	document.
		928
		929	=item ev_set_userdata (loop, void *data)
		930
		931	=item ev_userdata (loop)
		932
		933	Set and retrieve a single C<void *> associated with a loop. When
		934	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
		935	C<0.>
		936
		937	These two functions can be used to associate arbitrary data with a loop,
		938	and are intended solely for the C<invoke_pending_cb>, C<release> and
		939	C<acquire> callbacks described above, but of course can be (ab-)used for
		940	any other purpose as well.
836		941
837	=item ev_loop_verify (loop)	942	=item ev_loop_verify (loop)
838		943
839	This function only does something when C<EV_VERIFY> support has been	944	This function only does something when C<EV_VERIFY> support has been
840	compiled in, which is the default for non-minimal builds. It tries to go	945	compiled in, which is the default for non-minimal builds. It tries to go
…		…
1184	#include <stddef.h>	1289	#include <stddef.h>
1185		1290
1186	static void	1291	static void
1187	t1_cb (EV_P_ ev_timer *w, int revents)	1292	t1_cb (EV_P_ ev_timer *w, int revents)
1188	{	1293	{
1189	struct my_biggy big = (struct my_biggy *	1294	struct my_biggy big = (struct my_biggy *)
1190	(((char *)w) - offsetof (struct my_biggy, t1));	1295	(((char *)w) - offsetof (struct my_biggy, t1));
1191	}	1296	}
1192		1297
1193	static void	1298	static void
1194	t2_cb (EV_P_ ev_timer *w, int revents)	1299	t2_cb (EV_P_ ev_timer *w, int revents)
1195	{	1300	{
1196	struct my_biggy big = (struct my_biggy *	1301	struct my_biggy big = (struct my_biggy *)
1197	(((char *)w) - offsetof (struct my_biggy, t2));	1302	(((char *)w) - offsetof (struct my_biggy, t2));
1198	}	1303	}
1199		1304
1200	=head2 WATCHER PRIORITY MODELS	1305	=head2 WATCHER PRIORITY MODELS
1201		1306
…		…
1277	// with the default priority are receiving events.	1382	// with the default priority are receiving events.
1278	ev_idle_start (EV_A_ &idle);	1383	ev_idle_start (EV_A_ &idle);
1279	}	1384	}
1280		1385
1281	static void	1386	static void
1282	idle-cb (EV_P_ ev_idle *w, int revents)	1387	idle_cb (EV_P_ ev_idle *w, int revents)
1283	{	1388	{
1284	// actual processing	1389	// actual processing
1285	read (STDIN_FILENO, ...);	1390	read (STDIN_FILENO, ...);
1286		1391
1287	// have to start the I/O watcher again, as	1392	// have to start the I/O watcher again, as
…		…
1465	year, it will still time out after (roughly) one hour. "Roughly" because	1570	year, it will still time out after (roughly) one hour. "Roughly" because
1466	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1571	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1467	monotonic clock option helps a lot here).	1572	monotonic clock option helps a lot here).
1468		1573
1469	The callback is guaranteed to be invoked only I<after> its timeout has	1574	The callback is guaranteed to be invoked only I<after> its timeout has
1470	passed. If multiple timers become ready during the same loop iteration	1575	passed (not I<at>, so on systems with very low-resolution clocks this
1471	then the ones with earlier time-out values are invoked before ones with	1576	might introduce a small delay). If multiple timers become ready during the
1472	later time-out values (but this is no longer true when a callback calls	1577	same loop iteration then the ones with earlier time-out values are invoked
1473	C<ev_loop> recursively).	1578	before ones of the same priority with later time-out values (but this is
		1579	no longer true when a callback calls C<ev_loop> recursively).
1474		1580
1475	=head3 Be smart about timeouts	1581	=head3 Be smart about timeouts
1476		1582
1477	Many real-world problems involve some kind of timeout, usually for error	1583	Many real-world problems involve some kind of timeout, usually for error
1478	recovery. A typical example is an HTTP request - if the other side hangs,	1584	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1522	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>	1628	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1523	member and C<ev_timer_again>.	1629	member and C<ev_timer_again>.
1524		1630
1525	At start:	1631	At start:
1526		1632
1527	ev_timer_init (timer, callback);	1633	ev_init (timer, callback);
1528	timer->repeat = 60.;	1634	timer->repeat = 60.;
1529	ev_timer_again (loop, timer);	1635	ev_timer_again (loop, timer);
1530		1636
1531	Each time there is some activity:	1637	Each time there is some activity:
1532		1638
…		…
1594		1700
1595	To start the timer, simply initialise the watcher and set C<last_activity>	1701	To start the timer, simply initialise the watcher and set C<last_activity>
1596	to the current time (meaning we just have some activity :), then call the	1702	to the current time (meaning we just have some activity :), then call the
1597	callback, which will "do the right thing" and start the timer:	1703	callback, which will "do the right thing" and start the timer:
1598		1704
1599	ev_timer_init (timer, callback);	1705	ev_init (timer, callback);
1600	last_activity = ev_now (loop);	1706	last_activity = ev_now (loop);
1601	callback (loop, timer, EV_TIMEOUT);	1707	callback (loop, timer, EV_TIMEOUT);
1602		1708
1603	And when there is some activity, simply store the current time in	1709	And when there is some activity, simply store the current time in
1604	C<last_activity>, no libev calls at all:	1710	C<last_activity>, no libev calls at all:
…		…
1665		1771
1666	If the event loop is suspended for a long time, you can also force an	1772	If the event loop is suspended for a long time, you can also force an
1667	update of the time returned by C<ev_now ()> by calling C<ev_now_update	1773	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1668	()>.	1774	()>.
1669		1775
		1776	=head3 The special problems of suspended animation
		1777
		1778	When you leave the server world it is quite customary to hit machines that
		1779	can suspend/hibernate - what happens to the clocks during such a suspend?
		1780
		1781	Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
		1782	all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
		1783	to run until the system is suspended, but they will not advance while the
		1784	system is suspended. That means, on resume, it will be as if the program
		1785	was frozen for a few seconds, but the suspend time will not be counted
		1786	towards C<ev_timer> when a monotonic clock source is used. The real time
		1787	clock advanced as expected, but if it is used as sole clocksource, then a
		1788	long suspend would be detected as a time jump by libev, and timers would
		1789	be adjusted accordingly.
		1790
		1791	I would not be surprised to see different behaviour in different between
		1792	operating systems, OS versions or even different hardware.
		1793
		1794	The other form of suspend (job control, or sending a SIGSTOP) will see a
		1795	time jump in the monotonic clocks and the realtime clock. If the program
		1796	is suspended for a very long time, and monotonic clock sources are in use,
		1797	then you can expect C<ev_timer>s to expire as the full suspension time
		1798	will be counted towards the timers. When no monotonic clock source is in
		1799	use, then libev will again assume a timejump and adjust accordingly.
		1800
		1801	It might be beneficial for this latter case to call C<ev_suspend>
		1802	and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
		1803	deterministic behaviour in this case (you can do nothing against
		1804	C<SIGSTOP>).
		1805
1670	=head3 Watcher-Specific Functions and Data Members	1806	=head3 Watcher-Specific Functions and Data Members
1671		1807
1672	=over 4	1808	=over 4
1673		1809
1674	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1810	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
…		…
1699	If the timer is repeating, either start it if necessary (with the	1835	If the timer is repeating, either start it if necessary (with the
1700	C<repeat> value), or reset the running timer to the C<repeat> value.	1836	C<repeat> value), or reset the running timer to the C<repeat> value.
1701		1837
1702	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	1838	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1703	usage example.	1839	usage example.
		1840
		1841	=item ev_timer_remaining (loop, ev_timer *)
		1842
		1843	Returns the remaining time until a timer fires. If the timer is active,
		1844	then this time is relative to the current event loop time, otherwise it's
		1845	the timeout value currently configured.
		1846
		1847	That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
		1848	C<5>. When the timer is started and one second passes, C<ev_timer_remain>
		1849	will return C<4>. When the timer expires and is restarted, it will return
		1850	roughly C<7> (likely slightly less as callback invocation takes some time,
		1851	too), and so on.
1704		1852
1705	=item ev_tstamp repeat [read-write]	1853	=item ev_tstamp repeat [read-write]
1706		1854
1707	The current C<repeat> value. Will be used each time the watcher times out	1855	The current C<repeat> value. Will be used each time the watcher times out
1708	or C<ev_timer_again> is called, and determines the next timeout (if any),	1856	or C<ev_timer_again> is called, and determines the next timeout (if any),
…		…
1944	Signal watchers will trigger an event when the process receives a specific	2092	Signal watchers will trigger an event when the process receives a specific
1945	signal one or more times. Even though signals are very asynchronous, libev	2093	signal one or more times. Even though signals are very asynchronous, libev
1946	will try it's best to deliver signals synchronously, i.e. as part of the	2094	will try it's best to deliver signals synchronously, i.e. as part of the
1947	normal event processing, like any other event.	2095	normal event processing, like any other event.
1948		2096
1949	If you want signals asynchronously, just use C<sigaction> as you would	2097	If you want signals to be delivered truly asynchronously, just use
1950	do without libev and forget about sharing the signal. You can even use	2098	C<sigaction> as you would do without libev and forget about sharing
1951	C<ev_async> from a signal handler to synchronously wake up an event loop.	2099	the signal. You can even use C<ev_async> from a signal handler to
		2100	synchronously wake up an event loop.
1952		2101
1953	You can configure as many watchers as you like per signal. Only when the	2102	You can configure as many watchers as you like for the same signal, but
		2103	only within the same loop, i.e. you can watch for C<SIGINT> in your
		2104	default loop and for C<SIGIO> in another loop, but you cannot watch for
		2105	C<SIGINT> in both the default loop and another loop at the same time. At
		2106	the moment, C<SIGCHLD> is permanently tied to the default loop.
		2107
1954	first watcher gets started will libev actually register a signal handler	2108	When the first watcher gets started will libev actually register something
1955	with the kernel (thus it coexists with your own signal handlers as long as	2109	with the kernel (thus it coexists with your own signal handlers as long as
1956	you don't register any with libev for the same signal). Similarly, when	2110	you don't register any with libev for the same signal).
1957	the last signal watcher for a signal is stopped, libev will reset the	2111
1958	signal handler to SIG_DFL (regardless of what it was set to before).	2112	Both the signal mask state (C<sigprocmask>) and the signal handler state
		2113	(C<sigaction>) are unspecified after starting a signal watcher (and after
		2114	sotpping it again), that is, libev might or might not block the signal,
		2115	and might or might not set or restore the installed signal handler.
1959		2116
1960	If possible and supported, libev will install its handlers with	2117	If possible and supported, libev will install its handlers with
1961	C<SA_RESTART> behaviour enabled, so system calls should not be unduly	2118	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1962	interrupted. If you have a problem with system calls getting interrupted by	2119	not be unduly interrupted. If you have a problem with system calls getting
1963	signals you can block all signals in an C<ev_check> watcher and unblock	2120	interrupted by signals you can block all signals in an C<ev_check> watcher
1964	them in an C<ev_prepare> watcher.	2121	and unblock them in an C<ev_prepare> watcher.
1965		2122
1966	=head3 Watcher-Specific Functions and Data Members	2123	=head3 Watcher-Specific Functions and Data Members
1967		2124
1968	=over 4	2125	=over 4
1969		2126
…		…
2001	some child status changes (most typically when a child of yours dies or	2158	some child status changes (most typically when a child of yours dies or
2002	exits). It is permissible to install a child watcher I<after> the child	2159	exits). It is permissible to install a child watcher I<after> the child
2003	has been forked (which implies it might have already exited), as long	2160	has been forked (which implies it might have already exited), as long
2004	as the event loop isn't entered (or is continued from a watcher), i.e.,	2161	as the event loop isn't entered (or is continued from a watcher), i.e.,
2005	forking and then immediately registering a watcher for the child is fine,	2162	forking and then immediately registering a watcher for the child is fine,
2006	but forking and registering a watcher a few event loop iterations later is	2163	but forking and registering a watcher a few event loop iterations later or
2007	not.	2164	in the next callback invocation is not.
2008		2165
2009	Only the default event loop is capable of handling signals, and therefore	2166	Only the default event loop is capable of handling signals, and therefore
2010	you can only register child watchers in the default event loop.	2167	you can only register child watchers in the default event loop.
2011		2168
		2169	Due to some design glitches inside libev, child watchers will always be
		2170	handled at maximum priority (their priority is set to C<EV_MAXPRI> by
		2171	libev)
		2172
2012	=head3 Process Interaction	2173	=head3 Process Interaction
2013		2174
2014	Libev grabs C<SIGCHLD> as soon as the default event loop is	2175	Libev grabs C<SIGCHLD> as soon as the default event loop is
2015	initialised. This is necessary to guarantee proper behaviour even if	2176	initialised. This is necessary to guarantee proper behaviour even if the
2016	the first child watcher is started after the child exits. The occurrence	2177	first child watcher is started after the child exits. The occurrence
2017	of C<SIGCHLD> is recorded asynchronously, but child reaping is done	2178	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2018	synchronously as part of the event loop processing. Libev always reaps all	2179	synchronously as part of the event loop processing. Libev always reaps all
2019	children, even ones not watched.	2180	children, even ones not watched.
2020		2181
2021	=head3 Overriding the Built-In Processing	2182	=head3 Overriding the Built-In Processing
…		…
2031	=head3 Stopping the Child Watcher	2192	=head3 Stopping the Child Watcher
2032		2193
2033	Currently, the child watcher never gets stopped, even when the	2194	Currently, the child watcher never gets stopped, even when the
2034	child terminates, so normally one needs to stop the watcher in the	2195	child terminates, so normally one needs to stop the watcher in the
2035	callback. Future versions of libev might stop the watcher automatically	2196	callback. Future versions of libev might stop the watcher automatically
2036	when a child exit is detected.	2197	when a child exit is detected (calling C<ev_child_stop> twice is not a
		2198	problem).
2037		2199
2038	=head3 Watcher-Specific Functions and Data Members	2200	=head3 Watcher-Specific Functions and Data Members
2039		2201
2040	=over 4	2202	=over 4
2041		2203
…		…
2367	// no longer anything immediate to do.	2529	// no longer anything immediate to do.
2368	}	2530	}
2369		2531
2370	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2532	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2371	ev_idle_init (idle_watcher, idle_cb);	2533	ev_idle_init (idle_watcher, idle_cb);
2372	ev_idle_start (loop, idle_cb);	2534	ev_idle_start (loop, idle_watcher);
2373		2535
2374		2536
2375	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2537	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2376		2538
2377	Prepare and check watchers are usually (but not always) used in pairs:	2539	Prepare and check watchers are usually (but not always) used in pairs:
…		…
2470	struct pollfd fds [nfd];	2632	struct pollfd fds [nfd];
2471	// actual code will need to loop here and realloc etc.	2633	// actual code will need to loop here and realloc etc.
2472	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2634	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2473		2635
2474	/* the callback is illegal, but won't be called as we stop during check */	2636	/* the callback is illegal, but won't be called as we stop during check */
2475	ev_timer_init (&tw, 0, timeout * 1e-3);	2637	ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2476	ev_timer_start (loop, &tw);	2638	ev_timer_start (loop, &tw);
2477		2639
2478	// create one ev_io per pollfd	2640	// create one ev_io per pollfd
2479	for (int i = 0; i < nfd; ++i)	2641	for (int i = 0; i < nfd; ++i)
2480	{	2642	{
…		…
3642	defined to be C<0>, then they are not.	3804	defined to be C<0>, then they are not.
3643		3805
3644	=item EV_MINIMAL	3806	=item EV_MINIMAL
3645		3807
3646	If you need to shave off some kilobytes of code at the expense of some	3808	If you need to shave off some kilobytes of code at the expense of some
3647	speed, define this symbol to C<1>. Currently this is used to override some	3809	speed (but with the full API), define this symbol to C<1>. Currently this
3648	inlining decisions, saves roughly 30% code size on amd64. It also selects a	3810	is used to override some inlining decisions, saves roughly 30% code size
3649	much smaller 2-heap for timer management over the default 4-heap.	3811	on amd64. It also selects a much smaller 2-heap for timer management over
		3812	the default 4-heap.
		3813
		3814	You can save even more by disabling watcher types you do not need
		3815	and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert>
		3816	(C<-DNDEBUG>) will usually reduce code size a lot.
		3817
		3818	Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to
		3819	provide a bare-bones event library. See C<ev.h> for details on what parts
		3820	of the API are still available, and do not complain if this subset changes
		3821	over time.
		3822
		3823	=item EV_NSIG
		3824
		3825	The highest supported signal number, +1 (or, the number of
		3826	signals): Normally, libev tries to deduce the maximum number of signals
		3827	automatically, but sometimes this fails, in which case it can be
		3828	specified. Also, using a lower number than detected (C<32> should be
		3829	good for about any system in existance) can save some memory, as libev
		3830	statically allocates some 12-24 bytes per signal number.
3650		3831
3651	=item EV_PID_HASHSIZE	3832	=item EV_PID_HASHSIZE
3652		3833
3653	C<ev_child> watchers use a small hash table to distribute workload by	3834	C<ev_child> watchers use a small hash table to distribute workload by
3654	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	3835	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
…		…
3840	default loop and triggering an C<ev_async> watcher from the default loop	4021	default loop and triggering an C<ev_async> watcher from the default loop
3841	watcher callback into the event loop interested in the signal.	4022	watcher callback into the event loop interested in the signal.
3842		4023
3843	=back	4024	=back
3844		4025
		4026	=head4 THREAD LOCKING EXAMPLE
		4027
		4028	Here is a fictitious example of how to run an event loop in a different
		4029	thread than where callbacks are being invoked and watchers are
		4030	created/added/removed.
		4031
		4032	For a real-world example, see the C<EV::Loop::Async> perl module,
		4033	which uses exactly this technique (which is suited for many high-level
		4034	languages).
		4035
		4036	The example uses a pthread mutex to protect the loop data, a condition
		4037	variable to wait for callback invocations, an async watcher to notify the
		4038	event loop thread and an unspecified mechanism to wake up the main thread.
		4039
		4040	First, you need to associate some data with the event loop:
		4041
		4042	typedef struct {
		4043	mutex_t lock; /* global loop lock */
		4044	ev_async async_w;
		4045	thread_t tid;
		4046	cond_t invoke_cv;
		4047	} userdata;
		4048
		4049	void prepare_loop (EV_P)
		4050	{
		4051	// for simplicity, we use a static userdata struct.
		4052	static userdata u;
		4053
		4054	ev_async_init (&u->async_w, async_cb);
		4055	ev_async_start (EV_A_ &u->async_w);
		4056
		4057	pthread_mutex_init (&u->lock, 0);
		4058	pthread_cond_init (&u->invoke_cv, 0);
		4059
		4060	// now associate this with the loop
		4061	ev_set_userdata (EV_A_ u);
		4062	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		4063	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		4064
		4065	// then create the thread running ev_loop
		4066	pthread_create (&u->tid, 0, l_run, EV_A);
		4067	}
		4068
		4069	The callback for the C<ev_async> watcher does nothing: the watcher is used
		4070	solely to wake up the event loop so it takes notice of any new watchers
		4071	that might have been added:
		4072
		4073	static void
		4074	async_cb (EV_P_ ev_async *w, int revents)
		4075	{
		4076	// just used for the side effects
		4077	}
		4078
		4079	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		4080	protecting the loop data, respectively.
		4081
		4082	static void
		4083	l_release (EV_P)
		4084	{
		4085	userdata *u = ev_userdata (EV_A);
		4086	pthread_mutex_unlock (&u->lock);
		4087	}
		4088
		4089	static void
		4090	l_acquire (EV_P)
		4091	{
		4092	userdata *u = ev_userdata (EV_A);
		4093	pthread_mutex_lock (&u->lock);
		4094	}
		4095
		4096	The event loop thread first acquires the mutex, and then jumps straight
		4097	into C<ev_loop>:
		4098
		4099	void *
		4100	l_run (void *thr_arg)
		4101	{
		4102	struct ev_loop loop = (struct ev_loop )thr_arg;
		4103
		4104	l_acquire (EV_A);
		4105	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		4106	ev_loop (EV_A_ 0);
		4107	l_release (EV_A);
		4108
		4109	return 0;
		4110	}
		4111
		4112	Instead of invoking all pending watchers, the C<l_invoke> callback will
		4113	signal the main thread via some unspecified mechanism (signals? pipe
		4114	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		4115	have been called (in a while loop because a) spurious wakeups are possible
		4116	and b) skipping inter-thread-communication when there are no pending
		4117	watchers is very beneficial):
		4118
		4119	static void
		4120	l_invoke (EV_P)
		4121	{
		4122	userdata *u = ev_userdata (EV_A);
		4123
		4124	while (ev_pending_count (EV_A))
		4125	{
		4126	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		4127	pthread_cond_wait (&u->invoke_cv, &u->lock);
		4128	}
		4129	}
		4130
		4131	Now, whenever the main thread gets told to invoke pending watchers, it
		4132	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		4133	thread to continue:
		4134
		4135	static void
		4136	real_invoke_pending (EV_P)
		4137	{
		4138	userdata *u = ev_userdata (EV_A);
		4139
		4140	pthread_mutex_lock (&u->lock);
		4141	ev_invoke_pending (EV_A);
		4142	pthread_cond_signal (&u->invoke_cv);
		4143	pthread_mutex_unlock (&u->lock);
		4144	}
		4145
		4146	Whenever you want to start/stop a watcher or do other modifications to an
		4147	event loop, you will now have to lock:
		4148
		4149	ev_timer timeout_watcher;
		4150	userdata *u = ev_userdata (EV_A);
		4151
		4152	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		4153
		4154	pthread_mutex_lock (&u->lock);
		4155	ev_timer_start (EV_A_ &timeout_watcher);
		4156	ev_async_send (EV_A_ &u->async_w);
		4157	pthread_mutex_unlock (&u->lock);
		4158
		4159	Note that sending the C<ev_async> watcher is required because otherwise
		4160	an event loop currently blocking in the kernel will have no knowledge
		4161	about the newly added timer. By waking up the loop it will pick up any new
		4162	watchers in the next event loop iteration.
		4163
3845	=head3 COROUTINES	4164	=head3 COROUTINES
3846		4165
3847	Libev is very accommodating to coroutines ("cooperative threads"):	4166	Libev is very accommodating to coroutines ("cooperative threads"):
3848	libev fully supports nesting calls to its functions from different	4167	libev fully supports nesting calls to its functions from different
3849	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4168	coroutines (e.g. you can call C<ev_loop> on the same loop from two
3850	different coroutines, and switch freely between both coroutines running the	4169	different coroutines, and switch freely between both coroutines running
3851	loop, as long as you don't confuse yourself). The only exception is that	4170	the loop, as long as you don't confuse yourself). The only exception is
3852	you must not do this from C<ev_periodic> reschedule callbacks.	4171	that you must not do this from C<ev_periodic> reschedule callbacks.
3853		4172
3854	Care has been taken to ensure that libev does not keep local state inside	4173	Care has been taken to ensure that libev does not keep local state inside
3855	C<ev_loop>, and other calls do not usually allow for coroutine switches as	4174	C<ev_loop>, and other calls do not usually allow for coroutine switches as
3856	they do not call any callbacks.	4175	they do not call any callbacks.
3857		4176
…		…
3934	way (note also that glib is the slowest event library known to man).	4253	way (note also that glib is the slowest event library known to man).
3935		4254
3936	There is no supported compilation method available on windows except	4255	There is no supported compilation method available on windows except
3937	embedding it into other applications.	4256	embedding it into other applications.
3938		4257
		4258	Sensible signal handling is officially unsupported by Microsoft - libev
		4259	tries its best, but under most conditions, signals will simply not work.
		4260
3939	Not a libev limitation but worth mentioning: windows apparently doesn't	4261	Not a libev limitation but worth mentioning: windows apparently doesn't
3940	accept large writes: instead of resulting in a partial write, windows will	4262	accept large writes: instead of resulting in a partial write, windows will
3941	either accept everything or return C<ENOBUFS> if the buffer is too large,	4263	either accept everything or return C<ENOBUFS> if the buffer is too large,
3942	so make sure you only write small amounts into your sockets (less than a	4264	so make sure you only write small amounts into your sockets (less than a
3943	megabyte seems safe, but this apparently depends on the amount of memory	4265	megabyte seems safe, but this apparently depends on the amount of memory
…		…
3947	the abysmal performance of winsockets, using a large number of sockets	4269	the abysmal performance of winsockets, using a large number of sockets
3948	is not recommended (and not reasonable). If your program needs to use	4270	is not recommended (and not reasonable). If your program needs to use
3949	more than a hundred or so sockets, then likely it needs to use a totally	4271	more than a hundred or so sockets, then likely it needs to use a totally
3950	different implementation for windows, as libev offers the POSIX readiness	4272	different implementation for windows, as libev offers the POSIX readiness
3951	notification model, which cannot be implemented efficiently on windows	4273	notification model, which cannot be implemented efficiently on windows
3952	(Microsoft monopoly games).	4274	(due to Microsoft monopoly games).
3953		4275
3954	A typical way to use libev under windows is to embed it (see the embedding	4276	A typical way to use libev under windows is to embed it (see the embedding
3955	section for details) and use the following F<evwrap.h> header file instead	4277	section for details) and use the following F<evwrap.h> header file instead
3956	of F<ev.h>:	4278	of F<ev.h>:
3957		4279
…		…
3993		4315
3994	Early versions of winsocket's select only supported waiting for a maximum	4316	Early versions of winsocket's select only supported waiting for a maximum
3995	of C<64> handles (probably owning to the fact that all windows kernels	4317	of C<64> handles (probably owning to the fact that all windows kernels
3996	can only wait for C<64> things at the same time internally; Microsoft	4318	can only wait for C<64> things at the same time internally; Microsoft
3997	recommends spawning a chain of threads and wait for 63 handles and the	4319	recommends spawning a chain of threads and wait for 63 handles and the
3998	previous thread in each. Great).	4320	previous thread in each. Sounds great!).
3999		4321
4000	Newer versions support more handles, but you need to define C<FD_SETSIZE>	4322	Newer versions support more handles, but you need to define C<FD_SETSIZE>
4001	to some high number (e.g. C<2048>) before compiling the winsocket select	4323	to some high number (e.g. C<2048>) before compiling the winsocket select
4002	call (which might be in libev or elsewhere, for example, perl does its own	4324	call (which might be in libev or elsewhere, for example, perl and many
4003	select emulation on windows).	4325	other interpreters do their own select emulation on windows).
4004		4326
4005	Another limit is the number of file descriptors in the Microsoft runtime	4327	Another limit is the number of file descriptors in the Microsoft runtime
4006	libraries, which by default is C<64> (there must be a hidden I<64> fetish	4328	libraries, which by default is C<64> (there must be a hidden I<64>
4007	or something like this inside Microsoft). You can increase this by calling	4329	fetish or something like this inside Microsoft). You can increase this
4008	C<_setmaxstdio>, which can increase this limit to C<2048> (another	4330	by calling C<_setmaxstdio>, which can increase this limit to C<2048>
4009	arbitrary limit), but is broken in many versions of the Microsoft runtime	4331	(another arbitrary limit), but is broken in many versions of the Microsoft
4010	libraries.
4011
4012	This might get you to about C<512> or C<2048> sockets (depending on	4332	runtime libraries. This might get you to about C<512> or C<2048> sockets
4013	windows version and/or the phase of the moon). To get more, you need to	4333	(depending on windows version and/or the phase of the moon). To get more,
4014	wrap all I/O functions and provide your own fd management, but the cost of	4334	you need to wrap all I/O functions and provide your own fd management, but
4015	calling select (O(n²)) will likely make this unworkable.	4335	the cost of calling select (O(n²)) will likely make this unworkable.
4016		4336
4017	=back	4337	=back
4018		4338
4019	=head2 PORTABILITY REQUIREMENTS	4339	=head2 PORTABILITY REQUIREMENTS
4020		4340
…		…
4063	=item C<double> must hold a time value in seconds with enough accuracy	4383	=item C<double> must hold a time value in seconds with enough accuracy
4064		4384
4065	The type C<double> is used to represent timestamps. It is required to	4385	The type C<double> is used to represent timestamps. It is required to
4066	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	4386	have at least 51 bits of mantissa (and 9 bits of exponent), which is good
4067	enough for at least into the year 4000. This requirement is fulfilled by	4387	enough for at least into the year 4000. This requirement is fulfilled by
4068	implementations implementing IEEE 754 (basically all existing ones).	4388	implementations implementing IEEE 754, which is basically all existing
		4389	ones. With IEEE 754 doubles, you get microsecond accuracy until at least
		4390	2200.
4069		4391
4070	=back	4392	=back
4071		4393
4072	If you know of other additional requirements drop me a note.	4394	If you know of other additional requirements drop me a note.
4073		4395

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.239 by root, Tue Apr 21 14:14:19 2009 UTC vs. Revision 1.260 by root, Sun Jul 19 21:18:03 2009 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.239 by root, Tue Apr 21 14:14:19 2009 UTC vs.
Revision 1.260 by root, Sun Jul 19 21:18:03 2009 UTC