ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.132 by root, Wed Feb 20 17:45:29 2008 UTC vs.
Revision 1.197 by root, Tue Oct 21 20:52:30 2008 UTC

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

Diff Legend

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