ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.80 by root, Sun Dec 9 19:47:30 2007 UTC vs.
Revision 1.369 by root, Mon May 30 18:34:28 2011 UTC

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

Diff Legend

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