ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.137 by root, Sun Mar 16 16:42:56 2008 UTC vs.
Revision 1.325 by root, Sun Oct 24 19:44:08 2010 UTC

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

Diff Legend

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