ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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