ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.117 by root, Wed Jan 9 04:15:39 2008 UTC vs.
Revision 1.177 by root, Mon Sep 8 17:27:42 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
…		…
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))
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 (;;)
…		…
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));
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.
…		…
240	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	279	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
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
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		284
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
…		…
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
		301	The default loop is the only loop that can handle C<ev_signal> and
		302	C<ev_child> watchers, and to do this, it always registers a handler
		303	for C<SIGCHLD>. If this is a problem for your application you can either
		304	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
		305	can simply overwrite the C<SIGCHLD> signal handler I<after> calling
		306	C<ev_default_init>.
		307
265	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
266	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	309	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
267		310
268	The following flags are supported:	311	The following flags are supported:
269		312
…		…
274	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
275	thing, believe me).	318	thing, believe me).
276		319
277	=item C<EVFLAG_NOENV>	320	=item C<EVFLAG_NOENV>
278		321
279	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
280	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
281	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	324	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
282	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
283	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
284	around bugs.	327	around bugs.
…		…
290	enabling this flag.	333	enabling this flag.
291		334
292	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,
293	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
294	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
295	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
296	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
297	C<pthread_atfork> which is even faster).	340	C<pthread_atfork> which is even faster).
298		341
299	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
300	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
301	flag.	344	flag.
302		345
303	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>
304	environment variable.	347	environment variable.
305		348
306	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	349	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
307		350
308	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
…		…
310	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
311	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
312	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.
313		356
314	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
315	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
316	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
317	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
318	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
319	readyness notifications you get per iteration.	362	readiness notifications you get per iteration.
320		363
321	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)	364	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
322		365
323	And this is your standard poll(2) backend. It's more complicated	366	And this is your standard poll(2) backend. It's more complicated
324	than select, but handles sparse fds better and has no artificial	367	than select, but handles sparse fds better and has no artificial
…		…
332	For few fds, this backend is a bit little slower than poll and select,	375	For few fds, this backend is a bit little slower than poll and select,
333	but it scales phenomenally better. While poll and select usually scale	376	but it scales phenomenally better. While poll and select usually scale
334	like O(total_fds) where n is the total number of fds (or the highest fd),	377	like O(total_fds) where n is the total number of fds (or the highest fd),
335	epoll scales either O(1) or O(active_fds). The epoll design has a number	378	epoll scales either O(1) or O(active_fds). The epoll design has a number
336	of shortcomings, such as silently dropping events in some hard-to-detect	379	of shortcomings, such as silently dropping events in some hard-to-detect
337	cases and rewiring a syscall per fd change, no fork support and bad	380	cases and requiring a system call per fd change, no fork support and bad
338	support for dup.	381	support for dup.
339		382
340	While stopping, setting and starting an I/O watcher in the same iteration	383	While stopping, setting and starting an I/O watcher in the same iteration
341	will result in some caching, there is still a syscall per such incident	384	will result in some caching, there is still a system call per such incident
342	(because the fd could point to a different file description now), so its	385	(because the fd could point to a different file description now), so its
343	best to avoid that. Also, C<dup ()>'ed file descriptors might not work	386	best to avoid that. Also, C<dup ()>'ed file descriptors might not work
344	very well if you register events for both fds.	387	very well if you register events for both fds.
345		388
346	Please note that epoll sometimes generates spurious notifications, so you	389	Please note that epoll sometimes generates spurious notifications, so you
…		…
349		392
350	Best performance from this backend is achieved by not unregistering all	393	Best performance from this backend is achieved by not unregistering all
351	watchers for a file descriptor until it has been closed, if possible, i.e.	394	watchers for a file descriptor until it has been closed, if possible, i.e.
352	keep at least one watcher active per fd at all times.	395	keep at least one watcher active per fd at all times.
353		396
354	While nominally embeddeble in other event loops, this feature is broken in	397	While nominally embeddable in other event loops, this feature is broken in
355	all kernel versions tested so far.	398	all kernel versions tested so far.
356		399
357	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	400	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
358		401
359	Kqueue deserves special mention, as at the time of this writing, it	402	Kqueue deserves special mention, as at the time of this writing, it
360	was broken on all BSDs except NetBSD (usually it doesn't work reliably	403	was broken on all BSDs except NetBSD (usually it doesn't work reliably
361	with anything but sockets and pipes, except on Darwin, where of course	404	with anything but sockets and pipes, except on Darwin, where of course
362	it's completely useless). For this reason it's not being "autodetected"	405	it's completely useless). For this reason it's not being "auto-detected"
363	unless you explicitly specify it explicitly in the flags (i.e. using	406	unless you explicitly specify it explicitly in the flags (i.e. using
364	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)	407	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
365	system like NetBSD.	408	system like NetBSD.
366		409
367	You still can embed kqueue into a normal poll or select backend and use it	410	You still can embed kqueue into a normal poll or select backend and use it
…		…
369	the target platform). See C<ev_embed> watchers for more info.	412	the target platform). See C<ev_embed> watchers for more info.
370		413
371	It scales in the same way as the epoll backend, but the interface to the	414	It scales in the same way as the epoll backend, but the interface to the
372	kernel is more efficient (which says nothing about its actual speed, of	415	kernel is more efficient (which says nothing about its actual speed, of
373	course). While stopping, setting and starting an I/O watcher does never	416	course). While stopping, setting and starting an I/O watcher does never
374	cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to	417	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
375	two event changes per incident, support for C<fork ()> is very bad and it	418	two event changes per incident, support for C<fork ()> is very bad and it
376	drops fds silently in similarly hard-to-detect cases.	419	drops fds silently in similarly hard-to-detect cases.
377		420
378	This backend usually performs well under most conditions.	421	This backend usually performs well under most conditions.
379		422
…		…
394	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	437	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
395		438
396	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	439	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
397	it's really slow, but it still scales very well (O(active_fds)).	440	it's really slow, but it still scales very well (O(active_fds)).
398		441
399	Please note that solaris event ports can deliver a lot of spurious	442	Please note that Solaris event ports can deliver a lot of spurious
400	notifications, so you need to use non-blocking I/O or other means to avoid	443	notifications, so you need to use non-blocking I/O or other means to avoid
401	blocking when no data (or space) is available.	444	blocking when no data (or space) is available.
402		445
403	While this backend scales well, it requires one system call per active	446	While this backend scales well, it requires one system call per active
404	file descriptor per loop iteration. For small and medium numbers of file	447	file descriptor per loop iteration. For small and medium numbers of file
405	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	448	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
406	might perform better.	449	might perform better.
407		450
408	On the positive side, ignoring the spurious readyness notifications, this	451	On the positive side, ignoring the spurious readiness notifications, this
409	backend actually performed to specification in all tests and is fully	452	backend actually performed to specification in all tests and is fully
410	embeddable, which is a rare feat among the OS-specific backends.	453	embeddable, which is a rare feat among the OS-specific backends.
411		454
412	=item C<EVBACKEND_ALL>	455	=item C<EVBACKEND_ALL>
413		456
…		…
417		460
418	It is definitely not recommended to use this flag.	461	It is definitely not recommended to use this flag.
419		462
420	=back	463	=back
421		464
422	If one or more of these are ored into the flags value, then only these	465	If one or more of these are or'ed into the flags value, then only these
423	backends will be tried (in the reverse order as listed here). If none are	466	backends will be tried (in the reverse order as listed here). If none are
424	specified, all backends in C<ev_recommended_backends ()> will be tried.	467	specified, all backends in C<ev_recommended_backends ()> will be tried.
425		468
426	The most typical usage is like this:	469	The most typical usage is like this:
427		470
428	if (!ev_default_loop (0))	471	if (!ev_default_loop (0))
429	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	472	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
430		473
431	Restrict libev to the select and poll backends, and do not allow	474	Restrict libev to the select and poll backends, and do not allow
432	environment settings to be taken into account:	475	environment settings to be taken into account:
433		476
434	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);	477	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
435		478
436	Use whatever libev has to offer, but make sure that kqueue is used if	479	Use whatever libev has to offer, but make sure that kqueue is used if
437	available (warning, breaks stuff, best use only with your own private	480	available (warning, breaks stuff, best use only with your own private
438	event loop and only if you know the OS supports your types of fds):	481	event loop and only if you know the OS supports your types of fds):
439		482
440	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);	483	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
441		484
442	=item struct ev_loop *ev_loop_new (unsigned int flags)	485	=item struct ev_loop *ev_loop_new (unsigned int flags)
443		486
444	Similar to C<ev_default_loop>, but always creates a new event loop that is	487	Similar to C<ev_default_loop>, but always creates a new event loop that is
445	always distinct from the default loop. Unlike the default loop, it cannot	488	always distinct from the default loop. Unlike the default loop, it cannot
446	handle signal and child watchers, and attempts to do so will be greeted by	489	handle signal and child watchers, and attempts to do so will be greeted by
447	undefined behaviour (or a failed assertion if assertions are enabled).	490	undefined behaviour (or a failed assertion if assertions are enabled).
448		491
		492	Note that this function I<is> thread-safe, and the recommended way to use
		493	libev with threads is indeed to create one loop per thread, and using the
		494	default loop in the "main" or "initial" thread.
		495
449	Example: Try to create a event loop that uses epoll and nothing else.	496	Example: Try to create a event loop that uses epoll and nothing else.
450		497
451	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	498	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
452	if (!epoller)	499	if (!epoller)
453	fatal ("no epoll found here, maybe it hides under your chair");	500	fatal ("no epoll found here, maybe it hides under your chair");
454		501
455	=item ev_default_destroy ()	502	=item ev_default_destroy ()
456		503
457	Destroys the default loop again (frees all memory and kernel state	504	Destroys the default loop again (frees all memory and kernel state
458	etc.). None of the active event watchers will be stopped in the normal	505	etc.). None of the active event watchers will be stopped in the normal
459	sense, so e.g. C<ev_is_active> might still return true. It is your	506	sense, so e.g. C<ev_is_active> might still return true. It is your
460	responsibility to either stop all watchers cleanly yoursef I<before>	507	responsibility to either stop all watchers cleanly yourself I<before>
461	calling this function, or cope with the fact afterwards (which is usually	508	calling this function, or cope with the fact afterwards (which is usually
462	the easiest thing, you can just ignore the watchers and/or C<free ()> them	509	the easiest thing, you can just ignore the watchers and/or C<free ()> them
463	for example).	510	for example).
464		511
465	Note that certain global state, such as signal state, will not be freed by	512	Note that certain global state, such as signal state, will not be freed by
…		…
476	Like C<ev_default_destroy>, but destroys an event loop created by an	523	Like C<ev_default_destroy>, but destroys an event loop created by an
477	earlier call to C<ev_loop_new>.	524	earlier call to C<ev_loop_new>.
478		525
479	=item ev_default_fork ()	526	=item ev_default_fork ()
480		527
		528	This function sets a flag that causes subsequent C<ev_loop> iterations
481	This function reinitialises the kernel state for backends that have	529	to reinitialise the kernel state for backends that have one. Despite the
482	one. Despite the name, you can call it anytime, but it makes most sense	530	name, you can call it anytime, but it makes most sense after forking, in
483	after forking, in either the parent or child process (or both, but that	531	the child process (or both child and parent, but that again makes little
484	again makes little sense).	532	sense). You I<must> call it in the child before using any of the libev
		533	functions, and it will only take effect at the next C<ev_loop> iteration.
485		534
486	You I<must> call this function in the child process after forking if and	535	On the other hand, you only need to call this function in the child
487	only if you want to use the event library in both processes. If you just	536	process if and only if you want to use the event library in the child. If
488	fork+exec, you don't have to call it.	537	you just fork+exec, you don't have to call it at all.
489		538
490	The function itself is quite fast and it's usually not a problem to call	539	The function itself is quite fast and it's usually not a problem to call
491	it just in case after a fork. To make this easy, the function will fit in	540	it just in case after a fork. To make this easy, the function will fit in
492	quite nicely into a call to C<pthread_atfork>:	541	quite nicely into a call to C<pthread_atfork>:
493		542
494	pthread_atfork (0, 0, ev_default_fork);	543	pthread_atfork (0, 0, ev_default_fork);
495		544
496	At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
497	without calling this function, so if you force one of those backends you
498	do not need to care.
499
500	=item ev_loop_fork (loop)	545	=item ev_loop_fork (loop)
501		546
502	Like C<ev_default_fork>, but acts on an event loop created by	547	Like C<ev_default_fork>, but acts on an event loop created by
503	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	548	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
504	after fork, and how you do this is entirely your own problem.	549	after fork, and how you do this is entirely your own problem.
		550
		551	=item int ev_is_default_loop (loop)
		552
		553	Returns true when the given loop actually is the default loop, false otherwise.
505		554
506	=item unsigned int ev_loop_count (loop)	555	=item unsigned int ev_loop_count (loop)
507		556
508	Returns the count of loop iterations for the loop, which is identical to	557	Returns the count of loop iterations for the loop, which is identical to
509	the number of times libev did poll for new events. It starts at C<0> and	558	the number of times libev did poll for new events. It starts at C<0> and
…		…
524	received events and started processing them. This timestamp does not	573	received events and started processing them. This timestamp does not
525	change as long as callbacks are being processed, and this is also the base	574	change as long as callbacks are being processed, and this is also the base
526	time used for relative timers. You can treat it as the timestamp of the	575	time used for relative timers. You can treat it as the timestamp of the
527	event occurring (or more correctly, libev finding out about it).	576	event occurring (or more correctly, libev finding out about it).
528		577
		578	=item ev_now_update (loop)
		579
		580	Establishes the current time by querying the kernel, updating the time
		581	returned by C<ev_now ()> in the progress. This is a costly operation and
		582	is usually done automatically within C<ev_loop ()>.
		583
		584	This function is rarely useful, but when some event callback runs for a
		585	very long time without entering the event loop, updating libev's idea of
		586	the current time is a good idea.
		587
		588	See also "The special problem of time updates" in the C<ev_timer> section.
		589
529	=item ev_loop (loop, int flags)	590	=item ev_loop (loop, int flags)
530		591
531	Finally, this is it, the event handler. This function usually is called	592	Finally, this is it, the event handler. This function usually is called
532	after you initialised all your watchers and you want to start handling	593	after you initialised all your watchers and you want to start handling
533	events.	594	events.
…		…
544	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	605	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
545	those events and any outstanding ones, but will not block your process in	606	those events and any outstanding ones, but will not block your process in
546	case there are no events and will return after one iteration of the loop.	607	case there are no events and will return after one iteration of the loop.
547		608
548	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	609	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
549	neccessary) and will handle those and any outstanding ones. It will block	610	necessary) and will handle those and any outstanding ones. It will block
550	your process until at least one new event arrives, and will return after	611	your process until at least one new event arrives, and will return after
551	one iteration of the loop. This is useful if you are waiting for some	612	one iteration of the loop. This is useful if you are waiting for some
552	external event in conjunction with something not expressible using other	613	external event in conjunction with something not expressible using other
553	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	614	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
554	usually a better approach for this kind of thing.	615	usually a better approach for this kind of thing.
555		616
556	Here are the gory details of what C<ev_loop> does:	617	Here are the gory details of what C<ev_loop> does:
557		618
558	- Before the first iteration, call any pending watchers.	619	- Before the first iteration, call any pending watchers.
559	* If EVFLAG_FORKCHECK was used, check for a fork.	620	* If EVFLAG_FORKCHECK was used, check for a fork.
560	- If a fork was detected, queue and call all fork watchers.	621	- If a fork was detected (by any means), queue and call all fork watchers.
561	- Queue and call all prepare watchers.	622	- Queue and call all prepare watchers.
562	- If we have been forked, recreate the kernel state.	623	- If we have been forked, detach and recreate the kernel state
		624	as to not disturb the other process.
563	- Update the kernel state with all outstanding changes.	625	- Update the kernel state with all outstanding changes.
564	- Update the "event loop time".	626	- Update the "event loop time" (ev_now ()).
565	- Calculate for how long to sleep or block, if at all	627	- Calculate for how long to sleep or block, if at all
566	(active idle watchers, EVLOOP_NONBLOCK or not having	628	(active idle watchers, EVLOOP_NONBLOCK or not having
567	any active watchers at all will result in not sleeping).	629	any active watchers at all will result in not sleeping).
568	- Sleep if the I/O and timer collect interval say so.	630	- Sleep if the I/O and timer collect interval say so.
569	- Block the process, waiting for any events.	631	- Block the process, waiting for any events.
570	- Queue all outstanding I/O (fd) events.	632	- Queue all outstanding I/O (fd) events.
571	- Update the "event loop time" and do time jump handling.	633	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
572	- Queue all outstanding timers.	634	- Queue all outstanding timers.
573	- Queue all outstanding periodics.	635	- Queue all outstanding periodics.
574	- If no events are pending now, queue all idle watchers.	636	- Unless any events are pending now, queue all idle watchers.
575	- Queue all check watchers.	637	- Queue all check watchers.
576	- Call all queued watchers in reverse order (i.e. check watchers first).	638	- Call all queued watchers in reverse order (i.e. check watchers first).
577	Signals and child watchers are implemented as I/O watchers, and will	639	Signals and child watchers are implemented as I/O watchers, and will
578	be handled here by queueing them when their watcher gets executed.	640	be handled here by queueing them when their watcher gets executed.
579	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	641	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
…		…
584	anymore.	646	anymore.
585		647
586	... queue jobs here, make sure they register event watchers as long	648	... queue jobs here, make sure they register event watchers as long
587	... as they still have work to do (even an idle watcher will do..)	649	... as they still have work to do (even an idle watcher will do..)
588	ev_loop (my_loop, 0);	650	ev_loop (my_loop, 0);
589	... jobs done. yeah!	651	... jobs done or somebody called unloop. yeah!
590		652
591	=item ev_unloop (loop, how)	653	=item ev_unloop (loop, how)
592		654
593	Can be used to make a call to C<ev_loop> return early (but only after it	655	Can be used to make a call to C<ev_loop> return early (but only after it
594	has processed all outstanding events). The C<how> argument must be either	656	has processed all outstanding events). The C<how> argument must be either
…		…
615	respectively).	677	respectively).
616		678
617	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	679	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
618	running when nothing else is active.	680	running when nothing else is active.
619		681
620	struct ev_signal exitsig;	682	struct ev_signal exitsig;
621	ev_signal_init (&exitsig, sig_cb, SIGINT);	683	ev_signal_init (&exitsig, sig_cb, SIGINT);
622	ev_signal_start (loop, &exitsig);	684	ev_signal_start (loop, &exitsig);
623	evf_unref (loop);	685	evf_unref (loop);
624		686
625	Example: For some weird reason, unregister the above signal handler again.	687	Example: For some weird reason, unregister the above signal handler again.
626		688
627	ev_ref (loop);	689	ev_ref (loop);
628	ev_signal_stop (loop, &exitsig);	690	ev_signal_stop (loop, &exitsig);
629		691
630	=item ev_set_io_collect_interval (loop, ev_tstamp interval)	692	=item ev_set_io_collect_interval (loop, ev_tstamp interval)
631		693
632	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)	694	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
633		695
634	These advanced functions influence the time that libev will spend waiting	696	These advanced functions influence the time that libev will spend waiting
635	for events. Both are by default C<0>, meaning that libev will try to	697	for events. Both time intervals are by default C<0>, meaning that libev
636	invoke timer/periodic callbacks and I/O callbacks with minimum latency.	698	will try to invoke timer/periodic callbacks and I/O callbacks with minimum
		699	latency.
637		700
638	Setting these to a higher value (the C<interval> I<must> be >= C<0>)	701	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
639	allows libev to delay invocation of I/O and timer/periodic callbacks to	702	allows libev to delay invocation of I/O and timer/periodic callbacks
640	increase efficiency of loop iterations.	703	to increase efficiency of loop iterations (or to increase power-saving
		704	opportunities).
641		705
642	The background is that sometimes your program runs just fast enough to	706	The background is that sometimes your program runs just fast enough to
643	handle one (or very few) event(s) per loop iteration. While this makes	707	handle one (or very few) event(s) per loop iteration. While this makes
644	the program responsive, it also wastes a lot of CPU time to poll for new	708	the program responsive, it also wastes a lot of CPU time to poll for new
645	events, especially with backends like C<select ()> which have a high	709	events, especially with backends like C<select ()> which have a high
…		…
655	to spend more time collecting timeouts, at the expense of increased	719	to spend more time collecting timeouts, at the expense of increased
656	latency (the watcher callback will be called later). C<ev_io> watchers	720	latency (the watcher callback will be called later). C<ev_io> watchers
657	will not be affected. Setting this to a non-null value will not introduce	721	will not be affected. Setting this to a non-null value will not introduce
658	any overhead in libev.	722	any overhead in libev.
659		723
660	Many (busy) programs can usually benefit by setting the io collect	724	Many (busy) programs can usually benefit by setting the I/O collect
661	interval to a value near C<0.1> or so, which is often enough for	725	interval to a value near C<0.1> or so, which is often enough for
662	interactive servers (of course not for games), likewise for timeouts. It	726	interactive servers (of course not for games), likewise for timeouts. It
663	usually doesn't make much sense to set it to a lower value than C<0.01>,	727	usually doesn't make much sense to set it to a lower value than C<0.01>,
664	as this approsaches the timing granularity of most systems.	728	as this approaches the timing granularity of most systems.
		729
		730	Setting the I<timeout collect interval> can improve the opportunity for
		731	saving power, as the program will "bundle" timer callback invocations that
		732	are "near" in time together, by delaying some, thus reducing the number of
		733	times the process sleeps and wakes up again. Another useful technique to
		734	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
		735	they fire on, say, one-second boundaries only.
		736
		737	=item ev_loop_verify (loop)
		738
		739	This function only does something when C<EV_VERIFY> support has been
		740	compiled in. It tries to go through all internal structures and checks
		741	them for validity. If anything is found to be inconsistent, it will print
		742	an error message to standard error and call C<abort ()>.
		743
		744	This can be used to catch bugs inside libev itself: under normal
		745	circumstances, this function will never abort as of course libev keeps its
		746	data structures consistent.
665		747
666	=back	748	=back
667		749
668		750
669	=head1 ANATOMY OF A WATCHER	751	=head1 ANATOMY OF A WATCHER
670		752
671	A watcher is a structure that you create and register to record your	753	A watcher is a structure that you create and register to record your
672	interest in some event. For instance, if you want to wait for STDIN to	754	interest in some event. For instance, if you want to wait for STDIN to
673	become readable, you would create an C<ev_io> watcher for that:	755	become readable, you would create an C<ev_io> watcher for that:
674		756
675	static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)	757	static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
676	{	758	{
677	ev_io_stop (w);	759	ev_io_stop (w);
678	ev_unloop (loop, EVUNLOOP_ALL);	760	ev_unloop (loop, EVUNLOOP_ALL);
679	}	761	}
680		762
681	struct ev_loop *loop = ev_default_loop (0);	763	struct ev_loop *loop = ev_default_loop (0);
682	struct ev_io stdin_watcher;	764	struct ev_io stdin_watcher;
683	ev_init (&stdin_watcher, my_cb);	765	ev_init (&stdin_watcher, my_cb);
684	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	766	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
685	ev_io_start (loop, &stdin_watcher);	767	ev_io_start (loop, &stdin_watcher);
686	ev_loop (loop, 0);	768	ev_loop (loop, 0);
687		769
688	As you can see, you are responsible for allocating the memory for your	770	As you can see, you are responsible for allocating the memory for your
689	watcher structures (and it is usually a bad idea to do this on the stack,	771	watcher structures (and it is usually a bad idea to do this on the stack,
690	although this can sometimes be quite valid).	772	although this can sometimes be quite valid).
691		773
692	Each watcher structure must be initialised by a call to C<ev_init	774	Each watcher structure must be initialised by a call to C<ev_init
693	(watcher *, callback)>, which expects a callback to be provided. This	775	(watcher *, callback)>, which expects a callback to be provided. This
694	callback gets invoked each time the event occurs (or, in the case of io	776	callback gets invoked each time the event occurs (or, in the case of I/O
695	watchers, each time the event loop detects that the file descriptor given	777	watchers, each time the event loop detects that the file descriptor given
696	is readable and/or writable).	778	is readable and/or writable).
697		779
698	Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro	780	Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
699	with arguments specific to this watcher type. There is also a macro	781	with arguments specific to this watcher type. There is also a macro
…		…
769	=item C<EV_FORK>	851	=item C<EV_FORK>
770		852
771	The event loop has been resumed in the child process after fork (see	853	The event loop has been resumed in the child process after fork (see
772	C<ev_fork>).	854	C<ev_fork>).
773		855
		856	=item C<EV_ASYNC>
		857
		858	The given async watcher has been asynchronously notified (see C<ev_async>).
		859
774	=item C<EV_ERROR>	860	=item C<EV_ERROR>
775		861
776	An unspecified error has occured, the watcher has been stopped. This might	862	An unspecified error has occurred, the watcher has been stopped. This might
777	happen because the watcher could not be properly started because libev	863	happen because the watcher could not be properly started because libev
778	ran out of memory, a file descriptor was found to be closed or any other	864	ran out of memory, a file descriptor was found to be closed or any other
779	problem. You best act on it by reporting the problem and somehow coping	865	problem. You best act on it by reporting the problem and somehow coping
780	with the watcher being stopped.	866	with the watcher being stopped.
781		867
782	Libev will usually signal a few "dummy" events together with an error,	868	Libev will usually signal a few "dummy" events together with an error,
783	for example it might indicate that a fd is readable or writable, and if	869	for example it might indicate that a fd is readable or writable, and if
784	your callbacks is well-written it can just attempt the operation and cope	870	your callbacks is well-written it can just attempt the operation and cope
785	with the error from read() or write(). This will not work in multithreaded	871	with the error from read() or write(). This will not work in multi-threaded
786	programs, though, so beware.	872	programs, though, so beware.
787		873
788	=back	874	=back
789		875
790	=head2 GENERIC WATCHER FUNCTIONS	876	=head2 GENERIC WATCHER FUNCTIONS
…		…
820	Although some watcher types do not have type-specific arguments	906	Although some watcher types do not have type-specific arguments
821	(e.g. C<ev_prepare>) you still need to call its C<set> macro.	907	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
822		908
823	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])	909	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
824		910
825	This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro	911	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
826	calls into a single call. This is the most convinient method to initialise	912	calls into a single call. This is the most convenient method to initialise
827	a watcher. The same limitations apply, of course.	913	a watcher. The same limitations apply, of course.
828		914
829	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)	915	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
830		916
831	Starts (activates) the given watcher. Only active watchers will receive	917	Starts (activates) the given watcher. Only active watchers will receive
…		…
914	to associate arbitrary data with your watcher. If you need more data and	1000	to associate arbitrary data with your watcher. If you need more data and
915	don't want to allocate memory and store a pointer to it in that data	1001	don't want to allocate memory and store a pointer to it in that data
916	member, you can also "subclass" the watcher type and provide your own	1002	member, you can also "subclass" the watcher type and provide your own
917	data:	1003	data:
918		1004
919	struct my_io	1005	struct my_io
920	{	1006	{
921	struct ev_io io;	1007	struct ev_io io;
922	int otherfd;	1008	int otherfd;
923	void *somedata;	1009	void *somedata;
924	struct whatever *mostinteresting;	1010	struct whatever *mostinteresting;
925	}	1011	}
926		1012
927	And since your callback will be called with a pointer to the watcher, you	1013	And since your callback will be called with a pointer to the watcher, you
928	can cast it back to your own type:	1014	can cast it back to your own type:
929		1015
930	static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)	1016	static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
931	{	1017	{
932	struct my_io *w = (struct my_io *)w_;	1018	struct my_io *w = (struct my_io *)w_;
933	...	1019	...
934	}	1020	}
935		1021
936	More interesting and less C-conformant ways of casting your callback type	1022	More interesting and less C-conformant ways of casting your callback type
937	instead have been omitted.	1023	instead have been omitted.
938		1024
939	Another common scenario is having some data structure with multiple	1025	Another common scenario is having some data structure with multiple
940	watchers:	1026	watchers:
941		1027
942	struct my_biggy	1028	struct my_biggy
943	{	1029	{
944	int some_data;	1030	int some_data;
945	ev_timer t1;	1031	ev_timer t1;
946	ev_timer t2;	1032	ev_timer t2;
947	}	1033	}
948		1034
949	In this case getting the pointer to C<my_biggy> is a bit more complicated,	1035	In this case getting the pointer to C<my_biggy> is a bit more complicated,
950	you need to use C<offsetof>:	1036	you need to use C<offsetof>:
951		1037
952	#include <stddef.h>	1038	#include <stddef.h>
953		1039
954	static void	1040	static void
955	t1_cb (EV_P_ struct ev_timer *w, int revents)	1041	t1_cb (EV_P_ struct ev_timer *w, int revents)
956	{	1042	{
957	struct my_biggy big = (struct my_biggy *	1043	struct my_biggy big = (struct my_biggy *
958	(((char *)w) - offsetof (struct my_biggy, t1));	1044	(((char *)w) - offsetof (struct my_biggy, t1));
959	}	1045	}
960		1046
961	static void	1047	static void
962	t2_cb (EV_P_ struct ev_timer *w, int revents)	1048	t2_cb (EV_P_ struct ev_timer *w, int revents)
963	{	1049	{
964	struct my_biggy big = (struct my_biggy *	1050	struct my_biggy big = (struct my_biggy *
965	(((char *)w) - offsetof (struct my_biggy, t2));	1051	(((char *)w) - offsetof (struct my_biggy, t2));
966	}	1052	}
967		1053
968		1054
969	=head1 WATCHER TYPES	1055	=head1 WATCHER TYPES
970		1056
971	This section describes each watcher in detail, but will not repeat	1057	This section describes each watcher in detail, but will not repeat
…		…
1000	If you must do this, then force the use of a known-to-be-good backend	1086	If you must do this, then force the use of a known-to-be-good backend
1001	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and	1087	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
1002	C<EVBACKEND_POLL>).	1088	C<EVBACKEND_POLL>).
1003		1089
1004	Another thing you have to watch out for is that it is quite easy to	1090	Another thing you have to watch out for is that it is quite easy to
1005	receive "spurious" readyness notifications, that is your callback might	1091	receive "spurious" readiness notifications, that is your callback might
1006	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1092	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1007	because there is no data. Not only are some backends known to create a	1093	because there is no data. Not only are some backends known to create a
1008	lot of those (for example solaris ports), it is very easy to get into	1094	lot of those (for example Solaris ports), it is very easy to get into
1009	this situation even with a relatively standard program structure. Thus	1095	this situation even with a relatively standard program structure. Thus
1010	it is best to always use non-blocking I/O: An extra C<read>(2) returning	1096	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1011	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1097	C<EAGAIN> is far preferable to a program hanging until some data arrives.
1012		1098
1013	If you cannot run the fd in non-blocking mode (for example you should not	1099	If you cannot run the fd in non-blocking mode (for example you should not
1014	play around with an Xlib connection), then you have to seperately re-test	1100	play around with an Xlib connection), then you have to separately re-test
1015	whether a file descriptor is really ready with a known-to-be good interface	1101	whether a file descriptor is really ready with a known-to-be good interface
1016	such as poll (fortunately in our Xlib example, Xlib already does this on	1102	such as poll (fortunately in our Xlib example, Xlib already does this on
1017	its own, so its quite safe to use).	1103	its own, so its quite safe to use).
1018		1104
1019	=head3 The special problem of disappearing file descriptors	1105	=head3 The special problem of disappearing file descriptors
…		…
1057	To support fork in your programs, you either have to call	1143	To support fork in your programs, you either have to call
1058	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1144	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1059	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1145	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1060	C<EVBACKEND_POLL>.	1146	C<EVBACKEND_POLL>.
1061		1147
		1148	=head3 The special problem of SIGPIPE
		1149
		1150	While not really specific to libev, it is easy to forget about SIGPIPE:
		1151	when writing to a pipe whose other end has been closed, your program gets
		1152	send a SIGPIPE, which, by default, aborts your program. For most programs
		1153	this is sensible behaviour, for daemons, this is usually undesirable.
		1154
		1155	So when you encounter spurious, unexplained daemon exits, make sure you
		1156	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
		1157	somewhere, as that would have given you a big clue).
		1158
1062		1159
1063	=head3 Watcher-Specific Functions	1160	=head3 Watcher-Specific Functions
1064		1161
1065	=over 4	1162	=over 4
1066		1163
1067	=item ev_io_init (ev_io *, callback, int fd, int events)	1164	=item ev_io_init (ev_io *, callback, int fd, int events)
1068		1165
1069	=item ev_io_set (ev_io *, int fd, int events)	1166	=item ev_io_set (ev_io *, int fd, int events)
1070		1167
1071	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to	1168	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1072	rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or	1169	receive events for and events is either C<EV_READ>, C<EV_WRITE> or
1073	C<EV_READ | EV_WRITE> to receive the given events.	1170	C<EV_READ | EV_WRITE> to receive the given events.
1074		1171
1075	=item int fd [read-only]	1172	=item int fd [read-only]
1076		1173
1077	The file descriptor being watched.	1174	The file descriptor being watched.
…		…
1086		1183
1087	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well	1184	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1088	readable, but only once. Since it is likely line-buffered, you could	1185	readable, but only once. Since it is likely line-buffered, you could
1089	attempt to read a whole line in the callback.	1186	attempt to read a whole line in the callback.
1090		1187
1091	static void	1188	static void
1092	stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)	1189	stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1093	{	1190	{
1094	ev_io_stop (loop, w);	1191	ev_io_stop (loop, w);
1095	.. read from stdin here (or from w->fd) and haqndle any I/O errors	1192	.. read from stdin here (or from w->fd) and haqndle any I/O errors
1096	}	1193	}
1097		1194
1098	...	1195	...
1099	struct ev_loop *loop = ev_default_init (0);	1196	struct ev_loop *loop = ev_default_init (0);
1100	struct ev_io stdin_readable;	1197	struct ev_io stdin_readable;
1101	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1198	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1102	ev_io_start (loop, &stdin_readable);	1199	ev_io_start (loop, &stdin_readable);
1103	ev_loop (loop, 0);	1200	ev_loop (loop, 0);
1104		1201
1105		1202
1106	=head2 C<ev_timer> - relative and optionally repeating timeouts	1203	=head2 C<ev_timer> - relative and optionally repeating timeouts
1107		1204
1108	Timer watchers are simple relative timers that generate an event after a	1205	Timer watchers are simple relative timers that generate an event after a
1109	given time, and optionally repeating in regular intervals after that.	1206	given time, and optionally repeating in regular intervals after that.
1110		1207
1111	The timers are based on real time, that is, if you register an event that	1208	The timers are based on real time, that is, if you register an event that
1112	times out after an hour and you reset your system clock to last years	1209	times out after an hour and you reset your system clock to January last
1113	time, it will still time out after (roughly) and hour. "Roughly" because	1210	year, it will still time out after (roughly) and hour. "Roughly" because
1114	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1211	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1115	monotonic clock option helps a lot here).	1212	monotonic clock option helps a lot here).
		1213
		1214	The callback is guaranteed to be invoked only after its timeout has passed,
		1215	but if multiple timers become ready during the same loop iteration then
		1216	order of execution is undefined.
		1217
		1218	=head3 The special problem of time updates
		1219
		1220	Establishing the current time is a costly operation (it usually takes at
		1221	least two system calls): EV therefore updates its idea of the current
		1222	time only before and after C<ev_loop> polls for new events, which causes
		1223	a growing difference between C<ev_now ()> and C<ev_time ()> when handling
		1224	lots of events.
1116		1225
1117	The relative timeouts are calculated relative to the C<ev_now ()>	1226	The relative timeouts are calculated relative to the C<ev_now ()>
1118	time. This is usually the right thing as this timestamp refers to the time	1227	time. This is usually the right thing as this timestamp refers to the time
1119	of the event triggering whatever timeout you are modifying/starting. If	1228	of the event triggering whatever timeout you are modifying/starting. If
1120	you suspect event processing to be delayed and you I<need> to base the timeout	1229	you suspect event processing to be delayed and you I<need> to base the
1121	on the current time, use something like this to adjust for this:	1230	timeout on the current time, use something like this to adjust for this:
1122		1231
1123	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	1232	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1124		1233
1125	The callback is guarenteed to be invoked only when its timeout has passed,	1234	If the event loop is suspended for a long time, you can also force an
1126	but if multiple timers become ready during the same loop iteration then	1235	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1127	order of execution is undefined.	1236	()>.
1128		1237
1129	=head3 Watcher-Specific Functions and Data Members	1238	=head3 Watcher-Specific Functions and Data Members
1130		1239
1131	=over 4	1240	=over 4
1132		1241
1133	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1242	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1134		1243
1135	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	1244	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1136		1245
1137	Configure the timer to trigger after C<after> seconds. If C<repeat> is	1246	Configure the timer to trigger after C<after> seconds. If C<repeat>
1138	C<0.>, then it will automatically be stopped. If it is positive, then the	1247	is C<0.>, then it will automatically be stopped once the timeout is
1139	timer will automatically be configured to trigger again C<repeat> seconds	1248	reached. If it is positive, then the timer will automatically be
1140	later, again, and again, until stopped manually.	1249	configured to trigger again C<repeat> seconds later, again, and again,
		1250	until stopped manually.
1141		1251
1142	The timer itself will do a best-effort at avoiding drift, that is, if you	1252	The timer itself will do a best-effort at avoiding drift, that is, if
1143	configure a timer to trigger every 10 seconds, then it will trigger at	1253	you configure a timer to trigger every 10 seconds, then it will normally
1144	exactly 10 second intervals. If, however, your program cannot keep up with	1254	trigger at exactly 10 second intervals. If, however, your program cannot
1145	the timer (because it takes longer than those 10 seconds to do stuff) the	1255	keep up with the timer (because it takes longer than those 10 seconds to
1146	timer will not fire more than once per event loop iteration.	1256	do stuff) the timer will not fire more than once per event loop iteration.
1147		1257
1148	=item ev_timer_again (loop)	1258	=item ev_timer_again (loop, ev_timer *)
1149		1259
1150	This will act as if the timer timed out and restart it again if it is	1260	This will act as if the timer timed out and restart it again if it is
1151	repeating. The exact semantics are:	1261	repeating. The exact semantics are:
1152		1262
1153	If the timer is pending, its pending status is cleared.	1263	If the timer is pending, its pending status is cleared.
1154		1264
1155	If the timer is started but nonrepeating, stop it (as if it timed out).	1265	If the timer is started but non-repeating, stop it (as if it timed out).
1156		1266
1157	If the timer is repeating, either start it if necessary (with the	1267	If the timer is repeating, either start it if necessary (with the
1158	C<repeat> value), or reset the running timer to the C<repeat> value.	1268	C<repeat> value), or reset the running timer to the C<repeat> value.
1159		1269
1160	This sounds a bit complicated, but here is a useful and typical	1270	This sounds a bit complicated, but here is a useful and typical
1161	example: Imagine you have a tcp connection and you want a so-called idle	1271	example: Imagine you have a TCP connection and you want a so-called idle
1162	timeout, that is, you want to be called when there have been, say, 60	1272	timeout, that is, you want to be called when there have been, say, 60
1163	seconds of inactivity on the socket. The easiest way to do this is to	1273	seconds of inactivity on the socket. The easiest way to do this is to
1164	configure an C<ev_timer> with a C<repeat> value of C<60> and then call	1274	configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1165	C<ev_timer_again> each time you successfully read or write some data. If	1275	C<ev_timer_again> each time you successfully read or write some data. If
1166	you go into an idle state where you do not expect data to travel on the	1276	you go into an idle state where you do not expect data to travel on the
…		…
1192		1302
1193	=head3 Examples	1303	=head3 Examples
1194		1304
1195	Example: Create a timer that fires after 60 seconds.	1305	Example: Create a timer that fires after 60 seconds.
1196		1306
1197	static void	1307	static void
1198	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1308	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1199	{	1309	{
1200	.. one minute over, w is actually stopped right here	1310	.. one minute over, w is actually stopped right here
1201	}	1311	}
1202		1312
1203	struct ev_timer mytimer;	1313	struct ev_timer mytimer;
1204	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);	1314	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1205	ev_timer_start (loop, &mytimer);	1315	ev_timer_start (loop, &mytimer);
1206		1316
1207	Example: Create a timeout timer that times out after 10 seconds of	1317	Example: Create a timeout timer that times out after 10 seconds of
1208	inactivity.	1318	inactivity.
1209		1319
1210	static void	1320	static void
1211	timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1321	timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1212	{	1322	{
1213	.. ten seconds without any activity	1323	.. ten seconds without any activity
1214	}	1324	}
1215		1325
1216	struct ev_timer mytimer;	1326	struct ev_timer mytimer;
1217	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	1327	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1218	ev_timer_again (&mytimer); /* start timer */	1328	ev_timer_again (&mytimer); /* start timer */
1219	ev_loop (loop, 0);	1329	ev_loop (loop, 0);
1220		1330
1221	// and in some piece of code that gets executed on any "activity":	1331	// and in some piece of code that gets executed on any "activity":
1222	// reset the timeout to start ticking again at 10 seconds	1332	// reset the timeout to start ticking again at 10 seconds
1223	ev_timer_again (&mytimer);	1333	ev_timer_again (&mytimer);
1224		1334
1225		1335
1226	=head2 C<ev_periodic> - to cron or not to cron?	1336	=head2 C<ev_periodic> - to cron or not to cron?
1227		1337
1228	Periodic watchers are also timers of a kind, but they are very versatile	1338	Periodic watchers are also timers of a kind, but they are very versatile
1229	(and unfortunately a bit complex).	1339	(and unfortunately a bit complex).
1230		1340
1231	Unlike C<ev_timer>'s, they are not based on real time (or relative time)	1341	Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1232	but on wallclock time (absolute time). You can tell a periodic watcher	1342	but on wall clock time (absolute time). You can tell a periodic watcher
1233	to trigger "at" some specific point in time. For example, if you tell a	1343	to trigger after some specific point in time. For example, if you tell a
1234	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()	1344	periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()
1235	+ 10.>) and then reset your system clock to the last year, then it will	1345	+ 10.>, that is, an absolute time not a delay) and then reset your system
		1346	clock to January of the previous year, then it will take more than year
1236	take a year to trigger the event (unlike an C<ev_timer>, which would trigger	1347	to trigger the event (unlike an C<ev_timer>, which would still trigger
1237	roughly 10 seconds later).	1348	roughly 10 seconds later as it uses a relative timeout).
1238		1349
1239	They can also be used to implement vastly more complex timers, such as	1350	C<ev_periodic>s can also be used to implement vastly more complex timers,
1240	triggering an event on each midnight, local time or other, complicated,	1351	such as triggering an event on each "midnight, local time", or other
1241	rules.	1352	complicated, rules.
1242		1353
1243	As with timers, the callback is guarenteed to be invoked only when the	1354	As with timers, the callback is guaranteed to be invoked only when the
1244	time (C<at>) has been passed, but if multiple periodic timers become ready	1355	time (C<at>) has passed, but if multiple periodic timers become ready
1245	during the same loop iteration then order of execution is undefined.	1356	during the same loop iteration then order of execution is undefined.
1246		1357
1247	=head3 Watcher-Specific Functions and Data Members	1358	=head3 Watcher-Specific Functions and Data Members
1248		1359
1249	=over 4	1360	=over 4
…		…
1257		1368
1258	=over 4	1369	=over 4
1259		1370
1260	=item * absolute timer (at = time, interval = reschedule_cb = 0)	1371	=item * absolute timer (at = time, interval = reschedule_cb = 0)
1261		1372
1262	In this configuration the watcher triggers an event at the wallclock time	1373	In this configuration the watcher triggers an event after the wall clock
1263	C<at> and doesn't repeat. It will not adjust when a time jump occurs,	1374	time C<at> has passed and doesn't repeat. It will not adjust when a time
1264	that is, if it is to be run at January 1st 2011 then it will run when the	1375	jump occurs, that is, if it is to be run at January 1st 2011 then it will
1265	system time reaches or surpasses this time.	1376	run when the system time reaches or surpasses this time.
1266		1377
1267	=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)	1378	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1268		1379
1269	In this mode the watcher will always be scheduled to time out at the next	1380	In this mode the watcher will always be scheduled to time out at the next
1270	C<at + N * interval> time (for some integer N, which can also be negative)	1381	C<at + N * interval> time (for some integer N, which can also be negative)
1271	and then repeat, regardless of any time jumps.	1382	and then repeat, regardless of any time jumps.
1272		1383
1273	This can be used to create timers that do not drift with respect to system	1384	This can be used to create timers that do not drift with respect to system
1274	time:	1385	time, for example, here is a C<ev_periodic> that triggers each hour, on
		1386	the hour:
1275		1387
1276	ev_periodic_set (&periodic, 0., 3600., 0);	1388	ev_periodic_set (&periodic, 0., 3600., 0);
1277		1389
1278	This doesn't mean there will always be 3600 seconds in between triggers,	1390	This doesn't mean there will always be 3600 seconds in between triggers,
1279	but only that the the callback will be called when the system time shows a	1391	but only that the callback will be called when the system time shows a
1280	full hour (UTC), or more correctly, when the system time is evenly divisible	1392	full hour (UTC), or more correctly, when the system time is evenly divisible
1281	by 3600.	1393	by 3600.
1282		1394
1283	Another way to think about it (for the mathematically inclined) is that	1395	Another way to think about it (for the mathematically inclined) is that
1284	C<ev_periodic> will try to run the callback in this mode at the next possible	1396	C<ev_periodic> will try to run the callback in this mode at the next possible
1285	time where C<time = at (mod interval)>, regardless of any time jumps.	1397	time where C<time = at (mod interval)>, regardless of any time jumps.
1286		1398
1287	For numerical stability it is preferable that the C<at> value is near	1399	For numerical stability it is preferable that the C<at> value is near
1288	C<ev_now ()> (the current time), but there is no range requirement for	1400	C<ev_now ()> (the current time), but there is no range requirement for
1289	this value.	1401	this value, and in fact is often specified as zero.
		1402
		1403	Note also that there is an upper limit to how often a timer can fire (CPU
		1404	speed for example), so if C<interval> is very small then timing stability
		1405	will of course deteriorate. Libev itself tries to be exact to be about one
		1406	millisecond (if the OS supports it and the machine is fast enough).
1290		1407
1291	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)	1408	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1292		1409
1293	In this mode the values for C<interval> and C<at> are both being	1410	In this mode the values for C<interval> and C<at> are both being
1294	ignored. Instead, each time the periodic watcher gets scheduled, the	1411	ignored. Instead, each time the periodic watcher gets scheduled, the
1295	reschedule callback will be called with the watcher as first, and the	1412	reschedule callback will be called with the watcher as first, and the
1296	current time as second argument.	1413	current time as second argument.
1297		1414
1298	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	1415	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1299	ever, or make any event loop modifications>. If you need to stop it,	1416	ever, or make ANY event loop modifications whatsoever>.
1300	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1301	starting an C<ev_prepare> watcher, which is legal).
1302		1417
		1418	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
		1419	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
		1420	only event loop modification you are allowed to do).
		1421
1303	Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,	1422	The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic
1304	ev_tstamp now)>, e.g.:	1423	*w, ev_tstamp now)>, e.g.:
1305		1424
1306	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)	1425	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1307	{	1426	{
1308	return now + 60.;	1427	return now + 60.;
1309	}	1428	}
…		…
1311	It must return the next time to trigger, based on the passed time value	1430	It must return the next time to trigger, based on the passed time value
1312	(that is, the lowest time value larger than to the second argument). It	1431	(that is, the lowest time value larger than to the second argument). It
1313	will usually be called just before the callback will be triggered, but	1432	will usually be called just before the callback will be triggered, but
1314	might be called at other times, too.	1433	might be called at other times, too.
1315		1434
1316	NOTE: I<< This callback must always return a time that is later than the	1435	NOTE: I<< This callback must always return a time that is higher than or
1317	passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.	1436	equal to the passed C<now> value >>.
1318		1437
1319	This can be used to create very complex timers, such as a timer that	1438	This can be used to create very complex timers, such as a timer that
1320	triggers on each midnight, local time. To do this, you would calculate the	1439	triggers on "next midnight, local time". To do this, you would calculate the
1321	next midnight after C<now> and return the timestamp value for this. How	1440	next midnight after C<now> and return the timestamp value for this. How
1322	you do this is, again, up to you (but it is not trivial, which is the main	1441	you do this is, again, up to you (but it is not trivial, which is the main
1323	reason I omitted it as an example).	1442	reason I omitted it as an example).
1324		1443
1325	=back	1444	=back
…		…
1329	Simply stops and restarts the periodic watcher again. This is only useful	1448	Simply stops and restarts the periodic watcher again. This is only useful
1330	when you changed some parameters or the reschedule callback would return	1449	when you changed some parameters or the reschedule callback would return
1331	a different time than the last time it was called (e.g. in a crond like	1450	a different time than the last time it was called (e.g. in a crond like
1332	program when the crontabs have changed).	1451	program when the crontabs have changed).
1333		1452
		1453	=item ev_tstamp ev_periodic_at (ev_periodic *)
		1454
		1455	When active, returns the absolute time that the watcher is supposed to
		1456	trigger next.
		1457
1334	=item ev_tstamp offset [read-write]	1458	=item ev_tstamp offset [read-write]
1335		1459
1336	When repeating, this contains the offset value, otherwise this is the	1460	When repeating, this contains the offset value, otherwise this is the
1337	absolute point in time (the C<at> value passed to C<ev_periodic_set>).	1461	absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1338		1462
…		…
1349		1473
1350	The current reschedule callback, or C<0>, if this functionality is	1474	The current reschedule callback, or C<0>, if this functionality is
1351	switched off. Can be changed any time, but changes only take effect when	1475	switched off. Can be changed any time, but changes only take effect when
1352	the periodic timer fires or C<ev_periodic_again> is being called.	1476	the periodic timer fires or C<ev_periodic_again> is being called.
1353		1477
1354	=item ev_tstamp at [read-only]
1355
1356	When active, contains the absolute time that the watcher is supposed to
1357	trigger next.
1358
1359	=back	1478	=back
1360		1479
1361	=head3 Examples	1480	=head3 Examples
1362		1481
1363	Example: Call a callback every hour, or, more precisely, whenever the	1482	Example: Call a callback every hour, or, more precisely, whenever the
1364	system clock is divisible by 3600. The callback invocation times have	1483	system clock is divisible by 3600. The callback invocation times have
1365	potentially a lot of jittering, but good long-term stability.	1484	potentially a lot of jitter, but good long-term stability.
1366		1485
1367	static void	1486	static void
1368	clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)	1487	clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1369	{	1488	{
1370	... its now a full hour (UTC, or TAI or whatever your clock follows)	1489	... its now a full hour (UTC, or TAI or whatever your clock follows)
1371	}	1490	}
1372		1491
1373	struct ev_periodic hourly_tick;	1492	struct ev_periodic hourly_tick;
1374	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);	1493	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1375	ev_periodic_start (loop, &hourly_tick);	1494	ev_periodic_start (loop, &hourly_tick);
1376		1495
1377	Example: The same as above, but use a reschedule callback to do it:	1496	Example: The same as above, but use a reschedule callback to do it:
1378		1497
1379	#include <math.h>	1498	#include <math.h>
1380		1499
1381	static ev_tstamp	1500	static ev_tstamp
1382	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)	1501	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1383	{	1502	{
1384	return fmod (now, 3600.) + 3600.;	1503	return fmod (now, 3600.) + 3600.;
1385	}	1504	}
1386		1505
1387	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);	1506	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1388		1507
1389	Example: Call a callback every hour, starting now:	1508	Example: Call a callback every hour, starting now:
1390		1509
1391	struct ev_periodic hourly_tick;	1510	struct ev_periodic hourly_tick;
1392	ev_periodic_init (&hourly_tick, clock_cb,	1511	ev_periodic_init (&hourly_tick, clock_cb,
1393	fmod (ev_now (loop), 3600.), 3600., 0);	1512	fmod (ev_now (loop), 3600.), 3600., 0);
1394	ev_periodic_start (loop, &hourly_tick);	1513	ev_periodic_start (loop, &hourly_tick);
1395		1514
1396		1515
1397	=head2 C<ev_signal> - signal me when a signal gets signalled!	1516	=head2 C<ev_signal> - signal me when a signal gets signalled!
1398		1517
1399	Signal watchers will trigger an event when the process receives a specific	1518	Signal watchers will trigger an event when the process receives a specific
…		…
1406	with the kernel (thus it coexists with your own signal handlers as long	1525	with the kernel (thus it coexists with your own signal handlers as long
1407	as you don't register any with libev). Similarly, when the last signal	1526	as you don't register any with libev). Similarly, when the last signal
1408	watcher for a signal is stopped libev will reset the signal handler to	1527	watcher for a signal is stopped libev will reset the signal handler to
1409	SIG_DFL (regardless of what it was set to before).	1528	SIG_DFL (regardless of what it was set to before).
1410		1529
		1530	If possible and supported, libev will install its handlers with
		1531	C<SA_RESTART> behaviour enabled, so system calls should not be unduly
		1532	interrupted. If you have a problem with system calls getting interrupted by
		1533	signals you can block all signals in an C<ev_check> watcher and unblock
		1534	them in an C<ev_prepare> watcher.
		1535
1411	=head3 Watcher-Specific Functions and Data Members	1536	=head3 Watcher-Specific Functions and Data Members
1412		1537
1413	=over 4	1538	=over 4
1414		1539
1415	=item ev_signal_init (ev_signal *, callback, int signum)	1540	=item ev_signal_init (ev_signal *, callback, int signum)
…		…
1423		1548
1424	The signal the watcher watches out for.	1549	The signal the watcher watches out for.
1425		1550
1426	=back	1551	=back
1427		1552
		1553	=head3 Examples
		1554
		1555	Example: Try to exit cleanly on SIGINT and SIGTERM.
		1556
		1557	static void
		1558	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
		1559	{
		1560	ev_unloop (loop, EVUNLOOP_ALL);
		1561	}
		1562
		1563	struct ev_signal signal_watcher;
		1564	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
		1565	ev_signal_start (loop, &sigint_cb);
		1566
1428		1567
1429	=head2 C<ev_child> - watch out for process status changes	1568	=head2 C<ev_child> - watch out for process status changes
1430		1569
1431	Child watchers trigger when your process receives a SIGCHLD in response to	1570	Child watchers trigger when your process receives a SIGCHLD in response to
1432	some child status changes (most typically when a child of yours dies).	1571	some child status changes (most typically when a child of yours dies). It
		1572	is permissible to install a child watcher I<after> the child has been
		1573	forked (which implies it might have already exited), as long as the event
		1574	loop isn't entered (or is continued from a watcher).
		1575
		1576	Only the default event loop is capable of handling signals, and therefore
		1577	you can only register child watchers in the default event loop.
		1578
		1579	=head3 Process Interaction
		1580
		1581	Libev grabs C<SIGCHLD> as soon as the default event loop is
		1582	initialised. This is necessary to guarantee proper behaviour even if
		1583	the first child watcher is started after the child exits. The occurrence
		1584	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
		1585	synchronously as part of the event loop processing. Libev always reaps all
		1586	children, even ones not watched.
		1587
		1588	=head3 Overriding the Built-In Processing
		1589
		1590	Libev offers no special support for overriding the built-in child
		1591	processing, but if your application collides with libev's default child
		1592	handler, you can override it easily by installing your own handler for
		1593	C<SIGCHLD> after initialising the default loop, and making sure the
		1594	default loop never gets destroyed. You are encouraged, however, to use an
		1595	event-based approach to child reaping and thus use libev's support for
		1596	that, so other libev users can use C<ev_child> watchers freely.
		1597
		1598	=head3 Stopping the Child Watcher
		1599
		1600	Currently, the child watcher never gets stopped, even when the
		1601	child terminates, so normally one needs to stop the watcher in the
		1602	callback. Future versions of libev might stop the watcher automatically
		1603	when a child exit is detected.
1433		1604
1434	=head3 Watcher-Specific Functions and Data Members	1605	=head3 Watcher-Specific Functions and Data Members
1435		1606
1436	=over 4	1607	=over 4
1437		1608
1438	=item ev_child_init (ev_child *, callback, int pid)	1609	=item ev_child_init (ev_child *, callback, int pid, int trace)
1439		1610
1440	=item ev_child_set (ev_child *, int pid)	1611	=item ev_child_set (ev_child *, int pid, int trace)
1441		1612
1442	Configures the watcher to wait for status changes of process C<pid> (or	1613	Configures the watcher to wait for status changes of process C<pid> (or
1443	I<any> process if C<pid> is specified as C<0>). The callback can look	1614	I<any> process if C<pid> is specified as C<0>). The callback can look
1444	at the C<rstatus> member of the C<ev_child> watcher structure to see	1615	at the C<rstatus> member of the C<ev_child> watcher structure to see
1445	the status word (use the macros from C<sys/wait.h> and see your systems	1616	the status word (use the macros from C<sys/wait.h> and see your systems
1446	C<waitpid> documentation). The C<rpid> member contains the pid of the	1617	C<waitpid> documentation). The C<rpid> member contains the pid of the
1447	process causing the status change.	1618	process causing the status change. C<trace> must be either C<0> (only
		1619	activate the watcher when the process terminates) or C<1> (additionally
		1620	activate the watcher when the process is stopped or continued).
1448		1621
1449	=item int pid [read-only]	1622	=item int pid [read-only]
1450		1623
1451	The process id this watcher watches out for, or C<0>, meaning any process id.	1624	The process id this watcher watches out for, or C<0>, meaning any process id.
1452		1625
…		…
1461		1634
1462	=back	1635	=back
1463		1636
1464	=head3 Examples	1637	=head3 Examples
1465		1638
1466	Example: Try to exit cleanly on SIGINT and SIGTERM.	1639	Example: C<fork()> a new process and install a child handler to wait for
		1640	its completion.
1467		1641
		1642	ev_child cw;
		1643
1468	static void	1644	static void
1469	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)	1645	child_cb (EV_P_ struct ev_child *w, int revents)
1470	{	1646	{
1471	ev_unloop (loop, EVUNLOOP_ALL);	1647	ev_child_stop (EV_A_ w);
		1648	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1472	}	1649	}
1473		1650
1474	struct ev_signal signal_watcher;	1651	pid_t pid = fork ();
1475	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	1652
1476	ev_signal_start (loop, &sigint_cb);	1653	if (pid < 0)
		1654	// error
		1655	else if (pid == 0)
		1656	{
		1657	// the forked child executes here
		1658	exit (1);
		1659	}
		1660	else
		1661	{
		1662	ev_child_init (&cw, child_cb, pid, 0);
		1663	ev_child_start (EV_DEFAULT_ &cw);
		1664	}
1477		1665
1478		1666
1479	=head2 C<ev_stat> - did the file attributes just change?	1667	=head2 C<ev_stat> - did the file attributes just change?
1480		1668
1481	This watches a filesystem path for attribute changes. That is, it calls	1669	This watches a file system path for attribute changes. That is, it calls
1482	C<stat> regularly (or when the OS says it changed) and sees if it changed	1670	C<stat> regularly (or when the OS says it changed) and sees if it changed
1483	compared to the last time, invoking the callback if it did.	1671	compared to the last time, invoking the callback if it did.
1484		1672
1485	The path does not need to exist: changing from "path exists" to "path does	1673	The path does not need to exist: changing from "path exists" to "path does
1486	not exist" is a status change like any other. The condition "path does	1674	not exist" is a status change like any other. The condition "path does
…		…
1504	as even with OS-supported change notifications, this can be	1692	as even with OS-supported change notifications, this can be
1505	resource-intensive.	1693	resource-intensive.
1506		1694
1507	At the time of this writing, only the Linux inotify interface is	1695	At the time of this writing, only the Linux inotify interface is
1508	implemented (implementing kqueue support is left as an exercise for the	1696	implemented (implementing kqueue support is left as an exercise for the
		1697	reader, note, however, that the author sees no way of implementing ev_stat
1509	reader). Inotify will be used to give hints only and should not change the	1698	semantics with kqueue). Inotify will be used to give hints only and should
1510	semantics of C<ev_stat> watchers, which means that libev sometimes needs	1699	not change the semantics of C<ev_stat> watchers, which means that libev
1511	to fall back to regular polling again even with inotify, but changes are	1700	sometimes needs to fall back to regular polling again even with inotify,
1512	usually detected immediately, and if the file exists there will be no	1701	but changes are usually detected immediately, and if the file exists there
1513	polling.	1702	will be no polling.
		1703
		1704	=head3 ABI Issues (Largefile Support)
		1705
		1706	Libev by default (unless the user overrides this) uses the default
		1707	compilation environment, which means that on systems with large file
		1708	support disabled by default, you get the 32 bit version of the stat
		1709	structure. When using the library from programs that change the ABI to
		1710	use 64 bit file offsets the programs will fail. In that case you have to
		1711	compile libev with the same flags to get binary compatibility. This is
		1712	obviously the case with any flags that change the ABI, but the problem is
		1713	most noticeably disabled with ev_stat and large file support.
		1714
		1715	The solution for this is to lobby your distribution maker to make large
		1716	file interfaces available by default (as e.g. FreeBSD does) and not
		1717	optional. Libev cannot simply switch on large file support because it has
		1718	to exchange stat structures with application programs compiled using the
		1719	default compilation environment.
1514		1720
1515	=head3 Inotify	1721	=head3 Inotify
1516		1722
1517	When C<inotify (7)> support has been compiled into libev (generally only	1723	When C<inotify (7)> support has been compiled into libev (generally only
1518	available on Linux) and present at runtime, it will be used to speed up	1724	available on Linux) and present at runtime, it will be used to speed up
1519	change detection where possible. The inotify descriptor will be created lazily	1725	change detection where possible. The inotify descriptor will be created lazily
1520	when the first C<ev_stat> watcher is being started.	1726	when the first C<ev_stat> watcher is being started.
1521		1727
1522	Inotify presense does not change the semantics of C<ev_stat> watchers	1728	Inotify presence does not change the semantics of C<ev_stat> watchers
1523	except that changes might be detected earlier, and in some cases, to avoid	1729	except that changes might be detected earlier, and in some cases, to avoid
1524	making regular C<stat> calls. Even in the presense of inotify support	1730	making regular C<stat> calls. Even in the presence of inotify support
1525	there are many cases where libev has to resort to regular C<stat> polling.	1731	there are many cases where libev has to resort to regular C<stat> polling.
1526		1732
1527	(There is no support for kqueue, as apparently it cannot be used to	1733	(There is no support for kqueue, as apparently it cannot be used to
1528	implement this functionality, due to the requirement of having a file	1734	implement this functionality, due to the requirement of having a file
1529	descriptor open on the object at all times).	1735	descriptor open on the object at all times).
1530		1736
1531	=head3 The special problem of stat time resolution	1737	=head3 The special problem of stat time resolution
1532		1738
1533	The C<stat ()> syscall only supports full-second resolution portably, and	1739	The C<stat ()> system call only supports full-second resolution portably, and
1534	even on systems where the resolution is higher, many filesystems still	1740	even on systems where the resolution is higher, many file systems still
1535	only support whole seconds.	1741	only support whole seconds.
1536		1742
1537	That means that, if the time is the only thing that changes, you might	1743	That means that, if the time is the only thing that changes, you can
1538	miss updates: on the first update, C<ev_stat> detects a change and calls	1744	easily miss updates: on the first update, C<ev_stat> detects a change and
1539	your callback, which does something. When there is another update within	1745	calls your callback, which does something. When there is another update
1540	the same second, C<ev_stat> will be unable to detect it.	1746	within the same second, C<ev_stat> will be unable to detect it as the stat
		1747	data does not change.
1541		1748
1542	The solution to this is to delay acting on a change for a second (or till	1749	The solution to this is to delay acting on a change for slightly more
1543	the next second boundary), using a roughly one-second delay C<ev_timer>	1750	than a second (or till slightly after the next full second boundary), using
1544	(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>	1751	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1545	is added to work around small timing inconsistencies of some operating	1752	ev_timer_again (loop, w)>).
1546	systems.	1753
		1754	The C<.02> offset is added to work around small timing inconsistencies
		1755	of some operating systems (where the second counter of the current time
		1756	might be be delayed. One such system is the Linux kernel, where a call to
		1757	C<gettimeofday> might return a timestamp with a full second later than
		1758	a subsequent C<time> call - if the equivalent of C<time ()> is used to
		1759	update file times then there will be a small window where the kernel uses
		1760	the previous second to update file times but libev might already execute
		1761	the timer callback).
1547		1762
1548	=head3 Watcher-Specific Functions and Data Members	1763	=head3 Watcher-Specific Functions and Data Members
1549		1764
1550	=over 4	1765	=over 4
1551		1766
…		…
1557	C<path>. The C<interval> is a hint on how quickly a change is expected to	1772	C<path>. The C<interval> is a hint on how quickly a change is expected to
1558	be detected and should normally be specified as C<0> to let libev choose	1773	be detected and should normally be specified as C<0> to let libev choose
1559	a suitable value. The memory pointed to by C<path> must point to the same	1774	a suitable value. The memory pointed to by C<path> must point to the same
1560	path for as long as the watcher is active.	1775	path for as long as the watcher is active.
1561		1776
1562	The callback will be receive C<EV_STAT> when a change was detected,	1777	The callback will receive C<EV_STAT> when a change was detected, relative
1563	relative to the attributes at the time the watcher was started (or the	1778	to the attributes at the time the watcher was started (or the last change
1564	last change was detected).	1779	was detected).
1565		1780
1566	=item ev_stat_stat (ev_stat *)	1781	=item ev_stat_stat (loop, ev_stat *)
1567		1782
1568	Updates the stat buffer immediately with new values. If you change the	1783	Updates the stat buffer immediately with new values. If you change the
1569	watched path in your callback, you could call this fucntion to avoid	1784	watched path in your callback, you could call this function to avoid
1570	detecting this change (while introducing a race condition). Can also be	1785	detecting this change (while introducing a race condition if you are not
1571	useful simply to find out the new values.	1786	the only one changing the path). Can also be useful simply to find out the
		1787	new values.
1572		1788
1573	=item ev_statdata attr [read-only]	1789	=item ev_statdata attr [read-only]
1574		1790
1575	The most-recently detected attributes of the file. Although the type is of	1791	The most-recently detected attributes of the file. Although the type is
1576	C<ev_statdata>, this is usually the (or one of the) C<struct stat> types	1792	C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1577	suitable for your system. If the C<st_nlink> member is C<0>, then there	1793	suitable for your system, but you can only rely on the POSIX-standardised
		1794	members to be present. If the C<st_nlink> member is C<0>, then there was
1578	was some error while C<stat>ing the file.	1795	some error while C<stat>ing the file.
1579		1796
1580	=item ev_statdata prev [read-only]	1797	=item ev_statdata prev [read-only]
1581		1798
1582	The previous attributes of the file. The callback gets invoked whenever	1799	The previous attributes of the file. The callback gets invoked whenever
1583	C<prev> != C<attr>.	1800	C<prev> != C<attr>, or, more precisely, one or more of these members
		1801	differ: C<st_dev>, C<st_ino>, C<st_mode>, C<st_nlink>, C<st_uid>,
		1802	C<st_gid>, C<st_rdev>, C<st_size>, C<st_atime>, C<st_mtime>, C<st_ctime>.
1584		1803
1585	=item ev_tstamp interval [read-only]	1804	=item ev_tstamp interval [read-only]
1586		1805
1587	The specified interval.	1806	The specified interval.
1588		1807
1589	=item const char *path [read-only]	1808	=item const char *path [read-only]
1590		1809
1591	The filesystem path that is being watched.	1810	The file system path that is being watched.
1592		1811
1593	=back	1812	=back
1594		1813
1595	=head3 Examples	1814	=head3 Examples
1596		1815
1597	Example: Watch C</etc/passwd> for attribute changes.	1816	Example: Watch C</etc/passwd> for attribute changes.
1598		1817
1599	static void	1818	static void
1600	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)	1819	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1601	{	1820	{
1602	/* /etc/passwd changed in some way */	1821	/* /etc/passwd changed in some way */
1603	if (w->attr.st_nlink)	1822	if (w->attr.st_nlink)
1604	{	1823	{
1605	printf ("passwd current size %ld\n", (long)w->attr.st_size);	1824	printf ("passwd current size %ld\n", (long)w->attr.st_size);
1606	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);	1825	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1607	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);	1826	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1608	}	1827	}
1609	else	1828	else
1610	/* you shalt not abuse printf for puts */	1829	/* you shalt not abuse printf for puts */
1611	puts ("wow, /etc/passwd is not there, expect problems. "	1830	puts ("wow, /etc/passwd is not there, expect problems. "
1612	"if this is windows, they already arrived\n");	1831	"if this is windows, they already arrived\n");
1613	}	1832	}
1614		1833
1615	...	1834	...
1616	ev_stat passwd;	1835	ev_stat passwd;
1617		1836
1618	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);	1837	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1619	ev_stat_start (loop, &passwd);	1838	ev_stat_start (loop, &passwd);
1620		1839
1621	Example: Like above, but additionally use a one-second delay so we do not	1840	Example: Like above, but additionally use a one-second delay so we do not
1622	miss updates (however, frequent updates will delay processing, too, so	1841	miss updates (however, frequent updates will delay processing, too, so
1623	one might do the work both on C<ev_stat> callback invocation I<and> on	1842	one might do the work both on C<ev_stat> callback invocation I<and> on
1624	C<ev_timer> callback invocation).	1843	C<ev_timer> callback invocation).
1625		1844
1626	static ev_stat passwd;	1845	static ev_stat passwd;
1627	static ev_timer timer;	1846	static ev_timer timer;
1628		1847
1629	static void	1848	static void
1630	timer_cb (EV_P_ ev_timer *w, int revents)	1849	timer_cb (EV_P_ ev_timer *w, int revents)
1631	{	1850	{
1632	ev_timer_stop (EV_A_ w);	1851	ev_timer_stop (EV_A_ w);
1633		1852
1634	/* now it's one second after the most recent passwd change */	1853	/* now it's one second after the most recent passwd change */
1635	}	1854	}
1636		1855
1637	static void	1856	static void
1638	stat_cb (EV_P_ ev_stat *w, int revents)	1857	stat_cb (EV_P_ ev_stat *w, int revents)
1639	{	1858	{
1640	/* reset the one-second timer */	1859	/* reset the one-second timer */
1641	ev_timer_again (EV_A_ &timer);	1860	ev_timer_again (EV_A_ &timer);
1642	}	1861	}
1643		1862
1644	...	1863	...
1645	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);	1864	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1646	ev_stat_start (loop, &passwd);	1865	ev_stat_start (loop, &passwd);
1647	ev_timer_init (&timer, timer_cb, 0., 1.01);	1866	ev_timer_init (&timer, timer_cb, 0., 1.02);
1648		1867
1649		1868
1650	=head2 C<ev_idle> - when you've got nothing better to do...	1869	=head2 C<ev_idle> - when you've got nothing better to do...
1651		1870
1652	Idle watchers trigger events when no other events of the same or higher	1871	Idle watchers trigger events when no other events of the same or higher
…		…
1683	=head3 Examples	1902	=head3 Examples
1684		1903
1685	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the	1904	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1686	callback, free it. Also, use no error checking, as usual.	1905	callback, free it. Also, use no error checking, as usual.
1687		1906
1688	static void	1907	static void
1689	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)	1908	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1690	{	1909	{
1691	free (w);	1910	free (w);
1692	// now do something you wanted to do when the program has	1911	// now do something you wanted to do when the program has
1693	// no longer asnything immediate to do.	1912	// no longer anything immediate to do.
1694	}	1913	}
1695		1914
1696	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));	1915	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1697	ev_idle_init (idle_watcher, idle_cb);	1916	ev_idle_init (idle_watcher, idle_cb);
1698	ev_idle_start (loop, idle_cb);	1917	ev_idle_start (loop, idle_cb);
1699		1918
1700		1919
1701	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	1920	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1702		1921
1703	Prepare and check watchers are usually (but not always) used in tandem:	1922	Prepare and check watchers are usually (but not always) used in tandem:
…		…
1722		1941
1723	This is done by examining in each prepare call which file descriptors need	1942	This is done by examining in each prepare call which file descriptors need
1724	to be watched by the other library, registering C<ev_io> watchers for	1943	to be watched by the other library, registering C<ev_io> watchers for
1725	them and starting an C<ev_timer> watcher for any timeouts (many libraries	1944	them and starting an C<ev_timer> watcher for any timeouts (many libraries
1726	provide just this functionality). Then, in the check watcher you check for	1945	provide just this functionality). Then, in the check watcher you check for
1727	any events that occured (by checking the pending status of all watchers	1946	any events that occurred (by checking the pending status of all watchers
1728	and stopping them) and call back into the library. The I/O and timer	1947	and stopping them) and call back into the library. The I/O and timer
1729	callbacks will never actually be called (but must be valid nevertheless,	1948	callbacks will never actually be called (but must be valid nevertheless,
1730	because you never know, you know?).	1949	because you never know, you know?).
1731		1950
1732	As another example, the Perl Coro module uses these hooks to integrate	1951	As another example, the Perl Coro module uses these hooks to integrate
…		…
1740		1959
1741	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	1960	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1742	priority, to ensure that they are being run before any other watchers	1961	priority, to ensure that they are being run before any other watchers
1743	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,	1962	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1744	too) should not activate ("feed") events into libev. While libev fully	1963	too) should not activate ("feed") events into libev. While libev fully
1745	supports this, they will be called before other C<ev_check> watchers	1964	supports this, they might get executed before other C<ev_check> watchers
1746	did their job. As C<ev_check> watchers are often used to embed other	1965	did their job. As C<ev_check> watchers are often used to embed other
1747	(non-libev) event loops those other event loops might be in an unusable	1966	(non-libev) event loops those other event loops might be in an unusable
1748	state until their C<ev_check> watcher ran (always remind yourself to	1967	state until their C<ev_check> watcher ran (always remind yourself to
1749	coexist peacefully with others).	1968	coexist peacefully with others).
1750		1969
…		…
1765	=head3 Examples	1984	=head3 Examples
1766		1985
1767	There are a number of principal ways to embed other event loops or modules	1986	There are a number of principal ways to embed other event loops or modules
1768	into libev. Here are some ideas on how to include libadns into libev	1987	into libev. Here are some ideas on how to include libadns into libev
1769	(there is a Perl module named C<EV::ADNS> that does this, which you could	1988	(there is a Perl module named C<EV::ADNS> that does this, which you could
1770	use for an actually working example. Another Perl module named C<EV::Glib>	1989	use as a working example. Another Perl module named C<EV::Glib> embeds a
1771	embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV	1990	Glib main context into libev, and finally, C<Glib::EV> embeds EV into the
1772	into the Glib event loop).	1991	Glib event loop).
1773		1992
1774	Method 1: Add IO watchers and a timeout watcher in a prepare handler,	1993	Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1775	and in a check watcher, destroy them and call into libadns. What follows	1994	and in a check watcher, destroy them and call into libadns. What follows
1776	is pseudo-code only of course. This requires you to either use a low	1995	is pseudo-code only of course. This requires you to either use a low
1777	priority for the check watcher or use C<ev_clear_pending> explicitly, as	1996	priority for the check watcher or use C<ev_clear_pending> explicitly, as
1778	the callbacks for the IO/timeout watchers might not have been called yet.	1997	the callbacks for the IO/timeout watchers might not have been called yet.
1779		1998
1780	static ev_io iow [nfd];	1999	static ev_io iow [nfd];
1781	static ev_timer tw;	2000	static ev_timer tw;
1782		2001
1783	static void	2002	static void
1784	io_cb (ev_loop *loop, ev_io *w, int revents)	2003	io_cb (ev_loop *loop, ev_io *w, int revents)
1785	{	2004	{
1786	}	2005	}
1787		2006
1788	// create io watchers for each fd and a timer before blocking	2007	// create io watchers for each fd and a timer before blocking
1789	static void	2008	static void
1790	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)	2009	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1791	{	2010	{
1792	int timeout = 3600000;	2011	int timeout = 3600000;
1793	struct pollfd fds [nfd];	2012	struct pollfd fds [nfd];
1794	// actual code will need to loop here and realloc etc.	2013	// actual code will need to loop here and realloc etc.
1795	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2014	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1796		2015
1797	/* the callback is illegal, but won't be called as we stop during check */	2016	/* the callback is illegal, but won't be called as we stop during check */
1798	ev_timer_init (&tw, 0, timeout * 1e-3);	2017	ev_timer_init (&tw, 0, timeout * 1e-3);
1799	ev_timer_start (loop, &tw);	2018	ev_timer_start (loop, &tw);
1800		2019
1801	// create one ev_io per pollfd	2020	// create one ev_io per pollfd
1802	for (int i = 0; i < nfd; ++i)	2021	for (int i = 0; i < nfd; ++i)
1803	{	2022	{
1804	ev_io_init (iow + i, io_cb, fds [i].fd,	2023	ev_io_init (iow + i, io_cb, fds [i].fd,
1805	((fds [i].events & POLLIN ? EV_READ : 0)	2024	((fds [i].events & POLLIN ? EV_READ : 0)
1806	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));	2025	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1807		2026
1808	fds [i].revents = 0;	2027	fds [i].revents = 0;
1809	ev_io_start (loop, iow + i);	2028	ev_io_start (loop, iow + i);
1810	}	2029	}
1811	}	2030	}
1812		2031
1813	// stop all watchers after blocking	2032	// stop all watchers after blocking
1814	static void	2033	static void
1815	adns_check_cb (ev_loop *loop, ev_check *w, int revents)	2034	adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1816	{	2035	{
1817	ev_timer_stop (loop, &tw);	2036	ev_timer_stop (loop, &tw);
1818		2037
1819	for (int i = 0; i < nfd; ++i)	2038	for (int i = 0; i < nfd; ++i)
1820	{	2039	{
1821	// set the relevant poll flags	2040	// set the relevant poll flags
1822	// could also call adns_processreadable etc. here	2041	// could also call adns_processreadable etc. here
1823	struct pollfd *fd = fds + i;	2042	struct pollfd *fd = fds + i;
1824	int revents = ev_clear_pending (iow + i);	2043	int revents = ev_clear_pending (iow + i);
1825	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;	2044	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1826	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;	2045	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1827		2046
1828	// now stop the watcher	2047	// now stop the watcher
1829	ev_io_stop (loop, iow + i);	2048	ev_io_stop (loop, iow + i);
1830	}	2049	}
1831		2050
1832	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));	2051	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1833	}	2052	}
1834		2053
1835	Method 2: This would be just like method 1, but you run C<adns_afterpoll>	2054	Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1836	in the prepare watcher and would dispose of the check watcher.	2055	in the prepare watcher and would dispose of the check watcher.
1837		2056
1838	Method 3: If the module to be embedded supports explicit event	2057	Method 3: If the module to be embedded supports explicit event
1839	notification (adns does), you can also make use of the actual watcher	2058	notification (libadns does), you can also make use of the actual watcher
1840	callbacks, and only destroy/create the watchers in the prepare watcher.	2059	callbacks, and only destroy/create the watchers in the prepare watcher.
1841		2060
1842	static void	2061	static void
1843	timer_cb (EV_P_ ev_timer *w, int revents)	2062	timer_cb (EV_P_ ev_timer *w, int revents)
1844	{	2063	{
1845	adns_state ads = (adns_state)w->data;	2064	adns_state ads = (adns_state)w->data;
1846	update_now (EV_A);	2065	update_now (EV_A);
1847		2066
1848	adns_processtimeouts (ads, &tv_now);	2067	adns_processtimeouts (ads, &tv_now);
1849	}	2068	}
1850		2069
1851	static void	2070	static void
1852	io_cb (EV_P_ ev_io *w, int revents)	2071	io_cb (EV_P_ ev_io *w, int revents)
1853	{	2072	{
1854	adns_state ads = (adns_state)w->data;	2073	adns_state ads = (adns_state)w->data;
1855	update_now (EV_A);	2074	update_now (EV_A);
1856		2075
1857	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);	2076	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1858	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);	2077	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1859	}	2078	}
1860		2079
1861	// do not ever call adns_afterpoll	2080	// do not ever call adns_afterpoll
1862		2081
1863	Method 4: Do not use a prepare or check watcher because the module you	2082	Method 4: Do not use a prepare or check watcher because the module you
1864	want to embed is too inflexible to support it. Instead, youc na override	2083	want to embed is too inflexible to support it. Instead, you can override
1865	their poll function. The drawback with this solution is that the main	2084	their poll function. The drawback with this solution is that the main
1866	loop is now no longer controllable by EV. The C<Glib::EV> module does	2085	loop is now no longer controllable by EV. The C<Glib::EV> module does
1867	this.	2086	this.
1868		2087
1869	static gint	2088	static gint
1870	event_poll_func (GPollFD *fds, guint nfds, gint timeout)	2089	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1871	{	2090	{
1872	int got_events = 0;	2091	int got_events = 0;
1873		2092
1874	for (n = 0; n < nfds; ++n)	2093	for (n = 0; n < nfds; ++n)
1875	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events	2094	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1876		2095
1877	if (timeout >= 0)	2096	if (timeout >= 0)
1878	// create/start timer	2097	// create/start timer
1879		2098
1880	// poll	2099	// poll
1881	ev_loop (EV_A_ 0);	2100	ev_loop (EV_A_ 0);
1882		2101
1883	// stop timer again	2102	// stop timer again
1884	if (timeout >= 0)	2103	if (timeout >= 0)
1885	ev_timer_stop (EV_A_ &to);	2104	ev_timer_stop (EV_A_ &to);
1886		2105
1887	// stop io watchers again - their callbacks should have set	2106	// stop io watchers again - their callbacks should have set
1888	for (n = 0; n < nfds; ++n)	2107	for (n = 0; n < nfds; ++n)
1889	ev_io_stop (EV_A_ iow [n]);	2108	ev_io_stop (EV_A_ iow [n]);
1890		2109
1891	return got_events;	2110	return got_events;
1892	}	2111	}
1893		2112
1894		2113
1895	=head2 C<ev_embed> - when one backend isn't enough...	2114	=head2 C<ev_embed> - when one backend isn't enough...
1896		2115
1897	This is a rather advanced watcher type that lets you embed one event loop	2116	This is a rather advanced watcher type that lets you embed one event loop
…		…
1953		2172
1954	Configures the watcher to embed the given loop, which must be	2173	Configures the watcher to embed the given loop, which must be
1955	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	2174	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1956	invoked automatically, otherwise it is the responsibility of the callback	2175	invoked automatically, otherwise it is the responsibility of the callback
1957	to invoke it (it will continue to be called until the sweep has been done,	2176	to invoke it (it will continue to be called until the sweep has been done,
1958	if you do not want thta, you need to temporarily stop the embed watcher).	2177	if you do not want that, you need to temporarily stop the embed watcher).
1959		2178
1960	=item ev_embed_sweep (loop, ev_embed *)	2179	=item ev_embed_sweep (loop, ev_embed *)
1961		2180
1962	Make a single, non-blocking sweep over the embedded loop. This works	2181	Make a single, non-blocking sweep over the embedded loop. This works
1963	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	2182	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1964	apropriate way for embedded loops.	2183	appropriate way for embedded loops.
1965		2184
1966	=item struct ev_loop *other [read-only]	2185	=item struct ev_loop *other [read-only]
1967		2186
1968	The embedded event loop.	2187	The embedded event loop.
1969		2188
…		…
1971		2190
1972	=head3 Examples	2191	=head3 Examples
1973		2192
1974	Example: Try to get an embeddable event loop and embed it into the default	2193	Example: Try to get an embeddable event loop and embed it into the default
1975	event loop. If that is not possible, use the default loop. The default	2194	event loop. If that is not possible, use the default loop. The default
1976	loop is stored in C<loop_hi>, while the mebeddable loop is stored in	2195	loop is stored in C<loop_hi>, while the embeddable loop is stored in
1977	C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be	2196	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
1978	used).	2197	used).
1979		2198
1980	struct ev_loop *loop_hi = ev_default_init (0);	2199	struct ev_loop *loop_hi = ev_default_init (0);
1981	struct ev_loop *loop_lo = 0;	2200	struct ev_loop *loop_lo = 0;
1982	struct ev_embed embed;	2201	struct ev_embed embed;
1983		2202
1984	// see if there is a chance of getting one that works	2203	// see if there is a chance of getting one that works
1985	// (remember that a flags value of 0 means autodetection)	2204	// (remember that a flags value of 0 means autodetection)
1986	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	2205	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1987	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	2206	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1988	: 0;	2207	: 0;
1989		2208
1990	// if we got one, then embed it, otherwise default to loop_hi	2209	// if we got one, then embed it, otherwise default to loop_hi
1991	if (loop_lo)	2210	if (loop_lo)
1992	{	2211	{
1993	ev_embed_init (&embed, 0, loop_lo);	2212	ev_embed_init (&embed, 0, loop_lo);
1994	ev_embed_start (loop_hi, &embed);	2213	ev_embed_start (loop_hi, &embed);
1995	}	2214	}
1996	else	2215	else
1997	loop_lo = loop_hi;	2216	loop_lo = loop_hi;
1998		2217
1999	Example: Check if kqueue is available but not recommended and create	2218	Example: Check if kqueue is available but not recommended and create
2000	a kqueue backend for use with sockets (which usually work with any	2219	a kqueue backend for use with sockets (which usually work with any
2001	kqueue implementation). Store the kqueue/socket-only event loop in	2220	kqueue implementation). Store the kqueue/socket-only event loop in
2002	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	2221	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2003		2222
2004	struct ev_loop *loop = ev_default_init (0);	2223	struct ev_loop *loop = ev_default_init (0);
2005	struct ev_loop *loop_socket = 0;	2224	struct ev_loop *loop_socket = 0;
2006	struct ev_embed embed;	2225	struct ev_embed embed;
2007		2226
2008	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	2227	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2009	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	2228	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2010	{	2229	{
2011	ev_embed_init (&embed, 0, loop_socket);	2230	ev_embed_init (&embed, 0, loop_socket);
2012	ev_embed_start (loop, &embed);	2231	ev_embed_start (loop, &embed);
2013	}	2232	}
2014		2233
2015	if (!loop_socket)	2234	if (!loop_socket)
2016	loop_socket = loop;	2235	loop_socket = loop;
2017		2236
2018	// now use loop_socket for all sockets, and loop for everything else	2237	// now use loop_socket for all sockets, and loop for everything else
2019		2238
2020		2239
2021	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	2240	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2022		2241
2023	Fork watchers are called when a C<fork ()> was detected (usually because	2242	Fork watchers are called when a C<fork ()> was detected (usually because
…		…
2039	believe me.	2258	believe me.
2040		2259
2041	=back	2260	=back
2042		2261
2043		2262
		2263	=head2 C<ev_async> - how to wake up another event loop
		2264
		2265	In general, you cannot use an C<ev_loop> from multiple threads or other
		2266	asynchronous sources such as signal handlers (as opposed to multiple event
		2267	loops - those are of course safe to use in different threads).
		2268
		2269	Sometimes, however, you need to wake up another event loop you do not
		2270	control, for example because it belongs to another thread. This is what
		2271	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
		2272	can signal it by calling C<ev_async_send>, which is thread- and signal
		2273	safe.
		2274
		2275	This functionality is very similar to C<ev_signal> watchers, as signals,
		2276	too, are asynchronous in nature, and signals, too, will be compressed
		2277	(i.e. the number of callback invocations may be less than the number of
		2278	C<ev_async_sent> calls).
		2279
		2280	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
		2281	just the default loop.
		2282
		2283	=head3 Queueing
		2284
		2285	C<ev_async> does not support queueing of data in any way. The reason
		2286	is that the author does not know of a simple (or any) algorithm for a
		2287	multiple-writer-single-reader queue that works in all cases and doesn't
		2288	need elaborate support such as pthreads.
		2289
		2290	That means that if you want to queue data, you have to provide your own
		2291	queue. But at least I can tell you would implement locking around your
		2292	queue:
		2293
		2294	=over 4
		2295
		2296	=item queueing from a signal handler context
		2297
		2298	To implement race-free queueing, you simply add to the queue in the signal
		2299	handler but you block the signal handler in the watcher callback. Here is an example that does that for
		2300	some fictitious SIGUSR1 handler:
		2301
		2302	static ev_async mysig;
		2303
		2304	static void
		2305	sigusr1_handler (void)
		2306	{
		2307	sometype data;
		2308
		2309	// no locking etc.
		2310	queue_put (data);
		2311	ev_async_send (EV_DEFAULT_ &mysig);
		2312	}
		2313
		2314	static void
		2315	mysig_cb (EV_P_ ev_async *w, int revents)
		2316	{
		2317	sometype data;
		2318	sigset_t block, prev;
		2319
		2320	sigemptyset (&block);
		2321	sigaddset (&block, SIGUSR1);
		2322	sigprocmask (SIG_BLOCK, &block, &prev);
		2323
		2324	while (queue_get (&data))
		2325	process (data);
		2326
		2327	if (sigismember (&prev, SIGUSR1)
		2328	sigprocmask (SIG_UNBLOCK, &block, 0);
		2329	}
		2330
		2331	(Note: pthreads in theory requires you to use C<pthread_setmask>
		2332	instead of C<sigprocmask> when you use threads, but libev doesn't do it
		2333	either...).
		2334
		2335	=item queueing from a thread context
		2336
		2337	The strategy for threads is different, as you cannot (easily) block
		2338	threads but you can easily preempt them, so to queue safely you need to
		2339	employ a traditional mutex lock, such as in this pthread example:
		2340
		2341	static ev_async mysig;
		2342	static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
		2343
		2344	static void
		2345	otherthread (void)
		2346	{
		2347	// only need to lock the actual queueing operation
		2348	pthread_mutex_lock (&mymutex);
		2349	queue_put (data);
		2350	pthread_mutex_unlock (&mymutex);
		2351
		2352	ev_async_send (EV_DEFAULT_ &mysig);
		2353	}
		2354
		2355	static void
		2356	mysig_cb (EV_P_ ev_async *w, int revents)
		2357	{
		2358	pthread_mutex_lock (&mymutex);
		2359
		2360	while (queue_get (&data))
		2361	process (data);
		2362
		2363	pthread_mutex_unlock (&mymutex);
		2364	}
		2365
		2366	=back
		2367
		2368
		2369	=head3 Watcher-Specific Functions and Data Members
		2370
		2371	=over 4
		2372
		2373	=item ev_async_init (ev_async *, callback)
		2374
		2375	Initialises and configures the async watcher - it has no parameters of any
		2376	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
		2377	believe me.
		2378
		2379	=item ev_async_send (loop, ev_async *)
		2380
		2381	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
		2382	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
		2383	C<ev_feed_event>, this call is safe to do in other threads, signal or
		2384	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
		2385	section below on what exactly this means).
		2386
		2387	This call incurs the overhead of a system call only once per loop iteration,
		2388	so while the overhead might be noticeable, it doesn't apply to repeated
		2389	calls to C<ev_async_send>.
		2390
		2391	=item bool = ev_async_pending (ev_async *)
		2392
		2393	Returns a non-zero value when C<ev_async_send> has been called on the
		2394	watcher but the event has not yet been processed (or even noted) by the
		2395	event loop.
		2396
		2397	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
		2398	the loop iterates next and checks for the watcher to have become active,
		2399	it will reset the flag again. C<ev_async_pending> can be used to very
		2400	quickly check whether invoking the loop might be a good idea.
		2401
		2402	Not that this does I<not> check whether the watcher itself is pending, only
		2403	whether it has been requested to make this watcher pending.
		2404
		2405	=back
		2406
		2407
2044	=head1 OTHER FUNCTIONS	2408	=head1 OTHER FUNCTIONS
2045		2409
2046	There are some other functions of possible interest. Described. Here. Now.	2410	There are some other functions of possible interest. Described. Here. Now.
2047		2411
2048	=over 4	2412	=over 4
…		…
2055	or timeout without having to allocate/configure/start/stop/free one or	2419	or timeout without having to allocate/configure/start/stop/free one or
2056	more watchers yourself.	2420	more watchers yourself.
2057		2421
2058	If C<fd> is less than 0, then no I/O watcher will be started and events	2422	If C<fd> is less than 0, then no I/O watcher will be started and events
2059	is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and	2423	is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
2060	C<events> set will be craeted and started.	2424	C<events> set will be created and started.
2061		2425
2062	If C<timeout> is less than 0, then no timeout watcher will be	2426	If C<timeout> is less than 0, then no timeout watcher will be
2063	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	2427	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2064	repeat = 0) will be started. While C<0> is a valid timeout, it is of	2428	repeat = 0) will be started. While C<0> is a valid timeout, it is of
2065	dubious value.	2429	dubious value.
…		…
2067	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	2431	The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2068	passed an C<revents> set like normal event callbacks (a combination of	2432	passed an C<revents> set like normal event callbacks (a combination of
2069	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	2433	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2070	value passed to C<ev_once>:	2434	value passed to C<ev_once>:
2071		2435
2072	static void stdin_ready (int revents, void *arg)	2436	static void stdin_ready (int revents, void *arg)
2073	{	2437	{
2074	if (revents & EV_TIMEOUT)	2438	if (revents & EV_TIMEOUT)
2075	/* doh, nothing entered */;	2439	/* doh, nothing entered */;
2076	else if (revents & EV_READ)	2440	else if (revents & EV_READ)
2077	/* stdin might have data for us, joy! */;	2441	/* stdin might have data for us, joy! */;
2078	}	2442	}
2079		2443
2080	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	2444	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2081		2445
2082	=item ev_feed_event (ev_loop *, watcher *, int revents)	2446	=item ev_feed_event (ev_loop *, watcher *, int revents)
2083		2447
2084	Feeds the given event set into the event loop, as if the specified event	2448	Feeds the given event set into the event loop, as if the specified event
2085	had happened for the specified watcher (which must be a pointer to an	2449	had happened for the specified watcher (which must be a pointer to an
…		…
2090	Feed an event on the given fd, as if a file descriptor backend detected	2454	Feed an event on the given fd, as if a file descriptor backend detected
2091	the given events it.	2455	the given events it.
2092		2456
2093	=item ev_feed_signal_event (ev_loop *loop, int signum)	2457	=item ev_feed_signal_event (ev_loop *loop, int signum)
2094		2458
2095	Feed an event as if the given signal occured (C<loop> must be the default	2459	Feed an event as if the given signal occurred (C<loop> must be the default
2096	loop!).	2460	loop!).
2097		2461
2098	=back	2462	=back
2099		2463
2100		2464
…		…
2116		2480
2117	=item * Priorities are not currently supported. Initialising priorities	2481	=item * Priorities are not currently supported. Initialising priorities
2118	will fail and all watchers will have the same priority, even though there	2482	will fail and all watchers will have the same priority, even though there
2119	is an ev_pri field.	2483	is an ev_pri field.
2120		2484
		2485	=item * In libevent, the last base created gets the signals, in libev, the
		2486	first base created (== the default loop) gets the signals.
		2487
2121	=item * Other members are not supported.	2488	=item * Other members are not supported.
2122		2489
2123	=item * The libev emulation is I<not> ABI compatible to libevent, you need	2490	=item * The libev emulation is I<not> ABI compatible to libevent, you need
2124	to use the libev header file and library.	2491	to use the libev header file and library.
2125		2492
2126	=back	2493	=back
2127		2494
2128	=head1 C++ SUPPORT	2495	=head1 C++ SUPPORT
2129		2496
2130	Libev comes with some simplistic wrapper classes for C++ that mainly allow	2497	Libev comes with some simplistic wrapper classes for C++ that mainly allow
2131	you to use some convinience methods to start/stop watchers and also change	2498	you to use some convenience methods to start/stop watchers and also change
2132	the callback model to a model using method callbacks on objects.	2499	the callback model to a model using method callbacks on objects.
2133		2500
2134	To use it,	2501	To use it,
2135		2502
2136	#include <ev++.h>	2503	#include <ev++.h>
2137		2504
2138	This automatically includes F<ev.h> and puts all of its definitions (many	2505	This automatically includes F<ev.h> and puts all of its definitions (many
2139	of them macros) into the global namespace. All C++ specific things are	2506	of them macros) into the global namespace. All C++ specific things are
2140	put into the C<ev> namespace. It should support all the same embedding	2507	put into the C<ev> namespace. It should support all the same embedding
2141	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.	2508	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
…		…
2208	your compiler is good :), then the method will be fully inlined into the	2575	your compiler is good :), then the method will be fully inlined into the
2209	thunking function, making it as fast as a direct C callback.	2576	thunking function, making it as fast as a direct C callback.
2210		2577
2211	Example: simple class declaration and watcher initialisation	2578	Example: simple class declaration and watcher initialisation
2212		2579
2213	struct myclass	2580	struct myclass
2214	{	2581	{
2215	void io_cb (ev::io &w, int revents) { }	2582	void io_cb (ev::io &w, int revents) { }
2216	}	2583	}
2217		2584
2218	myclass obj;	2585	myclass obj;
2219	ev::io iow;	2586	ev::io iow;
2220	iow.set <myclass, &myclass::io_cb> (&obj);	2587	iow.set <myclass, &myclass::io_cb> (&obj);
2221		2588
2222	=item w->set<function> (void *data = 0)	2589	=item w->set<function> (void *data = 0)
2223		2590
2224	Also sets a callback, but uses a static method or plain function as	2591	Also sets a callback, but uses a static method or plain function as
2225	callback. The optional C<data> argument will be stored in the watcher's	2592	callback. The optional C<data> argument will be stored in the watcher's
…		…
2229		2596
2230	See the method-C<set> above for more details.	2597	See the method-C<set> above for more details.
2231		2598
2232	Example:	2599	Example:
2233		2600
2234	static void io_cb (ev::io &w, int revents) { }	2601	static void io_cb (ev::io &w, int revents) { }
2235	iow.set <io_cb> ();	2602	iow.set <io_cb> ();
2236		2603
2237	=item w->set (struct ev_loop *)	2604	=item w->set (struct ev_loop *)
2238		2605
2239	Associates a different C<struct ev_loop> with this watcher. You can only	2606	Associates a different C<struct ev_loop> with this watcher. You can only
2240	do this when the watcher is inactive (and not pending either).	2607	do this when the watcher is inactive (and not pending either).
2241		2608
2242	=item w->set ([args])	2609	=item w->set ([arguments])
2243		2610
2244	Basically the same as C<ev_TYPE_set>, with the same args. Must be	2611	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2245	called at least once. Unlike the C counterpart, an active watcher gets	2612	called at least once. Unlike the C counterpart, an active watcher gets
2246	automatically stopped and restarted when reconfiguring it with this	2613	automatically stopped and restarted when reconfiguring it with this
2247	method.	2614	method.
2248		2615
2249	=item w->start ()	2616	=item w->start ()
…		…
2273	=back	2640	=back
2274		2641
2275	Example: Define a class with an IO and idle watcher, start one of them in	2642	Example: Define a class with an IO and idle watcher, start one of them in
2276	the constructor.	2643	the constructor.
2277		2644
2278	class myclass	2645	class myclass
2279	{	2646	{
2280	ev_io io; void io_cb (ev::io &w, int revents);	2647	ev::io io; void io_cb (ev::io &w, int revents);
2281	ev_idle idle void idle_cb (ev::idle &w, int revents);	2648	ev:idle idle void idle_cb (ev::idle &w, int revents);
2282		2649
2283	myclass ();	2650	myclass (int fd)
2284	}	2651	{
2285
2286	myclass::myclass (int fd)
2287	{
2288	io .set <myclass, &myclass::io_cb > (this);	2652	io .set <myclass, &myclass::io_cb > (this);
2289	idle.set <myclass, &myclass::idle_cb> (this);	2653	idle.set <myclass, &myclass::idle_cb> (this);
2290		2654
2291	io.start (fd, ev::READ);	2655	io.start (fd, ev::READ);
		2656	}
2292	}	2657	};
		2658
		2659
		2660	=head1 OTHER LANGUAGE BINDINGS
		2661
		2662	Libev does not offer other language bindings itself, but bindings for a
		2663	number of languages exist in the form of third-party packages. If you know
		2664	any interesting language binding in addition to the ones listed here, drop
		2665	me a note.
		2666
		2667	=over 4
		2668
		2669	=item Perl
		2670
		2671	The EV module implements the full libev API and is actually used to test
		2672	libev. EV is developed together with libev. Apart from the EV core module,
		2673	there are additional modules that implement libev-compatible interfaces
		2674	to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the
		2675	C<libglib> event core (C<Glib::EV> and C<EV::Glib>).
		2676
		2677	It can be found and installed via CPAN, its homepage is at
		2678	L<http://software.schmorp.de/pkg/EV>.
		2679
		2680	=item Python
		2681
		2682	Python bindings can be found at L<http://code.google.com/p/pyev/>. It
		2683	seems to be quite complete and well-documented. Note, however, that the
		2684	patch they require for libev is outright dangerous as it breaks the ABI
		2685	for everybody else, and therefore, should never be applied in an installed
		2686	libev (if python requires an incompatible ABI then it needs to embed
		2687	libev).
		2688
		2689	=item Ruby
		2690
		2691	Tony Arcieri has written a ruby extension that offers access to a subset
		2692	of the libev API and adds file handle abstractions, asynchronous DNS and
		2693	more on top of it. It can be found via gem servers. Its homepage is at
		2694	L<http://rev.rubyforge.org/>.
		2695
		2696	=item D
		2697
		2698	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
		2699	be found at L<http://proj.llucax.com.ar/wiki/evd>.
		2700
		2701	=back
2293		2702
2294		2703
2295	=head1 MACRO MAGIC	2704	=head1 MACRO MAGIC
2296		2705
2297	Libev can be compiled with a variety of options, the most fundamantal	2706	Libev can be compiled with a variety of options, the most fundamental
2298	of which is C<EV_MULTIPLICITY>. This option determines whether (most)	2707	of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2299	functions and callbacks have an initial C<struct ev_loop *> argument.	2708	functions and callbacks have an initial C<struct ev_loop *> argument.
2300		2709
2301	To make it easier to write programs that cope with either variant, the	2710	To make it easier to write programs that cope with either variant, the
2302	following macros are defined:	2711	following macros are defined:
…		…
2307		2716
2308	This provides the loop I<argument> for functions, if one is required ("ev	2717	This provides the loop I<argument> for functions, if one is required ("ev
2309	loop argument"). The C<EV_A> form is used when this is the sole argument,	2718	loop argument"). The C<EV_A> form is used when this is the sole argument,
2310	C<EV_A_> is used when other arguments are following. Example:	2719	C<EV_A_> is used when other arguments are following. Example:
2311		2720
2312	ev_unref (EV_A);	2721	ev_unref (EV_A);
2313	ev_timer_add (EV_A_ watcher);	2722	ev_timer_add (EV_A_ watcher);
2314	ev_loop (EV_A_ 0);	2723	ev_loop (EV_A_ 0);
2315		2724
2316	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	2725	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2317	which is often provided by the following macro.	2726	which is often provided by the following macro.
2318		2727
2319	=item C<EV_P>, C<EV_P_>	2728	=item C<EV_P>, C<EV_P_>
2320		2729
2321	This provides the loop I<parameter> for functions, if one is required ("ev	2730	This provides the loop I<parameter> for functions, if one is required ("ev
2322	loop parameter"). The C<EV_P> form is used when this is the sole parameter,	2731	loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2323	C<EV_P_> is used when other parameters are following. Example:	2732	C<EV_P_> is used when other parameters are following. Example:
2324		2733
2325	// this is how ev_unref is being declared	2734	// this is how ev_unref is being declared
2326	static void ev_unref (EV_P);	2735	static void ev_unref (EV_P);
2327		2736
2328	// this is how you can declare your typical callback	2737	// this is how you can declare your typical callback
2329	static void cb (EV_P_ ev_timer *w, int revents)	2738	static void cb (EV_P_ ev_timer *w, int revents)
2330		2739
2331	It declares a parameter C<loop> of type C<struct ev_loop *>, quite	2740	It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2332	suitable for use with C<EV_A>.	2741	suitable for use with C<EV_A>.
2333		2742
2334	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	2743	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2335		2744
2336	Similar to the other two macros, this gives you the value of the default	2745	Similar to the other two macros, this gives you the value of the default
2337	loop, if multiple loops are supported ("ev loop default").	2746	loop, if multiple loops are supported ("ev loop default").
		2747
		2748	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
		2749
		2750	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
		2751	default loop has been initialised (C<UC> == unchecked). Their behaviour
		2752	is undefined when the default loop has not been initialised by a previous
		2753	execution of C<EV_DEFAULT>, C<EV_DEFAULT_> or C<ev_default_init (...)>.
		2754
		2755	It is often prudent to use C<EV_DEFAULT> when initialising the first
		2756	watcher in a function but use C<EV_DEFAULT_UC> afterwards.
2338		2757
2339	=back	2758	=back
2340		2759
2341	Example: Declare and initialise a check watcher, utilising the above	2760	Example: Declare and initialise a check watcher, utilising the above
2342	macros so it will work regardless of whether multiple loops are supported	2761	macros so it will work regardless of whether multiple loops are supported
2343	or not.	2762	or not.
2344		2763
2345	static void	2764	static void
2346	check_cb (EV_P_ ev_timer *w, int revents)	2765	check_cb (EV_P_ ev_timer *w, int revents)
2347	{	2766	{
2348	ev_check_stop (EV_A_ w);	2767	ev_check_stop (EV_A_ w);
2349	}	2768	}
2350		2769
2351	ev_check check;	2770	ev_check check;
2352	ev_check_init (&check, check_cb);	2771	ev_check_init (&check, check_cb);
2353	ev_check_start (EV_DEFAULT_ &check);	2772	ev_check_start (EV_DEFAULT_ &check);
2354	ev_loop (EV_DEFAULT_ 0);	2773	ev_loop (EV_DEFAULT_ 0);
2355		2774
2356	=head1 EMBEDDING	2775	=head1 EMBEDDING
2357		2776
2358	Libev can (and often is) directly embedded into host	2777	Libev can (and often is) directly embedded into host
2359	applications. Examples of applications that embed it include the Deliantra	2778	applications. Examples of applications that embed it include the Deliantra
…		…
2366	libev somewhere in your source tree).	2785	libev somewhere in your source tree).
2367		2786
2368	=head2 FILESETS	2787	=head2 FILESETS
2369		2788
2370	Depending on what features you need you need to include one or more sets of files	2789	Depending on what features you need you need to include one or more sets of files
2371	in your app.	2790	in your application.
2372		2791
2373	=head3 CORE EVENT LOOP	2792	=head3 CORE EVENT LOOP
2374		2793
2375	To include only the libev core (all the C<ev_*> functions), with manual	2794	To include only the libev core (all the C<ev_*> functions), with manual
2376	configuration (no autoconf):	2795	configuration (no autoconf):
2377		2796
2378	#define EV_STANDALONE 1	2797	#define EV_STANDALONE 1
2379	#include "ev.c"	2798	#include "ev.c"
2380		2799
2381	This will automatically include F<ev.h>, too, and should be done in a	2800	This will automatically include F<ev.h>, too, and should be done in a
2382	single C source file only to provide the function implementations. To use	2801	single C source file only to provide the function implementations. To use
2383	it, do the same for F<ev.h> in all files wishing to use this API (best	2802	it, do the same for F<ev.h> in all files wishing to use this API (best
2384	done by writing a wrapper around F<ev.h> that you can include instead and	2803	done by writing a wrapper around F<ev.h> that you can include instead and
2385	where you can put other configuration options):	2804	where you can put other configuration options):
2386		2805
2387	#define EV_STANDALONE 1	2806	#define EV_STANDALONE 1
2388	#include "ev.h"	2807	#include "ev.h"
2389		2808
2390	Both header files and implementation files can be compiled with a C++	2809	Both header files and implementation files can be compiled with a C++
2391	compiler (at least, thats a stated goal, and breakage will be treated	2810	compiler (at least, thats a stated goal, and breakage will be treated
2392	as a bug).	2811	as a bug).
2393		2812
2394	You need the following files in your source tree, or in a directory	2813	You need the following files in your source tree, or in a directory
2395	in your include path (e.g. in libev/ when using -Ilibev):	2814	in your include path (e.g. in libev/ when using -Ilibev):
2396		2815
2397	ev.h	2816	ev.h
2398	ev.c	2817	ev.c
2399	ev_vars.h	2818	ev_vars.h
2400	ev_wrap.h	2819	ev_wrap.h
2401		2820
2402	ev_win32.c required on win32 platforms only	2821	ev_win32.c required on win32 platforms only
2403		2822
2404	ev_select.c only when select backend is enabled (which is enabled by default)	2823	ev_select.c only when select backend is enabled (which is enabled by default)
2405	ev_poll.c only when poll backend is enabled (disabled by default)	2824	ev_poll.c only when poll backend is enabled (disabled by default)
2406	ev_epoll.c only when the epoll backend is enabled (disabled by default)	2825	ev_epoll.c only when the epoll backend is enabled (disabled by default)
2407	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	2826	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2408	ev_port.c only when the solaris port backend is enabled (disabled by default)	2827	ev_port.c only when the solaris port backend is enabled (disabled by default)
2409		2828
2410	F<ev.c> includes the backend files directly when enabled, so you only need	2829	F<ev.c> includes the backend files directly when enabled, so you only need
2411	to compile this single file.	2830	to compile this single file.
2412		2831
2413	=head3 LIBEVENT COMPATIBILITY API	2832	=head3 LIBEVENT COMPATIBILITY API
2414		2833
2415	To include the libevent compatibility API, also include:	2834	To include the libevent compatibility API, also include:
2416		2835
2417	#include "event.c"	2836	#include "event.c"
2418		2837
2419	in the file including F<ev.c>, and:	2838	in the file including F<ev.c>, and:
2420		2839
2421	#include "event.h"	2840	#include "event.h"
2422		2841
2423	in the files that want to use the libevent API. This also includes F<ev.h>.	2842	in the files that want to use the libevent API. This also includes F<ev.h>.
2424		2843
2425	You need the following additional files for this:	2844	You need the following additional files for this:
2426		2845
2427	event.h	2846	event.h
2428	event.c	2847	event.c
2429		2848
2430	=head3 AUTOCONF SUPPORT	2849	=head3 AUTOCONF SUPPORT
2431		2850
2432	Instead of using C<EV_STANDALONE=1> and providing your config in	2851	Instead of using C<EV_STANDALONE=1> and providing your configuration in
2433	whatever way you want, you can also C<m4_include([libev.m4])> in your	2852	whatever way you want, you can also C<m4_include([libev.m4])> in your
2434	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then	2853	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2435	include F<config.h> and configure itself accordingly.	2854	include F<config.h> and configure itself accordingly.
2436		2855
2437	For this of course you need the m4 file:	2856	For this of course you need the m4 file:
2438		2857
2439	libev.m4	2858	libev.m4
2440		2859
2441	=head2 PREPROCESSOR SYMBOLS/MACROS	2860	=head2 PREPROCESSOR SYMBOLS/MACROS
2442		2861
2443	Libev can be configured via a variety of preprocessor symbols you have to define	2862	Libev can be configured via a variety of preprocessor symbols you have to
2444	before including any of its files. The default is not to build for multiplicity	2863	define before including any of its files. The default in the absence of
2445	and only include the select backend.	2864	autoconf is noted for every option.
2446		2865
2447	=over 4	2866	=over 4
2448		2867
2449	=item EV_STANDALONE	2868	=item EV_STANDALONE
2450		2869
…		…
2455	F<event.h> that are not directly supported by the libev core alone.	2874	F<event.h> that are not directly supported by the libev core alone.
2456		2875
2457	=item EV_USE_MONOTONIC	2876	=item EV_USE_MONOTONIC
2458		2877
2459	If defined to be C<1>, libev will try to detect the availability of the	2878	If defined to be C<1>, libev will try to detect the availability of the
2460	monotonic clock option at both compiletime and runtime. Otherwise no use	2879	monotonic clock option at both compile time and runtime. Otherwise no use
2461	of the monotonic clock option will be attempted. If you enable this, you	2880	of the monotonic clock option will be attempted. If you enable this, you
2462	usually have to link against librt or something similar. Enabling it when	2881	usually have to link against librt or something similar. Enabling it when
2463	the functionality isn't available is safe, though, although you have	2882	the functionality isn't available is safe, though, although you have
2464	to make sure you link against any libraries where the C<clock_gettime>	2883	to make sure you link against any libraries where the C<clock_gettime>
2465	function is hiding in (often F<-lrt>).	2884	function is hiding in (often F<-lrt>).
2466		2885
2467	=item EV_USE_REALTIME	2886	=item EV_USE_REALTIME
2468		2887
2469	If defined to be C<1>, libev will try to detect the availability of the	2888	If defined to be C<1>, libev will try to detect the availability of the
2470	realtime clock option at compiletime (and assume its availability at	2889	real-time clock option at compile time (and assume its availability at
2471	runtime if successful). Otherwise no use of the realtime clock option will	2890	runtime if successful). Otherwise no use of the real-time clock option will
2472	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	2891	be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2473	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the	2892	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2474	note about libraries in the description of C<EV_USE_MONOTONIC>, though.	2893	note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2475		2894
2476	=item EV_USE_NANOSLEEP	2895	=item EV_USE_NANOSLEEP
2477		2896
2478	If defined to be C<1>, libev will assume that C<nanosleep ()> is available	2897	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2479	and will use it for delays. Otherwise it will use C<select ()>.	2898	and will use it for delays. Otherwise it will use C<select ()>.
2480		2899
		2900	=item EV_USE_EVENTFD
		2901
		2902	If defined to be C<1>, then libev will assume that C<eventfd ()> is
		2903	available and will probe for kernel support at runtime. This will improve
		2904	C<ev_signal> and C<ev_async> performance and reduce resource consumption.
		2905	If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
		2906	2.7 or newer, otherwise disabled.
		2907
2481	=item EV_USE_SELECT	2908	=item EV_USE_SELECT
2482		2909
2483	If undefined or defined to be C<1>, libev will compile in support for the	2910	If undefined or defined to be C<1>, libev will compile in support for the
2484	C<select>(2) backend. No attempt at autodetection will be done: if no	2911	C<select>(2) backend. No attempt at auto-detection will be done: if no
2485	other method takes over, select will be it. Otherwise the select backend	2912	other method takes over, select will be it. Otherwise the select backend
2486	will not be compiled in.	2913	will not be compiled in.
2487		2914
2488	=item EV_SELECT_USE_FD_SET	2915	=item EV_SELECT_USE_FD_SET
2489		2916
2490	If defined to C<1>, then the select backend will use the system C<fd_set>	2917	If defined to C<1>, then the select backend will use the system C<fd_set>
2491	structure. This is useful if libev doesn't compile due to a missing	2918	structure. This is useful if libev doesn't compile due to a missing
2492	C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on	2919	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2493	exotic systems. This usually limits the range of file descriptors to some	2920	exotic systems. This usually limits the range of file descriptors to some
2494	low limit such as 1024 or might have other limitations (winsocket only	2921	low limit such as 1024 or might have other limitations (winsocket only
2495	allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might	2922	allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2496	influence the size of the C<fd_set> used.	2923	influence the size of the C<fd_set> used.
2497		2924
…		…
2521		2948
2522	=item EV_USE_EPOLL	2949	=item EV_USE_EPOLL
2523		2950
2524	If defined to be C<1>, libev will compile in support for the Linux	2951	If defined to be C<1>, libev will compile in support for the Linux
2525	C<epoll>(7) backend. Its availability will be detected at runtime,	2952	C<epoll>(7) backend. Its availability will be detected at runtime,
2526	otherwise another method will be used as fallback. This is the	2953	otherwise another method will be used as fallback. This is the preferred
2527	preferred backend for GNU/Linux systems.	2954	backend for GNU/Linux systems. If undefined, it will be enabled if the
		2955	headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2528		2956
2529	=item EV_USE_KQUEUE	2957	=item EV_USE_KQUEUE
2530		2958
2531	If defined to be C<1>, libev will compile in support for the BSD style	2959	If defined to be C<1>, libev will compile in support for the BSD style
2532	C<kqueue>(2) backend. Its actual availability will be detected at runtime,	2960	C<kqueue>(2) backend. Its actual availability will be detected at runtime,
…		…
2545	otherwise another method will be used as fallback. This is the preferred	2973	otherwise another method will be used as fallback. This is the preferred
2546	backend for Solaris 10 systems.	2974	backend for Solaris 10 systems.
2547		2975
2548	=item EV_USE_DEVPOLL	2976	=item EV_USE_DEVPOLL
2549		2977
2550	reserved for future expansion, works like the USE symbols above.	2978	Reserved for future expansion, works like the USE symbols above.
2551		2979
2552	=item EV_USE_INOTIFY	2980	=item EV_USE_INOTIFY
2553		2981
2554	If defined to be C<1>, libev will compile in support for the Linux inotify	2982	If defined to be C<1>, libev will compile in support for the Linux inotify
2555	interface to speed up C<ev_stat> watchers. Its actual availability will	2983	interface to speed up C<ev_stat> watchers. Its actual availability will
2556	be detected at runtime.	2984	be detected at runtime. If undefined, it will be enabled if the headers
		2985	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
		2986
		2987	=item EV_ATOMIC_T
		2988
		2989	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
		2990	access is atomic with respect to other threads or signal contexts. No such
		2991	type is easily found in the C language, so you can provide your own type
		2992	that you know is safe for your purposes. It is used both for signal handler "locking"
		2993	as well as for signal and thread safety in C<ev_async> watchers.
		2994
		2995	In the absence of this define, libev will use C<sig_atomic_t volatile>
		2996	(from F<signal.h>), which is usually good enough on most platforms.
2557		2997
2558	=item EV_H	2998	=item EV_H
2559		2999
2560	The name of the F<ev.h> header file used to include it. The default if	3000	The name of the F<ev.h> header file used to include it. The default if
2561	undefined is C<"ev.h"> in F<event.h> and F<ev.c>. This can be used to	3001	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2562	virtually rename the F<ev.h> header file in case of conflicts.	3002	used to virtually rename the F<ev.h> header file in case of conflicts.
2563		3003
2564	=item EV_CONFIG_H	3004	=item EV_CONFIG_H
2565		3005
2566	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override	3006	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2567	F<ev.c>'s idea of where to find the F<config.h> file, similarly to	3007	F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2568	C<EV_H>, above.	3008	C<EV_H>, above.
2569		3009
2570	=item EV_EVENT_H	3010	=item EV_EVENT_H
2571		3011
2572	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea	3012	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2573	of how the F<event.h> header can be found, the dfeault is C<"event.h">.	3013	of how the F<event.h> header can be found, the default is C<"event.h">.
2574		3014
2575	=item EV_PROTOTYPES	3015	=item EV_PROTOTYPES
2576		3016
2577	If defined to be C<0>, then F<ev.h> will not define any function	3017	If defined to be C<0>, then F<ev.h> will not define any function
2578	prototypes, but still define all the structs and other symbols. This is	3018	prototypes, but still define all the structs and other symbols. This is
…		…
2599	When doing priority-based operations, libev usually has to linearly search	3039	When doing priority-based operations, libev usually has to linearly search
2600	all the priorities, so having many of them (hundreds) uses a lot of space	3040	all the priorities, so having many of them (hundreds) uses a lot of space
2601	and time, so using the defaults of five priorities (-2 .. +2) is usually	3041	and time, so using the defaults of five priorities (-2 .. +2) is usually
2602	fine.	3042	fine.
2603		3043
2604	If your embedding app does not need any priorities, defining these both to	3044	If your embedding application does not need any priorities, defining these both to
2605	C<0> will save some memory and cpu.	3045	C<0> will save some memory and CPU.
2606		3046
2607	=item EV_PERIODIC_ENABLE	3047	=item EV_PERIODIC_ENABLE
2608		3048
2609	If undefined or defined to be C<1>, then periodic timers are supported. If	3049	If undefined or defined to be C<1>, then periodic timers are supported. If
2610	defined to be C<0>, then they are not. Disabling them saves a few kB of	3050	defined to be C<0>, then they are not. Disabling them saves a few kB of
…		…
2629	=item EV_FORK_ENABLE	3069	=item EV_FORK_ENABLE
2630		3070
2631	If undefined or defined to be C<1>, then fork watchers are supported. If	3071	If undefined or defined to be C<1>, then fork watchers are supported. If
2632	defined to be C<0>, then they are not.	3072	defined to be C<0>, then they are not.
2633		3073
		3074	=item EV_ASYNC_ENABLE
		3075
		3076	If undefined or defined to be C<1>, then async watchers are supported. If
		3077	defined to be C<0>, then they are not.
		3078
2634	=item EV_MINIMAL	3079	=item EV_MINIMAL
2635		3080
2636	If you need to shave off some kilobytes of code at the expense of some	3081	If you need to shave off some kilobytes of code at the expense of some
2637	speed, define this symbol to C<1>. Currently only used for gcc to override	3082	speed, define this symbol to C<1>. Currently this is used to override some
2638	some inlining decisions, saves roughly 30% codesize of amd64.	3083	inlining decisions, saves roughly 30% code size on amd64. It also selects a
		3084	much smaller 2-heap for timer management over the default 4-heap.
2639		3085
2640	=item EV_PID_HASHSIZE	3086	=item EV_PID_HASHSIZE
2641		3087
2642	C<ev_child> watchers use a small hash table to distribute workload by	3088	C<ev_child> watchers use a small hash table to distribute workload by
2643	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	3089	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
…		…
2650	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	3096	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2651	usually more than enough. If you need to manage thousands of C<ev_stat>	3097	usually more than enough. If you need to manage thousands of C<ev_stat>
2652	watchers you might want to increase this value (I<must> be a power of	3098	watchers you might want to increase this value (I<must> be a power of
2653	two).	3099	two).
2654		3100
		3101	=item EV_USE_4HEAP
		3102
		3103	Heaps are not very cache-efficient. To improve the cache-efficiency of the
		3104	timer and periodics heap, libev uses a 4-heap when this symbol is defined
		3105	to C<1>. The 4-heap uses more complicated (longer) code but has
		3106	noticeably faster performance with many (thousands) of watchers.
		3107
		3108	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
		3109	(disabled).
		3110
		3111	=item EV_HEAP_CACHE_AT
		3112
		3113	Heaps are not very cache-efficient. To improve the cache-efficiency of the
		3114	timer and periodics heap, libev can cache the timestamp (I<at>) within
		3115	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
		3116	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
		3117	but avoids random read accesses on heap changes. This improves performance
		3118	noticeably with with many (hundreds) of watchers.
		3119
		3120	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
		3121	(disabled).
		3122
		3123	=item EV_VERIFY
		3124
		3125	Controls how much internal verification (see C<ev_loop_verify ()>) will
		3126	be done: If set to C<0>, no internal verification code will be compiled
		3127	in. If set to C<1>, then verification code will be compiled in, but not
		3128	called. If set to C<2>, then the internal verification code will be
		3129	called once per loop, which can slow down libev. If set to C<3>, then the
		3130	verification code will be called very frequently, which will slow down
		3131	libev considerably.
		3132
		3133	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
		3134	C<0.>
		3135
2655	=item EV_COMMON	3136	=item EV_COMMON
2656		3137
2657	By default, all watchers have a C<void *data> member. By redefining	3138	By default, all watchers have a C<void *data> member. By redefining
2658	this macro to a something else you can include more and other types of	3139	this macro to a something else you can include more and other types of
2659	members. You have to define it each time you include one of the files,	3140	members. You have to define it each time you include one of the files,
2660	though, and it must be identical each time.	3141	though, and it must be identical each time.
2661		3142
2662	For example, the perl EV module uses something like this:	3143	For example, the perl EV module uses something like this:
2663		3144
2664	#define EV_COMMON \	3145	#define EV_COMMON \
2665	SV *self; /* contains this struct */ \	3146	SV *self; /* contains this struct */ \
2666	SV *cb_sv, *fh /* note no trailing ";" */	3147	SV *cb_sv, *fh /* note no trailing ";" */
2667		3148
2668	=item EV_CB_DECLARE (type)	3149	=item EV_CB_DECLARE (type)
2669		3150
2670	=item EV_CB_INVOKE (watcher, revents)	3151	=item EV_CB_INVOKE (watcher, revents)
2671		3152
…		…
2678	avoid the C<struct ev_loop *> as first argument in all cases, or to use	3159	avoid the C<struct ev_loop *> as first argument in all cases, or to use
2679	method calls instead of plain function calls in C++.	3160	method calls instead of plain function calls in C++.
2680		3161
2681	=head2 EXPORTED API SYMBOLS	3162	=head2 EXPORTED API SYMBOLS
2682		3163
2683	If you need to re-export the API (e.g. via a dll) and you need a list of	3164	If you need to re-export the API (e.g. via a DLL) and you need a list of
2684	exported symbols, you can use the provided F<Symbol.*> files which list	3165	exported symbols, you can use the provided F<Symbol.*> files which list
2685	all public symbols, one per line:	3166	all public symbols, one per line:
2686		3167
2687	Symbols.ev for libev proper	3168	Symbols.ev for libev proper
2688	Symbols.event for the libevent emulation	3169	Symbols.event for the libevent emulation
2689		3170
2690	This can also be used to rename all public symbols to avoid clashes with	3171	This can also be used to rename all public symbols to avoid clashes with
2691	multiple versions of libev linked together (which is obviously bad in	3172	multiple versions of libev linked together (which is obviously bad in
2692	itself, but sometimes it is inconvinient to avoid this).	3173	itself, but sometimes it is inconvenient to avoid this).
2693		3174
2694	A sed command like this will create wrapper C<#define>'s that you need to	3175	A sed command like this will create wrapper C<#define>'s that you need to
2695	include before including F<ev.h>:	3176	include before including F<ev.h>:
2696		3177
2697	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h	3178	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
…		…
2714	file.	3195	file.
2715		3196
2716	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	3197	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2717	that everybody includes and which overrides some configure choices:	3198	that everybody includes and which overrides some configure choices:
2718		3199
2719	#define EV_MINIMAL 1	3200	#define EV_MINIMAL 1
2720	#define EV_USE_POLL 0	3201	#define EV_USE_POLL 0
2721	#define EV_MULTIPLICITY 0	3202	#define EV_MULTIPLICITY 0
2722	#define EV_PERIODIC_ENABLE 0	3203	#define EV_PERIODIC_ENABLE 0
2723	#define EV_STAT_ENABLE 0	3204	#define EV_STAT_ENABLE 0
2724	#define EV_FORK_ENABLE 0	3205	#define EV_FORK_ENABLE 0
2725	#define EV_CONFIG_H <config.h>	3206	#define EV_CONFIG_H <config.h>
2726	#define EV_MINPRI 0	3207	#define EV_MINPRI 0
2727	#define EV_MAXPRI 0	3208	#define EV_MAXPRI 0
2728		3209
2729	#include "ev++.h"	3210	#include "ev++.h"
2730		3211
2731	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	3212	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2732		3213
2733	#include "ev_cpp.h"	3214	#include "ev_cpp.h"
2734	#include "ev.c"	3215	#include "ev.c"
		3216
		3217
		3218	=head1 THREADS AND COROUTINES
		3219
		3220	=head2 THREADS
		3221
		3222	Libev itself is completely thread-safe, but it uses no locking. This
		3223	means that you can use as many loops as you want in parallel, as long as
		3224	only one thread ever calls into one libev function with the same loop
		3225	parameter.
		3226
		3227	Or put differently: calls with different loop parameters can be done in
		3228	parallel from multiple threads, calls with the same loop parameter must be
		3229	done serially (but can be done from different threads, as long as only one
		3230	thread ever is inside a call at any point in time, e.g. by using a mutex
		3231	per loop).
		3232
		3233	If you want to know which design (one loop, locking, or multiple loops
		3234	without or something else still) is best for your problem, then I cannot
		3235	help you. I can give some generic advice however:
		3236
		3237	=over 4
		3238
		3239	=item * most applications have a main thread: use the default libev loop
		3240	in that thread, or create a separate thread running only the default loop.
		3241
		3242	This helps integrating other libraries or software modules that use libev
		3243	themselves and don't care/know about threading.
		3244
		3245	=item * one loop per thread is usually a good model.
		3246
		3247	Doing this is almost never wrong, sometimes a better-performance model
		3248	exists, but it is always a good start.
		3249
		3250	=item * other models exist, such as the leader/follower pattern, where one
		3251	loop is handed through multiple threads in a kind of round-robin fashion.
		3252
		3253	Choosing a model is hard - look around, learn, know that usually you can do
		3254	better than you currently do :-)
		3255
		3256	=item * often you need to talk to some other thread which blocks in the
		3257	event loop - C<ev_async> watchers can be used to wake them up from other
		3258	threads safely (or from signal contexts...).
		3259
		3260	=back
		3261
		3262	=head2 COROUTINES
		3263
		3264	Libev is much more accommodating to coroutines ("cooperative threads"):
		3265	libev fully supports nesting calls to it's functions from different
		3266	coroutines (e.g. you can call C<ev_loop> on the same loop from two
		3267	different coroutines and switch freely between both coroutines running the
		3268	loop, as long as you don't confuse yourself). The only exception is that
		3269	you must not do this from C<ev_periodic> reschedule callbacks.
		3270
		3271	Care has been invested into making sure that libev does not keep local
		3272	state inside C<ev_loop>, and other calls do not usually allow coroutine
		3273	switches.
2735		3274
2736		3275
2737	=head1 COMPLEXITIES	3276	=head1 COMPLEXITIES
2738		3277
2739	In this section the complexities of (many of) the algorithms used inside	3278	In this section the complexities of (many of) the algorithms used inside
…		…
2757	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)	3296	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2758		3297
2759	That means that changing a timer costs less than removing/adding them	3298	That means that changing a timer costs less than removing/adding them
2760	as only the relative motion in the event queue has to be paid for.	3299	as only the relative motion in the event queue has to be paid for.
2761		3300
2762	=item Starting io/check/prepare/idle/signal/child watchers: O(1)	3301	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2763		3302
2764	These just add the watcher into an array or at the head of a list.	3303	These just add the watcher into an array or at the head of a list.
2765		3304
2766	=item Stopping check/prepare/idle watchers: O(1)	3305	=item Stopping check/prepare/idle/fork/async watchers: O(1)
2767		3306
2768	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	3307	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2769		3308
2770	These watchers are stored in lists then need to be walked to find the	3309	These watchers are stored in lists then need to be walked to find the
2771	correct watcher to remove. The lists are usually short (you don't usually	3310	correct watcher to remove. The lists are usually short (you don't usually
2772	have many watchers waiting for the same fd or signal).	3311	have many watchers waiting for the same fd or signal).
2773		3312
2774	=item Finding the next timer in each loop iteration: O(1)	3313	=item Finding the next timer in each loop iteration: O(1)
2775		3314
2776	By virtue of using a binary heap, the next timer is always found at the	3315	By virtue of using a binary or 4-heap, the next timer is always found at a
2777	beginning of the storage array.	3316	fixed position in the storage array.
2778		3317
2779	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)	3318	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2780		3319
2781	A change means an I/O watcher gets started or stopped, which requires	3320	A change means an I/O watcher gets started or stopped, which requires
2782	libev to recalculate its status (and possibly tell the kernel, depending	3321	libev to recalculate its status (and possibly tell the kernel, depending
2783	on backend and wether C<ev_io_set> was used).	3322	on backend and whether C<ev_io_set> was used).
2784		3323
2785	=item Activating one watcher (putting it into the pending state): O(1)	3324	=item Activating one watcher (putting it into the pending state): O(1)
2786		3325
2787	=item Priority handling: O(number_of_priorities)	3326	=item Priority handling: O(number_of_priorities)
2788		3327
2789	Priorities are implemented by allocating some space for each	3328	Priorities are implemented by allocating some space for each
2790	priority. When doing priority-based operations, libev usually has to	3329	priority. When doing priority-based operations, libev usually has to
2791	linearly search all the priorities, but starting/stopping and activating	3330	linearly search all the priorities, but starting/stopping and activating
2792	watchers becomes O(1) w.r.t. prioritiy handling.	3331	watchers becomes O(1) w.r.t. priority handling.
		3332
		3333	=item Sending an ev_async: O(1)
		3334
		3335	=item Processing ev_async_send: O(number_of_async_watchers)
		3336
		3337	=item Processing signals: O(max_signal_number)
		3338
		3339	Sending involves a system call I<iff> there were no other C<ev_async_send>
		3340	calls in the current loop iteration. Checking for async and signal events
		3341	involves iterating over all running async watchers or all signal numbers.
2793		3342
2794	=back	3343	=back
2795		3344
2796		3345
2797	=head1 Win32 platform limitations and workarounds	3346	=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
2798		3347
2799	Win32 doesn't support any of the standards (e.g. POSIX) that libev	3348	Win32 doesn't support any of the standards (e.g. POSIX) that libev
2800	requires, and its I/O model is fundamentally incompatible with the POSIX	3349	requires, and its I/O model is fundamentally incompatible with the POSIX
2801	model. Libev still offers limited functionality on this platform in	3350	model. Libev still offers limited functionality on this platform in
2802	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	3351	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2803	descriptors. This only applies when using Win32 natively, not when using	3352	descriptors. This only applies when using Win32 natively, not when using
2804	e.g. cygwin.	3353	e.g. cygwin.
2805		3354
		3355	Lifting these limitations would basically require the full
		3356	re-implementation of the I/O system. If you are into these kinds of
		3357	things, then note that glib does exactly that for you in a very portable
		3358	way (note also that glib is the slowest event library known to man).
		3359
2806	There is no supported compilation method available on windows except	3360	There is no supported compilation method available on windows except
2807	embedding it into other applications.	3361	embedding it into other applications.
2808		3362
		3363	Not a libev limitation but worth mentioning: windows apparently doesn't
		3364	accept large writes: instead of resulting in a partial write, windows will
		3365	either accept everything or return C<ENOBUFS> if the buffer is too large,
		3366	so make sure you only write small amounts into your sockets (less than a
		3367	megabyte seems safe, but thsi apparently depends on the amount of memory
		3368	available).
		3369
2809	Due to the many, low, and arbitrary limits on the win32 platform and the	3370	Due to the many, low, and arbitrary limits on the win32 platform and
2810	abysmal performance of winsockets, using a large number of sockets is not	3371	the abysmal performance of winsockets, using a large number of sockets
2811	recommended (and not reasonable). If your program needs to use more than	3372	is not recommended (and not reasonable). If your program needs to use
2812	a hundred or so sockets, then likely it needs to use a totally different	3373	more than a hundred or so sockets, then likely it needs to use a totally
2813	implementation for windows, as libev offers the POSIX model, which cannot	3374	different implementation for windows, as libev offers the POSIX readiness
2814	be implemented efficiently on windows (microsoft monopoly games).	3375	notification model, which cannot be implemented efficiently on windows
		3376	(Microsoft monopoly games).
		3377
		3378	A typical way to use libev under windows is to embed it (see the embedding
		3379	section for details) and use the following F<evwrap.h> header file instead
		3380	of F<ev.h>:
		3381
		3382	#define EV_STANDALONE /* keeps ev from requiring config.h */
		3383	#define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
		3384
		3385	#include "ev.h"
		3386
		3387	And compile the following F<evwrap.c> file into your project (make sure
		3388	you do I<not> compile the F<ev.c> or any other embedded soruce files!):
		3389
		3390	#include "evwrap.h"
		3391	#include "ev.c"
2815		3392
2816	=over 4	3393	=over 4
2817		3394
2818	=item The winsocket select function	3395	=item The winsocket select function
2819		3396
2820	The winsocket C<select> function doesn't follow POSIX in that it requires	3397	The winsocket C<select> function doesn't follow POSIX in that it
2821	socket I<handles> and not socket I<file descriptors>. This makes select	3398	requires socket I<handles> and not socket I<file descriptors> (it is
2822	very inefficient, and also requires a mapping from file descriptors	3399	also extremely buggy). This makes select very inefficient, and also
2823	to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,	3400	requires a mapping from file descriptors to socket handles (the Microsoft
2824	C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor	3401	C runtime provides the function C<_open_osfhandle> for this). See the
2825	symbols for more info.	3402	discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
		3403	C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
2826		3404
2827	The configuration for a "naked" win32 using the microsoft runtime	3405	The configuration for a "naked" win32 using the Microsoft runtime
2828	libraries and raw winsocket select is:	3406	libraries and raw winsocket select is:
2829		3407
2830	#define EV_USE_SELECT 1	3408	#define EV_USE_SELECT 1
2831	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	3409	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2832		3410
2833	Note that winsockets handling of fd sets is O(n), so you can easily get a	3411	Note that winsockets handling of fd sets is O(n), so you can easily get a
2834	complexity in the O(n²) range when using win32.	3412	complexity in the O(n²) range when using win32.
2835		3413
2836	=item Limited number of file descriptors	3414	=item Limited number of file descriptors
2837		3415
2838	Windows has numerous arbitrary (and low) limits on things. Early versions	3416	Windows has numerous arbitrary (and low) limits on things.
2839	of winsocket's select only supported waiting for a max. of C<64> handles	3417
		3418	Early versions of winsocket's select only supported waiting for a maximum
2840	(probably owning to the fact that all windows kernels can only wait for	3419	of C<64> handles (probably owning to the fact that all windows kernels
2841	C<64> things at the same time internally; microsoft recommends spawning a	3420	can only wait for C<64> things at the same time internally; Microsoft
2842	chain of threads and wait for 63 handles and the previous thread in each).	3421	recommends spawning a chain of threads and wait for 63 handles and the
		3422	previous thread in each. Great).
2843		3423
2844	Newer versions support more handles, but you need to define C<FD_SETSIZE>	3424	Newer versions support more handles, but you need to define C<FD_SETSIZE>
2845	to some high number (e.g. C<2048>) before compiling the winsocket select	3425	to some high number (e.g. C<2048>) before compiling the winsocket select
2846	call (which might be in libev or elsewhere, for example, perl does its own	3426	call (which might be in libev or elsewhere, for example, perl does its own
2847	select emulation on windows).	3427	select emulation on windows).
2848		3428
2849	Another limit is the number of file descriptors in the microsoft runtime	3429	Another limit is the number of file descriptors in the Microsoft runtime
2850	libraries, which by default is C<64> (there must be a hidden I<64> fetish	3430	libraries, which by default is C<64> (there must be a hidden I<64> fetish
2851	or something like this inside microsoft). You can increase this by calling	3431	or something like this inside Microsoft). You can increase this by calling
2852	C<_setmaxstdio>, which can increase this limit to C<2048> (another	3432	C<_setmaxstdio>, which can increase this limit to C<2048> (another
2853	arbitrary limit), but is broken in many versions of the microsoft runtime	3433	arbitrary limit), but is broken in many versions of the Microsoft runtime
2854	libraries.	3434	libraries.
2855		3435
2856	This might get you to about C<512> or C<2048> sockets (depending on	3436	This might get you to about C<512> or C<2048> sockets (depending on
2857	windows version and/or the phase of the moon). To get more, you need to	3437	windows version and/or the phase of the moon). To get more, you need to
2858	wrap all I/O functions and provide your own fd management, but the cost of	3438	wrap all I/O functions and provide your own fd management, but the cost of
2859	calling select (O(n²)) will likely make this unworkable.	3439	calling select (O(n²)) will likely make this unworkable.
2860		3440
2861	=back	3441	=back
2862		3442
2863		3443
		3444	=head1 PORTABILITY REQUIREMENTS
		3445
		3446	In addition to a working ISO-C implementation, libev relies on a few
		3447	additional extensions:
		3448
		3449	=over 4
		3450
		3451	=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
		3452	calling conventions regardless of C<ev_watcher_type *>.
		3453
		3454	Libev assumes not only that all watcher pointers have the same internal
		3455	structure (guaranteed by POSIX but not by ISO C for example), but it also
		3456	assumes that the same (machine) code can be used to call any watcher
		3457	callback: The watcher callbacks have different type signatures, but libev
		3458	calls them using an C<ev_watcher *> internally.
		3459
		3460	=item C<sig_atomic_t volatile> must be thread-atomic as well
		3461
		3462	The type C<sig_atomic_t volatile> (or whatever is defined as
		3463	C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different
		3464	threads. This is not part of the specification for C<sig_atomic_t>, but is
		3465	believed to be sufficiently portable.
		3466
		3467	=item C<sigprocmask> must work in a threaded environment
		3468
		3469	Libev uses C<sigprocmask> to temporarily block signals. This is not
		3470	allowed in a threaded program (C<pthread_sigmask> has to be used). Typical
		3471	pthread implementations will either allow C<sigprocmask> in the "main
		3472	thread" or will block signals process-wide, both behaviours would
		3473	be compatible with libev. Interaction between C<sigprocmask> and
		3474	C<pthread_sigmask> could complicate things, however.
		3475
		3476	The most portable way to handle signals is to block signals in all threads
		3477	except the initial one, and run the default loop in the initial thread as
		3478	well.
		3479
		3480	=item C<long> must be large enough for common memory allocation sizes
		3481
		3482	To improve portability and simplify using libev, libev uses C<long>
		3483	internally instead of C<size_t> when allocating its data structures. On
		3484	non-POSIX systems (Microsoft...) this might be unexpectedly low, but
		3485	is still at least 31 bits everywhere, which is enough for hundreds of
		3486	millions of watchers.
		3487
		3488	=item C<double> must hold a time value in seconds with enough accuracy
		3489
		3490	The type C<double> is used to represent timestamps. It is required to
		3491	have at least 51 bits of mantissa (and 9 bits of exponent), which is good
		3492	enough for at least into the year 4000. This requirement is fulfilled by
		3493	implementations implementing IEEE 754 (basically all existing ones).
		3494
		3495	=back
		3496
		3497	If you know of other additional requirements drop me a note.
		3498
		3499
		3500	=head1 COMPILER WARNINGS
		3501
		3502	Depending on your compiler and compiler settings, you might get no or a
		3503	lot of warnings when compiling libev code. Some people are apparently
		3504	scared by this.
		3505
		3506	However, these are unavoidable for many reasons. For one, each compiler
		3507	has different warnings, and each user has different tastes regarding
		3508	warning options. "Warn-free" code therefore cannot be a goal except when
		3509	targeting a specific compiler and compiler-version.
		3510
		3511	Another reason is that some compiler warnings require elaborate
		3512	workarounds, or other changes to the code that make it less clear and less
		3513	maintainable.
		3514
		3515	And of course, some compiler warnings are just plain stupid, or simply
		3516	wrong (because they don't actually warn about the condition their message
		3517	seems to warn about).
		3518
		3519	While libev is written to generate as few warnings as possible,
		3520	"warn-free" code is not a goal, and it is recommended not to build libev
		3521	with any compiler warnings enabled unless you are prepared to cope with
		3522	them (e.g. by ignoring them). Remember that warnings are just that:
		3523	warnings, not errors, or proof of bugs.
		3524
		3525
		3526	=head1 VALGRIND
		3527
		3528	Valgrind has a special section here because it is a popular tool that is
		3529	highly useful, but valgrind reports are very hard to interpret.
		3530
		3531	If you think you found a bug (memory leak, uninitialised data access etc.)
		3532	in libev, then check twice: If valgrind reports something like:
		3533
		3534	==2274== definitely lost: 0 bytes in 0 blocks.
		3535	==2274== possibly lost: 0 bytes in 0 blocks.
		3536	==2274== still reachable: 256 bytes in 1 blocks.
		3537
		3538	Then there is no memory leak. Similarly, under some circumstances,
		3539	valgrind might report kernel bugs as if it were a bug in libev, or it
		3540	might be confused (it is a very good tool, but only a tool).
		3541
		3542	If you are unsure about something, feel free to contact the mailing list
		3543	with the full valgrind report and an explanation on why you think this is
		3544	a bug in libev. However, don't be annoyed when you get a brisk "this is
		3545	no bug" answer and take the chance of learning how to interpret valgrind
		3546	properly.
		3547
		3548	If you need, for some reason, empty reports from valgrind for your project
		3549	I suggest using suppression lists.
		3550
		3551
2864	=head1 AUTHOR	3552	=head1 AUTHOR
2865		3553
2866	Marc Lehmann <libev@schmorp.de>.	3554	Marc Lehmann <libev@schmorp.de>.
2867		3555

Diff Legend

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