ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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