ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.166 by root, Tue Jun 3 03:48:10 2008 UTC vs.
Revision 1.443 by root, Thu Aug 30 21:51:15 2018 UTC

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

Diff Legend

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