ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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