ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.178 by root, Sat Sep 13 18:25:50 2008 UTC vs.
Revision 1.337 by root, Sun Oct 31 20:20:20 2010 UTC

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

Diff Legend

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