ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.159 by root, Thu May 22 02:44:57 2008 UTC vs.
Revision 1.254 by root, Tue Jul 14 19:02:43 2009 UTC

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

Diff Legend

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