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

Comparing libev/ev.pod (file contents):
Revision 1.355 by root, Tue Jan 11 01:41:56 2011 UTC vs.
Revision 1.381 by root, Sat Aug 13 17:41:14 2011 UTC

…		…
58	ev_timer_start (loop, &timeout_watcher);	58	ev_timer_start (loop, &timeout_watcher);
59		59
60	// now wait for events to arrive	60	// now wait for events to arrive
61	ev_run (loop, 0);	61	ev_run (loop, 0);
62		62
63	// unloop was called, so exit	63	// break was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
67	=head1 ABOUT THIS DOCUMENT	67	=head1 ABOUT THIS DOCUMENT
68		68
…		…
178	you actually want to know. Also interesting is the combination of	178	you actually want to know. Also interesting is the combination of
179	C<ev_update_now> and C<ev_now>.	179	C<ev_update_now> and C<ev_now>.
180		180
181	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
182		182
183	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked
184	either it is interrupted or the given time interval has passed. Basically	184	until either it is interrupted or the given time interval has
		185	passed (approximately - it might return a bit earlier even if not
		186	interrupted). Returns immediately if C<< interval <= 0 >>.
		187
185	this is a sub-second-resolution C<sleep ()>.	188	Basically this is a sub-second-resolution C<sleep ()>.
		189
		190	The range of the C<interval> is limited - libev only guarantees to work
		191	with sleep times of up to one day (C<< interval <= 86400 >>).
186		192
187	=item int ev_version_major ()	193	=item int ev_version_major ()
188		194
189	=item int ev_version_minor ()	195	=item int ev_version_minor ()
190		196
…		…
435	example) that can't properly initialise their signal masks.	441	example) that can't properly initialise their signal masks.
436		442
437	=item C<EVFLAG_NOSIGMASK>	443	=item C<EVFLAG_NOSIGMASK>
438		444
439	When this flag is specified, then libev will avoid to modify the signal	445	When this flag is specified, then libev will avoid to modify the signal
440	mask. Specifically, this means you ahve to make sure signals are unblocked	446	mask. Specifically, this means you have to make sure signals are unblocked
441	when you want to receive them.	447	when you want to receive them.
442		448
443	This behaviour is useful when you want to do your own signal handling, or	449	This behaviour is useful when you want to do your own signal handling, or
444	want to handle signals only in specific threads and want to avoid libev	450	want to handle signals only in specific threads and want to avoid libev
445	unblocking the signals.	451	unblocking the signals.
		452
		453	It's also required by POSIX in a threaded program, as libev calls
		454	C<sigprocmask>, whose behaviour is officially unspecified.
446		455
447	This flag's behaviour will become the default in future versions of libev.	456	This flag's behaviour will become the default in future versions of libev.
448		457
449	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	458	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
450		459
…		…
480	=item C<EVBACKEND_EPOLL> (value 4, Linux)	489	=item C<EVBACKEND_EPOLL> (value 4, Linux)
481		490
482	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	491	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
483	kernels).	492	kernels).
484		493
485	For few fds, this backend is a bit little slower than poll and select,	494	For few fds, this backend is a bit little slower than poll and select, but
486	but it scales phenomenally better. While poll and select usually scale	495	it scales phenomenally better. While poll and select usually scale like
487	like O(total_fds) where n is the total number of fds (or the highest fd),	496	O(total_fds) where total_fds is the total number of fds (or the highest
488	epoll scales either O(1) or O(active_fds).	497	fd), epoll scales either O(1) or O(active_fds).
489		498
490	The epoll mechanism deserves honorable mention as the most misdesigned	499	The epoll mechanism deserves honorable mention as the most misdesigned
491	of the more advanced event mechanisms: mere annoyances include silently	500	of the more advanced event mechanisms: mere annoyances include silently
492	dropping file descriptors, requiring a system call per change per file	501	dropping file descriptors, requiring a system call per change per file
493	descriptor (and unnecessary guessing of parameters), problems with dup,	502	descriptor (and unnecessary guessing of parameters), problems with dup,
…		…
496	0.1ms) and so on. The biggest issue is fork races, however - if a program	505	0.1ms) and so on. The biggest issue is fork races, however - if a program
497	forks then I<both> parent and child process have to recreate the epoll	506	forks then I<both> parent and child process have to recreate the epoll
498	set, which can take considerable time (one syscall per file descriptor)	507	set, which can take considerable time (one syscall per file descriptor)
499	and is of course hard to detect.	508	and is of course hard to detect.
500		509
501	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	510	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
502	of course I<doesn't>, and epoll just loves to report events for totally	511	but of course I<doesn't>, and epoll just loves to report events for
503	I<different> file descriptors (even already closed ones, so one cannot	512	totally I<different> file descriptors (even already closed ones, so
504	even remove them from the set) than registered in the set (especially	513	one cannot even remove them from the set) than registered in the set
505	on SMP systems). Libev tries to counter these spurious notifications by	514	(especially on SMP systems). Libev tries to counter these spurious
506	employing an additional generation counter and comparing that against the	515	notifications by employing an additional generation counter and comparing
507	events to filter out spurious ones, recreating the set when required. Last	516	that against the events to filter out spurious ones, recreating the set
		517	when required. Epoll also erroneously rounds down timeouts, but gives you
		518	no way to know when and by how much, so sometimes you have to busy-wait
		519	because epoll returns immediately despite a nonzero timeout. And last
508	not least, it also refuses to work with some file descriptors which work	520	not least, it also refuses to work with some file descriptors which work
509	perfectly fine with C<select> (files, many character devices...).	521	perfectly fine with C<select> (files, many character devices...).
510		522
511	Epoll is truly the train wreck analog among event poll mechanisms,	523	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
512	a frankenpoll, cobbled together in a hurry, no thought to design or	524	cobbled together in a hurry, no thought to design or interaction with
513	interaction with others.	525	others. Oh, the pain, will it ever stop...
514		526
515	While stopping, setting and starting an I/O watcher in the same iteration	527	While stopping, setting and starting an I/O watcher in the same iteration
516	will result in some caching, there is still a system call per such	528	will result in some caching, there is still a system call per such
517	incident (because the same I<file descriptor> could point to a different	529	incident (because the same I<file descriptor> could point to a different
518	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	530	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
596	among the OS-specific backends (I vastly prefer correctness over speed	608	among the OS-specific backends (I vastly prefer correctness over speed
597	hacks).	609	hacks).
598		610
599	On the negative side, the interface is I<bizarre> - so bizarre that	611	On the negative side, the interface is I<bizarre> - so bizarre that
600	even sun itself gets it wrong in their code examples: The event polling	612	even sun itself gets it wrong in their code examples: The event polling
601	function sometimes returning events to the caller even though an error	613	function sometimes returns events to the caller even though an error
602	occurred, but with no indication whether it has done so or not (yes, it's	614	occurred, but with no indication whether it has done so or not (yes, it's
603	even documented that way) - deadly for edge-triggered interfaces where	615	even documented that way) - deadly for edge-triggered interfaces where you
604	you absolutely have to know whether an event occurred or not because you	616	absolutely have to know whether an event occurred or not because you have
605	have to re-arm the watcher.	617	to re-arm the watcher.
606		618
607	Fortunately libev seems to be able to work around these idiocies.	619	Fortunately libev seems to be able to work around these idiocies.
608		620
609	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	621	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
610	C<EVBACKEND_POLL>.	622	C<EVBACKEND_POLL>.
…		…
822	This is useful if you are waiting for some external event in conjunction	834	This is useful if you are waiting for some external event in conjunction
823	with something not expressible using other libev watchers (i.e. "roll your	835	with something not expressible using other libev watchers (i.e. "roll your
824	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	836	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
825	usually a better approach for this kind of thing.	837	usually a better approach for this kind of thing.
826		838
827	Here are the gory details of what C<ev_run> does:	839	Here are the gory details of what C<ev_run> does (this is for your
		840	understanding, not a guarantee that things will work exactly like this in
		841	future versions):
828		842
829	- Increment loop depth.	843	- Increment loop depth.
830	- Reset the ev_break status.	844	- Reset the ev_break status.
831	- Before the first iteration, call any pending watchers.	845	- Before the first iteration, call any pending watchers.
832	LOOP:	846	LOOP:
…		…
865	anymore.	879	anymore.
866		880
867	... queue jobs here, make sure they register event watchers as long	881	... queue jobs here, make sure they register event watchers as long
868	... as they still have work to do (even an idle watcher will do..)	882	... as they still have work to do (even an idle watcher will do..)
869	ev_run (my_loop, 0);	883	ev_run (my_loop, 0);
870	... jobs done or somebody called unloop. yeah!	884	... jobs done or somebody called break. yeah!
871		885
872	=item ev_break (loop, how)	886	=item ev_break (loop, how)
873		887
874	Can be used to make a call to C<ev_run> return early (but only after it	888	Can be used to make a call to C<ev_run> return early (but only after it
875	has processed all outstanding events). The C<how> argument must be either	889	has processed all outstanding events). The C<how> argument must be either
…		…
938	overhead for the actual polling but can deliver many events at once.	952	overhead for the actual polling but can deliver many events at once.
939		953
940	By setting a higher I<io collect interval> you allow libev to spend more	954	By setting a higher I<io collect interval> you allow libev to spend more
941	time collecting I/O events, so you can handle more events per iteration,	955	time collecting I/O events, so you can handle more events per iteration,
942	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	956	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
943	C<ev_timer>) will be not affected. Setting this to a non-null value will	957	C<ev_timer>) will not be affected. Setting this to a non-null value will
944	introduce an additional C<ev_sleep ()> call into most loop iterations. The	958	introduce an additional C<ev_sleep ()> call into most loop iterations. The
945	sleep time ensures that libev will not poll for I/O events more often then	959	sleep time ensures that libev will not poll for I/O events more often then
946	once per this interval, on average.	960	once per this interval, on average (as long as the host time resolution is
		961	good enough).
947		962
948	Likewise, by setting a higher I<timeout collect interval> you allow libev	963	Likewise, by setting a higher I<timeout collect interval> you allow libev
949	to spend more time collecting timeouts, at the expense of increased	964	to spend more time collecting timeouts, at the expense of increased
950	latency/jitter/inexactness (the watcher callback will be called	965	latency/jitter/inexactness (the watcher callback will be called
951	later). C<ev_io> watchers will not be affected. Setting this to a non-null	966	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
1357	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1372	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1358	functions that do not need a watcher.	1373	functions that do not need a watcher.
1359		1374
1360	=back	1375	=back
1361		1376
1362	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1377	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1363		1378	OWN COMPOSITE WATCHERS> idioms.
1364	Each watcher has, by default, a member C<void *data> that you can change
1365	and read at any time: libev will completely ignore it. This can be used
1366	to associate arbitrary data with your watcher. If you need more data and
1367	don't want to allocate memory and store a pointer to it in that data
1368	member, you can also "subclass" the watcher type and provide your own
1369	data:
1370
1371	struct my_io
1372	{
1373	ev_io io;
1374	int otherfd;
1375	void *somedata;
1376	struct whatever *mostinteresting;
1377	};
1378
1379	...
1380	struct my_io w;
1381	ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383	And since your callback will be called with a pointer to the watcher, you
1384	can cast it back to your own type:
1385
1386	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1387	{
1388	struct my_io w = (struct my_io )w_;
1389	...
1390	}
1391
1392	More interesting and less C-conformant ways of casting your callback type
1393	instead have been omitted.
1394
1395	Another common scenario is to use some data structure with multiple
1396	embedded watchers:
1397
1398	struct my_biggy
1399	{
1400	int some_data;
1401	ev_timer t1;
1402	ev_timer t2;
1403	}
1404
1405	In this case getting the pointer to C<my_biggy> is a bit more
1406	complicated: Either you store the address of your C<my_biggy> struct
1407	in the C<data> member of the watcher (for woozies), or you need to use
1408	some pointer arithmetic using C<offsetof> inside your watchers (for real
1409	programmers):
1410
1411	#include <stddef.h>
1412
1413	static void
1414	t1_cb (EV_P_ ev_timer *w, int revents)
1415	{
1416	struct my_biggy big = (struct my_biggy *)
1417	(((char *)w) - offsetof (struct my_biggy, t1));
1418	}
1419
1420	static void
1421	t2_cb (EV_P_ ev_timer *w, int revents)
1422	{
1423	struct my_biggy big = (struct my_biggy *)
1424	(((char *)w) - offsetof (struct my_biggy, t2));
1425	}
1426		1379
1427	=head2 WATCHER STATES	1380	=head2 WATCHER STATES
1428		1381
1429	There are various watcher states mentioned throughout this manual -	1382	There are various watcher states mentioned throughout this manual -
1430	active, pending and so on. In this section these states and the rules to	1383	active, pending and so on. In this section these states and the rules to
…		…
1433		1386
1434	=over 4	1387	=over 4
1435		1388
1436	=item initialiased	1389	=item initialiased
1437		1390
1438	Before a watcher can be registered with the event looop it has to be	1391	Before a watcher can be registered with the event loop it has to be
1439	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1392	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1393	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441		1394
1442	In this state it is simply some block of memory that is suitable for use	1395	In this state it is simply some block of memory that is suitable for
1443	in an event loop. It can be moved around, freed, reused etc. at will.	1396	use in an event loop. It can be moved around, freed, reused etc. at
		1397	will - as long as you either keep the memory contents intact, or call
		1398	C<ev_TYPE_init> again.
1444		1399
1445	=item started/running/active	1400	=item started/running/active
1446		1401
1447	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1402	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448	property of the event loop, and is actively waiting for events. While in	1403	property of the event loop, and is actively waiting for events. While in
…		…
1476	latter will clear any pending state the watcher might be in, regardless	1431	latter will clear any pending state the watcher might be in, regardless
1477	of whether it was active or not, so stopping a watcher explicitly before	1432	of whether it was active or not, so stopping a watcher explicitly before
1478	freeing it is often a good idea.	1433	freeing it is often a good idea.
1479		1434
1480	While stopped (and not pending) the watcher is essentially in the	1435	While stopped (and not pending) the watcher is essentially in the
1481	initialised state, that is it can be reused, moved, modified in any way	1436	initialised state, that is, it can be reused, moved, modified in any way
1482	you wish.	1437	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1438	it again).
1483		1439
1484	=back	1440	=back
1485		1441
1486	=head2 WATCHER PRIORITY MODELS	1442	=head2 WATCHER PRIORITY MODELS
1487		1443
…		…
1680	always get a readiness notification instantly, and your read (or possibly	1636	always get a readiness notification instantly, and your read (or possibly
1681	write) will still block on the disk I/O.	1637	write) will still block on the disk I/O.
1682		1638
1683	Another way to view it is that in the case of sockets, pipes, character	1639	Another way to view it is that in the case of sockets, pipes, character
1684	devices and so on, there is another party (the sender) that delivers data	1640	devices and so on, there is another party (the sender) that delivers data
1685	on it's own, but in the case of files, there is no such thing: the disk	1641	on its own, but in the case of files, there is no such thing: the disk
1686	will not send data on it's own, simply because it doesn't know what you	1642	will not send data on its own, simply because it doesn't know what you
1687	wish to read - you would first have to request some data.	1643	wish to read - you would first have to request some data.
1688		1644
1689	Since files are typically not-so-well supported by advanced notification	1645	Since files are typically not-so-well supported by advanced notification
1690	mechanism, libev tries hard to emulate POSIX behaviour with respect	1646	mechanism, libev tries hard to emulate POSIX behaviour with respect
1691	to files, even though you should not use it. The reason for this is	1647	to files, even though you should not use it. The reason for this is
…		…
1815	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1771	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1816	monotonic clock option helps a lot here).	1772	monotonic clock option helps a lot here).
1817		1773
1818	The callback is guaranteed to be invoked only I<after> its timeout has	1774	The callback is guaranteed to be invoked only I<after> its timeout has
1819	passed (not I<at>, so on systems with very low-resolution clocks this	1775	passed (not I<at>, so on systems with very low-resolution clocks this
1820	might introduce a small delay). If multiple timers become ready during the	1776	might introduce a small delay, see "the special problem of being too
		1777	early", below). If multiple timers become ready during the same loop
1821	same loop iteration then the ones with earlier time-out values are invoked	1778	iteration then the ones with earlier time-out values are invoked before
1822	before ones of the same priority with later time-out values (but this is	1779	ones of the same priority with later time-out values (but this is no
1823	no longer true when a callback calls C<ev_run> recursively).	1780	longer true when a callback calls C<ev_run> recursively).
1824		1781
1825	=head3 Be smart about timeouts	1782	=head3 Be smart about timeouts
1826		1783
1827	Many real-world problems involve some kind of timeout, usually for error	1784	Many real-world problems involve some kind of timeout, usually for error
1828	recovery. A typical example is an HTTP request - if the other side hangs,	1785	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1995	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	1952	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1996	rather complicated, but extremely efficient, something that really pays	1953	rather complicated, but extremely efficient, something that really pays
1997	off after the first million or so of active timers, i.e. it's usually	1954	off after the first million or so of active timers, i.e. it's usually
1998	overkill :)	1955	overkill :)
1999		1956
		1957	=head3 The special problem of being too early
		1958
		1959	If you ask a timer to call your callback after three seconds, then
		1960	you expect it to be invoked after three seconds - but of course, this
		1961	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1962	guaranteed to any precision by libev - imagine somebody suspending the
		1963	process a STOP signal for a few hours for example.
		1964
		1965	So, libev tries to invoke your callback as soon as possible I<after> the
		1966	delay has occured, but cannot guarantee this.
		1967
		1968	A less obvious failure mode is calling your callback too early: many event
		1969	loops compare timestamps with a "elapsed delay >= requested delay", but
		1970	this can cause your callback to be invoked much earlier than you would
		1971	expect.
		1972
		1973	To see why, imagine a system with a clock that only offers full second
		1974	resolution (think windows if you can't come up with a broken enough OS
		1975	yourself). If you schedule a one-second timer at the time 500.9, then the
		1976	event loop will schedule your timeout to elapse at a system time of 500
		1977	(500.9 truncated to the resolution) + 1, or 501.
		1978
		1979	If an event library looks at the timeout 0.1s later, it will see "501 >=
		1980	501" and invoke the callback 0.1s after it was started, even though a
		1981	one-second delay was requested - this is being "too early", despite best
		1982	intentions.
		1983
		1984	This is the reason why libev will never invoke the callback if the elapsed
		1985	delay equals the requested delay, but only when the elapsed delay is
		1986	larger than the requested delay. In the example above, libev would only invoke
		1987	the callback at system time 502, or 1.1s after the timer was started.
		1988
		1989	So, while libev cannot guarantee that your callback will be invoked
		1990	exactly when requested, it I<can> and I<does> guarantee that the requested
		1991	delay has actually elapsed, or in other words, it always errs on the "too
		1992	late" side of things.
		1993
2000	=head3 The special problem of time updates	1994	=head3 The special problem of time updates
2001		1995
2002	Establishing the current time is a costly operation (it usually takes at	1996	Establishing the current time is a costly operation (it usually takes at
2003	least two system calls): EV therefore updates its idea of the current	1997	least two system calls): EV therefore updates its idea of the current
2004	time only before and after C<ev_run> collects new events, which causes a	1998	time only before and after C<ev_run> collects new events, which causes a
…		…
2014	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2008	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
2015		2009
2016	If the event loop is suspended for a long time, you can also force an	2010	If the event loop is suspended for a long time, you can also force an
2017	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2011	update of the time returned by C<ev_now ()> by calling C<ev_now_update
2018	()>.	2012	()>.
		2013
		2014	=head3 The special problem of unsychronised clocks
		2015
		2016	Modern systems have a variety of clocks - libev itself uses the normal
		2017	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2018	jumps).
		2019
		2020	Neither of these clocks is synchronised with each other or any other clock
		2021	on the system, so C<ev_time ()> might return a considerably different time
		2022	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2023	a call to C<gettimeofday> might return a second count that is one higher
		2024	than a directly following call to C<time>.
		2025
		2026	The moral of this is to only compare libev-related timestamps with
		2027	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2028	a seocnd or so.
		2029
		2030	One more problem arises due to this lack of synchronisation: if libev uses
		2031	the system monotonic clock and you compare timestamps from C<ev_time>
		2032	or C<ev_now> from when you started your timer and when your callback is
		2033	invoked, you will find that sometimes the callback is a bit "early".
		2034
		2035	This is because C<ev_timer>s work in real time, not wall clock time, so
		2036	libev makes sure your callback is not invoked before the delay happened,
		2037	I<measured according to the real time>, not the system clock.
		2038
		2039	If your timeouts are based on a physical timescale (e.g. "time out this
		2040	connection after 100 seconds") then this shouldn't bother you as it is
		2041	exactly the right behaviour.
		2042
		2043	If you want to compare wall clock/system timestamps to your timers, then
		2044	you need to use C<ev_periodic>s, as these are based on the wall clock
		2045	time, where your comparisons will always generate correct results.
2019		2046
2020	=head3 The special problems of suspended animation	2047	=head3 The special problems of suspended animation
2021		2048
2022	When you leave the server world it is quite customary to hit machines that	2049	When you leave the server world it is quite customary to hit machines that
2023	can suspend/hibernate - what happens to the clocks during such a suspend?	2050	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
2067	keep up with the timer (because it takes longer than those 10 seconds to	2094	keep up with the timer (because it takes longer than those 10 seconds to
2068	do stuff) the timer will not fire more than once per event loop iteration.	2095	do stuff) the timer will not fire more than once per event loop iteration.
2069		2096
2070	=item ev_timer_again (loop, ev_timer *)	2097	=item ev_timer_again (loop, ev_timer *)
2071		2098
2072	This will act as if the timer timed out and restart it again if it is	2099	This will act as if the timer timed out and restarts it again if it is
2073	repeating. The exact semantics are:	2100	repeating. The exact semantics are:
2074		2101
2075	If the timer is pending, its pending status is cleared.	2102	If the timer is pending, its pending status is cleared.
2076		2103
2077	If the timer is started but non-repeating, stop it (as if it timed out).	2104	If the timer is started but non-repeating, stop it (as if it timed out).
…		…
2207		2234
2208	Another way to think about it (for the mathematically inclined) is that	2235	Another way to think about it (for the mathematically inclined) is that
2209	C<ev_periodic> will try to run the callback in this mode at the next possible	2236	C<ev_periodic> will try to run the callback in this mode at the next possible
2210	time where C<time = offset (mod interval)>, regardless of any time jumps.	2237	time where C<time = offset (mod interval)>, regardless of any time jumps.
2211		2238
2212	For numerical stability it is preferable that the C<offset> value is near	2239	The C<interval> I<MUST> be positive, and for numerical stability, the
2213	C<ev_now ()> (the current time), but there is no range requirement for	2240	interval value should be higher than C<1/8192> (which is around 100
2214	this value, and in fact is often specified as zero.	2241	microseconds) and C<offset> should be higher than C<0> and should have
		2242	at most a similar magnitude as the current time (say, within a factor of
		2243	ten). Typical values for offset are, in fact, C<0> or something between
		2244	C<0> and C<interval>, which is also the recommended range.
2215		2245
2216	Note also that there is an upper limit to how often a timer can fire (CPU	2246	Note also that there is an upper limit to how often a timer can fire (CPU
2217	speed for example), so if C<interval> is very small then timing stability	2247	speed for example), so if C<interval> is very small then timing stability
2218	will of course deteriorate. Libev itself tries to be exact to be about one	2248	will of course deteriorate. Libev itself tries to be exact to be about one
2219	millisecond (if the OS supports it and the machine is fast enough).	2249	millisecond (if the OS supports it and the machine is fast enough).
…		…
2362	=head3 The special problem of inheritance over fork/execve/pthread_create	2392	=head3 The special problem of inheritance over fork/execve/pthread_create
2363		2393
2364	Both the signal mask (C<sigprocmask>) and the signal disposition	2394	Both the signal mask (C<sigprocmask>) and the signal disposition
2365	(C<sigaction>) are unspecified after starting a signal watcher (and after	2395	(C<sigaction>) are unspecified after starting a signal watcher (and after
2366	stopping it again), that is, libev might or might not block the signal,	2396	stopping it again), that is, libev might or might not block the signal,
2367	and might or might not set or restore the installed signal handler.	2397	and might or might not set or restore the installed signal handler (but
		2398	see C<EVFLAG_NOSIGMASK>).
2368		2399
2369	While this does not matter for the signal disposition (libev never	2400	While this does not matter for the signal disposition (libev never
2370	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2401	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2371	C<execve>), this matters for the signal mask: many programs do not expect	2402	C<execve>), this matters for the signal mask: many programs do not expect
2372	certain signals to be blocked.	2403	certain signals to be blocked.
…		…
3243	atexit (program_exits);	3274	atexit (program_exits);
3244		3275
3245		3276
3246	=head2 C<ev_async> - how to wake up an event loop	3277	=head2 C<ev_async> - how to wake up an event loop
3247		3278
3248	In general, you cannot use an C<ev_run> from multiple threads or other	3279	In general, you cannot use an C<ev_loop> from multiple threads or other
3249	asynchronous sources such as signal handlers (as opposed to multiple event	3280	asynchronous sources such as signal handlers (as opposed to multiple event
3250	loops - those are of course safe to use in different threads).	3281	loops - those are of course safe to use in different threads).
3251		3282
3252	Sometimes, however, you need to wake up an event loop you do not control,	3283	Sometimes, however, you need to wake up an event loop you do not control,
3253	for example because it belongs to another thread. This is what C<ev_async>	3284	for example because it belongs to another thread. This is what C<ev_async>
…		…
3260	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind	3291	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3261	of "global async watchers" by using a watcher on an otherwise unused	3292	of "global async watchers" by using a watcher on an otherwise unused
3262	signal, and C<ev_feed_signal> to signal this watcher from another thread,	3293	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3263	even without knowing which loop owns the signal.	3294	even without knowing which loop owns the signal.
3264		3295
3265	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3266	just the default loop.
3267
3268	=head3 Queueing	3296	=head3 Queueing
3269		3297
3270	C<ev_async> does not support queueing of data in any way. The reason	3298	C<ev_async> does not support queueing of data in any way. The reason
3271	is that the author does not know of a simple (or any) algorithm for a	3299	is that the author does not know of a simple (or any) algorithm for a
3272	multiple-writer-single-reader queue that works in all cases and doesn't	3300	multiple-writer-single-reader queue that works in all cases and doesn't
…		…
3363	trust me.	3391	trust me.
3364		3392
3365	=item ev_async_send (loop, ev_async *)	3393	=item ev_async_send (loop, ev_async *)
3366		3394
3367	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3395	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3368	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3396	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3397	returns.
		3398
3369	C<ev_feed_event>, this call is safe to do from other threads, signal or	3399	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3370	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3400	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3371	section below on what exactly this means).	3401	embedding section below on what exactly this means).
3372		3402
3373	Note that, as with other watchers in libev, multiple events might get	3403	Note that, as with other watchers in libev, multiple events might get
3374	compressed into a single callback invocation (another way to look at this	3404	compressed into a single callback invocation (another way to look at
3375	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3405	this is that C<ev_async> watchers are level-triggered: they are set on
3376	reset when the event loop detects that).	3406	C<ev_async_send>, reset when the event loop detects that).
3377		3407
3378	This call incurs the overhead of a system call only once per event loop	3408	This call incurs the overhead of at most one extra system call per event
3379	iteration, so while the overhead might be noticeable, it doesn't apply to	3409	loop iteration, if the event loop is blocked, and no syscall at all if
3380	repeated calls to C<ev_async_send> for the same event loop.	3410	the event loop (or your program) is processing events. That means that
		3411	repeated calls are basically free (there is no need to avoid calls for
		3412	performance reasons) and that the overhead becomes smaller (typically
		3413	zero) under load.
3381		3414
3382	=item bool = ev_async_pending (ev_async *)	3415	=item bool = ev_async_pending (ev_async *)
3383		3416
3384	Returns a non-zero value when C<ev_async_send> has been called on the	3417	Returns a non-zero value when C<ev_async_send> has been called on the
3385	watcher but the event has not yet been processed (or even noted) by the	3418	watcher but the event has not yet been processed (or even noted) by the
…		…
3456		3489
3457	This section explains some common idioms that are not immediately	3490	This section explains some common idioms that are not immediately
3458	obvious. Note that examples are sprinkled over the whole manual, and this	3491	obvious. Note that examples are sprinkled over the whole manual, and this
3459	section only contains stuff that wouldn't fit anywhere else.	3492	section only contains stuff that wouldn't fit anywhere else.
3460		3493
		3494	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3495
		3496	Each watcher has, by default, a C<void *data> member that you can read
		3497	or modify at any time: libev will completely ignore it. This can be used
		3498	to associate arbitrary data with your watcher. If you need more data and
		3499	don't want to allocate memory separately and store a pointer to it in that
		3500	data member, you can also "subclass" the watcher type and provide your own
		3501	data:
		3502
		3503	struct my_io
		3504	{
		3505	ev_io io;
		3506	int otherfd;
		3507	void *somedata;
		3508	struct whatever *mostinteresting;
		3509	};
		3510
		3511	...
		3512	struct my_io w;
		3513	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3514
		3515	And since your callback will be called with a pointer to the watcher, you
		3516	can cast it back to your own type:
		3517
		3518	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
		3519	{
		3520	struct my_io w = (struct my_io )w_;
		3521	...
		3522	}
		3523
		3524	More interesting and less C-conformant ways of casting your callback
		3525	function type instead have been omitted.
		3526
		3527	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3528
		3529	Another common scenario is to use some data structure with multiple
		3530	embedded watchers, in effect creating your own watcher that combines
		3531	multiple libev event sources into one "super-watcher":
		3532
		3533	struct my_biggy
		3534	{
		3535	int some_data;
		3536	ev_timer t1;
		3537	ev_timer t2;
		3538	}
		3539
		3540	In this case getting the pointer to C<my_biggy> is a bit more
		3541	complicated: Either you store the address of your C<my_biggy> struct in
		3542	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3543	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3544	real programmers):
		3545
		3546	#include <stddef.h>
		3547
		3548	static void
		3549	t1_cb (EV_P_ ev_timer *w, int revents)
		3550	{
		3551	struct my_biggy big = (struct my_biggy *)
		3552	(((char *)w) - offsetof (struct my_biggy, t1));
		3553	}
		3554
		3555	static void
		3556	t2_cb (EV_P_ ev_timer *w, int revents)
		3557	{
		3558	struct my_biggy big = (struct my_biggy *)
		3559	(((char *)w) - offsetof (struct my_biggy, t2));
		3560	}
		3561
3461	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS	3562	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3462		3563
3463	Often (especially in GUI toolkits) there are places where you have	3564	Often (especially in GUI toolkits) there are places where you have
3464	I<modal> interaction, which is most easily implemented by recursively	3565	I<modal> interaction, which is most easily implemented by recursively
3465	invoking C<ev_run>.	3566	invoking C<ev_run>.
…		…
3498	exit_main_loop = exit_nested_loop = 1;	3599	exit_main_loop = exit_nested_loop = 1;
3499		3600
3500	=head2 THREAD LOCKING EXAMPLE	3601	=head2 THREAD LOCKING EXAMPLE
3501		3602
3502	Here is a fictitious example of how to run an event loop in a different	3603	Here is a fictitious example of how to run an event loop in a different
3503	thread than where callbacks are being invoked and watchers are	3604	thread from where callbacks are being invoked and watchers are
3504	created/added/removed.	3605	created/added/removed.
3505		3606
3506	For a real-world example, see the C<EV::Loop::Async> perl module,	3607	For a real-world example, see the C<EV::Loop::Async> perl module,
3507	which uses exactly this technique (which is suited for many high-level	3608	which uses exactly this technique (which is suited for many high-level
3508	languages).	3609	languages).
…		…
3534	// now associate this with the loop	3635	// now associate this with the loop
3535	ev_set_userdata (EV_A_ u);	3636	ev_set_userdata (EV_A_ u);
3536	ev_set_invoke_pending_cb (EV_A_ l_invoke);	3637	ev_set_invoke_pending_cb (EV_A_ l_invoke);
3537	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);	3638	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3538		3639
3539	// then create the thread running ev_loop	3640	// then create the thread running ev_run
3540	pthread_create (&u->tid, 0, l_run, EV_A);	3641	pthread_create (&u->tid, 0, l_run, EV_A);
3541	}	3642	}
3542		3643
3543	The callback for the C<ev_async> watcher does nothing: the watcher is used	3644	The callback for the C<ev_async> watcher does nothing: the watcher is used
3544	solely to wake up the event loop so it takes notice of any new watchers	3645	solely to wake up the event loop so it takes notice of any new watchers
…		…
3633	Note that sending the C<ev_async> watcher is required because otherwise	3734	Note that sending the C<ev_async> watcher is required because otherwise
3634	an event loop currently blocking in the kernel will have no knowledge	3735	an event loop currently blocking in the kernel will have no knowledge
3635	about the newly added timer. By waking up the loop it will pick up any new	3736	about the newly added timer. By waking up the loop it will pick up any new
3636	watchers in the next event loop iteration.	3737	watchers in the next event loop iteration.
3637		3738
3638	=back	3739	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3740
		3741	While the overhead of a callback that e.g. schedules a thread is small, it
		3742	is still an overhead. If you embed libev, and your main usage is with some
		3743	kind of threads or coroutines, you might want to customise libev so that
		3744	doesn't need callbacks anymore.
		3745
		3746	Imagine you have coroutines that you can switch to using a function
		3747	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3748	and that due to some magic, the currently active coroutine is stored in a
		3749	global called C<current_coro>. Then you can build your own "wait for libev
		3750	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3751	the differing C<;> conventions):
		3752
		3753	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3754	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3755
		3756	That means instead of having a C callback function, you store the
		3757	coroutine to switch to in each watcher, and instead of having libev call
		3758	your callback, you instead have it switch to that coroutine.
		3759
		3760	A coroutine might now wait for an event with a function called
		3761	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3762	matter when, or whether the watcher is active or not when this function is
		3763	called):
		3764
		3765	void
		3766	wait_for_event (ev_watcher *w)
		3767	{
		3768	ev_cb_set (w) = current_coro;
		3769	switch_to (libev_coro);
		3770	}
		3771
		3772	That basically suspends the coroutine inside C<wait_for_event> and
		3773	continues the libev coroutine, which, when appropriate, switches back to
		3774	this or any other coroutine. I am sure if you sue this your own :)
		3775
		3776	You can do similar tricks if you have, say, threads with an event queue -
		3777	instead of storing a coroutine, you store the queue object and instead of
		3778	switching to a coroutine, you push the watcher onto the queue and notify
		3779	any waiters.
		3780
		3781	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3782	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3783
		3784	// my_ev.h
		3785	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3786	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3787	#include "../libev/ev.h"
		3788
		3789	// my_ev.c
		3790	#define EV_H "my_ev.h"
		3791	#include "../libev/ev.c"
		3792
		3793	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3794	F<my_ev.c> into your project. When properly specifying include paths, you
		3795	can even use F<ev.h> as header file name directly.
3639		3796
3640		3797
3641	=head1 LIBEVENT EMULATION	3798	=head1 LIBEVENT EMULATION
3642		3799
3643	Libev offers a compatibility emulation layer for libevent. It cannot	3800	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
3858	watchers in the constructor.	4015	watchers in the constructor.
3859		4016
3860	class myclass	4017	class myclass
3861	{	4018	{
3862	ev::io io ; void io_cb (ev::io &w, int revents);	4019	ev::io io ; void io_cb (ev::io &w, int revents);
3863	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	4020	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3864	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4021	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3865		4022
3866	myclass (int fd)	4023	myclass (int fd)
3867	{	4024	{
3868	io .set <myclass, &myclass::io_cb > (this);	4025	io .set <myclass, &myclass::io_cb > (this);
…		…
3919	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4076	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3920		4077
3921	=item D	4078	=item D
3922		4079
3923	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4080	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3924	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4081	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3925		4082
3926	=item Ocaml	4083	=item Ocaml
3927		4084
3928	Erkki Seppala has written Ocaml bindings for libev, to be found at	4085	Erkki Seppala has written Ocaml bindings for libev, to be found at
3929	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4086	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3977	suitable for use with C<EV_A>.	4134	suitable for use with C<EV_A>.
3978		4135
3979	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4136	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3980		4137
3981	Similar to the other two macros, this gives you the value of the default	4138	Similar to the other two macros, this gives you the value of the default
3982	loop, if multiple loops are supported ("ev loop default").	4139	loop, if multiple loops are supported ("ev loop default"). The default loop
		4140	will be initialised if it isn't already initialised.
		4141
		4142	For non-multiplicity builds, these macros do nothing, so you always have
		4143	to initialise the loop somewhere.
3983		4144
3984	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4145	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3985		4146
3986	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4147	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3987	default loop has been initialised (C<UC> == unchecked). Their behaviour	4148	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
4132	supported). It will also not define any of the structs usually found in	4293	supported). It will also not define any of the structs usually found in
4133	F<event.h> that are not directly supported by the libev core alone.	4294	F<event.h> that are not directly supported by the libev core alone.
4134		4295
4135	In standalone mode, libev will still try to automatically deduce the	4296	In standalone mode, libev will still try to automatically deduce the
4136	configuration, but has to be more conservative.	4297	configuration, but has to be more conservative.
		4298
		4299	=item EV_USE_FLOOR
		4300
		4301	If defined to be C<1>, libev will use the C<floor ()> function for its
		4302	periodic reschedule calculations, otherwise libev will fall back on a
		4303	portable (slower) implementation. If you enable this, you usually have to
		4304	link against libm or something equivalent. Enabling this when the C<floor>
		4305	function is not available will fail, so the safe default is to not enable
		4306	this.
4137		4307
4138	=item EV_USE_MONOTONIC	4308	=item EV_USE_MONOTONIC
4139		4309
4140	If defined to be C<1>, libev will try to detect the availability of the	4310	If defined to be C<1>, libev will try to detect the availability of the
4141	monotonic clock option at both compile time and runtime. Otherwise no	4311	monotonic clock option at both compile time and runtime. Otherwise no
…		…
4274	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4444	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4275		4445
4276	=item EV_ATOMIC_T	4446	=item EV_ATOMIC_T
4277		4447
4278	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4448	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4279	access is atomic with respect to other threads or signal contexts. No such	4449	access is atomic and serialised with respect to other threads or signal
4280	type is easily found in the C language, so you can provide your own type	4450	contexts. No such type is easily found in the C language, so you can
4281	that you know is safe for your purposes. It is used both for signal handler "locking"	4451	provide your own type that you know is safe for your purposes. It is used
4282	as well as for signal and thread safety in C<ev_async> watchers.	4452	both for signal handler "locking" as well as for signal and thread safety
		4453	in C<ev_async> watchers.
4283		4454
4284	In the absence of this define, libev will use C<sig_atomic_t volatile>	4455	In the absence of this define, libev will use C<sig_atomic_t volatile>
4285	(from F<signal.h>), which is usually good enough on most platforms.	4456	(from F<signal.h>), which is usually good enough on most platforms,
		4457	although strictly speaking using a type that also implies a memory fence
		4458	is required.
4286		4459
4287	=item EV_H (h)	4460	=item EV_H (h)
4288		4461
4289	The name of the F<ev.h> header file used to include it. The default if	4462	The name of the F<ev.h> header file used to include it. The default if
4290	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be	4463	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
…		…
4313	If undefined or defined to C<1>, then all event-loop-specific functions	4486	If undefined or defined to C<1>, then all event-loop-specific functions
4314	will have the C<struct ev_loop *> as first argument, and you can create	4487	will have the C<struct ev_loop *> as first argument, and you can create
4315	additional independent event loops. Otherwise there will be no support	4488	additional independent event loops. Otherwise there will be no support
4316	for multiple event loops and there is no first event loop pointer	4489	for multiple event loops and there is no first event loop pointer
4317	argument. Instead, all functions act on the single default loop.	4490	argument. Instead, all functions act on the single default loop.
		4491
		4492	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4493	default loop when multiplicity is switched off - you always have to
		4494	initialise the loop manually in this case.
4318		4495
4319	=item EV_MINPRI	4496	=item EV_MINPRI
4320		4497
4321	=item EV_MAXPRI	4498	=item EV_MAXPRI
4322		4499
…		…
4573	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4750	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4574		4751
4575	#include "ev_cpp.h"	4752	#include "ev_cpp.h"
4576	#include "ev.c"	4753	#include "ev.c"
4577		4754
4578	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4755	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4579		4756
4580	=head2 THREADS AND COROUTINES	4757	=head2 THREADS AND COROUTINES
4581		4758
4582	=head3 THREADS	4759	=head3 THREADS
4583		4760
…		…
4809	requires, and its I/O model is fundamentally incompatible with the POSIX	4986	requires, and its I/O model is fundamentally incompatible with the POSIX
4810	model. Libev still offers limited functionality on this platform in	4987	model. Libev still offers limited functionality on this platform in
4811	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4988	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4812	descriptors. This only applies when using Win32 natively, not when using	4989	descriptors. This only applies when using Win32 natively, not when using
4813	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	4990	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4814	as every compielr comes with a slightly differently broken/incompatible	4991	as every compiler comes with a slightly differently broken/incompatible
4815	environment.	4992	environment.
4816		4993
4817	Lifting these limitations would basically require the full	4994	Lifting these limitations would basically require the full
4818	re-implementation of the I/O system. If you are into this kind of thing,	4995	re-implementation of the I/O system. If you are into this kind of thing,
4819	then note that glib does exactly that for you in a very portable way (note	4996	then note that glib does exactly that for you in a very portable way (note
…		…
4952		5129
4953	The type C<double> is used to represent timestamps. It is required to	5130	The type C<double> is used to represent timestamps. It is required to
4954	have at least 51 bits of mantissa (and 9 bits of exponent), which is	5131	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4955	good enough for at least into the year 4000 with millisecond accuracy	5132	good enough for at least into the year 4000 with millisecond accuracy
4956	(the design goal for libev). This requirement is overfulfilled by	5133	(the design goal for libev). This requirement is overfulfilled by
4957	implementations using IEEE 754, which is basically all existing ones. With	5134	implementations using IEEE 754, which is basically all existing ones.
		5135
4958	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5136	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5137	year 2255 (and millisecond accuray till the year 287396 - by then, libev
		5138	is either obsolete or somebody patched it to use C<long double> or
		5139	something like that, just kidding).
4959		5140
4960	=back	5141	=back
4961		5142
4962	If you know of other additional requirements drop me a note.	5143	If you know of other additional requirements drop me a note.
4963		5144
…		…
5025	=item Processing ev_async_send: O(number_of_async_watchers)	5206	=item Processing ev_async_send: O(number_of_async_watchers)
5026		5207
5027	=item Processing signals: O(max_signal_number)	5208	=item Processing signals: O(max_signal_number)
5028		5209
5029	Sending involves a system call I<iff> there were no other C<ev_async_send>	5210	Sending involves a system call I<iff> there were no other C<ev_async_send>
5030	calls in the current loop iteration. Checking for async and signal events	5211	calls in the current loop iteration and the loop is currently
		5212	blocked. Checking for async and signal events involves iterating over all
5031	involves iterating over all running async watchers or all signal numbers.	5213	running async watchers or all signal numbers.
5032		5214
5033	=back	5215	=back
5034		5216
5035		5217
5036	=head1 PORTING FROM LIBEV 3.X TO 4.X	5218	=head1 PORTING FROM LIBEV 3.X TO 4.X
…		…
5153	The physical time that is observed. It is apparently strictly monotonic :)	5335	The physical time that is observed. It is apparently strictly monotonic :)
5154		5336
5155	=item wall-clock time	5337	=item wall-clock time
5156		5338
5157	The time and date as shown on clocks. Unlike real time, it can actually	5339	The time and date as shown on clocks. Unlike real time, it can actually
5158	be wrong and jump forwards and backwards, e.g. when the you adjust your	5340	be wrong and jump forwards and backwards, e.g. when you adjust your
5159	clock.	5341	clock.
5160		5342
5161	=item watcher	5343	=item watcher
5162		5344
5163	A data structure that describes interest in certain events. Watchers need	5345	A data structure that describes interest in certain events. Watchers need
…		…
5166	=back	5348	=back
5167		5349
5168	=head1 AUTHOR	5350	=head1 AUTHOR
5169		5351
5170	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5352	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5171	Magnusson and Emanuele Giaquinta.	5353	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5172		5354

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.355 by root, Tue Jan 11 01:41:56 2011 UTC vs. Revision 1.381 by root, Sat Aug 13 17:41:14 2011 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.355 by root, Tue Jan 11 01:41:56 2011 UTC vs.
Revision 1.381 by root, Sat Aug 13 17:41:14 2011 UTC