ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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