ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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