ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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