ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

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

Diff Legend

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