ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.111 by root, Tue Dec 25 18:01:20 2007 UTC vs.
Revision 1.286 by root, Tue Mar 16 00:26:41 2010 UTC

…		…
2		2
3	libev - a high performance full-featured event loop written in C	3	libev - a high performance full-featured event loop written in C
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	#include <ev.h>	7	#include <ev.h>
8		8
9	=head2 EXAMPLE PROGRAM	9	=head2 EXAMPLE PROGRAM
10		10
		11	// a single header file is required
11	#include <ev.h>	12	#include <ev.h>
12		13
		14	#include <stdio.h> // for puts
		15
		16	// every watcher type has its own typedef'd struct
		17	// with the name ev_TYPE
13	ev_io stdin_watcher;	18	ev_io stdin_watcher;
14	ev_timer timeout_watcher;	19	ev_timer timeout_watcher;
15		20
16	/* called when data readable on stdin */	21	// all watcher callbacks have a similar signature
		22	// this callback is called when data is readable on stdin
17	static void	23	static void
18	stdin_cb (EV_P_ struct ev_io *w, int revents)	24	stdin_cb (EV_P_ ev_io *w, int revents)
19	{	25	{
20	/* puts ("stdin ready"); */	26	puts ("stdin ready");
21	ev_io_stop (EV_A_ w); /* just a syntax example */	27	// for one-shot events, one must manually stop the watcher
22	ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */	28	// with its corresponding stop function.
		29	ev_io_stop (EV_A_ w);
		30
		31	// this causes all nested ev_loop's to stop iterating
		32	ev_unloop (EV_A_ EVUNLOOP_ALL);
23	}	33	}
24		34
		35	// another callback, this time for a time-out
25	static void	36	static void
26	timeout_cb (EV_P_ struct ev_timer *w, int revents)	37	timeout_cb (EV_P_ ev_timer *w, int revents)
27	{	38	{
28	/* puts ("timeout"); */	39	puts ("timeout");
29	ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */	40	// this causes the innermost ev_loop to stop iterating
		41	ev_unloop (EV_A_ EVUNLOOP_ONE);
30	}	42	}
31		43
32	int	44	int
33	main (void)	45	main (void)
34	{	46	{
		47	// use the default event loop unless you have special needs
35	struct ev_loop *loop = ev_default_loop (0);	48	struct ev_loop *loop = ev_default_loop (0);
36		49
37	/* initialise an io watcher, then start it */	50	// initialise an io watcher, then start it
		51	// this one will watch for stdin to become readable
38	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);	52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
39	ev_io_start (loop, &stdin_watcher);	53	ev_io_start (loop, &stdin_watcher);
40		54
		55	// initialise a timer watcher, then start it
41	/* simple non-repeating 5.5 second timeout */	56	// simple non-repeating 5.5 second timeout
42	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);	57	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
43	ev_timer_start (loop, &timeout_watcher);	58	ev_timer_start (loop, &timeout_watcher);
44		59
45	/* loop till timeout or data ready */	60	// now wait for events to arrive
46	ev_loop (loop, 0);	61	ev_loop (loop, 0);
47		62
		63	// unloop was called, so exit
48	return 0;	64	return 0;
49	}	65	}
50		66
51	=head1 DESCRIPTION	67	=head1 ABOUT THIS DOCUMENT
52		68
		69	This document documents the libev software package.
		70
53	The newest version of this document is also available as a html-formatted	71	The newest version of this document is also available as an html-formatted
54	web page you might find easier to navigate when reading it for the first	72	web page you might find easier to navigate when reading it for the first
55	time: L<http://cvs.schmorp.de/libev/ev.html>.	73	time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
		74
		75	While this document tries to be as complete as possible in documenting
		76	libev, its usage and the rationale behind its design, it is not a tutorial
		77	on event-based programming, nor will it introduce event-based programming
		78	with libev.
		79
		80	Familarity with event based programming techniques in general is assumed
		81	throughout this document.
		82
		83	=head1 ABOUT LIBEV
56		84
57	Libev is an event loop: you register interest in certain events (such as a	85	Libev is an event loop: you register interest in certain events (such as a
58	file descriptor being readable or a timeout occurring), and it will manage	86	file descriptor being readable or a timeout occurring), and it will manage
59	these event sources and provide your program with events.	87	these event sources and provide your program with events.
60		88
…		…
70	=head2 FEATURES	98	=head2 FEATURES
71		99
72	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the	100	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms	101	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74	for file descriptor events (C<ev_io>), the Linux C<inotify> interface	102	for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75	(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers	103	(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
76	with customised rescheduling (C<ev_periodic>), synchronous signals	104	inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
77	(C<ev_signal>), process status change events (C<ev_child>), and event	105	timers (C<ev_timer>), absolute timers with customised rescheduling
78	watchers dealing with the event loop mechanism itself (C<ev_idle>,	106	(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
79	C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as	107	change events (C<ev_child>), and event watchers dealing with the event
80	file watchers (C<ev_stat>) and even limited support for fork events	108	loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
81	(C<ev_fork>).	109	C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
		110	limited support for fork events (C<ev_fork>).
82		111
83	It also is quite fast (see this	112	It also is quite fast (see this
84	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent	113	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85	for example).	114	for example).
86		115
87	=head2 CONVENTIONS	116	=head2 CONVENTIONS
88		117
89	Libev is very configurable. In this manual the default configuration will	118	Libev is very configurable. In this manual the default (and most common)
90	be described, which supports multiple event loops. For more info about	119	configuration will be described, which supports multiple event loops. For
91	various configuration options please have a look at B<EMBED> section in	120	more info about various configuration options please have a look at
92	this manual. If libev was configured without support for multiple event	121	B<EMBED> section in this manual. If libev was configured without support
93	loops, then all functions taking an initial argument of name C<loop>	122	for multiple event loops, then all functions taking an initial argument of
94	(which is always of type C<struct ev_loop *>) will not have this argument.	123	name C<loop> (which is always of type C<struct ev_loop *>) will not have
		124	this argument.
95		125
96	=head2 TIME REPRESENTATION	126	=head2 TIME REPRESENTATION
97		127
98	Libev represents time as a single floating point number, representing the	128	Libev represents time as a single floating point number, representing
99	(fractional) number of seconds since the (POSIX) epoch (somewhere near	129	the (fractional) number of seconds since the (POSIX) epoch (somewhere
100	the beginning of 1970, details are complicated, don't ask). This type is	130	near the beginning of 1970, details are complicated, don't ask). This
101	called C<ev_tstamp>, which is what you should use too. It usually aliases	131	type is called C<ev_tstamp>, which is what you should use too. It usually
102	to the C<double> type in C, and when you need to do any calculations on	132	aliases to the C<double> type in C. When you need to do any calculations
103	it, you should treat it as some floatingpoint value. Unlike the name	133	on it, you should treat it as some floating point value. Unlike the name
104	component C<stamp> might indicate, it is also used for time differences	134	component C<stamp> might indicate, it is also used for time differences
105	throughout libev.	135	throughout libev.
		136
		137	=head1 ERROR HANDLING
		138
		139	Libev knows three classes of errors: operating system errors, usage errors
		140	and internal errors (bugs).
		141
		142	When libev catches an operating system error it cannot handle (for example
		143	a system call indicating a condition libev cannot fix), it calls the callback
		144	set via C<ev_set_syserr_cb>, which is supposed to fix the problem or
		145	abort. The default is to print a diagnostic message and to call C<abort
		146	()>.
		147
		148	When libev detects a usage error such as a negative timer interval, then
		149	it will print a diagnostic message and abort (via the C<assert> mechanism,
		150	so C<NDEBUG> will disable this checking): these are programming errors in
		151	the libev caller and need to be fixed there.
		152
		153	Libev also has a few internal error-checking C<assert>ions, and also has
		154	extensive consistency checking code. These do not trigger under normal
		155	circumstances, as they indicate either a bug in libev or worse.
		156
106		157
107	=head1 GLOBAL FUNCTIONS	158	=head1 GLOBAL FUNCTIONS
108		159
109	These functions can be called anytime, even before initialising the	160	These functions can be called anytime, even before initialising the
110	library in any way.	161	library in any way.
…		…
119		170
120	=item ev_sleep (ev_tstamp interval)	171	=item ev_sleep (ev_tstamp interval)
121		172
122	Sleep for the given interval: The current thread will be blocked until	173	Sleep for the given interval: The current thread will be blocked until
123	either it is interrupted or the given time interval has passed. Basically	174	either it is interrupted or the given time interval has passed. Basically
124	this is a subsecond-resolution C<sleep ()>.	175	this is a sub-second-resolution C<sleep ()>.
125		176
126	=item int ev_version_major ()	177	=item int ev_version_major ()
127		178
128	=item int ev_version_minor ()	179	=item int ev_version_minor ()
129		180
…		…
142	not a problem.	193	not a problem.
143		194
144	Example: Make sure we haven't accidentally been linked against the wrong	195	Example: Make sure we haven't accidentally been linked against the wrong
145	version.	196	version.
146		197
147	assert (("libev version mismatch",	198	assert (("libev version mismatch",
148	ev_version_major () == EV_VERSION_MAJOR	199	ev_version_major () == EV_VERSION_MAJOR
149	&& ev_version_minor () >= EV_VERSION_MINOR));	200	&& ev_version_minor () >= EV_VERSION_MINOR));
150		201
151	=item unsigned int ev_supported_backends ()	202	=item unsigned int ev_supported_backends ()
152		203
153	Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>	204	Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
154	value) compiled into this binary of libev (independent of their	205	value) compiled into this binary of libev (independent of their
…		…
156	a description of the set values.	207	a description of the set values.
157		208
158	Example: make sure we have the epoll method, because yeah this is cool and	209	Example: make sure we have the epoll method, because yeah this is cool and
159	a must have and can we have a torrent of it please!!!11	210	a must have and can we have a torrent of it please!!!11
160		211
161	assert (("sorry, no epoll, no sex",	212	assert (("sorry, no epoll, no sex",
162	ev_supported_backends () & EVBACKEND_EPOLL));	213	ev_supported_backends () & EVBACKEND_EPOLL));
163		214
164	=item unsigned int ev_recommended_backends ()	215	=item unsigned int ev_recommended_backends ()
165		216
166	Return the set of all backends compiled into this binary of libev and also	217	Return the set of all backends compiled into this binary of libev and also
167	recommended for this platform. This set is often smaller than the one	218	recommended for this platform. This set is often smaller than the one
168	returned by C<ev_supported_backends>, as for example kqueue is broken on	219	returned by C<ev_supported_backends>, as for example kqueue is broken on
169	most BSDs and will not be autodetected unless you explicitly request it	220	most BSDs and will not be auto-detected unless you explicitly request it
170	(assuming you know what you are doing). This is the set of backends that	221	(assuming you know what you are doing). This is the set of backends that
171	libev will probe for if you specify no backends explicitly.	222	libev will probe for if you specify no backends explicitly.
172		223
173	=item unsigned int ev_embeddable_backends ()	224	=item unsigned int ev_embeddable_backends ()
174		225
…		…
178	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	229	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
179	recommended ones.	230	recommended ones.
180		231
181	See the description of C<ev_embed> watchers for more info.	232	See the description of C<ev_embed> watchers for more info.
182		233
183	=item ev_set_allocator (void *(*cb)(void *ptr, long size))	234	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]
184		235
185	Sets the allocation function to use (the prototype is similar - the	236	Sets the allocation function to use (the prototype is similar - the
186	semantics is identical - to the realloc C function). It is used to	237	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
187	allocate and free memory (no surprises here). If it returns zero when	238	used to allocate and free memory (no surprises here). If it returns zero
188	memory needs to be allocated, the library might abort or take some	239	when memory needs to be allocated (C<size != 0>), the library might abort
189	potentially destructive action. The default is your system realloc	240	or take some potentially destructive action.
190	function.	241
		242	Since some systems (at least OpenBSD and Darwin) fail to implement
		243	correct C<realloc> semantics, libev will use a wrapper around the system
		244	C<realloc> and C<free> functions by default.
191		245
192	You could override this function in high-availability programs to, say,	246	You could override this function in high-availability programs to, say,
193	free some memory if it cannot allocate memory, to use a special allocator,	247	free some memory if it cannot allocate memory, to use a special allocator,
194	or even to sleep a while and retry until some memory is available.	248	or even to sleep a while and retry until some memory is available.
195		249
196	Example: Replace the libev allocator with one that waits a bit and then	250	Example: Replace the libev allocator with one that waits a bit and then
197	retries).	251	retries (example requires a standards-compliant C<realloc>).
198		252
199	static void *	253	static void *
200	persistent_realloc (void *ptr, size_t size)	254	persistent_realloc (void *ptr, size_t size)
201	{	255	{
202	for (;;)	256	for (;;)
…		…
211	}	265	}
212		266
213	...	267	...
214	ev_set_allocator (persistent_realloc);	268	ev_set_allocator (persistent_realloc);
215		269
216	=item ev_set_syserr_cb (void (*cb)(const char *msg));	270	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]
217		271
218	Set the callback function to call on a retryable syscall error (such	272	Set the callback function to call on a retryable system call error (such
219	as failed select, poll, epoll_wait). The message is a printable string	273	as failed select, poll, epoll_wait). The message is a printable string
220	indicating the system call or subsystem causing the problem. If this	274	indicating the system call or subsystem causing the problem. If this
221	callback is set, then libev will expect it to remedy the sitution, no	275	callback is set, then libev will expect it to remedy the situation, no
222	matter what, when it returns. That is, libev will generally retry the	276	matter what, when it returns. That is, libev will generally retry the
223	requested operation, or, if the condition doesn't go away, do bad stuff	277	requested operation, or, if the condition doesn't go away, do bad stuff
224	(such as abort).	278	(such as abort).
225		279
226	Example: This is basically the same thing that libev does internally, too.	280	Example: This is basically the same thing that libev does internally, too.
…		…
237		291
238	=back	292	=back
239		293
240	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	294	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
241		295
242	An event loop is described by a C<struct ev_loop *>. The library knows two	296	An event loop is described by a C<struct ev_loop *> (the C<struct>
243	types of such loops, the I<default> loop, which supports signals and child	297	is I<not> optional in this case, as there is also an C<ev_loop>
244	events, and dynamically created loops which do not.	298	I<function>).
245		299
246	If you use threads, a common model is to run the default event loop	300	The library knows two types of such loops, the I<default> loop, which
247	in your main thread (or in a separate thread) and for each thread you	301	supports signals and child events, and dynamically created loops which do
248	create, you also create another event loop. Libev itself does no locking	302	not.
249	whatsoever, so if you mix calls to the same event loop in different
250	threads, make sure you lock (this is usually a bad idea, though, even if
251	done correctly, because it's hideous and inefficient).
252		303
253	=over 4	304	=over 4
254		305
255	=item struct ev_loop *ev_default_loop (unsigned int flags)	306	=item struct ev_loop *ev_default_loop (unsigned int flags)
256		307
…		…
260	flags. If that is troubling you, check C<ev_backend ()> afterwards).	311	flags. If that is troubling you, check C<ev_backend ()> afterwards).
261		312
262	If you don't know what event loop to use, use the one returned from this	313	If you don't know what event loop to use, use the one returned from this
263	function.	314	function.
264		315
		316	Note that this function is I<not> thread-safe, so if you want to use it
		317	from multiple threads, you have to lock (note also that this is unlikely,
		318	as loops cannot be shared easily between threads anyway).
		319
		320	The default loop is the only loop that can handle C<ev_signal> and
		321	C<ev_child> watchers, and to do this, it always registers a handler
		322	for C<SIGCHLD>. If this is a problem for your application you can either
		323	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
		324	can simply overwrite the C<SIGCHLD> signal handler I<after> calling
		325	C<ev_default_init>.
		326
265	The flags argument can be used to specify special behaviour or specific	327	The flags argument can be used to specify special behaviour or specific
266	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	328	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
267		329
268	The following flags are supported:	330	The following flags are supported:
269		331
…		…
274	The default flags value. Use this if you have no clue (it's the right	336	The default flags value. Use this if you have no clue (it's the right
275	thing, believe me).	337	thing, believe me).
276		338
277	=item C<EVFLAG_NOENV>	339	=item C<EVFLAG_NOENV>
278		340
279	If this flag bit is ored into the flag value (or the program runs setuid	341	If this flag bit is or'ed into the flag value (or the program runs setuid
280	or setgid) then libev will I<not> look at the environment variable	342	or setgid) then libev will I<not> look at the environment variable
281	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	343	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
282	override the flags completely if it is found in the environment. This is	344	override the flags completely if it is found in the environment. This is
283	useful to try out specific backends to test their performance, or to work	345	useful to try out specific backends to test their performance, or to work
284	around bugs.	346	around bugs.
…		…
290	enabling this flag.	352	enabling this flag.
291		353
292	This works by calling C<getpid ()> on every iteration of the loop,	354	This works by calling C<getpid ()> on every iteration of the loop,
293	and thus this might slow down your event loop if you do a lot of loop	355	and thus this might slow down your event loop if you do a lot of loop
294	iterations and little real work, but is usually not noticeable (on my	356	iterations and little real work, but is usually not noticeable (on my
295	Linux system for example, C<getpid> is actually a simple 5-insn sequence	357	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
296	without a syscall and thus I<very> fast, but my Linux system also has	358	without a system call and thus I<very> fast, but my GNU/Linux system also has
297	C<pthread_atfork> which is even faster).	359	C<pthread_atfork> which is even faster).
298		360
299	The big advantage of this flag is that you can forget about fork (and	361	The big advantage of this flag is that you can forget about fork (and
300	forget about forgetting to tell libev about forking) when you use this	362	forget about forgetting to tell libev about forking) when you use this
301	flag.	363	flag.
302		364
303	This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>	365	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
304	environment variable.	366	environment variable.
		367
		368	=item C<EVFLAG_NOINOTIFY>
		369
		370	When this flag is specified, then libev will not attempt to use the
		371	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
		372	testing, this flag can be useful to conserve inotify file descriptors, as
		373	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
		374
		375	=item C<EVFLAG_SIGNALFD>
		376
		377	When this flag is specified, then libev will attempt to use the
		378	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
		379	delivers signals synchronously, which makes it both faster and might make
		380	it possible to get the queued signal data. It can also simplify signal
		381	handling with threads, as long as you properly block signals in your
		382	threads that are not interested in handling them.
		383
		384	Signalfd will not be used by default as this changes your signal mask, and
		385	there are a lot of shoddy libraries and programs (glib's threadpool for
		386	example) that can't properly initialise their signal masks.
305		387
306	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
307		389
308	This is your standard select(2) backend. Not I<completely> standard, as	390	This is your standard select(2) backend. Not I<completely> standard, as
309	libev tries to roll its own fd_set with no limits on the number of fds,	391	libev tries to roll its own fd_set with no limits on the number of fds,
310	but if that fails, expect a fairly low limit on the number of fds when	392	but if that fails, expect a fairly low limit on the number of fds when
311	using this backend. It doesn't scale too well (O(highest_fd)), but its	393	using this backend. It doesn't scale too well (O(highest_fd)), but its
312	usually the fastest backend for a low number of (low-numbered :) fds.	394	usually the fastest backend for a low number of (low-numbered :) fds.
313		395
314	To get good performance out of this backend you need a high amount of	396	To get good performance out of this backend you need a high amount of
315	parallelity (most of the file descriptors should be busy). If you are	397	parallelism (most of the file descriptors should be busy). If you are
316	writing a server, you should C<accept ()> in a loop to accept as many	398	writing a server, you should C<accept ()> in a loop to accept as many
317	connections as possible during one iteration. You might also want to have	399	connections as possible during one iteration. You might also want to have
318	a look at C<ev_set_io_collect_interval ()> to increase the amount of	400	a look at C<ev_set_io_collect_interval ()> to increase the amount of
319	readyness notifications you get per iteration.	401	readiness notifications you get per iteration.
		402
		403	This backend maps C<EV_READ> to the C<readfds> set and C<EV_WRITE> to the
		404	C<writefds> set (and to work around Microsoft Windows bugs, also onto the
		405	C<exceptfds> set on that platform).
320		406
321	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)	407	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
322		408
323	And this is your standard poll(2) backend. It's more complicated	409	And this is your standard poll(2) backend. It's more complicated
324	than select, but handles sparse fds better and has no artificial	410	than select, but handles sparse fds better and has no artificial
325	limit on the number of fds you can use (except it will slow down	411	limit on the number of fds you can use (except it will slow down
326	considerably with a lot of inactive fds). It scales similarly to select,	412	considerably with a lot of inactive fds). It scales similarly to select,
327	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for	413	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
328	performance tips.	414	performance tips.
329		415
		416	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
		417	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
		418
330	=item C<EVBACKEND_EPOLL> (value 4, Linux)	419	=item C<EVBACKEND_EPOLL> (value 4, Linux)
		420
		421	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
		422	kernels).
331		423
332	For few fds, this backend is a bit little slower than poll and select,	424	For few fds, this backend is a bit little slower than poll and select,
333	but it scales phenomenally better. While poll and select usually scale	425	but it scales phenomenally better. While poll and select usually scale
334	like O(total_fds) where n is the total number of fds (or the highest fd),	426	like O(total_fds) where n is the total number of fds (or the highest fd),
335	epoll scales either O(1) or O(active_fds). The epoll design has a number	427	epoll scales either O(1) or O(active_fds).
336	of shortcomings, such as silently dropping events in some hard-to-detect	428
337	cases and rewiring a syscall per fd change, no fork support and bad	429	The epoll mechanism deserves honorable mention as the most misdesigned
338	support for dup.	430	of the more advanced event mechanisms: mere annoyances include silently
		431	dropping file descriptors, requiring a system call per change per file
		432	descriptor (and unnecessary guessing of parameters), problems with dup and
		433	so on. The biggest issue is fork races, however - if a program forks then
		434	I<both> parent and child process have to recreate the epoll set, which can
		435	take considerable time (one syscall per file descriptor) and is of course
		436	hard to detect.
		437
		438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
		439	of course I<doesn't>, and epoll just loves to report events for totally
		440	I<different> file descriptors (even already closed ones, so one cannot
		441	even remove them from the set) than registered in the set (especially
		442	on SMP systems). Libev tries to counter these spurious notifications by
		443	employing an additional generation counter and comparing that against the
		444	events to filter out spurious ones, recreating the set when required.
339		445
340	While stopping, setting and starting an I/O watcher in the same iteration	446	While stopping, setting and starting an I/O watcher in the same iteration
341	will result in some caching, there is still a syscall per such incident	447	will result in some caching, there is still a system call per such
342	(because the fd could point to a different file description now), so its	448	incident (because the same I<file descriptor> could point to a different
343	best to avoid that. Also, C<dup ()>'ed file descriptors might not work	449	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
344	very well if you register events for both fds.	450	file descriptors might not work very well if you register events for both
345		451	file descriptors.
346	Please note that epoll sometimes generates spurious notifications, so you
347	need to use non-blocking I/O or other means to avoid blocking when no data
348	(or space) is available.
349		452
350	Best performance from this backend is achieved by not unregistering all	453	Best performance from this backend is achieved by not unregistering all
351	watchers for a file descriptor until it has been closed, if possible, i.e.	454	watchers for a file descriptor until it has been closed, if possible,
352	keep at least one watcher active per fd at all times.	455	i.e. keep at least one watcher active per fd at all times. Stopping and
		456	starting a watcher (without re-setting it) also usually doesn't cause
		457	extra overhead. A fork can both result in spurious notifications as well
		458	as in libev having to destroy and recreate the epoll object, which can
		459	take considerable time and thus should be avoided.
353		460
		461	All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
		462	faster than epoll for maybe up to a hundred file descriptors, depending on
		463	the usage. So sad.
		464
354	While nominally embeddeble in other event loops, this feature is broken in	465	While nominally embeddable in other event loops, this feature is broken in
355	all kernel versions tested so far.	466	all kernel versions tested so far.
		467
		468	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		469	C<EVBACKEND_POLL>.
356		470
357	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	471	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
358		472
359	Kqueue deserves special mention, as at the time of this writing, it	473	Kqueue deserves special mention, as at the time of this writing, it
360	was broken on all BSDs except NetBSD (usually it doesn't work reliably	474	was broken on all BSDs except NetBSD (usually it doesn't work reliably
361	with anything but sockets and pipes, except on Darwin, where of course	475	with anything but sockets and pipes, except on Darwin, where of course
362	it's completely useless). For this reason it's not being "autodetected"	476	it's completely useless). Unlike epoll, however, whose brokenness
		477	is by design, these kqueue bugs can (and eventually will) be fixed
		478	without API changes to existing programs. For this reason it's not being
363	unless you explicitly specify it explicitly in the flags (i.e. using	479	"auto-detected" unless you explicitly specify it in the flags (i.e. using
364	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)	480	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
365	system like NetBSD.	481	system like NetBSD.
366		482
367	You still can embed kqueue into a normal poll or select backend and use it	483	You still can embed kqueue into a normal poll or select backend and use it
368	only for sockets (after having made sure that sockets work with kqueue on	484	only for sockets (after having made sure that sockets work with kqueue on
369	the target platform). See C<ev_embed> watchers for more info.	485	the target platform). See C<ev_embed> watchers for more info.
370		486
371	It scales in the same way as the epoll backend, but the interface to the	487	It scales in the same way as the epoll backend, but the interface to the
372	kernel is more efficient (which says nothing about its actual speed, of	488	kernel is more efficient (which says nothing about its actual speed, of
373	course). While stopping, setting and starting an I/O watcher does never	489	course). While stopping, setting and starting an I/O watcher does never
374	cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to	490	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
375	two event changes per incident, support for C<fork ()> is very bad and it	491	two event changes per incident. Support for C<fork ()> is very bad (but
376	drops fds silently in similarly hard-to-detect cases.	492	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
		493	cases
377		494
378	This backend usually performs well under most conditions.	495	This backend usually performs well under most conditions.
379		496
380	While nominally embeddable in other event loops, this doesn't work	497	While nominally embeddable in other event loops, this doesn't work
381	everywhere, so you might need to test for this. And since it is broken	498	everywhere, so you might need to test for this. And since it is broken
382	almost everywhere, you should only use it when you have a lot of sockets	499	almost everywhere, you should only use it when you have a lot of sockets
383	(for which it usually works), by embedding it into another event loop	500	(for which it usually works), by embedding it into another event loop
384	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for	501	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course
385	sockets.	502	also broken on OS X)) and, did I mention it, using it only for sockets.
		503
		504	This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
		505	C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
		506	C<NOTE_EOF>.
386		507
387	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)	508	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
388		509
389	This is not implemented yet (and might never be, unless you send me an	510	This is not implemented yet (and might never be, unless you send me an
390	implementation). According to reports, C</dev/poll> only supports sockets	511	implementation). According to reports, C</dev/poll> only supports sockets
…		…
394	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	515	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
395		516
396	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	517	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
397	it's really slow, but it still scales very well (O(active_fds)).	518	it's really slow, but it still scales very well (O(active_fds)).
398		519
399	Please note that solaris event ports can deliver a lot of spurious	520	Please note that Solaris event ports can deliver a lot of spurious
400	notifications, so you need to use non-blocking I/O or other means to avoid	521	notifications, so you need to use non-blocking I/O or other means to avoid
401	blocking when no data (or space) is available.	522	blocking when no data (or space) is available.
402		523
403	While this backend scales well, it requires one system call per active	524	While this backend scales well, it requires one system call per active
404	file descriptor per loop iteration. For small and medium numbers of file	525	file descriptor per loop iteration. For small and medium numbers of file
405	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	526	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
406	might perform better.	527	might perform better.
407		528
		529	On the positive side, with the exception of the spurious readiness
		530	notifications, this backend actually performed fully to specification
		531	in all tests and is fully embeddable, which is a rare feat among the
		532	OS-specific backends (I vastly prefer correctness over speed hacks).
		533
		534	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		535	C<EVBACKEND_POLL>.
		536
408	=item C<EVBACKEND_ALL>	537	=item C<EVBACKEND_ALL>
409		538
410	Try all backends (even potentially broken ones that wouldn't be tried	539	Try all backends (even potentially broken ones that wouldn't be tried
411	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	540	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
412	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	541	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
413		542
414	It is definitely not recommended to use this flag.	543	It is definitely not recommended to use this flag.
415		544
416	=back	545	=back
417		546
418	If one or more of these are ored into the flags value, then only these	547	If one or more of the backend flags are or'ed into the flags value,
419	backends will be tried (in the reverse order as given here). If none are	548	then only these backends will be tried (in the reverse order as listed
420	specified, most compiled-in backend will be tried, usually in reverse	549	here). If none are specified, all backends in C<ev_recommended_backends
421	order of their flag values :)	550	()> will be tried.
422		551
423	The most typical usage is like this:	552	Example: This is the most typical usage.
424		553
425	if (!ev_default_loop (0))	554	if (!ev_default_loop (0))
426	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	555	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
427		556
428	Restrict libev to the select and poll backends, and do not allow	557	Example: Restrict libev to the select and poll backends, and do not allow
429	environment settings to be taken into account:	558	environment settings to be taken into account:
430		559
431	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);	560	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
432		561
433	Use whatever libev has to offer, but make sure that kqueue is used if	562	Example: Use whatever libev has to offer, but make sure that kqueue is
434	available (warning, breaks stuff, best use only with your own private	563	used if available (warning, breaks stuff, best use only with your own
435	event loop and only if you know the OS supports your types of fds):	564	private event loop and only if you know the OS supports your types of
		565	fds):
436		566
437	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);	567	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
438		568
439	=item struct ev_loop *ev_loop_new (unsigned int flags)	569	=item struct ev_loop *ev_loop_new (unsigned int flags)
440		570
441	Similar to C<ev_default_loop>, but always creates a new event loop that is	571	Similar to C<ev_default_loop>, but always creates a new event loop that is
442	always distinct from the default loop. Unlike the default loop, it cannot	572	always distinct from the default loop. Unlike the default loop, it cannot
443	handle signal and child watchers, and attempts to do so will be greeted by	573	handle signal and child watchers, and attempts to do so will be greeted by
444	undefined behaviour (or a failed assertion if assertions are enabled).	574	undefined behaviour (or a failed assertion if assertions are enabled).
445		575
		576	Note that this function I<is> thread-safe, and the recommended way to use
		577	libev with threads is indeed to create one loop per thread, and using the
		578	default loop in the "main" or "initial" thread.
		579
446	Example: Try to create a event loop that uses epoll and nothing else.	580	Example: Try to create a event loop that uses epoll and nothing else.
447		581
448	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	582	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
449	if (!epoller)	583	if (!epoller)
450	fatal ("no epoll found here, maybe it hides under your chair");	584	fatal ("no epoll found here, maybe it hides under your chair");
451		585
452	=item ev_default_destroy ()	586	=item ev_default_destroy ()
453		587
454	Destroys the default loop again (frees all memory and kernel state	588	Destroys the default loop again (frees all memory and kernel state
455	etc.). None of the active event watchers will be stopped in the normal	589	etc.). None of the active event watchers will be stopped in the normal
456	sense, so e.g. C<ev_is_active> might still return true. It is your	590	sense, so e.g. C<ev_is_active> might still return true. It is your
457	responsibility to either stop all watchers cleanly yoursef I<before>	591	responsibility to either stop all watchers cleanly yourself I<before>
458	calling this function, or cope with the fact afterwards (which is usually	592	calling this function, or cope with the fact afterwards (which is usually
459	the easiest thing, you can just ignore the watchers and/or C<free ()> them	593	the easiest thing, you can just ignore the watchers and/or C<free ()> them
460	for example).	594	for example).
461		595
462	Note that certain global state, such as signal state, will not be freed by	596	Note that certain global state, such as signal state (and installed signal
463	this function, and related watchers (such as signal and child watchers)	597	handlers), will not be freed by this function, and related watchers (such
464	would need to be stopped manually.	598	as signal and child watchers) would need to be stopped manually.
465		599
466	In general it is not advisable to call this function except in the	600	In general it is not advisable to call this function except in the
467	rare occasion where you really need to free e.g. the signal handling	601	rare occasion where you really need to free e.g. the signal handling
468	pipe fds. If you need dynamically allocated loops it is better to use	602	pipe fds. If you need dynamically allocated loops it is better to use
469	C<ev_loop_new> and C<ev_loop_destroy>).	603	C<ev_loop_new> and C<ev_loop_destroy>.
470		604
471	=item ev_loop_destroy (loop)	605	=item ev_loop_destroy (loop)
472		606
473	Like C<ev_default_destroy>, but destroys an event loop created by an	607	Like C<ev_default_destroy>, but destroys an event loop created by an
474	earlier call to C<ev_loop_new>.	608	earlier call to C<ev_loop_new>.
475		609
476	=item ev_default_fork ()	610	=item ev_default_fork ()
477		611
		612	This function sets a flag that causes subsequent C<ev_loop> iterations
478	This function reinitialises the kernel state for backends that have	613	to reinitialise the kernel state for backends that have one. Despite the
479	one. Despite the name, you can call it anytime, but it makes most sense	614	name, you can call it anytime, but it makes most sense after forking, in
480	after forking, in either the parent or child process (or both, but that	615	the child process (or both child and parent, but that again makes little
481	again makes little sense).	616	sense). You I<must> call it in the child before using any of the libev
		617	functions, and it will only take effect at the next C<ev_loop> iteration.
482		618
483	You I<must> call this function in the child process after forking if and	619	On the other hand, you only need to call this function in the child
484	only if you want to use the event library in both processes. If you just	620	process if and only if you want to use the event library in the child. If
485	fork+exec, you don't have to call it.	621	you just fork+exec, you don't have to call it at all.
486		622
487	The function itself is quite fast and it's usually not a problem to call	623	The function itself is quite fast and it's usually not a problem to call
488	it just in case after a fork. To make this easy, the function will fit in	624	it just in case after a fork. To make this easy, the function will fit in
489	quite nicely into a call to C<pthread_atfork>:	625	quite nicely into a call to C<pthread_atfork>:
490		626
491	pthread_atfork (0, 0, ev_default_fork);	627	pthread_atfork (0, 0, ev_default_fork);
492		628
493	At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
494	without calling this function, so if you force one of those backends you
495	do not need to care.
496
497	=item ev_loop_fork (loop)	629	=item ev_loop_fork (loop)
498		630
499	Like C<ev_default_fork>, but acts on an event loop created by	631	Like C<ev_default_fork>, but acts on an event loop created by
500	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	632	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
501	after fork, and how you do this is entirely your own problem.	633	after fork that you want to re-use in the child, and how you do this is
		634	entirely your own problem.
		635
		636	=item int ev_is_default_loop (loop)
		637
		638	Returns true when the given loop is, in fact, the default loop, and false
		639	otherwise.
502		640
503	=item unsigned int ev_loop_count (loop)	641	=item unsigned int ev_loop_count (loop)
504		642
505	Returns the count of loop iterations for the loop, which is identical to	643	Returns the count of loop iterations for the loop, which is identical to
506	the number of times libev did poll for new events. It starts at C<0> and	644	the number of times libev did poll for new events. It starts at C<0> and
507	happily wraps around with enough iterations.	645	happily wraps around with enough iterations.
508		646
509	This value can sometimes be useful as a generation counter of sorts (it	647	This value can sometimes be useful as a generation counter of sorts (it
510	"ticks" the number of loop iterations), as it roughly corresponds with	648	"ticks" the number of loop iterations), as it roughly corresponds with
511	C<ev_prepare> and C<ev_check> calls.	649	C<ev_prepare> and C<ev_check> calls.
		650
		651	=item unsigned int ev_loop_depth (loop)
		652
		653	Returns the number of times C<ev_loop> was entered minus the number of
		654	times C<ev_loop> was exited, in other words, the recursion depth.
		655
		656	Outside C<ev_loop>, this number is zero. In a callback, this number is
		657	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
		658	in which case it is higher.
		659
		660	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
		661	etc.), doesn't count as exit.
512		662
513	=item unsigned int ev_backend (loop)	663	=item unsigned int ev_backend (loop)
514		664
515	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	665	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
516	use.	666	use.
…		…
521	received events and started processing them. This timestamp does not	671	received events and started processing them. This timestamp does not
522	change as long as callbacks are being processed, and this is also the base	672	change as long as callbacks are being processed, and this is also the base
523	time used for relative timers. You can treat it as the timestamp of the	673	time used for relative timers. You can treat it as the timestamp of the
524	event occurring (or more correctly, libev finding out about it).	674	event occurring (or more correctly, libev finding out about it).
525		675
		676	=item ev_now_update (loop)
		677
		678	Establishes the current time by querying the kernel, updating the time
		679	returned by C<ev_now ()> in the progress. This is a costly operation and
		680	is usually done automatically within C<ev_loop ()>.
		681
		682	This function is rarely useful, but when some event callback runs for a
		683	very long time without entering the event loop, updating libev's idea of
		684	the current time is a good idea.
		685
		686	See also L<The special problem of time updates> in the C<ev_timer> section.
		687
		688	=item ev_suspend (loop)
		689
		690	=item ev_resume (loop)
		691
		692	These two functions suspend and resume a loop, for use when the loop is
		693	not used for a while and timeouts should not be processed.
		694
		695	A typical use case would be an interactive program such as a game: When
		696	the user presses C<^Z> to suspend the game and resumes it an hour later it
		697	would be best to handle timeouts as if no time had actually passed while
		698	the program was suspended. This can be achieved by calling C<ev_suspend>
		699	in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling
		700	C<ev_resume> directly afterwards to resume timer processing.
		701
		702	Effectively, all C<ev_timer> watchers will be delayed by the time spend
		703	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
		704	will be rescheduled (that is, they will lose any events that would have
		705	occured while suspended).
		706
		707	After calling C<ev_suspend> you B<must not> call I<any> function on the
		708	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
		709	without a previous call to C<ev_suspend>.
		710
		711	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
		712	event loop time (see C<ev_now_update>).
		713
526	=item ev_loop (loop, int flags)	714	=item ev_loop (loop, int flags)
527		715
528	Finally, this is it, the event handler. This function usually is called	716	Finally, this is it, the event handler. This function usually is called
529	after you initialised all your watchers and you want to start handling	717	after you have initialised all your watchers and you want to start
530	events.	718	handling events.
531		719
532	If the flags argument is specified as C<0>, it will not return until	720	If the flags argument is specified as C<0>, it will not return until
533	either no event watchers are active anymore or C<ev_unloop> was called.	721	either no event watchers are active anymore or C<ev_unloop> was called.
534		722
535	Please note that an explicit C<ev_unloop> is usually better than	723	Please note that an explicit C<ev_unloop> is usually better than
536	relying on all watchers to be stopped when deciding when a program has	724	relying on all watchers to be stopped when deciding when a program has
537	finished (especially in interactive programs), but having a program that	725	finished (especially in interactive programs), but having a program
538	automatically loops as long as it has to and no longer by virtue of	726	that automatically loops as long as it has to and no longer by virtue
539	relying on its watchers stopping correctly is a thing of beauty.	727	of relying on its watchers stopping correctly, that is truly a thing of
		728	beauty.
540		729
541	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	730	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
542	those events and any outstanding ones, but will not block your process in	731	those events and any already outstanding ones, but will not block your
543	case there are no events and will return after one iteration of the loop.	732	process in case there are no events and will return after one iteration of
		733	the loop.
544		734
545	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	735	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
546	neccessary) and will handle those and any outstanding ones. It will block	736	necessary) and will handle those and any already outstanding ones. It
547	your process until at least one new event arrives, and will return after	737	will block your process until at least one new event arrives (which could
548	one iteration of the loop. This is useful if you are waiting for some	738	be an event internal to libev itself, so there is no guarantee that a
549	external event in conjunction with something not expressible using other	739	user-registered callback will be called), and will return after one
		740	iteration of the loop.
		741
		742	This is useful if you are waiting for some external event in conjunction
		743	with something not expressible using other libev watchers (i.e. "roll your
550	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	744	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
551	usually a better approach for this kind of thing.	745	usually a better approach for this kind of thing.
552		746
553	Here are the gory details of what C<ev_loop> does:	747	Here are the gory details of what C<ev_loop> does:
554		748
555	- Before the first iteration, call any pending watchers.	749	- Before the first iteration, call any pending watchers.
556	* If there are no active watchers (reference count is zero), return.	750	* If EVFLAG_FORKCHECK was used, check for a fork.
557	- Queue all prepare watchers and then call all outstanding watchers.	751	- If a fork was detected (by any means), queue and call all fork watchers.
		752	- Queue and call all prepare watchers.
558	- If we have been forked, recreate the kernel state.	753	- If we have been forked, detach and recreate the kernel state
		754	as to not disturb the other process.
559	- Update the kernel state with all outstanding changes.	755	- Update the kernel state with all outstanding changes.
560	- Update the "event loop time".	756	- Update the "event loop time" (ev_now ()).
561	- Calculate for how long to block.	757	- Calculate for how long to sleep or block, if at all
		758	(active idle watchers, EVLOOP_NONBLOCK or not having
		759	any active watchers at all will result in not sleeping).
		760	- Sleep if the I/O and timer collect interval say so.
562	- Block the process, waiting for any events.	761	- Block the process, waiting for any events.
563	- Queue all outstanding I/O (fd) events.	762	- Queue all outstanding I/O (fd) events.
564	- Update the "event loop time" and do time jump handling.	763	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
565	- Queue all outstanding timers.	764	- Queue all expired timers.
566	- Queue all outstanding periodics.	765	- Queue all expired periodics.
567	- If no events are pending now, queue all idle watchers.	766	- Unless any events are pending now, queue all idle watchers.
568	- Queue all check watchers.	767	- Queue all check watchers.
569	- Call all queued watchers in reverse order (i.e. check watchers first).	768	- Call all queued watchers in reverse order (i.e. check watchers first).
570	Signals and child watchers are implemented as I/O watchers, and will	769	Signals and child watchers are implemented as I/O watchers, and will
571	be handled here by queueing them when their watcher gets executed.	770	be handled here by queueing them when their watcher gets executed.
572	- If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	771	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
573	were used, return, otherwise continue with step *.	772	were used, or there are no active watchers, return, otherwise
		773	continue with step *.
574		774
575	Example: Queue some jobs and then loop until no events are outsanding	775	Example: Queue some jobs and then loop until no events are outstanding
576	anymore.	776	anymore.
577		777
578	... queue jobs here, make sure they register event watchers as long	778	... queue jobs here, make sure they register event watchers as long
579	... as they still have work to do (even an idle watcher will do..)	779	... as they still have work to do (even an idle watcher will do..)
580	ev_loop (my_loop, 0);	780	ev_loop (my_loop, 0);
581	... jobs done. yeah!	781	... jobs done or somebody called unloop. yeah!
582		782
583	=item ev_unloop (loop, how)	783	=item ev_unloop (loop, how)
584		784
585	Can be used to make a call to C<ev_loop> return early (but only after it	785	Can be used to make a call to C<ev_loop> return early (but only after it
586	has processed all outstanding events). The C<how> argument must be either	786	has processed all outstanding events). The C<how> argument must be either
587	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	787	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
588	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	788	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
589		789
		790	This "unloop state" will be cleared when entering C<ev_loop> again.
		791
		792	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.
		793
590	=item ev_ref (loop)	794	=item ev_ref (loop)
591		795
592	=item ev_unref (loop)	796	=item ev_unref (loop)
593		797
594	Ref/unref can be used to add or remove a reference count on the event	798	Ref/unref can be used to add or remove a reference count on the event
595	loop: Every watcher keeps one reference, and as long as the reference	799	loop: Every watcher keeps one reference, and as long as the reference
596	count is nonzero, C<ev_loop> will not return on its own. If you have	800	count is nonzero, C<ev_loop> will not return on its own.
597	a watcher you never unregister that should not keep C<ev_loop> from	801
598	returning, ev_unref() after starting, and ev_ref() before stopping it. For	802	This is useful when you have a watcher that you never intend to
		803	unregister, but that nevertheless should not keep C<ev_loop> from
		804	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
		805	before stopping it.
		806
599	example, libev itself uses this for its internal signal pipe: It is not	807	As an example, libev itself uses this for its internal signal pipe: It
600	visible to the libev user and should not keep C<ev_loop> from exiting if	808	is not visible to the libev user and should not keep C<ev_loop> from
601	no event watchers registered by it are active. It is also an excellent	809	exiting if no event watchers registered by it are active. It is also an
602	way to do this for generic recurring timers or from within third-party	810	excellent way to do this for generic recurring timers or from within
603	libraries. Just remember to I<unref after start> and I<ref before stop>.	811	third-party libraries. Just remember to I<unref after start> and I<ref
		812	before stop> (but only if the watcher wasn't active before, or was active
		813	before, respectively. Note also that libev might stop watchers itself
		814	(e.g. non-repeating timers) in which case you have to C<ev_ref>
		815	in the callback).
604		816
605	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	817	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
606	running when nothing else is active.	818	running when nothing else is active.
607		819
608	struct ev_signal exitsig;	820	ev_signal exitsig;
609	ev_signal_init (&exitsig, sig_cb, SIGINT);	821	ev_signal_init (&exitsig, sig_cb, SIGINT);
610	ev_signal_start (loop, &exitsig);	822	ev_signal_start (loop, &exitsig);
611	evf_unref (loop);	823	evf_unref (loop);
612		824
613	Example: For some weird reason, unregister the above signal handler again.	825	Example: For some weird reason, unregister the above signal handler again.
614		826
615	ev_ref (loop);	827	ev_ref (loop);
616	ev_signal_stop (loop, &exitsig);	828	ev_signal_stop (loop, &exitsig);
617		829
618	=item ev_set_io_collect_interval (loop, ev_tstamp interval)	830	=item ev_set_io_collect_interval (loop, ev_tstamp interval)
619		831
620	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)	832	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
621		833
622	These advanced functions influence the time that libev will spend waiting	834	These advanced functions influence the time that libev will spend waiting
623	for events. Both are by default C<0>, meaning that libev will try to	835	for events. Both time intervals are by default C<0>, meaning that libev
624	invoke timer/periodic callbacks and I/O callbacks with minimum latency.	836	will try to invoke timer/periodic callbacks and I/O callbacks with minimum
		837	latency.
625		838
626	Setting these to a higher value (the C<interval> I<must> be >= C<0>)	839	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
627	allows libev to delay invocation of I/O and timer/periodic callbacks to	840	allows libev to delay invocation of I/O and timer/periodic callbacks
628	increase efficiency of loop iterations.	841	to increase efficiency of loop iterations (or to increase power-saving
		842	opportunities).
629		843
630	The background is that sometimes your program runs just fast enough to	844	The idea is that sometimes your program runs just fast enough to handle
631	handle one (or very few) event(s) per loop iteration. While this makes	845	one (or very few) event(s) per loop iteration. While this makes the
632	the program responsive, it also wastes a lot of CPU time to poll for new	846	program responsive, it also wastes a lot of CPU time to poll for new
633	events, especially with backends like C<select ()> which have a high	847	events, especially with backends like C<select ()> which have a high
634	overhead for the actual polling but can deliver many events at once.	848	overhead for the actual polling but can deliver many events at once.
635		849
636	By setting a higher I<io collect interval> you allow libev to spend more	850	By setting a higher I<io collect interval> you allow libev to spend more
637	time collecting I/O events, so you can handle more events per iteration,	851	time collecting I/O events, so you can handle more events per iteration,
638	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	852	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
639	C<ev_timer>) will be not affected. Setting this to a non-null value will	853	C<ev_timer>) will be not affected. Setting this to a non-null value will
640	introduce an additional C<ev_sleep ()> call into most loop iterations.	854	introduce an additional C<ev_sleep ()> call into most loop iterations. The
		855	sleep time ensures that libev will not poll for I/O events more often then
		856	once per this interval, on average.
641		857
642	Likewise, by setting a higher I<timeout collect interval> you allow libev	858	Likewise, by setting a higher I<timeout collect interval> you allow libev
643	to spend more time collecting timeouts, at the expense of increased	859	to spend more time collecting timeouts, at the expense of increased
644	latency (the watcher callback will be called later). C<ev_io> watchers	860	latency/jitter/inexactness (the watcher callback will be called
645	will not be affected. Setting this to a non-null value will not introduce	861	later). C<ev_io> watchers will not be affected. Setting this to a non-null
646	any overhead in libev.	862	value will not introduce any overhead in libev.
647		863
648	Many (busy) programs can usually benefit by setting the io collect	864	Many (busy) programs can usually benefit by setting the I/O collect
649	interval to a value near C<0.1> or so, which is often enough for	865	interval to a value near C<0.1> or so, which is often enough for
650	interactive servers (of course not for games), likewise for timeouts. It	866	interactive servers (of course not for games), likewise for timeouts. It
651	usually doesn't make much sense to set it to a lower value than C<0.01>,	867	usually doesn't make much sense to set it to a lower value than C<0.01>,
652	as this approsaches the timing granularity of most systems.	868	as this approaches the timing granularity of most systems. Note that if
		869	you do transactions with the outside world and you can't increase the
		870	parallelity, then this setting will limit your transaction rate (if you
		871	need to poll once per transaction and the I/O collect interval is 0.01,
		872	then you can't do more than 100 transations per second).
		873
		874	Setting the I<timeout collect interval> can improve the opportunity for
		875	saving power, as the program will "bundle" timer callback invocations that
		876	are "near" in time together, by delaying some, thus reducing the number of
		877	times the process sleeps and wakes up again. Another useful technique to
		878	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
		879	they fire on, say, one-second boundaries only.
		880
		881	Example: we only need 0.1s timeout granularity, and we wish not to poll
		882	more often than 100 times per second:
		883
		884	ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
		885	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
		886
		887	=item ev_invoke_pending (loop)
		888
		889	This call will simply invoke all pending watchers while resetting their
		890	pending state. Normally, C<ev_loop> does this automatically when required,
		891	but when overriding the invoke callback this call comes handy.
		892
		893	=item int ev_pending_count (loop)
		894
		895	Returns the number of pending watchers - zero indicates that no watchers
		896	are pending.
		897
		898	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
		899
		900	This overrides the invoke pending functionality of the loop: Instead of
		901	invoking all pending watchers when there are any, C<ev_loop> will call
		902	this callback instead. This is useful, for example, when you want to
		903	invoke the actual watchers inside another context (another thread etc.).
		904
		905	If you want to reset the callback, use C<ev_invoke_pending> as new
		906	callback.
		907
		908	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
		909
		910	Sometimes you want to share the same loop between multiple threads. This
		911	can be done relatively simply by putting mutex_lock/unlock calls around
		912	each call to a libev function.
		913
		914	However, C<ev_loop> can run an indefinite time, so it is not feasible to
		915	wait for it to return. One way around this is to wake up the loop via
		916	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
		917	and I<acquire> callbacks on the loop.
		918
		919	When set, then C<release> will be called just before the thread is
		920	suspended waiting for new events, and C<acquire> is called just
		921	afterwards.
		922
		923	Ideally, C<release> will just call your mutex_unlock function, and
		924	C<acquire> will just call the mutex_lock function again.
		925
		926	While event loop modifications are allowed between invocations of
		927	C<release> and C<acquire> (that's their only purpose after all), no
		928	modifications done will affect the event loop, i.e. adding watchers will
		929	have no effect on the set of file descriptors being watched, or the time
		930	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it
		931	to take note of any changes you made.
		932
		933	In theory, threads executing C<ev_loop> will be async-cancel safe between
		934	invocations of C<release> and C<acquire>.
		935
		936	See also the locking example in the C<THREADS> section later in this
		937	document.
		938
		939	=item ev_set_userdata (loop, void *data)
		940
		941	=item ev_userdata (loop)
		942
		943	Set and retrieve a single C<void *> associated with a loop. When
		944	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
		945	C<0.>
		946
		947	These two functions can be used to associate arbitrary data with a loop,
		948	and are intended solely for the C<invoke_pending_cb>, C<release> and
		949	C<acquire> callbacks described above, but of course can be (ab-)used for
		950	any other purpose as well.
		951
		952	=item ev_loop_verify (loop)
		953
		954	This function only does something when C<EV_VERIFY> support has been
		955	compiled in, which is the default for non-minimal builds. It tries to go
		956	through all internal structures and checks them for validity. If anything
		957	is found to be inconsistent, it will print an error message to standard
		958	error and call C<abort ()>.
		959
		960	This can be used to catch bugs inside libev itself: under normal
		961	circumstances, this function will never abort as of course libev keeps its
		962	data structures consistent.
653		963
654	=back	964	=back
655		965
656		966
657	=head1 ANATOMY OF A WATCHER	967	=head1 ANATOMY OF A WATCHER
		968
		969	In the following description, uppercase C<TYPE> in names stands for the
		970	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
		971	watchers and C<ev_io_start> for I/O watchers.
658		972
659	A watcher is a structure that you create and register to record your	973	A watcher is a structure that you create and register to record your
660	interest in some event. For instance, if you want to wait for STDIN to	974	interest in some event. For instance, if you want to wait for STDIN to
661	become readable, you would create an C<ev_io> watcher for that:	975	become readable, you would create an C<ev_io> watcher for that:
662		976
663	static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)	977	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
664	{	978	{
665	ev_io_stop (w);	979	ev_io_stop (w);
666	ev_unloop (loop, EVUNLOOP_ALL);	980	ev_unloop (loop, EVUNLOOP_ALL);
667	}	981	}
668		982
669	struct ev_loop *loop = ev_default_loop (0);	983	struct ev_loop *loop = ev_default_loop (0);
		984
670	struct ev_io stdin_watcher;	985	ev_io stdin_watcher;
		986
671	ev_init (&stdin_watcher, my_cb);	987	ev_init (&stdin_watcher, my_cb);
672	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	988	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
673	ev_io_start (loop, &stdin_watcher);	989	ev_io_start (loop, &stdin_watcher);
		990
674	ev_loop (loop, 0);	991	ev_loop (loop, 0);
675		992
676	As you can see, you are responsible for allocating the memory for your	993	As you can see, you are responsible for allocating the memory for your
677	watcher structures (and it is usually a bad idea to do this on the stack,	994	watcher structures (and it is I<usually> a bad idea to do this on the
678	although this can sometimes be quite valid).	995	stack).
		996
		997	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
		998	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
679		999
680	Each watcher structure must be initialised by a call to C<ev_init	1000	Each watcher structure must be initialised by a call to C<ev_init
681	(watcher *, callback)>, which expects a callback to be provided. This	1001	(watcher *, callback)>, which expects a callback to be provided. This
682	callback gets invoked each time the event occurs (or, in the case of io	1002	callback gets invoked each time the event occurs (or, in the case of I/O
683	watchers, each time the event loop detects that the file descriptor given	1003	watchers, each time the event loop detects that the file descriptor given
684	is readable and/or writable).	1004	is readable and/or writable).
685		1005
686	Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro	1006	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
687	with arguments specific to this watcher type. There is also a macro	1007	macro to configure it, with arguments specific to the watcher type. There
688	to combine initialisation and setting in one call: C<< ev_<type>_init	1008	is also a macro to combine initialisation and setting in one call: C<<
689	(watcher *, callback, ...) >>.	1009	ev_TYPE_init (watcher *, callback, ...) >>.
690		1010
691	To make the watcher actually watch out for events, you have to start it	1011	To make the watcher actually watch out for events, you have to start it
692	with a watcher-specific start function (C<< ev_<type>_start (loop, watcher	1012	with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher
693	*) >>), and you can stop watching for events at any time by calling the	1013	*) >>), and you can stop watching for events at any time by calling the
694	corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.	1014	corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>.
695		1015
696	As long as your watcher is active (has been started but not stopped) you	1016	As long as your watcher is active (has been started but not stopped) you
697	must not touch the values stored in it. Most specifically you must never	1017	must not touch the values stored in it. Most specifically you must never
698	reinitialise it or call its C<set> macro.	1018	reinitialise it or call its C<ev_TYPE_set> macro.
699		1019
700	Each and every callback receives the event loop pointer as first, the	1020	Each and every callback receives the event loop pointer as first, the
701	registered watcher structure as second, and a bitset of received events as	1021	registered watcher structure as second, and a bitset of received events as
702	third argument.	1022	third argument.
703		1023
…		…
757	=item C<EV_FORK>	1077	=item C<EV_FORK>
758		1078
759	The event loop has been resumed in the child process after fork (see	1079	The event loop has been resumed in the child process after fork (see
760	C<ev_fork>).	1080	C<ev_fork>).
761		1081
		1082	=item C<EV_ASYNC>
		1083
		1084	The given async watcher has been asynchronously notified (see C<ev_async>).
		1085
		1086	=item C<EV_CUSTOM>
		1087
		1088	Not ever sent (or otherwise used) by libev itself, but can be freely used
		1089	by libev users to signal watchers (e.g. via C<ev_feed_event>).
		1090
762	=item C<EV_ERROR>	1091	=item C<EV_ERROR>
763		1092
764	An unspecified error has occured, the watcher has been stopped. This might	1093	An unspecified error has occurred, the watcher has been stopped. This might
765	happen because the watcher could not be properly started because libev	1094	happen because the watcher could not be properly started because libev
766	ran out of memory, a file descriptor was found to be closed or any other	1095	ran out of memory, a file descriptor was found to be closed or any other
		1096	problem. Libev considers these application bugs.
		1097
767	problem. You best act on it by reporting the problem and somehow coping	1098	You best act on it by reporting the problem and somehow coping with the
768	with the watcher being stopped.	1099	watcher being stopped. Note that well-written programs should not receive
		1100	an error ever, so when your watcher receives it, this usually indicates a
		1101	bug in your program.
769		1102
770	Libev will usually signal a few "dummy" events together with an error,	1103	Libev will usually signal a few "dummy" events together with an error, for
771	for example it might indicate that a fd is readable or writable, and if	1104	example it might indicate that a fd is readable or writable, and if your
772	your callbacks is well-written it can just attempt the operation and cope	1105	callbacks is well-written it can just attempt the operation and cope with
773	with the error from read() or write(). This will not work in multithreaded	1106	the error from read() or write(). This will not work in multi-threaded
774	programs, though, so beware.	1107	programs, though, as the fd could already be closed and reused for another
		1108	thing, so beware.
775		1109
776	=back	1110	=back
777		1111
778	=head2 GENERIC WATCHER FUNCTIONS	1112	=head2 GENERIC WATCHER FUNCTIONS
779
780	In the following description, C<TYPE> stands for the watcher type,
781	e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
782		1113
783	=over 4	1114	=over 4
784		1115
785	=item C<ev_init> (ev_TYPE *watcher, callback)	1116	=item C<ev_init> (ev_TYPE *watcher, callback)
786		1117
…		…
792	which rolls both calls into one.	1123	which rolls both calls into one.
793		1124
794	You can reinitialise a watcher at any time as long as it has been stopped	1125	You can reinitialise a watcher at any time as long as it has been stopped
795	(or never started) and there are no pending events outstanding.	1126	(or never started) and there are no pending events outstanding.
796		1127
797	The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,	1128	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
798	int revents)>.	1129	int revents)>.
799		1130
		1131	Example: Initialise an C<ev_io> watcher in two steps.
		1132
		1133	ev_io w;
		1134	ev_init (&w, my_cb);
		1135	ev_io_set (&w, STDIN_FILENO, EV_READ);
		1136
800	=item C<ev_TYPE_set> (ev_TYPE *, [args])	1137	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
801		1138
802	This macro initialises the type-specific parts of a watcher. You need to	1139	This macro initialises the type-specific parts of a watcher. You need to
803	call C<ev_init> at least once before you call this macro, but you can	1140	call C<ev_init> at least once before you call this macro, but you can
804	call C<ev_TYPE_set> any number of times. You must not, however, call this	1141	call C<ev_TYPE_set> any number of times. You must not, however, call this
805	macro on a watcher that is active (it can be pending, however, which is a	1142	macro on a watcher that is active (it can be pending, however, which is a
806	difference to the C<ev_init> macro).	1143	difference to the C<ev_init> macro).
807		1144
808	Although some watcher types do not have type-specific arguments	1145	Although some watcher types do not have type-specific arguments
809	(e.g. C<ev_prepare>) you still need to call its C<set> macro.	1146	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
810		1147
		1148	See C<ev_init>, above, for an example.
		1149
811	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])	1150	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
812		1151
813	This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro	1152	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
814	calls into a single call. This is the most convinient method to initialise	1153	calls into a single call. This is the most convenient method to initialise
815	a watcher. The same limitations apply, of course.	1154	a watcher. The same limitations apply, of course.
816		1155
		1156	Example: Initialise and set an C<ev_io> watcher in one step.
		1157
		1158	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
		1159
817	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)	1160	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
818		1161
819	Starts (activates) the given watcher. Only active watchers will receive	1162	Starts (activates) the given watcher. Only active watchers will receive
820	events. If the watcher is already active nothing will happen.	1163	events. If the watcher is already active nothing will happen.
821		1164
		1165	Example: Start the C<ev_io> watcher that is being abused as example in this
		1166	whole section.
		1167
		1168	ev_io_start (EV_DEFAULT_UC, &w);
		1169
822	=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)	1170	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
823		1171
824	Stops the given watcher again (if active) and clears the pending	1172	Stops the given watcher if active, and clears the pending status (whether
		1173	the watcher was active or not).
		1174
825	status. It is possible that stopped watchers are pending (for example,	1175	It is possible that stopped watchers are pending - for example,
826	non-repeating timers are being stopped when they become pending), but	1176	non-repeating timers are being stopped when they become pending - but
827	C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If	1177	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
828	you want to free or reuse the memory used by the watcher it is therefore a	1178	pending. If you want to free or reuse the memory used by the watcher it is
829	good idea to always call its C<ev_TYPE_stop> function.	1179	therefore a good idea to always call its C<ev_TYPE_stop> function.
830		1180
831	=item bool ev_is_active (ev_TYPE *watcher)	1181	=item bool ev_is_active (ev_TYPE *watcher)
832		1182
833	Returns a true value iff the watcher is active (i.e. it has been started	1183	Returns a true value iff the watcher is active (i.e. it has been started
834	and not yet been stopped). As long as a watcher is active you must not modify	1184	and not yet been stopped). As long as a watcher is active you must not modify
…		…
850	=item ev_cb_set (ev_TYPE *watcher, callback)	1200	=item ev_cb_set (ev_TYPE *watcher, callback)
851		1201
852	Change the callback. You can change the callback at virtually any time	1202	Change the callback. You can change the callback at virtually any time
853	(modulo threads).	1203	(modulo threads).
854		1204
855	=item ev_set_priority (ev_TYPE *watcher, priority)	1205	=item ev_set_priority (ev_TYPE *watcher, int priority)
856		1206
857	=item int ev_priority (ev_TYPE *watcher)	1207	=item int ev_priority (ev_TYPE *watcher)
858		1208
859	Set and query the priority of the watcher. The priority is a small	1209	Set and query the priority of the watcher. The priority is a small
860	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>	1210	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
861	(default: C<-2>). Pending watchers with higher priority will be invoked	1211	(default: C<-2>). Pending watchers with higher priority will be invoked
862	before watchers with lower priority, but priority will not keep watchers	1212	before watchers with lower priority, but priority will not keep watchers
863	from being executed (except for C<ev_idle> watchers).	1213	from being executed (except for C<ev_idle> watchers).
864		1214
865	This means that priorities are I<only> used for ordering callback
866	invocation after new events have been received. This is useful, for
867	example, to reduce latency after idling, or more often, to bind two
868	watchers on the same event and make sure one is called first.
869
870	If you need to suppress invocation when higher priority events are pending	1215	If you need to suppress invocation when higher priority events are pending
871	you need to look at C<ev_idle> watchers, which provide this functionality.	1216	you need to look at C<ev_idle> watchers, which provide this functionality.
872		1217
873	You I<must not> change the priority of a watcher as long as it is active or	1218	You I<must not> change the priority of a watcher as long as it is active or
874	pending.	1219	pending.
875		1220
		1221	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		1222	fine, as long as you do not mind that the priority value you query might
		1223	or might not have been clamped to the valid range.
		1224
876	The default priority used by watchers when no priority has been set is	1225	The default priority used by watchers when no priority has been set is
877	always C<0>, which is supposed to not be too high and not be too low :).	1226	always C<0>, which is supposed to not be too high and not be too low :).
878		1227
879	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is	1228	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
880	fine, as long as you do not mind that the priority value you query might	1229	priorities.
881	or might not have been adjusted to be within valid range.
882		1230
883	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1231	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
884		1232
885	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1233	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
886	C<loop> nor C<revents> need to be valid as long as the watcher callback	1234	C<loop> nor C<revents> need to be valid as long as the watcher callback
887	can deal with that fact.	1235	can deal with that fact, as both are simply passed through to the
		1236	callback.
888		1237
889	=item int ev_clear_pending (loop, ev_TYPE *watcher)	1238	=item int ev_clear_pending (loop, ev_TYPE *watcher)
890		1239
891	If the watcher is pending, this function returns clears its pending status	1240	If the watcher is pending, this function clears its pending status and
892	and returns its C<revents> bitset (as if its callback was invoked). If the	1241	returns its C<revents> bitset (as if its callback was invoked). If the
893	watcher isn't pending it does nothing and returns C<0>.	1242	watcher isn't pending it does nothing and returns C<0>.
894		1243
		1244	Sometimes it can be useful to "poll" a watcher instead of waiting for its
		1245	callback to be invoked, which can be accomplished with this function.
		1246
		1247	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
		1248
		1249	Feeds the given event set into the event loop, as if the specified event
		1250	had happened for the specified watcher (which must be a pointer to an
		1251	initialised but not necessarily started event watcher). Obviously you must
		1252	not free the watcher as long as it has pending events.
		1253
		1254	Stopping the watcher, letting libev invoke it, or calling
		1255	C<ev_clear_pending> will clear the pending event, even if the watcher was
		1256	not started in the first place.
		1257
		1258	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
		1259	functions that do not need a watcher.
		1260
895	=back	1261	=back
896		1262
897		1263
898	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1264	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
899		1265
900	Each watcher has, by default, a member C<void *data> that you can change	1266	Each watcher has, by default, a member C<void *data> that you can change
901	and read at any time, libev will completely ignore it. This can be used	1267	and read at any time: libev will completely ignore it. This can be used
902	to associate arbitrary data with your watcher. If you need more data and	1268	to associate arbitrary data with your watcher. If you need more data and
903	don't want to allocate memory and store a pointer to it in that data	1269	don't want to allocate memory and store a pointer to it in that data
904	member, you can also "subclass" the watcher type and provide your own	1270	member, you can also "subclass" the watcher type and provide your own
905	data:	1271	data:
906		1272
907	struct my_io	1273	struct my_io
908	{	1274	{
909	struct ev_io io;	1275	ev_io io;
910	int otherfd;	1276	int otherfd;
911	void *somedata;	1277	void *somedata;
912	struct whatever *mostinteresting;	1278	struct whatever *mostinteresting;
913	}	1279	};
		1280
		1281	...
		1282	struct my_io w;
		1283	ev_io_init (&w.io, my_cb, fd, EV_READ);
914		1284
915	And since your callback will be called with a pointer to the watcher, you	1285	And since your callback will be called with a pointer to the watcher, you
916	can cast it back to your own type:	1286	can cast it back to your own type:
917		1287
918	static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)	1288	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
919	{	1289	{
920	struct my_io *w = (struct my_io *)w_;	1290	struct my_io *w = (struct my_io *)w_;
921	...	1291	...
922	}	1292	}
923		1293
924	More interesting and less C-conformant ways of casting your callback type	1294	More interesting and less C-conformant ways of casting your callback type
925	instead have been omitted.	1295	instead have been omitted.
926		1296
927	Another common scenario is having some data structure with multiple	1297	Another common scenario is to use some data structure with multiple
928	watchers:	1298	embedded watchers:
929		1299
930	struct my_biggy	1300	struct my_biggy
931	{	1301	{
932	int some_data;	1302	int some_data;
933	ev_timer t1;	1303	ev_timer t1;
934	ev_timer t2;	1304	ev_timer t2;
935	}	1305	}
936		1306
937	In this case getting the pointer to C<my_biggy> is a bit more complicated,	1307	In this case getting the pointer to C<my_biggy> is a bit more
938	you need to use C<offsetof>:	1308	complicated: Either you store the address of your C<my_biggy> struct
		1309	in the C<data> member of the watcher (for woozies), or you need to use
		1310	some pointer arithmetic using C<offsetof> inside your watchers (for real
		1311	programmers):
939		1312
940	#include <stddef.h>	1313	#include <stddef.h>
941		1314
942	static void	1315	static void
943	t1_cb (EV_P_ struct ev_timer *w, int revents)	1316	t1_cb (EV_P_ ev_timer *w, int revents)
944	{	1317	{
945	struct my_biggy big = (struct my_biggy *	1318	struct my_biggy big = (struct my_biggy *)
946	(((char *)w) - offsetof (struct my_biggy, t1));	1319	(((char *)w) - offsetof (struct my_biggy, t1));
947	}	1320	}
948		1321
949	static void	1322	static void
950	t2_cb (EV_P_ struct ev_timer *w, int revents)	1323	t2_cb (EV_P_ ev_timer *w, int revents)
951	{	1324	{
952	struct my_biggy big = (struct my_biggy *	1325	struct my_biggy big = (struct my_biggy *)
953	(((char *)w) - offsetof (struct my_biggy, t2));	1326	(((char *)w) - offsetof (struct my_biggy, t2));
954	}	1327	}
		1328
		1329	=head2 WATCHER PRIORITY MODELS
		1330
		1331	Many event loops support I<watcher priorities>, which are usually small
		1332	integers that influence the ordering of event callback invocation
		1333	between watchers in some way, all else being equal.
		1334
		1335	In libev, Watcher priorities can be set using C<ev_set_priority>. See its
		1336	description for the more technical details such as the actual priority
		1337	range.
		1338
		1339	There are two common ways how these these priorities are being interpreted
		1340	by event loops:
		1341
		1342	In the more common lock-out model, higher priorities "lock out" invocation
		1343	of lower priority watchers, which means as long as higher priority
		1344	watchers receive events, lower priority watchers are not being invoked.
		1345
		1346	The less common only-for-ordering model uses priorities solely to order
		1347	callback invocation within a single event loop iteration: Higher priority
		1348	watchers are invoked before lower priority ones, but they all get invoked
		1349	before polling for new events.
		1350
		1351	Libev uses the second (only-for-ordering) model for all its watchers
		1352	except for idle watchers (which use the lock-out model).
		1353
		1354	The rationale behind this is that implementing the lock-out model for
		1355	watchers is not well supported by most kernel interfaces, and most event
		1356	libraries will just poll for the same events again and again as long as
		1357	their callbacks have not been executed, which is very inefficient in the
		1358	common case of one high-priority watcher locking out a mass of lower
		1359	priority ones.
		1360
		1361	Static (ordering) priorities are most useful when you have two or more
		1362	watchers handling the same resource: a typical usage example is having an
		1363	C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
		1364	timeouts. Under load, data might be received while the program handles
		1365	other jobs, but since timers normally get invoked first, the timeout
		1366	handler will be executed before checking for data. In that case, giving
		1367	the timer a lower priority than the I/O watcher ensures that I/O will be
		1368	handled first even under adverse conditions (which is usually, but not
		1369	always, what you want).
		1370
		1371	Since idle watchers use the "lock-out" model, meaning that idle watchers
		1372	will only be executed when no same or higher priority watchers have
		1373	received events, they can be used to implement the "lock-out" model when
		1374	required.
		1375
		1376	For example, to emulate how many other event libraries handle priorities,
		1377	you can associate an C<ev_idle> watcher to each such watcher, and in
		1378	the normal watcher callback, you just start the idle watcher. The real
		1379	processing is done in the idle watcher callback. This causes libev to
		1380	continously poll and process kernel event data for the watcher, but when
		1381	the lock-out case is known to be rare (which in turn is rare :), this is
		1382	workable.
		1383
		1384	Usually, however, the lock-out model implemented that way will perform
		1385	miserably under the type of load it was designed to handle. In that case,
		1386	it might be preferable to stop the real watcher before starting the
		1387	idle watcher, so the kernel will not have to process the event in case
		1388	the actual processing will be delayed for considerable time.
		1389
		1390	Here is an example of an I/O watcher that should run at a strictly lower
		1391	priority than the default, and which should only process data when no
		1392	other events are pending:
		1393
		1394	ev_idle idle; // actual processing watcher
		1395	ev_io io; // actual event watcher
		1396
		1397	static void
		1398	io_cb (EV_P_ ev_io *w, int revents)
		1399	{
		1400	// stop the I/O watcher, we received the event, but
		1401	// are not yet ready to handle it.
		1402	ev_io_stop (EV_A_ w);
		1403
		1404	// start the idle watcher to ahndle the actual event.
		1405	// it will not be executed as long as other watchers
		1406	// with the default priority are receiving events.
		1407	ev_idle_start (EV_A_ &idle);
		1408	}
		1409
		1410	static void
		1411	idle_cb (EV_P_ ev_idle *w, int revents)
		1412	{
		1413	// actual processing
		1414	read (STDIN_FILENO, ...);
		1415
		1416	// have to start the I/O watcher again, as
		1417	// we have handled the event
		1418	ev_io_start (EV_P_ &io);
		1419	}
		1420
		1421	// initialisation
		1422	ev_idle_init (&idle, idle_cb);
		1423	ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
		1424	ev_io_start (EV_DEFAULT_ &io);
		1425
		1426	In the "real" world, it might also be beneficial to start a timer, so that
		1427	low-priority connections can not be locked out forever under load. This
		1428	enables your program to keep a lower latency for important connections
		1429	during short periods of high load, while not completely locking out less
		1430	important ones.
955		1431
956		1432
957	=head1 WATCHER TYPES	1433	=head1 WATCHER TYPES
958		1434
959	This section describes each watcher in detail, but will not repeat	1435	This section describes each watcher in detail, but will not repeat
…		…
983	In general you can register as many read and/or write event watchers per	1459	In general you can register as many read and/or write event watchers per
984	fd as you want (as long as you don't confuse yourself). Setting all file	1460	fd as you want (as long as you don't confuse yourself). Setting all file
985	descriptors to non-blocking mode is also usually a good idea (but not	1461	descriptors to non-blocking mode is also usually a good idea (but not
986	required if you know what you are doing).	1462	required if you know what you are doing).
987		1463
988	If you must do this, then force the use of a known-to-be-good backend	1464	If you cannot use non-blocking mode, then force the use of a
989	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and	1465	known-to-be-good backend (at the time of this writing, this includes only
990	C<EVBACKEND_POLL>).	1466	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
		1467	descriptors for which non-blocking operation makes no sense (such as
		1468	files) - libev doesn't guarentee any specific behaviour in that case.
991		1469
992	Another thing you have to watch out for is that it is quite easy to	1470	Another thing you have to watch out for is that it is quite easy to
993	receive "spurious" readyness notifications, that is your callback might	1471	receive "spurious" readiness notifications, that is your callback might
994	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1472	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
995	because there is no data. Not only are some backends known to create a	1473	because there is no data. Not only are some backends known to create a
996	lot of those (for example solaris ports), it is very easy to get into	1474	lot of those (for example Solaris ports), it is very easy to get into
997	this situation even with a relatively standard program structure. Thus	1475	this situation even with a relatively standard program structure. Thus
998	it is best to always use non-blocking I/O: An extra C<read>(2) returning	1476	it is best to always use non-blocking I/O: An extra C<read>(2) returning
999	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1477	C<EAGAIN> is far preferable to a program hanging until some data arrives.
1000		1478
1001	If you cannot run the fd in non-blocking mode (for example you should not	1479	If you cannot run the fd in non-blocking mode (for example you should
1002	play around with an Xlib connection), then you have to seperately re-test	1480	not play around with an Xlib connection), then you have to separately
1003	whether a file descriptor is really ready with a known-to-be good interface	1481	re-test whether a file descriptor is really ready with a known-to-be good
1004	such as poll (fortunately in our Xlib example, Xlib already does this on	1482	interface such as poll (fortunately in our Xlib example, Xlib already
1005	its own, so its quite safe to use).	1483	does this on its own, so its quite safe to use). Some people additionally
		1484	use C<SIGALRM> and an interval timer, just to be sure you won't block
		1485	indefinitely.
		1486
		1487	But really, best use non-blocking mode.
1006		1488
1007	=head3 The special problem of disappearing file descriptors	1489	=head3 The special problem of disappearing file descriptors
1008		1490
1009	Some backends (e.g. kqueue, epoll) need to be told about closing a file	1491	Some backends (e.g. kqueue, epoll) need to be told about closing a file
1010	descriptor (either by calling C<close> explicitly or by any other means,	1492	descriptor (either due to calling C<close> explicitly or any other means,
1011	such as C<dup>). The reason is that you register interest in some file	1493	such as C<dup2>). The reason is that you register interest in some file
1012	descriptor, but when it goes away, the operating system will silently drop	1494	descriptor, but when it goes away, the operating system will silently drop
1013	this interest. If another file descriptor with the same number then is	1495	this interest. If another file descriptor with the same number then is
1014	registered with libev, there is no efficient way to see that this is, in	1496	registered with libev, there is no efficient way to see that this is, in
1015	fact, a different file descriptor.	1497	fact, a different file descriptor.
1016		1498
…		…
1045	To support fork in your programs, you either have to call	1527	To support fork in your programs, you either have to call
1046	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1528	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1047	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1529	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1048	C<EVBACKEND_POLL>.	1530	C<EVBACKEND_POLL>.
1049		1531
		1532	=head3 The special problem of SIGPIPE
		1533
		1534	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
		1535	when writing to a pipe whose other end has been closed, your program gets
		1536	sent a SIGPIPE, which, by default, aborts your program. For most programs
		1537	this is sensible behaviour, for daemons, this is usually undesirable.
		1538
		1539	So when you encounter spurious, unexplained daemon exits, make sure you
		1540	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
		1541	somewhere, as that would have given you a big clue).
		1542
		1543	=head3 The special problem of accept()ing when you can't
		1544
		1545	Many implementations of the POSIX C<accept> function (for example,
		1546	found in port-2004 Linux) have the peculiar behaviour of not removing a
		1547	connection from the pending queue in all error cases.
		1548
		1549	For example, larger servers often run out of file descriptors (because
		1550	of resource limits), causing C<accept> to fail with C<ENFILE> but not
		1551	rejecting the connection, leading to libev signalling readiness on
		1552	the next iteration again (the connection still exists after all), and
		1553	typically causing the program to loop at 100% CPU usage.
		1554
		1555	Unfortunately, the set of errors that cause this issue differs between
		1556	operating systems, there is usually little the app can do to remedy the
		1557	situation, and no known thread-safe method of removing the connection to
		1558	cope with overload is known (to me).
		1559
		1560	One of the easiest ways to handle this situation is to just ignore it
		1561	- when the program encounters an overload, it will just loop until the
		1562	situation is over. While this is a form of busy waiting, no OS offers an
		1563	event-based way to handle this situation, so it's the best one can do.
		1564
		1565	A better way to handle the situation is to log any errors other than
		1566	C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
		1567	messages, and continue as usual, which at least gives the user an idea of
		1568	what could be wrong ("raise the ulimit!"). For extra points one could stop
		1569	the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
		1570	usage.
		1571
		1572	If your program is single-threaded, then you could also keep a dummy file
		1573	descriptor for overload situations (e.g. by opening F</dev/null>), and
		1574	when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
		1575	close that fd, and create a new dummy fd. This will gracefully refuse
		1576	clients under typical overload conditions.
		1577
		1578	The last way to handle it is to simply log the error and C<exit>, as
		1579	is often done with C<malloc> failures, but this results in an easy
		1580	opportunity for a DoS attack.
1050		1581
1051	=head3 Watcher-Specific Functions	1582	=head3 Watcher-Specific Functions
1052		1583
1053	=over 4	1584	=over 4
1054		1585
1055	=item ev_io_init (ev_io *, callback, int fd, int events)	1586	=item ev_io_init (ev_io *, callback, int fd, int events)
1056		1587
1057	=item ev_io_set (ev_io *, int fd, int events)	1588	=item ev_io_set (ev_io *, int fd, int events)
1058		1589
1059	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to	1590	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1060	rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or	1591	receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or
1061	C<EV_READ | EV_WRITE> to receive the given events.	1592	C<EV_READ | EV_WRITE>, to express the desire to receive the given events.
1062		1593
1063	=item int fd [read-only]	1594	=item int fd [read-only]
1064		1595
1065	The file descriptor being watched.	1596	The file descriptor being watched.
1066		1597
…		…
1074		1605
1075	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well	1606	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1076	readable, but only once. Since it is likely line-buffered, you could	1607	readable, but only once. Since it is likely line-buffered, you could
1077	attempt to read a whole line in the callback.	1608	attempt to read a whole line in the callback.
1078		1609
1079	static void	1610	static void
1080	stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)	1611	stdin_readable_cb (struct ev_loop *loop, ev_io *w, int revents)
1081	{	1612	{
1082	ev_io_stop (loop, w);	1613	ev_io_stop (loop, w);
1083	.. read from stdin here (or from w->fd) and haqndle any I/O errors	1614	.. read from stdin here (or from w->fd) and handle any I/O errors
1084	}	1615	}
1085		1616
1086	...	1617	...
1087	struct ev_loop *loop = ev_default_init (0);	1618	struct ev_loop *loop = ev_default_init (0);
1088	struct ev_io stdin_readable;	1619	ev_io stdin_readable;
1089	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1620	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1090	ev_io_start (loop, &stdin_readable);	1621	ev_io_start (loop, &stdin_readable);
1091	ev_loop (loop, 0);	1622	ev_loop (loop, 0);
1092		1623
1093		1624
1094	=head2 C<ev_timer> - relative and optionally repeating timeouts	1625	=head2 C<ev_timer> - relative and optionally repeating timeouts
1095		1626
1096	Timer watchers are simple relative timers that generate an event after a	1627	Timer watchers are simple relative timers that generate an event after a
1097	given time, and optionally repeating in regular intervals after that.	1628	given time, and optionally repeating in regular intervals after that.
1098		1629
1099	The timers are based on real time, that is, if you register an event that	1630	The timers are based on real time, that is, if you register an event that
1100	times out after an hour and you reset your system clock to last years	1631	times out after an hour and you reset your system clock to January last
1101	time, it will still time out after (roughly) and hour. "Roughly" because	1632	year, it will still time out after (roughly) one hour. "Roughly" because
1102	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1633	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1103	monotonic clock option helps a lot here).	1634	monotonic clock option helps a lot here).
		1635
		1636	The callback is guaranteed to be invoked only I<after> its timeout has
		1637	passed (not I<at>, so on systems with very low-resolution clocks this
		1638	might introduce a small delay). If multiple timers become ready during the
		1639	same loop iteration then the ones with earlier time-out values are invoked
		1640	before ones of the same priority with later time-out values (but this is
		1641	no longer true when a callback calls C<ev_loop> recursively).
		1642
		1643	=head3 Be smart about timeouts
		1644
		1645	Many real-world problems involve some kind of timeout, usually for error
		1646	recovery. A typical example is an HTTP request - if the other side hangs,
		1647	you want to raise some error after a while.
		1648
		1649	What follows are some ways to handle this problem, from obvious and
		1650	inefficient to smart and efficient.
		1651
		1652	In the following, a 60 second activity timeout is assumed - a timeout that
		1653	gets reset to 60 seconds each time there is activity (e.g. each time some
		1654	data or other life sign was received).
		1655
		1656	=over 4
		1657
		1658	=item 1. Use a timer and stop, reinitialise and start it on activity.
		1659
		1660	This is the most obvious, but not the most simple way: In the beginning,
		1661	start the watcher:
		1662
		1663	ev_timer_init (timer, callback, 60., 0.);
		1664	ev_timer_start (loop, timer);
		1665
		1666	Then, each time there is some activity, C<ev_timer_stop> it, initialise it
		1667	and start it again:
		1668
		1669	ev_timer_stop (loop, timer);
		1670	ev_timer_set (timer, 60., 0.);
		1671	ev_timer_start (loop, timer);
		1672
		1673	This is relatively simple to implement, but means that each time there is
		1674	some activity, libev will first have to remove the timer from its internal
		1675	data structure and then add it again. Libev tries to be fast, but it's
		1676	still not a constant-time operation.
		1677
		1678	=item 2. Use a timer and re-start it with C<ev_timer_again> inactivity.
		1679
		1680	This is the easiest way, and involves using C<ev_timer_again> instead of
		1681	C<ev_timer_start>.
		1682
		1683	To implement this, configure an C<ev_timer> with a C<repeat> value
		1684	of C<60> and then call C<ev_timer_again> at start and each time you
		1685	successfully read or write some data. If you go into an idle state where
		1686	you do not expect data to travel on the socket, you can C<ev_timer_stop>
		1687	the timer, and C<ev_timer_again> will automatically restart it if need be.
		1688
		1689	That means you can ignore both the C<ev_timer_start> function and the
		1690	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
		1691	member and C<ev_timer_again>.
		1692
		1693	At start:
		1694
		1695	ev_init (timer, callback);
		1696	timer->repeat = 60.;
		1697	ev_timer_again (loop, timer);
		1698
		1699	Each time there is some activity:
		1700
		1701	ev_timer_again (loop, timer);
		1702
		1703	It is even possible to change the time-out on the fly, regardless of
		1704	whether the watcher is active or not:
		1705
		1706	timer->repeat = 30.;
		1707	ev_timer_again (loop, timer);
		1708
		1709	This is slightly more efficient then stopping/starting the timer each time
		1710	you want to modify its timeout value, as libev does not have to completely
		1711	remove and re-insert the timer from/into its internal data structure.
		1712
		1713	It is, however, even simpler than the "obvious" way to do it.
		1714
		1715	=item 3. Let the timer time out, but then re-arm it as required.
		1716
		1717	This method is more tricky, but usually most efficient: Most timeouts are
		1718	relatively long compared to the intervals between other activity - in
		1719	our example, within 60 seconds, there are usually many I/O events with
		1720	associated activity resets.
		1721
		1722	In this case, it would be more efficient to leave the C<ev_timer> alone,
		1723	but remember the time of last activity, and check for a real timeout only
		1724	within the callback:
		1725
		1726	ev_tstamp last_activity; // time of last activity
		1727
		1728	static void
		1729	callback (EV_P_ ev_timer *w, int revents)
		1730	{
		1731	ev_tstamp now = ev_now (EV_A);
		1732	ev_tstamp timeout = last_activity + 60.;
		1733
		1734	// if last_activity + 60. is older than now, we did time out
		1735	if (timeout < now)
		1736	{
		1737	// timeout occured, take action
		1738	}
		1739	else
		1740	{
		1741	// callback was invoked, but there was some activity, re-arm
		1742	// the watcher to fire in last_activity + 60, which is
		1743	// guaranteed to be in the future, so "again" is positive:
		1744	w->repeat = timeout - now;
		1745	ev_timer_again (EV_A_ w);
		1746	}
		1747	}
		1748
		1749	To summarise the callback: first calculate the real timeout (defined
		1750	as "60 seconds after the last activity"), then check if that time has
		1751	been reached, which means something I<did>, in fact, time out. Otherwise
		1752	the callback was invoked too early (C<timeout> is in the future), so
		1753	re-schedule the timer to fire at that future time, to see if maybe we have
		1754	a timeout then.
		1755
		1756	Note how C<ev_timer_again> is used, taking advantage of the
		1757	C<ev_timer_again> optimisation when the timer is already running.
		1758
		1759	This scheme causes more callback invocations (about one every 60 seconds
		1760	minus half the average time between activity), but virtually no calls to
		1761	libev to change the timeout.
		1762
		1763	To start the timer, simply initialise the watcher and set C<last_activity>
		1764	to the current time (meaning we just have some activity :), then call the
		1765	callback, which will "do the right thing" and start the timer:
		1766
		1767	ev_init (timer, callback);
		1768	last_activity = ev_now (loop);
		1769	callback (loop, timer, EV_TIMEOUT);
		1770
		1771	And when there is some activity, simply store the current time in
		1772	C<last_activity>, no libev calls at all:
		1773
		1774	last_actiivty = ev_now (loop);
		1775
		1776	This technique is slightly more complex, but in most cases where the
		1777	time-out is unlikely to be triggered, much more efficient.
		1778
		1779	Changing the timeout is trivial as well (if it isn't hard-coded in the
		1780	callback :) - just change the timeout and invoke the callback, which will
		1781	fix things for you.
		1782
		1783	=item 4. Wee, just use a double-linked list for your timeouts.
		1784
		1785	If there is not one request, but many thousands (millions...), all
		1786	employing some kind of timeout with the same timeout value, then one can
		1787	do even better:
		1788
		1789	When starting the timeout, calculate the timeout value and put the timeout
		1790	at the I<end> of the list.
		1791
		1792	Then use an C<ev_timer> to fire when the timeout at the I<beginning> of
		1793	the list is expected to fire (for example, using the technique #3).
		1794
		1795	When there is some activity, remove the timer from the list, recalculate
		1796	the timeout, append it to the end of the list again, and make sure to
		1797	update the C<ev_timer> if it was taken from the beginning of the list.
		1798
		1799	This way, one can manage an unlimited number of timeouts in O(1) time for
		1800	starting, stopping and updating the timers, at the expense of a major
		1801	complication, and having to use a constant timeout. The constant timeout
		1802	ensures that the list stays sorted.
		1803
		1804	=back
		1805
		1806	So which method the best?
		1807
		1808	Method #2 is a simple no-brain-required solution that is adequate in most
		1809	situations. Method #3 requires a bit more thinking, but handles many cases
		1810	better, and isn't very complicated either. In most case, choosing either
		1811	one is fine, with #3 being better in typical situations.
		1812
		1813	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
		1814	rather complicated, but extremely efficient, something that really pays
		1815	off after the first million or so of active timers, i.e. it's usually
		1816	overkill :)
		1817
		1818	=head3 The special problem of time updates
		1819
		1820	Establishing the current time is a costly operation (it usually takes at
		1821	least two system calls): EV therefore updates its idea of the current
		1822	time only before and after C<ev_loop> collects new events, which causes a
		1823	growing difference between C<ev_now ()> and C<ev_time ()> when handling
		1824	lots of events in one iteration.
1104		1825
1105	The relative timeouts are calculated relative to the C<ev_now ()>	1826	The relative timeouts are calculated relative to the C<ev_now ()>
1106	time. This is usually the right thing as this timestamp refers to the time	1827	time. This is usually the right thing as this timestamp refers to the time
1107	of the event triggering whatever timeout you are modifying/starting. If	1828	of the event triggering whatever timeout you are modifying/starting. If
1108	you suspect event processing to be delayed and you I<need> to base the timeout	1829	you suspect event processing to be delayed and you I<need> to base the
1109	on the current time, use something like this to adjust for this:	1830	timeout on the current time, use something like this to adjust for this:
1110		1831
1111	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	1832	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1112		1833
1113	The callback is guarenteed to be invoked only when its timeout has passed,	1834	If the event loop is suspended for a long time, you can also force an
1114	but if multiple timers become ready during the same loop iteration then	1835	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1115	order of execution is undefined.	1836	()>.
		1837
		1838	=head3 The special problems of suspended animation
		1839
		1840	When you leave the server world it is quite customary to hit machines that
		1841	can suspend/hibernate - what happens to the clocks during such a suspend?
		1842
		1843	Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
		1844	all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
		1845	to run until the system is suspended, but they will not advance while the
		1846	system is suspended. That means, on resume, it will be as if the program
		1847	was frozen for a few seconds, but the suspend time will not be counted
		1848	towards C<ev_timer> when a monotonic clock source is used. The real time
		1849	clock advanced as expected, but if it is used as sole clocksource, then a
		1850	long suspend would be detected as a time jump by libev, and timers would
		1851	be adjusted accordingly.
		1852
		1853	I would not be surprised to see different behaviour in different between
		1854	operating systems, OS versions or even different hardware.
		1855
		1856	The other form of suspend (job control, or sending a SIGSTOP) will see a
		1857	time jump in the monotonic clocks and the realtime clock. If the program
		1858	is suspended for a very long time, and monotonic clock sources are in use,
		1859	then you can expect C<ev_timer>s to expire as the full suspension time
		1860	will be counted towards the timers. When no monotonic clock source is in
		1861	use, then libev will again assume a timejump and adjust accordingly.
		1862
		1863	It might be beneficial for this latter case to call C<ev_suspend>
		1864	and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
		1865	deterministic behaviour in this case (you can do nothing against
		1866	C<SIGSTOP>).
1116		1867
1117	=head3 Watcher-Specific Functions and Data Members	1868	=head3 Watcher-Specific Functions and Data Members
1118		1869
1119	=over 4	1870	=over 4
1120		1871
1121	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1872	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1122		1873
1123	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	1874	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1124		1875
1125	Configure the timer to trigger after C<after> seconds. If C<repeat> is	1876	Configure the timer to trigger after C<after> seconds. If C<repeat>
1126	C<0.>, then it will automatically be stopped. If it is positive, then the	1877	is C<0.>, then it will automatically be stopped once the timeout is
1127	timer will automatically be configured to trigger again C<repeat> seconds	1878	reached. If it is positive, then the timer will automatically be
1128	later, again, and again, until stopped manually.	1879	configured to trigger again C<repeat> seconds later, again, and again,
		1880	until stopped manually.
1129		1881
1130	The timer itself will do a best-effort at avoiding drift, that is, if you	1882	The timer itself will do a best-effort at avoiding drift, that is, if
1131	configure a timer to trigger every 10 seconds, then it will trigger at	1883	you configure a timer to trigger every 10 seconds, then it will normally
1132	exactly 10 second intervals. If, however, your program cannot keep up with	1884	trigger at exactly 10 second intervals. If, however, your program cannot
1133	the timer (because it takes longer than those 10 seconds to do stuff) the	1885	keep up with the timer (because it takes longer than those 10 seconds to
1134	timer will not fire more than once per event loop iteration.	1886	do stuff) the timer will not fire more than once per event loop iteration.
1135		1887
1136	=item ev_timer_again (loop)	1888	=item ev_timer_again (loop, ev_timer *)
1137		1889
1138	This will act as if the timer timed out and restart it again if it is	1890	This will act as if the timer timed out and restart it again if it is
1139	repeating. The exact semantics are:	1891	repeating. The exact semantics are:
1140		1892
1141	If the timer is pending, its pending status is cleared.	1893	If the timer is pending, its pending status is cleared.
1142		1894
1143	If the timer is started but nonrepeating, stop it (as if it timed out).	1895	If the timer is started but non-repeating, stop it (as if it timed out).
1144		1896
1145	If the timer is repeating, either start it if necessary (with the	1897	If the timer is repeating, either start it if necessary (with the
1146	C<repeat> value), or reset the running timer to the C<repeat> value.	1898	C<repeat> value), or reset the running timer to the C<repeat> value.
1147		1899
1148	This sounds a bit complicated, but here is a useful and typical	1900	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1149	example: Imagine you have a tcp connection and you want a so-called idle	1901	usage example.
1150	timeout, that is, you want to be called when there have been, say, 60
1151	seconds of inactivity on the socket. The easiest way to do this is to
1152	configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1153	C<ev_timer_again> each time you successfully read or write some data. If
1154	you go into an idle state where you do not expect data to travel on the
1155	socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1156	automatically restart it if need be.
1157		1902
1158	That means you can ignore the C<after> value and C<ev_timer_start>	1903	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1159	altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1160		1904
1161	ev_timer_init (timer, callback, 0., 5.);	1905	Returns the remaining time until a timer fires. If the timer is active,
1162	ev_timer_again (loop, timer);	1906	then this time is relative to the current event loop time, otherwise it's
1163	...	1907	the timeout value currently configured.
1164	timer->again = 17.;
1165	ev_timer_again (loop, timer);
1166	...
1167	timer->again = 10.;
1168	ev_timer_again (loop, timer);
1169		1908
1170	This is more slightly efficient then stopping/starting the timer each time	1909	That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1171	you want to modify its timeout value.	1910	C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
		1911	will return C<4>. When the timer expires and is restarted, it will return
		1912	roughly C<7> (likely slightly less as callback invocation takes some time,
		1913	too), and so on.
1172		1914
1173	=item ev_tstamp repeat [read-write]	1915	=item ev_tstamp repeat [read-write]
1174		1916
1175	The current C<repeat> value. Will be used each time the watcher times out	1917	The current C<repeat> value. Will be used each time the watcher times out
1176	or C<ev_timer_again> is called and determines the next timeout (if any),	1918	or C<ev_timer_again> is called, and determines the next timeout (if any),
1177	which is also when any modifications are taken into account.	1919	which is also when any modifications are taken into account.
1178		1920
1179	=back	1921	=back
1180		1922
1181	=head3 Examples	1923	=head3 Examples
1182		1924
1183	Example: Create a timer that fires after 60 seconds.	1925	Example: Create a timer that fires after 60 seconds.
1184		1926
1185	static void	1927	static void
1186	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1928	one_minute_cb (struct ev_loop *loop, ev_timer *w, int revents)
1187	{	1929	{
1188	.. one minute over, w is actually stopped right here	1930	.. one minute over, w is actually stopped right here
1189	}	1931	}
1190		1932
1191	struct ev_timer mytimer;	1933	ev_timer mytimer;
1192	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);	1934	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1193	ev_timer_start (loop, &mytimer);	1935	ev_timer_start (loop, &mytimer);
1194		1936
1195	Example: Create a timeout timer that times out after 10 seconds of	1937	Example: Create a timeout timer that times out after 10 seconds of
1196	inactivity.	1938	inactivity.
1197		1939
1198	static void	1940	static void
1199	timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1941	timeout_cb (struct ev_loop *loop, ev_timer *w, int revents)
1200	{	1942	{
1201	.. ten seconds without any activity	1943	.. ten seconds without any activity
1202	}	1944	}
1203		1945
1204	struct ev_timer mytimer;	1946	ev_timer mytimer;
1205	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	1947	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1206	ev_timer_again (&mytimer); /* start timer */	1948	ev_timer_again (&mytimer); /* start timer */
1207	ev_loop (loop, 0);	1949	ev_loop (loop, 0);
1208		1950
1209	// and in some piece of code that gets executed on any "activity":	1951	// and in some piece of code that gets executed on any "activity":
1210	// reset the timeout to start ticking again at 10 seconds	1952	// reset the timeout to start ticking again at 10 seconds
1211	ev_timer_again (&mytimer);	1953	ev_timer_again (&mytimer);
1212		1954
1213		1955
1214	=head2 C<ev_periodic> - to cron or not to cron?	1956	=head2 C<ev_periodic> - to cron or not to cron?
1215		1957
1216	Periodic watchers are also timers of a kind, but they are very versatile	1958	Periodic watchers are also timers of a kind, but they are very versatile
1217	(and unfortunately a bit complex).	1959	(and unfortunately a bit complex).
1218		1960
1219	Unlike C<ev_timer>'s, they are not based on real time (or relative time)	1961	Unlike C<ev_timer>, periodic watchers are not based on real time (or
1220	but on wallclock time (absolute time). You can tell a periodic watcher	1962	relative time, the physical time that passes) but on wall clock time
1221	to trigger "at" some specific point in time. For example, if you tell a	1963	(absolute time, the thing you can read on your calender or clock). The
1222	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()	1964	difference is that wall clock time can run faster or slower than real
1223	+ 10.>) and then reset your system clock to the last year, then it will	1965	time, and time jumps are not uncommon (e.g. when you adjust your
1224	take a year to trigger the event (unlike an C<ev_timer>, which would trigger	1966	wrist-watch).
1225	roughly 10 seconds later).
1226		1967
1227	They can also be used to implement vastly more complex timers, such as	1968	You can tell a periodic watcher to trigger after some specific point
1228	triggering an event on each midnight, local time or other, complicated,	1969	in time: for example, if you tell a periodic watcher to trigger "in 10
1229	rules.	1970	seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time
		1971	not a delay) and then reset your system clock to January of the previous
		1972	year, then it will take a year or more to trigger the event (unlike an
		1973	C<ev_timer>, which would still trigger roughly 10 seconds after starting
		1974	it, as it uses a relative timeout).
1230		1975
		1976	C<ev_periodic> watchers can also be used to implement vastly more complex
		1977	timers, such as triggering an event on each "midnight, local time", or
		1978	other complicated rules. This cannot be done with C<ev_timer> watchers, as
		1979	those cannot react to time jumps.
		1980
1231	As with timers, the callback is guarenteed to be invoked only when the	1981	As with timers, the callback is guaranteed to be invoked only when the
1232	time (C<at>) has been passed, but if multiple periodic timers become ready	1982	point in time where it is supposed to trigger has passed. If multiple
1233	during the same loop iteration then order of execution is undefined.	1983	timers become ready during the same loop iteration then the ones with
		1984	earlier time-out values are invoked before ones with later time-out values
		1985	(but this is no longer true when a callback calls C<ev_loop> recursively).
1234		1986
1235	=head3 Watcher-Specific Functions and Data Members	1987	=head3 Watcher-Specific Functions and Data Members
1236		1988
1237	=over 4	1989	=over 4
1238		1990
1239	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1991	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1240		1992
1241	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	1993	=item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1242		1994
1243	Lots of arguments, lets sort it out... There are basically three modes of	1995	Lots of arguments, let's sort it out... There are basically three modes of
1244	operation, and we will explain them from simplest to complex:	1996	operation, and we will explain them from simplest to most complex:
1245		1997
1246	=over 4	1998	=over 4
1247		1999
1248	=item * absolute timer (at = time, interval = reschedule_cb = 0)	2000	=item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0)
1249		2001
1250	In this configuration the watcher triggers an event at the wallclock time	2002	In this configuration the watcher triggers an event after the wall clock
1251	C<at> and doesn't repeat. It will not adjust when a time jump occurs,	2003	time C<offset> has passed. It will not repeat and will not adjust when a
1252	that is, if it is to be run at January 1st 2011 then it will run when the	2004	time jump occurs, that is, if it is to be run at January 1st 2011 then it
1253	system time reaches or surpasses this time.	2005	will be stopped and invoked when the system clock reaches or surpasses
		2006	this point in time.
1254		2007
1255	=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)	2008	=item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0)
1256		2009
1257	In this mode the watcher will always be scheduled to time out at the next	2010	In this mode the watcher will always be scheduled to time out at the next
1258	C<at + N * interval> time (for some integer N, which can also be negative)	2011	C<offset + N * interval> time (for some integer N, which can also be
1259	and then repeat, regardless of any time jumps.	2012	negative) and then repeat, regardless of any time jumps. The C<offset>
		2013	argument is merely an offset into the C<interval> periods.
1260		2014
1261	This can be used to create timers that do not drift with respect to system	2015	This can be used to create timers that do not drift with respect to the
1262	time:	2016	system clock, for example, here is an C<ev_periodic> that triggers each
		2017	hour, on the hour (with respect to UTC):
1263		2018
1264	ev_periodic_set (&periodic, 0., 3600., 0);	2019	ev_periodic_set (&periodic, 0., 3600., 0);
1265		2020
1266	This doesn't mean there will always be 3600 seconds in between triggers,	2021	This doesn't mean there will always be 3600 seconds in between triggers,
1267	but only that the the callback will be called when the system time shows a	2022	but only that the callback will be called when the system time shows a
1268	full hour (UTC), or more correctly, when the system time is evenly divisible	2023	full hour (UTC), or more correctly, when the system time is evenly divisible
1269	by 3600.	2024	by 3600.
1270		2025
1271	Another way to think about it (for the mathematically inclined) is that	2026	Another way to think about it (for the mathematically inclined) is that
1272	C<ev_periodic> will try to run the callback in this mode at the next possible	2027	C<ev_periodic> will try to run the callback in this mode at the next possible
1273	time where C<time = at (mod interval)>, regardless of any time jumps.	2028	time where C<time = offset (mod interval)>, regardless of any time jumps.
1274		2029
1275	For numerical stability it is preferable that the C<at> value is near	2030	For numerical stability it is preferable that the C<offset> value is near
1276	C<ev_now ()> (the current time), but there is no range requirement for	2031	C<ev_now ()> (the current time), but there is no range requirement for
1277	this value.	2032	this value, and in fact is often specified as zero.
1278		2033
		2034	Note also that there is an upper limit to how often a timer can fire (CPU
		2035	speed for example), so if C<interval> is very small then timing stability
		2036	will of course deteriorate. Libev itself tries to be exact to be about one
		2037	millisecond (if the OS supports it and the machine is fast enough).
		2038
1279	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)	2039	=item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback)
1280		2040
1281	In this mode the values for C<interval> and C<at> are both being	2041	In this mode the values for C<interval> and C<offset> are both being
1282	ignored. Instead, each time the periodic watcher gets scheduled, the	2042	ignored. Instead, each time the periodic watcher gets scheduled, the
1283	reschedule callback will be called with the watcher as first, and the	2043	reschedule callback will be called with the watcher as first, and the
1284	current time as second argument.	2044	current time as second argument.
1285		2045
1286	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	2046	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever,
1287	ever, or make any event loop modifications>. If you need to stop it,	2047	or make ANY other event loop modifications whatsoever, unless explicitly
1288	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by	2048	allowed by documentation here>.
1289	starting an C<ev_prepare> watcher, which is legal).
1290		2049
		2050	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
		2051	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
		2052	only event loop modification you are allowed to do).
		2053
1291	Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,	2054	The callback prototype is C<ev_tstamp (*reschedule_cb)(ev_periodic
1292	ev_tstamp now)>, e.g.:	2055	*w, ev_tstamp now)>, e.g.:
1293		2056
		2057	static ev_tstamp
1294	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)	2058	my_rescheduler (ev_periodic *w, ev_tstamp now)
1295	{	2059	{
1296	return now + 60.;	2060	return now + 60.;
1297	}	2061	}
1298		2062
1299	It must return the next time to trigger, based on the passed time value	2063	It must return the next time to trigger, based on the passed time value
1300	(that is, the lowest time value larger than to the second argument). It	2064	(that is, the lowest time value larger than to the second argument). It
1301	will usually be called just before the callback will be triggered, but	2065	will usually be called just before the callback will be triggered, but
1302	might be called at other times, too.	2066	might be called at other times, too.
1303		2067
1304	NOTE: I<< This callback must always return a time that is later than the	2068	NOTE: I<< This callback must always return a time that is higher than or
1305	passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.	2069	equal to the passed C<now> value >>.
1306		2070
1307	This can be used to create very complex timers, such as a timer that	2071	This can be used to create very complex timers, such as a timer that
1308	triggers on each midnight, local time. To do this, you would calculate the	2072	triggers on "next midnight, local time". To do this, you would calculate the
1309	next midnight after C<now> and return the timestamp value for this. How	2073	next midnight after C<now> and return the timestamp value for this. How
1310	you do this is, again, up to you (but it is not trivial, which is the main	2074	you do this is, again, up to you (but it is not trivial, which is the main
1311	reason I omitted it as an example).	2075	reason I omitted it as an example).
1312		2076
1313	=back	2077	=back
…		…
1317	Simply stops and restarts the periodic watcher again. This is only useful	2081	Simply stops and restarts the periodic watcher again. This is only useful
1318	when you changed some parameters or the reschedule callback would return	2082	when you changed some parameters or the reschedule callback would return
1319	a different time than the last time it was called (e.g. in a crond like	2083	a different time than the last time it was called (e.g. in a crond like
1320	program when the crontabs have changed).	2084	program when the crontabs have changed).
1321		2085
		2086	=item ev_tstamp ev_periodic_at (ev_periodic *)
		2087
		2088	When active, returns the absolute time that the watcher is supposed
		2089	to trigger next. This is not the same as the C<offset> argument to
		2090	C<ev_periodic_set>, but indeed works even in interval and manual
		2091	rescheduling modes.
		2092
1322	=item ev_tstamp offset [read-write]	2093	=item ev_tstamp offset [read-write]
1323		2094
1324	When repeating, this contains the offset value, otherwise this is the	2095	When repeating, this contains the offset value, otherwise this is the
1325	absolute point in time (the C<at> value passed to C<ev_periodic_set>).	2096	absolute point in time (the C<offset> value passed to C<ev_periodic_set>,
		2097	although libev might modify this value for better numerical stability).
1326		2098
1327	Can be modified any time, but changes only take effect when the periodic	2099	Can be modified any time, but changes only take effect when the periodic
1328	timer fires or C<ev_periodic_again> is being called.	2100	timer fires or C<ev_periodic_again> is being called.
1329		2101
1330	=item ev_tstamp interval [read-write]	2102	=item ev_tstamp interval [read-write]
1331		2103
1332	The current interval value. Can be modified any time, but changes only	2104	The current interval value. Can be modified any time, but changes only
1333	take effect when the periodic timer fires or C<ev_periodic_again> is being	2105	take effect when the periodic timer fires or C<ev_periodic_again> is being
1334	called.	2106	called.
1335		2107
1336	=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]	2108	=item ev_tstamp (*reschedule_cb)(ev_periodic *w, ev_tstamp now) [read-write]
1337		2109
1338	The current reschedule callback, or C<0>, if this functionality is	2110	The current reschedule callback, or C<0>, if this functionality is
1339	switched off. Can be changed any time, but changes only take effect when	2111	switched off. Can be changed any time, but changes only take effect when
1340	the periodic timer fires or C<ev_periodic_again> is being called.	2112	the periodic timer fires or C<ev_periodic_again> is being called.
1341		2113
1342	=item ev_tstamp at [read-only]
1343
1344	When active, contains the absolute time that the watcher is supposed to
1345	trigger next.
1346
1347	=back	2114	=back
1348		2115
1349	=head3 Examples	2116	=head3 Examples
1350		2117
1351	Example: Call a callback every hour, or, more precisely, whenever the	2118	Example: Call a callback every hour, or, more precisely, whenever the
1352	system clock is divisible by 3600. The callback invocation times have	2119	system time is divisible by 3600. The callback invocation times have
1353	potentially a lot of jittering, but good long-term stability.	2120	potentially a lot of jitter, but good long-term stability.
1354		2121
1355	static void	2122	static void
1356	clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)	2123	clock_cb (struct ev_loop *loop, ev_io *w, int revents)
1357	{	2124	{
1358	... its now a full hour (UTC, or TAI or whatever your clock follows)	2125	... its now a full hour (UTC, or TAI or whatever your clock follows)
1359	}	2126	}
1360		2127
1361	struct ev_periodic hourly_tick;	2128	ev_periodic hourly_tick;
1362	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);	2129	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1363	ev_periodic_start (loop, &hourly_tick);	2130	ev_periodic_start (loop, &hourly_tick);
1364		2131
1365	Example: The same as above, but use a reschedule callback to do it:	2132	Example: The same as above, but use a reschedule callback to do it:
1366		2133
1367	#include <math.h>	2134	#include <math.h>
1368		2135
1369	static ev_tstamp	2136	static ev_tstamp
1370	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)	2137	my_scheduler_cb (ev_periodic *w, ev_tstamp now)
1371	{	2138	{
1372	return fmod (now, 3600.) + 3600.;	2139	return now + (3600. - fmod (now, 3600.));
1373	}	2140	}
1374		2141
1375	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);	2142	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1376		2143
1377	Example: Call a callback every hour, starting now:	2144	Example: Call a callback every hour, starting now:
1378		2145
1379	struct ev_periodic hourly_tick;	2146	ev_periodic hourly_tick;
1380	ev_periodic_init (&hourly_tick, clock_cb,	2147	ev_periodic_init (&hourly_tick, clock_cb,
1381	fmod (ev_now (loop), 3600.), 3600., 0);	2148	fmod (ev_now (loop), 3600.), 3600., 0);
1382	ev_periodic_start (loop, &hourly_tick);	2149	ev_periodic_start (loop, &hourly_tick);
1383		2150
1384		2151
1385	=head2 C<ev_signal> - signal me when a signal gets signalled!	2152	=head2 C<ev_signal> - signal me when a signal gets signalled!
1386		2153
1387	Signal watchers will trigger an event when the process receives a specific	2154	Signal watchers will trigger an event when the process receives a specific
1388	signal one or more times. Even though signals are very asynchronous, libev	2155	signal one or more times. Even though signals are very asynchronous, libev
1389	will try it's best to deliver signals synchronously, i.e. as part of the	2156	will try it's best to deliver signals synchronously, i.e. as part of the
1390	normal event processing, like any other event.	2157	normal event processing, like any other event.
1391		2158
		2159	If you want signals to be delivered truly asynchronously, just use
		2160	C<sigaction> as you would do without libev and forget about sharing
		2161	the signal. You can even use C<ev_async> from a signal handler to
		2162	synchronously wake up an event loop.
		2163
1392	You can configure as many watchers as you like per signal. Only when the	2164	You can configure as many watchers as you like for the same signal, but
		2165	only within the same loop, i.e. you can watch for C<SIGINT> in your
		2166	default loop and for C<SIGIO> in another loop, but you cannot watch for
		2167	C<SIGINT> in both the default loop and another loop at the same time. At
		2168	the moment, C<SIGCHLD> is permanently tied to the default loop.
		2169
1393	first watcher gets started will libev actually register a signal watcher	2170	When the first watcher gets started will libev actually register something
1394	with the kernel (thus it coexists with your own signal handlers as long	2171	with the kernel (thus it coexists with your own signal handlers as long as
1395	as you don't register any with libev). Similarly, when the last signal	2172	you don't register any with libev for the same signal).
1396	watcher for a signal is stopped libev will reset the signal handler to	2173
1397	SIG_DFL (regardless of what it was set to before).	2174	If possible and supported, libev will install its handlers with
		2175	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
		2176	not be unduly interrupted. If you have a problem with system calls getting
		2177	interrupted by signals you can block all signals in an C<ev_check> watcher
		2178	and unblock them in an C<ev_prepare> watcher.
		2179
		2180	=head3 The special problem of inheritance over fork/execve/pthread_create
		2181
		2182	Both the signal mask (C<sigprocmask>) and the signal disposition
		2183	(C<sigaction>) are unspecified after starting a signal watcher (and after
		2184	stopping it again), that is, libev might or might not block the signal,
		2185	and might or might not set or restore the installed signal handler.
		2186
		2187	While this does not matter for the signal disposition (libev never
		2188	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
		2189	C<execve>), this matters for the signal mask: many programs do not expect
		2190	certain signals to be blocked.
		2191
		2192	This means that before calling C<exec> (from the child) you should reset
		2193	the signal mask to whatever "default" you expect (all clear is a good
		2194	choice usually).
		2195
		2196	The simplest way to ensure that the signal mask is reset in the child is
		2197	to install a fork handler with C<pthread_atfork> that resets it. That will
		2198	catch fork calls done by libraries (such as the libc) as well.
		2199
		2200	In current versions of libev, the signal will not be blocked indefinitely
		2201	unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
		2202	the window of opportunity for problems, it will not go away, as libev
		2203	I<has> to modify the signal mask, at least temporarily.
		2204
		2205	So I can't stress this enough: I<If you do not reset your signal mask when
		2206	you expect it to be empty, you have a race condition in your code>. This
		2207	is not a libev-specific thing, this is true for most event libraries.
1398		2208
1399	=head3 Watcher-Specific Functions and Data Members	2209	=head3 Watcher-Specific Functions and Data Members
1400		2210
1401	=over 4	2211	=over 4
1402		2212
…		…
1411		2221
1412	The signal the watcher watches out for.	2222	The signal the watcher watches out for.
1413		2223
1414	=back	2224	=back
1415		2225
		2226	=head3 Examples
		2227
		2228	Example: Try to exit cleanly on SIGINT.
		2229
		2230	static void
		2231	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
		2232	{
		2233	ev_unloop (loop, EVUNLOOP_ALL);
		2234	}
		2235
		2236	ev_signal signal_watcher;
		2237	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
		2238	ev_signal_start (loop, &signal_watcher);
		2239
1416		2240
1417	=head2 C<ev_child> - watch out for process status changes	2241	=head2 C<ev_child> - watch out for process status changes
1418		2242
1419	Child watchers trigger when your process receives a SIGCHLD in response to	2243	Child watchers trigger when your process receives a SIGCHLD in response to
1420	some child status changes (most typically when a child of yours dies).	2244	some child status changes (most typically when a child of yours dies or
		2245	exits). It is permissible to install a child watcher I<after> the child
		2246	has been forked (which implies it might have already exited), as long
		2247	as the event loop isn't entered (or is continued from a watcher), i.e.,
		2248	forking and then immediately registering a watcher for the child is fine,
		2249	but forking and registering a watcher a few event loop iterations later or
		2250	in the next callback invocation is not.
		2251
		2252	Only the default event loop is capable of handling signals, and therefore
		2253	you can only register child watchers in the default event loop.
		2254
		2255	Due to some design glitches inside libev, child watchers will always be
		2256	handled at maximum priority (their priority is set to C<EV_MAXPRI> by
		2257	libev)
		2258
		2259	=head3 Process Interaction
		2260
		2261	Libev grabs C<SIGCHLD> as soon as the default event loop is
		2262	initialised. This is necessary to guarantee proper behaviour even if the
		2263	first child watcher is started after the child exits. The occurrence
		2264	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
		2265	synchronously as part of the event loop processing. Libev always reaps all
		2266	children, even ones not watched.
		2267
		2268	=head3 Overriding the Built-In Processing
		2269
		2270	Libev offers no special support for overriding the built-in child
		2271	processing, but if your application collides with libev's default child
		2272	handler, you can override it easily by installing your own handler for
		2273	C<SIGCHLD> after initialising the default loop, and making sure the
		2274	default loop never gets destroyed. You are encouraged, however, to use an
		2275	event-based approach to child reaping and thus use libev's support for
		2276	that, so other libev users can use C<ev_child> watchers freely.
		2277
		2278	=head3 Stopping the Child Watcher
		2279
		2280	Currently, the child watcher never gets stopped, even when the
		2281	child terminates, so normally one needs to stop the watcher in the
		2282	callback. Future versions of libev might stop the watcher automatically
		2283	when a child exit is detected (calling C<ev_child_stop> twice is not a
		2284	problem).
1421		2285
1422	=head3 Watcher-Specific Functions and Data Members	2286	=head3 Watcher-Specific Functions and Data Members
1423		2287
1424	=over 4	2288	=over 4
1425		2289
1426	=item ev_child_init (ev_child *, callback, int pid)	2290	=item ev_child_init (ev_child *, callback, int pid, int trace)
1427		2291
1428	=item ev_child_set (ev_child *, int pid)	2292	=item ev_child_set (ev_child *, int pid, int trace)
1429		2293
1430	Configures the watcher to wait for status changes of process C<pid> (or	2294	Configures the watcher to wait for status changes of process C<pid> (or
1431	I<any> process if C<pid> is specified as C<0>). The callback can look	2295	I<any> process if C<pid> is specified as C<0>). The callback can look
1432	at the C<rstatus> member of the C<ev_child> watcher structure to see	2296	at the C<rstatus> member of the C<ev_child> watcher structure to see
1433	the status word (use the macros from C<sys/wait.h> and see your systems	2297	the status word (use the macros from C<sys/wait.h> and see your systems
1434	C<waitpid> documentation). The C<rpid> member contains the pid of the	2298	C<waitpid> documentation). The C<rpid> member contains the pid of the
1435	process causing the status change.	2299	process causing the status change. C<trace> must be either C<0> (only
		2300	activate the watcher when the process terminates) or C<1> (additionally
		2301	activate the watcher when the process is stopped or continued).
1436		2302
1437	=item int pid [read-only]	2303	=item int pid [read-only]
1438		2304
1439	The process id this watcher watches out for, or C<0>, meaning any process id.	2305	The process id this watcher watches out for, or C<0>, meaning any process id.
1440		2306
…		…
1449		2315
1450	=back	2316	=back
1451		2317
1452	=head3 Examples	2318	=head3 Examples
1453		2319
1454	Example: Try to exit cleanly on SIGINT and SIGTERM.	2320	Example: C<fork()> a new process and install a child handler to wait for
		2321	its completion.
1455		2322
		2323	ev_child cw;
		2324
1456	static void	2325	static void
1457	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)	2326	child_cb (EV_P_ ev_child *w, int revents)
1458	{	2327	{
1459	ev_unloop (loop, EVUNLOOP_ALL);	2328	ev_child_stop (EV_A_ w);
		2329	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1460	}	2330	}
1461		2331
1462	struct ev_signal signal_watcher;	2332	pid_t pid = fork ();
1463	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2333
1464	ev_signal_start (loop, &sigint_cb);	2334	if (pid < 0)
		2335	// error
		2336	else if (pid == 0)
		2337	{
		2338	// the forked child executes here
		2339	exit (1);
		2340	}
		2341	else
		2342	{
		2343	ev_child_init (&cw, child_cb, pid, 0);
		2344	ev_child_start (EV_DEFAULT_ &cw);
		2345	}
1465		2346
1466		2347
1467	=head2 C<ev_stat> - did the file attributes just change?	2348	=head2 C<ev_stat> - did the file attributes just change?
1468		2349
1469	This watches a filesystem path for attribute changes. That is, it calls	2350	This watches a file system path for attribute changes. That is, it calls
1470	C<stat> regularly (or when the OS says it changed) and sees if it changed	2351	C<stat> on that path in regular intervals (or when the OS says it changed)
1471	compared to the last time, invoking the callback if it did.	2352	and sees if it changed compared to the last time, invoking the callback if
		2353	it did.
1472		2354
1473	The path does not need to exist: changing from "path exists" to "path does	2355	The path does not need to exist: changing from "path exists" to "path does
1474	not exist" is a status change like any other. The condition "path does	2356	not exist" is a status change like any other. The condition "path does not
1475	not exist" is signified by the C<st_nlink> field being zero (which is	2357	exist" (or more correctly "path cannot be stat'ed") is signified by the
1476	otherwise always forced to be at least one) and all the other fields of	2358	C<st_nlink> field being zero (which is otherwise always forced to be at
1477	the stat buffer having unspecified contents.	2359	least one) and all the other fields of the stat buffer having unspecified
		2360	contents.
1478		2361
1479	The path I<should> be absolute and I<must not> end in a slash. If it is	2362	The path I<must not> end in a slash or contain special components such as
		2363	C<.> or C<..>. The path I<should> be absolute: If it is relative and
1480	relative and your working directory changes, the behaviour is undefined.	2364	your working directory changes, then the behaviour is undefined.
1481		2365
1482	Since there is no standard to do this, the portable implementation simply	2366	Since there is no portable change notification interface available, the
1483	calls C<stat (2)> regularly on the path to see if it changed somehow. You	2367	portable implementation simply calls C<stat(2)> regularly on the path
1484	can specify a recommended polling interval for this case. If you specify	2368	to see if it changed somehow. You can specify a recommended polling
1485	a polling interval of C<0> (highly recommended!) then a I<suitable,	2369	interval for this case. If you specify a polling interval of C<0> (highly
1486	unspecified default> value will be used (which you can expect to be around	2370	recommended!) then a I<suitable, unspecified default> value will be used
1487	five seconds, although this might change dynamically). Libev will also	2371	(which you can expect to be around five seconds, although this might
1488	impose a minimum interval which is currently around C<0.1>, but thats	2372	change dynamically). Libev will also impose a minimum interval which is
1489	usually overkill.	2373	currently around C<0.1>, but that's usually overkill.
1490		2374
1491	This watcher type is not meant for massive numbers of stat watchers,	2375	This watcher type is not meant for massive numbers of stat watchers,
1492	as even with OS-supported change notifications, this can be	2376	as even with OS-supported change notifications, this can be
1493	resource-intensive.	2377	resource-intensive.
1494		2378
1495	At the time of this writing, only the Linux inotify interface is	2379	At the time of this writing, the only OS-specific interface implemented
1496	implemented (implementing kqueue support is left as an exercise for the	2380	is the Linux inotify interface (implementing kqueue support is left as an
1497	reader). Inotify will be used to give hints only and should not change the	2381	exercise for the reader. Note, however, that the author sees no way of
1498	semantics of C<ev_stat> watchers, which means that libev sometimes needs	2382	implementing C<ev_stat> semantics with kqueue, except as a hint).
1499	to fall back to regular polling again even with inotify, but changes are
1500	usually detected immediately, and if the file exists there will be no
1501	polling.
1502		2383
1503	=head3 Inotify	2384	=head3 ABI Issues (Largefile Support)
1504		2385
		2386	Libev by default (unless the user overrides this) uses the default
		2387	compilation environment, which means that on systems with large file
		2388	support disabled by default, you get the 32 bit version of the stat
		2389	structure. When using the library from programs that change the ABI to
		2390	use 64 bit file offsets the programs will fail. In that case you have to
		2391	compile libev with the same flags to get binary compatibility. This is
		2392	obviously the case with any flags that change the ABI, but the problem is
		2393	most noticeably displayed with ev_stat and large file support.
		2394
		2395	The solution for this is to lobby your distribution maker to make large
		2396	file interfaces available by default (as e.g. FreeBSD does) and not
		2397	optional. Libev cannot simply switch on large file support because it has
		2398	to exchange stat structures with application programs compiled using the
		2399	default compilation environment.
		2400
		2401	=head3 Inotify and Kqueue
		2402
1505	When C<inotify (7)> support has been compiled into libev (generally only	2403	When C<inotify (7)> support has been compiled into libev and present at
1506	available on Linux) and present at runtime, it will be used to speed up	2404	runtime, it will be used to speed up change detection where possible. The
1507	change detection where possible. The inotify descriptor will be created lazily	2405	inotify descriptor will be created lazily when the first C<ev_stat>
1508	when the first C<ev_stat> watcher is being started.	2406	watcher is being started.
1509		2407
1510	Inotify presense does not change the semantics of C<ev_stat> watchers	2408	Inotify presence does not change the semantics of C<ev_stat> watchers
1511	except that changes might be detected earlier, and in some cases, to avoid	2409	except that changes might be detected earlier, and in some cases, to avoid
1512	making regular C<stat> calls. Even in the presense of inotify support	2410	making regular C<stat> calls. Even in the presence of inotify support
1513	there are many cases where libev has to resort to regular C<stat> polling.	2411	there are many cases where libev has to resort to regular C<stat> polling,
		2412	but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
		2413	many bugs), the path exists (i.e. stat succeeds), and the path resides on
		2414	a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
		2415	xfs are fully working) libev usually gets away without polling.
1514		2416
1515	(There is no support for kqueue, as apparently it cannot be used to	2417	There is no support for kqueue, as apparently it cannot be used to
1516	implement this functionality, due to the requirement of having a file	2418	implement this functionality, due to the requirement of having a file
1517	descriptor open on the object at all times).	2419	descriptor open on the object at all times, and detecting renames, unlinks
		2420	etc. is difficult.
		2421
		2422	=head3 C<stat ()> is a synchronous operation
		2423
		2424	Libev doesn't normally do any kind of I/O itself, and so is not blocking
		2425	the process. The exception are C<ev_stat> watchers - those call C<stat
		2426	()>, which is a synchronous operation.
		2427
		2428	For local paths, this usually doesn't matter: unless the system is very
		2429	busy or the intervals between stat's are large, a stat call will be fast,
		2430	as the path data is usually in memory already (except when starting the
		2431	watcher).
		2432
		2433	For networked file systems, calling C<stat ()> can block an indefinite
		2434	time due to network issues, and even under good conditions, a stat call
		2435	often takes multiple milliseconds.
		2436
		2437	Therefore, it is best to avoid using C<ev_stat> watchers on networked
		2438	paths, although this is fully supported by libev.
1518		2439
1519	=head3 The special problem of stat time resolution	2440	=head3 The special problem of stat time resolution
1520		2441
1521	The C<stat ()> syscall only supports full-second resolution portably, and	2442	The C<stat ()> system call only supports full-second resolution portably,
1522	even on systems where the resolution is higher, many filesystems still	2443	and even on systems where the resolution is higher, most file systems
1523	only support whole seconds.	2444	still only support whole seconds.
1524		2445
1525	That means that, if the time is the only thing that changes, you might	2446	That means that, if the time is the only thing that changes, you can
1526	miss updates: on the first update, C<ev_stat> detects a change and calls	2447	easily miss updates: on the first update, C<ev_stat> detects a change and
1527	your callback, which does something. When there is another update within	2448	calls your callback, which does something. When there is another update
1528	the same second, C<ev_stat> will be unable to detect it.	2449	within the same second, C<ev_stat> will be unable to detect unless the
		2450	stat data does change in other ways (e.g. file size).
1529		2451
1530	The solution to this is to delay acting on a change for a second (or till	2452	The solution to this is to delay acting on a change for slightly more
1531	the next second boundary), using a roughly one-second delay C<ev_timer>	2453	than a second (or till slightly after the next full second boundary), using
1532	(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>	2454	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1533	is added to work around small timing inconsistencies of some operating	2455	ev_timer_again (loop, w)>).
1534	systems.	2456
		2457	The C<.02> offset is added to work around small timing inconsistencies
		2458	of some operating systems (where the second counter of the current time
		2459	might be be delayed. One such system is the Linux kernel, where a call to
		2460	C<gettimeofday> might return a timestamp with a full second later than
		2461	a subsequent C<time> call - if the equivalent of C<time ()> is used to
		2462	update file times then there will be a small window where the kernel uses
		2463	the previous second to update file times but libev might already execute
		2464	the timer callback).
1535		2465
1536	=head3 Watcher-Specific Functions and Data Members	2466	=head3 Watcher-Specific Functions and Data Members
1537		2467
1538	=over 4	2468	=over 4
1539		2469
…		…
1545	C<path>. The C<interval> is a hint on how quickly a change is expected to	2475	C<path>. The C<interval> is a hint on how quickly a change is expected to
1546	be detected and should normally be specified as C<0> to let libev choose	2476	be detected and should normally be specified as C<0> to let libev choose
1547	a suitable value. The memory pointed to by C<path> must point to the same	2477	a suitable value. The memory pointed to by C<path> must point to the same
1548	path for as long as the watcher is active.	2478	path for as long as the watcher is active.
1549		2479
1550	The callback will be receive C<EV_STAT> when a change was detected,	2480	The callback will receive an C<EV_STAT> event when a change was detected,
1551	relative to the attributes at the time the watcher was started (or the	2481	relative to the attributes at the time the watcher was started (or the
1552	last change was detected).	2482	last change was detected).
1553		2483
1554	=item ev_stat_stat (ev_stat *)	2484	=item ev_stat_stat (loop, ev_stat *)
1555		2485
1556	Updates the stat buffer immediately with new values. If you change the	2486	Updates the stat buffer immediately with new values. If you change the
1557	watched path in your callback, you could call this fucntion to avoid	2487	watched path in your callback, you could call this function to avoid
1558	detecting this change (while introducing a race condition). Can also be	2488	detecting this change (while introducing a race condition if you are not
1559	useful simply to find out the new values.	2489	the only one changing the path). Can also be useful simply to find out the
		2490	new values.
1560		2491
1561	=item ev_statdata attr [read-only]	2492	=item ev_statdata attr [read-only]
1562		2493
1563	The most-recently detected attributes of the file. Although the type is of	2494	The most-recently detected attributes of the file. Although the type is
1564	C<ev_statdata>, this is usually the (or one of the) C<struct stat> types	2495	C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1565	suitable for your system. If the C<st_nlink> member is C<0>, then there	2496	suitable for your system, but you can only rely on the POSIX-standardised
		2497	members to be present. If the C<st_nlink> member is C<0>, then there was
1566	was some error while C<stat>ing the file.	2498	some error while C<stat>ing the file.
1567		2499
1568	=item ev_statdata prev [read-only]	2500	=item ev_statdata prev [read-only]
1569		2501
1570	The previous attributes of the file. The callback gets invoked whenever	2502	The previous attributes of the file. The callback gets invoked whenever
1571	C<prev> != C<attr>.	2503	C<prev> != C<attr>, or, more precisely, one or more of these members
		2504	differ: C<st_dev>, C<st_ino>, C<st_mode>, C<st_nlink>, C<st_uid>,
		2505	C<st_gid>, C<st_rdev>, C<st_size>, C<st_atime>, C<st_mtime>, C<st_ctime>.
1572		2506
1573	=item ev_tstamp interval [read-only]	2507	=item ev_tstamp interval [read-only]
1574		2508
1575	The specified interval.	2509	The specified interval.
1576		2510
1577	=item const char *path [read-only]	2511	=item const char *path [read-only]
1578		2512
1579	The filesystem path that is being watched.	2513	The file system path that is being watched.
1580		2514
1581	=back	2515	=back
1582		2516
1583	=head3 Examples	2517	=head3 Examples
1584		2518
1585	Example: Watch C</etc/passwd> for attribute changes.	2519	Example: Watch C</etc/passwd> for attribute changes.
1586		2520
1587	static void	2521	static void
1588	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)	2522	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1589	{	2523	{
1590	/* /etc/passwd changed in some way */	2524	/* /etc/passwd changed in some way */
1591	if (w->attr.st_nlink)	2525	if (w->attr.st_nlink)
1592	{	2526	{
1593	printf ("passwd current size %ld\n", (long)w->attr.st_size);	2527	printf ("passwd current size %ld\n", (long)w->attr.st_size);
1594	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);	2528	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1595	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);	2529	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1596	}	2530	}
1597	else	2531	else
1598	/* you shalt not abuse printf for puts */	2532	/* you shalt not abuse printf for puts */
1599	puts ("wow, /etc/passwd is not there, expect problems. "	2533	puts ("wow, /etc/passwd is not there, expect problems. "
1600	"if this is windows, they already arrived\n");	2534	"if this is windows, they already arrived\n");
1601	}	2535	}
1602		2536
1603	...	2537	...
1604	ev_stat passwd;	2538	ev_stat passwd;
1605		2539
1606	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);	2540	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1607	ev_stat_start (loop, &passwd);	2541	ev_stat_start (loop, &passwd);
1608		2542
1609	Example: Like above, but additionally use a one-second delay so we do not	2543	Example: Like above, but additionally use a one-second delay so we do not
1610	miss updates (however, frequent updates will delay processing, too, so	2544	miss updates (however, frequent updates will delay processing, too, so
1611	one might do the work both on C<ev_stat> callback invocation I<and> on	2545	one might do the work both on C<ev_stat> callback invocation I<and> on
1612	C<ev_timer> callback invocation).	2546	C<ev_timer> callback invocation).
1613		2547
1614	static ev_stat passwd;	2548	static ev_stat passwd;
1615	static ev_timer timer;	2549	static ev_timer timer;
1616		2550
1617	static void	2551	static void
1618	timer_cb (EV_P_ ev_timer *w, int revents)	2552	timer_cb (EV_P_ ev_timer *w, int revents)
1619	{	2553	{
1620	ev_timer_stop (EV_A_ w);	2554	ev_timer_stop (EV_A_ w);
1621		2555
1622	/* now it's one second after the most recent passwd change */	2556	/* now it's one second after the most recent passwd change */
1623	}	2557	}
1624		2558
1625	static void	2559	static void
1626	stat_cb (EV_P_ ev_stat *w, int revents)	2560	stat_cb (EV_P_ ev_stat *w, int revents)
1627	{	2561	{
1628	/* reset the one-second timer */	2562	/* reset the one-second timer */
1629	ev_timer_again (EV_A_ &timer);	2563	ev_timer_again (EV_A_ &timer);
1630	}	2564	}
1631		2565
1632	...	2566	...
1633	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);	2567	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1634	ev_stat_start (loop, &passwd);	2568	ev_stat_start (loop, &passwd);
1635	ev_timer_init (&timer, timer_cb, 0., 1.01);	2569	ev_timer_init (&timer, timer_cb, 0., 1.02);
1636		2570
1637		2571
1638	=head2 C<ev_idle> - when you've got nothing better to do...	2572	=head2 C<ev_idle> - when you've got nothing better to do...
1639		2573
1640	Idle watchers trigger events when no other events of the same or higher	2574	Idle watchers trigger events when no other events of the same or higher
1641	priority are pending (prepare, check and other idle watchers do not	2575	priority are pending (prepare, check and other idle watchers do not count
1642	count).	2576	as receiving "events").
1643		2577
1644	That is, as long as your process is busy handling sockets or timeouts	2578	That is, as long as your process is busy handling sockets or timeouts
1645	(or even signals, imagine) of the same or higher priority it will not be	2579	(or even signals, imagine) of the same or higher priority it will not be
1646	triggered. But when your process is idle (or only lower-priority watchers	2580	triggered. But when your process is idle (or only lower-priority watchers
1647	are pending), the idle watchers are being called once per event loop	2581	are pending), the idle watchers are being called once per event loop
…		…
1658		2592
1659	=head3 Watcher-Specific Functions and Data Members	2593	=head3 Watcher-Specific Functions and Data Members
1660		2594
1661	=over 4	2595	=over 4
1662		2596
1663	=item ev_idle_init (ev_signal *, callback)	2597	=item ev_idle_init (ev_idle *, callback)
1664		2598
1665	Initialises and configures the idle watcher - it has no parameters of any	2599	Initialises and configures the idle watcher - it has no parameters of any
1666	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,	2600	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1667	believe me.	2601	believe me.
1668		2602
…		…
1671	=head3 Examples	2605	=head3 Examples
1672		2606
1673	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the	2607	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1674	callback, free it. Also, use no error checking, as usual.	2608	callback, free it. Also, use no error checking, as usual.
1675		2609
1676	static void	2610	static void
1677	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)	2611	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
1678	{	2612	{
1679	free (w);	2613	free (w);
1680	// now do something you wanted to do when the program has	2614	// now do something you wanted to do when the program has
1681	// no longer asnything immediate to do.	2615	// no longer anything immediate to do.
1682	}	2616	}
1683		2617
1684	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));	2618	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
1685	ev_idle_init (idle_watcher, idle_cb);	2619	ev_idle_init (idle_watcher, idle_cb);
1686	ev_idle_start (loop, idle_cb);	2620	ev_idle_start (loop, idle_watcher);
1687		2621
1688		2622
1689	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2623	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1690		2624
1691	Prepare and check watchers are usually (but not always) used in tandem:	2625	Prepare and check watchers are usually (but not always) used in pairs:
1692	prepare watchers get invoked before the process blocks and check watchers	2626	prepare watchers get invoked before the process blocks and check watchers
1693	afterwards.	2627	afterwards.
1694		2628
1695	You I<must not> call C<ev_loop> or similar functions that enter	2629	You I<must not> call C<ev_loop> or similar functions that enter
1696	the current event loop from either C<ev_prepare> or C<ev_check>	2630	the current event loop from either C<ev_prepare> or C<ev_check>
…		…
1699	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2633	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1700	C<ev_check> so if you have one watcher of each kind they will always be	2634	C<ev_check> so if you have one watcher of each kind they will always be
1701	called in pairs bracketing the blocking call.	2635	called in pairs bracketing the blocking call.
1702		2636
1703	Their main purpose is to integrate other event mechanisms into libev and	2637	Their main purpose is to integrate other event mechanisms into libev and
1704	their use is somewhat advanced. This could be used, for example, to track	2638	their use is somewhat advanced. They could be used, for example, to track
1705	variable changes, implement your own watchers, integrate net-snmp or a	2639	variable changes, implement your own watchers, integrate net-snmp or a
1706	coroutine library and lots more. They are also occasionally useful if	2640	coroutine library and lots more. They are also occasionally useful if
1707	you cache some data and want to flush it before blocking (for example,	2641	you cache some data and want to flush it before blocking (for example,
1708	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>	2642	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1709	watcher).	2643	watcher).
1710		2644
1711	This is done by examining in each prepare call which file descriptors need	2645	This is done by examining in each prepare call which file descriptors
1712	to be watched by the other library, registering C<ev_io> watchers for	2646	need to be watched by the other library, registering C<ev_io> watchers
1713	them and starting an C<ev_timer> watcher for any timeouts (many libraries	2647	for them and starting an C<ev_timer> watcher for any timeouts (many
1714	provide just this functionality). Then, in the check watcher you check for	2648	libraries provide exactly this functionality). Then, in the check watcher,
1715	any events that occured (by checking the pending status of all watchers	2649	you check for any events that occurred (by checking the pending status
1716	and stopping them) and call back into the library. The I/O and timer	2650	of all watchers and stopping them) and call back into the library. The
1717	callbacks will never actually be called (but must be valid nevertheless,	2651	I/O and timer callbacks will never actually be called (but must be valid
1718	because you never know, you know?).	2652	nevertheless, because you never know, you know?).
1719		2653
1720	As another example, the Perl Coro module uses these hooks to integrate	2654	As another example, the Perl Coro module uses these hooks to integrate
1721	coroutines into libev programs, by yielding to other active coroutines	2655	coroutines into libev programs, by yielding to other active coroutines
1722	during each prepare and only letting the process block if no coroutines	2656	during each prepare and only letting the process block if no coroutines
1723	are ready to run (it's actually more complicated: it only runs coroutines	2657	are ready to run (it's actually more complicated: it only runs coroutines
…		…
1726	loop from blocking if lower-priority coroutines are active, thus mapping	2660	loop from blocking if lower-priority coroutines are active, thus mapping
1727	low-priority coroutines to idle/background tasks).	2661	low-priority coroutines to idle/background tasks).
1728		2662
1729	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2663	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1730	priority, to ensure that they are being run before any other watchers	2664	priority, to ensure that they are being run before any other watchers
		2665	after the poll (this doesn't matter for C<ev_prepare> watchers).
		2666
1731	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,	2667	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
1732	too) should not activate ("feed") events into libev. While libev fully	2668	activate ("feed") events into libev. While libev fully supports this, they
1733	supports this, they will be called before other C<ev_check> watchers	2669	might get executed before other C<ev_check> watchers did their job. As
1734	did their job. As C<ev_check> watchers are often used to embed other	2670	C<ev_check> watchers are often used to embed other (non-libev) event
1735	(non-libev) event loops those other event loops might be in an unusable	2671	loops those other event loops might be in an unusable state until their
1736	state until their C<ev_check> watcher ran (always remind yourself to	2672	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1737	coexist peacefully with others).	2673	others).
1738		2674
1739	=head3 Watcher-Specific Functions and Data Members	2675	=head3 Watcher-Specific Functions and Data Members
1740		2676
1741	=over 4	2677	=over 4
1742		2678
…		…
1744		2680
1745	=item ev_check_init (ev_check *, callback)	2681	=item ev_check_init (ev_check *, callback)
1746		2682
1747	Initialises and configures the prepare or check watcher - they have no	2683	Initialises and configures the prepare or check watcher - they have no
1748	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>	2684	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1749	macros, but using them is utterly, utterly and completely pointless.	2685	macros, but using them is utterly, utterly, utterly and completely
		2686	pointless.
1750		2687
1751	=back	2688	=back
1752		2689
1753	=head3 Examples	2690	=head3 Examples
1754		2691
1755	There are a number of principal ways to embed other event loops or modules	2692	There are a number of principal ways to embed other event loops or modules
1756	into libev. Here are some ideas on how to include libadns into libev	2693	into libev. Here are some ideas on how to include libadns into libev
1757	(there is a Perl module named C<EV::ADNS> that does this, which you could	2694	(there is a Perl module named C<EV::ADNS> that does this, which you could
1758	use for an actually working example. Another Perl module named C<EV::Glib>	2695	use as a working example. Another Perl module named C<EV::Glib> embeds a
1759	embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV	2696	Glib main context into libev, and finally, C<Glib::EV> embeds EV into the
1760	into the Glib event loop).	2697	Glib event loop).
1761		2698
1762	Method 1: Add IO watchers and a timeout watcher in a prepare handler,	2699	Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1763	and in a check watcher, destroy them and call into libadns. What follows	2700	and in a check watcher, destroy them and call into libadns. What follows
1764	is pseudo-code only of course. This requires you to either use a low	2701	is pseudo-code only of course. This requires you to either use a low
1765	priority for the check watcher or use C<ev_clear_pending> explicitly, as	2702	priority for the check watcher or use C<ev_clear_pending> explicitly, as
1766	the callbacks for the IO/timeout watchers might not have been called yet.	2703	the callbacks for the IO/timeout watchers might not have been called yet.
1767		2704
1768	static ev_io iow [nfd];	2705	static ev_io iow [nfd];
1769	static ev_timer tw;	2706	static ev_timer tw;
1770		2707
1771	static void	2708	static void
1772	io_cb (ev_loop *loop, ev_io *w, int revents)	2709	io_cb (struct ev_loop *loop, ev_io *w, int revents)
1773	{	2710	{
1774	}	2711	}
1775		2712
1776	// create io watchers for each fd and a timer before blocking	2713	// create io watchers for each fd and a timer before blocking
1777	static void	2714	static void
1778	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)	2715	adns_prepare_cb (struct ev_loop *loop, ev_prepare *w, int revents)
1779	{	2716	{
1780	int timeout = 3600000;	2717	int timeout = 3600000;
1781	struct pollfd fds [nfd];	2718	struct pollfd fds [nfd];
1782	// actual code will need to loop here and realloc etc.	2719	// actual code will need to loop here and realloc etc.
1783	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2720	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1784		2721
1785	/* the callback is illegal, but won't be called as we stop during check */	2722	/* the callback is illegal, but won't be called as we stop during check */
1786	ev_timer_init (&tw, 0, timeout * 1e-3);	2723	ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
1787	ev_timer_start (loop, &tw);	2724	ev_timer_start (loop, &tw);
1788		2725
1789	// create one ev_io per pollfd	2726	// create one ev_io per pollfd
1790	for (int i = 0; i < nfd; ++i)	2727	for (int i = 0; i < nfd; ++i)
1791	{	2728	{
1792	ev_io_init (iow + i, io_cb, fds [i].fd,	2729	ev_io_init (iow + i, io_cb, fds [i].fd,
1793	((fds [i].events & POLLIN ? EV_READ : 0)	2730	((fds [i].events & POLLIN ? EV_READ : 0)
1794	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));	2731	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1795		2732
1796	fds [i].revents = 0;	2733	fds [i].revents = 0;
1797	ev_io_start (loop, iow + i);	2734	ev_io_start (loop, iow + i);
1798	}	2735	}
1799	}	2736	}
1800		2737
1801	// stop all watchers after blocking	2738	// stop all watchers after blocking
1802	static void	2739	static void
1803	adns_check_cb (ev_loop *loop, ev_check *w, int revents)	2740	adns_check_cb (struct ev_loop *loop, ev_check *w, int revents)
1804	{	2741	{
1805	ev_timer_stop (loop, &tw);	2742	ev_timer_stop (loop, &tw);
1806		2743
1807	for (int i = 0; i < nfd; ++i)	2744	for (int i = 0; i < nfd; ++i)
1808	{	2745	{
1809	// set the relevant poll flags	2746	// set the relevant poll flags
1810	// could also call adns_processreadable etc. here	2747	// could also call adns_processreadable etc. here
1811	struct pollfd *fd = fds + i;	2748	struct pollfd *fd = fds + i;
1812	int revents = ev_clear_pending (iow + i);	2749	int revents = ev_clear_pending (iow + i);
1813	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;	2750	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1814	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;	2751	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1815		2752
1816	// now stop the watcher	2753	// now stop the watcher
1817	ev_io_stop (loop, iow + i);	2754	ev_io_stop (loop, iow + i);
1818	}	2755	}
1819		2756
1820	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));	2757	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1821	}	2758	}
1822		2759
1823	Method 2: This would be just like method 1, but you run C<adns_afterpoll>	2760	Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1824	in the prepare watcher and would dispose of the check watcher.	2761	in the prepare watcher and would dispose of the check watcher.
1825		2762
1826	Method 3: If the module to be embedded supports explicit event	2763	Method 3: If the module to be embedded supports explicit event
1827	notification (adns does), you can also make use of the actual watcher	2764	notification (libadns does), you can also make use of the actual watcher
1828	callbacks, and only destroy/create the watchers in the prepare watcher.	2765	callbacks, and only destroy/create the watchers in the prepare watcher.
1829		2766
1830	static void	2767	static void
1831	timer_cb (EV_P_ ev_timer *w, int revents)	2768	timer_cb (EV_P_ ev_timer *w, int revents)
1832	{	2769	{
1833	adns_state ads = (adns_state)w->data;	2770	adns_state ads = (adns_state)w->data;
1834	update_now (EV_A);	2771	update_now (EV_A);
1835		2772
1836	adns_processtimeouts (ads, &tv_now);	2773	adns_processtimeouts (ads, &tv_now);
1837	}	2774	}
1838		2775
1839	static void	2776	static void
1840	io_cb (EV_P_ ev_io *w, int revents)	2777	io_cb (EV_P_ ev_io *w, int revents)
1841	{	2778	{
1842	adns_state ads = (adns_state)w->data;	2779	adns_state ads = (adns_state)w->data;
1843	update_now (EV_A);	2780	update_now (EV_A);
1844		2781
1845	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);	2782	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1846	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);	2783	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1847	}	2784	}
1848		2785
1849	// do not ever call adns_afterpoll	2786	// do not ever call adns_afterpoll
1850		2787
1851	Method 4: Do not use a prepare or check watcher because the module you	2788	Method 4: Do not use a prepare or check watcher because the module you
1852	want to embed is too inflexible to support it. Instead, youc na override	2789	want to embed is not flexible enough to support it. Instead, you can
1853	their poll function. The drawback with this solution is that the main	2790	override their poll function. The drawback with this solution is that the
1854	loop is now no longer controllable by EV. The C<Glib::EV> module does	2791	main loop is now no longer controllable by EV. The C<Glib::EV> module uses
1855	this.	2792	this approach, effectively embedding EV as a client into the horrible
		2793	libglib event loop.
1856		2794
1857	static gint	2795	static gint
1858	event_poll_func (GPollFD *fds, guint nfds, gint timeout)	2796	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1859	{	2797	{
1860	int got_events = 0;	2798	int got_events = 0;
1861		2799
1862	for (n = 0; n < nfds; ++n)	2800	for (n = 0; n < nfds; ++n)
1863	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events	2801	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1864		2802
1865	if (timeout >= 0)	2803	if (timeout >= 0)
1866	// create/start timer	2804	// create/start timer
1867		2805
1868	// poll	2806	// poll
1869	ev_loop (EV_A_ 0);	2807	ev_loop (EV_A_ 0);
1870		2808
1871	// stop timer again	2809	// stop timer again
1872	if (timeout >= 0)	2810	if (timeout >= 0)
1873	ev_timer_stop (EV_A_ &to);	2811	ev_timer_stop (EV_A_ &to);
1874		2812
1875	// stop io watchers again - their callbacks should have set	2813	// stop io watchers again - their callbacks should have set
1876	for (n = 0; n < nfds; ++n)	2814	for (n = 0; n < nfds; ++n)
1877	ev_io_stop (EV_A_ iow [n]);	2815	ev_io_stop (EV_A_ iow [n]);
1878		2816
1879	return got_events;	2817	return got_events;
1880	}	2818	}
1881		2819
1882		2820
1883	=head2 C<ev_embed> - when one backend isn't enough...	2821	=head2 C<ev_embed> - when one backend isn't enough...
1884		2822
1885	This is a rather advanced watcher type that lets you embed one event loop	2823	This is a rather advanced watcher type that lets you embed one event loop
…		…
1891	prioritise I/O.	2829	prioritise I/O.
1892		2830
1893	As an example for a bug workaround, the kqueue backend might only support	2831	As an example for a bug workaround, the kqueue backend might only support
1894	sockets on some platform, so it is unusable as generic backend, but you	2832	sockets on some platform, so it is unusable as generic backend, but you
1895	still want to make use of it because you have many sockets and it scales	2833	still want to make use of it because you have many sockets and it scales
1896	so nicely. In this case, you would create a kqueue-based loop and embed it	2834	so nicely. In this case, you would create a kqueue-based loop and embed
1897	into your default loop (which might use e.g. poll). Overall operation will	2835	it into your default loop (which might use e.g. poll). Overall operation
1898	be a bit slower because first libev has to poll and then call kevent, but	2836	will be a bit slower because first libev has to call C<poll> and then
1899	at least you can use both at what they are best.	2837	C<kevent>, but at least you can use both mechanisms for what they are
		2838	best: C<kqueue> for scalable sockets and C<poll> if you want it to work :)
1900		2839
1901	As for prioritising I/O: rarely you have the case where some fds have	2840	As for prioritising I/O: under rare circumstances you have the case where
1902	to be watched and handled very quickly (with low latency), and even	2841	some fds have to be watched and handled very quickly (with low latency),
1903	priorities and idle watchers might have too much overhead. In this case	2842	and even priorities and idle watchers might have too much overhead. In
1904	you would put all the high priority stuff in one loop and all the rest in	2843	this case you would put all the high priority stuff in one loop and all
1905	a second one, and embed the second one in the first.	2844	the rest in a second one, and embed the second one in the first.
1906		2845
1907	As long as the watcher is active, the callback will be invoked every time	2846	As long as the watcher is active, the callback will be invoked every
1908	there might be events pending in the embedded loop. The callback must then	2847	time there might be events pending in the embedded loop. The callback
1909	call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke	2848	must then call C<ev_embed_sweep (mainloop, watcher)> to make a single
1910	their callbacks (you could also start an idle watcher to give the embedded	2849	sweep and invoke their callbacks (the callback doesn't need to invoke the
1911	loop strictly lower priority for example). You can also set the callback	2850	C<ev_embed_sweep> function directly, it could also start an idle watcher
1912	to C<0>, in which case the embed watcher will automatically execute the	2851	to give the embedded loop strictly lower priority for example).
1913	embedded loop sweep.
1914		2852
1915	As long as the watcher is started it will automatically handle events. The	2853	You can also set the callback to C<0>, in which case the embed watcher
1916	callback will be invoked whenever some events have been handled. You can	2854	will automatically execute the embedded loop sweep whenever necessary.
1917	set the callback to C<0> to avoid having to specify one if you are not
1918	interested in that.
1919		2855
1920	Also, there have not currently been made special provisions for forking:	2856	Fork detection will be handled transparently while the C<ev_embed> watcher
1921	when you fork, you not only have to call C<ev_loop_fork> on both loops,	2857	is active, i.e., the embedded loop will automatically be forked when the
1922	but you will also have to stop and restart any C<ev_embed> watchers	2858	embedding loop forks. In other cases, the user is responsible for calling
1923	yourself.	2859	C<ev_loop_fork> on the embedded loop.
1924		2860
1925	Unfortunately, not all backends are embeddable, only the ones returned by	2861	Unfortunately, not all backends are embeddable: only the ones returned by
1926	C<ev_embeddable_backends> are, which, unfortunately, does not include any	2862	C<ev_embeddable_backends> are, which, unfortunately, does not include any
1927	portable one.	2863	portable one.
1928		2864
1929	So when you want to use this feature you will always have to be prepared	2865	So when you want to use this feature you will always have to be prepared
1930	that you cannot get an embeddable loop. The recommended way to get around	2866	that you cannot get an embeddable loop. The recommended way to get around
1931	this is to have a separate variables for your embeddable loop, try to	2867	this is to have a separate variables for your embeddable loop, try to
1932	create it, and if that fails, use the normal loop for everything.	2868	create it, and if that fails, use the normal loop for everything.
1933		2869
		2870	=head3 C<ev_embed> and fork
		2871
		2872	While the C<ev_embed> watcher is running, forks in the embedding loop will
		2873	automatically be applied to the embedded loop as well, so no special
		2874	fork handling is required in that case. When the watcher is not running,
		2875	however, it is still the task of the libev user to call C<ev_loop_fork ()>
		2876	as applicable.
		2877
1934	=head3 Watcher-Specific Functions and Data Members	2878	=head3 Watcher-Specific Functions and Data Members
1935		2879
1936	=over 4	2880	=over 4
1937		2881
1938	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	2882	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
…		…
1941		2885
1942	Configures the watcher to embed the given loop, which must be	2886	Configures the watcher to embed the given loop, which must be
1943	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	2887	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1944	invoked automatically, otherwise it is the responsibility of the callback	2888	invoked automatically, otherwise it is the responsibility of the callback
1945	to invoke it (it will continue to be called until the sweep has been done,	2889	to invoke it (it will continue to be called until the sweep has been done,
1946	if you do not want thta, you need to temporarily stop the embed watcher).	2890	if you do not want that, you need to temporarily stop the embed watcher).
1947		2891
1948	=item ev_embed_sweep (loop, ev_embed *)	2892	=item ev_embed_sweep (loop, ev_embed *)
1949		2893
1950	Make a single, non-blocking sweep over the embedded loop. This works	2894	Make a single, non-blocking sweep over the embedded loop. This works
1951	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	2895	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1952	apropriate way for embedded loops.	2896	appropriate way for embedded loops.
1953		2897
1954	=item struct ev_loop *other [read-only]	2898	=item struct ev_loop *other [read-only]
1955		2899
1956	The embedded event loop.	2900	The embedded event loop.
1957		2901
…		…
1959		2903
1960	=head3 Examples	2904	=head3 Examples
1961		2905
1962	Example: Try to get an embeddable event loop and embed it into the default	2906	Example: Try to get an embeddable event loop and embed it into the default
1963	event loop. If that is not possible, use the default loop. The default	2907	event loop. If that is not possible, use the default loop. The default
1964	loop is stored in C<loop_hi>, while the mebeddable loop is stored in	2908	loop is stored in C<loop_hi>, while the embeddable loop is stored in
1965	C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be	2909	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
1966	used).	2910	used).
1967		2911
1968	struct ev_loop *loop_hi = ev_default_init (0);	2912	struct ev_loop *loop_hi = ev_default_init (0);
1969	struct ev_loop *loop_lo = 0;	2913	struct ev_loop *loop_lo = 0;
1970	struct ev_embed embed;	2914	ev_embed embed;
1971		2915
1972	// see if there is a chance of getting one that works	2916	// see if there is a chance of getting one that works
1973	// (remember that a flags value of 0 means autodetection)	2917	// (remember that a flags value of 0 means autodetection)
1974	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	2918	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1975	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	2919	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1976	: 0;	2920	: 0;
1977		2921
1978	// if we got one, then embed it, otherwise default to loop_hi	2922	// if we got one, then embed it, otherwise default to loop_hi
1979	if (loop_lo)	2923	if (loop_lo)
1980	{	2924	{
1981	ev_embed_init (&embed, 0, loop_lo);	2925	ev_embed_init (&embed, 0, loop_lo);
1982	ev_embed_start (loop_hi, &embed);	2926	ev_embed_start (loop_hi, &embed);
1983	}	2927	}
1984	else	2928	else
1985	loop_lo = loop_hi;	2929	loop_lo = loop_hi;
1986		2930
1987	Example: Check if kqueue is available but not recommended and create	2931	Example: Check if kqueue is available but not recommended and create
1988	a kqueue backend for use with sockets (which usually work with any	2932	a kqueue backend for use with sockets (which usually work with any
1989	kqueue implementation). Store the kqueue/socket-only event loop in	2933	kqueue implementation). Store the kqueue/socket-only event loop in
1990	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	2934	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1991		2935
1992	struct ev_loop *loop = ev_default_init (0);	2936	struct ev_loop *loop = ev_default_init (0);
1993	struct ev_loop *loop_socket = 0;	2937	struct ev_loop *loop_socket = 0;
1994	struct ev_embed embed;	2938	ev_embed embed;
1995		2939
1996	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	2940	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
1997	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	2941	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
1998	{	2942	{
1999	ev_embed_init (&embed, 0, loop_socket);	2943	ev_embed_init (&embed, 0, loop_socket);
2000	ev_embed_start (loop, &embed);	2944	ev_embed_start (loop, &embed);
2001	}	2945	}
2002		2946
2003	if (!loop_socket)	2947	if (!loop_socket)
2004	loop_socket = loop;	2948	loop_socket = loop;
2005		2949
2006	// now use loop_socket for all sockets, and loop for everything else	2950	// now use loop_socket for all sockets, and loop for everything else
2007		2951
2008		2952
2009	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	2953	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2010		2954
2011	Fork watchers are called when a C<fork ()> was detected (usually because	2955	Fork watchers are called when a C<fork ()> was detected (usually because
…		…
2014	event loop blocks next and before C<ev_check> watchers are being called,	2958	event loop blocks next and before C<ev_check> watchers are being called,
2015	and only in the child after the fork. If whoever good citizen calling	2959	and only in the child after the fork. If whoever good citizen calling
2016	C<ev_default_fork> cheats and calls it in the wrong process, the fork	2960	C<ev_default_fork> cheats and calls it in the wrong process, the fork
2017	handlers will be invoked, too, of course.	2961	handlers will be invoked, too, of course.
2018		2962
		2963	=head3 The special problem of life after fork - how is it possible?
		2964
		2965	Most uses of C<fork()> consist of forking, then some simple calls to ste
		2966	up/change the process environment, followed by a call to C<exec()>. This
		2967	sequence should be handled by libev without any problems.
		2968
		2969	This changes when the application actually wants to do event handling
		2970	in the child, or both parent in child, in effect "continuing" after the
		2971	fork.
		2972
		2973	The default mode of operation (for libev, with application help to detect
		2974	forks) is to duplicate all the state in the child, as would be expected
		2975	when I<either> the parent I<or> the child process continues.
		2976
		2977	When both processes want to continue using libev, then this is usually the
		2978	wrong result. In that case, usually one process (typically the parent) is
		2979	supposed to continue with all watchers in place as before, while the other
		2980	process typically wants to start fresh, i.e. without any active watchers.
		2981
		2982	The cleanest and most efficient way to achieve that with libev is to
		2983	simply create a new event loop, which of course will be "empty", and
		2984	use that for new watchers. This has the advantage of not touching more
		2985	memory than necessary, and thus avoiding the copy-on-write, and the
		2986	disadvantage of having to use multiple event loops (which do not support
		2987	signal watchers).
		2988
		2989	When this is not possible, or you want to use the default loop for
		2990	other reasons, then in the process that wants to start "fresh", call
		2991	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
		2992	the default loop will "orphan" (not stop) all registered watchers, so you
		2993	have to be careful not to execute code that modifies those watchers. Note
		2994	also that in that case, you have to re-register any signal watchers.
		2995
2019	=head3 Watcher-Specific Functions and Data Members	2996	=head3 Watcher-Specific Functions and Data Members
2020		2997
2021	=over 4	2998	=over 4
2022		2999
2023	=item ev_fork_init (ev_signal *, callback)	3000	=item ev_fork_init (ev_signal *, callback)
…		…
2027	believe me.	3004	believe me.
2028		3005
2029	=back	3006	=back
2030		3007
2031		3008
		3009	=head2 C<ev_async> - how to wake up another event loop
		3010
		3011	In general, you cannot use an C<ev_loop> from multiple threads or other
		3012	asynchronous sources such as signal handlers (as opposed to multiple event
		3013	loops - those are of course safe to use in different threads).
		3014
		3015	Sometimes, however, you need to wake up another event loop you do not
		3016	control, for example because it belongs to another thread. This is what
		3017	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
		3018	can signal it by calling C<ev_async_send>, which is thread- and signal
		3019	safe.
		3020
		3021	This functionality is very similar to C<ev_signal> watchers, as signals,
		3022	too, are asynchronous in nature, and signals, too, will be compressed
		3023	(i.e. the number of callback invocations may be less than the number of
		3024	C<ev_async_sent> calls).
		3025
		3026	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
		3027	just the default loop.
		3028
		3029	=head3 Queueing
		3030
		3031	C<ev_async> does not support queueing of data in any way. The reason
		3032	is that the author does not know of a simple (or any) algorithm for a
		3033	multiple-writer-single-reader queue that works in all cases and doesn't
		3034	need elaborate support such as pthreads or unportable memory access
		3035	semantics.
		3036
		3037	That means that if you want to queue data, you have to provide your own
		3038	queue. But at least I can tell you how to implement locking around your
		3039	queue:
		3040
		3041	=over 4
		3042
		3043	=item queueing from a signal handler context
		3044
		3045	To implement race-free queueing, you simply add to the queue in the signal
		3046	handler but you block the signal handler in the watcher callback. Here is
		3047	an example that does that for some fictitious SIGUSR1 handler:
		3048
		3049	static ev_async mysig;
		3050
		3051	static void
		3052	sigusr1_handler (void)
		3053	{
		3054	sometype data;
		3055
		3056	// no locking etc.
		3057	queue_put (data);
		3058	ev_async_send (EV_DEFAULT_ &mysig);
		3059	}
		3060
		3061	static void
		3062	mysig_cb (EV_P_ ev_async *w, int revents)
		3063	{
		3064	sometype data;
		3065	sigset_t block, prev;
		3066
		3067	sigemptyset (&block);
		3068	sigaddset (&block, SIGUSR1);
		3069	sigprocmask (SIG_BLOCK, &block, &prev);
		3070
		3071	while (queue_get (&data))
		3072	process (data);
		3073
		3074	if (sigismember (&prev, SIGUSR1)
		3075	sigprocmask (SIG_UNBLOCK, &block, 0);
		3076	}
		3077
		3078	(Note: pthreads in theory requires you to use C<pthread_setmask>
		3079	instead of C<sigprocmask> when you use threads, but libev doesn't do it
		3080	either...).
		3081
		3082	=item queueing from a thread context
		3083
		3084	The strategy for threads is different, as you cannot (easily) block
		3085	threads but you can easily preempt them, so to queue safely you need to
		3086	employ a traditional mutex lock, such as in this pthread example:
		3087
		3088	static ev_async mysig;
		3089	static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
		3090
		3091	static void
		3092	otherthread (void)
		3093	{
		3094	// only need to lock the actual queueing operation
		3095	pthread_mutex_lock (&mymutex);
		3096	queue_put (data);
		3097	pthread_mutex_unlock (&mymutex);
		3098
		3099	ev_async_send (EV_DEFAULT_ &mysig);
		3100	}
		3101
		3102	static void
		3103	mysig_cb (EV_P_ ev_async *w, int revents)
		3104	{
		3105	pthread_mutex_lock (&mymutex);
		3106
		3107	while (queue_get (&data))
		3108	process (data);
		3109
		3110	pthread_mutex_unlock (&mymutex);
		3111	}
		3112
		3113	=back
		3114
		3115
		3116	=head3 Watcher-Specific Functions and Data Members
		3117
		3118	=over 4
		3119
		3120	=item ev_async_init (ev_async *, callback)
		3121
		3122	Initialises and configures the async watcher - it has no parameters of any
		3123	kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
		3124	trust me.
		3125
		3126	=item ev_async_send (loop, ev_async *)
		3127
		3128	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
		3129	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
		3130	C<ev_feed_event>, this call is safe to do from other threads, signal or
		3131	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
		3132	section below on what exactly this means).
		3133
		3134	Note that, as with other watchers in libev, multiple events might get
		3135	compressed into a single callback invocation (another way to look at this
		3136	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
		3137	reset when the event loop detects that).
		3138
		3139	This call incurs the overhead of a system call only once per event loop
		3140	iteration, so while the overhead might be noticeable, it doesn't apply to
		3141	repeated calls to C<ev_async_send> for the same event loop.
		3142
		3143	=item bool = ev_async_pending (ev_async *)
		3144
		3145	Returns a non-zero value when C<ev_async_send> has been called on the
		3146	watcher but the event has not yet been processed (or even noted) by the
		3147	event loop.
		3148
		3149	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
		3150	the loop iterates next and checks for the watcher to have become active,
		3151	it will reset the flag again. C<ev_async_pending> can be used to very
		3152	quickly check whether invoking the loop might be a good idea.
		3153
		3154	Not that this does I<not> check whether the watcher itself is pending,
		3155	only whether it has been requested to make this watcher pending: there
		3156	is a time window between the event loop checking and resetting the async
		3157	notification, and the callback being invoked.
		3158
		3159	=back
		3160
		3161
2032	=head1 OTHER FUNCTIONS	3162	=head1 OTHER FUNCTIONS
2033		3163
2034	There are some other functions of possible interest. Described. Here. Now.	3164	There are some other functions of possible interest. Described. Here. Now.
2035		3165
2036	=over 4	3166	=over 4
2037		3167
2038	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)	3168	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
2039		3169
2040	This function combines a simple timer and an I/O watcher, calls your	3170	This function combines a simple timer and an I/O watcher, calls your
2041	callback on whichever event happens first and automatically stop both	3171	callback on whichever event happens first and automatically stops both
2042	watchers. This is useful if you want to wait for a single event on an fd	3172	watchers. This is useful if you want to wait for a single event on an fd
2043	or timeout without having to allocate/configure/start/stop/free one or	3173	or timeout without having to allocate/configure/start/stop/free one or
2044	more watchers yourself.	3174	more watchers yourself.
2045		3175
2046	If C<fd> is less than 0, then no I/O watcher will be started and events	3176	If C<fd> is less than 0, then no I/O watcher will be started and the
2047	is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and	3177	C<events> argument is being ignored. Otherwise, an C<ev_io> watcher for
2048	C<events> set will be craeted and started.	3178	the given C<fd> and C<events> set will be created and started.
2049		3179
2050	If C<timeout> is less than 0, then no timeout watcher will be	3180	If C<timeout> is less than 0, then no timeout watcher will be
2051	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	3181	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2052	repeat = 0) will be started. While C<0> is a valid timeout, it is of	3182	repeat = 0) will be started. C<0> is a valid timeout.
2053	dubious value.
2054		3183
2055	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	3184	The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2056	passed an C<revents> set like normal event callbacks (a combination of	3185	passed an C<revents> set like normal event callbacks (a combination of
2057	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	3186	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2058	value passed to C<ev_once>:	3187	value passed to C<ev_once>. Note that it is possible to receive I<both>
		3188	a timeout and an io event at the same time - you probably should give io
		3189	events precedence.
2059		3190
		3191	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
		3192
2060	static void stdin_ready (int revents, void *arg)	3193	static void stdin_ready (int revents, void *arg)
2061	{	3194	{
2062	if (revents & EV_TIMEOUT)
2063	/* doh, nothing entered */;
2064	else if (revents & EV_READ)	3195	if (revents & EV_READ)
2065	/* stdin might have data for us, joy! */;	3196	/* stdin might have data for us, joy! */;
		3197	else if (revents & EV_TIMEOUT)
		3198	/* doh, nothing entered */;
2066	}	3199	}
2067		3200
2068	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3201	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2069		3202
2070	=item ev_feed_event (ev_loop *, watcher *, int revents)
2071
2072	Feeds the given event set into the event loop, as if the specified event
2073	had happened for the specified watcher (which must be a pointer to an
2074	initialised but not necessarily started event watcher).
2075
2076	=item ev_feed_fd_event (ev_loop *, int fd, int revents)	3203	=item ev_feed_fd_event (loop, int fd, int revents)
2077		3204
2078	Feed an event on the given fd, as if a file descriptor backend detected	3205	Feed an event on the given fd, as if a file descriptor backend detected
2079	the given events it.	3206	the given events it.
2080		3207
2081	=item ev_feed_signal_event (ev_loop *loop, int signum)	3208	=item ev_feed_signal_event (loop, int signum)
2082		3209
2083	Feed an event as if the given signal occured (C<loop> must be the default	3210	Feed an event as if the given signal occurred (C<loop> must be the default
2084	loop!).	3211	loop!).
2085		3212
2086	=back	3213	=back
2087		3214
2088		3215
…		…
2104		3231
2105	=item * Priorities are not currently supported. Initialising priorities	3232	=item * Priorities are not currently supported. Initialising priorities
2106	will fail and all watchers will have the same priority, even though there	3233	will fail and all watchers will have the same priority, even though there
2107	is an ev_pri field.	3234	is an ev_pri field.
2108		3235
		3236	=item * In libevent, the last base created gets the signals, in libev, the
		3237	first base created (== the default loop) gets the signals.
		3238
2109	=item * Other members are not supported.	3239	=item * Other members are not supported.
2110		3240
2111	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3241	=item * The libev emulation is I<not> ABI compatible to libevent, you need
2112	to use the libev header file and library.	3242	to use the libev header file and library.
2113		3243
2114	=back	3244	=back
2115		3245
2116	=head1 C++ SUPPORT	3246	=head1 C++ SUPPORT
2117		3247
2118	Libev comes with some simplistic wrapper classes for C++ that mainly allow	3248	Libev comes with some simplistic wrapper classes for C++ that mainly allow
2119	you to use some convinience methods to start/stop watchers and also change	3249	you to use some convenience methods to start/stop watchers and also change
2120	the callback model to a model using method callbacks on objects.	3250	the callback model to a model using method callbacks on objects.
2121		3251
2122	To use it,	3252	To use it,
2123		3253
2124	#include <ev++.h>	3254	#include <ev++.h>
2125		3255
2126	This automatically includes F<ev.h> and puts all of its definitions (many	3256	This automatically includes F<ev.h> and puts all of its definitions (many
2127	of them macros) into the global namespace. All C++ specific things are	3257	of them macros) into the global namespace. All C++ specific things are
2128	put into the C<ev> namespace. It should support all the same embedding	3258	put into the C<ev> namespace. It should support all the same embedding
2129	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.	3259	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
…		…
2163		3293
2164	=over 4	3294	=over 4
2165		3295
2166	=item ev::TYPE::TYPE ()	3296	=item ev::TYPE::TYPE ()
2167		3297
2168	=item ev::TYPE::TYPE (struct ev_loop *)	3298	=item ev::TYPE::TYPE (loop)
2169		3299
2170	=item ev::TYPE::~TYPE	3300	=item ev::TYPE::~TYPE
2171		3301
2172	The constructor (optionally) takes an event loop to associate the watcher	3302	The constructor (optionally) takes an event loop to associate the watcher
2173	with. If it is omitted, it will use C<EV_DEFAULT>.	3303	with. If it is omitted, it will use C<EV_DEFAULT>.
…		…
2196	your compiler is good :), then the method will be fully inlined into the	3326	your compiler is good :), then the method will be fully inlined into the
2197	thunking function, making it as fast as a direct C callback.	3327	thunking function, making it as fast as a direct C callback.
2198		3328
2199	Example: simple class declaration and watcher initialisation	3329	Example: simple class declaration and watcher initialisation
2200		3330
2201	struct myclass	3331	struct myclass
2202	{	3332	{
2203	void io_cb (ev::io &w, int revents) { }	3333	void io_cb (ev::io &w, int revents) { }
2204	}	3334	}
2205		3335
2206	myclass obj;	3336	myclass obj;
2207	ev::io iow;	3337	ev::io iow;
2208	iow.set <myclass, &myclass::io_cb> (&obj);	3338	iow.set <myclass, &myclass::io_cb> (&obj);
		3339
		3340	=item w->set (object *)
		3341
		3342	This is an B<experimental> feature that might go away in a future version.
		3343
		3344	This is a variation of a method callback - leaving out the method to call
		3345	will default the method to C<operator ()>, which makes it possible to use
		3346	functor objects without having to manually specify the C<operator ()> all
		3347	the time. Incidentally, you can then also leave out the template argument
		3348	list.
		3349
		3350	The C<operator ()> method prototype must be C<void operator ()(watcher &w,
		3351	int revents)>.
		3352
		3353	See the method-C<set> above for more details.
		3354
		3355	Example: use a functor object as callback.
		3356
		3357	struct myfunctor
		3358	{
		3359	void operator() (ev::io &w, int revents)
		3360	{
		3361	...
		3362	}
		3363	}
		3364
		3365	myfunctor f;
		3366
		3367	ev::io w;
		3368	w.set (&f);
2209		3369
2210	=item w->set<function> (void *data = 0)	3370	=item w->set<function> (void *data = 0)
2211		3371
2212	Also sets a callback, but uses a static method or plain function as	3372	Also sets a callback, but uses a static method or plain function as
2213	callback. The optional C<data> argument will be stored in the watcher's	3373	callback. The optional C<data> argument will be stored in the watcher's
…		…
2215		3375
2216	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.	3376	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2217		3377
2218	See the method-C<set> above for more details.	3378	See the method-C<set> above for more details.
2219		3379
2220	Example:	3380	Example: Use a plain function as callback.
2221		3381
2222	static void io_cb (ev::io &w, int revents) { }	3382	static void io_cb (ev::io &w, int revents) { }
2223	iow.set <io_cb> ();	3383	iow.set <io_cb> ();
2224		3384
2225	=item w->set (struct ev_loop *)	3385	=item w->set (loop)
2226		3386
2227	Associates a different C<struct ev_loop> with this watcher. You can only	3387	Associates a different C<struct ev_loop> with this watcher. You can only
2228	do this when the watcher is inactive (and not pending either).	3388	do this when the watcher is inactive (and not pending either).
2229		3389
2230	=item w->set ([args])	3390	=item w->set ([arguments])
2231		3391
2232	Basically the same as C<ev_TYPE_set>, with the same args. Must be	3392	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2233	called at least once. Unlike the C counterpart, an active watcher gets	3393	called at least once. Unlike the C counterpart, an active watcher gets
2234	automatically stopped and restarted when reconfiguring it with this	3394	automatically stopped and restarted when reconfiguring it with this
2235	method.	3395	method.
2236		3396
2237	=item w->start ()	3397	=item w->start ()
…		…
2261	=back	3421	=back
2262		3422
2263	Example: Define a class with an IO and idle watcher, start one of them in	3423	Example: Define a class with an IO and idle watcher, start one of them in
2264	the constructor.	3424	the constructor.
2265		3425
2266	class myclass	3426	class myclass
2267	{	3427	{
2268	ev_io io; void io_cb (ev::io &w, int revents);	3428	ev::io io ; void io_cb (ev::io &w, int revents);
2269	ev_idle idle void idle_cb (ev::idle &w, int revents);	3429	ev::idle idle; void idle_cb (ev::idle &w, int revents);
2270		3430
2271	myclass ();	3431	myclass (int fd)
2272	}	3432	{
2273
2274	myclass::myclass (int fd)
2275	{
2276	io .set <myclass, &myclass::io_cb > (this);	3433	io .set <myclass, &myclass::io_cb > (this);
2277	idle.set <myclass, &myclass::idle_cb> (this);	3434	idle.set <myclass, &myclass::idle_cb> (this);
2278		3435
2279	io.start (fd, ev::READ);	3436	io.start (fd, ev::READ);
		3437	}
2280	}	3438	};
		3439
		3440
		3441	=head1 OTHER LANGUAGE BINDINGS
		3442
		3443	Libev does not offer other language bindings itself, but bindings for a
		3444	number of languages exist in the form of third-party packages. If you know
		3445	any interesting language binding in addition to the ones listed here, drop
		3446	me a note.
		3447
		3448	=over 4
		3449
		3450	=item Perl
		3451
		3452	The EV module implements the full libev API and is actually used to test
		3453	libev. EV is developed together with libev. Apart from the EV core module,
		3454	there are additional modules that implement libev-compatible interfaces
		3455	to C<libadns> (C<EV::ADNS>, but C<AnyEvent::DNS> is preferred nowadays),
		3456	C<Net::SNMP> (C<Net::SNMP::EV>) and the C<libglib> event core (C<Glib::EV>
		3457	and C<EV::Glib>).
		3458
		3459	It can be found and installed via CPAN, its homepage is at
		3460	L<http://software.schmorp.de/pkg/EV>.
		3461
		3462	=item Python
		3463
		3464	Python bindings can be found at L<http://code.google.com/p/pyev/>. It
		3465	seems to be quite complete and well-documented.
		3466
		3467	=item Ruby
		3468
		3469	Tony Arcieri has written a ruby extension that offers access to a subset
		3470	of the libev API and adds file handle abstractions, asynchronous DNS and
		3471	more on top of it. It can be found via gem servers. Its homepage is at
		3472	L<http://rev.rubyforge.org/>.
		3473
		3474	Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
		3475	makes rev work even on mingw.
		3476
		3477	=item Haskell
		3478
		3479	A haskell binding to libev is available at
		3480	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
		3481
		3482	=item D
		3483
		3484	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
		3485	be found at L<http://proj.llucax.com.ar/wiki/evd>.
		3486
		3487	=item Ocaml
		3488
		3489	Erkki Seppala has written Ocaml bindings for libev, to be found at
		3490	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
		3491
		3492	=item Lua
		3493
		3494	Brian Maher has written a partial interface to libev for lua (at the
		3495	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
		3496	L<http://github.com/brimworks/lua-ev>.
		3497
		3498	=back
2281		3499
2282		3500
2283	=head1 MACRO MAGIC	3501	=head1 MACRO MAGIC
2284		3502
2285	Libev can be compiled with a variety of options, the most fundamantal	3503	Libev can be compiled with a variety of options, the most fundamental
2286	of which is C<EV_MULTIPLICITY>. This option determines whether (most)	3504	of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2287	functions and callbacks have an initial C<struct ev_loop *> argument.	3505	functions and callbacks have an initial C<struct ev_loop *> argument.
2288		3506
2289	To make it easier to write programs that cope with either variant, the	3507	To make it easier to write programs that cope with either variant, the
2290	following macros are defined:	3508	following macros are defined:
…		…
2295		3513
2296	This provides the loop I<argument> for functions, if one is required ("ev	3514	This provides the loop I<argument> for functions, if one is required ("ev
2297	loop argument"). The C<EV_A> form is used when this is the sole argument,	3515	loop argument"). The C<EV_A> form is used when this is the sole argument,
2298	C<EV_A_> is used when other arguments are following. Example:	3516	C<EV_A_> is used when other arguments are following. Example:
2299		3517
2300	ev_unref (EV_A);	3518	ev_unref (EV_A);
2301	ev_timer_add (EV_A_ watcher);	3519	ev_timer_add (EV_A_ watcher);
2302	ev_loop (EV_A_ 0);	3520	ev_loop (EV_A_ 0);
2303		3521
2304	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	3522	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2305	which is often provided by the following macro.	3523	which is often provided by the following macro.
2306		3524
2307	=item C<EV_P>, C<EV_P_>	3525	=item C<EV_P>, C<EV_P_>
2308		3526
2309	This provides the loop I<parameter> for functions, if one is required ("ev	3527	This provides the loop I<parameter> for functions, if one is required ("ev
2310	loop parameter"). The C<EV_P> form is used when this is the sole parameter,	3528	loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2311	C<EV_P_> is used when other parameters are following. Example:	3529	C<EV_P_> is used when other parameters are following. Example:
2312		3530
2313	// this is how ev_unref is being declared	3531	// this is how ev_unref is being declared
2314	static void ev_unref (EV_P);	3532	static void ev_unref (EV_P);
2315		3533
2316	// this is how you can declare your typical callback	3534	// this is how you can declare your typical callback
2317	static void cb (EV_P_ ev_timer *w, int revents)	3535	static void cb (EV_P_ ev_timer *w, int revents)
2318		3536
2319	It declares a parameter C<loop> of type C<struct ev_loop *>, quite	3537	It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2320	suitable for use with C<EV_A>.	3538	suitable for use with C<EV_A>.
2321		3539
2322	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	3540	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2323		3541
2324	Similar to the other two macros, this gives you the value of the default	3542	Similar to the other two macros, this gives you the value of the default
2325	loop, if multiple loops are supported ("ev loop default").	3543	loop, if multiple loops are supported ("ev loop default").
		3544
		3545	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
		3546
		3547	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
		3548	default loop has been initialised (C<UC> == unchecked). Their behaviour
		3549	is undefined when the default loop has not been initialised by a previous
		3550	execution of C<EV_DEFAULT>, C<EV_DEFAULT_> or C<ev_default_init (...)>.
		3551
		3552	It is often prudent to use C<EV_DEFAULT> when initialising the first
		3553	watcher in a function but use C<EV_DEFAULT_UC> afterwards.
2326		3554
2327	=back	3555	=back
2328		3556
2329	Example: Declare and initialise a check watcher, utilising the above	3557	Example: Declare and initialise a check watcher, utilising the above
2330	macros so it will work regardless of whether multiple loops are supported	3558	macros so it will work regardless of whether multiple loops are supported
2331	or not.	3559	or not.
2332		3560
2333	static void	3561	static void
2334	check_cb (EV_P_ ev_timer *w, int revents)	3562	check_cb (EV_P_ ev_timer *w, int revents)
2335	{	3563	{
2336	ev_check_stop (EV_A_ w);	3564	ev_check_stop (EV_A_ w);
2337	}	3565	}
2338		3566
2339	ev_check check;	3567	ev_check check;
2340	ev_check_init (&check, check_cb);	3568	ev_check_init (&check, check_cb);
2341	ev_check_start (EV_DEFAULT_ &check);	3569	ev_check_start (EV_DEFAULT_ &check);
2342	ev_loop (EV_DEFAULT_ 0);	3570	ev_loop (EV_DEFAULT_ 0);
2343		3571
2344	=head1 EMBEDDING	3572	=head1 EMBEDDING
2345		3573
2346	Libev can (and often is) directly embedded into host	3574	Libev can (and often is) directly embedded into host
2347	applications. Examples of applications that embed it include the Deliantra	3575	applications. Examples of applications that embed it include the Deliantra
…		…
2354	libev somewhere in your source tree).	3582	libev somewhere in your source tree).
2355		3583
2356	=head2 FILESETS	3584	=head2 FILESETS
2357		3585
2358	Depending on what features you need you need to include one or more sets of files	3586	Depending on what features you need you need to include one or more sets of files
2359	in your app.	3587	in your application.
2360		3588
2361	=head3 CORE EVENT LOOP	3589	=head3 CORE EVENT LOOP
2362		3590
2363	To include only the libev core (all the C<ev_*> functions), with manual	3591	To include only the libev core (all the C<ev_*> functions), with manual
2364	configuration (no autoconf):	3592	configuration (no autoconf):
2365		3593
2366	#define EV_STANDALONE 1	3594	#define EV_STANDALONE 1
2367	#include "ev.c"	3595	#include "ev.c"
2368		3596
2369	This will automatically include F<ev.h>, too, and should be done in a	3597	This will automatically include F<ev.h>, too, and should be done in a
2370	single C source file only to provide the function implementations. To use	3598	single C source file only to provide the function implementations. To use
2371	it, do the same for F<ev.h> in all files wishing to use this API (best	3599	it, do the same for F<ev.h> in all files wishing to use this API (best
2372	done by writing a wrapper around F<ev.h> that you can include instead and	3600	done by writing a wrapper around F<ev.h> that you can include instead and
2373	where you can put other configuration options):	3601	where you can put other configuration options):
2374		3602
2375	#define EV_STANDALONE 1	3603	#define EV_STANDALONE 1
2376	#include "ev.h"	3604	#include "ev.h"
2377		3605
2378	Both header files and implementation files can be compiled with a C++	3606	Both header files and implementation files can be compiled with a C++
2379	compiler (at least, thats a stated goal, and breakage will be treated	3607	compiler (at least, that's a stated goal, and breakage will be treated
2380	as a bug).	3608	as a bug).
2381		3609
2382	You need the following files in your source tree, or in a directory	3610	You need the following files in your source tree, or in a directory
2383	in your include path (e.g. in libev/ when using -Ilibev):	3611	in your include path (e.g. in libev/ when using -Ilibev):
2384		3612
2385	ev.h	3613	ev.h
2386	ev.c	3614	ev.c
2387	ev_vars.h	3615	ev_vars.h
2388	ev_wrap.h	3616	ev_wrap.h
2389		3617
2390	ev_win32.c required on win32 platforms only	3618	ev_win32.c required on win32 platforms only
2391		3619
2392	ev_select.c only when select backend is enabled (which is enabled by default)	3620	ev_select.c only when select backend is enabled (which is enabled by default)
2393	ev_poll.c only when poll backend is enabled (disabled by default)	3621	ev_poll.c only when poll backend is enabled (disabled by default)
2394	ev_epoll.c only when the epoll backend is enabled (disabled by default)	3622	ev_epoll.c only when the epoll backend is enabled (disabled by default)
2395	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	3623	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2396	ev_port.c only when the solaris port backend is enabled (disabled by default)	3624	ev_port.c only when the solaris port backend is enabled (disabled by default)
2397		3625
2398	F<ev.c> includes the backend files directly when enabled, so you only need	3626	F<ev.c> includes the backend files directly when enabled, so you only need
2399	to compile this single file.	3627	to compile this single file.
2400		3628
2401	=head3 LIBEVENT COMPATIBILITY API	3629	=head3 LIBEVENT COMPATIBILITY API
2402		3630
2403	To include the libevent compatibility API, also include:	3631	To include the libevent compatibility API, also include:
2404		3632
2405	#include "event.c"	3633	#include "event.c"
2406		3634
2407	in the file including F<ev.c>, and:	3635	in the file including F<ev.c>, and:
2408		3636
2409	#include "event.h"	3637	#include "event.h"
2410		3638
2411	in the files that want to use the libevent API. This also includes F<ev.h>.	3639	in the files that want to use the libevent API. This also includes F<ev.h>.
2412		3640
2413	You need the following additional files for this:	3641	You need the following additional files for this:
2414		3642
2415	event.h	3643	event.h
2416	event.c	3644	event.c
2417		3645
2418	=head3 AUTOCONF SUPPORT	3646	=head3 AUTOCONF SUPPORT
2419		3647
2420	Instead of using C<EV_STANDALONE=1> and providing your config in	3648	Instead of using C<EV_STANDALONE=1> and providing your configuration in
2421	whatever way you want, you can also C<m4_include([libev.m4])> in your	3649	whatever way you want, you can also C<m4_include([libev.m4])> in your
2422	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then	3650	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2423	include F<config.h> and configure itself accordingly.	3651	include F<config.h> and configure itself accordingly.
2424		3652
2425	For this of course you need the m4 file:	3653	For this of course you need the m4 file:
2426		3654
2427	libev.m4	3655	libev.m4
2428		3656
2429	=head2 PREPROCESSOR SYMBOLS/MACROS	3657	=head2 PREPROCESSOR SYMBOLS/MACROS
2430		3658
2431	Libev can be configured via a variety of preprocessor symbols you have to define	3659	Libev can be configured via a variety of preprocessor symbols you have to
2432	before including any of its files. The default is not to build for multiplicity	3660	define before including (or compiling) any of its files. The default in
2433	and only include the select backend.	3661	the absence of autoconf is documented for every option.
		3662
		3663	Symbols marked with "(h)" do not change the ABI, and can have different
		3664	values when compiling libev vs. including F<ev.h>, so it is permissible
		3665	to redefine them before including F<ev.h> without breakign compatibility
		3666	to a compiled library. All other symbols change the ABI, which means all
		3667	users of libev and the libev code itself must be compiled with compatible
		3668	settings.
2434		3669
2435	=over 4	3670	=over 4
2436		3671
2437	=item EV_STANDALONE	3672	=item EV_STANDALONE (h)
2438		3673
2439	Must always be C<1> if you do not use autoconf configuration, which	3674	Must always be C<1> if you do not use autoconf configuration, which
2440	keeps libev from including F<config.h>, and it also defines dummy	3675	keeps libev from including F<config.h>, and it also defines dummy
2441	implementations for some libevent functions (such as logging, which is not	3676	implementations for some libevent functions (such as logging, which is not
2442	supported). It will also not define any of the structs usually found in	3677	supported). It will also not define any of the structs usually found in
2443	F<event.h> that are not directly supported by the libev core alone.	3678	F<event.h> that are not directly supported by the libev core alone.
2444		3679
		3680	In standalone mode, libev will still try to automatically deduce the
		3681	configuration, but has to be more conservative.
		3682
2445	=item EV_USE_MONOTONIC	3683	=item EV_USE_MONOTONIC
2446		3684
2447	If defined to be C<1>, libev will try to detect the availability of the	3685	If defined to be C<1>, libev will try to detect the availability of the
2448	monotonic clock option at both compiletime and runtime. Otherwise no use	3686	monotonic clock option at both compile time and runtime. Otherwise no
2449	of the monotonic clock option will be attempted. If you enable this, you	3687	use of the monotonic clock option will be attempted. If you enable this,
2450	usually have to link against librt or something similar. Enabling it when	3688	you usually have to link against librt or something similar. Enabling it
2451	the functionality isn't available is safe, though, although you have	3689	when the functionality isn't available is safe, though, although you have
2452	to make sure you link against any libraries where the C<clock_gettime>	3690	to make sure you link against any libraries where the C<clock_gettime>
2453	function is hiding in (often F<-lrt>).	3691	function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
2454		3692
2455	=item EV_USE_REALTIME	3693	=item EV_USE_REALTIME
2456		3694
2457	If defined to be C<1>, libev will try to detect the availability of the	3695	If defined to be C<1>, libev will try to detect the availability of the
2458	realtime clock option at compiletime (and assume its availability at	3696	real-time clock option at compile time (and assume its availability
2459	runtime if successful). Otherwise no use of the realtime clock option will	3697	at runtime if successful). Otherwise no use of the real-time clock
2460	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	3698	option will be attempted. This effectively replaces C<gettimeofday>
2461	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the	3699	by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect
2462	note about libraries in the description of C<EV_USE_MONOTONIC>, though.	3700	correctness. See the note about libraries in the description of
		3701	C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of
		3702	C<EV_USE_CLOCK_SYSCALL>.
		3703
		3704	=item EV_USE_CLOCK_SYSCALL
		3705
		3706	If defined to be C<1>, libev will try to use a direct syscall instead
		3707	of calling the system-provided C<clock_gettime> function. This option
		3708	exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt>
		3709	unconditionally pulls in C<libpthread>, slowing down single-threaded
		3710	programs needlessly. Using a direct syscall is slightly slower (in
		3711	theory), because no optimised vdso implementation can be used, but avoids
		3712	the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or
		3713	higher, as it simplifies linking (no need for C<-lrt>).
2463		3714
2464	=item EV_USE_NANOSLEEP	3715	=item EV_USE_NANOSLEEP
2465		3716
2466	If defined to be C<1>, libev will assume that C<nanosleep ()> is available	3717	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2467	and will use it for delays. Otherwise it will use C<select ()>.	3718	and will use it for delays. Otherwise it will use C<select ()>.
2468		3719
		3720	=item EV_USE_EVENTFD
		3721
		3722	If defined to be C<1>, then libev will assume that C<eventfd ()> is
		3723	available and will probe for kernel support at runtime. This will improve
		3724	C<ev_signal> and C<ev_async> performance and reduce resource consumption.
		3725	If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
		3726	2.7 or newer, otherwise disabled.
		3727
2469	=item EV_USE_SELECT	3728	=item EV_USE_SELECT
2470		3729
2471	If undefined or defined to be C<1>, libev will compile in support for the	3730	If undefined or defined to be C<1>, libev will compile in support for the
2472	C<select>(2) backend. No attempt at autodetection will be done: if no	3731	C<select>(2) backend. No attempt at auto-detection will be done: if no
2473	other method takes over, select will be it. Otherwise the select backend	3732	other method takes over, select will be it. Otherwise the select backend
2474	will not be compiled in.	3733	will not be compiled in.
2475		3734
2476	=item EV_SELECT_USE_FD_SET	3735	=item EV_SELECT_USE_FD_SET
2477		3736
2478	If defined to C<1>, then the select backend will use the system C<fd_set>	3737	If defined to C<1>, then the select backend will use the system C<fd_set>
2479	structure. This is useful if libev doesn't compile due to a missing	3738	structure. This is useful if libev doesn't compile due to a missing
2480	C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on	3739	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout
2481	exotic systems. This usually limits the range of file descriptors to some	3740	on exotic systems. This usually limits the range of file descriptors to
2482	low limit such as 1024 or might have other limitations (winsocket only	3741	some low limit such as 1024 or might have other limitations (winsocket
2483	allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might	3742	only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
2484	influence the size of the C<fd_set> used.	3743	configures the maximum size of the C<fd_set>.
2485		3744
2486	=item EV_SELECT_IS_WINSOCKET	3745	=item EV_SELECT_IS_WINSOCKET
2487		3746
2488	When defined to C<1>, the select backend will assume that	3747	When defined to C<1>, the select backend will assume that
2489	select/socket/connect etc. don't understand file descriptors but	3748	select/socket/connect etc. don't understand file descriptors but
…		…
2491	be used is the winsock select). This means that it will call	3750	be used is the winsock select). This means that it will call
2492	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,	3751	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2493	it is assumed that all these functions actually work on fds, even	3752	it is assumed that all these functions actually work on fds, even
2494	on win32. Should not be defined on non-win32 platforms.	3753	on win32. Should not be defined on non-win32 platforms.
2495		3754
		3755	=item EV_FD_TO_WIN32_HANDLE(fd)
		3756
		3757	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
		3758	file descriptors to socket handles. When not defining this symbol (the
		3759	default), then libev will call C<_get_osfhandle>, which is usually
		3760	correct. In some cases, programs use their own file descriptor management,
		3761	in which case they can provide this function to map fds to socket handles.
		3762
		3763	=item EV_WIN32_HANDLE_TO_FD(handle)
		3764
		3765	If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
		3766	using the standard C<_open_osfhandle> function. For programs implementing
		3767	their own fd to handle mapping, overwriting this function makes it easier
		3768	to do so. This can be done by defining this macro to an appropriate value.
		3769
		3770	=item EV_WIN32_CLOSE_FD(fd)
		3771
		3772	If programs implement their own fd to handle mapping on win32, then this
		3773	macro can be used to override the C<close> function, useful to unregister
		3774	file descriptors again. Note that the replacement function has to close
		3775	the underlying OS handle.
		3776
2496	=item EV_USE_POLL	3777	=item EV_USE_POLL
2497		3778
2498	If defined to be C<1>, libev will compile in support for the C<poll>(2)	3779	If defined to be C<1>, libev will compile in support for the C<poll>(2)
2499	backend. Otherwise it will be enabled on non-win32 platforms. It	3780	backend. Otherwise it will be enabled on non-win32 platforms. It
2500	takes precedence over select.	3781	takes precedence over select.
2501		3782
2502	=item EV_USE_EPOLL	3783	=item EV_USE_EPOLL
2503		3784
2504	If defined to be C<1>, libev will compile in support for the Linux	3785	If defined to be C<1>, libev will compile in support for the Linux
2505	C<epoll>(7) backend. Its availability will be detected at runtime,	3786	C<epoll>(7) backend. Its availability will be detected at runtime,
2506	otherwise another method will be used as fallback. This is the	3787	otherwise another method will be used as fallback. This is the preferred
2507	preferred backend for GNU/Linux systems.	3788	backend for GNU/Linux systems. If undefined, it will be enabled if the
		3789	headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2508		3790
2509	=item EV_USE_KQUEUE	3791	=item EV_USE_KQUEUE
2510		3792
2511	If defined to be C<1>, libev will compile in support for the BSD style	3793	If defined to be C<1>, libev will compile in support for the BSD style
2512	C<kqueue>(2) backend. Its actual availability will be detected at runtime,	3794	C<kqueue>(2) backend. Its actual availability will be detected at runtime,
…		…
2525	otherwise another method will be used as fallback. This is the preferred	3807	otherwise another method will be used as fallback. This is the preferred
2526	backend for Solaris 10 systems.	3808	backend for Solaris 10 systems.
2527		3809
2528	=item EV_USE_DEVPOLL	3810	=item EV_USE_DEVPOLL
2529		3811
2530	reserved for future expansion, works like the USE symbols above.	3812	Reserved for future expansion, works like the USE symbols above.
2531		3813
2532	=item EV_USE_INOTIFY	3814	=item EV_USE_INOTIFY
2533		3815
2534	If defined to be C<1>, libev will compile in support for the Linux inotify	3816	If defined to be C<1>, libev will compile in support for the Linux inotify
2535	interface to speed up C<ev_stat> watchers. Its actual availability will	3817	interface to speed up C<ev_stat> watchers. Its actual availability will
2536	be detected at runtime.	3818	be detected at runtime. If undefined, it will be enabled if the headers
		3819	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2537		3820
		3821	=item EV_ATOMIC_T
		3822
		3823	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
		3824	access is atomic with respect to other threads or signal contexts. No such
		3825	type is easily found in the C language, so you can provide your own type
		3826	that you know is safe for your purposes. It is used both for signal handler "locking"
		3827	as well as for signal and thread safety in C<ev_async> watchers.
		3828
		3829	In the absence of this define, libev will use C<sig_atomic_t volatile>
		3830	(from F<signal.h>), which is usually good enough on most platforms.
		3831
2538	=item EV_H	3832	=item EV_H (h)
2539		3833
2540	The name of the F<ev.h> header file used to include it. The default if	3834	The name of the F<ev.h> header file used to include it. The default if
2541	undefined is C<"ev.h"> in F<event.h> and F<ev.c>. This can be used to	3835	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2542	virtually rename the F<ev.h> header file in case of conflicts.	3836	used to virtually rename the F<ev.h> header file in case of conflicts.
2543		3837
2544	=item EV_CONFIG_H	3838	=item EV_CONFIG_H (h)
2545		3839
2546	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override	3840	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2547	F<ev.c>'s idea of where to find the F<config.h> file, similarly to	3841	F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2548	C<EV_H>, above.	3842	C<EV_H>, above.
2549		3843
2550	=item EV_EVENT_H	3844	=item EV_EVENT_H (h)
2551		3845
2552	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea	3846	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2553	of how the F<event.h> header can be found, the dfeault is C<"event.h">.	3847	of how the F<event.h> header can be found, the default is C<"event.h">.
2554		3848
2555	=item EV_PROTOTYPES	3849	=item EV_PROTOTYPES (h)
2556		3850
2557	If defined to be C<0>, then F<ev.h> will not define any function	3851	If defined to be C<0>, then F<ev.h> will not define any function
2558	prototypes, but still define all the structs and other symbols. This is	3852	prototypes, but still define all the structs and other symbols. This is
2559	occasionally useful if you want to provide your own wrapper functions	3853	occasionally useful if you want to provide your own wrapper functions
2560	around libev functions.	3854	around libev functions.
…		…
2579	When doing priority-based operations, libev usually has to linearly search	3873	When doing priority-based operations, libev usually has to linearly search
2580	all the priorities, so having many of them (hundreds) uses a lot of space	3874	all the priorities, so having many of them (hundreds) uses a lot of space
2581	and time, so using the defaults of five priorities (-2 .. +2) is usually	3875	and time, so using the defaults of five priorities (-2 .. +2) is usually
2582	fine.	3876	fine.
2583		3877
2584	If your embedding app does not need any priorities, defining these both to	3878	If your embedding application does not need any priorities, defining these
2585	C<0> will save some memory and cpu.	3879	both to C<0> will save some memory and CPU.
2586		3880
2587	=item EV_PERIODIC_ENABLE	3881	=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
		3882	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
		3883	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
2588		3884
2589	If undefined or defined to be C<1>, then periodic timers are supported. If	3885	If undefined or defined to be C<1> (and the platform supports it), then
2590	defined to be C<0>, then they are not. Disabling them saves a few kB of	3886	the respective watcher type is supported. If defined to be C<0>, then it
2591	code.	3887	is not. Disabling watcher types mainly saves codesize.
2592		3888
2593	=item EV_IDLE_ENABLE	3889	=item EV_FEATURES
2594
2595	If undefined or defined to be C<1>, then idle watchers are supported. If
2596	defined to be C<0>, then they are not. Disabling them saves a few kB of
2597	code.
2598
2599	=item EV_EMBED_ENABLE
2600
2601	If undefined or defined to be C<1>, then embed watchers are supported. If
2602	defined to be C<0>, then they are not.
2603
2604	=item EV_STAT_ENABLE
2605
2606	If undefined or defined to be C<1>, then stat watchers are supported. If
2607	defined to be C<0>, then they are not.
2608
2609	=item EV_FORK_ENABLE
2610
2611	If undefined or defined to be C<1>, then fork watchers are supported. If
2612	defined to be C<0>, then they are not.
2613
2614	=item EV_MINIMAL
2615		3890
2616	If you need to shave off some kilobytes of code at the expense of some	3891	If you need to shave off some kilobytes of code at the expense of some
2617	speed, define this symbol to C<1>. Currently only used for gcc to override	3892	speed (but with the full API), you can define this symbol to request
2618	some inlining decisions, saves roughly 30% codesize of amd64.	3893	certain subsets of functionality. The default is to enable all features
		3894	that can be enabled on the platform.
		3895
		3896	Note that using autoconf will usually override most of the features, so
		3897	using this symbol makes sense mostly when embedding libev.
		3898
		3899	A typical way to use this symbol is to define it to C<0> (or to a bitset
		3900	with some broad features you want) and then selectively re-enable
		3901	additional parts you want, for example if you want everything minimal,
		3902	but multiple event loop support, async and child watchers and the poll
		3903	backend, use this:
		3904
		3905	#define EV_FEATURES 0
		3906	#define EV_MULTIPLICITY 1
		3907	#define EV_USE_POLL 1
		3908	#define EV_CHILD_ENABLE 1
		3909	#define EV_ASYNC_ENABLE 1
		3910
		3911	The actual value is a bitset, it can be a combination of the following
		3912	values:
		3913
		3914	=over 4
		3915
		3916	=item C<1> - faster/larger code
		3917
		3918	Use larger code to speed up some operations.
		3919
		3920	Currently this is used to override some inlining decisions (enlarging the roughly
		3921	30% code size on amd64.
		3922
		3923	When optimising for size, use of compiler flags such as C<-Os> with
		3924	gcc recommended, as well as C<-DNDEBUG>, as libev contains a number of
		3925	assertions.
		3926
		3927	=item C<2> - faster/larger data structures
		3928
		3929	Replaces the small 2-heap for timer management by a faster 4-heap, larger
		3930	hash table sizes and so on. This will usually further increase codesize
		3931	and can additionally have an effect on the size of data structures at
		3932	runtime.
		3933
		3934	=item C<4> - full API configuration
		3935
		3936	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
		3937	enables multiplicity (C<EV_MULTIPLICITY>=1).
		3938
		3939	It also enables a lot of the "lesser used" core API functions. See C<ev.h>
		3940	for details on which parts of the API are still available without this
		3941	feature, and do not complain if this subset changes over time.
		3942
		3943	=item C<8> - enable all optional watcher types
		3944
		3945	Enables all optional watcher types. If you want to selectively enable
		3946	only some watcher types other than I/O and timers (e.g. prepare,
		3947	embed, async, child...) you can enable them manually by defining
		3948	C<EV_watchertype_ENABLE> to C<1> instead.
		3949
		3950	=item C<16> - enable all backends
		3951
		3952	This enables all backends - without this feature, you need to enable at
		3953	least one backend manually (C<EV_USE_SELECT> is a good choice).
		3954
		3955	=item C<32> - enable OS-specific "helper" APIs
		3956
		3957	Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
		3958	default.
		3959
		3960	=back
		3961
		3962	Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
		3963	reduces the compiled size of libev from 24.7Kb to 6.5Kb on my GNU/Linux
		3964	amd64 system, while still giving you I/O watchers, timers and monotonic
		3965	clock support.
		3966
		3967	With an intelligent-enough linker (gcc+binutils are intelligent enough
		3968	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
		3969	your program might be left out as well - a binary starting a timer and an
		3970	I/O watcher then might come out at only 5Kb.
		3971
		3972	=item EV_AVOID_STDIO
		3973
		3974	If this is set to C<1> at compiletime, then libev will avoid using stdio
		3975	functions (printf, scanf, perror etc.). This will increase the codesize
		3976	somewhat, but if your program doesn't otherwise depend on stdio and your
		3977	libc allows it, this avoids linking in the stdio library which is quite
		3978	big.
		3979
		3980	Note that error messages might become less precise when this option is
		3981	enabled.
		3982
		3983	=item EV_NSIG
		3984
		3985	The highest supported signal number, +1 (or, the number of
		3986	signals): Normally, libev tries to deduce the maximum number of signals
		3987	automatically, but sometimes this fails, in which case it can be
		3988	specified. Also, using a lower number than detected (C<32> should be
		3989	good for about any system in existance) can save some memory, as libev
		3990	statically allocates some 12-24 bytes per signal number.
2619		3991
2620	=item EV_PID_HASHSIZE	3992	=item EV_PID_HASHSIZE
2621		3993
2622	C<ev_child> watchers use a small hash table to distribute workload by	3994	C<ev_child> watchers use a small hash table to distribute workload by
2623	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	3995	pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
2624	than enough. If you need to manage thousands of children you might want to	3996	usually more than enough. If you need to manage thousands of children you
2625	increase this value (I<must> be a power of two).	3997	might want to increase this value (I<must> be a power of two).
2626		3998
2627	=item EV_INOTIFY_HASHSIZE	3999	=item EV_INOTIFY_HASHSIZE
2628		4000
2629	C<ev_stat> watchers use a small hash table to distribute workload by	4001	C<ev_stat> watchers use a small hash table to distribute workload by
2630	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	4002	inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
2631	usually more than enough. If you need to manage thousands of C<ev_stat>	4003	disabled), usually more than enough. If you need to manage thousands of
2632	watchers you might want to increase this value (I<must> be a power of	4004	C<ev_stat> watchers you might want to increase this value (I<must> be a
2633	two).	4005	power of two).
		4006
		4007	=item EV_USE_4HEAP
		4008
		4009	Heaps are not very cache-efficient. To improve the cache-efficiency of the
		4010	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
		4011	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
		4012	faster performance with many (thousands) of watchers.
		4013
		4014	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
		4015	will be C<0>.
		4016
		4017	=item EV_HEAP_CACHE_AT
		4018
		4019	Heaps are not very cache-efficient. To improve the cache-efficiency of the
		4020	timer and periodics heaps, libev can cache the timestamp (I<at>) within
		4021	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
		4022	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
		4023	but avoids random read accesses on heap changes. This improves performance
		4024	noticeably with many (hundreds) of watchers.
		4025
		4026	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
		4027	will be C<0>.
		4028
		4029	=item EV_VERIFY
		4030
		4031	Controls how much internal verification (see C<ev_loop_verify ()>) will
		4032	be done: If set to C<0>, no internal verification code will be compiled
		4033	in. If set to C<1>, then verification code will be compiled in, but not
		4034	called. If set to C<2>, then the internal verification code will be
		4035	called once per loop, which can slow down libev. If set to C<3>, then the
		4036	verification code will be called very frequently, which will slow down
		4037	libev considerably.
		4038
		4039	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
		4040	will be C<0>.
2634		4041
2635	=item EV_COMMON	4042	=item EV_COMMON
2636		4043
2637	By default, all watchers have a C<void *data> member. By redefining	4044	By default, all watchers have a C<void *data> member. By redefining
2638	this macro to a something else you can include more and other types of	4045	this macro to a something else you can include more and other types of
2639	members. You have to define it each time you include one of the files,	4046	members. You have to define it each time you include one of the files,
2640	though, and it must be identical each time.	4047	though, and it must be identical each time.
2641		4048
2642	For example, the perl EV module uses something like this:	4049	For example, the perl EV module uses something like this:
2643		4050
2644	#define EV_COMMON \	4051	#define EV_COMMON \
2645	SV *self; /* contains this struct */ \	4052	SV *self; /* contains this struct */ \
2646	SV *cb_sv, *fh /* note no trailing ";" */	4053	SV *cb_sv, *fh /* note no trailing ";" */
2647		4054
2648	=item EV_CB_DECLARE (type)	4055	=item EV_CB_DECLARE (type)
2649		4056
2650	=item EV_CB_INVOKE (watcher, revents)	4057	=item EV_CB_INVOKE (watcher, revents)
2651		4058
…		…
2656	definition and a statement, respectively. See the F<ev.h> header file for	4063	definition and a statement, respectively. See the F<ev.h> header file for
2657	their default definitions. One possible use for overriding these is to	4064	their default definitions. One possible use for overriding these is to
2658	avoid the C<struct ev_loop *> as first argument in all cases, or to use	4065	avoid the C<struct ev_loop *> as first argument in all cases, or to use
2659	method calls instead of plain function calls in C++.	4066	method calls instead of plain function calls in C++.
2660		4067
		4068	=back
		4069
2661	=head2 EXPORTED API SYMBOLS	4070	=head2 EXPORTED API SYMBOLS
2662		4071
2663	If you need to re-export the API (e.g. via a dll) and you need a list of	4072	If you need to re-export the API (e.g. via a DLL) and you need a list of
2664	exported symbols, you can use the provided F<Symbol.*> files which list	4073	exported symbols, you can use the provided F<Symbol.*> files which list
2665	all public symbols, one per line:	4074	all public symbols, one per line:
2666		4075
2667	Symbols.ev for libev proper	4076	Symbols.ev for libev proper
2668	Symbols.event for the libevent emulation	4077	Symbols.event for the libevent emulation
2669		4078
2670	This can also be used to rename all public symbols to avoid clashes with	4079	This can also be used to rename all public symbols to avoid clashes with
2671	multiple versions of libev linked together (which is obviously bad in	4080	multiple versions of libev linked together (which is obviously bad in
2672	itself, but sometimes it is inconvinient to avoid this).	4081	itself, but sometimes it is inconvenient to avoid this).
2673		4082
2674	A sed command like this will create wrapper C<#define>'s that you need to	4083	A sed command like this will create wrapper C<#define>'s that you need to
2675	include before including F<ev.h>:	4084	include before including F<ev.h>:
2676		4085
2677	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h	4086	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
…		…
2694	file.	4103	file.
2695		4104
2696	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	4105	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2697	that everybody includes and which overrides some configure choices:	4106	that everybody includes and which overrides some configure choices:
2698		4107
2699	#define EV_MINIMAL 1	4108	#define EV_FEATURES 0
2700	#define EV_USE_POLL 0	4109	#define EV_USE_SELECT 1
2701	#define EV_MULTIPLICITY 0
2702	#define EV_PERIODIC_ENABLE 0
2703	#define EV_STAT_ENABLE 0
2704	#define EV_FORK_ENABLE 0
2705	#define EV_CONFIG_H <config.h>	4110	#define EV_CONFIG_H <config.h>
2706	#define EV_MINPRI 0
2707	#define EV_MAXPRI 0
2708		4111
2709	#include "ev++.h"	4112	#include "ev++.h"
2710		4113
2711	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4114	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2712		4115
2713	#include "ev_cpp.h"	4116	#include "ev_cpp.h"
2714	#include "ev.c"	4117	#include "ev.c"
2715		4118
		4119	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES
2716		4120
		4121	=head2 THREADS AND COROUTINES
		4122
		4123	=head3 THREADS
		4124
		4125	All libev functions are reentrant and thread-safe unless explicitly
		4126	documented otherwise, but libev implements no locking itself. This means
		4127	that you can use as many loops as you want in parallel, as long as there
		4128	are no concurrent calls into any libev function with the same loop
		4129	parameter (C<ev_default_*> calls have an implicit default loop parameter,
		4130	of course): libev guarantees that different event loops share no data
		4131	structures that need any locking.
		4132
		4133	Or to put it differently: calls with different loop parameters can be done
		4134	concurrently from multiple threads, calls with the same loop parameter
		4135	must be done serially (but can be done from different threads, as long as
		4136	only one thread ever is inside a call at any point in time, e.g. by using
		4137	a mutex per loop).
		4138
		4139	Specifically to support threads (and signal handlers), libev implements
		4140	so-called C<ev_async> watchers, which allow some limited form of
		4141	concurrency on the same event loop, namely waking it up "from the
		4142	outside".
		4143
		4144	If you want to know which design (one loop, locking, or multiple loops
		4145	without or something else still) is best for your problem, then I cannot
		4146	help you, but here is some generic advice:
		4147
		4148	=over 4
		4149
		4150	=item * most applications have a main thread: use the default libev loop
		4151	in that thread, or create a separate thread running only the default loop.
		4152
		4153	This helps integrating other libraries or software modules that use libev
		4154	themselves and don't care/know about threading.
		4155
		4156	=item * one loop per thread is usually a good model.
		4157
		4158	Doing this is almost never wrong, sometimes a better-performance model
		4159	exists, but it is always a good start.
		4160
		4161	=item * other models exist, such as the leader/follower pattern, where one
		4162	loop is handed through multiple threads in a kind of round-robin fashion.
		4163
		4164	Choosing a model is hard - look around, learn, know that usually you can do
		4165	better than you currently do :-)
		4166
		4167	=item * often you need to talk to some other thread which blocks in the
		4168	event loop.
		4169
		4170	C<ev_async> watchers can be used to wake them up from other threads safely
		4171	(or from signal contexts...).
		4172
		4173	An example use would be to communicate signals or other events that only
		4174	work in the default loop by registering the signal watcher with the
		4175	default loop and triggering an C<ev_async> watcher from the default loop
		4176	watcher callback into the event loop interested in the signal.
		4177
		4178	=back
		4179
		4180	=head4 THREAD LOCKING EXAMPLE
		4181
		4182	Here is a fictitious example of how to run an event loop in a different
		4183	thread than where callbacks are being invoked and watchers are
		4184	created/added/removed.
		4185
		4186	For a real-world example, see the C<EV::Loop::Async> perl module,
		4187	which uses exactly this technique (which is suited for many high-level
		4188	languages).
		4189
		4190	The example uses a pthread mutex to protect the loop data, a condition
		4191	variable to wait for callback invocations, an async watcher to notify the
		4192	event loop thread and an unspecified mechanism to wake up the main thread.
		4193
		4194	First, you need to associate some data with the event loop:
		4195
		4196	typedef struct {
		4197	mutex_t lock; /* global loop lock */
		4198	ev_async async_w;
		4199	thread_t tid;
		4200	cond_t invoke_cv;
		4201	} userdata;
		4202
		4203	void prepare_loop (EV_P)
		4204	{
		4205	// for simplicity, we use a static userdata struct.
		4206	static userdata u;
		4207
		4208	ev_async_init (&u->async_w, async_cb);
		4209	ev_async_start (EV_A_ &u->async_w);
		4210
		4211	pthread_mutex_init (&u->lock, 0);
		4212	pthread_cond_init (&u->invoke_cv, 0);
		4213
		4214	// now associate this with the loop
		4215	ev_set_userdata (EV_A_ u);
		4216	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		4217	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		4218
		4219	// then create the thread running ev_loop
		4220	pthread_create (&u->tid, 0, l_run, EV_A);
		4221	}
		4222
		4223	The callback for the C<ev_async> watcher does nothing: the watcher is used
		4224	solely to wake up the event loop so it takes notice of any new watchers
		4225	that might have been added:
		4226
		4227	static void
		4228	async_cb (EV_P_ ev_async *w, int revents)
		4229	{
		4230	// just used for the side effects
		4231	}
		4232
		4233	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		4234	protecting the loop data, respectively.
		4235
		4236	static void
		4237	l_release (EV_P)
		4238	{
		4239	userdata *u = ev_userdata (EV_A);
		4240	pthread_mutex_unlock (&u->lock);
		4241	}
		4242
		4243	static void
		4244	l_acquire (EV_P)
		4245	{
		4246	userdata *u = ev_userdata (EV_A);
		4247	pthread_mutex_lock (&u->lock);
		4248	}
		4249
		4250	The event loop thread first acquires the mutex, and then jumps straight
		4251	into C<ev_loop>:
		4252
		4253	void *
		4254	l_run (void *thr_arg)
		4255	{
		4256	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		4257
		4258	l_acquire (EV_A);
		4259	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		4260	ev_loop (EV_A_ 0);
		4261	l_release (EV_A);
		4262
		4263	return 0;
		4264	}
		4265
		4266	Instead of invoking all pending watchers, the C<l_invoke> callback will
		4267	signal the main thread via some unspecified mechanism (signals? pipe
		4268	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		4269	have been called (in a while loop because a) spurious wakeups are possible
		4270	and b) skipping inter-thread-communication when there are no pending
		4271	watchers is very beneficial):
		4272
		4273	static void
		4274	l_invoke (EV_P)
		4275	{
		4276	userdata *u = ev_userdata (EV_A);
		4277
		4278	while (ev_pending_count (EV_A))
		4279	{
		4280	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		4281	pthread_cond_wait (&u->invoke_cv, &u->lock);
		4282	}
		4283	}
		4284
		4285	Now, whenever the main thread gets told to invoke pending watchers, it
		4286	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		4287	thread to continue:
		4288
		4289	static void
		4290	real_invoke_pending (EV_P)
		4291	{
		4292	userdata *u = ev_userdata (EV_A);
		4293
		4294	pthread_mutex_lock (&u->lock);
		4295	ev_invoke_pending (EV_A);
		4296	pthread_cond_signal (&u->invoke_cv);
		4297	pthread_mutex_unlock (&u->lock);
		4298	}
		4299
		4300	Whenever you want to start/stop a watcher or do other modifications to an
		4301	event loop, you will now have to lock:
		4302
		4303	ev_timer timeout_watcher;
		4304	userdata *u = ev_userdata (EV_A);
		4305
		4306	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		4307
		4308	pthread_mutex_lock (&u->lock);
		4309	ev_timer_start (EV_A_ &timeout_watcher);
		4310	ev_async_send (EV_A_ &u->async_w);
		4311	pthread_mutex_unlock (&u->lock);
		4312
		4313	Note that sending the C<ev_async> watcher is required because otherwise
		4314	an event loop currently blocking in the kernel will have no knowledge
		4315	about the newly added timer. By waking up the loop it will pick up any new
		4316	watchers in the next event loop iteration.
		4317
		4318	=head3 COROUTINES
		4319
		4320	Libev is very accommodating to coroutines ("cooperative threads"):
		4321	libev fully supports nesting calls to its functions from different
		4322	coroutines (e.g. you can call C<ev_loop> on the same loop from two
		4323	different coroutines, and switch freely between both coroutines running
		4324	the loop, as long as you don't confuse yourself). The only exception is
		4325	that you must not do this from C<ev_periodic> reschedule callbacks.
		4326
		4327	Care has been taken to ensure that libev does not keep local state inside
		4328	C<ev_loop>, and other calls do not usually allow for coroutine switches as
		4329	they do not call any callbacks.
		4330
		4331	=head2 COMPILER WARNINGS
		4332
		4333	Depending on your compiler and compiler settings, you might get no or a
		4334	lot of warnings when compiling libev code. Some people are apparently
		4335	scared by this.
		4336
		4337	However, these are unavoidable for many reasons. For one, each compiler
		4338	has different warnings, and each user has different tastes regarding
		4339	warning options. "Warn-free" code therefore cannot be a goal except when
		4340	targeting a specific compiler and compiler-version.
		4341
		4342	Another reason is that some compiler warnings require elaborate
		4343	workarounds, or other changes to the code that make it less clear and less
		4344	maintainable.
		4345
		4346	And of course, some compiler warnings are just plain stupid, or simply
		4347	wrong (because they don't actually warn about the condition their message
		4348	seems to warn about). For example, certain older gcc versions had some
		4349	warnings that resulted an extreme number of false positives. These have
		4350	been fixed, but some people still insist on making code warn-free with
		4351	such buggy versions.
		4352
		4353	While libev is written to generate as few warnings as possible,
		4354	"warn-free" code is not a goal, and it is recommended not to build libev
		4355	with any compiler warnings enabled unless you are prepared to cope with
		4356	them (e.g. by ignoring them). Remember that warnings are just that:
		4357	warnings, not errors, or proof of bugs.
		4358
		4359
		4360	=head2 VALGRIND
		4361
		4362	Valgrind has a special section here because it is a popular tool that is
		4363	highly useful. Unfortunately, valgrind reports are very hard to interpret.
		4364
		4365	If you think you found a bug (memory leak, uninitialised data access etc.)
		4366	in libev, then check twice: If valgrind reports something like:
		4367
		4368	==2274== definitely lost: 0 bytes in 0 blocks.
		4369	==2274== possibly lost: 0 bytes in 0 blocks.
		4370	==2274== still reachable: 256 bytes in 1 blocks.
		4371
		4372	Then there is no memory leak, just as memory accounted to global variables
		4373	is not a memleak - the memory is still being referenced, and didn't leak.
		4374
		4375	Similarly, under some circumstances, valgrind might report kernel bugs
		4376	as if it were a bug in libev (e.g. in realloc or in the poll backend,
		4377	although an acceptable workaround has been found here), or it might be
		4378	confused.
		4379
		4380	Keep in mind that valgrind is a very good tool, but only a tool. Don't
		4381	make it into some kind of religion.
		4382
		4383	If you are unsure about something, feel free to contact the mailing list
		4384	with the full valgrind report and an explanation on why you think this
		4385	is a bug in libev (best check the archives, too :). However, don't be
		4386	annoyed when you get a brisk "this is no bug" answer and take the chance
		4387	of learning how to interpret valgrind properly.
		4388
		4389	If you need, for some reason, empty reports from valgrind for your project
		4390	I suggest using suppression lists.
		4391
		4392
		4393	=head1 PORTABILITY NOTES
		4394
		4395	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		4396
		4397	Win32 doesn't support any of the standards (e.g. POSIX) that libev
		4398	requires, and its I/O model is fundamentally incompatible with the POSIX
		4399	model. Libev still offers limited functionality on this platform in
		4400	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
		4401	descriptors. This only applies when using Win32 natively, not when using
		4402	e.g. cygwin.
		4403
		4404	Lifting these limitations would basically require the full
		4405	re-implementation of the I/O system. If you are into these kinds of
		4406	things, then note that glib does exactly that for you in a very portable
		4407	way (note also that glib is the slowest event library known to man).
		4408
		4409	There is no supported compilation method available on windows except
		4410	embedding it into other applications.
		4411
		4412	Sensible signal handling is officially unsupported by Microsoft - libev
		4413	tries its best, but under most conditions, signals will simply not work.
		4414
		4415	Not a libev limitation but worth mentioning: windows apparently doesn't
		4416	accept large writes: instead of resulting in a partial write, windows will
		4417	either accept everything or return C<ENOBUFS> if the buffer is too large,
		4418	so make sure you only write small amounts into your sockets (less than a
		4419	megabyte seems safe, but this apparently depends on the amount of memory
		4420	available).
		4421
		4422	Due to the many, low, and arbitrary limits on the win32 platform and
		4423	the abysmal performance of winsockets, using a large number of sockets
		4424	is not recommended (and not reasonable). If your program needs to use
		4425	more than a hundred or so sockets, then likely it needs to use a totally
		4426	different implementation for windows, as libev offers the POSIX readiness
		4427	notification model, which cannot be implemented efficiently on windows
		4428	(due to Microsoft monopoly games).
		4429
		4430	A typical way to use libev under windows is to embed it (see the embedding
		4431	section for details) and use the following F<evwrap.h> header file instead
		4432	of F<ev.h>:
		4433
		4434	#define EV_STANDALONE /* keeps ev from requiring config.h */
		4435	#define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
		4436
		4437	#include "ev.h"
		4438
		4439	And compile the following F<evwrap.c> file into your project (make sure
		4440	you do I<not> compile the F<ev.c> or any other embedded source files!):
		4441
		4442	#include "evwrap.h"
		4443	#include "ev.c"
		4444
		4445	=over 4
		4446
		4447	=item The winsocket select function
		4448
		4449	The winsocket C<select> function doesn't follow POSIX in that it
		4450	requires socket I<handles> and not socket I<file descriptors> (it is
		4451	also extremely buggy). This makes select very inefficient, and also
		4452	requires a mapping from file descriptors to socket handles (the Microsoft
		4453	C runtime provides the function C<_open_osfhandle> for this). See the
		4454	discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
		4455	C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
		4456
		4457	The configuration for a "naked" win32 using the Microsoft runtime
		4458	libraries and raw winsocket select is:
		4459
		4460	#define EV_USE_SELECT 1
		4461	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
		4462
		4463	Note that winsockets handling of fd sets is O(n), so you can easily get a
		4464	complexity in the O(n²) range when using win32.
		4465
		4466	=item Limited number of file descriptors
		4467
		4468	Windows has numerous arbitrary (and low) limits on things.
		4469
		4470	Early versions of winsocket's select only supported waiting for a maximum
		4471	of C<64> handles (probably owning to the fact that all windows kernels
		4472	can only wait for C<64> things at the same time internally; Microsoft
		4473	recommends spawning a chain of threads and wait for 63 handles and the
		4474	previous thread in each. Sounds great!).
		4475
		4476	Newer versions support more handles, but you need to define C<FD_SETSIZE>
		4477	to some high number (e.g. C<2048>) before compiling the winsocket select
		4478	call (which might be in libev or elsewhere, for example, perl and many
		4479	other interpreters do their own select emulation on windows).
		4480
		4481	Another limit is the number of file descriptors in the Microsoft runtime
		4482	libraries, which by default is C<64> (there must be a hidden I<64>
		4483	fetish or something like this inside Microsoft). You can increase this
		4484	by calling C<_setmaxstdio>, which can increase this limit to C<2048>
		4485	(another arbitrary limit), but is broken in many versions of the Microsoft
		4486	runtime libraries. This might get you to about C<512> or C<2048> sockets
		4487	(depending on windows version and/or the phase of the moon). To get more,
		4488	you need to wrap all I/O functions and provide your own fd management, but
		4489	the cost of calling select (O(n²)) will likely make this unworkable.
		4490
		4491	=back
		4492
		4493	=head2 PORTABILITY REQUIREMENTS
		4494
		4495	In addition to a working ISO-C implementation and of course the
		4496	backend-specific APIs, libev relies on a few additional extensions:
		4497
		4498	=over 4
		4499
		4500	=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
		4501	calling conventions regardless of C<ev_watcher_type *>.
		4502
		4503	Libev assumes not only that all watcher pointers have the same internal
		4504	structure (guaranteed by POSIX but not by ISO C for example), but it also
		4505	assumes that the same (machine) code can be used to call any watcher
		4506	callback: The watcher callbacks have different type signatures, but libev
		4507	calls them using an C<ev_watcher *> internally.
		4508
		4509	=item C<sig_atomic_t volatile> must be thread-atomic as well
		4510
		4511	The type C<sig_atomic_t volatile> (or whatever is defined as
		4512	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
		4513	threads. This is not part of the specification for C<sig_atomic_t>, but is
		4514	believed to be sufficiently portable.
		4515
		4516	=item C<sigprocmask> must work in a threaded environment
		4517
		4518	Libev uses C<sigprocmask> to temporarily block signals. This is not
		4519	allowed in a threaded program (C<pthread_sigmask> has to be used). Typical
		4520	pthread implementations will either allow C<sigprocmask> in the "main
		4521	thread" or will block signals process-wide, both behaviours would
		4522	be compatible with libev. Interaction between C<sigprocmask> and
		4523	C<pthread_sigmask> could complicate things, however.
		4524
		4525	The most portable way to handle signals is to block signals in all threads
		4526	except the initial one, and run the default loop in the initial thread as
		4527	well.
		4528
		4529	=item C<long> must be large enough for common memory allocation sizes
		4530
		4531	To improve portability and simplify its API, libev uses C<long> internally
		4532	instead of C<size_t> when allocating its data structures. On non-POSIX
		4533	systems (Microsoft...) this might be unexpectedly low, but is still at
		4534	least 31 bits everywhere, which is enough for hundreds of millions of
		4535	watchers.
		4536
		4537	=item C<double> must hold a time value in seconds with enough accuracy
		4538
		4539	The type C<double> is used to represent timestamps. It is required to
		4540	have at least 51 bits of mantissa (and 9 bits of exponent), which is good
		4541	enough for at least into the year 4000. This requirement is fulfilled by
		4542	implementations implementing IEEE 754, which is basically all existing
		4543	ones. With IEEE 754 doubles, you get microsecond accuracy until at least
		4544	2200.
		4545
		4546	=back
		4547
		4548	If you know of other additional requirements drop me a note.
		4549
		4550
2717	=head1 COMPLEXITIES	4551	=head1 ALGORITHMIC COMPLEXITIES
2718		4552
2719	In this section the complexities of (many of) the algorithms used inside	4553	In this section the complexities of (many of) the algorithms used inside
2720	libev will be explained. For complexity discussions about backends see the	4554	libev will be documented. For complexity discussions about backends see
2721	documentation for C<ev_default_init>.	4555	the documentation for C<ev_default_init>.
2722		4556
2723	All of the following are about amortised time: If an array needs to be	4557	All of the following are about amortised time: If an array needs to be
2724	extended, libev needs to realloc and move the whole array, but this	4558	extended, libev needs to realloc and move the whole array, but this
2725	happens asymptotically never with higher number of elements, so O(1) might	4559	happens asymptotically rarer with higher number of elements, so O(1) might
2726	mean it might do a lengthy realloc operation in rare cases, but on average	4560	mean that libev does a lengthy realloc operation in rare cases, but on
2727	it is much faster and asymptotically approaches constant time.	4561	average it is much faster and asymptotically approaches constant time.
2728		4562
2729	=over 4	4563	=over 4
2730		4564
2731	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)	4565	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2732		4566
2733	This means that, when you have a watcher that triggers in one hour and	4567	This means that, when you have a watcher that triggers in one hour and
2734	there are 100 watchers that would trigger before that then inserting will	4568	there are 100 watchers that would trigger before that, then inserting will
2735	have to skip roughly seven (C<ld 100>) of these watchers.	4569	have to skip roughly seven (C<ld 100>) of these watchers.
2736		4570
2737	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)	4571	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2738		4572
2739	That means that changing a timer costs less than removing/adding them	4573	That means that changing a timer costs less than removing/adding them,
2740	as only the relative motion in the event queue has to be paid for.	4574	as only the relative motion in the event queue has to be paid for.
2741		4575
2742	=item Starting io/check/prepare/idle/signal/child watchers: O(1)	4576	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2743		4577
2744	These just add the watcher into an array or at the head of a list.	4578	These just add the watcher into an array or at the head of a list.
2745		4579
2746	=item Stopping check/prepare/idle watchers: O(1)	4580	=item Stopping check/prepare/idle/fork/async watchers: O(1)
2747		4581
2748	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	4582	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2749		4583
2750	These watchers are stored in lists then need to be walked to find the	4584	These watchers are stored in lists, so they need to be walked to find the
2751	correct watcher to remove. The lists are usually short (you don't usually	4585	correct watcher to remove. The lists are usually short (you don't usually
2752	have many watchers waiting for the same fd or signal).	4586	have many watchers waiting for the same fd or signal: one is typical, two
		4587	is rare).
2753		4588
2754	=item Finding the next timer in each loop iteration: O(1)	4589	=item Finding the next timer in each loop iteration: O(1)
2755		4590
2756	By virtue of using a binary heap, the next timer is always found at the	4591	By virtue of using a binary or 4-heap, the next timer is always found at a
2757	beginning of the storage array.	4592	fixed position in the storage array.
2758		4593
2759	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)	4594	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2760		4595
2761	A change means an I/O watcher gets started or stopped, which requires	4596	A change means an I/O watcher gets started or stopped, which requires
2762	libev to recalculate its status (and possibly tell the kernel, depending	4597	libev to recalculate its status (and possibly tell the kernel, depending
2763	on backend and wether C<ev_io_set> was used).	4598	on backend and whether C<ev_io_set> was used).
2764		4599
2765	=item Activating one watcher (putting it into the pending state): O(1)	4600	=item Activating one watcher (putting it into the pending state): O(1)
2766		4601
2767	=item Priority handling: O(number_of_priorities)	4602	=item Priority handling: O(number_of_priorities)
2768		4603
2769	Priorities are implemented by allocating some space for each	4604	Priorities are implemented by allocating some space for each
2770	priority. When doing priority-based operations, libev usually has to	4605	priority. When doing priority-based operations, libev usually has to
2771	linearly search all the priorities, but starting/stopping and activating	4606	linearly search all the priorities, but starting/stopping and activating
2772	watchers becomes O(1) w.r.t. prioritiy handling.	4607	watchers becomes O(1) with respect to priority handling.
		4608
		4609	=item Sending an ev_async: O(1)
		4610
		4611	=item Processing ev_async_send: O(number_of_async_watchers)
		4612
		4613	=item Processing signals: O(max_signal_number)
		4614
		4615	Sending involves a system call I<iff> there were no other C<ev_async_send>
		4616	calls in the current loop iteration. Checking for async and signal events
		4617	involves iterating over all running async watchers or all signal numbers.
2773		4618
2774	=back	4619	=back
2775		4620
2776		4621
		4622	=head1 GLOSSARY
		4623
		4624	=over 4
		4625
		4626	=item active
		4627
		4628	A watcher is active as long as it has been started (has been attached to
		4629	an event loop) but not yet stopped (disassociated from the event loop).
		4630
		4631	=item application
		4632
		4633	In this document, an application is whatever is using libev.
		4634
		4635	=item callback
		4636
		4637	The address of a function that is called when some event has been
		4638	detected. Callbacks are being passed the event loop, the watcher that
		4639	received the event, and the actual event bitset.
		4640
		4641	=item callback invocation
		4642
		4643	The act of calling the callback associated with a watcher.
		4644
		4645	=item event
		4646
		4647	A change of state of some external event, such as data now being available
		4648	for reading on a file descriptor, time having passed or simply not having
		4649	any other events happening anymore.
		4650
		4651	In libev, events are represented as single bits (such as C<EV_READ> or
		4652	C<EV_TIMEOUT>).
		4653
		4654	=item event library
		4655
		4656	A software package implementing an event model and loop.
		4657
		4658	=item event loop
		4659
		4660	An entity that handles and processes external events and converts them
		4661	into callback invocations.
		4662
		4663	=item event model
		4664
		4665	The model used to describe how an event loop handles and processes
		4666	watchers and events.
		4667
		4668	=item pending
		4669
		4670	A watcher is pending as soon as the corresponding event has been detected,
		4671	and stops being pending as soon as the watcher will be invoked or its
		4672	pending status is explicitly cleared by the application.
		4673
		4674	A watcher can be pending, but not active. Stopping a watcher also clears
		4675	its pending status.
		4676
		4677	=item real time
		4678
		4679	The physical time that is observed. It is apparently strictly monotonic :)
		4680
		4681	=item wall-clock time
		4682
		4683	The time and date as shown on clocks. Unlike real time, it can actually
		4684	be wrong and jump forwards and backwards, e.g. when the you adjust your
		4685	clock.
		4686
		4687	=item watcher
		4688
		4689	A data structure that describes interest in certain events. Watchers need
		4690	to be started (attached to an event loop) before they can receive events.
		4691
		4692	=item watcher invocation
		4693
		4694	The act of calling the callback associated with a watcher.
		4695
		4696	=back
		4697
2777	=head1 AUTHOR	4698	=head1 AUTHOR
2778		4699
2779	Marc Lehmann <libev@schmorp.de>.	4700	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
2780		4701

Diff Legend

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