ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.144 by root, Mon Apr 7 12:33:29 2008 UTC vs.
Revision 1.195 by root, Mon Oct 20 17:50:48 2008 UTC

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

Diff Legend

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