ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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