ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.198 by root, Thu Oct 23 06:30:48 2008 UTC vs.
Revision 1.309 by root, Thu Oct 21 09:23:21 2010 UTC

…		…
9	=head2 EXAMPLE PROGRAM	9	=head2 EXAMPLE PROGRAM
10		10
11	// a single header file is required	11	// a single header file is required
12	#include <ev.h>	12	#include <ev.h>
13		13
		14	#include <stdio.h> // for puts
		15
14	// every watcher type has its own typedef'd struct	16	// every watcher type has its own typedef'd struct
15	// with the name ev_<type>	17	// with the name ev_TYPE
16	ev_io stdin_watcher;	18	ev_io stdin_watcher;
17	ev_timer timeout_watcher;	19	ev_timer timeout_watcher;
18		20
19	// all watcher callbacks have a similar signature	21	// all watcher callbacks have a similar signature
20	// this callback is called when data is readable on stdin	22	// this callback is called when data is readable on stdin
…		…
41		43
42	int	44	int
43	main (void)	45	main (void)
44	{	46	{
45	// use the default event loop unless you have special needs	47	// use the default event loop unless you have special needs
46	ev_loop *loop = ev_default_loop (0);	48	struct ev_loop *loop = ev_default_loop (0);
47		49
48	// initialise an io watcher, then start it	50	// initialise an io watcher, then start it
49	// this one will watch for stdin to become readable	51	// this one will watch for stdin to become readable
50	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);	52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
51	ev_io_start (loop, &stdin_watcher);	53	ev_io_start (loop, &stdin_watcher);
…		…
60		62
61	// unloop was called, so exit	63	// unloop was called, so exit
62	return 0;	64	return 0;
63	}	65	}
64		66
65	=head1 DESCRIPTION	67	=head1 ABOUT THIS DOCUMENT
		68
		69	This document documents the libev software package.
66		70
67	The newest version of this document is also available as an html-formatted	71	The newest version of this document is also available as an html-formatted
68	web page you might find easier to navigate when reading it for the first	72	web page you might find easier to navigate when reading it for the first
69	time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.	73	time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
		74
		75	While this document tries to be as complete as possible in documenting
		76	libev, its usage and the rationale behind its design, it is not a tutorial
		77	on event-based programming, nor will it introduce event-based programming
		78	with libev.
		79
		80	Familiarity with event based programming techniques in general is assumed
		81	throughout this document.
		82
		83	=head1 ABOUT LIBEV
70		84
71	Libev is an event loop: you register interest in certain events (such as a	85	Libev is an event loop: you register interest in certain events (such as a
72	file descriptor being readable or a timeout occurring), and it will manage	86	file descriptor being readable or a timeout occurring), and it will manage
73	these event sources and provide your program with events.	87	these event sources and provide your program with events.
74		88
…		…
84	=head2 FEATURES	98	=head2 FEATURES
85		99
86	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the	100	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
87	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms	101	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
88	for file descriptor events (C<ev_io>), the Linux C<inotify> interface	102	for file descriptor events (C<ev_io>), the Linux C<inotify> interface
89	(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers	103	(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
90	with customised rescheduling (C<ev_periodic>), synchronous signals	104	inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
91	(C<ev_signal>), process status change events (C<ev_child>), and event	105	timers (C<ev_timer>), absolute timers with customised rescheduling
92	watchers dealing with the event loop mechanism itself (C<ev_idle>,	106	(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
93	C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as	107	change events (C<ev_child>), and event watchers dealing with the event
94	file watchers (C<ev_stat>) and even limited support for fork events	108	loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
95	(C<ev_fork>).	109	C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
		110	limited support for fork events (C<ev_fork>).
96		111
97	It also is quite fast (see this	112	It also is quite fast (see this
98	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent	113	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
99	for example).	114	for example).
100		115
…		…
103	Libev is very configurable. In this manual the default (and most common)	118	Libev is very configurable. In this manual the default (and most common)
104	configuration will be described, which supports multiple event loops. For	119	configuration will be described, which supports multiple event loops. For
105	more info about various configuration options please have a look at	120	more info about various configuration options please have a look at
106	B<EMBED> section in this manual. If libev was configured without support	121	B<EMBED> section in this manual. If libev was configured without support
107	for multiple event loops, then all functions taking an initial argument of	122	for multiple event loops, then all functions taking an initial argument of
108	name C<loop> (which is always of type C<ev_loop *>) will not have	123	name C<loop> (which is always of type C<struct ev_loop *>) will not have
109	this argument.	124	this argument.
110		125
111	=head2 TIME REPRESENTATION	126	=head2 TIME REPRESENTATION
112		127
113	Libev represents time as a single floating point number, representing the	128	Libev represents time as a single floating point number, representing
114	(fractional) number of seconds since the (POSIX) epoch (somewhere near	129	the (fractional) number of seconds since the (POSIX) epoch (in practise
115	the beginning of 1970, details are complicated, don't ask). This type is	130	somewhere near the beginning of 1970, details are complicated, don't
116	called C<ev_tstamp>, which is what you should use too. It usually aliases	131	ask). This type is called C<ev_tstamp>, which is what you should use
117	to the C<double> type in C, and when you need to do any calculations on	132	too. It usually aliases to the C<double> type in C. When you need to do
118	it, you should treat it as some floating point value. Unlike the name	133	any calculations on it, you should treat it as some floating point value.
		134
119	component C<stamp> might indicate, it is also used for time differences	135	Unlike the name component C<stamp> might indicate, it is also used for
120	throughout libev.	136	time differences (e.g. delays) throughout libev.
121		137
122	=head1 ERROR HANDLING	138	=head1 ERROR HANDLING
123		139
124	Libev knows three classes of errors: operating system errors, usage errors	140	Libev knows three classes of errors: operating system errors, usage errors
125	and internal errors (bugs).	141	and internal errors (bugs).
…		…
176	as this indicates an incompatible change. Minor versions are usually	192	as this indicates an incompatible change. Minor versions are usually
177	compatible to older versions, so a larger minor version alone is usually	193	compatible to older versions, so a larger minor version alone is usually
178	not a problem.	194	not a problem.
179		195
180	Example: Make sure we haven't accidentally been linked against the wrong	196	Example: Make sure we haven't accidentally been linked against the wrong
181	version.	197	version (note, however, that this will not detect ABI mismatches :).
182		198
183	assert (("libev version mismatch",	199	assert (("libev version mismatch",
184	ev_version_major () == EV_VERSION_MAJOR	200	ev_version_major () == EV_VERSION_MAJOR
185	&& ev_version_minor () >= EV_VERSION_MINOR));	201	&& ev_version_minor () >= EV_VERSION_MINOR));
186		202
…		…
276		292
277	=back	293	=back
278		294
279	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	295	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
280		296
281	An event loop is described by a C<ev_loop *>. The library knows two	297	An event loop is described by a C<struct ev_loop *> (the C<struct>
282	types of such loops, the I<default> loop, which supports signals and child	298	is I<not> optional in this case, as there is also an C<ev_loop>
283	events, and dynamically created loops which do not.	299	I<function>).
		300
		301	The library knows two types of such loops, the I<default> loop, which
		302	supports signals and child events, and dynamically created loops which do
		303	not.
284		304
285	=over 4	305	=over 4
286		306
287	=item struct ev_loop *ev_default_loop (unsigned int flags)	307	=item struct ev_loop *ev_default_loop (unsigned int flags)
288		308
…		…
294	If you don't know what event loop to use, use the one returned from this	314	If you don't know what event loop to use, use the one returned from this
295	function.	315	function.
296		316
297	Note that this function is I<not> thread-safe, so if you want to use it	317	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,	318	from multiple threads, you have to lock (note also that this is unlikely,
299	as loops cannot bes hared easily between threads anyway).	319	as loops cannot be shared easily between threads anyway).
300		320
301	The default loop is the only loop that can handle C<ev_signal> and	321	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	322	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	323	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	324	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
…		…
326	useful to try out specific backends to test their performance, or to work	346	useful to try out specific backends to test their performance, or to work
327	around bugs.	347	around bugs.
328		348
329	=item C<EVFLAG_FORKCHECK>	349	=item C<EVFLAG_FORKCHECK>
330		350
331	Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after	351	Instead of calling C<ev_loop_fork> manually after a fork, you can also
332	a fork, you can also make libev check for a fork in each iteration by	352	make libev check for a fork in each iteration by enabling this flag.
333	enabling this flag.
334		353
335	This works by calling C<getpid ()> on every iteration of the loop,	354	This works by calling C<getpid ()> on every iteration of the loop,
336	and thus this might slow down your event loop if you do a lot of loop	355	and thus this might slow down your event loop if you do a lot of loop
337	iterations and little real work, but is usually not noticeable (on my	356	iterations and little real work, but is usually not noticeable (on my
338	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	357	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
…		…
344	flag.	363	flag.
345		364
346	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	365	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
347	environment variable.	366	environment variable.
348		367
		368	=item C<EVFLAG_NOINOTIFY>
		369
		370	When this flag is specified, then libev will not attempt to use the
		371	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
		372	testing, this flag can be useful to conserve inotify file descriptors, as
		373	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
		374
		375	=item C<EVFLAG_SIGNALFD>
		376
		377	When this flag is specified, then libev will attempt to use the
		378	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
		379	delivers signals synchronously, which makes it both faster and might make
		380	it possible to get the queued signal data. It can also simplify signal
		381	handling with threads, as long as you properly block signals in your
		382	threads that are not interested in handling them.
		383
		384	Signalfd will not be used by default as this changes your signal mask, and
		385	there are a lot of shoddy libraries and programs (glib's threadpool for
		386	example) that can't properly initialise their signal masks.
		387
349	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
350		389
351	This is your standard select(2) backend. Not I<completely> standard, as	390	This is your standard select(2) backend. Not I<completely> standard, as
352	libev tries to roll its own fd_set with no limits on the number of fds,	391	libev tries to roll its own fd_set with no limits on the number of fds,
353	but if that fails, expect a fairly low limit on the number of fds when	392	but if that fails, expect a fairly low limit on the number of fds when
…		…
377	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and	416	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
378	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.	417	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
379		418
380	=item C<EVBACKEND_EPOLL> (value 4, Linux)	419	=item C<EVBACKEND_EPOLL> (value 4, Linux)
381		420
		421	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
		422	kernels).
		423
382	For few fds, this backend is a bit little slower than poll and select,	424	For few fds, this backend is a bit little slower than poll and select,
383	but it scales phenomenally better. While poll and select usually scale	425	but it scales phenomenally better. While poll and select usually scale
384	like O(total_fds) where n is the total number of fds (or the highest fd),	426	like O(total_fds) where n is the total number of fds (or the highest fd),
385	epoll scales either O(1) or O(active_fds). The epoll design has a number	427	epoll scales either O(1) or O(active_fds).
386	of shortcomings, such as silently dropping events in some hard-to-detect	428
387	cases and requiring a system call per fd change, no fork support and bad	429	The epoll mechanism deserves honorable mention as the most misdesigned
388	support for dup.	430	of the more advanced event mechanisms: mere annoyances include silently
		431	dropping file descriptors, requiring a system call per change per file
		432	descriptor (and unnecessary guessing of parameters), problems with dup and
		433	so on. The biggest issue is fork races, however - if a program forks then
		434	I<both> parent and child process have to recreate the epoll set, which can
		435	take considerable time (one syscall per file descriptor) and is of course
		436	hard to detect.
		437
		438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
		439	of course I<doesn't>, and epoll just loves to report events for totally
		440	I<different> file descriptors (even already closed ones, so one cannot
		441	even remove them from the set) than registered in the set (especially
		442	on SMP systems). Libev tries to counter these spurious notifications by
		443	employing an additional generation counter and comparing that against the
		444	events to filter out spurious ones, recreating the set when required. Last
		445	not least, it also refuses to work with some file descriptors which work
		446	perfectly fine with C<select> (files, many character devices...).
389		447
390	While stopping, setting and starting an I/O watcher in the same iteration	448	While stopping, setting and starting an I/O watcher in the same iteration
391	will result in some caching, there is still a system call per such incident	449	will result in some caching, there is still a system call per such
392	(because the fd could point to a different file description now), so its	450	incident (because the same I<file descriptor> could point to a different
393	best to avoid that. Also, C<dup ()>'ed file descriptors might not work	451	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
394	very well if you register events for both fds.	452	file descriptors might not work very well if you register events for both
395		453	file descriptors.
396	Please note that epoll sometimes generates spurious notifications, so you
397	need to use non-blocking I/O or other means to avoid blocking when no data
398	(or space) is available.
399		454
400	Best performance from this backend is achieved by not unregistering all	455	Best performance from this backend is achieved by not unregistering all
401	watchers for a file descriptor until it has been closed, if possible,	456	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	457	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	458	starting a watcher (without re-setting it) also usually doesn't cause
404	extra overhead.	459	extra overhead. A fork can both result in spurious notifications as well
		460	as in libev having to destroy and recreate the epoll object, which can
		461	take considerable time and thus should be avoided.
		462
		463	All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
		464	faster than epoll for maybe up to a hundred file descriptors, depending on
		465	the usage. So sad.
405		466
406	While nominally embeddable in other event loops, this feature is broken in	467	While nominally embeddable in other event loops, this feature is broken in
407	all kernel versions tested so far.	468	all kernel versions tested so far.
408		469
409	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	470	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
410	C<EVBACKEND_POLL>.	471	C<EVBACKEND_POLL>.
411		472
412	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	473	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
413		474
414	Kqueue deserves special mention, as at the time of this writing, it was	475	Kqueue deserves special mention, as at the time of this writing, it
415	broken on all BSDs except NetBSD (usually it doesn't work reliably with	476	was broken on all BSDs except NetBSD (usually it doesn't work reliably
416	anything but sockets and pipes, except on Darwin, where of course it's	477	with anything but sockets and pipes, except on Darwin, where of course
417	completely useless). For this reason it's not being "auto-detected" unless	478	it's completely useless). Unlike epoll, however, whose brokenness
418	you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or	479	is by design, these kqueue bugs can (and eventually will) be fixed
419	libev was compiled on a known-to-be-good (-enough) system like NetBSD.	480	without API changes to existing programs. For this reason it's not being
		481	"auto-detected" unless you explicitly specify it in the flags (i.e. using
		482	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
		483	system like NetBSD.
420		484
421	You still can embed kqueue into a normal poll or select backend and use it	485	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	486	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.	487	the target platform). See C<ev_embed> watchers for more info.
424		488
425	It scales in the same way as the epoll backend, but the interface to the	489	It scales in the same way as the epoll backend, but the interface to the
426	kernel is more efficient (which says nothing about its actual speed, of	490	kernel is more efficient (which says nothing about its actual speed, of
427	course). While stopping, setting and starting an I/O watcher does never	491	course). While stopping, setting and starting an I/O watcher does never
428	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	492	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
429	two event changes per incident. Support for C<fork ()> is very bad and it	493	two event changes per incident. Support for C<fork ()> is very bad (but
430	drops fds silently in similarly hard-to-detect cases.	494	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
		495	cases
431		496
432	This backend usually performs well under most conditions.	497	This backend usually performs well under most conditions.
433		498
434	While nominally embeddable in other event loops, this doesn't work	499	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	500	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	501	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	502	(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,	503	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course
439	using it only for sockets.	504	also broken on OS X)) and, did I mention it, using it only for sockets.
440		505
441	This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with	506	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	507	C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
443	C<NOTE_EOF>.	508	C<NOTE_EOF>.
444		509
…		…
464	might perform better.	529	might perform better.
465		530
466	On the positive side, with the exception of the spurious readiness	531	On the positive side, with the exception of the spurious readiness
467	notifications, this backend actually performed fully to specification	532	notifications, this backend actually performed fully to specification
468	in all tests and is fully embeddable, which is a rare feat among the	533	in all tests and is fully embeddable, which is a rare feat among the
469	OS-specific backends.	534	OS-specific backends (I vastly prefer correctness over speed hacks).
470		535
471	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	536	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
472	C<EVBACKEND_POLL>.	537	C<EVBACKEND_POLL>.
473		538
474	=item C<EVBACKEND_ALL>	539	=item C<EVBACKEND_ALL>
…		…
479		544
480	It is definitely not recommended to use this flag.	545	It is definitely not recommended to use this flag.
481		546
482	=back	547	=back
483		548
484	If one or more of these are or'ed into the flags value, then only these	549	If one or more of the backend flags are or'ed into the flags value,
485	backends will be tried (in the reverse order as listed here). If none are	550	then only these backends will be tried (in the reverse order as listed
486	specified, all backends in C<ev_recommended_backends ()> will be tried.	551	here). If none are specified, all backends in C<ev_recommended_backends
		552	()> will be tried.
487		553
488	Example: This is the most typical usage.	554	Example: This is the most typical usage.
489		555
490	if (!ev_default_loop (0))	556	if (!ev_default_loop (0))
491	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	557	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
…		…
503	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);	569	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
504		570
505	=item struct ev_loop *ev_loop_new (unsigned int flags)	571	=item struct ev_loop *ev_loop_new (unsigned int flags)
506		572
507	Similar to C<ev_default_loop>, but always creates a new event loop that is	573	Similar to C<ev_default_loop>, but always creates a new event loop that is
508	always distinct from the default loop. Unlike the default loop, it cannot	574	always distinct from the default loop.
509	handle signal and child watchers, and attempts to do so will be greeted by
510	undefined behaviour (or a failed assertion if assertions are enabled).
511		575
512	Note that this function I<is> thread-safe, and the recommended way to use	576	Note that this function I<is> thread-safe, and one common way to use
513	libev with threads is indeed to create one loop per thread, and using the	577	libev with threads is indeed to create one loop per thread, and using the
514	default loop in the "main" or "initial" thread.	578	default loop in the "main" or "initial" thread.
515		579
516	Example: Try to create a event loop that uses epoll and nothing else.	580	Example: Try to create a event loop that uses epoll and nothing else.
517		581
…		…
519	if (!epoller)	583	if (!epoller)
520	fatal ("no epoll found here, maybe it hides under your chair");	584	fatal ("no epoll found here, maybe it hides under your chair");
521		585
522	=item ev_default_destroy ()	586	=item ev_default_destroy ()
523		587
524	Destroys the default loop again (frees all memory and kernel state	588	Destroys the default loop (frees all memory and kernel state etc.). None
525	etc.). None of the active event watchers will be stopped in the normal	589	of the active event watchers will be stopped in the normal sense, so
526	sense, so e.g. C<ev_is_active> might still return true. It is your	590	e.g. C<ev_is_active> might still return true. It is your responsibility to
527	responsibility to either stop all watchers cleanly yourself I<before>	591	either stop all watchers cleanly yourself I<before> calling this function,
528	calling this function, or cope with the fact afterwards (which is usually	592	or cope with the fact afterwards (which is usually the easiest thing, you
529	the easiest thing, you can just ignore the watchers and/or C<free ()> them	593	can just ignore the watchers and/or C<free ()> them for example).
530	for example).
531		594
532	Note that certain global state, such as signal state, will not be freed by	595	Note that certain global state, such as signal state (and installed signal
533	this function, and related watchers (such as signal and child watchers)	596	handlers), will not be freed by this function, and related watchers (such
534	would need to be stopped manually.	597	as signal and child watchers) would need to be stopped manually.
535		598
536	In general it is not advisable to call this function except in the	599	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	600	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	601	pipe fds. If you need dynamically allocated loops it is better to use
539	C<ev_loop_new> and C<ev_loop_destroy>).	602	C<ev_loop_new> and C<ev_loop_destroy>.
540		603
541	=item ev_loop_destroy (loop)	604	=item ev_loop_destroy (loop)
542		605
543	Like C<ev_default_destroy>, but destroys an event loop created by an	606	Like C<ev_default_destroy>, but destroys an event loop created by an
544	earlier call to C<ev_loop_new>.	607	earlier call to C<ev_loop_new>.
…		…
550	name, you can call it anytime, but it makes most sense after forking, in	613	name, you can call it anytime, but it makes most sense after forking, in
551	the child process (or both child and parent, but that again makes little	614	the child process (or both child and parent, but that again makes little
552	sense). You I<must> call it in the child before using any of the libev	615	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.	616	functions, and it will only take effect at the next C<ev_loop> iteration.
554		617
		618	Again, you I<have> to call it on I<any> loop that you want to re-use after
		619	a fork, I<even if you do not plan to use the loop in the parent>. This is
		620	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
		621	during fork.
		622
555	On the other hand, you only need to call this function in the child	623	On the other hand, you only need to call this function in the child
556	process if and only if you want to use the event library in the child. If	624	process if and only if you want to use the event loop in the child. If you
557	you just fork+exec, you don't have to call it at all.	625	just fork+exec or create a new loop in the child, you don't have to call
		626	it at all.
558		627
559	The function itself is quite fast and it's usually not a problem to call	628	The function itself is quite fast and it's usually not a problem to call
560	it just in case after a fork. To make this easy, the function will fit in	629	it just in case after a fork. To make this easy, the function will fit in
561	quite nicely into a call to C<pthread_atfork>:	630	quite nicely into a call to C<pthread_atfork>:
562		631
…		…
564		633
565	=item ev_loop_fork (loop)	634	=item ev_loop_fork (loop)
566		635
567	Like C<ev_default_fork>, but acts on an event loop created by	636	Like C<ev_default_fork>, but acts on an event loop created by
568	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	637	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
569	after fork that you want to re-use in the child, and how you do this is	638	after fork that you want to re-use in the child, and how you keep track of
570	entirely your own problem.	639	them is entirely your own problem.
571		640
572	=item int ev_is_default_loop (loop)	641	=item int ev_is_default_loop (loop)
573		642
574	Returns true when the given loop is, in fact, the default loop, and false	643	Returns true when the given loop is, in fact, the default loop, and false
575	otherwise.	644	otherwise.
576		645
577	=item unsigned int ev_loop_count (loop)	646	=item unsigned int ev_iteration (loop)
578		647
579	Returns the count of loop iterations for the loop, which is identical to	648	Returns the current iteration count for the loop, which is identical to
580	the number of times libev did poll for new events. It starts at C<0> and	649	the number of times libev did poll for new events. It starts at C<0> and
581	happily wraps around with enough iterations.	650	happily wraps around with enough iterations.
582		651
583	This value can sometimes be useful as a generation counter of sorts (it	652	This value can sometimes be useful as a generation counter of sorts (it
584	"ticks" the number of loop iterations), as it roughly corresponds with	653	"ticks" the number of loop iterations), as it roughly corresponds with
585	C<ev_prepare> and C<ev_check> calls.	654	C<ev_prepare> and C<ev_check> calls - and is incremented between the
		655	prepare and check phases.
		656
		657	=item unsigned int ev_depth (loop)
		658
		659	Returns the number of times C<ev_loop> was entered minus the number of
		660	times C<ev_loop> was exited, in other words, the recursion depth.
		661
		662	Outside C<ev_loop>, this number is zero. In a callback, this number is
		663	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
		664	in which case it is higher.
		665
		666	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
		667	etc.), doesn't count as "exit" - consider this as a hint to avoid such
		668	ungentleman behaviour unless it's really convenient.
586		669
587	=item unsigned int ev_backend (loop)	670	=item unsigned int ev_backend (loop)
588		671
589	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	672	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
590	use.	673	use.
…		…
605		688
606	This function is rarely useful, but when some event callback runs for a	689	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	690	very long time without entering the event loop, updating libev's idea of
608	the current time is a good idea.	691	the current time is a good idea.
609		692
610	See also "The special problem of time updates" in the C<ev_timer> section.	693	See also L<The special problem of time updates> in the C<ev_timer> section.
		694
		695	=item ev_suspend (loop)
		696
		697	=item ev_resume (loop)
		698
		699	These two functions suspend and resume a loop, for use when the loop is
		700	not used for a while and timeouts should not be processed.
		701
		702	A typical use case would be an interactive program such as a game: When
		703	the user presses C<^Z> to suspend the game and resumes it an hour later it
		704	would be best to handle timeouts as if no time had actually passed while
		705	the program was suspended. This can be achieved by calling C<ev_suspend>
		706	in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling
		707	C<ev_resume> directly afterwards to resume timer processing.
		708
		709	Effectively, all C<ev_timer> watchers will be delayed by the time spend
		710	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
		711	will be rescheduled (that is, they will lose any events that would have
		712	occurred while suspended).
		713
		714	After calling C<ev_suspend> you B<must not> call I<any> function on the
		715	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
		716	without a previous call to C<ev_suspend>.
		717
		718	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
		719	event loop time (see C<ev_now_update>).
611		720
612	=item ev_loop (loop, int flags)	721	=item ev_loop (loop, int flags)
613		722
614	Finally, this is it, the event handler. This function usually is called	723	Finally, this is it, the event handler. This function usually is called
615	after you initialised all your watchers and you want to start handling	724	after you have initialised all your watchers and you want to start
616	events.	725	handling events.
617		726
618	If the flags argument is specified as C<0>, it will not return until	727	If the flags argument is specified as C<0>, it will not return until
619	either no event watchers are active anymore or C<ev_unloop> was called.	728	either no event watchers are active anymore or C<ev_unloop> was called.
620		729
621	Please note that an explicit C<ev_unloop> is usually better than	730	Please note that an explicit C<ev_unloop> is usually better than
…		…
631	the loop.	740	the loop.
632		741
633	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	742	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
634	necessary) and will handle those and any already outstanding ones. It	743	necessary) and will handle those and any already outstanding ones. It
635	will block your process until at least one new event arrives (which could	744	will block your process until at least one new event arrives (which could
636	be an event internal to libev itself, so there is no guarentee that a	745	be an event internal to libev itself, so there is no guarantee that a
637	user-registered callback will be called), and will return after one	746	user-registered callback will be called), and will return after one
638	iteration of the loop.	747	iteration of the loop.
639		748
640	This is useful if you are waiting for some external event in conjunction	749	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	750	with something not expressible using other libev watchers (i.e. "roll your
…		…
685	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	794	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
686	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	795	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
687		796
688	This "unloop state" will be cleared when entering C<ev_loop> again.	797	This "unloop state" will be cleared when entering C<ev_loop> again.
689		798
690	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.	799	It is safe to call C<ev_unloop> from outside any C<ev_loop> calls.
691		800
692	=item ev_ref (loop)	801	=item ev_ref (loop)
693		802
694	=item ev_unref (loop)	803	=item ev_unref (loop)
695		804
696	Ref/unref can be used to add or remove a reference count on the event	805	Ref/unref can be used to add or remove a reference count on the event
697	loop: Every watcher keeps one reference, and as long as the reference	806	loop: Every watcher keeps one reference, and as long as the reference
698	count is nonzero, C<ev_loop> will not return on its own.	807	count is nonzero, C<ev_loop> will not return on its own.
699		808
700	If you have a watcher you never unregister that should not keep C<ev_loop>	809	This is useful when you have a watcher that you never intend to
701	from returning, call ev_unref() after starting, and ev_ref() before	810	unregister, but that nevertheless should not keep C<ev_loop> from
		811	returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
702	stopping it.	812	before stopping it.
703		813
704	As an example, libev itself uses this for its internal signal pipe: It is	814	As an example, libev itself uses this for its internal signal pipe: It
705	not visible to the libev user and should not keep C<ev_loop> from exiting	815	is not visible to the libev user and should not keep C<ev_loop> from
706	if no event watchers registered by it are active. It is also an excellent	816	exiting if no event watchers registered by it are active. It is also an
707	way to do this for generic recurring timers or from within third-party	817	excellent way to do this for generic recurring timers or from within
708	libraries. Just remember to I<unref after start> and I<ref before stop>	818	third-party libraries. Just remember to I<unref after start> and I<ref
709	(but only if the watcher wasn't active before, or was active before,	819	before stop> (but only if the watcher wasn't active before, or was active
710	respectively).	820	before, respectively. Note also that libev might stop watchers itself
		821	(e.g. non-repeating timers) in which case you have to C<ev_ref>
		822	in the callback).
711		823
712	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	824	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
713	running when nothing else is active.	825	running when nothing else is active.
714		826
715	ev_signal exitsig;	827	ev_signal exitsig;
…		…
744		856
745	By setting a higher I<io collect interval> you allow libev to spend more	857	By setting a higher I<io collect interval> you allow libev to spend more
746	time collecting I/O events, so you can handle more events per iteration,	858	time collecting I/O events, so you can handle more events per iteration,
747	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	859	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
748	C<ev_timer>) will be not affected. Setting this to a non-null value will	860	C<ev_timer>) will be not affected. Setting this to a non-null value will
749	introduce an additional C<ev_sleep ()> call into most loop iterations.	861	introduce an additional C<ev_sleep ()> call into most loop iterations. The
		862	sleep time ensures that libev will not poll for I/O events more often then
		863	once per this interval, on average.
750		864
751	Likewise, by setting a higher I<timeout collect interval> you allow libev	865	Likewise, by setting a higher I<timeout collect interval> you allow libev
752	to spend more time collecting timeouts, at the expense of increased	866	to spend more time collecting timeouts, at the expense of increased
753	latency/jitter/inexactness (the watcher callback will be called	867	latency/jitter/inexactness (the watcher callback will be called
754	later). C<ev_io> watchers will not be affected. Setting this to a non-null	868	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
756		870
757	Many (busy) programs can usually benefit by setting the I/O collect	871	Many (busy) programs can usually benefit by setting the I/O collect
758	interval to a value near C<0.1> or so, which is often enough for	872	interval to a value near C<0.1> or so, which is often enough for
759	interactive servers (of course not for games), likewise for timeouts. It	873	interactive servers (of course not for games), likewise for timeouts. It
760	usually doesn't make much sense to set it to a lower value than C<0.01>,	874	usually doesn't make much sense to set it to a lower value than C<0.01>,
761	as this approaches the timing granularity of most systems.	875	as this approaches the timing granularity of most systems. Note that if
		876	you do transactions with the outside world and you can't increase the
		877	parallelity, then this setting will limit your transaction rate (if you
		878	need to poll once per transaction and the I/O collect interval is 0.01,
		879	then you can't do more than 100 transactions per second).
762		880
763	Setting the I<timeout collect interval> can improve the opportunity for	881	Setting the I<timeout collect interval> can improve the opportunity for
764	saving power, as the program will "bundle" timer callback invocations that	882	saving power, as the program will "bundle" timer callback invocations that
765	are "near" in time together, by delaying some, thus reducing the number of	883	are "near" in time together, by delaying some, thus reducing the number of
766	times the process sleeps and wakes up again. Another useful technique to	884	times the process sleeps and wakes up again. Another useful technique to
767	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure	885	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
768	they fire on, say, one-second boundaries only.	886	they fire on, say, one-second boundaries only.
769		887
		888	Example: we only need 0.1s timeout granularity, and we wish not to poll
		889	more often than 100 times per second:
		890
		891	ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
		892	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
		893
		894	=item ev_invoke_pending (loop)
		895
		896	This call will simply invoke all pending watchers while resetting their
		897	pending state. Normally, C<ev_loop> does this automatically when required,
		898	but when overriding the invoke callback this call comes handy.
		899
		900	=item int ev_pending_count (loop)
		901
		902	Returns the number of pending watchers - zero indicates that no watchers
		903	are pending.
		904
		905	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
		906
		907	This overrides the invoke pending functionality of the loop: Instead of
		908	invoking all pending watchers when there are any, C<ev_loop> will call
		909	this callback instead. This is useful, for example, when you want to
		910	invoke the actual watchers inside another context (another thread etc.).
		911
		912	If you want to reset the callback, use C<ev_invoke_pending> as new
		913	callback.
		914
		915	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
		916
		917	Sometimes you want to share the same loop between multiple threads. This
		918	can be done relatively simply by putting mutex_lock/unlock calls around
		919	each call to a libev function.
		920
		921	However, C<ev_loop> can run an indefinite time, so it is not feasible to
		922	wait for it to return. One way around this is to wake up the loop via
		923	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
		924	and I<acquire> callbacks on the loop.
		925
		926	When set, then C<release> will be called just before the thread is
		927	suspended waiting for new events, and C<acquire> is called just
		928	afterwards.
		929
		930	Ideally, C<release> will just call your mutex_unlock function, and
		931	C<acquire> will just call the mutex_lock function again.
		932
		933	While event loop modifications are allowed between invocations of
		934	C<release> and C<acquire> (that's their only purpose after all), no
		935	modifications done will affect the event loop, i.e. adding watchers will
		936	have no effect on the set of file descriptors being watched, or the time
		937	waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it
		938	to take note of any changes you made.
		939
		940	In theory, threads executing C<ev_loop> will be async-cancel safe between
		941	invocations of C<release> and C<acquire>.
		942
		943	See also the locking example in the C<THREADS> section later in this
		944	document.
		945
		946	=item ev_set_userdata (loop, void *data)
		947
		948	=item ev_userdata (loop)
		949
		950	Set and retrieve a single C<void *> associated with a loop. When
		951	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
		952	C<0.>
		953
		954	These two functions can be used to associate arbitrary data with a loop,
		955	and are intended solely for the C<invoke_pending_cb>, C<release> and
		956	C<acquire> callbacks described above, but of course can be (ab-)used for
		957	any other purpose as well.
		958
770	=item ev_loop_verify (loop)	959	=item ev_verify (loop)
771		960
772	This function only does something when C<EV_VERIFY> support has been	961	This function only does something when C<EV_VERIFY> support has been
773	compiled in. which is the default for non-minimal builds. It tries to go	962	compiled in, which is the default for non-minimal builds. It tries to go
774	through all internal structures and checks them for validity. If anything	963	through all internal structures and checks them for validity. If anything
775	is found to be inconsistent, it will print an error message to standard	964	is found to be inconsistent, it will print an error message to standard
776	error and call C<abort ()>.	965	error and call C<abort ()>.
777		966
778	This can be used to catch bugs inside libev itself: under normal	967	This can be used to catch bugs inside libev itself: under normal
…		…
781		970
782	=back	971	=back
783		972
784		973
785	=head1 ANATOMY OF A WATCHER	974	=head1 ANATOMY OF A WATCHER
		975
		976	In the following description, uppercase C<TYPE> in names stands for the
		977	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
		978	watchers and C<ev_io_start> for I/O watchers.
786		979
787	A watcher is a structure that you create and register to record your	980	A watcher is a structure that you create and register to record your
788	interest in some event. For instance, if you want to wait for STDIN to	981	interest in some event. For instance, if you want to wait for STDIN to
789	become readable, you would create an C<ev_io> watcher for that:	982	become readable, you would create an C<ev_io> watcher for that:
790		983
…		…
793	ev_io_stop (w);	986	ev_io_stop (w);
794	ev_unloop (loop, EVUNLOOP_ALL);	987	ev_unloop (loop, EVUNLOOP_ALL);
795	}	988	}
796		989
797	struct ev_loop *loop = ev_default_loop (0);	990	struct ev_loop *loop = ev_default_loop (0);
		991
798	ev_io stdin_watcher;	992	ev_io stdin_watcher;
		993
799	ev_init (&stdin_watcher, my_cb);	994	ev_init (&stdin_watcher, my_cb);
800	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	995	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
801	ev_io_start (loop, &stdin_watcher);	996	ev_io_start (loop, &stdin_watcher);
		997
802	ev_loop (loop, 0);	998	ev_loop (loop, 0);
803		999
804	As you can see, you are responsible for allocating the memory for your	1000	As you can see, you are responsible for allocating the memory for your
805	watcher structures (and it is usually a bad idea to do this on the stack,	1001	watcher structures (and it is I<usually> a bad idea to do this on the
806	although this can sometimes be quite valid).	1002	stack).
		1003
		1004	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
		1005	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
807		1006
808	Each watcher structure must be initialised by a call to C<ev_init	1007	Each watcher structure must be initialised by a call to C<ev_init
809	(watcher *, callback)>, which expects a callback to be provided. This	1008	(watcher *, callback)>, which expects a callback to be provided. This
810	callback gets invoked each time the event occurs (or, in the case of I/O	1009	callback gets invoked each time the event occurs (or, in the case of I/O
811	watchers, each time the event loop detects that the file descriptor given	1010	watchers, each time the event loop detects that the file descriptor given
812	is readable and/or writable).	1011	is readable and/or writable).
813		1012
814	Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro	1013	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
815	with arguments specific to this watcher type. There is also a macro	1014	macro to configure it, with arguments specific to the watcher type. There
816	to combine initialisation and setting in one call: C<< ev_<type>_init	1015	is also a macro to combine initialisation and setting in one call: C<<
817	(watcher *, callback, ...) >>.	1016	ev_TYPE_init (watcher *, callback, ...) >>.
818		1017
819	To make the watcher actually watch out for events, you have to start it	1018	To make the watcher actually watch out for events, you have to start it
820	with a watcher-specific start function (C<< ev_<type>_start (loop, watcher	1019	with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher
821	*) >>), and you can stop watching for events at any time by calling the	1020	*) >>), and you can stop watching for events at any time by calling the
822	corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.	1021	corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>.
823		1022
824	As long as your watcher is active (has been started but not stopped) you	1023	As long as your watcher is active (has been started but not stopped) you
825	must not touch the values stored in it. Most specifically you must never	1024	must not touch the values stored in it. Most specifically you must never
826	reinitialise it or call its C<set> macro.	1025	reinitialise it or call its C<ev_TYPE_set> macro.
827		1026
828	Each and every callback receives the event loop pointer as first, the	1027	Each and every callback receives the event loop pointer as first, the
829	registered watcher structure as second, and a bitset of received events as	1028	registered watcher structure as second, and a bitset of received events as
830	third argument.	1029	third argument.
831		1030
…		…
840	=item C<EV_WRITE>	1039	=item C<EV_WRITE>
841		1040
842	The file descriptor in the C<ev_io> watcher has become readable and/or	1041	The file descriptor in the C<ev_io> watcher has become readable and/or
843	writable.	1042	writable.
844		1043
845	=item C<EV_TIMEOUT>	1044	=item C<EV_TIMER>
846		1045
847	The C<ev_timer> watcher has timed out.	1046	The C<ev_timer> watcher has timed out.
848		1047
849	=item C<EV_PERIODIC>	1048	=item C<EV_PERIODIC>
850		1049
…		…
889		1088
890	=item C<EV_ASYNC>	1089	=item C<EV_ASYNC>
891		1090
892	The given async watcher has been asynchronously notified (see C<ev_async>).	1091	The given async watcher has been asynchronously notified (see C<ev_async>).
893		1092
		1093	=item C<EV_CUSTOM>
		1094
		1095	Not ever sent (or otherwise used) by libev itself, but can be freely used
		1096	by libev users to signal watchers (e.g. via C<ev_feed_event>).
		1097
894	=item C<EV_ERROR>	1098	=item C<EV_ERROR>
895		1099
896	An unspecified error has occurred, the watcher has been stopped. This might	1100	An unspecified error has occurred, the watcher has been stopped. This might
897	happen because the watcher could not be properly started because libev	1101	happen because the watcher could not be properly started because libev
898	ran out of memory, a file descriptor was found to be closed or any other	1102	ran out of memory, a file descriptor was found to be closed or any other
…		…
912		1116
913	=back	1117	=back
914		1118
915	=head2 GENERIC WATCHER FUNCTIONS	1119	=head2 GENERIC WATCHER FUNCTIONS
916		1120
917	In the following description, C<TYPE> stands for the watcher type,
918	e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
919
920	=over 4	1121	=over 4
921		1122
922	=item C<ev_init> (ev_TYPE *watcher, callback)	1123	=item C<ev_init> (ev_TYPE *watcher, callback)
923		1124
924	This macro initialises the generic portion of a watcher. The contents	1125	This macro initialises the generic portion of a watcher. The contents
…		…
938		1139
939	ev_io w;	1140	ev_io w;
940	ev_init (&w, my_cb);	1141	ev_init (&w, my_cb);
941	ev_io_set (&w, STDIN_FILENO, EV_READ);	1142	ev_io_set (&w, STDIN_FILENO, EV_READ);
942		1143
943	=item C<ev_TYPE_set> (ev_TYPE *, [args])	1144	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
944		1145
945	This macro initialises the type-specific parts of a watcher. You need to	1146	This macro initialises the type-specific parts of a watcher. You need to
946	call C<ev_init> at least once before you call this macro, but you can	1147	call C<ev_init> at least once before you call this macro, but you can
947	call C<ev_TYPE_set> any number of times. You must not, however, call this	1148	call C<ev_TYPE_set> any number of times. You must not, however, call this
948	macro on a watcher that is active (it can be pending, however, which is a	1149	macro on a watcher that is active (it can be pending, however, which is a
…		…
961		1162
962	Example: Initialise and set an C<ev_io> watcher in one step.	1163	Example: Initialise and set an C<ev_io> watcher in one step.
963		1164
964	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);	1165	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
965		1166
966	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)	1167	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
967		1168
968	Starts (activates) the given watcher. Only active watchers will receive	1169	Starts (activates) the given watcher. Only active watchers will receive
969	events. If the watcher is already active nothing will happen.	1170	events. If the watcher is already active nothing will happen.
970		1171
971	Example: Start the C<ev_io> watcher that is being abused as example in this	1172	Example: Start the C<ev_io> watcher that is being abused as example in this
972	whole section.	1173	whole section.
973		1174
974	ev_io_start (EV_DEFAULT_UC, &w);	1175	ev_io_start (EV_DEFAULT_UC, &w);
975		1176
976	=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)	1177	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
977		1178
978	Stops the given watcher if active, and clears the pending status (whether	1179	Stops the given watcher if active, and clears the pending status (whether
979	the watcher was active or not).	1180	the watcher was active or not).
980		1181
981	It is possible that stopped watchers are pending - for example,	1182	It is possible that stopped watchers are pending - for example,
…		…
1006	=item ev_cb_set (ev_TYPE *watcher, callback)	1207	=item ev_cb_set (ev_TYPE *watcher, callback)
1007		1208
1008	Change the callback. You can change the callback at virtually any time	1209	Change the callback. You can change the callback at virtually any time
1009	(modulo threads).	1210	(modulo threads).
1010		1211
1011	=item ev_set_priority (ev_TYPE *watcher, priority)	1212	=item ev_set_priority (ev_TYPE *watcher, int priority)
1012		1213
1013	=item int ev_priority (ev_TYPE *watcher)	1214	=item int ev_priority (ev_TYPE *watcher)
1014		1215
1015	Set and query the priority of the watcher. The priority is a small	1216	Set and query the priority of the watcher. The priority is a small
1016	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>	1217	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1017	(default: C<-2>). Pending watchers with higher priority will be invoked	1218	(default: C<-2>). Pending watchers with higher priority will be invoked
1018	before watchers with lower priority, but priority will not keep watchers	1219	before watchers with lower priority, but priority will not keep watchers
1019	from being executed (except for C<ev_idle> watchers).	1220	from being executed (except for C<ev_idle> watchers).
1020		1221
1021	This means that priorities are I<only> used for ordering callback
1022	invocation after new events have been received. This is useful, for
1023	example, to reduce latency after idling, or more often, to bind two
1024	watchers on the same event and make sure one is called first.
1025
1026	If you need to suppress invocation when higher priority events are pending	1222	If you need to suppress invocation when higher priority events are pending
1027	you need to look at C<ev_idle> watchers, which provide this functionality.	1223	you need to look at C<ev_idle> watchers, which provide this functionality.
1028		1224
1029	You I<must not> change the priority of a watcher as long as it is active or	1225	You I<must not> change the priority of a watcher as long as it is active or
1030	pending.	1226	pending.
1031		1227
		1228	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		1229	fine, as long as you do not mind that the priority value you query might
		1230	or might not have been clamped to the valid range.
		1231
1032	The default priority used by watchers when no priority has been set is	1232	The default priority used by watchers when no priority has been set is
1033	always C<0>, which is supposed to not be too high and not be too low :).	1233	always C<0>, which is supposed to not be too high and not be too low :).
1034		1234
1035	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is	1235	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1036	fine, as long as you do not mind that the priority value you query might	1236	priorities.
1037	or might not have been adjusted to be within valid range.
1038		1237
1039	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1238	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1040		1239
1041	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1240	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1042	C<loop> nor C<revents> need to be valid as long as the watcher callback	1241	C<loop> nor C<revents> need to be valid as long as the watcher callback
…		…
1049	returns its C<revents> bitset (as if its callback was invoked). If the	1248	returns its C<revents> bitset (as if its callback was invoked). If the
1050	watcher isn't pending it does nothing and returns C<0>.	1249	watcher isn't pending it does nothing and returns C<0>.
1051		1250
1052	Sometimes it can be useful to "poll" a watcher instead of waiting for its	1251	Sometimes it can be useful to "poll" a watcher instead of waiting for its
1053	callback to be invoked, which can be accomplished with this function.	1252	callback to be invoked, which can be accomplished with this function.
		1253
		1254	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
		1255
		1256	Feeds the given event set into the event loop, as if the specified event
		1257	had happened for the specified watcher (which must be a pointer to an
		1258	initialised but not necessarily started event watcher). Obviously you must
		1259	not free the watcher as long as it has pending events.
		1260
		1261	Stopping the watcher, letting libev invoke it, or calling
		1262	C<ev_clear_pending> will clear the pending event, even if the watcher was
		1263	not started in the first place.
		1264
		1265	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
		1266	functions that do not need a watcher.
1054		1267
1055	=back	1268	=back
1056		1269
1057		1270
1058	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1271	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
…		…
1107	#include <stddef.h>	1320	#include <stddef.h>
1108		1321
1109	static void	1322	static void
1110	t1_cb (EV_P_ ev_timer *w, int revents)	1323	t1_cb (EV_P_ ev_timer *w, int revents)
1111	{	1324	{
1112	struct my_biggy big = (struct my_biggy *	1325	struct my_biggy big = (struct my_biggy *)
1113	(((char *)w) - offsetof (struct my_biggy, t1));	1326	(((char *)w) - offsetof (struct my_biggy, t1));
1114	}	1327	}
1115		1328
1116	static void	1329	static void
1117	t2_cb (EV_P_ ev_timer *w, int revents)	1330	t2_cb (EV_P_ ev_timer *w, int revents)
1118	{	1331	{
1119	struct my_biggy big = (struct my_biggy *	1332	struct my_biggy big = (struct my_biggy *)
1120	(((char *)w) - offsetof (struct my_biggy, t2));	1333	(((char *)w) - offsetof (struct my_biggy, t2));
1121	}	1334	}
		1335
		1336	=head2 WATCHER PRIORITY MODELS
		1337
		1338	Many event loops support I<watcher priorities>, which are usually small
		1339	integers that influence the ordering of event callback invocation
		1340	between watchers in some way, all else being equal.
		1341
		1342	In libev, Watcher priorities can be set using C<ev_set_priority>. See its
		1343	description for the more technical details such as the actual priority
		1344	range.
		1345
		1346	There are two common ways how these these priorities are being interpreted
		1347	by event loops:
		1348
		1349	In the more common lock-out model, higher priorities "lock out" invocation
		1350	of lower priority watchers, which means as long as higher priority
		1351	watchers receive events, lower priority watchers are not being invoked.
		1352
		1353	The less common only-for-ordering model uses priorities solely to order
		1354	callback invocation within a single event loop iteration: Higher priority
		1355	watchers are invoked before lower priority ones, but they all get invoked
		1356	before polling for new events.
		1357
		1358	Libev uses the second (only-for-ordering) model for all its watchers
		1359	except for idle watchers (which use the lock-out model).
		1360
		1361	The rationale behind this is that implementing the lock-out model for
		1362	watchers is not well supported by most kernel interfaces, and most event
		1363	libraries will just poll for the same events again and again as long as
		1364	their callbacks have not been executed, which is very inefficient in the
		1365	common case of one high-priority watcher locking out a mass of lower
		1366	priority ones.
		1367
		1368	Static (ordering) priorities are most useful when you have two or more
		1369	watchers handling the same resource: a typical usage example is having an
		1370	C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
		1371	timeouts. Under load, data might be received while the program handles
		1372	other jobs, but since timers normally get invoked first, the timeout
		1373	handler will be executed before checking for data. In that case, giving
		1374	the timer a lower priority than the I/O watcher ensures that I/O will be
		1375	handled first even under adverse conditions (which is usually, but not
		1376	always, what you want).
		1377
		1378	Since idle watchers use the "lock-out" model, meaning that idle watchers
		1379	will only be executed when no same or higher priority watchers have
		1380	received events, they can be used to implement the "lock-out" model when
		1381	required.
		1382
		1383	For example, to emulate how many other event libraries handle priorities,
		1384	you can associate an C<ev_idle> watcher to each such watcher, and in
		1385	the normal watcher callback, you just start the idle watcher. The real
		1386	processing is done in the idle watcher callback. This causes libev to
		1387	continuously poll and process kernel event data for the watcher, but when
		1388	the lock-out case is known to be rare (which in turn is rare :), this is
		1389	workable.
		1390
		1391	Usually, however, the lock-out model implemented that way will perform
		1392	miserably under the type of load it was designed to handle. In that case,
		1393	it might be preferable to stop the real watcher before starting the
		1394	idle watcher, so the kernel will not have to process the event in case
		1395	the actual processing will be delayed for considerable time.
		1396
		1397	Here is an example of an I/O watcher that should run at a strictly lower
		1398	priority than the default, and which should only process data when no
		1399	other events are pending:
		1400
		1401	ev_idle idle; // actual processing watcher
		1402	ev_io io; // actual event watcher
		1403
		1404	static void
		1405	io_cb (EV_P_ ev_io *w, int revents)
		1406	{
		1407	// stop the I/O watcher, we received the event, but
		1408	// are not yet ready to handle it.
		1409	ev_io_stop (EV_A_ w);
		1410
		1411	// start the idle watcher to handle the actual event.
		1412	// it will not be executed as long as other watchers
		1413	// with the default priority are receiving events.
		1414	ev_idle_start (EV_A_ &idle);
		1415	}
		1416
		1417	static void
		1418	idle_cb (EV_P_ ev_idle *w, int revents)
		1419	{
		1420	// actual processing
		1421	read (STDIN_FILENO, ...);
		1422
		1423	// have to start the I/O watcher again, as
		1424	// we have handled the event
		1425	ev_io_start (EV_P_ &io);
		1426	}
		1427
		1428	// initialisation
		1429	ev_idle_init (&idle, idle_cb);
		1430	ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
		1431	ev_io_start (EV_DEFAULT_ &io);
		1432
		1433	In the "real" world, it might also be beneficial to start a timer, so that
		1434	low-priority connections can not be locked out forever under load. This
		1435	enables your program to keep a lower latency for important connections
		1436	during short periods of high load, while not completely locking out less
		1437	important ones.
1122		1438
1123		1439
1124	=head1 WATCHER TYPES	1440	=head1 WATCHER TYPES
1125		1441
1126	This section describes each watcher in detail, but will not repeat	1442	This section describes each watcher in detail, but will not repeat
…		…
1152	descriptors to non-blocking mode is also usually a good idea (but not	1468	descriptors to non-blocking mode is also usually a good idea (but not
1153	required if you know what you are doing).	1469	required if you know what you are doing).
1154		1470
1155	If you cannot use non-blocking mode, then force the use of a	1471	If you cannot use non-blocking mode, then force the use of a
1156	known-to-be-good backend (at the time of this writing, this includes only	1472	known-to-be-good backend (at the time of this writing, this includes only
1157	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>).	1473	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
		1474	descriptors for which non-blocking operation makes no sense (such as
		1475	files) - libev doesn't guarantee any specific behaviour in that case.
1158		1476
1159	Another thing you have to watch out for is that it is quite easy to	1477	Another thing you have to watch out for is that it is quite easy to
1160	receive "spurious" readiness notifications, that is your callback might	1478	receive "spurious" readiness notifications, that is your callback might
1161	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1479	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1162	because there is no data. Not only are some backends known to create a	1480	because there is no data. Not only are some backends known to create a
…		…
1227		1545
1228	So when you encounter spurious, unexplained daemon exits, make sure you	1546	So when you encounter spurious, unexplained daemon exits, make sure you
1229	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon	1547	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1230	somewhere, as that would have given you a big clue).	1548	somewhere, as that would have given you a big clue).
1231		1549
		1550	=head3 The special problem of accept()ing when you can't
		1551
		1552	Many implementations of the POSIX C<accept> function (for example,
		1553	found in post-2004 Linux) have the peculiar behaviour of not removing a
		1554	connection from the pending queue in all error cases.
		1555
		1556	For example, larger servers often run out of file descriptors (because
		1557	of resource limits), causing C<accept> to fail with C<ENFILE> but not
		1558	rejecting the connection, leading to libev signalling readiness on
		1559	the next iteration again (the connection still exists after all), and
		1560	typically causing the program to loop at 100% CPU usage.
		1561
		1562	Unfortunately, the set of errors that cause this issue differs between
		1563	operating systems, there is usually little the app can do to remedy the
		1564	situation, and no known thread-safe method of removing the connection to
		1565	cope with overload is known (to me).
		1566
		1567	One of the easiest ways to handle this situation is to just ignore it
		1568	- when the program encounters an overload, it will just loop until the
		1569	situation is over. While this is a form of busy waiting, no OS offers an
		1570	event-based way to handle this situation, so it's the best one can do.
		1571
		1572	A better way to handle the situation is to log any errors other than
		1573	C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
		1574	messages, and continue as usual, which at least gives the user an idea of
		1575	what could be wrong ("raise the ulimit!"). For extra points one could stop
		1576	the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
		1577	usage.
		1578
		1579	If your program is single-threaded, then you could also keep a dummy file
		1580	descriptor for overload situations (e.g. by opening F</dev/null>), and
		1581	when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
		1582	close that fd, and create a new dummy fd. This will gracefully refuse
		1583	clients under typical overload conditions.
		1584
		1585	The last way to handle it is to simply log the error and C<exit>, as
		1586	is often done with C<malloc> failures, but this results in an easy
		1587	opportunity for a DoS attack.
1232		1588
1233	=head3 Watcher-Specific Functions	1589	=head3 Watcher-Specific Functions
1234		1590
1235	=over 4	1591	=over 4
1236		1592
…		…
1283	year, it will still time out after (roughly) one hour. "Roughly" because	1639	year, it will still time out after (roughly) one hour. "Roughly" because
1284	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1640	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1285	monotonic clock option helps a lot here).	1641	monotonic clock option helps a lot here).
1286		1642
1287	The callback is guaranteed to be invoked only I<after> its timeout has	1643	The callback is guaranteed to be invoked only I<after> its timeout has
1288	passed, but if multiple timers become ready during the same loop iteration	1644	passed (not I<at>, so on systems with very low-resolution clocks this
1289	then order of execution is undefined.	1645	might introduce a small delay). If multiple timers become ready during the
		1646	same loop iteration then the ones with earlier time-out values are invoked
		1647	before ones of the same priority with later time-out values (but this is
		1648	no longer true when a callback calls C<ev_loop> recursively).
1290		1649
1291	=head3 Be smart about timeouts	1650	=head3 Be smart about timeouts
1292		1651
1293	Many real-world problems invole some kind of time-out, usually for error	1652	Many real-world problems involve some kind of timeout, usually for error
1294	recovery. A typical example is an HTTP request - if the other side hangs,	1653	recovery. A typical example is an HTTP request - if the other side hangs,
1295	you want to raise some error after a while.	1654	you want to raise some error after a while.
1296		1655
1297	Here are some ways on how to handle this problem, from simple and	1656	What follows are some ways to handle this problem, from obvious and
1298	inefficient to very efficient.	1657	inefficient to smart and efficient.
1299		1658
1300	In the following examples a 60 second activity timeout is assumed - a	1659	In the following, a 60 second activity timeout is assumed - a timeout that
1301	timeout that gets reset to 60 seconds each time some data ("a lifesign")	1660	gets reset to 60 seconds each time there is activity (e.g. each time some
1302	was received.	1661	data or other life sign was received).
1303		1662
1304	=over 4	1663	=over 4
1305		1664
1306	=item 1. Use a timer and stop, reinitialise, start it on activity.	1665	=item 1. Use a timer and stop, reinitialise and start it on activity.
1307		1666
1308	This is the most obvious, but not the most simple way: In the beginning,	1667	This is the most obvious, but not the most simple way: In the beginning,
1309	start the watcher:	1668	start the watcher:
1310		1669
1311	ev_timer_init (timer, callback, 60., 0.);	1670	ev_timer_init (timer, callback, 60., 0.);
1312	ev_timer_start (loop, timer);	1671	ev_timer_start (loop, timer);
1313		1672
1314	Then, each time there is some activity, C<ev_timer_stop> the timer,	1673	Then, each time there is some activity, C<ev_timer_stop> it, initialise it
1315	initialise it again, and start it:	1674	and start it again:
1316		1675
1317	ev_timer_stop (loop, timer);	1676	ev_timer_stop (loop, timer);
1318	ev_timer_set (timer, 60., 0.);	1677	ev_timer_set (timer, 60., 0.);
1319	ev_timer_start (loop, timer);	1678	ev_timer_start (loop, timer);
1320		1679
1321	This is relatively simple to implement, but means that each time there	1680	This is relatively simple to implement, but means that each time there is
1322	is some activity, libev will first have to remove the timer from it's	1681	some activity, libev will first have to remove the timer from its internal
1323	internal data strcuture and then add it again.	1682	data structure and then add it again. Libev tries to be fast, but it's
		1683	still not a constant-time operation.
1324		1684
1325	=item 2. Use a timer and re-start it with C<ev_timer_again> inactivity.	1685	=item 2. Use a timer and re-start it with C<ev_timer_again> inactivity.
1326		1686
1327	This is the easiest way, and involves using C<ev_timer_again> instead of	1687	This is the easiest way, and involves using C<ev_timer_again> instead of
1328	C<ev_timer_start>.	1688	C<ev_timer_start>.
1329		1689
1330	For this, configure an C<ev_timer> with a C<repeat> value of C<60> and	1690	To implement this, configure an C<ev_timer> with a C<repeat> value
1331	then call C<ev_timer_again> at start and each time you successfully read	1691	of C<60> and then call C<ev_timer_again> at start and each time you
1332	or write some data. If you go into an idle state where you do not expect	1692	successfully read or write some data. If you go into an idle state where
1333	data to travel on the socket, you can C<ev_timer_stop> the timer, and	1693	you do not expect data to travel on the socket, you can C<ev_timer_stop>
1334	C<ev_timer_again> will automatically restart it if need be.	1694	the timer, and C<ev_timer_again> will automatically restart it if need be.
1335		1695
1336	That means you can ignore the C<after> value and C<ev_timer_start>	1696	That means you can ignore both the C<ev_timer_start> function and the
1337	altogether and only ever use the C<repeat> value and C<ev_timer_again>.	1697	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
		1698	member and C<ev_timer_again>.
1338		1699
1339	At start:	1700	At start:
1340		1701
1341	ev_timer_init (timer, callback, 0., 60.);	1702	ev_init (timer, callback);
		1703	timer->repeat = 60.;
1342	ev_timer_again (loop, timer);	1704	ev_timer_again (loop, timer);
1343		1705
1344	Each time you receive some data:	1706	Each time there is some activity:
1345		1707
1346	ev_timer_again (loop, timer);	1708	ev_timer_again (loop, timer);
1347		1709
1348	It is even possible to change the time-out on the fly:	1710	It is even possible to change the time-out on the fly, regardless of
		1711	whether the watcher is active or not:
1349		1712
1350	timer->repeat = 30.;	1713	timer->repeat = 30.;
1351	ev_timer_again (loop, timer);	1714	ev_timer_again (loop, timer);
1352		1715
1353	This is slightly more efficient then stopping/starting the timer each time	1716	This is slightly more efficient then stopping/starting the timer each time
1354	you want to modify its timeout value, as libev does not have to completely	1717	you want to modify its timeout value, as libev does not have to completely
1355	remove and re-insert the timer from/into it's internal data structure.	1718	remove and re-insert the timer from/into its internal data structure.
		1719
		1720	It is, however, even simpler than the "obvious" way to do it.
1356		1721
1357	=item 3. Let the timer time out, but then re-arm it as required.	1722	=item 3. Let the timer time out, but then re-arm it as required.
1358		1723
1359	This method is more tricky, but usually most efficient: Most timeouts are	1724	This method is more tricky, but usually most efficient: Most timeouts are
1360	relatively long compared to the loop iteration time - in our example,	1725	relatively long compared to the intervals between other activity - in
1361	within 60 seconds, there are usually many I/O events with associated	1726	our example, within 60 seconds, there are usually many I/O events with
1362	activity resets.	1727	associated activity resets.
1363		1728
1364	In this case, it would be more efficient to leave the C<ev_timer> alone,	1729	In this case, it would be more efficient to leave the C<ev_timer> alone,
1365	but remember the time of last activity, and check for a real timeout only	1730	but remember the time of last activity, and check for a real timeout only
1366	within the callback:	1731	within the callback:
1367		1732
1368	ev_tstamp last_activity; // time of last activity	1733	ev_tstamp last_activity; // time of last activity
1369		1734
1370	static void	1735	static void
1371	callback (EV_P_ ev_timer *w, int revents)	1736	callback (EV_P_ ev_timer *w, int revents)
1372	{	1737	{
1373	ev_tstamp now = ev_now (EV_A);	1738	ev_tstamp now = ev_now (EV_A);
1374	ev_tstamp timeout = last_activity + 60.;	1739	ev_tstamp timeout = last_activity + 60.;
1375		1740
1376	// if last_activity is older than now - timeout, we did time out	1741	// if last_activity + 60. is older than now, we did time out
1377	if (timeout < now)	1742	if (timeout < now)
1378	{	1743	{
1379	// timeout occured, take action	1744	// timeout occurred, take action
1380	}	1745	}
1381	else	1746	else
1382	{	1747	{
1383	// callback was invoked, but there was some activity, re-arm	1748	// callback was invoked, but there was some activity, re-arm
1384	// to fire in last_activity + 60.	1749	// the watcher to fire in last_activity + 60, which is
		1750	// guaranteed to be in the future, so "again" is positive:
1385	w->again = timeout - now;	1751	w->repeat = timeout - now;
1386	ev_timer_again (EV_A_ w);	1752	ev_timer_again (EV_A_ w);
1387	}	1753	}
1388	}	1754	}
1389		1755
1390	To summarise the callback: first calculate the real time-out (defined as	1756	To summarise the callback: first calculate the real timeout (defined
1391	"60 seconds after the last activity"), then check if that time has been	1757	as "60 seconds after the last activity"), then check if that time has
1392	reached, which means there was a real timeout. Otherwise the callback was	1758	been reached, which means something I<did>, in fact, time out. Otherwise
1393	invoked too early (timeout is in the future), so re-schedule the timer to	1759	the callback was invoked too early (C<timeout> is in the future), so
1394	fire at that future time.	1760	re-schedule the timer to fire at that future time, to see if maybe we have
		1761	a timeout then.
1395		1762
1396	Note how C<ev_timer_again> is used, taking advantage of the	1763	Note how C<ev_timer_again> is used, taking advantage of the
1397	C<ev_timer_again> optimisation when the timer is already running.	1764	C<ev_timer_again> optimisation when the timer is already running.
1398		1765
1399	This scheme causes more callback invocations (about one every 60 seconds),	1766	This scheme causes more callback invocations (about one every 60 seconds
1400	but virtually no calls to libev to change the timeout.	1767	minus half the average time between activity), but virtually no calls to
		1768	libev to change the timeout.
1401		1769
1402	To start the timer, simply intiialise the watcher and C<last_activity>,	1770	To start the timer, simply initialise the watcher and set C<last_activity>
1403	then call the callback:	1771	to the current time (meaning we just have some activity :), then call the
		1772	callback, which will "do the right thing" and start the timer:
1404		1773
1405	ev_timer_init (timer, callback);	1774	ev_init (timer, callback);
1406	last_activity = ev_now (loop);	1775	last_activity = ev_now (loop);
1407	callback (loop, timer, EV_TIMEOUT);	1776	callback (loop, timer, EV_TIMER);
1408		1777
1409	And when there is some activity, simply remember the time in	1778	And when there is some activity, simply store the current time in
1410	C<last_activity>:	1779	C<last_activity>, no libev calls at all:
1411		1780
1412	last_actiivty = ev_now (loop);	1781	last_activity = ev_now (loop);
1413		1782
1414	This technique is slightly more complex, but in most cases where the	1783	This technique is slightly more complex, but in most cases where the
1415	time-out is unlikely to be triggered, much more efficient.	1784	time-out is unlikely to be triggered, much more efficient.
1416		1785
		1786	Changing the timeout is trivial as well (if it isn't hard-coded in the
		1787	callback :) - just change the timeout and invoke the callback, which will
		1788	fix things for you.
		1789
		1790	=item 4. Wee, just use a double-linked list for your timeouts.
		1791
		1792	If there is not one request, but many thousands (millions...), all
		1793	employing some kind of timeout with the same timeout value, then one can
		1794	do even better:
		1795
		1796	When starting the timeout, calculate the timeout value and put the timeout
		1797	at the I<end> of the list.
		1798
		1799	Then use an C<ev_timer> to fire when the timeout at the I<beginning> of
		1800	the list is expected to fire (for example, using the technique #3).
		1801
		1802	When there is some activity, remove the timer from the list, recalculate
		1803	the timeout, append it to the end of the list again, and make sure to
		1804	update the C<ev_timer> if it was taken from the beginning of the list.
		1805
		1806	This way, one can manage an unlimited number of timeouts in O(1) time for
		1807	starting, stopping and updating the timers, at the expense of a major
		1808	complication, and having to use a constant timeout. The constant timeout
		1809	ensures that the list stays sorted.
		1810
1417	=back	1811	=back
		1812
		1813	So which method the best?
		1814
		1815	Method #2 is a simple no-brain-required solution that is adequate in most
		1816	situations. Method #3 requires a bit more thinking, but handles many cases
		1817	better, and isn't very complicated either. In most case, choosing either
		1818	one is fine, with #3 being better in typical situations.
		1819
		1820	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
		1821	rather complicated, but extremely efficient, something that really pays
		1822	off after the first million or so of active timers, i.e. it's usually
		1823	overkill :)
1418		1824
1419	=head3 The special problem of time updates	1825	=head3 The special problem of time updates
1420		1826
1421	Establishing the current time is a costly operation (it usually takes at	1827	Establishing the current time is a costly operation (it usually takes at
1422	least two system calls): EV therefore updates its idea of the current	1828	least two system calls): EV therefore updates its idea of the current
…		…
1434		1840
1435	If the event loop is suspended for a long time, you can also force an	1841	If the event loop is suspended for a long time, you can also force an
1436	update of the time returned by C<ev_now ()> by calling C<ev_now_update	1842	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1437	()>.	1843	()>.
1438		1844
		1845	=head3 The special problems of suspended animation
		1846
		1847	When you leave the server world it is quite customary to hit machines that
		1848	can suspend/hibernate - what happens to the clocks during such a suspend?
		1849
		1850	Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
		1851	all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
		1852	to run until the system is suspended, but they will not advance while the
		1853	system is suspended. That means, on resume, it will be as if the program
		1854	was frozen for a few seconds, but the suspend time will not be counted
		1855	towards C<ev_timer> when a monotonic clock source is used. The real time
		1856	clock advanced as expected, but if it is used as sole clocksource, then a
		1857	long suspend would be detected as a time jump by libev, and timers would
		1858	be adjusted accordingly.
		1859
		1860	I would not be surprised to see different behaviour in different between
		1861	operating systems, OS versions or even different hardware.
		1862
		1863	The other form of suspend (job control, or sending a SIGSTOP) will see a
		1864	time jump in the monotonic clocks and the realtime clock. If the program
		1865	is suspended for a very long time, and monotonic clock sources are in use,
		1866	then you can expect C<ev_timer>s to expire as the full suspension time
		1867	will be counted towards the timers. When no monotonic clock source is in
		1868	use, then libev will again assume a timejump and adjust accordingly.
		1869
		1870	It might be beneficial for this latter case to call C<ev_suspend>
		1871	and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
		1872	deterministic behaviour in this case (you can do nothing against
		1873	C<SIGSTOP>).
		1874
1439	=head3 Watcher-Specific Functions and Data Members	1875	=head3 Watcher-Specific Functions and Data Members
1440		1876
1441	=over 4	1877	=over 4
1442		1878
1443	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1879	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
…		…
1466	If the timer is started but non-repeating, stop it (as if it timed out).	1902	If the timer is started but non-repeating, stop it (as if it timed out).
1467		1903
1468	If the timer is repeating, either start it if necessary (with the	1904	If the timer is repeating, either start it if necessary (with the
1469	C<repeat> value), or reset the running timer to the C<repeat> value.	1905	C<repeat> value), or reset the running timer to the C<repeat> value.
1470		1906
1471	This sounds a bit complicated, see "Be smart about timeouts", above, for a	1907	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1472	usage example.	1908	usage example.
		1909
		1910	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
		1911
		1912	Returns the remaining time until a timer fires. If the timer is active,
		1913	then this time is relative to the current event loop time, otherwise it's
		1914	the timeout value currently configured.
		1915
		1916	That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
		1917	C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
		1918	will return C<4>. When the timer expires and is restarted, it will return
		1919	roughly C<7> (likely slightly less as callback invocation takes some time,
		1920	too), and so on.
1473		1921
1474	=item ev_tstamp repeat [read-write]	1922	=item ev_tstamp repeat [read-write]
1475		1923
1476	The current C<repeat> value. Will be used each time the watcher times out	1924	The current C<repeat> value. Will be used each time the watcher times out
1477	or C<ev_timer_again> is called, and determines the next timeout (if any),	1925	or C<ev_timer_again> is called, and determines the next timeout (if any),
…		…
1515	=head2 C<ev_periodic> - to cron or not to cron?	1963	=head2 C<ev_periodic> - to cron or not to cron?
1516		1964
1517	Periodic watchers are also timers of a kind, but they are very versatile	1965	Periodic watchers are also timers of a kind, but they are very versatile
1518	(and unfortunately a bit complex).	1966	(and unfortunately a bit complex).
1519		1967
1520	Unlike C<ev_timer>'s, they are not based on real time (or relative time)	1968	Unlike C<ev_timer>, periodic watchers are not based on real time (or
1521	but on wall clock time (absolute time). You can tell a periodic watcher	1969	relative time, the physical time that passes) but on wall clock time
1522	to trigger after some specific point in time. For example, if you tell a	1970	(absolute time, the thing you can read on your calender or clock). The
1523	periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()	1971	difference is that wall clock time can run faster or slower than real
1524	+ 10.>, that is, an absolute time not a delay) and then reset your system	1972	time, and time jumps are not uncommon (e.g. when you adjust your
1525	clock to January of the previous year, then it will take more than year	1973	wrist-watch).
1526	to trigger the event (unlike an C<ev_timer>, which would still trigger
1527	roughly 10 seconds later as it uses a relative timeout).
1528		1974
		1975	You can tell a periodic watcher to trigger after some specific point
		1976	in time: for example, if you tell a periodic watcher to trigger "in 10
		1977	seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time
		1978	not a delay) and then reset your system clock to January of the previous
		1979	year, then it will take a year or more to trigger the event (unlike an
		1980	C<ev_timer>, which would still trigger roughly 10 seconds after starting
		1981	it, as it uses a relative timeout).
		1982
1529	C<ev_periodic>s can also be used to implement vastly more complex timers,	1983	C<ev_periodic> watchers can also be used to implement vastly more complex
1530	such as triggering an event on each "midnight, local time", or other	1984	timers, such as triggering an event on each "midnight, local time", or
1531	complicated rules.	1985	other complicated rules. This cannot be done with C<ev_timer> watchers, as
		1986	those cannot react to time jumps.
1532		1987
1533	As with timers, the callback is guaranteed to be invoked only when the	1988	As with timers, the callback is guaranteed to be invoked only when the
1534	time (C<at>) has passed, but if multiple periodic timers become ready	1989	point in time where it is supposed to trigger has passed. If multiple
1535	during the same loop iteration, then order of execution is undefined.	1990	timers become ready during the same loop iteration then the ones with
		1991	earlier time-out values are invoked before ones with later time-out values
		1992	(but this is no longer true when a callback calls C<ev_loop> recursively).
1536		1993
1537	=head3 Watcher-Specific Functions and Data Members	1994	=head3 Watcher-Specific Functions and Data Members
1538		1995
1539	=over 4	1996	=over 4
1540		1997
1541	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1998	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1542		1999
1543	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	2000	=item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1544		2001
1545	Lots of arguments, lets sort it out... There are basically three modes of	2002	Lots of arguments, let's sort it out... There are basically three modes of
1546	operation, and we will explain them from simplest to most complex:	2003	operation, and we will explain them from simplest to most complex:
1547		2004
1548	=over 4	2005	=over 4
1549		2006
1550	=item * absolute timer (at = time, interval = reschedule_cb = 0)	2007	=item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0)
1551		2008
1552	In this configuration the watcher triggers an event after the wall clock	2009	In this configuration the watcher triggers an event after the wall clock
1553	time C<at> has passed. It will not repeat and will not adjust when a time	2010	time C<offset> has passed. It will not repeat and will not adjust when a
1554	jump occurs, that is, if it is to be run at January 1st 2011 then it will	2011	time jump occurs, that is, if it is to be run at January 1st 2011 then it
1555	only run when the system clock reaches or surpasses this time.	2012	will be stopped and invoked when the system clock reaches or surpasses
		2013	this point in time.
1556		2014
1557	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)	2015	=item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0)
1558		2016
1559	In this mode the watcher will always be scheduled to time out at the next	2017	In this mode the watcher will always be scheduled to time out at the next
1560	C<at + N * interval> time (for some integer N, which can also be negative)	2018	C<offset + N * interval> time (for some integer N, which can also be
1561	and then repeat, regardless of any time jumps.	2019	negative) and then repeat, regardless of any time jumps. The C<offset>
		2020	argument is merely an offset into the C<interval> periods.
1562		2021
1563	This can be used to create timers that do not drift with respect to the	2022	This can be used to create timers that do not drift with respect to the
1564	system clock, for example, here is a C<ev_periodic> that triggers each	2023	system clock, for example, here is an C<ev_periodic> that triggers each
1565	hour, on the hour:	2024	hour, on the hour (with respect to UTC):
1566		2025
1567	ev_periodic_set (&periodic, 0., 3600., 0);	2026	ev_periodic_set (&periodic, 0., 3600., 0);
1568		2027
1569	This doesn't mean there will always be 3600 seconds in between triggers,	2028	This doesn't mean there will always be 3600 seconds in between triggers,
1570	but only that the callback will be called when the system time shows a	2029	but only that the callback will be called when the system time shows a
1571	full hour (UTC), or more correctly, when the system time is evenly divisible	2030	full hour (UTC), or more correctly, when the system time is evenly divisible
1572	by 3600.	2031	by 3600.
1573		2032
1574	Another way to think about it (for the mathematically inclined) is that	2033	Another way to think about it (for the mathematically inclined) is that
1575	C<ev_periodic> will try to run the callback in this mode at the next possible	2034	C<ev_periodic> will try to run the callback in this mode at the next possible
1576	time where C<time = at (mod interval)>, regardless of any time jumps.	2035	time where C<time = offset (mod interval)>, regardless of any time jumps.
1577		2036
1578	For numerical stability it is preferable that the C<at> value is near	2037	For numerical stability it is preferable that the C<offset> value is near
1579	C<ev_now ()> (the current time), but there is no range requirement for	2038	C<ev_now ()> (the current time), but there is no range requirement for
1580	this value, and in fact is often specified as zero.	2039	this value, and in fact is often specified as zero.
1581		2040
1582	Note also that there is an upper limit to how often a timer can fire (CPU	2041	Note also that there is an upper limit to how often a timer can fire (CPU
1583	speed for example), so if C<interval> is very small then timing stability	2042	speed for example), so if C<interval> is very small then timing stability
1584	will of course deteriorate. Libev itself tries to be exact to be about one	2043	will of course deteriorate. Libev itself tries to be exact to be about one
1585	millisecond (if the OS supports it and the machine is fast enough).	2044	millisecond (if the OS supports it and the machine is fast enough).
1586		2045
1587	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)	2046	=item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback)
1588		2047
1589	In this mode the values for C<interval> and C<at> are both being	2048	In this mode the values for C<interval> and C<offset> are both being
1590	ignored. Instead, each time the periodic watcher gets scheduled, the	2049	ignored. Instead, each time the periodic watcher gets scheduled, the
1591	reschedule callback will be called with the watcher as first, and the	2050	reschedule callback will be called with the watcher as first, and the
1592	current time as second argument.	2051	current time as second argument.
1593		2052
1594	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	2053	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever,
1595	ever, or make ANY event loop modifications whatsoever>.	2054	or make ANY other event loop modifications whatsoever, unless explicitly
		2055	allowed by documentation here>.
1596		2056
1597	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop	2057	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1598	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the	2058	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1599	only event loop modification you are allowed to do).	2059	only event loop modification you are allowed to do).
1600		2060
…		…
1630	a different time than the last time it was called (e.g. in a crond like	2090	a different time than the last time it was called (e.g. in a crond like
1631	program when the crontabs have changed).	2091	program when the crontabs have changed).
1632		2092
1633	=item ev_tstamp ev_periodic_at (ev_periodic *)	2093	=item ev_tstamp ev_periodic_at (ev_periodic *)
1634		2094
1635	When active, returns the absolute time that the watcher is supposed to	2095	When active, returns the absolute time that the watcher is supposed
1636	trigger next.	2096	to trigger next. This is not the same as the C<offset> argument to
		2097	C<ev_periodic_set>, but indeed works even in interval and manual
		2098	rescheduling modes.
1637		2099
1638	=item ev_tstamp offset [read-write]	2100	=item ev_tstamp offset [read-write]
1639		2101
1640	When repeating, this contains the offset value, otherwise this is the	2102	When repeating, this contains the offset value, otherwise this is the
1641	absolute point in time (the C<at> value passed to C<ev_periodic_set>).	2103	absolute point in time (the C<offset> value passed to C<ev_periodic_set>,
		2104	although libev might modify this value for better numerical stability).
1642		2105
1643	Can be modified any time, but changes only take effect when the periodic	2106	Can be modified any time, but changes only take effect when the periodic
1644	timer fires or C<ev_periodic_again> is being called.	2107	timer fires or C<ev_periodic_again> is being called.
1645		2108
1646	=item ev_tstamp interval [read-write]	2109	=item ev_tstamp interval [read-write]
…		…
1662	Example: Call a callback every hour, or, more precisely, whenever the	2125	Example: Call a callback every hour, or, more precisely, whenever the
1663	system time is divisible by 3600. The callback invocation times have	2126	system time is divisible by 3600. The callback invocation times have
1664	potentially a lot of jitter, but good long-term stability.	2127	potentially a lot of jitter, but good long-term stability.
1665		2128
1666	static void	2129	static void
1667	clock_cb (struct ev_loop *loop, ev_io *w, int revents)	2130	clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1668	{	2131	{
1669	... its now a full hour (UTC, or TAI or whatever your clock follows)	2132	... its now a full hour (UTC, or TAI or whatever your clock follows)
1670	}	2133	}
1671		2134
1672	ev_periodic hourly_tick;	2135	ev_periodic hourly_tick;
…		…
1698	Signal watchers will trigger an event when the process receives a specific	2161	Signal watchers will trigger an event when the process receives a specific
1699	signal one or more times. Even though signals are very asynchronous, libev	2162	signal one or more times. Even though signals are very asynchronous, libev
1700	will try it's best to deliver signals synchronously, i.e. as part of the	2163	will try it's best to deliver signals synchronously, i.e. as part of the
1701	normal event processing, like any other event.	2164	normal event processing, like any other event.
1702		2165
1703	If you want signals asynchronously, just use C<sigaction> as you would	2166	If you want signals to be delivered truly asynchronously, just use
1704	do without libev and forget about sharing the signal. You can even use	2167	C<sigaction> as you would do without libev and forget about sharing
1705	C<ev_async> from a signal handler to synchronously wake up an event loop.	2168	the signal. You can even use C<ev_async> from a signal handler to
		2169	synchronously wake up an event loop.
1706		2170
1707	You can configure as many watchers as you like per signal. Only when the	2171	You can configure as many watchers as you like for the same signal, but
		2172	only within the same loop, i.e. you can watch for C<SIGINT> in your
		2173	default loop and for C<SIGIO> in another loop, but you cannot watch for
		2174	C<SIGINT> in both the default loop and another loop at the same time. At
		2175	the moment, C<SIGCHLD> is permanently tied to the default loop.
		2176
1708	first watcher gets started will libev actually register a signal handler	2177	When the first watcher gets started will libev actually register something
1709	with the kernel (thus it coexists with your own signal handlers as long as	2178	with the kernel (thus it coexists with your own signal handlers as long as
1710	you don't register any with libev for the same signal). Similarly, when	2179	you don't register any with libev for the same signal).
1711	the last signal watcher for a signal is stopped, libev will reset the
1712	signal handler to SIG_DFL (regardless of what it was set to before).
1713		2180
1714	If possible and supported, libev will install its handlers with	2181	If possible and supported, libev will install its handlers with
1715	C<SA_RESTART> behaviour enabled, so system calls should not be unduly	2182	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1716	interrupted. If you have a problem with system calls getting interrupted by	2183	not be unduly interrupted. If you have a problem with system calls getting
1717	signals you can block all signals in an C<ev_check> watcher and unblock	2184	interrupted by signals you can block all signals in an C<ev_check> watcher
1718	them in an C<ev_prepare> watcher.	2185	and unblock them in an C<ev_prepare> watcher.
		2186
		2187	=head3 The special problem of inheritance over fork/execve/pthread_create
		2188
		2189	Both the signal mask (C<sigprocmask>) and the signal disposition
		2190	(C<sigaction>) are unspecified after starting a signal watcher (and after
		2191	stopping it again), that is, libev might or might not block the signal,
		2192	and might or might not set or restore the installed signal handler.
		2193
		2194	While this does not matter for the signal disposition (libev never
		2195	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
		2196	C<execve>), this matters for the signal mask: many programs do not expect
		2197	certain signals to be blocked.
		2198
		2199	This means that before calling C<exec> (from the child) you should reset
		2200	the signal mask to whatever "default" you expect (all clear is a good
		2201	choice usually).
		2202
		2203	The simplest way to ensure that the signal mask is reset in the child is
		2204	to install a fork handler with C<pthread_atfork> that resets it. That will
		2205	catch fork calls done by libraries (such as the libc) as well.
		2206
		2207	In current versions of libev, the signal will not be blocked indefinitely
		2208	unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
		2209	the window of opportunity for problems, it will not go away, as libev
		2210	I<has> to modify the signal mask, at least temporarily.
		2211
		2212	So I can't stress this enough: I<If you do not reset your signal mask when
		2213	you expect it to be empty, you have a race condition in your code>. This
		2214	is not a libev-specific thing, this is true for most event libraries.
1719		2215
1720	=head3 Watcher-Specific Functions and Data Members	2216	=head3 Watcher-Specific Functions and Data Members
1721		2217
1722	=over 4	2218	=over 4
1723		2219
…		…
1755	some child status changes (most typically when a child of yours dies or	2251	some child status changes (most typically when a child of yours dies or
1756	exits). It is permissible to install a child watcher I<after> the child	2252	exits). It is permissible to install a child watcher I<after> the child
1757	has been forked (which implies it might have already exited), as long	2253	has been forked (which implies it might have already exited), as long
1758	as the event loop isn't entered (or is continued from a watcher), i.e.,	2254	as the event loop isn't entered (or is continued from a watcher), i.e.,
1759	forking and then immediately registering a watcher for the child is fine,	2255	forking and then immediately registering a watcher for the child is fine,
1760	but forking and registering a watcher a few event loop iterations later is	2256	but forking and registering a watcher a few event loop iterations later or
1761	not.	2257	in the next callback invocation is not.
1762		2258
1763	Only the default event loop is capable of handling signals, and therefore	2259	Only the default event loop is capable of handling signals, and therefore
1764	you can only register child watchers in the default event loop.	2260	you can only register child watchers in the default event loop.
1765		2261
		2262	Due to some design glitches inside libev, child watchers will always be
		2263	handled at maximum priority (their priority is set to C<EV_MAXPRI> by
		2264	libev)
		2265
1766	=head3 Process Interaction	2266	=head3 Process Interaction
1767		2267
1768	Libev grabs C<SIGCHLD> as soon as the default event loop is	2268	Libev grabs C<SIGCHLD> as soon as the default event loop is
1769	initialised. This is necessary to guarantee proper behaviour even if	2269	initialised. This is necessary to guarantee proper behaviour even if the
1770	the first child watcher is started after the child exits. The occurrence	2270	first child watcher is started after the child exits. The occurrence
1771	of C<SIGCHLD> is recorded asynchronously, but child reaping is done	2271	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1772	synchronously as part of the event loop processing. Libev always reaps all	2272	synchronously as part of the event loop processing. Libev always reaps all
1773	children, even ones not watched.	2273	children, even ones not watched.
1774		2274
1775	=head3 Overriding the Built-In Processing	2275	=head3 Overriding the Built-In Processing
…		…
1785	=head3 Stopping the Child Watcher	2285	=head3 Stopping the Child Watcher
1786		2286
1787	Currently, the child watcher never gets stopped, even when the	2287	Currently, the child watcher never gets stopped, even when the
1788	child terminates, so normally one needs to stop the watcher in the	2288	child terminates, so normally one needs to stop the watcher in the
1789	callback. Future versions of libev might stop the watcher automatically	2289	callback. Future versions of libev might stop the watcher automatically
1790	when a child exit is detected.	2290	when a child exit is detected (calling C<ev_child_stop> twice is not a
		2291	problem).
1791		2292
1792	=head3 Watcher-Specific Functions and Data Members	2293	=head3 Watcher-Specific Functions and Data Members
1793		2294
1794	=over 4	2295	=over 4
1795		2296
…		…
1852		2353
1853		2354
1854	=head2 C<ev_stat> - did the file attributes just change?	2355	=head2 C<ev_stat> - did the file attributes just change?
1855		2356
1856	This watches a file system path for attribute changes. That is, it calls	2357	This watches a file system path for attribute changes. That is, it calls
1857	C<stat> regularly (or when the OS says it changed) and sees if it changed	2358	C<stat> on that path in regular intervals (or when the OS says it changed)
1858	compared to the last time, invoking the callback if it did.	2359	and sees if it changed compared to the last time, invoking the callback if
		2360	it did.
1859		2361
1860	The path does not need to exist: changing from "path exists" to "path does	2362	The path does not need to exist: changing from "path exists" to "path does
1861	not exist" is a status change like any other. The condition "path does	2363	not exist" is a status change like any other. The condition "path does not
1862	not exist" is signified by the C<st_nlink> field being zero (which is	2364	exist" (or more correctly "path cannot be stat'ed") is signified by the
1863	otherwise always forced to be at least one) and all the other fields of	2365	C<st_nlink> field being zero (which is otherwise always forced to be at
1864	the stat buffer having unspecified contents.	2366	least one) and all the other fields of the stat buffer having unspecified
		2367	contents.
1865		2368
1866	The path I<should> be absolute and I<must not> end in a slash. If it is	2369	The path I<must not> end in a slash or contain special components such as
		2370	C<.> or C<..>. The path I<should> be absolute: If it is relative and
1867	relative and your working directory changes, the behaviour is undefined.	2371	your working directory changes, then the behaviour is undefined.
1868		2372
1869	Since there is no standard kernel interface to do this, the portable	2373	Since there is no portable change notification interface available, the
1870	implementation simply calls C<stat (2)> regularly on the path to see if	2374	portable implementation simply calls C<stat(2)> regularly on the path
1871	it changed somehow. You can specify a recommended polling interval for	2375	to see if it changed somehow. You can specify a recommended polling
1872	this case. If you specify a polling interval of C<0> (highly recommended!)	2376	interval for this case. If you specify a polling interval of C<0> (highly
1873	then a I<suitable, unspecified default> value will be used (which	2377	recommended!) then a I<suitable, unspecified default> value will be used
1874	you can expect to be around five seconds, although this might change	2378	(which you can expect to be around five seconds, although this might
1875	dynamically). Libev will also impose a minimum interval which is currently	2379	change dynamically). Libev will also impose a minimum interval which is
1876	around C<0.1>, but thats usually overkill.	2380	currently around C<0.1>, but that's usually overkill.
1877		2381
1878	This watcher type is not meant for massive numbers of stat watchers,	2382	This watcher type is not meant for massive numbers of stat watchers,
1879	as even with OS-supported change notifications, this can be	2383	as even with OS-supported change notifications, this can be
1880	resource-intensive.	2384	resource-intensive.
1881		2385
1882	At the time of this writing, the only OS-specific interface implemented	2386	At the time of this writing, the only OS-specific interface implemented
1883	is the Linux inotify interface (implementing kqueue support is left as	2387	is the Linux inotify interface (implementing kqueue support is left as an
1884	an exercise for the reader. Note, however, that the author sees no way	2388	exercise for the reader. Note, however, that the author sees no way of
1885	of implementing C<ev_stat> semantics with kqueue).	2389	implementing C<ev_stat> semantics with kqueue, except as a hint).
1886		2390
1887	=head3 ABI Issues (Largefile Support)	2391	=head3 ABI Issues (Largefile Support)
1888		2392
1889	Libev by default (unless the user overrides this) uses the default	2393	Libev by default (unless the user overrides this) uses the default
1890	compilation environment, which means that on systems with large file	2394	compilation environment, which means that on systems with large file
1891	support disabled by default, you get the 32 bit version of the stat	2395	support disabled by default, you get the 32 bit version of the stat
1892	structure. When using the library from programs that change the ABI to	2396	structure. When using the library from programs that change the ABI to
1893	use 64 bit file offsets the programs will fail. In that case you have to	2397	use 64 bit file offsets the programs will fail. In that case you have to
1894	compile libev with the same flags to get binary compatibility. This is	2398	compile libev with the same flags to get binary compatibility. This is
1895	obviously the case with any flags that change the ABI, but the problem is	2399	obviously the case with any flags that change the ABI, but the problem is
1896	most noticeably disabled with ev_stat and large file support.	2400	most noticeably displayed with ev_stat and large file support.
1897		2401
1898	The solution for this is to lobby your distribution maker to make large	2402	The solution for this is to lobby your distribution maker to make large
1899	file interfaces available by default (as e.g. FreeBSD does) and not	2403	file interfaces available by default (as e.g. FreeBSD does) and not
1900	optional. Libev cannot simply switch on large file support because it has	2404	optional. Libev cannot simply switch on large file support because it has
1901	to exchange stat structures with application programs compiled using the	2405	to exchange stat structures with application programs compiled using the
1902	default compilation environment.	2406	default compilation environment.
1903		2407
1904	=head3 Inotify and Kqueue	2408	=head3 Inotify and Kqueue
1905		2409
1906	When C<inotify (7)> support has been compiled into libev (generally	2410	When C<inotify (7)> support has been compiled into libev and present at
1907	only available with Linux 2.6.25 or above due to bugs in earlier	2411	runtime, it will be used to speed up change detection where possible. The
1908	implementations) and present at runtime, it will be used to speed up	2412	inotify descriptor will be created lazily when the first C<ev_stat>
1909	change detection where possible. The inotify descriptor will be created	2413	watcher is being started.
1910	lazily when the first C<ev_stat> watcher is being started.
1911		2414
1912	Inotify presence does not change the semantics of C<ev_stat> watchers	2415	Inotify presence does not change the semantics of C<ev_stat> watchers
1913	except that changes might be detected earlier, and in some cases, to avoid	2416	except that changes might be detected earlier, and in some cases, to avoid
1914	making regular C<stat> calls. Even in the presence of inotify support	2417	making regular C<stat> calls. Even in the presence of inotify support
1915	there are many cases where libev has to resort to regular C<stat> polling,	2418	there are many cases where libev has to resort to regular C<stat> polling,
1916	but as long as the path exists, libev usually gets away without polling.	2419	but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
		2420	many bugs), the path exists (i.e. stat succeeds), and the path resides on
		2421	a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
		2422	xfs are fully working) libev usually gets away without polling.
1917		2423
1918	There is no support for kqueue, as apparently it cannot be used to	2424	There is no support for kqueue, as apparently it cannot be used to
1919	implement this functionality, due to the requirement of having a file	2425	implement this functionality, due to the requirement of having a file
1920	descriptor open on the object at all times, and detecting renames, unlinks	2426	descriptor open on the object at all times, and detecting renames, unlinks
1921	etc. is difficult.	2427	etc. is difficult.
1922		2428
		2429	=head3 C<stat ()> is a synchronous operation
		2430
		2431	Libev doesn't normally do any kind of I/O itself, and so is not blocking
		2432	the process. The exception are C<ev_stat> watchers - those call C<stat
		2433	()>, which is a synchronous operation.
		2434
		2435	For local paths, this usually doesn't matter: unless the system is very
		2436	busy or the intervals between stat's are large, a stat call will be fast,
		2437	as the path data is usually in memory already (except when starting the
		2438	watcher).
		2439
		2440	For networked file systems, calling C<stat ()> can block an indefinite
		2441	time due to network issues, and even under good conditions, a stat call
		2442	often takes multiple milliseconds.
		2443
		2444	Therefore, it is best to avoid using C<ev_stat> watchers on networked
		2445	paths, although this is fully supported by libev.
		2446
1923	=head3 The special problem of stat time resolution	2447	=head3 The special problem of stat time resolution
1924		2448
1925	The C<stat ()> system call only supports full-second resolution portably, and	2449	The C<stat ()> system call only supports full-second resolution portably,
1926	even on systems where the resolution is higher, most file systems still	2450	and even on systems where the resolution is higher, most file systems
1927	only support whole seconds.	2451	still only support whole seconds.
1928		2452
1929	That means that, if the time is the only thing that changes, you can	2453	That means that, if the time is the only thing that changes, you can
1930	easily miss updates: on the first update, C<ev_stat> detects a change and	2454	easily miss updates: on the first update, C<ev_stat> detects a change and
1931	calls your callback, which does something. When there is another update	2455	calls your callback, which does something. When there is another update
1932	within the same second, C<ev_stat> will be unable to detect unless the	2456	within the same second, C<ev_stat> will be unable to detect unless the
…		…
2075		2599
2076	=head3 Watcher-Specific Functions and Data Members	2600	=head3 Watcher-Specific Functions and Data Members
2077		2601
2078	=over 4	2602	=over 4
2079		2603
2080	=item ev_idle_init (ev_signal *, callback)	2604	=item ev_idle_init (ev_idle *, callback)
2081		2605
2082	Initialises and configures the idle watcher - it has no parameters of any	2606	Initialises and configures the idle watcher - it has no parameters of any
2083	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,	2607	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
2084	believe me.	2608	believe me.
2085		2609
…		…
2098	// no longer anything immediate to do.	2622	// no longer anything immediate to do.
2099	}	2623	}
2100		2624
2101	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2625	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2102	ev_idle_init (idle_watcher, idle_cb);	2626	ev_idle_init (idle_watcher, idle_cb);
2103	ev_idle_start (loop, idle_cb);	2627	ev_idle_start (loop, idle_watcher);
2104		2628
2105		2629
2106	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2630	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2107		2631
2108	Prepare and check watchers are usually (but not always) used in pairs:	2632	Prepare and check watchers are usually (but not always) used in pairs:
…		…
2201	struct pollfd fds [nfd];	2725	struct pollfd fds [nfd];
2202	// actual code will need to loop here and realloc etc.	2726	// actual code will need to loop here and realloc etc.
2203	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2727	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2204		2728
2205	/* the callback is illegal, but won't be called as we stop during check */	2729	/* the callback is illegal, but won't be called as we stop during check */
2206	ev_timer_init (&tw, 0, timeout * 1e-3);	2730	ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2207	ev_timer_start (loop, &tw);	2731	ev_timer_start (loop, &tw);
2208		2732
2209	// create one ev_io per pollfd	2733	// create one ev_io per pollfd
2210	for (int i = 0; i < nfd; ++i)	2734	for (int i = 0; i < nfd; ++i)
2211	{	2735	{
…		…
2324	some fds have to be watched and handled very quickly (with low latency),	2848	some fds have to be watched and handled very quickly (with low latency),
2325	and even priorities and idle watchers might have too much overhead. In	2849	and even priorities and idle watchers might have too much overhead. In
2326	this case you would put all the high priority stuff in one loop and all	2850	this case you would put all the high priority stuff in one loop and all
2327	the rest in a second one, and embed the second one in the first.	2851	the rest in a second one, and embed the second one in the first.
2328		2852
2329	As long as the watcher is active, the callback will be invoked every time	2853	As long as the watcher is active, the callback will be invoked every
2330	there might be events pending in the embedded loop. The callback must then	2854	time there might be events pending in the embedded loop. The callback
2331	call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke	2855	must then call C<ev_embed_sweep (mainloop, watcher)> to make a single
2332	their callbacks (you could also start an idle watcher to give the embedded	2856	sweep and invoke their callbacks (the callback doesn't need to invoke the
2333	loop strictly lower priority for example). You can also set the callback	2857	C<ev_embed_sweep> function directly, it could also start an idle watcher
2334	to C<0>, in which case the embed watcher will automatically execute the	2858	to give the embedded loop strictly lower priority for example).
2335	embedded loop sweep.
2336		2859
2337	As long as the watcher is started it will automatically handle events. The	2860	You can also set the callback to C<0>, in which case the embed watcher
2338	callback will be invoked whenever some events have been handled. You can	2861	will automatically execute the embedded loop sweep whenever necessary.
2339	set the callback to C<0> to avoid having to specify one if you are not
2340	interested in that.
2341		2862
2342	Also, there have not currently been made special provisions for forking:	2863	Fork detection will be handled transparently while the C<ev_embed> watcher
2343	when you fork, you not only have to call C<ev_loop_fork> on both loops,	2864	is active, i.e., the embedded loop will automatically be forked when the
2344	but you will also have to stop and restart any C<ev_embed> watchers	2865	embedding loop forks. In other cases, the user is responsible for calling
2345	yourself - but you can use a fork watcher to handle this automatically,	2866	C<ev_loop_fork> on the embedded loop.
2346	and future versions of libev might do just that.
2347		2867
2348	Unfortunately, not all backends are embeddable: only the ones returned by	2868	Unfortunately, not all backends are embeddable: only the ones returned by
2349	C<ev_embeddable_backends> are, which, unfortunately, does not include any	2869	C<ev_embeddable_backends> are, which, unfortunately, does not include any
2350	portable one.	2870	portable one.
2351		2871
…		…
2445	event loop blocks next and before C<ev_check> watchers are being called,	2965	event loop blocks next and before C<ev_check> watchers are being called,
2446	and only in the child after the fork. If whoever good citizen calling	2966	and only in the child after the fork. If whoever good citizen calling
2447	C<ev_default_fork> cheats and calls it in the wrong process, the fork	2967	C<ev_default_fork> cheats and calls it in the wrong process, the fork
2448	handlers will be invoked, too, of course.	2968	handlers will be invoked, too, of course.
2449		2969
		2970	=head3 The special problem of life after fork - how is it possible?
		2971
		2972	Most uses of C<fork()> consist of forking, then some simple calls to set
		2973	up/change the process environment, followed by a call to C<exec()>. This
		2974	sequence should be handled by libev without any problems.
		2975
		2976	This changes when the application actually wants to do event handling
		2977	in the child, or both parent in child, in effect "continuing" after the
		2978	fork.
		2979
		2980	The default mode of operation (for libev, with application help to detect
		2981	forks) is to duplicate all the state in the child, as would be expected
		2982	when I<either> the parent I<or> the child process continues.
		2983
		2984	When both processes want to continue using libev, then this is usually the
		2985	wrong result. In that case, usually one process (typically the parent) is
		2986	supposed to continue with all watchers in place as before, while the other
		2987	process typically wants to start fresh, i.e. without any active watchers.
		2988
		2989	The cleanest and most efficient way to achieve that with libev is to
		2990	simply create a new event loop, which of course will be "empty", and
		2991	use that for new watchers. This has the advantage of not touching more
		2992	memory than necessary, and thus avoiding the copy-on-write, and the
		2993	disadvantage of having to use multiple event loops (which do not support
		2994	signal watchers).
		2995
		2996	When this is not possible, or you want to use the default loop for
		2997	other reasons, then in the process that wants to start "fresh", call
		2998	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
		2999	the default loop will "orphan" (not stop) all registered watchers, so you
		3000	have to be careful not to execute code that modifies those watchers. Note
		3001	also that in that case, you have to re-register any signal watchers.
		3002
2450	=head3 Watcher-Specific Functions and Data Members	3003	=head3 Watcher-Specific Functions and Data Members
2451		3004
2452	=over 4	3005	=over 4
2453		3006
2454	=item ev_fork_init (ev_signal *, callback)	3007	=item ev_fork_init (ev_signal *, callback)
…		…
2458	believe me.	3011	believe me.
2459		3012
2460	=back	3013	=back
2461		3014
2462		3015
2463	=head2 C<ev_async> - how to wake up another event loop	3016	=head2 C<ev_async> - how to wake up an event loop
2464		3017
2465	In general, you cannot use an C<ev_loop> from multiple threads or other	3018	In general, you cannot use an C<ev_loop> from multiple threads or other
2466	asynchronous sources such as signal handlers (as opposed to multiple event	3019	asynchronous sources such as signal handlers (as opposed to multiple event
2467	loops - those are of course safe to use in different threads).	3020	loops - those are of course safe to use in different threads).
2468		3021
2469	Sometimes, however, you need to wake up another event loop you do not	3022	Sometimes, however, you need to wake up an event loop you do not control,
2470	control, for example because it belongs to another thread. This is what	3023	for example because it belongs to another thread. This is what C<ev_async>
2471	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you	3024	watchers do: as long as the C<ev_async> watcher is active, you can signal
2472	can signal it by calling C<ev_async_send>, which is thread- and signal	3025	it by calling C<ev_async_send>, which is thread- and signal safe.
2473	safe.
2474		3026
2475	This functionality is very similar to C<ev_signal> watchers, as signals,	3027	This functionality is very similar to C<ev_signal> watchers, as signals,
2476	too, are asynchronous in nature, and signals, too, will be compressed	3028	too, are asynchronous in nature, and signals, too, will be compressed
2477	(i.e. the number of callback invocations may be less than the number of	3029	(i.e. the number of callback invocations may be less than the number of
2478	C<ev_async_sent> calls).	3030	C<ev_async_sent> calls).
…		…
2483	=head3 Queueing	3035	=head3 Queueing
2484		3036
2485	C<ev_async> does not support queueing of data in any way. The reason	3037	C<ev_async> does not support queueing of data in any way. The reason
2486	is that the author does not know of a simple (or any) algorithm for a	3038	is that the author does not know of a simple (or any) algorithm for a
2487	multiple-writer-single-reader queue that works in all cases and doesn't	3039	multiple-writer-single-reader queue that works in all cases and doesn't
2488	need elaborate support such as pthreads.	3040	need elaborate support such as pthreads or unportable memory access
		3041	semantics.
2489		3042
2490	That means that if you want to queue data, you have to provide your own	3043	That means that if you want to queue data, you have to provide your own
2491	queue. But at least I can tell you how to implement locking around your	3044	queue. But at least I can tell you how to implement locking around your
2492	queue:	3045	queue:
2493		3046
…		…
2571	=over 4	3124	=over 4
2572		3125
2573	=item ev_async_init (ev_async *, callback)	3126	=item ev_async_init (ev_async *, callback)
2574		3127
2575	Initialises and configures the async watcher - it has no parameters of any	3128	Initialises and configures the async watcher - it has no parameters of any
2576	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,	3129	kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2577	trust me.	3130	trust me.
2578		3131
2579	=item ev_async_send (loop, ev_async *)	3132	=item ev_async_send (loop, ev_async *)
2580		3133
2581	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3134	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2582	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3135	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2583	C<ev_feed_event>, this call is safe to do from other threads, signal or	3136	C<ev_feed_event>, this call is safe to do from other threads, signal or
2584	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3137	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2585	section below on what exactly this means).	3138	section below on what exactly this means).
2586		3139
		3140	Note that, as with other watchers in libev, multiple events might get
		3141	compressed into a single callback invocation (another way to look at this
		3142	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
		3143	reset when the event loop detects that).
		3144
2587	This call incurs the overhead of a system call only once per loop iteration,	3145	This call incurs the overhead of a system call only once per event loop
2588	so while the overhead might be noticeable, it doesn't apply to repeated	3146	iteration, so while the overhead might be noticeable, it doesn't apply to
2589	calls to C<ev_async_send>.	3147	repeated calls to C<ev_async_send> for the same event loop.
2590		3148
2591	=item bool = ev_async_pending (ev_async *)	3149	=item bool = ev_async_pending (ev_async *)
2592		3150
2593	Returns a non-zero value when C<ev_async_send> has been called on the	3151	Returns a non-zero value when C<ev_async_send> has been called on the
2594	watcher but the event has not yet been processed (or even noted) by the	3152	watcher but the event has not yet been processed (or even noted) by the
…		…
2597	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When	3155	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2598	the loop iterates next and checks for the watcher to have become active,	3156	the loop iterates next and checks for the watcher to have become active,
2599	it will reset the flag again. C<ev_async_pending> can be used to very	3157	it will reset the flag again. C<ev_async_pending> can be used to very
2600	quickly check whether invoking the loop might be a good idea.	3158	quickly check whether invoking the loop might be a good idea.
2601		3159
2602	Not that this does I<not> check whether the watcher itself is pending, only	3160	Not that this does I<not> check whether the watcher itself is pending,
2603	whether it has been requested to make this watcher pending.	3161	only whether it has been requested to make this watcher pending: there
		3162	is a time window between the event loop checking and resetting the async
		3163	notification, and the callback being invoked.
2604		3164
2605	=back	3165	=back
2606		3166
2607		3167
2608	=head1 OTHER FUNCTIONS	3168	=head1 OTHER FUNCTIONS
…		…
2625		3185
2626	If C<timeout> is less than 0, then no timeout watcher will be	3186	If C<timeout> is less than 0, then no timeout watcher will be
2627	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	3187	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2628	repeat = 0) will be started. C<0> is a valid timeout.	3188	repeat = 0) will be started. C<0> is a valid timeout.
2629		3189
2630	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	3190	The callback has the type C<void (*cb)(int revents, void *arg)> and is
2631	passed an C<revents> set like normal event callbacks (a combination of	3191	passed an C<revents> set like normal event callbacks (a combination of
2632	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	3192	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2633	value passed to C<ev_once>. Note that it is possible to receive I<both>	3193	value passed to C<ev_once>. Note that it is possible to receive I<both>
2634	a timeout and an io event at the same time - you probably should give io	3194	a timeout and an io event at the same time - you probably should give io
2635	events precedence.	3195	events precedence.
2636		3196
2637	Example: wait up to ten seconds for data to appear on STDIN_FILENO.	3197	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2638		3198
2639	static void stdin_ready (int revents, void *arg)	3199	static void stdin_ready (int revents, void *arg)
2640	{	3200	{
2641	if (revents & EV_READ)	3201	if (revents & EV_READ)
2642	/* stdin might have data for us, joy! */;	3202	/* stdin might have data for us, joy! */;
2643	else if (revents & EV_TIMEOUT)	3203	else if (revents & EV_TIMER)
2644	/* doh, nothing entered */;	3204	/* doh, nothing entered */;
2645	}	3205	}
2646		3206
2647	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3207	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2648		3208
2649	=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2650
2651	Feeds the given event set into the event loop, as if the specified event
2652	had happened for the specified watcher (which must be a pointer to an
2653	initialised but not necessarily started event watcher).
2654
2655	=item ev_feed_fd_event (struct ev_loop *, int fd, int revents)	3209	=item ev_feed_fd_event (loop, int fd, int revents)
2656		3210
2657	Feed an event on the given fd, as if a file descriptor backend detected	3211	Feed an event on the given fd, as if a file descriptor backend detected
2658	the given events it.	3212	the given events it.
2659		3213
2660	=item ev_feed_signal_event (struct ev_loop *loop, int signum)	3214	=item ev_feed_signal_event (loop, int signum)
2661		3215
2662	Feed an event as if the given signal occurred (C<loop> must be the default	3216	Feed an event as if the given signal occurred (C<loop> must be the default
2663	loop!).	3217	loop!).
2664		3218
2665	=back	3219	=back
…		…
2745		3299
2746	=over 4	3300	=over 4
2747		3301
2748	=item ev::TYPE::TYPE ()	3302	=item ev::TYPE::TYPE ()
2749		3303
2750	=item ev::TYPE::TYPE (struct ev_loop *)	3304	=item ev::TYPE::TYPE (loop)
2751		3305
2752	=item ev::TYPE::~TYPE	3306	=item ev::TYPE::~TYPE
2753		3307
2754	The constructor (optionally) takes an event loop to associate the watcher	3308	The constructor (optionally) takes an event loop to associate the watcher
2755	with. If it is omitted, it will use C<EV_DEFAULT>.	3309	with. If it is omitted, it will use C<EV_DEFAULT>.
…		…
2787		3341
2788	myclass obj;	3342	myclass obj;
2789	ev::io iow;	3343	ev::io iow;
2790	iow.set <myclass, &myclass::io_cb> (&obj);	3344	iow.set <myclass, &myclass::io_cb> (&obj);
2791		3345
		3346	=item w->set (object *)
		3347
		3348	This is a variation of a method callback - leaving out the method to call
		3349	will default the method to C<operator ()>, which makes it possible to use
		3350	functor objects without having to manually specify the C<operator ()> all
		3351	the time. Incidentally, you can then also leave out the template argument
		3352	list.
		3353
		3354	The C<operator ()> method prototype must be C<void operator ()(watcher &w,
		3355	int revents)>.
		3356
		3357	See the method-C<set> above for more details.
		3358
		3359	Example: use a functor object as callback.
		3360
		3361	struct myfunctor
		3362	{
		3363	void operator() (ev::io &w, int revents)
		3364	{
		3365	...
		3366	}
		3367	}
		3368
		3369	myfunctor f;
		3370
		3371	ev::io w;
		3372	w.set (&f);
		3373
2792	=item w->set<function> (void *data = 0)	3374	=item w->set<function> (void *data = 0)
2793		3375
2794	Also sets a callback, but uses a static method or plain function as	3376	Also sets a callback, but uses a static method or plain function as
2795	callback. The optional C<data> argument will be stored in the watcher's	3377	callback. The optional C<data> argument will be stored in the watcher's
2796	C<data> member and is free for you to use.	3378	C<data> member and is free for you to use.
…		…
2802	Example: Use a plain function as callback.	3384	Example: Use a plain function as callback.
2803		3385
2804	static void io_cb (ev::io &w, int revents) { }	3386	static void io_cb (ev::io &w, int revents) { }
2805	iow.set <io_cb> ();	3387	iow.set <io_cb> ();
2806		3388
2807	=item w->set (struct ev_loop *)	3389	=item w->set (loop)
2808		3390
2809	Associates a different C<struct ev_loop> with this watcher. You can only	3391	Associates a different C<struct ev_loop> with this watcher. You can only
2810	do this when the watcher is inactive (and not pending either).	3392	do this when the watcher is inactive (and not pending either).
2811		3393
2812	=item w->set ([arguments])	3394	=item w->set ([arguments])
2813		3395
2814	Basically the same as C<ev_TYPE_set>, with the same arguments. Must be	3396	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
2815	called at least once. Unlike the C counterpart, an active watcher gets	3397	method or a suitable start method must be called at least once. Unlike the
2816	automatically stopped and restarted when reconfiguring it with this	3398	C counterpart, an active watcher gets automatically stopped and restarted
2817	method.	3399	when reconfiguring it with this method.
2818		3400
2819	=item w->start ()	3401	=item w->start ()
2820		3402
2821	Starts the watcher. Note that there is no C<loop> argument, as the	3403	Starts the watcher. Note that there is no C<loop> argument, as the
2822	constructor already stores the event loop.	3404	constructor already stores the event loop.
2823		3405
		3406	=item w->start ([arguments])
		3407
		3408	Instead of calling C<set> and C<start> methods separately, it is often
		3409	convenient to wrap them in one call. Uses the same type of arguments as
		3410	the configure C<set> method of the watcher.
		3411
2824	=item w->stop ()	3412	=item w->stop ()
2825		3413
2826	Stops the watcher if it is active. Again, no C<loop> argument.	3414	Stops the watcher if it is active. Again, no C<loop> argument.
2827		3415
2828	=item w->again () (C<ev::timer>, C<ev::periodic> only)	3416	=item w->again () (C<ev::timer>, C<ev::periodic> only)
…		…
2840		3428
2841	=back	3429	=back
2842		3430
2843	=back	3431	=back
2844		3432
2845	Example: Define a class with an IO and idle watcher, start one of them in	3433	Example: Define a class with two I/O and idle watchers, start the I/O
2846	the constructor.	3434	watchers in the constructor.
2847		3435
2848	class myclass	3436	class myclass
2849	{	3437	{
2850	ev::io io ; void io_cb (ev::io &w, int revents);	3438	ev::io io ; void io_cb (ev::io &w, int revents);
		3439	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
2851	ev::idle idle; void idle_cb (ev::idle &w, int revents);	3440	ev::idle idle; void idle_cb (ev::idle &w, int revents);
2852		3441
2853	myclass (int fd)	3442	myclass (int fd)
2854	{	3443	{
2855	io .set <myclass, &myclass::io_cb > (this);	3444	io .set <myclass, &myclass::io_cb > (this);
		3445	io2 .set <myclass, &myclass::io2_cb > (this);
2856	idle.set <myclass, &myclass::idle_cb> (this);	3446	idle.set <myclass, &myclass::idle_cb> (this);
2857		3447
2858	io.start (fd, ev::READ);	3448	io.set (fd, ev::WRITE); // configure the watcher
		3449	io.start (); // start it whenever convenient
		3450
		3451	io2.start (fd, ev::READ); // set + start in one call
2859	}	3452	}
2860	};	3453	};
2861		3454
2862		3455
2863	=head1 OTHER LANGUAGE BINDINGS	3456	=head1 OTHER LANGUAGE BINDINGS
…		…
2882	L<http://software.schmorp.de/pkg/EV>.	3475	L<http://software.schmorp.de/pkg/EV>.
2883		3476
2884	=item Python	3477	=item Python
2885		3478
2886	Python bindings can be found at L<http://code.google.com/p/pyev/>. It	3479	Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2887	seems to be quite complete and well-documented. Note, however, that the	3480	seems to be quite complete and well-documented.
2888	patch they require for libev is outright dangerous as it breaks the ABI
2889	for everybody else, and therefore, should never be applied in an installed
2890	libev (if python requires an incompatible ABI then it needs to embed
2891	libev).
2892		3481
2893	=item Ruby	3482	=item Ruby
2894		3483
2895	Tony Arcieri has written a ruby extension that offers access to a subset	3484	Tony Arcieri has written a ruby extension that offers access to a subset
2896	of the libev API and adds file handle abstractions, asynchronous DNS and	3485	of the libev API and adds file handle abstractions, asynchronous DNS and
2897	more on top of it. It can be found via gem servers. Its homepage is at	3486	more on top of it. It can be found via gem servers. Its homepage is at
2898	L<http://rev.rubyforge.org/>.	3487	L<http://rev.rubyforge.org/>.
2899		3488
		3489	Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
		3490	makes rev work even on mingw.
		3491
		3492	=item Haskell
		3493
		3494	A haskell binding to libev is available at
		3495	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
		3496
2900	=item D	3497	=item D
2901		3498
2902	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	3499	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2903	be found at L<http://proj.llucax.com.ar/wiki/evd>.	3500	be found at L<http://proj.llucax.com.ar/wiki/evd>.
		3501
		3502	=item Ocaml
		3503
		3504	Erkki Seppala has written Ocaml bindings for libev, to be found at
		3505	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
		3506
		3507	=item Lua
		3508
		3509	Brian Maher has written a partial interface to libev for lua (at the
		3510	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
		3511	L<http://github.com/brimworks/lua-ev>.
2904		3512
2905	=back	3513	=back
2906		3514
2907		3515
2908	=head1 MACRO MAGIC	3516	=head1 MACRO MAGIC
…		…
3009		3617
3010	#define EV_STANDALONE 1	3618	#define EV_STANDALONE 1
3011	#include "ev.h"	3619	#include "ev.h"
3012		3620
3013	Both header files and implementation files can be compiled with a C++	3621	Both header files and implementation files can be compiled with a C++
3014	compiler (at least, thats a stated goal, and breakage will be treated	3622	compiler (at least, that's a stated goal, and breakage will be treated
3015	as a bug).	3623	as a bug).
3016		3624
3017	You need the following files in your source tree, or in a directory	3625	You need the following files in your source tree, or in a directory
3018	in your include path (e.g. in libev/ when using -Ilibev):	3626	in your include path (e.g. in libev/ when using -Ilibev):
3019		3627
…		…
3062	libev.m4	3670	libev.m4
3063		3671
3064	=head2 PREPROCESSOR SYMBOLS/MACROS	3672	=head2 PREPROCESSOR SYMBOLS/MACROS
3065		3673
3066	Libev can be configured via a variety of preprocessor symbols you have to	3674	Libev can be configured via a variety of preprocessor symbols you have to
3067	define before including any of its files. The default in the absence of	3675	define before including (or compiling) any of its files. The default in
3068	autoconf is documented for every option.	3676	the absence of autoconf is documented for every option.
		3677
		3678	Symbols marked with "(h)" do not change the ABI, and can have different
		3679	values when compiling libev vs. including F<ev.h>, so it is permissible
		3680	to redefine them before including F<ev.h> without breaking compatibility
		3681	to a compiled library. All other symbols change the ABI, which means all
		3682	users of libev and the libev code itself must be compiled with compatible
		3683	settings.
3069		3684
3070	=over 4	3685	=over 4
3071		3686
3072	=item EV_STANDALONE	3687	=item EV_STANDALONE (h)
3073		3688
3074	Must always be C<1> if you do not use autoconf configuration, which	3689	Must always be C<1> if you do not use autoconf configuration, which
3075	keeps libev from including F<config.h>, and it also defines dummy	3690	keeps libev from including F<config.h>, and it also defines dummy
3076	implementations for some libevent functions (such as logging, which is not	3691	implementations for some libevent functions (such as logging, which is not
3077	supported). It will also not define any of the structs usually found in	3692	supported). It will also not define any of the structs usually found in
3078	F<event.h> that are not directly supported by the libev core alone.	3693	F<event.h> that are not directly supported by the libev core alone.
3079		3694
		3695	In standalone mode, libev will still try to automatically deduce the
		3696	configuration, but has to be more conservative.
		3697
3080	=item EV_USE_MONOTONIC	3698	=item EV_USE_MONOTONIC
3081		3699
3082	If defined to be C<1>, libev will try to detect the availability of the	3700	If defined to be C<1>, libev will try to detect the availability of the
3083	monotonic clock option at both compile time and runtime. Otherwise no use	3701	monotonic clock option at both compile time and runtime. Otherwise no
3084	of the monotonic clock option will be attempted. If you enable this, you	3702	use of the monotonic clock option will be attempted. If you enable this,
3085	usually have to link against librt or something similar. Enabling it when	3703	you usually have to link against librt or something similar. Enabling it
3086	the functionality isn't available is safe, though, although you have	3704	when the functionality isn't available is safe, though, although you have
3087	to make sure you link against any libraries where the C<clock_gettime>	3705	to make sure you link against any libraries where the C<clock_gettime>
3088	function is hiding in (often F<-lrt>).	3706	function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
3089		3707
3090	=item EV_USE_REALTIME	3708	=item EV_USE_REALTIME
3091		3709
3092	If defined to be C<1>, libev will try to detect the availability of the	3710	If defined to be C<1>, libev will try to detect the availability of the
3093	real-time clock option at compile time (and assume its availability at	3711	real-time clock option at compile time (and assume its availability
3094	runtime if successful). Otherwise no use of the real-time clock option will	3712	at runtime if successful). Otherwise no use of the real-time clock
3095	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	3713	option will be attempted. This effectively replaces C<gettimeofday>
3096	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the	3714	by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect
3097	note about libraries in the description of C<EV_USE_MONOTONIC>, though.	3715	correctness. See the note about libraries in the description of
		3716	C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of
		3717	C<EV_USE_CLOCK_SYSCALL>.
		3718
		3719	=item EV_USE_CLOCK_SYSCALL
		3720
		3721	If defined to be C<1>, libev will try to use a direct syscall instead
		3722	of calling the system-provided C<clock_gettime> function. This option
		3723	exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt>
		3724	unconditionally pulls in C<libpthread>, slowing down single-threaded
		3725	programs needlessly. Using a direct syscall is slightly slower (in
		3726	theory), because no optimised vdso implementation can be used, but avoids
		3727	the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or
		3728	higher, as it simplifies linking (no need for C<-lrt>).
3098		3729
3099	=item EV_USE_NANOSLEEP	3730	=item EV_USE_NANOSLEEP
3100		3731
3101	If defined to be C<1>, libev will assume that C<nanosleep ()> is available	3732	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
3102	and will use it for delays. Otherwise it will use C<select ()>.	3733	and will use it for delays. Otherwise it will use C<select ()>.
…		…
3118		3749
3119	=item EV_SELECT_USE_FD_SET	3750	=item EV_SELECT_USE_FD_SET
3120		3751
3121	If defined to C<1>, then the select backend will use the system C<fd_set>	3752	If defined to C<1>, then the select backend will use the system C<fd_set>
3122	structure. This is useful if libev doesn't compile due to a missing	3753	structure. This is useful if libev doesn't compile due to a missing
3123	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on	3754	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout
3124	exotic systems. This usually limits the range of file descriptors to some	3755	on exotic systems. This usually limits the range of file descriptors to
3125	low limit such as 1024 or might have other limitations (winsocket only	3756	some low limit such as 1024 or might have other limitations (winsocket
3126	allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might	3757	only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
3127	influence the size of the C<fd_set> used.	3758	configures the maximum size of the C<fd_set>.
3128		3759
3129	=item EV_SELECT_IS_WINSOCKET	3760	=item EV_SELECT_IS_WINSOCKET
3130		3761
3131	When defined to C<1>, the select backend will assume that	3762	When defined to C<1>, the select backend will assume that
3132	select/socket/connect etc. don't understand file descriptors but	3763	select/socket/connect etc. don't understand file descriptors but
…		…
3134	be used is the winsock select). This means that it will call	3765	be used is the winsock select). This means that it will call
3135	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,	3766	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3136	it is assumed that all these functions actually work on fds, even	3767	it is assumed that all these functions actually work on fds, even
3137	on win32. Should not be defined on non-win32 platforms.	3768	on win32. Should not be defined on non-win32 platforms.
3138		3769
3139	=item EV_FD_TO_WIN32_HANDLE	3770	=item EV_FD_TO_WIN32_HANDLE(fd)
3140		3771
3141	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map	3772	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3142	file descriptors to socket handles. When not defining this symbol (the	3773	file descriptors to socket handles. When not defining this symbol (the
3143	default), then libev will call C<_get_osfhandle>, which is usually	3774	default), then libev will call C<_get_osfhandle>, which is usually
3144	correct. In some cases, programs use their own file descriptor management,	3775	correct. In some cases, programs use their own file descriptor management,
3145	in which case they can provide this function to map fds to socket handles.	3776	in which case they can provide this function to map fds to socket handles.
		3777
		3778	=item EV_WIN32_HANDLE_TO_FD(handle)
		3779
		3780	If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
		3781	using the standard C<_open_osfhandle> function. For programs implementing
		3782	their own fd to handle mapping, overwriting this function makes it easier
		3783	to do so. This can be done by defining this macro to an appropriate value.
		3784
		3785	=item EV_WIN32_CLOSE_FD(fd)
		3786
		3787	If programs implement their own fd to handle mapping on win32, then this
		3788	macro can be used to override the C<close> function, useful to unregister
		3789	file descriptors again. Note that the replacement function has to close
		3790	the underlying OS handle.
3146		3791
3147	=item EV_USE_POLL	3792	=item EV_USE_POLL
3148		3793
3149	If defined to be C<1>, libev will compile in support for the C<poll>(2)	3794	If defined to be C<1>, libev will compile in support for the C<poll>(2)
3150	backend. Otherwise it will be enabled on non-win32 platforms. It	3795	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
3197	as well as for signal and thread safety in C<ev_async> watchers.	3842	as well as for signal and thread safety in C<ev_async> watchers.
3198		3843
3199	In the absence of this define, libev will use C<sig_atomic_t volatile>	3844	In the absence of this define, libev will use C<sig_atomic_t volatile>
3200	(from F<signal.h>), which is usually good enough on most platforms.	3845	(from F<signal.h>), which is usually good enough on most platforms.
3201		3846
3202	=item EV_H	3847	=item EV_H (h)
3203		3848
3204	The name of the F<ev.h> header file used to include it. The default if	3849	The name of the F<ev.h> header file used to include it. The default if
3205	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be	3850	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3206	used to virtually rename the F<ev.h> header file in case of conflicts.	3851	used to virtually rename the F<ev.h> header file in case of conflicts.
3207		3852
3208	=item EV_CONFIG_H	3853	=item EV_CONFIG_H (h)
3209		3854
3210	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override	3855	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3211	F<ev.c>'s idea of where to find the F<config.h> file, similarly to	3856	F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3212	C<EV_H>, above.	3857	C<EV_H>, above.
3213		3858
3214	=item EV_EVENT_H	3859	=item EV_EVENT_H (h)
3215		3860
3216	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea	3861	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3217	of how the F<event.h> header can be found, the default is C<"event.h">.	3862	of how the F<event.h> header can be found, the default is C<"event.h">.
3218		3863
3219	=item EV_PROTOTYPES	3864	=item EV_PROTOTYPES (h)
3220		3865
3221	If defined to be C<0>, then F<ev.h> will not define any function	3866	If defined to be C<0>, then F<ev.h> will not define any function
3222	prototypes, but still define all the structs and other symbols. This is	3867	prototypes, but still define all the structs and other symbols. This is
3223	occasionally useful if you want to provide your own wrapper functions	3868	occasionally useful if you want to provide your own wrapper functions
3224	around libev functions.	3869	around libev functions.
…		…
3246	fine.	3891	fine.
3247		3892
3248	If your embedding application does not need any priorities, defining these	3893	If your embedding application does not need any priorities, defining these
3249	both to C<0> will save some memory and CPU.	3894	both to C<0> will save some memory and CPU.
3250		3895
3251	=item EV_PERIODIC_ENABLE	3896	=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
		3897	EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
		3898	EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3252		3899
3253	If undefined or defined to be C<1>, then periodic timers are supported. If	3900	If undefined or defined to be C<1> (and the platform supports it), then
3254	defined to be C<0>, then they are not. Disabling them saves a few kB of	3901	the respective watcher type is supported. If defined to be C<0>, then it
3255	code.	3902	is not. Disabling watcher types mainly saves code size.
3256		3903
3257	=item EV_IDLE_ENABLE	3904	=item EV_FEATURES
3258
3259	If undefined or defined to be C<1>, then idle watchers are supported. If
3260	defined to be C<0>, then they are not. Disabling them saves a few kB of
3261	code.
3262
3263	=item EV_EMBED_ENABLE
3264
3265	If undefined or defined to be C<1>, then embed watchers are supported. If
3266	defined to be C<0>, then they are not. Embed watchers rely on most other
3267	watcher types, which therefore must not be disabled.
3268
3269	=item EV_STAT_ENABLE
3270
3271	If undefined or defined to be C<1>, then stat watchers are supported. If
3272	defined to be C<0>, then they are not.
3273
3274	=item EV_FORK_ENABLE
3275
3276	If undefined or defined to be C<1>, then fork watchers are supported. If
3277	defined to be C<0>, then they are not.
3278
3279	=item EV_ASYNC_ENABLE
3280
3281	If undefined or defined to be C<1>, then async watchers are supported. If
3282	defined to be C<0>, then they are not.
3283
3284	=item EV_MINIMAL
3285		3905
3286	If you need to shave off some kilobytes of code at the expense of some	3906	If you need to shave off some kilobytes of code at the expense of some
3287	speed, define this symbol to C<1>. Currently this is used to override some	3907	speed (but with the full API), you can define this symbol to request
3288	inlining decisions, saves roughly 30% code size on amd64. It also selects a	3908	certain subsets of functionality. The default is to enable all features
3289	much smaller 2-heap for timer management over the default 4-heap.	3909	that can be enabled on the platform.
		3910
		3911	A typical way to use this symbol is to define it to C<0> (or to a bitset
		3912	with some broad features you want) and then selectively re-enable
		3913	additional parts you want, for example if you want everything minimal,
		3914	but multiple event loop support, async and child watchers and the poll
		3915	backend, use this:
		3916
		3917	#define EV_FEATURES 0
		3918	#define EV_MULTIPLICITY 1
		3919	#define EV_USE_POLL 1
		3920	#define EV_CHILD_ENABLE 1
		3921	#define EV_ASYNC_ENABLE 1
		3922
		3923	The actual value is a bitset, it can be a combination of the following
		3924	values:
		3925
		3926	=over 4
		3927
		3928	=item C<1> - faster/larger code
		3929
		3930	Use larger code to speed up some operations.
		3931
		3932	Currently this is used to override some inlining decisions (enlarging the
		3933	code size by roughly 30% on amd64).
		3934
		3935	When optimising for size, use of compiler flags such as C<-Os> with
		3936	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
		3937	assertions.
		3938
		3939	=item C<2> - faster/larger data structures
		3940
		3941	Replaces the small 2-heap for timer management by a faster 4-heap, larger
		3942	hash table sizes and so on. This will usually further increase code size
		3943	and can additionally have an effect on the size of data structures at
		3944	runtime.
		3945
		3946	=item C<4> - full API configuration
		3947
		3948	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
		3949	enables multiplicity (C<EV_MULTIPLICITY>=1).
		3950
		3951	=item C<8> - full API
		3952
		3953	This enables a lot of the "lesser used" API functions. See C<ev.h> for
		3954	details on which parts of the API are still available without this
		3955	feature, and do not complain if this subset changes over time.
		3956
		3957	=item C<16> - enable all optional watcher types
		3958
		3959	Enables all optional watcher types. If you want to selectively enable
		3960	only some watcher types other than I/O and timers (e.g. prepare,
		3961	embed, async, child...) you can enable them manually by defining
		3962	C<EV_watchertype_ENABLE> to C<1> instead.
		3963
		3964	=item C<32> - enable all backends
		3965
		3966	This enables all backends - without this feature, you need to enable at
		3967	least one backend manually (C<EV_USE_SELECT> is a good choice).
		3968
		3969	=item C<64> - enable OS-specific "helper" APIs
		3970
		3971	Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
		3972	default.
		3973
		3974	=back
		3975
		3976	Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
		3977	reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
		3978	code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
		3979	watchers, timers and monotonic clock support.
		3980
		3981	With an intelligent-enough linker (gcc+binutils are intelligent enough
		3982	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
		3983	your program might be left out as well - a binary starting a timer and an
		3984	I/O watcher then might come out at only 5Kb.
		3985
		3986	=item EV_AVOID_STDIO
		3987
		3988	If this is set to C<1> at compiletime, then libev will avoid using stdio
		3989	functions (printf, scanf, perror etc.). This will increase the code size
		3990	somewhat, but if your program doesn't otherwise depend on stdio and your
		3991	libc allows it, this avoids linking in the stdio library which is quite
		3992	big.
		3993
		3994	Note that error messages might become less precise when this option is
		3995	enabled.
		3996
		3997	=item EV_NSIG
		3998
		3999	The highest supported signal number, +1 (or, the number of
		4000	signals): Normally, libev tries to deduce the maximum number of signals
		4001	automatically, but sometimes this fails, in which case it can be
		4002	specified. Also, using a lower number than detected (C<32> should be
		4003	good for about any system in existence) can save some memory, as libev
		4004	statically allocates some 12-24 bytes per signal number.
3290		4005
3291	=item EV_PID_HASHSIZE	4006	=item EV_PID_HASHSIZE
3292		4007
3293	C<ev_child> watchers use a small hash table to distribute workload by	4008	C<ev_child> watchers use a small hash table to distribute workload by
3294	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	4009	pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3295	than enough. If you need to manage thousands of children you might want to	4010	usually more than enough. If you need to manage thousands of children you
3296	increase this value (I<must> be a power of two).	4011	might want to increase this value (I<must> be a power of two).
3297		4012
3298	=item EV_INOTIFY_HASHSIZE	4013	=item EV_INOTIFY_HASHSIZE
3299		4014
3300	C<ev_stat> watchers use a small hash table to distribute workload by	4015	C<ev_stat> watchers use a small hash table to distribute workload by
3301	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	4016	inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3302	usually more than enough. If you need to manage thousands of C<ev_stat>	4017	disabled), usually more than enough. If you need to manage thousands of
3303	watchers you might want to increase this value (I<must> be a power of	4018	C<ev_stat> watchers you might want to increase this value (I<must> be a
3304	two).	4019	power of two).
3305		4020
3306	=item EV_USE_4HEAP	4021	=item EV_USE_4HEAP
3307		4022
3308	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4023	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3309	timer and periodics heaps, libev uses a 4-heap when this symbol is defined	4024	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3310	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably	4025	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3311	faster performance with many (thousands) of watchers.	4026	faster performance with many (thousands) of watchers.
3312		4027
3313	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4028	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3314	(disabled).	4029	will be C<0>.
3315		4030
3316	=item EV_HEAP_CACHE_AT	4031	=item EV_HEAP_CACHE_AT
3317		4032
3318	Heaps are not very cache-efficient. To improve the cache-efficiency of the	4033	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3319	timer and periodics heaps, libev can cache the timestamp (I<at>) within	4034	timer and periodics heaps, libev can cache the timestamp (I<at>) within
3320	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),	4035	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3321	which uses 8-12 bytes more per watcher and a few hundred bytes more code,	4036	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3322	but avoids random read accesses on heap changes. This improves performance	4037	but avoids random read accesses on heap changes. This improves performance
3323	noticeably with many (hundreds) of watchers.	4038	noticeably with many (hundreds) of watchers.
3324		4039
3325	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	4040	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3326	(disabled).	4041	will be C<0>.
3327		4042
3328	=item EV_VERIFY	4043	=item EV_VERIFY
3329		4044
3330	Controls how much internal verification (see C<ev_loop_verify ()>) will	4045	Controls how much internal verification (see C<ev_verify ()>) will
3331	be done: If set to C<0>, no internal verification code will be compiled	4046	be done: If set to C<0>, no internal verification code will be compiled
3332	in. If set to C<1>, then verification code will be compiled in, but not	4047	in. If set to C<1>, then verification code will be compiled in, but not
3333	called. If set to C<2>, then the internal verification code will be	4048	called. If set to C<2>, then the internal verification code will be
3334	called once per loop, which can slow down libev. If set to C<3>, then the	4049	called once per loop, which can slow down libev. If set to C<3>, then the
3335	verification code will be called very frequently, which will slow down	4050	verification code will be called very frequently, which will slow down
3336	libev considerably.	4051	libev considerably.
3337		4052
3338	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be	4053	The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3339	C<0>.	4054	will be C<0>.
3340		4055
3341	=item EV_COMMON	4056	=item EV_COMMON
3342		4057
3343	By default, all watchers have a C<void *data> member. By redefining	4058	By default, all watchers have a C<void *data> member. By redefining
3344	this macro to a something else you can include more and other types of	4059	this macro to something else you can include more and other types of
3345	members. You have to define it each time you include one of the files,	4060	members. You have to define it each time you include one of the files,
3346	though, and it must be identical each time.	4061	though, and it must be identical each time.
3347		4062
3348	For example, the perl EV module uses something like this:	4063	For example, the perl EV module uses something like this:
3349		4064
…		…
3402	file.	4117	file.
3403		4118
3404	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	4119	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3405	that everybody includes and which overrides some configure choices:	4120	that everybody includes and which overrides some configure choices:
3406		4121
3407	#define EV_MINIMAL 1	4122	#define EV_FEATURES 8
3408	#define EV_USE_POLL 0	4123	#define EV_USE_SELECT 1
3409	#define EV_MULTIPLICITY 0
3410	#define EV_PERIODIC_ENABLE 0	4124	#define EV_PREPARE_ENABLE 1
		4125	#define EV_IDLE_ENABLE 1
3411	#define EV_STAT_ENABLE 0	4126	#define EV_SIGNAL_ENABLE 1
3412	#define EV_FORK_ENABLE 0	4127	#define EV_CHILD_ENABLE 1
		4128	#define EV_USE_STDEXCEPT 0
3413	#define EV_CONFIG_H <config.h>	4129	#define EV_CONFIG_H <config.h>
3414	#define EV_MINPRI 0
3415	#define EV_MAXPRI 0
3416		4130
3417	#include "ev++.h"	4131	#include "ev++.h"
3418		4132
3419	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4133	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3420		4134
…		…
3480	default loop and triggering an C<ev_async> watcher from the default loop	4194	default loop and triggering an C<ev_async> watcher from the default loop
3481	watcher callback into the event loop interested in the signal.	4195	watcher callback into the event loop interested in the signal.
3482		4196
3483	=back	4197	=back
3484		4198
		4199	=head4 THREAD LOCKING EXAMPLE
		4200
		4201	Here is a fictitious example of how to run an event loop in a different
		4202	thread than where callbacks are being invoked and watchers are
		4203	created/added/removed.
		4204
		4205	For a real-world example, see the C<EV::Loop::Async> perl module,
		4206	which uses exactly this technique (which is suited for many high-level
		4207	languages).
		4208
		4209	The example uses a pthread mutex to protect the loop data, a condition
		4210	variable to wait for callback invocations, an async watcher to notify the
		4211	event loop thread and an unspecified mechanism to wake up the main thread.
		4212
		4213	First, you need to associate some data with the event loop:
		4214
		4215	typedef struct {
		4216	mutex_t lock; /* global loop lock */
		4217	ev_async async_w;
		4218	thread_t tid;
		4219	cond_t invoke_cv;
		4220	} userdata;
		4221
		4222	void prepare_loop (EV_P)
		4223	{
		4224	// for simplicity, we use a static userdata struct.
		4225	static userdata u;
		4226
		4227	ev_async_init (&u->async_w, async_cb);
		4228	ev_async_start (EV_A_ &u->async_w);
		4229
		4230	pthread_mutex_init (&u->lock, 0);
		4231	pthread_cond_init (&u->invoke_cv, 0);
		4232
		4233	// now associate this with the loop
		4234	ev_set_userdata (EV_A_ u);
		4235	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		4236	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		4237
		4238	// then create the thread running ev_loop
		4239	pthread_create (&u->tid, 0, l_run, EV_A);
		4240	}
		4241
		4242	The callback for the C<ev_async> watcher does nothing: the watcher is used
		4243	solely to wake up the event loop so it takes notice of any new watchers
		4244	that might have been added:
		4245
		4246	static void
		4247	async_cb (EV_P_ ev_async *w, int revents)
		4248	{
		4249	// just used for the side effects
		4250	}
		4251
		4252	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		4253	protecting the loop data, respectively.
		4254
		4255	static void
		4256	l_release (EV_P)
		4257	{
		4258	userdata *u = ev_userdata (EV_A);
		4259	pthread_mutex_unlock (&u->lock);
		4260	}
		4261
		4262	static void
		4263	l_acquire (EV_P)
		4264	{
		4265	userdata *u = ev_userdata (EV_A);
		4266	pthread_mutex_lock (&u->lock);
		4267	}
		4268
		4269	The event loop thread first acquires the mutex, and then jumps straight
		4270	into C<ev_loop>:
		4271
		4272	void *
		4273	l_run (void *thr_arg)
		4274	{
		4275	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		4276
		4277	l_acquire (EV_A);
		4278	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		4279	ev_loop (EV_A_ 0);
		4280	l_release (EV_A);
		4281
		4282	return 0;
		4283	}
		4284
		4285	Instead of invoking all pending watchers, the C<l_invoke> callback will
		4286	signal the main thread via some unspecified mechanism (signals? pipe
		4287	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		4288	have been called (in a while loop because a) spurious wakeups are possible
		4289	and b) skipping inter-thread-communication when there are no pending
		4290	watchers is very beneficial):
		4291
		4292	static void
		4293	l_invoke (EV_P)
		4294	{
		4295	userdata *u = ev_userdata (EV_A);
		4296
		4297	while (ev_pending_count (EV_A))
		4298	{
		4299	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		4300	pthread_cond_wait (&u->invoke_cv, &u->lock);
		4301	}
		4302	}
		4303
		4304	Now, whenever the main thread gets told to invoke pending watchers, it
		4305	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		4306	thread to continue:
		4307
		4308	static void
		4309	real_invoke_pending (EV_P)
		4310	{
		4311	userdata *u = ev_userdata (EV_A);
		4312
		4313	pthread_mutex_lock (&u->lock);
		4314	ev_invoke_pending (EV_A);
		4315	pthread_cond_signal (&u->invoke_cv);
		4316	pthread_mutex_unlock (&u->lock);
		4317	}
		4318
		4319	Whenever you want to start/stop a watcher or do other modifications to an
		4320	event loop, you will now have to lock:
		4321
		4322	ev_timer timeout_watcher;
		4323	userdata *u = ev_userdata (EV_A);
		4324
		4325	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		4326
		4327	pthread_mutex_lock (&u->lock);
		4328	ev_timer_start (EV_A_ &timeout_watcher);
		4329	ev_async_send (EV_A_ &u->async_w);
		4330	pthread_mutex_unlock (&u->lock);
		4331
		4332	Note that sending the C<ev_async> watcher is required because otherwise
		4333	an event loop currently blocking in the kernel will have no knowledge
		4334	about the newly added timer. By waking up the loop it will pick up any new
		4335	watchers in the next event loop iteration.
		4336
3485	=head3 COROUTINES	4337	=head3 COROUTINES
3486		4338
3487	Libev is very accommodating to coroutines ("cooperative threads"):	4339	Libev is very accommodating to coroutines ("cooperative threads"):
3488	libev fully supports nesting calls to its functions from different	4340	libev fully supports nesting calls to its functions from different
3489	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4341	coroutines (e.g. you can call C<ev_loop> on the same loop from two
3490	different coroutines, and switch freely between both coroutines running the	4342	different coroutines, and switch freely between both coroutines running
3491	loop, as long as you don't confuse yourself). The only exception is that	4343	the loop, as long as you don't confuse yourself). The only exception is
3492	you must not do this from C<ev_periodic> reschedule callbacks.	4344	that you must not do this from C<ev_periodic> reschedule callbacks.
3493		4345
3494	Care has been taken to ensure that libev does not keep local state inside	4346	Care has been taken to ensure that libev does not keep local state inside
3495	C<ev_loop>, and other calls do not usually allow for coroutine switches as	4347	C<ev_loop>, and other calls do not usually allow for coroutine switches as
3496	they do not clal any callbacks.	4348	they do not call any callbacks.
3497		4349
3498	=head2 COMPILER WARNINGS	4350	=head2 COMPILER WARNINGS
3499		4351
3500	Depending on your compiler and compiler settings, you might get no or a	4352	Depending on your compiler and compiler settings, you might get no or a
3501	lot of warnings when compiling libev code. Some people are apparently	4353	lot of warnings when compiling libev code. Some people are apparently
…		…
3511	maintainable.	4363	maintainable.
3512		4364
3513	And of course, some compiler warnings are just plain stupid, or simply	4365	And of course, some compiler warnings are just plain stupid, or simply
3514	wrong (because they don't actually warn about the condition their message	4366	wrong (because they don't actually warn about the condition their message
3515	seems to warn about). For example, certain older gcc versions had some	4367	seems to warn about). For example, certain older gcc versions had some
3516	warnings that resulted an extreme number of false positives. These have	4368	warnings that resulted in an extreme number of false positives. These have
3517	been fixed, but some people still insist on making code warn-free with	4369	been fixed, but some people still insist on making code warn-free with
3518	such buggy versions.	4370	such buggy versions.
3519		4371
3520	While libev is written to generate as few warnings as possible,	4372	While libev is written to generate as few warnings as possible,
3521	"warn-free" code is not a goal, and it is recommended not to build libev	4373	"warn-free" code is not a goal, and it is recommended not to build libev
…		…
3535	==2274== definitely lost: 0 bytes in 0 blocks.	4387	==2274== definitely lost: 0 bytes in 0 blocks.
3536	==2274== possibly lost: 0 bytes in 0 blocks.	4388	==2274== possibly lost: 0 bytes in 0 blocks.
3537	==2274== still reachable: 256 bytes in 1 blocks.	4389	==2274== still reachable: 256 bytes in 1 blocks.
3538		4390
3539	Then there is no memory leak, just as memory accounted to global variables	4391	Then there is no memory leak, just as memory accounted to global variables
3540	is not a memleak - the memory is still being refernced, and didn't leak.	4392	is not a memleak - the memory is still being referenced, and didn't leak.
3541		4393
3542	Similarly, under some circumstances, valgrind might report kernel bugs	4394	Similarly, under some circumstances, valgrind might report kernel bugs
3543	as if it were a bug in libev (e.g. in realloc or in the poll backend,	4395	as if it were a bug in libev (e.g. in realloc or in the poll backend,
3544	although an acceptable workaround has been found here), or it might be	4396	although an acceptable workaround has been found here), or it might be
3545	confused.	4397	confused.
…		…
3557	I suggest using suppression lists.	4409	I suggest using suppression lists.
3558		4410
3559		4411
3560	=head1 PORTABILITY NOTES	4412	=head1 PORTABILITY NOTES
3561		4413
		4414	=head2 GNU/LINUX 32 BIT LIMITATIONS
		4415
		4416	GNU/Linux is the only common platform that supports 64 bit file/large file
		4417	interfaces but I<disables> them by default.
		4418
		4419	That means that libev compiled in the default environment doesn't support
		4420	files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
		4421
		4422	Unfortunately, many programs try to work around this GNU/Linux issue
		4423	by enabling the large file API, which makes them incompatible with the
		4424	standard libev compiled for their system.
		4425
		4426	Likewise, libev cannot enable the large file API itself as this would
		4427	suddenly make it incompatible to the default compile time environment,
		4428	i.e. all programs not using special compile switches.
		4429
		4430	=head2 OS/X AND DARWIN BUGS
		4431
		4432	The whole thing is a bug if you ask me - basically any system interface
		4433	you touch is broken, whether it is locales, poll, kqueue or even the
		4434	OpenGL drivers.
		4435
		4436	=head3 C<kqueue> is buggy
		4437
		4438	The kqueue syscall is broken in all known versions - most versions support
		4439	only sockets, many support pipes.
		4440
		4441	Libev tries to work around this by not using C<kqueue> by default on
		4442	this rotten platform, but of course you can still ask for it when creating
		4443	a loop.
		4444
		4445	=head3 C<poll> is buggy
		4446
		4447	Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
		4448	implementation by something calling C<kqueue> internally around the 10.5.6
		4449	release, so now C<kqueue> I<and> C<poll> are broken.
		4450
		4451	Libev tries to work around this by not using C<poll> by default on
		4452	this rotten platform, but of course you can still ask for it when creating
		4453	a loop.
		4454
		4455	=head3 C<select> is buggy
		4456
		4457	All that's left is C<select>, and of course Apple found a way to fuck this
		4458	one up as well: On OS/X, C<select> actively limits the number of file
		4459	descriptors you can pass in to 1024 - your program suddenly crashes when
		4460	you use more.
		4461
		4462	There is an undocumented "workaround" for this - defining
		4463	C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
		4464	work on OS/X.
		4465
		4466	=head2 SOLARIS PROBLEMS AND WORKAROUNDS
		4467
		4468	=head3 C<errno> reentrancy
		4469
		4470	The default compile environment on Solaris is unfortunately so
		4471	thread-unsafe that you can't even use components/libraries compiled
		4472	without C<-D_REENTRANT> (as long as they use C<errno>), which, of course,
		4473	isn't defined by default.
		4474
		4475	If you want to use libev in threaded environments you have to make sure
		4476	it's compiled with C<_REENTRANT> defined.
		4477
		4478	=head3 Event port backend
		4479
		4480	The scalable event interface for Solaris is called "event ports". Unfortunately,
		4481	this mechanism is very buggy. If you run into high CPU usage, your program
		4482	freezes or you get a large number of spurious wakeups, make sure you have
		4483	all the relevant and latest kernel patches applied. No, I don't know which
		4484	ones, but there are multiple ones.
		4485
		4486	If you can't get it to work, you can try running the program by setting
		4487	the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
		4488	C<select> backends.
		4489
		4490	=head2 AIX POLL BUG
		4491
		4492	AIX unfortunately has a broken C<poll.h> header. Libev works around
		4493	this by trying to avoid the poll backend altogether (i.e. it's not even
		4494	compiled in), which normally isn't a big problem as C<select> works fine
		4495	with large bitsets, and AIX is dead anyway.
		4496
3562	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	4497	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
		4498
		4499	=head3 General issues
3563		4500
3564	Win32 doesn't support any of the standards (e.g. POSIX) that libev	4501	Win32 doesn't support any of the standards (e.g. POSIX) that libev
3565	requires, and its I/O model is fundamentally incompatible with the POSIX	4502	requires, and its I/O model is fundamentally incompatible with the POSIX
3566	model. Libev still offers limited functionality on this platform in	4503	model. Libev still offers limited functionality on this platform in
3567	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4504	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3568	descriptors. This only applies when using Win32 natively, not when using	4505	descriptors. This only applies when using Win32 natively, not when using
3569	e.g. cygwin.	4506	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
		4507	as every compielr comes with a slightly differently broken/incompatible
		4508	environment.
3570		4509
3571	Lifting these limitations would basically require the full	4510	Lifting these limitations would basically require the full
3572	re-implementation of the I/O system. If you are into these kinds of	4511	re-implementation of the I/O system. If you are into this kind of thing,
3573	things, then note that glib does exactly that for you in a very portable	4512	then note that glib does exactly that for you in a very portable way (note
3574	way (note also that glib is the slowest event library known to man).	4513	also that glib is the slowest event library known to man).
3575		4514
3576	There is no supported compilation method available on windows except	4515	There is no supported compilation method available on windows except
3577	embedding it into other applications.	4516	embedding it into other applications.
		4517
		4518	Sensible signal handling is officially unsupported by Microsoft - libev
		4519	tries its best, but under most conditions, signals will simply not work.
3578		4520
3579	Not a libev limitation but worth mentioning: windows apparently doesn't	4521	Not a libev limitation but worth mentioning: windows apparently doesn't
3580	accept large writes: instead of resulting in a partial write, windows will	4522	accept large writes: instead of resulting in a partial write, windows will
3581	either accept everything or return C<ENOBUFS> if the buffer is too large,	4523	either accept everything or return C<ENOBUFS> if the buffer is too large,
3582	so make sure you only write small amounts into your sockets (less than a	4524	so make sure you only write small amounts into your sockets (less than a
…		…
3587	the abysmal performance of winsockets, using a large number of sockets	4529	the abysmal performance of winsockets, using a large number of sockets
3588	is not recommended (and not reasonable). If your program needs to use	4530	is not recommended (and not reasonable). If your program needs to use
3589	more than a hundred or so sockets, then likely it needs to use a totally	4531	more than a hundred or so sockets, then likely it needs to use a totally
3590	different implementation for windows, as libev offers the POSIX readiness	4532	different implementation for windows, as libev offers the POSIX readiness
3591	notification model, which cannot be implemented efficiently on windows	4533	notification model, which cannot be implemented efficiently on windows
3592	(Microsoft monopoly games).	4534	(due to Microsoft monopoly games).
3593		4535
3594	A typical way to use libev under windows is to embed it (see the embedding	4536	A typical way to use libev under windows is to embed it (see the embedding
3595	section for details) and use the following F<evwrap.h> header file instead	4537	section for details) and use the following F<evwrap.h> header file instead
3596	of F<ev.h>:	4538	of F<ev.h>:
3597		4539
…		…
3604	you do I<not> compile the F<ev.c> or any other embedded source files!):	4546	you do I<not> compile the F<ev.c> or any other embedded source files!):
3605		4547
3606	#include "evwrap.h"	4548	#include "evwrap.h"
3607	#include "ev.c"	4549	#include "ev.c"
3608		4550
3609	=over 4
3610
3611	=item The winsocket select function	4551	=head3 The winsocket C<select> function
3612		4552
3613	The winsocket C<select> function doesn't follow POSIX in that it	4553	The winsocket C<select> function doesn't follow POSIX in that it
3614	requires socket I<handles> and not socket I<file descriptors> (it is	4554	requires socket I<handles> and not socket I<file descriptors> (it is
3615	also extremely buggy). This makes select very inefficient, and also	4555	also extremely buggy). This makes select very inefficient, and also
3616	requires a mapping from file descriptors to socket handles (the Microsoft	4556	requires a mapping from file descriptors to socket handles (the Microsoft
…		…
3625	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	4565	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3626		4566
3627	Note that winsockets handling of fd sets is O(n), so you can easily get a	4567	Note that winsockets handling of fd sets is O(n), so you can easily get a
3628	complexity in the O(n²) range when using win32.	4568	complexity in the O(n²) range when using win32.
3629		4569
3630	=item Limited number of file descriptors	4570	=head3 Limited number of file descriptors
3631		4571
3632	Windows has numerous arbitrary (and low) limits on things.	4572	Windows has numerous arbitrary (and low) limits on things.
3633		4573
3634	Early versions of winsocket's select only supported waiting for a maximum	4574	Early versions of winsocket's select only supported waiting for a maximum
3635	of C<64> handles (probably owning to the fact that all windows kernels	4575	of C<64> handles (probably owning to the fact that all windows kernels
3636	can only wait for C<64> things at the same time internally; Microsoft	4576	can only wait for C<64> things at the same time internally; Microsoft
3637	recommends spawning a chain of threads and wait for 63 handles and the	4577	recommends spawning a chain of threads and wait for 63 handles and the
3638	previous thread in each. Great).	4578	previous thread in each. Sounds great!).
3639		4579
3640	Newer versions support more handles, but you need to define C<FD_SETSIZE>	4580	Newer versions support more handles, but you need to define C<FD_SETSIZE>
3641	to some high number (e.g. C<2048>) before compiling the winsocket select	4581	to some high number (e.g. C<2048>) before compiling the winsocket select
3642	call (which might be in libev or elsewhere, for example, perl does its own	4582	call (which might be in libev or elsewhere, for example, perl and many
3643	select emulation on windows).	4583	other interpreters do their own select emulation on windows).
3644		4584
3645	Another limit is the number of file descriptors in the Microsoft runtime	4585	Another limit is the number of file descriptors in the Microsoft runtime
3646	libraries, which by default is C<64> (there must be a hidden I<64> fetish	4586	libraries, which by default is C<64> (there must be a hidden I<64>
3647	or something like this inside Microsoft). You can increase this by calling	4587	fetish or something like this inside Microsoft). You can increase this
3648	C<_setmaxstdio>, which can increase this limit to C<2048> (another	4588	by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3649	arbitrary limit), but is broken in many versions of the Microsoft runtime	4589	(another arbitrary limit), but is broken in many versions of the Microsoft
3650	libraries.
3651
3652	This might get you to about C<512> or C<2048> sockets (depending on	4590	runtime libraries. This might get you to about C<512> or C<2048> sockets
3653	windows version and/or the phase of the moon). To get more, you need to	4591	(depending on windows version and/or the phase of the moon). To get more,
3654	wrap all I/O functions and provide your own fd management, but the cost of	4592	you need to wrap all I/O functions and provide your own fd management, but
3655	calling select (O(n²)) will likely make this unworkable.	4593	the cost of calling select (O(n²)) will likely make this unworkable.
3656
3657	=back
3658		4594
3659	=head2 PORTABILITY REQUIREMENTS	4595	=head2 PORTABILITY REQUIREMENTS
3660		4596
3661	In addition to a working ISO-C implementation and of course the	4597	In addition to a working ISO-C implementation and of course the
3662	backend-specific APIs, libev relies on a few additional extensions:	4598	backend-specific APIs, libev relies on a few additional extensions:
…		…
3701	watchers.	4637	watchers.
3702		4638
3703	=item C<double> must hold a time value in seconds with enough accuracy	4639	=item C<double> must hold a time value in seconds with enough accuracy
3704		4640
3705	The type C<double> is used to represent timestamps. It is required to	4641	The type C<double> is used to represent timestamps. It is required to
3706	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	4642	have at least 51 bits of mantissa (and 9 bits of exponent), which is
3707	enough for at least into the year 4000. This requirement is fulfilled by	4643	good enough for at least into the year 4000 with millisecond accuracy
		4644	(the design goal for libev). This requirement is overfulfilled by
3708	implementations implementing IEEE 754 (basically all existing ones).	4645	implementations using IEEE 754, which is basically all existing ones. With
		4646	IEEE 754 doubles, you get microsecond accuracy until at least 2200.
3709		4647
3710	=back	4648	=back
3711		4649
3712	If you know of other additional requirements drop me a note.	4650	If you know of other additional requirements drop me a note.
3713		4651
…		…
3781	involves iterating over all running async watchers or all signal numbers.	4719	involves iterating over all running async watchers or all signal numbers.
3782		4720
3783	=back	4721	=back
3784		4722
3785		4723
		4724	=head1 PORTING FROM LIBEV 3.X TO 4.X
		4725
		4726	The major version 4 introduced some minor incompatible changes to the API.
		4727
		4728	At the moment, the C<ev.h> header file tries to implement superficial
		4729	compatibility, so most programs should still compile. Those might be
		4730	removed in later versions of libev, so better update early than late.
		4731
		4732	=over 4
		4733
		4734	=item C<ev_loop_count> renamed to C<ev_iteration>
		4735
		4736	=item C<ev_loop_depth> renamed to C<ev_depth>
		4737
		4738	=item C<ev_loop_verify> renamed to C<ev_verify>
		4739
		4740	Most functions working on C<struct ev_loop> objects don't have an
		4741	C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is
		4742	still called C<ev_loop_fork> because it would otherwise clash with the
		4743	C<ev_fork> typedef.
		4744
		4745	=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
		4746
		4747	This is a simple rename - all other watcher types use their name
		4748	as revents flag, and now C<ev_timer> does, too.
		4749
		4750	Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
		4751	and continue to be present for the foreseeable future, so this is mostly a
		4752	documentation change.
		4753
		4754	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
		4755
		4756	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
		4757	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
		4758	and work, but the library code will of course be larger.
		4759
		4760	=back
		4761
		4762
		4763	=head1 GLOSSARY
		4764
		4765	=over 4
		4766
		4767	=item active
		4768
		4769	A watcher is active as long as it has been started (has been attached to
		4770	an event loop) but not yet stopped (disassociated from the event loop).
		4771
		4772	=item application
		4773
		4774	In this document, an application is whatever is using libev.
		4775
		4776	=item callback
		4777
		4778	The address of a function that is called when some event has been
		4779	detected. Callbacks are being passed the event loop, the watcher that
		4780	received the event, and the actual event bitset.
		4781
		4782	=item callback invocation
		4783
		4784	The act of calling the callback associated with a watcher.
		4785
		4786	=item event
		4787
		4788	A change of state of some external event, such as data now being available
		4789	for reading on a file descriptor, time having passed or simply not having
		4790	any other events happening anymore.
		4791
		4792	In libev, events are represented as single bits (such as C<EV_READ> or
		4793	C<EV_TIMER>).
		4794
		4795	=item event library
		4796
		4797	A software package implementing an event model and loop.
		4798
		4799	=item event loop
		4800
		4801	An entity that handles and processes external events and converts them
		4802	into callback invocations.
		4803
		4804	=item event model
		4805
		4806	The model used to describe how an event loop handles and processes
		4807	watchers and events.
		4808
		4809	=item pending
		4810
		4811	A watcher is pending as soon as the corresponding event has been detected,
		4812	and stops being pending as soon as the watcher will be invoked or its
		4813	pending status is explicitly cleared by the application.
		4814
		4815	A watcher can be pending, but not active. Stopping a watcher also clears
		4816	its pending status.
		4817
		4818	=item real time
		4819
		4820	The physical time that is observed. It is apparently strictly monotonic :)
		4821
		4822	=item wall-clock time
		4823
		4824	The time and date as shown on clocks. Unlike real time, it can actually
		4825	be wrong and jump forwards and backwards, e.g. when the you adjust your
		4826	clock.
		4827
		4828	=item watcher
		4829
		4830	A data structure that describes interest in certain events. Watchers need
		4831	to be started (attached to an event loop) before they can receive events.
		4832
		4833	=item watcher invocation
		4834
		4835	The act of calling the callback associated with a watcher.
		4836
		4837	=back
		4838
3786	=head1 AUTHOR	4839	=head1 AUTHOR
3787		4840
3788	Marc Lehmann <libev@schmorp.de>.	4841	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3789		4842

Diff Legend

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