ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.176 by root, Mon Sep 8 17:24:39 2008 UTC vs.
Revision 1.256 by root, Tue Jul 14 20:31:21 2009 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
21	static void	23	static void
22	stdin_cb (EV_P_ struct ev_io *w, int revents)	24	stdin_cb (EV_P_ ev_io *w, int revents)
23	{	25	{
24	puts ("stdin ready");	26	puts ("stdin ready");
25	// for one-shot events, one must manually stop the watcher	27	// for one-shot events, one must manually stop the watcher
26	// with its corresponding stop function.	28	// with its corresponding stop function.
27	ev_io_stop (EV_A_ w);	29	ev_io_stop (EV_A_ w);
…		…
30	ev_unloop (EV_A_ EVUNLOOP_ALL);	32	ev_unloop (EV_A_ EVUNLOOP_ALL);
31	}	33	}
32		34
33	// another callback, this time for a time-out	35	// another callback, this time for a time-out
34	static void	36	static void
35	timeout_cb (EV_P_ struct ev_timer *w, int revents)	37	timeout_cb (EV_P_ ev_timer *w, int revents)
36	{	38	{
37	puts ("timeout");	39	puts ("timeout");
38	// this causes the innermost ev_loop to stop iterating	40	// this causes the innermost ev_loop to stop iterating
39	ev_unloop (EV_A_ EVUNLOOP_ONE);	41	ev_unloop (EV_A_ EVUNLOOP_ONE);
40	}	42	}
…		…
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	Familarity 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
…		…
103	Libev is very configurable. In this manual the default (and most common)	117	Libev is very configurable. In this manual the default (and most common)
104	configuration will be described, which supports multiple event loops. For	118	configuration will be described, which supports multiple event loops. For
105	more info about various configuration options please have a look at	119	more info about various configuration options please have a look at
106	B<EMBED> section in this manual. If libev was configured without support	120	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	121	for multiple event loops, then all functions taking an initial argument of
108	name C<loop> (which is always of type C<struct ev_loop *>) will not have	122	name C<loop> (which is always of type C<ev_loop *>) will not have
109	this argument.	123	this argument.
110		124
111	=head2 TIME REPRESENTATION	125	=head2 TIME REPRESENTATION
112		126
113	Libev represents time as a single floating point number, representing the	127	Libev represents time as a single floating point number, representing
114	(fractional) number of seconds since the (POSIX) epoch (somewhere near	128	the (fractional) number of seconds since the (POSIX) epoch (somewhere
115	the beginning of 1970, details are complicated, don't ask). This type is	129	near the beginning of 1970, details are complicated, don't ask). This
116	called C<ev_tstamp>, which is what you should use too. It usually aliases	130	type is called C<ev_tstamp>, which is what you should use too. It usually
117	to the C<double> type in C, and when you need to do any calculations on	131	aliases to the C<double> type in C. When you need to do any calculations
118	it, you should treat it as some floating point value. Unlike the name	132	on it, you should treat it as some floating point value. Unlike the name
119	component C<stamp> might indicate, it is also used for time differences	133	component C<stamp> might indicate, it is also used for time differences
120	throughout libev.	134	throughout libev.
121		135
122	=head1 ERROR HANDLING	136	=head1 ERROR HANDLING
123		137
…		…
214	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	228	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
215	recommended ones.	229	recommended ones.
216		230
217	See the description of C<ev_embed> watchers for more info.	231	See the description of C<ev_embed> watchers for more info.
218		232
219	=item ev_set_allocator (void *(*cb)(void *ptr, long size))	233	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]
220		234
221	Sets the allocation function to use (the prototype is similar - the	235	Sets the allocation function to use (the prototype is similar - the
222	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	236	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
223	used to allocate and free memory (no surprises here). If it returns zero	237	used to allocate and free memory (no surprises here). If it returns zero
224	when memory needs to be allocated (C<size != 0>), the library might abort	238	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
250	}	264	}
251		265
252	...	266	...
253	ev_set_allocator (persistent_realloc);	267	ev_set_allocator (persistent_realloc);
254		268
255	=item ev_set_syserr_cb (void (*cb)(const char *msg));	269	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]
256		270
257	Set the callback function to call on a retryable system call error (such	271	Set the callback function to call on a retryable system call error (such
258	as failed select, poll, epoll_wait). The message is a printable string	272	as failed select, poll, epoll_wait). The message is a printable string
259	indicating the system call or subsystem causing the problem. If this	273	indicating the system call or subsystem causing the problem. If this
260	callback is set, then libev will expect it to remedy the situation, no	274	callback is set, then libev will expect it to remedy the situation, no
…		…
276		290
277	=back	291	=back
278		292
279	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	293	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
280		294
281	An event loop is described by a C<struct ev_loop *>. The library knows two	295	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	296	is I<not> optional in this case, as there is also an C<ev_loop>
283	events, and dynamically created loops which do not.	297	I<function>).
		298
		299	The library knows two types of such loops, the I<default> loop, which
		300	supports signals and child events, and dynamically created loops which do
		301	not.
284		302
285	=over 4	303	=over 4
286		304
287	=item struct ev_loop *ev_default_loop (unsigned int flags)	305	=item struct ev_loop *ev_default_loop (unsigned int flags)
288		306
…		…
294	If you don't know what event loop to use, use the one returned from this	312	If you don't know what event loop to use, use the one returned from this
295	function.	313	function.
296		314
297	Note that this function is I<not> thread-safe, so if you want to use it	315	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,	316	from multiple threads, you have to lock (note also that this is unlikely,
299	as loops cannot bes hared easily between threads anyway).	317	as loops cannot be shared easily between threads anyway).
300		318
301	The default loop is the only loop that can handle C<ev_signal> and	319	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	320	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	321	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	322	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
…		…
359	writing a server, you should C<accept ()> in a loop to accept as many	377	writing a server, you should C<accept ()> in a loop to accept as many
360	connections as possible during one iteration. You might also want to have	378	connections as possible during one iteration. You might also want to have
361	a look at C<ev_set_io_collect_interval ()> to increase the amount of	379	a look at C<ev_set_io_collect_interval ()> to increase the amount of
362	readiness notifications you get per iteration.	380	readiness notifications you get per iteration.
363		381
		382	This backend maps C<EV_READ> to the C<readfds> set and C<EV_WRITE> to the
		383	C<writefds> set (and to work around Microsoft Windows bugs, also onto the
		384	C<exceptfds> set on that platform).
		385
364	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)	386	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
365		387
366	And this is your standard poll(2) backend. It's more complicated	388	And this is your standard poll(2) backend. It's more complicated
367	than select, but handles sparse fds better and has no artificial	389	than select, but handles sparse fds better and has no artificial
368	limit on the number of fds you can use (except it will slow down	390	limit on the number of fds you can use (except it will slow down
369	considerably with a lot of inactive fds). It scales similarly to select,	391	considerably with a lot of inactive fds). It scales similarly to select,
370	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for	392	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
371	performance tips.	393	performance tips.
372		394
		395	This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
		396	C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
		397
373	=item C<EVBACKEND_EPOLL> (value 4, Linux)	398	=item C<EVBACKEND_EPOLL> (value 4, Linux)
374		399
375	For few fds, this backend is a bit little slower than poll and select,	400	For few fds, this backend is a bit little slower than poll and select,
376	but it scales phenomenally better. While poll and select usually scale	401	but it scales phenomenally better. While poll and select usually scale
377	like O(total_fds) where n is the total number of fds (or the highest fd),	402	like O(total_fds) where n is the total number of fds (or the highest fd),
378	epoll scales either O(1) or O(active_fds). The epoll design has a number	403	epoll scales either O(1) or O(active_fds).
379	of shortcomings, such as silently dropping events in some hard-to-detect	404
380	cases and requiring a system call per fd change, no fork support and bad	405	The epoll mechanism deserves honorable mention as the most misdesigned
381	support for dup.	406	of the more advanced event mechanisms: mere annoyances include silently
		407	dropping file descriptors, requiring a system call per change per file
		408	descriptor (and unnecessary guessing of parameters), problems with dup and
		409	so on. The biggest issue is fork races, however - if a program forks then
		410	I<both> parent and child process have to recreate the epoll set, which can
		411	take considerable time (one syscall per file descriptor) and is of course
		412	hard to detect.
		413
		414	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
		415	of course I<doesn't>, and epoll just loves to report events for totally
		416	I<different> file descriptors (even already closed ones, so one cannot
		417	even remove them from the set) than registered in the set (especially
		418	on SMP systems). Libev tries to counter these spurious notifications by
		419	employing an additional generation counter and comparing that against the
		420	events to filter out spurious ones, recreating the set when required.
382		421
383	While stopping, setting and starting an I/O watcher in the same iteration	422	While stopping, setting and starting an I/O watcher in the same iteration
384	will result in some caching, there is still a system call per such incident	423	will result in some caching, there is still a system call per such
385	(because the fd could point to a different file description now), so its	424	incident (because the same I<file descriptor> could point to a different
386	best to avoid that. Also, C<dup ()>'ed file descriptors might not work	425	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
387	very well if you register events for both fds.	426	file descriptors might not work very well if you register events for both
388		427	file descriptors.
389	Please note that epoll sometimes generates spurious notifications, so you
390	need to use non-blocking I/O or other means to avoid blocking when no data
391	(or space) is available.
392		428
393	Best performance from this backend is achieved by not unregistering all	429	Best performance from this backend is achieved by not unregistering all
394	watchers for a file descriptor until it has been closed, if possible, i.e.	430	watchers for a file descriptor until it has been closed, if possible,
395	keep at least one watcher active per fd at all times.	431	i.e. keep at least one watcher active per fd at all times. Stopping and
		432	starting a watcher (without re-setting it) also usually doesn't cause
		433	extra overhead. A fork can both result in spurious notifications as well
		434	as in libev having to destroy and recreate the epoll object, which can
		435	take considerable time and thus should be avoided.
		436
		437	All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
		438	faster than epoll for maybe up to a hundred file descriptors, depending on
		439	the usage. So sad.
396		440
397	While nominally embeddable in other event loops, this feature is broken in	441	While nominally embeddable in other event loops, this feature is broken in
398	all kernel versions tested so far.	442	all kernel versions tested so far.
		443
		444	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		445	C<EVBACKEND_POLL>.
399		446
400	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	447	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
401		448
402	Kqueue deserves special mention, as at the time of this writing, it	449	Kqueue deserves special mention, as at the time of this writing, it
403	was broken on all BSDs except NetBSD (usually it doesn't work reliably	450	was broken on all BSDs except NetBSD (usually it doesn't work reliably
404	with anything but sockets and pipes, except on Darwin, where of course	451	with anything but sockets and pipes, except on Darwin, where of course
405	it's completely useless). For this reason it's not being "auto-detected"	452	it's completely useless). Unlike epoll, however, whose brokenness
		453	is by design, these kqueue bugs can (and eventually will) be fixed
		454	without API changes to existing programs. For this reason it's not being
406	unless you explicitly specify it explicitly in the flags (i.e. using	455	"auto-detected" unless you explicitly specify it in the flags (i.e. using
407	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)	456	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
408	system like NetBSD.	457	system like NetBSD.
409		458
410	You still can embed kqueue into a normal poll or select backend and use it	459	You still can embed kqueue into a normal poll or select backend and use it
411	only for sockets (after having made sure that sockets work with kqueue on	460	only for sockets (after having made sure that sockets work with kqueue on
…		…
413		462
414	It scales in the same way as the epoll backend, but the interface to the	463	It scales in the same way as the epoll backend, but the interface to the
415	kernel is more efficient (which says nothing about its actual speed, of	464	kernel is more efficient (which says nothing about its actual speed, of
416	course). While stopping, setting and starting an I/O watcher does never	465	course). While stopping, setting and starting an I/O watcher does never
417	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	466	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
418	two event changes per incident, support for C<fork ()> is very bad and it	467	two event changes per incident. Support for C<fork ()> is very bad (but
419	drops fds silently in similarly hard-to-detect cases.	468	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
		469	cases
420		470
421	This backend usually performs well under most conditions.	471	This backend usually performs well under most conditions.
422		472
423	While nominally embeddable in other event loops, this doesn't work	473	While nominally embeddable in other event loops, this doesn't work
424	everywhere, so you might need to test for this. And since it is broken	474	everywhere, so you might need to test for this. And since it is broken
425	almost everywhere, you should only use it when you have a lot of sockets	475	almost everywhere, you should only use it when you have a lot of sockets
426	(for which it usually works), by embedding it into another event loop	476	(for which it usually works), by embedding it into another event loop
427	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for	477	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course
428	sockets.	478	also broken on OS X)) and, did I mention it, using it only for sockets.
		479
		480	This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
		481	C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
		482	C<NOTE_EOF>.
429		483
430	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)	484	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
431		485
432	This is not implemented yet (and might never be, unless you send me an	486	This is not implemented yet (and might never be, unless you send me an
433	implementation). According to reports, C</dev/poll> only supports sockets	487	implementation). According to reports, C</dev/poll> only supports sockets
…		…
446	While this backend scales well, it requires one system call per active	500	While this backend scales well, it requires one system call per active
447	file descriptor per loop iteration. For small and medium numbers of file	501	file descriptor per loop iteration. For small and medium numbers of file
448	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	502	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
449	might perform better.	503	might perform better.
450		504
451	On the positive side, ignoring the spurious readiness notifications, this	505	On the positive side, with the exception of the spurious readiness
452	backend actually performed to specification in all tests and is fully	506	notifications, this backend actually performed fully to specification
453	embeddable, which is a rare feat among the OS-specific backends.	507	in all tests and is fully embeddable, which is a rare feat among the
		508	OS-specific backends (I vastly prefer correctness over speed hacks).
		509
		510	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		511	C<EVBACKEND_POLL>.
454		512
455	=item C<EVBACKEND_ALL>	513	=item C<EVBACKEND_ALL>
456		514
457	Try all backends (even potentially broken ones that wouldn't be tried	515	Try all backends (even potentially broken ones that wouldn't be tried
458	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	516	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
…		…
464		522
465	If one or more of these are or'ed into the flags value, then only these	523	If one or more of these are or'ed into the flags value, then only these
466	backends will be tried (in the reverse order as listed here). If none are	524	backends will be tried (in the reverse order as listed here). If none are
467	specified, all backends in C<ev_recommended_backends ()> will be tried.	525	specified, all backends in C<ev_recommended_backends ()> will be tried.
468		526
469	The most typical usage is like this:	527	Example: This is the most typical usage.
470		528
471	if (!ev_default_loop (0))	529	if (!ev_default_loop (0))
472	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	530	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
473		531
474	Restrict libev to the select and poll backends, and do not allow	532	Example: Restrict libev to the select and poll backends, and do not allow
475	environment settings to be taken into account:	533	environment settings to be taken into account:
476		534
477	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);	535	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
478		536
479	Use whatever libev has to offer, but make sure that kqueue is used if	537	Example: Use whatever libev has to offer, but make sure that kqueue is
480	available (warning, breaks stuff, best use only with your own private	538	used if available (warning, breaks stuff, best use only with your own
481	event loop and only if you know the OS supports your types of fds):	539	private event loop and only if you know the OS supports your types of
		540	fds):
482		541
483	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);	542	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
484		543
485	=item struct ev_loop *ev_loop_new (unsigned int flags)	544	=item struct ev_loop *ev_loop_new (unsigned int flags)
486		545
…		…
507	responsibility to either stop all watchers cleanly yourself I<before>	566	responsibility to either stop all watchers cleanly yourself I<before>
508	calling this function, or cope with the fact afterwards (which is usually	567	calling this function, or cope with the fact afterwards (which is usually
509	the easiest thing, you can just ignore the watchers and/or C<free ()> them	568	the easiest thing, you can just ignore the watchers and/or C<free ()> them
510	for example).	569	for example).
511		570
512	Note that certain global state, such as signal state, will not be freed by	571	Note that certain global state, such as signal state (and installed signal
513	this function, and related watchers (such as signal and child watchers)	572	handlers), will not be freed by this function, and related watchers (such
514	would need to be stopped manually.	573	as signal and child watchers) would need to be stopped manually.
515		574
516	In general it is not advisable to call this function except in the	575	In general it is not advisable to call this function except in the
517	rare occasion where you really need to free e.g. the signal handling	576	rare occasion where you really need to free e.g. the signal handling
518	pipe fds. If you need dynamically allocated loops it is better to use	577	pipe fds. If you need dynamically allocated loops it is better to use
519	C<ev_loop_new> and C<ev_loop_destroy>).	578	C<ev_loop_new> and C<ev_loop_destroy>).
…		…
544		603
545	=item ev_loop_fork (loop)	604	=item ev_loop_fork (loop)
546		605
547	Like C<ev_default_fork>, but acts on an event loop created by	606	Like C<ev_default_fork>, but acts on an event loop created by
548	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	607	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
549	after fork, and how you do this is entirely your own problem.	608	after fork that you want to re-use in the child, and how you do this is
		609	entirely your own problem.
550		610
551	=item int ev_is_default_loop (loop)	611	=item int ev_is_default_loop (loop)
552		612
553	Returns true when the given loop actually is the default loop, false otherwise.	613	Returns true when the given loop is, in fact, the default loop, and false
		614	otherwise.
554		615
555	=item unsigned int ev_loop_count (loop)	616	=item unsigned int ev_loop_count (loop)
556		617
557	Returns the count of loop iterations for the loop, which is identical to	618	Returns the count of loop iterations for the loop, which is identical to
558	the number of times libev did poll for new events. It starts at C<0> and	619	the number of times libev did poll for new events. It starts at C<0> and
559	happily wraps around with enough iterations.	620	happily wraps around with enough iterations.
560		621
561	This value can sometimes be useful as a generation counter of sorts (it	622	This value can sometimes be useful as a generation counter of sorts (it
562	"ticks" the number of loop iterations), as it roughly corresponds with	623	"ticks" the number of loop iterations), as it roughly corresponds with
563	C<ev_prepare> and C<ev_check> calls.	624	C<ev_prepare> and C<ev_check> calls.
		625
		626	=item unsigned int ev_loop_depth (loop)
		627
		628	Returns the number of times C<ev_loop> was entered minus the number of
		629	times C<ev_loop> was exited, in other words, the recursion depth.
		630
		631	Outside C<ev_loop>, this number is zero. In a callback, this number is
		632	C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
		633	in which case it is higher.
		634
		635	Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
		636	etc.), doesn't count as exit.
564		637
565	=item unsigned int ev_backend (loop)	638	=item unsigned int ev_backend (loop)
566		639
567	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	640	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
568	use.	641	use.
…		…
583		656
584	This function is rarely useful, but when some event callback runs for a	657	This function is rarely useful, but when some event callback runs for a
585	very long time without entering the event loop, updating libev's idea of	658	very long time without entering the event loop, updating libev's idea of
586	the current time is a good idea.	659	the current time is a good idea.
587		660
588	See also "The special problem of time updates" in the C<ev_timer> section.	661	See also L<The special problem of time updates> in the C<ev_timer> section.
		662
		663	=item ev_suspend (loop)
		664
		665	=item ev_resume (loop)
		666
		667	These two functions suspend and resume a loop, for use when the loop is
		668	not used for a while and timeouts should not be processed.
		669
		670	A typical use case would be an interactive program such as a game: When
		671	the user presses C<^Z> to suspend the game and resumes it an hour later it
		672	would be best to handle timeouts as if no time had actually passed while
		673	the program was suspended. This can be achieved by calling C<ev_suspend>
		674	in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling
		675	C<ev_resume> directly afterwards to resume timer processing.
		676
		677	Effectively, all C<ev_timer> watchers will be delayed by the time spend
		678	between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
		679	will be rescheduled (that is, they will lose any events that would have
		680	occured while suspended).
		681
		682	After calling C<ev_suspend> you B<must not> call I<any> function on the
		683	given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
		684	without a previous call to C<ev_suspend>.
		685
		686	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
		687	event loop time (see C<ev_now_update>).
589		688
590	=item ev_loop (loop, int flags)	689	=item ev_loop (loop, int flags)
591		690
592	Finally, this is it, the event handler. This function usually is called	691	Finally, this is it, the event handler. This function usually is called
593	after you initialised all your watchers and you want to start handling	692	after you initialised all your watchers and you want to start handling
…		…
596	If the flags argument is specified as C<0>, it will not return until	695	If the flags argument is specified as C<0>, it will not return until
597	either no event watchers are active anymore or C<ev_unloop> was called.	696	either no event watchers are active anymore or C<ev_unloop> was called.
598		697
599	Please note that an explicit C<ev_unloop> is usually better than	698	Please note that an explicit C<ev_unloop> is usually better than
600	relying on all watchers to be stopped when deciding when a program has	699	relying on all watchers to be stopped when deciding when a program has
601	finished (especially in interactive programs), but having a program that	700	finished (especially in interactive programs), but having a program
602	automatically loops as long as it has to and no longer by virtue of	701	that automatically loops as long as it has to and no longer by virtue
603	relying on its watchers stopping correctly is a thing of beauty.	702	of relying on its watchers stopping correctly, that is truly a thing of
		703	beauty.
604		704
605	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	705	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
606	those events and any outstanding ones, but will not block your process in	706	those events and any already outstanding ones, but will not block your
607	case there are no events and will return after one iteration of the loop.	707	process in case there are no events and will return after one iteration of
		708	the loop.
608		709
609	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	710	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
610	necessary) and will handle those and any outstanding ones. It will block	711	necessary) and will handle those and any already outstanding ones. It
611	your process until at least one new event arrives, and will return after	712	will block your process until at least one new event arrives (which could
612	one iteration of the loop. This is useful if you are waiting for some	713	be an event internal to libev itself, so there is no guarantee that a
613	external event in conjunction with something not expressible using other	714	user-registered callback will be called), and will return after one
		715	iteration of the loop.
		716
		717	This is useful if you are waiting for some external event in conjunction
		718	with something not expressible using other libev watchers (i.e. "roll your
614	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	719	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
615	usually a better approach for this kind of thing.	720	usually a better approach for this kind of thing.
616		721
617	Here are the gory details of what C<ev_loop> does:	722	Here are the gory details of what C<ev_loop> does:
618		723
619	- Before the first iteration, call any pending watchers.	724	- Before the first iteration, call any pending watchers.
…		…
629	any active watchers at all will result in not sleeping).	734	any active watchers at all will result in not sleeping).
630	- Sleep if the I/O and timer collect interval say so.	735	- Sleep if the I/O and timer collect interval say so.
631	- Block the process, waiting for any events.	736	- Block the process, waiting for any events.
632	- Queue all outstanding I/O (fd) events.	737	- Queue all outstanding I/O (fd) events.
633	- Update the "event loop time" (ev_now ()), and do time jump adjustments.	738	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
634	- Queue all outstanding timers.	739	- Queue all expired timers.
635	- Queue all outstanding periodics.	740	- Queue all expired periodics.
636	- Unless any events are pending now, queue all idle watchers.	741	- Unless any events are pending now, queue all idle watchers.
637	- Queue all check watchers.	742	- Queue all check watchers.
638	- Call all queued watchers in reverse order (i.e. check watchers first).	743	- Call all queued watchers in reverse order (i.e. check watchers first).
639	Signals and child watchers are implemented as I/O watchers, and will	744	Signals and child watchers are implemented as I/O watchers, and will
640	be handled here by queueing them when their watcher gets executed.	745	be handled here by queueing them when their watcher gets executed.
…		…
657	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	762	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
658	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	763	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
659		764
660	This "unloop state" will be cleared when entering C<ev_loop> again.	765	This "unloop state" will be cleared when entering C<ev_loop> again.
661		766
		767	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.
		768
662	=item ev_ref (loop)	769	=item ev_ref (loop)
663		770
664	=item ev_unref (loop)	771	=item ev_unref (loop)
665		772
666	Ref/unref can be used to add or remove a reference count on the event	773	Ref/unref can be used to add or remove a reference count on the event
667	loop: Every watcher keeps one reference, and as long as the reference	774	loop: Every watcher keeps one reference, and as long as the reference
668	count is nonzero, C<ev_loop> will not return on its own. If you have	775	count is nonzero, C<ev_loop> will not return on its own.
		776
669	a watcher you never unregister that should not keep C<ev_loop> from	777	If you have a watcher you never unregister that should not keep C<ev_loop>
670	returning, ev_unref() after starting, and ev_ref() before stopping it. For	778	from returning, call ev_unref() after starting, and ev_ref() before
		779	stopping it.
		780
671	example, libev itself uses this for its internal signal pipe: It is not	781	As an example, libev itself uses this for its internal signal pipe: It
672	visible to the libev user and should not keep C<ev_loop> from exiting if	782	is not visible to the libev user and should not keep C<ev_loop> from
673	no event watchers registered by it are active. It is also an excellent	783	exiting if no event watchers registered by it are active. It is also an
674	way to do this for generic recurring timers or from within third-party	784	excellent way to do this for generic recurring timers or from within
675	libraries. Just remember to I<unref after start> and I<ref before stop>	785	third-party libraries. Just remember to I<unref after start> and I<ref
676	(but only if the watcher wasn't active before, or was active before,	786	before stop> (but only if the watcher wasn't active before, or was active
677	respectively).	787	before, respectively. Note also that libev might stop watchers itself
		788	(e.g. non-repeating timers) in which case you have to C<ev_ref>
		789	in the callback).
678		790
679	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	791	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
680	running when nothing else is active.	792	running when nothing else is active.
681		793
682	struct ev_signal exitsig;	794	ev_signal exitsig;
683	ev_signal_init (&exitsig, sig_cb, SIGINT);	795	ev_signal_init (&exitsig, sig_cb, SIGINT);
684	ev_signal_start (loop, &exitsig);	796	ev_signal_start (loop, &exitsig);
685	evf_unref (loop);	797	evf_unref (loop);
686		798
687	Example: For some weird reason, unregister the above signal handler again.	799	Example: For some weird reason, unregister the above signal handler again.
…		…
701	Setting these to a higher value (the C<interval> I<must> be >= C<0>)	813	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
702	allows libev to delay invocation of I/O and timer/periodic callbacks	814	allows libev to delay invocation of I/O and timer/periodic callbacks
703	to increase efficiency of loop iterations (or to increase power-saving	815	to increase efficiency of loop iterations (or to increase power-saving
704	opportunities).	816	opportunities).
705		817
706	The background is that sometimes your program runs just fast enough to	818	The idea is that sometimes your program runs just fast enough to handle
707	handle one (or very few) event(s) per loop iteration. While this makes	819	one (or very few) event(s) per loop iteration. While this makes the
708	the program responsive, it also wastes a lot of CPU time to poll for new	820	program responsive, it also wastes a lot of CPU time to poll for new
709	events, especially with backends like C<select ()> which have a high	821	events, especially with backends like C<select ()> which have a high
710	overhead for the actual polling but can deliver many events at once.	822	overhead for the actual polling but can deliver many events at once.
711		823
712	By setting a higher I<io collect interval> you allow libev to spend more	824	By setting a higher I<io collect interval> you allow libev to spend more
713	time collecting I/O events, so you can handle more events per iteration,	825	time collecting I/O events, so you can handle more events per iteration,
714	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	826	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
715	C<ev_timer>) will be not affected. Setting this to a non-null value will	827	C<ev_timer>) will be not affected. Setting this to a non-null value will
716	introduce an additional C<ev_sleep ()> call into most loop iterations.	828	introduce an additional C<ev_sleep ()> call into most loop iterations. The
		829	sleep time ensures that libev will not poll for I/O events more often then
		830	once per this interval, on average.
717		831
718	Likewise, by setting a higher I<timeout collect interval> you allow libev	832	Likewise, by setting a higher I<timeout collect interval> you allow libev
719	to spend more time collecting timeouts, at the expense of increased	833	to spend more time collecting timeouts, at the expense of increased
720	latency (the watcher callback will be called later). C<ev_io> watchers	834	latency/jitter/inexactness (the watcher callback will be called
721	will not be affected. Setting this to a non-null value will not introduce	835	later). C<ev_io> watchers will not be affected. Setting this to a non-null
722	any overhead in libev.	836	value will not introduce any overhead in libev.
723		837
724	Many (busy) programs can usually benefit by setting the I/O collect	838	Many (busy) programs can usually benefit by setting the I/O collect
725	interval to a value near C<0.1> or so, which is often enough for	839	interval to a value near C<0.1> or so, which is often enough for
726	interactive servers (of course not for games), likewise for timeouts. It	840	interactive servers (of course not for games), likewise for timeouts. It
727	usually doesn't make much sense to set it to a lower value than C<0.01>,	841	usually doesn't make much sense to set it to a lower value than C<0.01>,
728	as this approaches the timing granularity of most systems.	842	as this approaches the timing granularity of most systems. Note that if
		843	you do transactions with the outside world and you can't increase the
		844	parallelity, then this setting will limit your transaction rate (if you
		845	need to poll once per transaction and the I/O collect interval is 0.01,
		846	then you can't do more than 100 transations per second).
729		847
730	Setting the I<timeout collect interval> can improve the opportunity for	848	Setting the I<timeout collect interval> can improve the opportunity for
731	saving power, as the program will "bundle" timer callback invocations that	849	saving power, as the program will "bundle" timer callback invocations that
732	are "near" in time together, by delaying some, thus reducing the number of	850	are "near" in time together, by delaying some, thus reducing the number of
733	times the process sleeps and wakes up again. Another useful technique to	851	times the process sleeps and wakes up again. Another useful technique to
734	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure	852	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
735	they fire on, say, one-second boundaries only.	853	they fire on, say, one-second boundaries only.
736		854
		855	Example: we only need 0.1s timeout granularity, and we wish not to poll
		856	more often than 100 times per second:
		857
		858	ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
		859	ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
		860
		861	=item ev_invoke_pending (loop)
		862
		863	This call will simply invoke all pending watchers while resetting their
		864	pending state. Normally, C<ev_loop> does this automatically when required,
		865	but when overriding the invoke callback this call comes handy.
		866
		867	=item int ev_pending_count (loop)
		868
		869	Returns the number of pending watchers - zero indicates that no watchers
		870	are pending.
		871
		872	=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
		873
		874	This overrides the invoke pending functionality of the loop: Instead of
		875	invoking all pending watchers when there are any, C<ev_loop> will call
		876	this callback instead. This is useful, for example, when you want to
		877	invoke the actual watchers inside another context (another thread etc.).
		878
		879	If you want to reset the callback, use C<ev_invoke_pending> as new
		880	callback.
		881
		882	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
		883
		884	Sometimes you want to share the same loop between multiple threads. This
		885	can be done relatively simply by putting mutex_lock/unlock calls around
		886	each call to a libev function.
		887
		888	However, C<ev_loop> can run an indefinite time, so it is not feasible to
		889	wait for it to return. One way around this is to wake up the loop via
		890	C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
		891	and I<acquire> callbacks on the loop.
		892
		893	When set, then C<release> will be called just before the thread is
		894	suspended waiting for new events, and C<acquire> is called just
		895	afterwards.
		896
		897	Ideally, C<release> will just call your mutex_unlock function, and
		898	C<acquire> will just call the mutex_lock function again.
		899
		900	While event loop modifications are allowed between invocations of
		901	C<release> and C<acquire> (that's their only purpose after all), no
		902	modifications done will affect the event loop, i.e. adding watchers will
		903	have no effect on the set of file descriptors being watched, or the time
		904	waited. USe an C<ev_async> watcher to wake up C<ev_loop> when you want it
		905	to take note of any changes you made.
		906
		907	In theory, threads executing C<ev_loop> will be async-cancel safe between
		908	invocations of C<release> and C<acquire>.
		909
		910	See also the locking example in the C<THREADS> section later in this
		911	document.
		912
		913	=item ev_set_userdata (loop, void *data)
		914
		915	=item ev_userdata (loop)
		916
		917	Set and retrieve a single C<void *> associated with a loop. When
		918	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
		919	C<0.>
		920
		921	These two functions can be used to associate arbitrary data with a loop,
		922	and are intended solely for the C<invoke_pending_cb>, C<release> and
		923	C<acquire> callbacks described above, but of course can be (ab-)used for
		924	any other purpose as well.
		925
737	=item ev_loop_verify (loop)	926	=item ev_loop_verify (loop)
738		927
739	This function only does something when C<EV_VERIFY> support has been	928	This function only does something when C<EV_VERIFY> support has been
740	compiled in. It tries to go through all internal structures and checks	929	compiled in, which is the default for non-minimal builds. It tries to go
741	them for validity. If anything is found to be inconsistent, it will print	930	through all internal structures and checks them for validity. If anything
742	an error message to standard error and call C<abort ()>.	931	is found to be inconsistent, it will print an error message to standard
		932	error and call C<abort ()>.
743		933
744	This can be used to catch bugs inside libev itself: under normal	934	This can be used to catch bugs inside libev itself: under normal
745	circumstances, this function will never abort as of course libev keeps its	935	circumstances, this function will never abort as of course libev keeps its
746	data structures consistent.	936	data structures consistent.
747		937
748	=back	938	=back
749		939
750		940
751	=head1 ANATOMY OF A WATCHER	941	=head1 ANATOMY OF A WATCHER
752		942
		943	In the following description, uppercase C<TYPE> in names stands for the
		944	watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
		945	watchers and C<ev_io_start> for I/O watchers.
		946
753	A watcher is a structure that you create and register to record your	947	A watcher is a structure that you create and register to record your
754	interest in some event. For instance, if you want to wait for STDIN to	948	interest in some event. For instance, if you want to wait for STDIN to
755	become readable, you would create an C<ev_io> watcher for that:	949	become readable, you would create an C<ev_io> watcher for that:
756		950
757	static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)	951	static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
758	{	952	{
759	ev_io_stop (w);	953	ev_io_stop (w);
760	ev_unloop (loop, EVUNLOOP_ALL);	954	ev_unloop (loop, EVUNLOOP_ALL);
761	}	955	}
762		956
763	struct ev_loop *loop = ev_default_loop (0);	957	struct ev_loop *loop = ev_default_loop (0);
		958
764	struct ev_io stdin_watcher;	959	ev_io stdin_watcher;
		960
765	ev_init (&stdin_watcher, my_cb);	961	ev_init (&stdin_watcher, my_cb);
766	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	962	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
767	ev_io_start (loop, &stdin_watcher);	963	ev_io_start (loop, &stdin_watcher);
		964
768	ev_loop (loop, 0);	965	ev_loop (loop, 0);
769		966
770	As you can see, you are responsible for allocating the memory for your	967	As you can see, you are responsible for allocating the memory for your
771	watcher structures (and it is usually a bad idea to do this on the stack,	968	watcher structures (and it is I<usually> a bad idea to do this on the
772	although this can sometimes be quite valid).	969	stack).
		970
		971	Each watcher has an associated watcher structure (called C<struct ev_TYPE>
		972	or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
773		973
774	Each watcher structure must be initialised by a call to C<ev_init	974	Each watcher structure must be initialised by a call to C<ev_init
775	(watcher *, callback)>, which expects a callback to be provided. This	975	(watcher *, callback)>, which expects a callback to be provided. This
776	callback gets invoked each time the event occurs (or, in the case of I/O	976	callback gets invoked each time the event occurs (or, in the case of I/O
777	watchers, each time the event loop detects that the file descriptor given	977	watchers, each time the event loop detects that the file descriptor given
778	is readable and/or writable).	978	is readable and/or writable).
779		979
780	Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro	980	Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
781	with arguments specific to this watcher type. There is also a macro	981	macro to configure it, with arguments specific to the watcher type. There
782	to combine initialisation and setting in one call: C<< ev_<type>_init	982	is also a macro to combine initialisation and setting in one call: C<<
783	(watcher *, callback, ...) >>.	983	ev_TYPE_init (watcher *, callback, ...) >>.
784		984
785	To make the watcher actually watch out for events, you have to start it	985	To make the watcher actually watch out for events, you have to start it
786	with a watcher-specific start function (C<< ev_<type>_start (loop, watcher	986	with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher
787	*) >>), and you can stop watching for events at any time by calling the	987	*) >>), and you can stop watching for events at any time by calling the
788	corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.	988	corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>.
789		989
790	As long as your watcher is active (has been started but not stopped) you	990	As long as your watcher is active (has been started but not stopped) you
791	must not touch the values stored in it. Most specifically you must never	991	must not touch the values stored in it. Most specifically you must never
792	reinitialise it or call its C<set> macro.	992	reinitialise it or call its C<ev_TYPE_set> macro.
793		993
794	Each and every callback receives the event loop pointer as first, the	994	Each and every callback receives the event loop pointer as first, the
795	registered watcher structure as second, and a bitset of received events as	995	registered watcher structure as second, and a bitset of received events as
796	third argument.	996	third argument.
797		997
…		…
855		1055
856	=item C<EV_ASYNC>	1056	=item C<EV_ASYNC>
857		1057
858	The given async watcher has been asynchronously notified (see C<ev_async>).	1058	The given async watcher has been asynchronously notified (see C<ev_async>).
859		1059
		1060	=item C<EV_CUSTOM>
		1061
		1062	Not ever sent (or otherwise used) by libev itself, but can be freely used
		1063	by libev users to signal watchers (e.g. via C<ev_feed_event>).
		1064
860	=item C<EV_ERROR>	1065	=item C<EV_ERROR>
861		1066
862	An unspecified error has occurred, the watcher has been stopped. This might	1067	An unspecified error has occurred, the watcher has been stopped. This might
863	happen because the watcher could not be properly started because libev	1068	happen because the watcher could not be properly started because libev
864	ran out of memory, a file descriptor was found to be closed or any other	1069	ran out of memory, a file descriptor was found to be closed or any other
		1070	problem. Libev considers these application bugs.
		1071
865	problem. You best act on it by reporting the problem and somehow coping	1072	You best act on it by reporting the problem and somehow coping with the
866	with the watcher being stopped.	1073	watcher being stopped. Note that well-written programs should not receive
		1074	an error ever, so when your watcher receives it, this usually indicates a
		1075	bug in your program.
867		1076
868	Libev will usually signal a few "dummy" events together with an error,	1077	Libev will usually signal a few "dummy" events together with an error, for
869	for example it might indicate that a fd is readable or writable, and if	1078	example it might indicate that a fd is readable or writable, and if your
870	your callbacks is well-written it can just attempt the operation and cope	1079	callbacks is well-written it can just attempt the operation and cope with
871	with the error from read() or write(). This will not work in multi-threaded	1080	the error from read() or write(). This will not work in multi-threaded
872	programs, though, so beware.	1081	programs, though, as the fd could already be closed and reused for another
		1082	thing, so beware.
873		1083
874	=back	1084	=back
875		1085
876	=head2 GENERIC WATCHER FUNCTIONS	1086	=head2 GENERIC WATCHER FUNCTIONS
877
878	In the following description, C<TYPE> stands for the watcher type,
879	e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
880		1087
881	=over 4	1088	=over 4
882		1089
883	=item C<ev_init> (ev_TYPE *watcher, callback)	1090	=item C<ev_init> (ev_TYPE *watcher, callback)
884		1091
…		…
890	which rolls both calls into one.	1097	which rolls both calls into one.
891		1098
892	You can reinitialise a watcher at any time as long as it has been stopped	1099	You can reinitialise a watcher at any time as long as it has been stopped
893	(or never started) and there are no pending events outstanding.	1100	(or never started) and there are no pending events outstanding.
894		1101
895	The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,	1102	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
896	int revents)>.	1103	int revents)>.
		1104
		1105	Example: Initialise an C<ev_io> watcher in two steps.
		1106
		1107	ev_io w;
		1108	ev_init (&w, my_cb);
		1109	ev_io_set (&w, STDIN_FILENO, EV_READ);
897		1110
898	=item C<ev_TYPE_set> (ev_TYPE *, [args])	1111	=item C<ev_TYPE_set> (ev_TYPE *, [args])
899		1112
900	This macro initialises the type-specific parts of a watcher. You need to	1113	This macro initialises the type-specific parts of a watcher. You need to
901	call C<ev_init> at least once before you call this macro, but you can	1114	call C<ev_init> at least once before you call this macro, but you can
…		…
904	difference to the C<ev_init> macro).	1117	difference to the C<ev_init> macro).
905		1118
906	Although some watcher types do not have type-specific arguments	1119	Although some watcher types do not have type-specific arguments
907	(e.g. C<ev_prepare>) you still need to call its C<set> macro.	1120	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
908		1121
		1122	See C<ev_init>, above, for an example.
		1123
909	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])	1124	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
910		1125
911	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro	1126	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
912	calls into a single call. This is the most convenient method to initialise	1127	calls into a single call. This is the most convenient method to initialise
913	a watcher. The same limitations apply, of course.	1128	a watcher. The same limitations apply, of course.
914		1129
		1130	Example: Initialise and set an C<ev_io> watcher in one step.
		1131
		1132	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
		1133
915	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)	1134	=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
916		1135
917	Starts (activates) the given watcher. Only active watchers will receive	1136	Starts (activates) the given watcher. Only active watchers will receive
918	events. If the watcher is already active nothing will happen.	1137	events. If the watcher is already active nothing will happen.
919		1138
		1139	Example: Start the C<ev_io> watcher that is being abused as example in this
		1140	whole section.
		1141
		1142	ev_io_start (EV_DEFAULT_UC, &w);
		1143
920	=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)	1144	=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
921		1145
922	Stops the given watcher again (if active) and clears the pending	1146	Stops the given watcher if active, and clears the pending status (whether
		1147	the watcher was active or not).
		1148
923	status. It is possible that stopped watchers are pending (for example,	1149	It is possible that stopped watchers are pending - for example,
924	non-repeating timers are being stopped when they become pending), but	1150	non-repeating timers are being stopped when they become pending - but
925	C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If	1151	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
926	you want to free or reuse the memory used by the watcher it is therefore a	1152	pending. If you want to free or reuse the memory used by the watcher it is
927	good idea to always call its C<ev_TYPE_stop> function.	1153	therefore a good idea to always call its C<ev_TYPE_stop> function.
928		1154
929	=item bool ev_is_active (ev_TYPE *watcher)	1155	=item bool ev_is_active (ev_TYPE *watcher)
930		1156
931	Returns a true value iff the watcher is active (i.e. it has been started	1157	Returns a true value iff the watcher is active (i.e. it has been started
932	and not yet been stopped). As long as a watcher is active you must not modify	1158	and not yet been stopped). As long as a watcher is active you must not modify
…		…
958	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>	1184	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
959	(default: C<-2>). Pending watchers with higher priority will be invoked	1185	(default: C<-2>). Pending watchers with higher priority will be invoked
960	before watchers with lower priority, but priority will not keep watchers	1186	before watchers with lower priority, but priority will not keep watchers
961	from being executed (except for C<ev_idle> watchers).	1187	from being executed (except for C<ev_idle> watchers).
962		1188
963	This means that priorities are I<only> used for ordering callback
964	invocation after new events have been received. This is useful, for
965	example, to reduce latency after idling, or more often, to bind two
966	watchers on the same event and make sure one is called first.
967
968	If you need to suppress invocation when higher priority events are pending	1189	If you need to suppress invocation when higher priority events are pending
969	you need to look at C<ev_idle> watchers, which provide this functionality.	1190	you need to look at C<ev_idle> watchers, which provide this functionality.
970		1191
971	You I<must not> change the priority of a watcher as long as it is active or	1192	You I<must not> change the priority of a watcher as long as it is active or
972	pending.	1193	pending.
973		1194
		1195	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		1196	fine, as long as you do not mind that the priority value you query might
		1197	or might not have been clamped to the valid range.
		1198
974	The default priority used by watchers when no priority has been set is	1199	The default priority used by watchers when no priority has been set is
975	always C<0>, which is supposed to not be too high and not be too low :).	1200	always C<0>, which is supposed to not be too high and not be too low :).
976		1201
977	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is	1202	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
978	fine, as long as you do not mind that the priority value you query might	1203	priorities.
979	or might not have been adjusted to be within valid range.
980		1204
981	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1205	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
982		1206
983	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1207	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
984	C<loop> nor C<revents> need to be valid as long as the watcher callback	1208	C<loop> nor C<revents> need to be valid as long as the watcher callback
985	can deal with that fact.	1209	can deal with that fact, as both are simply passed through to the
		1210	callback.
986		1211
987	=item int ev_clear_pending (loop, ev_TYPE *watcher)	1212	=item int ev_clear_pending (loop, ev_TYPE *watcher)
988		1213
989	If the watcher is pending, this function returns clears its pending status	1214	If the watcher is pending, this function clears its pending status and
990	and returns its C<revents> bitset (as if its callback was invoked). If the	1215	returns its C<revents> bitset (as if its callback was invoked). If the
991	watcher isn't pending it does nothing and returns C<0>.	1216	watcher isn't pending it does nothing and returns C<0>.
992		1217
		1218	Sometimes it can be useful to "poll" a watcher instead of waiting for its
		1219	callback to be invoked, which can be accomplished with this function.
		1220
993	=back	1221	=back
994		1222
995		1223
996	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1224	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
997		1225
998	Each watcher has, by default, a member C<void *data> that you can change	1226	Each watcher has, by default, a member C<void *data> that you can change
999	and read at any time, libev will completely ignore it. This can be used	1227	and read at any time: libev will completely ignore it. This can be used
1000	to associate arbitrary data with your watcher. If you need more data and	1228	to associate arbitrary data with your watcher. If you need more data and
1001	don't want to allocate memory and store a pointer to it in that data	1229	don't want to allocate memory and store a pointer to it in that data
1002	member, you can also "subclass" the watcher type and provide your own	1230	member, you can also "subclass" the watcher type and provide your own
1003	data:	1231	data:
1004		1232
1005	struct my_io	1233	struct my_io
1006	{	1234	{
1007	struct ev_io io;	1235	ev_io io;
1008	int otherfd;	1236	int otherfd;
1009	void *somedata;	1237	void *somedata;
1010	struct whatever *mostinteresting;	1238	struct whatever *mostinteresting;
1011	}	1239	};
		1240
		1241	...
		1242	struct my_io w;
		1243	ev_io_init (&w.io, my_cb, fd, EV_READ);
1012		1244
1013	And since your callback will be called with a pointer to the watcher, you	1245	And since your callback will be called with a pointer to the watcher, you
1014	can cast it back to your own type:	1246	can cast it back to your own type:
1015		1247
1016	static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)	1248	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1017	{	1249	{
1018	struct my_io *w = (struct my_io *)w_;	1250	struct my_io *w = (struct my_io *)w_;
1019	...	1251	...
1020	}	1252	}
1021		1253
1022	More interesting and less C-conformant ways of casting your callback type	1254	More interesting and less C-conformant ways of casting your callback type
1023	instead have been omitted.	1255	instead have been omitted.
1024		1256
1025	Another common scenario is having some data structure with multiple	1257	Another common scenario is to use some data structure with multiple
1026	watchers:	1258	embedded watchers:
1027		1259
1028	struct my_biggy	1260	struct my_biggy
1029	{	1261	{
1030	int some_data;	1262	int some_data;
1031	ev_timer t1;	1263	ev_timer t1;
1032	ev_timer t2;	1264	ev_timer t2;
1033	}	1265	}
1034		1266
1035	In this case getting the pointer to C<my_biggy> is a bit more complicated,	1267	In this case getting the pointer to C<my_biggy> is a bit more
1036	you need to use C<offsetof>:	1268	complicated: Either you store the address of your C<my_biggy> struct
		1269	in the C<data> member of the watcher (for woozies), or you need to use
		1270	some pointer arithmetic using C<offsetof> inside your watchers (for real
		1271	programmers):
1037		1272
1038	#include <stddef.h>	1273	#include <stddef.h>
1039		1274
1040	static void	1275	static void
1041	t1_cb (EV_P_ struct ev_timer *w, int revents)	1276	t1_cb (EV_P_ ev_timer *w, int revents)
1042	{	1277	{
1043	struct my_biggy big = (struct my_biggy *	1278	struct my_biggy big = (struct my_biggy *)
1044	(((char *)w) - offsetof (struct my_biggy, t1));	1279	(((char *)w) - offsetof (struct my_biggy, t1));
1045	}	1280	}
1046		1281
1047	static void	1282	static void
1048	t2_cb (EV_P_ struct ev_timer *w, int revents)	1283	t2_cb (EV_P_ ev_timer *w, int revents)
1049	{	1284	{
1050	struct my_biggy big = (struct my_biggy *	1285	struct my_biggy big = (struct my_biggy *)
1051	(((char *)w) - offsetof (struct my_biggy, t2));	1286	(((char *)w) - offsetof (struct my_biggy, t2));
1052	}	1287	}
		1288
		1289	=head2 WATCHER PRIORITY MODELS
		1290
		1291	Many event loops support I<watcher priorities>, which are usually small
		1292	integers that influence the ordering of event callback invocation
		1293	between watchers in some way, all else being equal.
		1294
		1295	In libev, Watcher priorities can be set using C<ev_set_priority>. See its
		1296	description for the more technical details such as the actual priority
		1297	range.
		1298
		1299	There are two common ways how these these priorities are being interpreted
		1300	by event loops:
		1301
		1302	In the more common lock-out model, higher priorities "lock out" invocation
		1303	of lower priority watchers, which means as long as higher priority
		1304	watchers receive events, lower priority watchers are not being invoked.
		1305
		1306	The less common only-for-ordering model uses priorities solely to order
		1307	callback invocation within a single event loop iteration: Higher priority
		1308	watchers are invoked before lower priority ones, but they all get invoked
		1309	before polling for new events.
		1310
		1311	Libev uses the second (only-for-ordering) model for all its watchers
		1312	except for idle watchers (which use the lock-out model).
		1313
		1314	The rationale behind this is that implementing the lock-out model for
		1315	watchers is not well supported by most kernel interfaces, and most event
		1316	libraries will just poll for the same events again and again as long as
		1317	their callbacks have not been executed, which is very inefficient in the
		1318	common case of one high-priority watcher locking out a mass of lower
		1319	priority ones.
		1320
		1321	Static (ordering) priorities are most useful when you have two or more
		1322	watchers handling the same resource: a typical usage example is having an
		1323	C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
		1324	timeouts. Under load, data might be received while the program handles
		1325	other jobs, but since timers normally get invoked first, the timeout
		1326	handler will be executed before checking for data. In that case, giving
		1327	the timer a lower priority than the I/O watcher ensures that I/O will be
		1328	handled first even under adverse conditions (which is usually, but not
		1329	always, what you want).
		1330
		1331	Since idle watchers use the "lock-out" model, meaning that idle watchers
		1332	will only be executed when no same or higher priority watchers have
		1333	received events, they can be used to implement the "lock-out" model when
		1334	required.
		1335
		1336	For example, to emulate how many other event libraries handle priorities,
		1337	you can associate an C<ev_idle> watcher to each such watcher, and in
		1338	the normal watcher callback, you just start the idle watcher. The real
		1339	processing is done in the idle watcher callback. This causes libev to
		1340	continously poll and process kernel event data for the watcher, but when
		1341	the lock-out case is known to be rare (which in turn is rare :), this is
		1342	workable.
		1343
		1344	Usually, however, the lock-out model implemented that way will perform
		1345	miserably under the type of load it was designed to handle. In that case,
		1346	it might be preferable to stop the real watcher before starting the
		1347	idle watcher, so the kernel will not have to process the event in case
		1348	the actual processing will be delayed for considerable time.
		1349
		1350	Here is an example of an I/O watcher that should run at a strictly lower
		1351	priority than the default, and which should only process data when no
		1352	other events are pending:
		1353
		1354	ev_idle idle; // actual processing watcher
		1355	ev_io io; // actual event watcher
		1356
		1357	static void
		1358	io_cb (EV_P_ ev_io *w, int revents)
		1359	{
		1360	// stop the I/O watcher, we received the event, but
		1361	// are not yet ready to handle it.
		1362	ev_io_stop (EV_A_ w);
		1363
		1364	// start the idle watcher to ahndle the actual event.
		1365	// it will not be executed as long as other watchers
		1366	// with the default priority are receiving events.
		1367	ev_idle_start (EV_A_ &idle);
		1368	}
		1369
		1370	static void
		1371	idle_cb (EV_P_ ev_idle *w, int revents)
		1372	{
		1373	// actual processing
		1374	read (STDIN_FILENO, ...);
		1375
		1376	// have to start the I/O watcher again, as
		1377	// we have handled the event
		1378	ev_io_start (EV_P_ &io);
		1379	}
		1380
		1381	// initialisation
		1382	ev_idle_init (&idle, idle_cb);
		1383	ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
		1384	ev_io_start (EV_DEFAULT_ &io);
		1385
		1386	In the "real" world, it might also be beneficial to start a timer, so that
		1387	low-priority connections can not be locked out forever under load. This
		1388	enables your program to keep a lower latency for important connections
		1389	during short periods of high load, while not completely locking out less
		1390	important ones.
1053		1391
1054		1392
1055	=head1 WATCHER TYPES	1393	=head1 WATCHER TYPES
1056		1394
1057	This section describes each watcher in detail, but will not repeat	1395	This section describes each watcher in detail, but will not repeat
…		…
1081	In general you can register as many read and/or write event watchers per	1419	In general you can register as many read and/or write event watchers per
1082	fd as you want (as long as you don't confuse yourself). Setting all file	1420	fd as you want (as long as you don't confuse yourself). Setting all file
1083	descriptors to non-blocking mode is also usually a good idea (but not	1421	descriptors to non-blocking mode is also usually a good idea (but not
1084	required if you know what you are doing).	1422	required if you know what you are doing).
1085		1423
1086	If you must do this, then force the use of a known-to-be-good backend	1424	If you cannot use non-blocking mode, then force the use of a
1087	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and	1425	known-to-be-good backend (at the time of this writing, this includes only
1088	C<EVBACKEND_POLL>).	1426	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
		1427	descriptors for which non-blocking operation makes no sense (such as
		1428	files) - libev doesn't guarentee any specific behaviour in that case.
1089		1429
1090	Another thing you have to watch out for is that it is quite easy to	1430	Another thing you have to watch out for is that it is quite easy to
1091	receive "spurious" readiness notifications, that is your callback might	1431	receive "spurious" readiness notifications, that is your callback might
1092	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1432	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1093	because there is no data. Not only are some backends known to create a	1433	because there is no data. Not only are some backends known to create a
1094	lot of those (for example Solaris ports), it is very easy to get into	1434	lot of those (for example Solaris ports), it is very easy to get into
1095	this situation even with a relatively standard program structure. Thus	1435	this situation even with a relatively standard program structure. Thus
1096	it is best to always use non-blocking I/O: An extra C<read>(2) returning	1436	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1097	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1437	C<EAGAIN> is far preferable to a program hanging until some data arrives.
1098		1438
1099	If you cannot run the fd in non-blocking mode (for example you should not	1439	If you cannot run the fd in non-blocking mode (for example you should
1100	play around with an Xlib connection), then you have to separately re-test	1440	not play around with an Xlib connection), then you have to separately
1101	whether a file descriptor is really ready with a known-to-be good interface	1441	re-test whether a file descriptor is really ready with a known-to-be good
1102	such as poll (fortunately in our Xlib example, Xlib already does this on	1442	interface such as poll (fortunately in our Xlib example, Xlib already
1103	its own, so its quite safe to use).	1443	does this on its own, so its quite safe to use). Some people additionally
		1444	use C<SIGALRM> and an interval timer, just to be sure you won't block
		1445	indefinitely.
		1446
		1447	But really, best use non-blocking mode.
1104		1448
1105	=head3 The special problem of disappearing file descriptors	1449	=head3 The special problem of disappearing file descriptors
1106		1450
1107	Some backends (e.g. kqueue, epoll) need to be told about closing a file	1451	Some backends (e.g. kqueue, epoll) need to be told about closing a file
1108	descriptor (either by calling C<close> explicitly or by any other means,	1452	descriptor (either due to calling C<close> explicitly or any other means,
1109	such as C<dup>). The reason is that you register interest in some file	1453	such as C<dup2>). The reason is that you register interest in some file
1110	descriptor, but when it goes away, the operating system will silently drop	1454	descriptor, but when it goes away, the operating system will silently drop
1111	this interest. If another file descriptor with the same number then is	1455	this interest. If another file descriptor with the same number then is
1112	registered with libev, there is no efficient way to see that this is, in	1456	registered with libev, there is no efficient way to see that this is, in
1113	fact, a different file descriptor.	1457	fact, a different file descriptor.
1114		1458
…		…
1145	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1489	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1146	C<EVBACKEND_POLL>.	1490	C<EVBACKEND_POLL>.
1147		1491
1148	=head3 The special problem of SIGPIPE	1492	=head3 The special problem of SIGPIPE
1149		1493
1150	While not really specific to libev, it is easy to forget about SIGPIPE:	1494	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1151	when writing to a pipe whose other end has been closed, your program gets	1495	when writing to a pipe whose other end has been closed, your program gets
1152	send a SIGPIPE, which, by default, aborts your program. For most programs	1496	sent a SIGPIPE, which, by default, aborts your program. For most programs
1153	this is sensible behaviour, for daemons, this is usually undesirable.	1497	this is sensible behaviour, for daemons, this is usually undesirable.
1154		1498
1155	So when you encounter spurious, unexplained daemon exits, make sure you	1499	So when you encounter spurious, unexplained daemon exits, make sure you
1156	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon	1500	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1157	somewhere, as that would have given you a big clue).	1501	somewhere, as that would have given you a big clue).
…		…
1164	=item ev_io_init (ev_io *, callback, int fd, int events)	1508	=item ev_io_init (ev_io *, callback, int fd, int events)
1165		1509
1166	=item ev_io_set (ev_io *, int fd, int events)	1510	=item ev_io_set (ev_io *, int fd, int events)
1167		1511
1168	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to	1512	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1169	receive events for and events is either C<EV_READ>, C<EV_WRITE> or	1513	receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or
1170	C<EV_READ | EV_WRITE> to receive the given events.	1514	C<EV_READ | EV_WRITE>, to express the desire to receive the given events.
1171		1515
1172	=item int fd [read-only]	1516	=item int fd [read-only]
1173		1517
1174	The file descriptor being watched.	1518	The file descriptor being watched.
1175		1519
…		…
1184	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well	1528	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1185	readable, but only once. Since it is likely line-buffered, you could	1529	readable, but only once. Since it is likely line-buffered, you could
1186	attempt to read a whole line in the callback.	1530	attempt to read a whole line in the callback.
1187		1531
1188	static void	1532	static void
1189	stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)	1533	stdin_readable_cb (struct ev_loop *loop, ev_io *w, int revents)
1190	{	1534	{
1191	ev_io_stop (loop, w);	1535	ev_io_stop (loop, w);
1192	.. read from stdin here (or from w->fd) and haqndle any I/O errors	1536	.. read from stdin here (or from w->fd) and handle any I/O errors
1193	}	1537	}
1194		1538
1195	...	1539	...
1196	struct ev_loop *loop = ev_default_init (0);	1540	struct ev_loop *loop = ev_default_init (0);
1197	struct ev_io stdin_readable;	1541	ev_io stdin_readable;
1198	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1542	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1199	ev_io_start (loop, &stdin_readable);	1543	ev_io_start (loop, &stdin_readable);
1200	ev_loop (loop, 0);	1544	ev_loop (loop, 0);
1201		1545
1202		1546
…		…
1205	Timer watchers are simple relative timers that generate an event after a	1549	Timer watchers are simple relative timers that generate an event after a
1206	given time, and optionally repeating in regular intervals after that.	1550	given time, and optionally repeating in regular intervals after that.
1207		1551
1208	The timers are based on real time, that is, if you register an event that	1552	The timers are based on real time, that is, if you register an event that
1209	times out after an hour and you reset your system clock to January last	1553	times out after an hour and you reset your system clock to January last
1210	year, it will still time out after (roughly) and hour. "Roughly" because	1554	year, it will still time out after (roughly) one hour. "Roughly" because
1211	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1555	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1212	monotonic clock option helps a lot here).	1556	monotonic clock option helps a lot here).
1213		1557
1214	The callback is guaranteed to be invoked only after its timeout has passed,	1558	The callback is guaranteed to be invoked only I<after> its timeout has
1215	but if multiple timers become ready during the same loop iteration then	1559	passed (not I<at>, so on systems with very low-resolution clocks this
1216	order of execution is undefined.	1560	might introduce a small delay). If multiple timers become ready during the
		1561	same loop iteration then the ones with earlier time-out values are invoked
		1562	before ones of the same priority with later time-out values (but this is
		1563	no longer true when a callback calls C<ev_loop> recursively).
		1564
		1565	=head3 Be smart about timeouts
		1566
		1567	Many real-world problems involve some kind of timeout, usually for error
		1568	recovery. A typical example is an HTTP request - if the other side hangs,
		1569	you want to raise some error after a while.
		1570
		1571	What follows are some ways to handle this problem, from obvious and
		1572	inefficient to smart and efficient.
		1573
		1574	In the following, a 60 second activity timeout is assumed - a timeout that
		1575	gets reset to 60 seconds each time there is activity (e.g. each time some
		1576	data or other life sign was received).
		1577
		1578	=over 4
		1579
		1580	=item 1. Use a timer and stop, reinitialise and start it on activity.
		1581
		1582	This is the most obvious, but not the most simple way: In the beginning,
		1583	start the watcher:
		1584
		1585	ev_timer_init (timer, callback, 60., 0.);
		1586	ev_timer_start (loop, timer);
		1587
		1588	Then, each time there is some activity, C<ev_timer_stop> it, initialise it
		1589	and start it again:
		1590
		1591	ev_timer_stop (loop, timer);
		1592	ev_timer_set (timer, 60., 0.);
		1593	ev_timer_start (loop, timer);
		1594
		1595	This is relatively simple to implement, but means that each time there is
		1596	some activity, libev will first have to remove the timer from its internal
		1597	data structure and then add it again. Libev tries to be fast, but it's
		1598	still not a constant-time operation.
		1599
		1600	=item 2. Use a timer and re-start it with C<ev_timer_again> inactivity.
		1601
		1602	This is the easiest way, and involves using C<ev_timer_again> instead of
		1603	C<ev_timer_start>.
		1604
		1605	To implement this, configure an C<ev_timer> with a C<repeat> value
		1606	of C<60> and then call C<ev_timer_again> at start and each time you
		1607	successfully read or write some data. If you go into an idle state where
		1608	you do not expect data to travel on the socket, you can C<ev_timer_stop>
		1609	the timer, and C<ev_timer_again> will automatically restart it if need be.
		1610
		1611	That means you can ignore both the C<ev_timer_start> function and the
		1612	C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
		1613	member and C<ev_timer_again>.
		1614
		1615	At start:
		1616
		1617	ev_init (timer, callback);
		1618	timer->repeat = 60.;
		1619	ev_timer_again (loop, timer);
		1620
		1621	Each time there is some activity:
		1622
		1623	ev_timer_again (loop, timer);
		1624
		1625	It is even possible to change the time-out on the fly, regardless of
		1626	whether the watcher is active or not:
		1627
		1628	timer->repeat = 30.;
		1629	ev_timer_again (loop, timer);
		1630
		1631	This is slightly more efficient then stopping/starting the timer each time
		1632	you want to modify its timeout value, as libev does not have to completely
		1633	remove and re-insert the timer from/into its internal data structure.
		1634
		1635	It is, however, even simpler than the "obvious" way to do it.
		1636
		1637	=item 3. Let the timer time out, but then re-arm it as required.
		1638
		1639	This method is more tricky, but usually most efficient: Most timeouts are
		1640	relatively long compared to the intervals between other activity - in
		1641	our example, within 60 seconds, there are usually many I/O events with
		1642	associated activity resets.
		1643
		1644	In this case, it would be more efficient to leave the C<ev_timer> alone,
		1645	but remember the time of last activity, and check for a real timeout only
		1646	within the callback:
		1647
		1648	ev_tstamp last_activity; // time of last activity
		1649
		1650	static void
		1651	callback (EV_P_ ev_timer *w, int revents)
		1652	{
		1653	ev_tstamp now = ev_now (EV_A);
		1654	ev_tstamp timeout = last_activity + 60.;
		1655
		1656	// if last_activity + 60. is older than now, we did time out
		1657	if (timeout < now)
		1658	{
		1659	// timeout occured, take action
		1660	}
		1661	else
		1662	{
		1663	// callback was invoked, but there was some activity, re-arm
		1664	// the watcher to fire in last_activity + 60, which is
		1665	// guaranteed to be in the future, so "again" is positive:
		1666	w->repeat = timeout - now;
		1667	ev_timer_again (EV_A_ w);
		1668	}
		1669	}
		1670
		1671	To summarise the callback: first calculate the real timeout (defined
		1672	as "60 seconds after the last activity"), then check if that time has
		1673	been reached, which means something I<did>, in fact, time out. Otherwise
		1674	the callback was invoked too early (C<timeout> is in the future), so
		1675	re-schedule the timer to fire at that future time, to see if maybe we have
		1676	a timeout then.
		1677
		1678	Note how C<ev_timer_again> is used, taking advantage of the
		1679	C<ev_timer_again> optimisation when the timer is already running.
		1680
		1681	This scheme causes more callback invocations (about one every 60 seconds
		1682	minus half the average time between activity), but virtually no calls to
		1683	libev to change the timeout.
		1684
		1685	To start the timer, simply initialise the watcher and set C<last_activity>
		1686	to the current time (meaning we just have some activity :), then call the
		1687	callback, which will "do the right thing" and start the timer:
		1688
		1689	ev_init (timer, callback);
		1690	last_activity = ev_now (loop);
		1691	callback (loop, timer, EV_TIMEOUT);
		1692
		1693	And when there is some activity, simply store the current time in
		1694	C<last_activity>, no libev calls at all:
		1695
		1696	last_actiivty = ev_now (loop);
		1697
		1698	This technique is slightly more complex, but in most cases where the
		1699	time-out is unlikely to be triggered, much more efficient.
		1700
		1701	Changing the timeout is trivial as well (if it isn't hard-coded in the
		1702	callback :) - just change the timeout and invoke the callback, which will
		1703	fix things for you.
		1704
		1705	=item 4. Wee, just use a double-linked list for your timeouts.
		1706
		1707	If there is not one request, but many thousands (millions...), all
		1708	employing some kind of timeout with the same timeout value, then one can
		1709	do even better:
		1710
		1711	When starting the timeout, calculate the timeout value and put the timeout
		1712	at the I<end> of the list.
		1713
		1714	Then use an C<ev_timer> to fire when the timeout at the I<beginning> of
		1715	the list is expected to fire (for example, using the technique #3).
		1716
		1717	When there is some activity, remove the timer from the list, recalculate
		1718	the timeout, append it to the end of the list again, and make sure to
		1719	update the C<ev_timer> if it was taken from the beginning of the list.
		1720
		1721	This way, one can manage an unlimited number of timeouts in O(1) time for
		1722	starting, stopping and updating the timers, at the expense of a major
		1723	complication, and having to use a constant timeout. The constant timeout
		1724	ensures that the list stays sorted.
		1725
		1726	=back
		1727
		1728	So which method the best?
		1729
		1730	Method #2 is a simple no-brain-required solution that is adequate in most
		1731	situations. Method #3 requires a bit more thinking, but handles many cases
		1732	better, and isn't very complicated either. In most case, choosing either
		1733	one is fine, with #3 being better in typical situations.
		1734
		1735	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
		1736	rather complicated, but extremely efficient, something that really pays
		1737	off after the first million or so of active timers, i.e. it's usually
		1738	overkill :)
1217		1739
1218	=head3 The special problem of time updates	1740	=head3 The special problem of time updates
1219		1741
1220	Establishing the current time is a costly operation (it usually takes at	1742	Establishing the current time is a costly operation (it usually takes at
1221	least two system calls): EV therefore updates its idea of the current	1743	least two system calls): EV therefore updates its idea of the current
1222	time only before and after C<ev_loop> polls for new events, which causes	1744	time only before and after C<ev_loop> collects new events, which causes a
1223	a growing difference between C<ev_now ()> and C<ev_time ()> when handling	1745	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1224	lots of events.	1746	lots of events in one iteration.
1225		1747
1226	The relative timeouts are calculated relative to the C<ev_now ()>	1748	The relative timeouts are calculated relative to the C<ev_now ()>
1227	time. This is usually the right thing as this timestamp refers to the time	1749	time. This is usually the right thing as this timestamp refers to the time
1228	of the event triggering whatever timeout you are modifying/starting. If	1750	of the event triggering whatever timeout you are modifying/starting. If
1229	you suspect event processing to be delayed and you I<need> to base the	1751	you suspect event processing to be delayed and you I<need> to base the
1230	timeout on the current time, use something like this to adjust for this:	1752	timeout on the current time, use something like this to adjust for this:
1231		1753
1232	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	1754	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1233		1755
1234	If the event loop is suspended for a long time, one can also force an	1756	If the event loop is suspended for a long time, you can also force an
1235	update of the time returned by C<ev_now ()> by calling C<ev_now_update	1757	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1236	()>.	1758	()>.
1237		1759
1238	=head3 Watcher-Specific Functions and Data Members	1760	=head3 Watcher-Specific Functions and Data Members
1239		1761
…		…
1265	If the timer is started but non-repeating, stop it (as if it timed out).	1787	If the timer is started but non-repeating, stop it (as if it timed out).
1266		1788
1267	If the timer is repeating, either start it if necessary (with the	1789	If the timer is repeating, either start it if necessary (with the
1268	C<repeat> value), or reset the running timer to the C<repeat> value.	1790	C<repeat> value), or reset the running timer to the C<repeat> value.
1269		1791
1270	This sounds a bit complicated, but here is a useful and typical	1792	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1271	example: Imagine you have a TCP connection and you want a so-called idle	1793	usage example.
1272	timeout, that is, you want to be called when there have been, say, 60
1273	seconds of inactivity on the socket. The easiest way to do this is to
1274	configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1275	C<ev_timer_again> each time you successfully read or write some data. If
1276	you go into an idle state where you do not expect data to travel on the
1277	socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1278	automatically restart it if need be.
1279
1280	That means you can ignore the C<after> value and C<ev_timer_start>
1281	altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1282
1283	ev_timer_init (timer, callback, 0., 5.);
1284	ev_timer_again (loop, timer);
1285	...
1286	timer->again = 17.;
1287	ev_timer_again (loop, timer);
1288	...
1289	timer->again = 10.;
1290	ev_timer_again (loop, timer);
1291
1292	This is more slightly efficient then stopping/starting the timer each time
1293	you want to modify its timeout value.
1294		1794
1295	=item ev_tstamp repeat [read-write]	1795	=item ev_tstamp repeat [read-write]
1296		1796
1297	The current C<repeat> value. Will be used each time the watcher times out	1797	The current C<repeat> value. Will be used each time the watcher times out
1298	or C<ev_timer_again> is called and determines the next timeout (if any),	1798	or C<ev_timer_again> is called, and determines the next timeout (if any),
1299	which is also when any modifications are taken into account.	1799	which is also when any modifications are taken into account.
1300		1800
1301	=back	1801	=back
1302		1802
1303	=head3 Examples	1803	=head3 Examples
1304		1804
1305	Example: Create a timer that fires after 60 seconds.	1805	Example: Create a timer that fires after 60 seconds.
1306		1806
1307	static void	1807	static void
1308	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1808	one_minute_cb (struct ev_loop *loop, ev_timer *w, int revents)
1309	{	1809	{
1310	.. one minute over, w is actually stopped right here	1810	.. one minute over, w is actually stopped right here
1311	}	1811	}
1312		1812
1313	struct ev_timer mytimer;	1813	ev_timer mytimer;
1314	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);	1814	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1315	ev_timer_start (loop, &mytimer);	1815	ev_timer_start (loop, &mytimer);
1316		1816
1317	Example: Create a timeout timer that times out after 10 seconds of	1817	Example: Create a timeout timer that times out after 10 seconds of
1318	inactivity.	1818	inactivity.
1319		1819
1320	static void	1820	static void
1321	timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1821	timeout_cb (struct ev_loop *loop, ev_timer *w, int revents)
1322	{	1822	{
1323	.. ten seconds without any activity	1823	.. ten seconds without any activity
1324	}	1824	}
1325		1825
1326	struct ev_timer mytimer;	1826	ev_timer mytimer;
1327	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	1827	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1328	ev_timer_again (&mytimer); /* start timer */	1828	ev_timer_again (&mytimer); /* start timer */
1329	ev_loop (loop, 0);	1829	ev_loop (loop, 0);
1330		1830
1331	// and in some piece of code that gets executed on any "activity":	1831	// and in some piece of code that gets executed on any "activity":
…		…
1336	=head2 C<ev_periodic> - to cron or not to cron?	1836	=head2 C<ev_periodic> - to cron or not to cron?
1337		1837
1338	Periodic watchers are also timers of a kind, but they are very versatile	1838	Periodic watchers are also timers of a kind, but they are very versatile
1339	(and unfortunately a bit complex).	1839	(and unfortunately a bit complex).
1340		1840
1341	Unlike C<ev_timer>'s, they are not based on real time (or relative time)	1841	Unlike C<ev_timer>, periodic watchers are not based on real time (or
1342	but on wall clock time (absolute time). You can tell a periodic watcher	1842	relative time, the physical time that passes) but on wall clock time
1343	to trigger after some specific point in time. For example, if you tell a	1843	(absolute time, the thing you can read on your calender or clock). The
1344	periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()	1844	difference is that wall clock time can run faster or slower than real
1345	+ 10.>, that is, an absolute time not a delay) and then reset your system	1845	time, and time jumps are not uncommon (e.g. when you adjust your
1346	clock to January of the previous year, then it will take more than year	1846	wrist-watch).
1347	to trigger the event (unlike an C<ev_timer>, which would still trigger
1348	roughly 10 seconds later as it uses a relative timeout).
1349		1847
		1848	You can tell a periodic watcher to trigger after some specific point
		1849	in time: for example, if you tell a periodic watcher to trigger "in 10
		1850	seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time
		1851	not a delay) and then reset your system clock to January of the previous
		1852	year, then it will take a year or more to trigger the event (unlike an
		1853	C<ev_timer>, which would still trigger roughly 10 seconds after starting
		1854	it, as it uses a relative timeout).
		1855
1350	C<ev_periodic>s can also be used to implement vastly more complex timers,	1856	C<ev_periodic> watchers can also be used to implement vastly more complex
1351	such as triggering an event on each "midnight, local time", or other	1857	timers, such as triggering an event on each "midnight, local time", or
1352	complicated, rules.	1858	other complicated rules. This cannot be done with C<ev_timer> watchers, as
		1859	those cannot react to time jumps.
1353		1860
1354	As with timers, the callback is guaranteed to be invoked only when the	1861	As with timers, the callback is guaranteed to be invoked only when the
1355	time (C<at>) has passed, but if multiple periodic timers become ready	1862	point in time where it is supposed to trigger has passed. If multiple
1356	during the same loop iteration then order of execution is undefined.	1863	timers become ready during the same loop iteration then the ones with
		1864	earlier time-out values are invoked before ones with later time-out values
		1865	(but this is no longer true when a callback calls C<ev_loop> recursively).
1357		1866
1358	=head3 Watcher-Specific Functions and Data Members	1867	=head3 Watcher-Specific Functions and Data Members
1359		1868
1360	=over 4	1869	=over 4
1361		1870
1362	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1871	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1363		1872
1364	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	1873	=item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb)
1365		1874
1366	Lots of arguments, lets sort it out... There are basically three modes of	1875	Lots of arguments, let's sort it out... There are basically three modes of
1367	operation, and we will explain them from simplest to complex:	1876	operation, and we will explain them from simplest to most complex:
1368		1877
1369	=over 4	1878	=over 4
1370		1879
1371	=item * absolute timer (at = time, interval = reschedule_cb = 0)	1880	=item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0)
1372		1881
1373	In this configuration the watcher triggers an event after the wall clock	1882	In this configuration the watcher triggers an event after the wall clock
1374	time C<at> has passed and doesn't repeat. It will not adjust when a time	1883	time C<offset> has passed. It will not repeat and will not adjust when a
1375	jump occurs, that is, if it is to be run at January 1st 2011 then it will	1884	time jump occurs, that is, if it is to be run at January 1st 2011 then it
1376	run when the system time reaches or surpasses this time.	1885	will be stopped and invoked when the system clock reaches or surpasses
		1886	this point in time.
1377		1887
1378	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)	1888	=item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0)
1379		1889
1380	In this mode the watcher will always be scheduled to time out at the next	1890	In this mode the watcher will always be scheduled to time out at the next
1381	C<at + N * interval> time (for some integer N, which can also be negative)	1891	C<offset + N * interval> time (for some integer N, which can also be
1382	and then repeat, regardless of any time jumps.	1892	negative) and then repeat, regardless of any time jumps. The C<offset>
		1893	argument is merely an offset into the C<interval> periods.
1383		1894
1384	This can be used to create timers that do not drift with respect to system	1895	This can be used to create timers that do not drift with respect to the
1385	time, for example, here is a C<ev_periodic> that triggers each hour, on	1896	system clock, for example, here is an C<ev_periodic> that triggers each
1386	the hour:	1897	hour, on the hour (with respect to UTC):
1387		1898
1388	ev_periodic_set (&periodic, 0., 3600., 0);	1899	ev_periodic_set (&periodic, 0., 3600., 0);
1389		1900
1390	This doesn't mean there will always be 3600 seconds in between triggers,	1901	This doesn't mean there will always be 3600 seconds in between triggers,
1391	but only that the callback will be called when the system time shows a	1902	but only that the callback will be called when the system time shows a
1392	full hour (UTC), or more correctly, when the system time is evenly divisible	1903	full hour (UTC), or more correctly, when the system time is evenly divisible
1393	by 3600.	1904	by 3600.
1394		1905
1395	Another way to think about it (for the mathematically inclined) is that	1906	Another way to think about it (for the mathematically inclined) is that
1396	C<ev_periodic> will try to run the callback in this mode at the next possible	1907	C<ev_periodic> will try to run the callback in this mode at the next possible
1397	time where C<time = at (mod interval)>, regardless of any time jumps.	1908	time where C<time = offset (mod interval)>, regardless of any time jumps.
1398		1909
1399	For numerical stability it is preferable that the C<at> value is near	1910	For numerical stability it is preferable that the C<offset> value is near
1400	C<ev_now ()> (the current time), but there is no range requirement for	1911	C<ev_now ()> (the current time), but there is no range requirement for
1401	this value, and in fact is often specified as zero.	1912	this value, and in fact is often specified as zero.
1402		1913
1403	Note also that there is an upper limit to how often a timer can fire (CPU	1914	Note also that there is an upper limit to how often a timer can fire (CPU
1404	speed for example), so if C<interval> is very small then timing stability	1915	speed for example), so if C<interval> is very small then timing stability
1405	will of course deteriorate. Libev itself tries to be exact to be about one	1916	will of course deteriorate. Libev itself tries to be exact to be about one
1406	millisecond (if the OS supports it and the machine is fast enough).	1917	millisecond (if the OS supports it and the machine is fast enough).
1407		1918
1408	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)	1919	=item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback)
1409		1920
1410	In this mode the values for C<interval> and C<at> are both being	1921	In this mode the values for C<interval> and C<offset> are both being
1411	ignored. Instead, each time the periodic watcher gets scheduled, the	1922	ignored. Instead, each time the periodic watcher gets scheduled, the
1412	reschedule callback will be called with the watcher as first, and the	1923	reschedule callback will be called with the watcher as first, and the
1413	current time as second argument.	1924	current time as second argument.
1414		1925
1415	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	1926	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever,
1416	ever, or make ANY event loop modifications whatsoever>.	1927	or make ANY other event loop modifications whatsoever, unless explicitly
		1928	allowed by documentation here>.
1417		1929
1418	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop	1930	If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1419	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the	1931	it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1420	only event loop modification you are allowed to do).	1932	only event loop modification you are allowed to do).
1421		1933
1422	The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic	1934	The callback prototype is C<ev_tstamp (*reschedule_cb)(ev_periodic
1423	*w, ev_tstamp now)>, e.g.:	1935	*w, ev_tstamp now)>, e.g.:
1424		1936
		1937	static ev_tstamp
1425	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)	1938	my_rescheduler (ev_periodic *w, ev_tstamp now)
1426	{	1939	{
1427	return now + 60.;	1940	return now + 60.;
1428	}	1941	}
1429		1942
1430	It must return the next time to trigger, based on the passed time value	1943	It must return the next time to trigger, based on the passed time value
…		…
1450	a different time than the last time it was called (e.g. in a crond like	1963	a different time than the last time it was called (e.g. in a crond like
1451	program when the crontabs have changed).	1964	program when the crontabs have changed).
1452		1965
1453	=item ev_tstamp ev_periodic_at (ev_periodic *)	1966	=item ev_tstamp ev_periodic_at (ev_periodic *)
1454		1967
1455	When active, returns the absolute time that the watcher is supposed to	1968	When active, returns the absolute time that the watcher is supposed
1456	trigger next.	1969	to trigger next. This is not the same as the C<offset> argument to
		1970	C<ev_periodic_set>, but indeed works even in interval and manual
		1971	rescheduling modes.
1457		1972
1458	=item ev_tstamp offset [read-write]	1973	=item ev_tstamp offset [read-write]
1459		1974
1460	When repeating, this contains the offset value, otherwise this is the	1975	When repeating, this contains the offset value, otherwise this is the
1461	absolute point in time (the C<at> value passed to C<ev_periodic_set>).	1976	absolute point in time (the C<offset> value passed to C<ev_periodic_set>,
		1977	although libev might modify this value for better numerical stability).
1462		1978
1463	Can be modified any time, but changes only take effect when the periodic	1979	Can be modified any time, but changes only take effect when the periodic
1464	timer fires or C<ev_periodic_again> is being called.	1980	timer fires or C<ev_periodic_again> is being called.
1465		1981
1466	=item ev_tstamp interval [read-write]	1982	=item ev_tstamp interval [read-write]
1467		1983
1468	The current interval value. Can be modified any time, but changes only	1984	The current interval value. Can be modified any time, but changes only
1469	take effect when the periodic timer fires or C<ev_periodic_again> is being	1985	take effect when the periodic timer fires or C<ev_periodic_again> is being
1470	called.	1986	called.
1471		1987
1472	=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]	1988	=item ev_tstamp (*reschedule_cb)(ev_periodic *w, ev_tstamp now) [read-write]
1473		1989
1474	The current reschedule callback, or C<0>, if this functionality is	1990	The current reschedule callback, or C<0>, if this functionality is
1475	switched off. Can be changed any time, but changes only take effect when	1991	switched off. Can be changed any time, but changes only take effect when
1476	the periodic timer fires or C<ev_periodic_again> is being called.	1992	the periodic timer fires or C<ev_periodic_again> is being called.
1477		1993
1478	=back	1994	=back
1479		1995
1480	=head3 Examples	1996	=head3 Examples
1481		1997
1482	Example: Call a callback every hour, or, more precisely, whenever the	1998	Example: Call a callback every hour, or, more precisely, whenever the
1483	system clock is divisible by 3600. The callback invocation times have	1999	system time is divisible by 3600. The callback invocation times have
1484	potentially a lot of jitter, but good long-term stability.	2000	potentially a lot of jitter, but good long-term stability.
1485		2001
1486	static void	2002	static void
1487	clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)	2003	clock_cb (struct ev_loop *loop, ev_io *w, int revents)
1488	{	2004	{
1489	... its now a full hour (UTC, or TAI or whatever your clock follows)	2005	... its now a full hour (UTC, or TAI or whatever your clock follows)
1490	}	2006	}
1491		2007
1492	struct ev_periodic hourly_tick;	2008	ev_periodic hourly_tick;
1493	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);	2009	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1494	ev_periodic_start (loop, &hourly_tick);	2010	ev_periodic_start (loop, &hourly_tick);
1495		2011
1496	Example: The same as above, but use a reschedule callback to do it:	2012	Example: The same as above, but use a reschedule callback to do it:
1497		2013
1498	#include <math.h>	2014	#include <math.h>
1499		2015
1500	static ev_tstamp	2016	static ev_tstamp
1501	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)	2017	my_scheduler_cb (ev_periodic *w, ev_tstamp now)
1502	{	2018	{
1503	return fmod (now, 3600.) + 3600.;	2019	return now + (3600. - fmod (now, 3600.));
1504	}	2020	}
1505		2021
1506	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);	2022	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1507		2023
1508	Example: Call a callback every hour, starting now:	2024	Example: Call a callback every hour, starting now:
1509		2025
1510	struct ev_periodic hourly_tick;	2026	ev_periodic hourly_tick;
1511	ev_periodic_init (&hourly_tick, clock_cb,	2027	ev_periodic_init (&hourly_tick, clock_cb,
1512	fmod (ev_now (loop), 3600.), 3600., 0);	2028	fmod (ev_now (loop), 3600.), 3600., 0);
1513	ev_periodic_start (loop, &hourly_tick);	2029	ev_periodic_start (loop, &hourly_tick);
1514		2030
1515		2031
…		…
1518	Signal watchers will trigger an event when the process receives a specific	2034	Signal watchers will trigger an event when the process receives a specific
1519	signal one or more times. Even though signals are very asynchronous, libev	2035	signal one or more times. Even though signals are very asynchronous, libev
1520	will try it's best to deliver signals synchronously, i.e. as part of the	2036	will try it's best to deliver signals synchronously, i.e. as part of the
1521	normal event processing, like any other event.	2037	normal event processing, like any other event.
1522		2038
		2039	If you want signals asynchronously, just use C<sigaction> as you would
		2040	do without libev and forget about sharing the signal. You can even use
		2041	C<ev_async> from a signal handler to synchronously wake up an event loop.
		2042
1523	You can configure as many watchers as you like per signal. Only when the	2043	You can configure as many watchers as you like per signal. Only when the
1524	first watcher gets started will libev actually register a signal watcher	2044	first watcher gets started will libev actually register a signal handler
1525	with the kernel (thus it coexists with your own signal handlers as long	2045	with the kernel (thus it coexists with your own signal handlers as long as
1526	as you don't register any with libev). Similarly, when the last signal	2046	you don't register any with libev for the same signal). Similarly, when
1527	watcher for a signal is stopped libev will reset the signal handler to	2047	the last signal watcher for a signal is stopped, libev will reset the
1528	SIG_DFL (regardless of what it was set to before).	2048	signal handler to SIG_DFL (regardless of what it was set to before).
1529		2049
1530	If possible and supported, libev will install its handlers with	2050	If possible and supported, libev will install its handlers with
1531	C<SA_RESTART> behaviour enabled, so system calls should not be unduly	2051	C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1532	interrupted. If you have a problem with system calls getting interrupted by	2052	interrupted. If you have a problem with system calls getting interrupted by
1533	signals you can block all signals in an C<ev_check> watcher and unblock	2053	signals you can block all signals in an C<ev_check> watcher and unblock
…		…
1550		2070
1551	=back	2071	=back
1552		2072
1553	=head3 Examples	2073	=head3 Examples
1554		2074
1555	Example: Try to exit cleanly on SIGINT and SIGTERM.	2075	Example: Try to exit cleanly on SIGINT.
1556		2076
1557	static void	2077	static void
1558	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)	2078	sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1559	{	2079	{
1560	ev_unloop (loop, EVUNLOOP_ALL);	2080	ev_unloop (loop, EVUNLOOP_ALL);
1561	}	2081	}
1562		2082
1563	struct ev_signal signal_watcher;	2083	ev_signal signal_watcher;
1564	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	2084	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1565	ev_signal_start (loop, &sigint_cb);	2085	ev_signal_start (loop, &signal_watcher);
1566		2086
1567		2087
1568	=head2 C<ev_child> - watch out for process status changes	2088	=head2 C<ev_child> - watch out for process status changes
1569		2089
1570	Child watchers trigger when your process receives a SIGCHLD in response to	2090	Child watchers trigger when your process receives a SIGCHLD in response to
1571	some child status changes (most typically when a child of yours dies). It	2091	some child status changes (most typically when a child of yours dies or
1572	is permissible to install a child watcher I<after> the child has been	2092	exits). It is permissible to install a child watcher I<after> the child
1573	forked (which implies it might have already exited), as long as the event	2093	has been forked (which implies it might have already exited), as long
1574	loop isn't entered (or is continued from a watcher).	2094	as the event loop isn't entered (or is continued from a watcher), i.e.,
		2095	forking and then immediately registering a watcher for the child is fine,
		2096	but forking and registering a watcher a few event loop iterations later or
		2097	in the next callback invocation is not.
1575		2098
1576	Only the default event loop is capable of handling signals, and therefore	2099	Only the default event loop is capable of handling signals, and therefore
1577	you can only register child watchers in the default event loop.	2100	you can only register child watchers in the default event loop.
		2101
		2102	Due to some design glitches inside libev, child watchers will always be
		2103	handled at maximum priority (their priority is set to C<EV_MAXPRI> by
		2104	libev)
1578		2105
1579	=head3 Process Interaction	2106	=head3 Process Interaction
1580		2107
1581	Libev grabs C<SIGCHLD> as soon as the default event loop is	2108	Libev grabs C<SIGCHLD> as soon as the default event loop is
1582	initialised. This is necessary to guarantee proper behaviour even if	2109	initialised. This is necessary to guarantee proper behaviour even if
…		…
1640	its completion.	2167	its completion.
1641		2168
1642	ev_child cw;	2169	ev_child cw;
1643		2170
1644	static void	2171	static void
1645	child_cb (EV_P_ struct ev_child *w, int revents)	2172	child_cb (EV_P_ ev_child *w, int revents)
1646	{	2173	{
1647	ev_child_stop (EV_A_ w);	2174	ev_child_stop (EV_A_ w);
1648	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);	2175	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1649	}	2176	}
1650		2177
…		…
1665		2192
1666		2193
1667	=head2 C<ev_stat> - did the file attributes just change?	2194	=head2 C<ev_stat> - did the file attributes just change?
1668		2195
1669	This watches a file system path for attribute changes. That is, it calls	2196	This watches a file system path for attribute changes. That is, it calls
1670	C<stat> regularly (or when the OS says it changed) and sees if it changed	2197	C<stat> on that path in regular intervals (or when the OS says it changed)
1671	compared to the last time, invoking the callback if it did.	2198	and sees if it changed compared to the last time, invoking the callback if
		2199	it did.
1672		2200
1673	The path does not need to exist: changing from "path exists" to "path does	2201	The path does not need to exist: changing from "path exists" to "path does
1674	not exist" is a status change like any other. The condition "path does	2202	not exist" is a status change like any other. The condition "path does not
1675	not exist" is signified by the C<st_nlink> field being zero (which is	2203	exist" (or more correctly "path cannot be stat'ed") is signified by the
1676	otherwise always forced to be at least one) and all the other fields of	2204	C<st_nlink> field being zero (which is otherwise always forced to be at
1677	the stat buffer having unspecified contents.	2205	least one) and all the other fields of the stat buffer having unspecified
		2206	contents.
1678		2207
1679	The path I<should> be absolute and I<must not> end in a slash. If it is	2208	The path I<must not> end in a slash or contain special components such as
		2209	C<.> or C<..>. The path I<should> be absolute: If it is relative and
1680	relative and your working directory changes, the behaviour is undefined.	2210	your working directory changes, then the behaviour is undefined.
1681		2211
1682	Since there is no standard to do this, the portable implementation simply	2212	Since there is no portable change notification interface available, the
1683	calls C<stat (2)> regularly on the path to see if it changed somehow. You	2213	portable implementation simply calls C<stat(2)> regularly on the path
1684	can specify a recommended polling interval for this case. If you specify	2214	to see if it changed somehow. You can specify a recommended polling
1685	a polling interval of C<0> (highly recommended!) then a I<suitable,	2215	interval for this case. If you specify a polling interval of C<0> (highly
1686	unspecified default> value will be used (which you can expect to be around	2216	recommended!) then a I<suitable, unspecified default> value will be used
1687	five seconds, although this might change dynamically). Libev will also	2217	(which you can expect to be around five seconds, although this might
1688	impose a minimum interval which is currently around C<0.1>, but thats	2218	change dynamically). Libev will also impose a minimum interval which is
1689	usually overkill.	2219	currently around C<0.1>, but that's usually overkill.
1690		2220
1691	This watcher type is not meant for massive numbers of stat watchers,	2221	This watcher type is not meant for massive numbers of stat watchers,
1692	as even with OS-supported change notifications, this can be	2222	as even with OS-supported change notifications, this can be
1693	resource-intensive.	2223	resource-intensive.
1694		2224
1695	At the time of this writing, only the Linux inotify interface is	2225	At the time of this writing, the only OS-specific interface implemented
1696	implemented (implementing kqueue support is left as an exercise for the	2226	is the Linux inotify interface (implementing kqueue support is left as an
1697	reader, note, however, that the author sees no way of implementing ev_stat	2227	exercise for the reader. Note, however, that the author sees no way of
1698	semantics with kqueue). Inotify will be used to give hints only and should	2228	implementing C<ev_stat> semantics with kqueue, except as a hint).
1699	not change the semantics of C<ev_stat> watchers, which means that libev
1700	sometimes needs to fall back to regular polling again even with inotify,
1701	but changes are usually detected immediately, and if the file exists there
1702	will be no polling.
1703		2229
1704	=head3 ABI Issues (Largefile Support)	2230	=head3 ABI Issues (Largefile Support)
1705		2231
1706	Libev by default (unless the user overrides this) uses the default	2232	Libev by default (unless the user overrides this) uses the default
1707	compilation environment, which means that on systems with large file	2233	compilation environment, which means that on systems with large file
1708	support disabled by default, you get the 32 bit version of the stat	2234	support disabled by default, you get the 32 bit version of the stat
1709	structure. When using the library from programs that change the ABI to	2235	structure. When using the library from programs that change the ABI to
1710	use 64 bit file offsets the programs will fail. In that case you have to	2236	use 64 bit file offsets the programs will fail. In that case you have to
1711	compile libev with the same flags to get binary compatibility. This is	2237	compile libev with the same flags to get binary compatibility. This is
1712	obviously the case with any flags that change the ABI, but the problem is	2238	obviously the case with any flags that change the ABI, but the problem is
1713	most noticeably disabled with ev_stat and large file support.	2239	most noticeably displayed with ev_stat and large file support.
1714		2240
1715	The solution for this is to lobby your distribution maker to make large	2241	The solution for this is to lobby your distribution maker to make large
1716	file interfaces available by default (as e.g. FreeBSD does) and not	2242	file interfaces available by default (as e.g. FreeBSD does) and not
1717	optional. Libev cannot simply switch on large file support because it has	2243	optional. Libev cannot simply switch on large file support because it has
1718	to exchange stat structures with application programs compiled using the	2244	to exchange stat structures with application programs compiled using the
1719	default compilation environment.	2245	default compilation environment.
1720		2246
1721	=head3 Inotify	2247	=head3 Inotify and Kqueue
1722		2248
1723	When C<inotify (7)> support has been compiled into libev (generally only	2249	When C<inotify (7)> support has been compiled into libev and present at
1724	available on Linux) and present at runtime, it will be used to speed up	2250	runtime, it will be used to speed up change detection where possible. The
1725	change detection where possible. The inotify descriptor will be created lazily	2251	inotify descriptor will be created lazily when the first C<ev_stat>
1726	when the first C<ev_stat> watcher is being started.	2252	watcher is being started.
1727		2253
1728	Inotify presence does not change the semantics of C<ev_stat> watchers	2254	Inotify presence does not change the semantics of C<ev_stat> watchers
1729	except that changes might be detected earlier, and in some cases, to avoid	2255	except that changes might be detected earlier, and in some cases, to avoid
1730	making regular C<stat> calls. Even in the presence of inotify support	2256	making regular C<stat> calls. Even in the presence of inotify support
1731	there are many cases where libev has to resort to regular C<stat> polling.	2257	there are many cases where libev has to resort to regular C<stat> polling,
		2258	but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
		2259	many bugs), the path exists (i.e. stat succeeds), and the path resides on
		2260	a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
		2261	xfs are fully working) libev usually gets away without polling.
1732		2262
1733	(There is no support for kqueue, as apparently it cannot be used to	2263	There is no support for kqueue, as apparently it cannot be used to
1734	implement this functionality, due to the requirement of having a file	2264	implement this functionality, due to the requirement of having a file
1735	descriptor open on the object at all times).	2265	descriptor open on the object at all times, and detecting renames, unlinks
		2266	etc. is difficult.
		2267
		2268	=head3 C<stat ()> is a synchronous operation
		2269
		2270	Libev doesn't normally do any kind of I/O itself, and so is not blocking
		2271	the process. The exception are C<ev_stat> watchers - those call C<stat
		2272	()>, which is a synchronous operation.
		2273
		2274	For local paths, this usually doesn't matter: unless the system is very
		2275	busy or the intervals between stat's are large, a stat call will be fast,
		2276	as the path data is usually in memory already (except when starting the
		2277	watcher).
		2278
		2279	For networked file systems, calling C<stat ()> can block an indefinite
		2280	time due to network issues, and even under good conditions, a stat call
		2281	often takes multiple milliseconds.
		2282
		2283	Therefore, it is best to avoid using C<ev_stat> watchers on networked
		2284	paths, although this is fully supported by libev.
1736		2285
1737	=head3 The special problem of stat time resolution	2286	=head3 The special problem of stat time resolution
1738		2287
1739	The C<stat ()> system call only supports full-second resolution portably, and	2288	The C<stat ()> system call only supports full-second resolution portably,
1740	even on systems where the resolution is higher, many file systems still	2289	and even on systems where the resolution is higher, most file systems
1741	only support whole seconds.	2290	still only support whole seconds.
1742		2291
1743	That means that, if the time is the only thing that changes, you can	2292	That means that, if the time is the only thing that changes, you can
1744	easily miss updates: on the first update, C<ev_stat> detects a change and	2293	easily miss updates: on the first update, C<ev_stat> detects a change and
1745	calls your callback, which does something. When there is another update	2294	calls your callback, which does something. When there is another update
1746	within the same second, C<ev_stat> will be unable to detect it as the stat	2295	within the same second, C<ev_stat> will be unable to detect unless the
1747	data does not change.	2296	stat data does change in other ways (e.g. file size).
1748		2297
1749	The solution to this is to delay acting on a change for slightly more	2298	The solution to this is to delay acting on a change for slightly more
1750	than a second (or till slightly after the next full second boundary), using	2299	than a second (or till slightly after the next full second boundary), using
1751	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);	2300	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1752	ev_timer_again (loop, w)>).	2301	ev_timer_again (loop, w)>).
…		…
1772	C<path>. The C<interval> is a hint on how quickly a change is expected to	2321	C<path>. The C<interval> is a hint on how quickly a change is expected to
1773	be detected and should normally be specified as C<0> to let libev choose	2322	be detected and should normally be specified as C<0> to let libev choose
1774	a suitable value. The memory pointed to by C<path> must point to the same	2323	a suitable value. The memory pointed to by C<path> must point to the same
1775	path for as long as the watcher is active.	2324	path for as long as the watcher is active.
1776		2325
1777	The callback will receive C<EV_STAT> when a change was detected, relative	2326	The callback will receive an C<EV_STAT> event when a change was detected,
1778	to the attributes at the time the watcher was started (or the last change	2327	relative to the attributes at the time the watcher was started (or the
1779	was detected).	2328	last change was detected).
1780		2329
1781	=item ev_stat_stat (loop, ev_stat *)	2330	=item ev_stat_stat (loop, ev_stat *)
1782		2331
1783	Updates the stat buffer immediately with new values. If you change the	2332	Updates the stat buffer immediately with new values. If you change the
1784	watched path in your callback, you could call this function to avoid	2333	watched path in your callback, you could call this function to avoid
…		…
1867		2416
1868		2417
1869	=head2 C<ev_idle> - when you've got nothing better to do...	2418	=head2 C<ev_idle> - when you've got nothing better to do...
1870		2419
1871	Idle watchers trigger events when no other events of the same or higher	2420	Idle watchers trigger events when no other events of the same or higher
1872	priority are pending (prepare, check and other idle watchers do not	2421	priority are pending (prepare, check and other idle watchers do not count
1873	count).	2422	as receiving "events").
1874		2423
1875	That is, as long as your process is busy handling sockets or timeouts	2424	That is, as long as your process is busy handling sockets or timeouts
1876	(or even signals, imagine) of the same or higher priority it will not be	2425	(or even signals, imagine) of the same or higher priority it will not be
1877	triggered. But when your process is idle (or only lower-priority watchers	2426	triggered. But when your process is idle (or only lower-priority watchers
1878	are pending), the idle watchers are being called once per event loop	2427	are pending), the idle watchers are being called once per event loop
…		…
1889		2438
1890	=head3 Watcher-Specific Functions and Data Members	2439	=head3 Watcher-Specific Functions and Data Members
1891		2440
1892	=over 4	2441	=over 4
1893		2442
1894	=item ev_idle_init (ev_signal *, callback)	2443	=item ev_idle_init (ev_idle *, callback)
1895		2444
1896	Initialises and configures the idle watcher - it has no parameters of any	2445	Initialises and configures the idle watcher - it has no parameters of any
1897	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,	2446	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1898	believe me.	2447	believe me.
1899		2448
…		…
1903		2452
1904	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the	2453	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1905	callback, free it. Also, use no error checking, as usual.	2454	callback, free it. Also, use no error checking, as usual.
1906		2455
1907	static void	2456	static void
1908	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)	2457	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
1909	{	2458	{
1910	free (w);	2459	free (w);
1911	// now do something you wanted to do when the program has	2460	// now do something you wanted to do when the program has
1912	// no longer anything immediate to do.	2461	// no longer anything immediate to do.
1913	}	2462	}
1914		2463
1915	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));	2464	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
1916	ev_idle_init (idle_watcher, idle_cb);	2465	ev_idle_init (idle_watcher, idle_cb);
1917	ev_idle_start (loop, idle_cb);	2466	ev_idle_start (loop, idle_watcher);
1918		2467
1919		2468
1920	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2469	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1921		2470
1922	Prepare and check watchers are usually (but not always) used in tandem:	2471	Prepare and check watchers are usually (but not always) used in pairs:
1923	prepare watchers get invoked before the process blocks and check watchers	2472	prepare watchers get invoked before the process blocks and check watchers
1924	afterwards.	2473	afterwards.
1925		2474
1926	You I<must not> call C<ev_loop> or similar functions that enter	2475	You I<must not> call C<ev_loop> or similar functions that enter
1927	the current event loop from either C<ev_prepare> or C<ev_check>	2476	the current event loop from either C<ev_prepare> or C<ev_check>
…		…
1930	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2479	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1931	C<ev_check> so if you have one watcher of each kind they will always be	2480	C<ev_check> so if you have one watcher of each kind they will always be
1932	called in pairs bracketing the blocking call.	2481	called in pairs bracketing the blocking call.
1933		2482
1934	Their main purpose is to integrate other event mechanisms into libev and	2483	Their main purpose is to integrate other event mechanisms into libev and
1935	their use is somewhat advanced. This could be used, for example, to track	2484	their use is somewhat advanced. They could be used, for example, to track
1936	variable changes, implement your own watchers, integrate net-snmp or a	2485	variable changes, implement your own watchers, integrate net-snmp or a
1937	coroutine library and lots more. They are also occasionally useful if	2486	coroutine library and lots more. They are also occasionally useful if
1938	you cache some data and want to flush it before blocking (for example,	2487	you cache some data and want to flush it before blocking (for example,
1939	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>	2488	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1940	watcher).	2489	watcher).
1941		2490
1942	This is done by examining in each prepare call which file descriptors need	2491	This is done by examining in each prepare call which file descriptors
1943	to be watched by the other library, registering C<ev_io> watchers for	2492	need to be watched by the other library, registering C<ev_io> watchers
1944	them and starting an C<ev_timer> watcher for any timeouts (many libraries	2493	for them and starting an C<ev_timer> watcher for any timeouts (many
1945	provide just this functionality). Then, in the check watcher you check for	2494	libraries provide exactly this functionality). Then, in the check watcher,
1946	any events that occurred (by checking the pending status of all watchers	2495	you check for any events that occurred (by checking the pending status
1947	and stopping them) and call back into the library. The I/O and timer	2496	of all watchers and stopping them) and call back into the library. The
1948	callbacks will never actually be called (but must be valid nevertheless,	2497	I/O and timer callbacks will never actually be called (but must be valid
1949	because you never know, you know?).	2498	nevertheless, because you never know, you know?).
1950		2499
1951	As another example, the Perl Coro module uses these hooks to integrate	2500	As another example, the Perl Coro module uses these hooks to integrate
1952	coroutines into libev programs, by yielding to other active coroutines	2501	coroutines into libev programs, by yielding to other active coroutines
1953	during each prepare and only letting the process block if no coroutines	2502	during each prepare and only letting the process block if no coroutines
1954	are ready to run (it's actually more complicated: it only runs coroutines	2503	are ready to run (it's actually more complicated: it only runs coroutines
…		…
1957	loop from blocking if lower-priority coroutines are active, thus mapping	2506	loop from blocking if lower-priority coroutines are active, thus mapping
1958	low-priority coroutines to idle/background tasks).	2507	low-priority coroutines to idle/background tasks).
1959		2508
1960	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2509	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1961	priority, to ensure that they are being run before any other watchers	2510	priority, to ensure that they are being run before any other watchers
		2511	after the poll (this doesn't matter for C<ev_prepare> watchers).
		2512
1962	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,	2513	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
1963	too) should not activate ("feed") events into libev. While libev fully	2514	activate ("feed") events into libev. While libev fully supports this, they
1964	supports this, they might get executed before other C<ev_check> watchers	2515	might get executed before other C<ev_check> watchers did their job. As
1965	did their job. As C<ev_check> watchers are often used to embed other	2516	C<ev_check> watchers are often used to embed other (non-libev) event
1966	(non-libev) event loops those other event loops might be in an unusable	2517	loops those other event loops might be in an unusable state until their
1967	state until their C<ev_check> watcher ran (always remind yourself to	2518	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1968	coexist peacefully with others).	2519	others).
1969		2520
1970	=head3 Watcher-Specific Functions and Data Members	2521	=head3 Watcher-Specific Functions and Data Members
1971		2522
1972	=over 4	2523	=over 4
1973		2524
…		…
1975		2526
1976	=item ev_check_init (ev_check *, callback)	2527	=item ev_check_init (ev_check *, callback)
1977		2528
1978	Initialises and configures the prepare or check watcher - they have no	2529	Initialises and configures the prepare or check watcher - they have no
1979	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>	2530	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1980	macros, but using them is utterly, utterly and completely pointless.	2531	macros, but using them is utterly, utterly, utterly and completely
		2532	pointless.
1981		2533
1982	=back	2534	=back
1983		2535
1984	=head3 Examples	2536	=head3 Examples
1985		2537
…		…
1998		2550
1999	static ev_io iow [nfd];	2551	static ev_io iow [nfd];
2000	static ev_timer tw;	2552	static ev_timer tw;
2001		2553
2002	static void	2554	static void
2003	io_cb (ev_loop *loop, ev_io *w, int revents)	2555	io_cb (struct ev_loop *loop, ev_io *w, int revents)
2004	{	2556	{
2005	}	2557	}
2006		2558
2007	// create io watchers for each fd and a timer before blocking	2559	// create io watchers for each fd and a timer before blocking
2008	static void	2560	static void
2009	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)	2561	adns_prepare_cb (struct ev_loop *loop, ev_prepare *w, int revents)
2010	{	2562	{
2011	int timeout = 3600000;	2563	int timeout = 3600000;
2012	struct pollfd fds [nfd];	2564	struct pollfd fds [nfd];
2013	// actual code will need to loop here and realloc etc.	2565	// actual code will need to loop here and realloc etc.
2014	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2566	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2015		2567
2016	/* the callback is illegal, but won't be called as we stop during check */	2568	/* the callback is illegal, but won't be called as we stop during check */
2017	ev_timer_init (&tw, 0, timeout * 1e-3);	2569	ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2018	ev_timer_start (loop, &tw);	2570	ev_timer_start (loop, &tw);
2019		2571
2020	// create one ev_io per pollfd	2572	// create one ev_io per pollfd
2021	for (int i = 0; i < nfd; ++i)	2573	for (int i = 0; i < nfd; ++i)
2022	{	2574	{
…		…
2029	}	2581	}
2030	}	2582	}
2031		2583
2032	// stop all watchers after blocking	2584	// stop all watchers after blocking
2033	static void	2585	static void
2034	adns_check_cb (ev_loop *loop, ev_check *w, int revents)	2586	adns_check_cb (struct ev_loop *loop, ev_check *w, int revents)
2035	{	2587	{
2036	ev_timer_stop (loop, &tw);	2588	ev_timer_stop (loop, &tw);
2037		2589
2038	for (int i = 0; i < nfd; ++i)	2590	for (int i = 0; i < nfd; ++i)
2039	{	2591	{
…		…
2078	}	2630	}
2079		2631
2080	// do not ever call adns_afterpoll	2632	// do not ever call adns_afterpoll
2081		2633
2082	Method 4: Do not use a prepare or check watcher because the module you	2634	Method 4: Do not use a prepare or check watcher because the module you
2083	want to embed is too inflexible to support it. Instead, you can override	2635	want to embed is not flexible enough to support it. Instead, you can
2084	their poll function. The drawback with this solution is that the main	2636	override their poll function. The drawback with this solution is that the
2085	loop is now no longer controllable by EV. The C<Glib::EV> module does	2637	main loop is now no longer controllable by EV. The C<Glib::EV> module uses
2086	this.	2638	this approach, effectively embedding EV as a client into the horrible
		2639	libglib event loop.
2087		2640
2088	static gint	2641	static gint
2089	event_poll_func (GPollFD *fds, guint nfds, gint timeout)	2642	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
2090	{	2643	{
2091	int got_events = 0;	2644	int got_events = 0;
…		…
2122	prioritise I/O.	2675	prioritise I/O.
2123		2676
2124	As an example for a bug workaround, the kqueue backend might only support	2677	As an example for a bug workaround, the kqueue backend might only support
2125	sockets on some platform, so it is unusable as generic backend, but you	2678	sockets on some platform, so it is unusable as generic backend, but you
2126	still want to make use of it because you have many sockets and it scales	2679	still want to make use of it because you have many sockets and it scales
2127	so nicely. In this case, you would create a kqueue-based loop and embed it	2680	so nicely. In this case, you would create a kqueue-based loop and embed
2128	into your default loop (which might use e.g. poll). Overall operation will	2681	it into your default loop (which might use e.g. poll). Overall operation
2129	be a bit slower because first libev has to poll and then call kevent, but	2682	will be a bit slower because first libev has to call C<poll> and then
2130	at least you can use both at what they are best.	2683	C<kevent>, but at least you can use both mechanisms for what they are
		2684	best: C<kqueue> for scalable sockets and C<poll> if you want it to work :)
2131		2685
2132	As for prioritising I/O: rarely you have the case where some fds have	2686	As for prioritising I/O: under rare circumstances you have the case where
2133	to be watched and handled very quickly (with low latency), and even	2687	some fds have to be watched and handled very quickly (with low latency),
2134	priorities and idle watchers might have too much overhead. In this case	2688	and even priorities and idle watchers might have too much overhead. In
2135	you would put all the high priority stuff in one loop and all the rest in	2689	this case you would put all the high priority stuff in one loop and all
2136	a second one, and embed the second one in the first.	2690	the rest in a second one, and embed the second one in the first.
2137		2691
2138	As long as the watcher is active, the callback will be invoked every time	2692	As long as the watcher is active, the callback will be invoked every
2139	there might be events pending in the embedded loop. The callback must then	2693	time there might be events pending in the embedded loop. The callback
2140	call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke	2694	must then call C<ev_embed_sweep (mainloop, watcher)> to make a single
2141	their callbacks (you could also start an idle watcher to give the embedded	2695	sweep and invoke their callbacks (the callback doesn't need to invoke the
2142	loop strictly lower priority for example). You can also set the callback	2696	C<ev_embed_sweep> function directly, it could also start an idle watcher
2143	to C<0>, in which case the embed watcher will automatically execute the	2697	to give the embedded loop strictly lower priority for example).
2144	embedded loop sweep.
2145		2698
2146	As long as the watcher is started it will automatically handle events. The	2699	You can also set the callback to C<0>, in which case the embed watcher
2147	callback will be invoked whenever some events have been handled. You can	2700	will automatically execute the embedded loop sweep whenever necessary.
2148	set the callback to C<0> to avoid having to specify one if you are not
2149	interested in that.
2150		2701
2151	Also, there have not currently been made special provisions for forking:	2702	Fork detection will be handled transparently while the C<ev_embed> watcher
2152	when you fork, you not only have to call C<ev_loop_fork> on both loops,	2703	is active, i.e., the embedded loop will automatically be forked when the
2153	but you will also have to stop and restart any C<ev_embed> watchers	2704	embedding loop forks. In other cases, the user is responsible for calling
2154	yourself.	2705	C<ev_loop_fork> on the embedded loop.
2155		2706
2156	Unfortunately, not all backends are embeddable, only the ones returned by	2707	Unfortunately, not all backends are embeddable: only the ones returned by
2157	C<ev_embeddable_backends> are, which, unfortunately, does not include any	2708	C<ev_embeddable_backends> are, which, unfortunately, does not include any
2158	portable one.	2709	portable one.
2159		2710
2160	So when you want to use this feature you will always have to be prepared	2711	So when you want to use this feature you will always have to be prepared
2161	that you cannot get an embeddable loop. The recommended way to get around	2712	that you cannot get an embeddable loop. The recommended way to get around
2162	this is to have a separate variables for your embeddable loop, try to	2713	this is to have a separate variables for your embeddable loop, try to
2163	create it, and if that fails, use the normal loop for everything.	2714	create it, and if that fails, use the normal loop for everything.
		2715
		2716	=head3 C<ev_embed> and fork
		2717
		2718	While the C<ev_embed> watcher is running, forks in the embedding loop will
		2719	automatically be applied to the embedded loop as well, so no special
		2720	fork handling is required in that case. When the watcher is not running,
		2721	however, it is still the task of the libev user to call C<ev_loop_fork ()>
		2722	as applicable.
2164		2723
2165	=head3 Watcher-Specific Functions and Data Members	2724	=head3 Watcher-Specific Functions and Data Members
2166		2725
2167	=over 4	2726	=over 4
2168		2727
…		…
2196	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be	2755	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2197	used).	2756	used).
2198		2757
2199	struct ev_loop *loop_hi = ev_default_init (0);	2758	struct ev_loop *loop_hi = ev_default_init (0);
2200	struct ev_loop *loop_lo = 0;	2759	struct ev_loop *loop_lo = 0;
2201	struct ev_embed embed;	2760	ev_embed embed;
2202		2761
2203	// see if there is a chance of getting one that works	2762	// see if there is a chance of getting one that works
2204	// (remember that a flags value of 0 means autodetection)	2763	// (remember that a flags value of 0 means autodetection)
2205	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	2764	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2206	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	2765	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
…		…
2220	kqueue implementation). Store the kqueue/socket-only event loop in	2779	kqueue implementation). Store the kqueue/socket-only event loop in
2221	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	2780	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2222		2781
2223	struct ev_loop *loop = ev_default_init (0);	2782	struct ev_loop *loop = ev_default_init (0);
2224	struct ev_loop *loop_socket = 0;	2783	struct ev_loop *loop_socket = 0;
2225	struct ev_embed embed;	2784	ev_embed embed;
2226		2785
2227	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	2786	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2228	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	2787	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2229	{	2788	{
2230	ev_embed_init (&embed, 0, loop_socket);	2789	ev_embed_init (&embed, 0, loop_socket);
…		…
2245	event loop blocks next and before C<ev_check> watchers are being called,	2804	event loop blocks next and before C<ev_check> watchers are being called,
2246	and only in the child after the fork. If whoever good citizen calling	2805	and only in the child after the fork. If whoever good citizen calling
2247	C<ev_default_fork> cheats and calls it in the wrong process, the fork	2806	C<ev_default_fork> cheats and calls it in the wrong process, the fork
2248	handlers will be invoked, too, of course.	2807	handlers will be invoked, too, of course.
2249		2808
		2809	=head3 The special problem of life after fork - how is it possible?
		2810
		2811	Most uses of C<fork()> consist of forking, then some simple calls to ste
		2812	up/change the process environment, followed by a call to C<exec()>. This
		2813	sequence should be handled by libev without any problems.
		2814
		2815	This changes when the application actually wants to do event handling
		2816	in the child, or both parent in child, in effect "continuing" after the
		2817	fork.
		2818
		2819	The default mode of operation (for libev, with application help to detect
		2820	forks) is to duplicate all the state in the child, as would be expected
		2821	when I<either> the parent I<or> the child process continues.
		2822
		2823	When both processes want to continue using libev, then this is usually the
		2824	wrong result. In that case, usually one process (typically the parent) is
		2825	supposed to continue with all watchers in place as before, while the other
		2826	process typically wants to start fresh, i.e. without any active watchers.
		2827
		2828	The cleanest and most efficient way to achieve that with libev is to
		2829	simply create a new event loop, which of course will be "empty", and
		2830	use that for new watchers. This has the advantage of not touching more
		2831	memory than necessary, and thus avoiding the copy-on-write, and the
		2832	disadvantage of having to use multiple event loops (which do not support
		2833	signal watchers).
		2834
		2835	When this is not possible, or you want to use the default loop for
		2836	other reasons, then in the process that wants to start "fresh", call
		2837	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
		2838	the default loop will "orphan" (not stop) all registered watchers, so you
		2839	have to be careful not to execute code that modifies those watchers. Note
		2840	also that in that case, you have to re-register any signal watchers.
		2841
2250	=head3 Watcher-Specific Functions and Data Members	2842	=head3 Watcher-Specific Functions and Data Members
2251		2843
2252	=over 4	2844	=over 4
2253		2845
2254	=item ev_fork_init (ev_signal *, callback)	2846	=item ev_fork_init (ev_signal *, callback)
…		…
2286	is that the author does not know of a simple (or any) algorithm for a	2878	is that the author does not know of a simple (or any) algorithm for a
2287	multiple-writer-single-reader queue that works in all cases and doesn't	2879	multiple-writer-single-reader queue that works in all cases and doesn't
2288	need elaborate support such as pthreads.	2880	need elaborate support such as pthreads.
2289		2881
2290	That means that if you want to queue data, you have to provide your own	2882	That means that if you want to queue data, you have to provide your own
2291	queue. But at least I can tell you would implement locking around your	2883	queue. But at least I can tell you how to implement locking around your
2292	queue:	2884	queue:
2293		2885
2294	=over 4	2886	=over 4
2295		2887
2296	=item queueing from a signal handler context	2888	=item queueing from a signal handler context
2297		2889
2298	To implement race-free queueing, you simply add to the queue in the signal	2890	To implement race-free queueing, you simply add to the queue in the signal
2299	handler but you block the signal handler in the watcher callback. Here is an example that does that for	2891	handler but you block the signal handler in the watcher callback. Here is
2300	some fictitious SIGUSR1 handler:	2892	an example that does that for some fictitious SIGUSR1 handler:
2301		2893
2302	static ev_async mysig;	2894	static ev_async mysig;
2303		2895
2304	static void	2896	static void
2305	sigusr1_handler (void)	2897	sigusr1_handler (void)
…		…
2371	=over 4	2963	=over 4
2372		2964
2373	=item ev_async_init (ev_async *, callback)	2965	=item ev_async_init (ev_async *, callback)
2374		2966
2375	Initialises and configures the async watcher - it has no parameters of any	2967	Initialises and configures the async watcher - it has no parameters of any
2376	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,	2968	kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2377	believe me.	2969	trust me.
2378		2970
2379	=item ev_async_send (loop, ev_async *)	2971	=item ev_async_send (loop, ev_async *)
2380		2972
2381	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	2973	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2382	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	2974	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2383	C<ev_feed_event>, this call is safe to do in other threads, signal or	2975	C<ev_feed_event>, this call is safe to do from other threads, signal or
2384	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	2976	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2385	section below on what exactly this means).	2977	section below on what exactly this means).
2386		2978
		2979	Note that, as with other watchers in libev, multiple events might get
		2980	compressed into a single callback invocation (another way to look at this
		2981	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
		2982	reset when the event loop detects that).
		2983
2387	This call incurs the overhead of a system call only once per loop iteration,	2984	This call incurs the overhead of a system call only once per event loop
2388	so while the overhead might be noticeable, it doesn't apply to repeated	2985	iteration, so while the overhead might be noticeable, it doesn't apply to
2389	calls to C<ev_async_send>.	2986	repeated calls to C<ev_async_send> for the same event loop.
2390		2987
2391	=item bool = ev_async_pending (ev_async *)	2988	=item bool = ev_async_pending (ev_async *)
2392		2989
2393	Returns a non-zero value when C<ev_async_send> has been called on the	2990	Returns a non-zero value when C<ev_async_send> has been called on the
2394	watcher but the event has not yet been processed (or even noted) by the	2991	watcher but the event has not yet been processed (or even noted) by the
…		…
2397	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When	2994	C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2398	the loop iterates next and checks for the watcher to have become active,	2995	the loop iterates next and checks for the watcher to have become active,
2399	it will reset the flag again. C<ev_async_pending> can be used to very	2996	it will reset the flag again. C<ev_async_pending> can be used to very
2400	quickly check whether invoking the loop might be a good idea.	2997	quickly check whether invoking the loop might be a good idea.
2401		2998
2402	Not that this does I<not> check whether the watcher itself is pending, only	2999	Not that this does I<not> check whether the watcher itself is pending,
2403	whether it has been requested to make this watcher pending.	3000	only whether it has been requested to make this watcher pending: there
		3001	is a time window between the event loop checking and resetting the async
		3002	notification, and the callback being invoked.
2404		3003
2405	=back	3004	=back
2406		3005
2407		3006
2408	=head1 OTHER FUNCTIONS	3007	=head1 OTHER FUNCTIONS
…		…
2412	=over 4	3011	=over 4
2413		3012
2414	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)	3013	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
2415		3014
2416	This function combines a simple timer and an I/O watcher, calls your	3015	This function combines a simple timer and an I/O watcher, calls your
2417	callback on whichever event happens first and automatically stop both	3016	callback on whichever event happens first and automatically stops both
2418	watchers. This is useful if you want to wait for a single event on an fd	3017	watchers. This is useful if you want to wait for a single event on an fd
2419	or timeout without having to allocate/configure/start/stop/free one or	3018	or timeout without having to allocate/configure/start/stop/free one or
2420	more watchers yourself.	3019	more watchers yourself.
2421		3020
2422	If C<fd> is less than 0, then no I/O watcher will be started and events	3021	If C<fd> is less than 0, then no I/O watcher will be started and the
2423	is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and	3022	C<events> argument is being ignored. Otherwise, an C<ev_io> watcher for
2424	C<events> set will be created and started.	3023	the given C<fd> and C<events> set will be created and started.
2425		3024
2426	If C<timeout> is less than 0, then no timeout watcher will be	3025	If C<timeout> is less than 0, then no timeout watcher will be
2427	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	3026	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2428	repeat = 0) will be started. While C<0> is a valid timeout, it is of	3027	repeat = 0) will be started. C<0> is a valid timeout.
2429	dubious value.
2430		3028
2431	The callback has the type C<void (*cb)(int revents, void *arg)> and gets	3029	The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2432	passed an C<revents> set like normal event callbacks (a combination of	3030	passed an C<revents> set like normal event callbacks (a combination of
2433	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	3031	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2434	value passed to C<ev_once>:	3032	value passed to C<ev_once>. Note that it is possible to receive I<both>
		3033	a timeout and an io event at the same time - you probably should give io
		3034	events precedence.
		3035
		3036	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2435		3037
2436	static void stdin_ready (int revents, void *arg)	3038	static void stdin_ready (int revents, void *arg)
2437	{	3039	{
		3040	if (revents & EV_READ)
		3041	/* stdin might have data for us, joy! */;
2438	if (revents & EV_TIMEOUT)	3042	else if (revents & EV_TIMEOUT)
2439	/* doh, nothing entered */;	3043	/* doh, nothing entered */;
2440	else if (revents & EV_READ)
2441	/* stdin might have data for us, joy! */;
2442	}	3044	}
2443		3045
2444	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3046	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2445		3047
2446	=item ev_feed_event (ev_loop *, watcher *, int revents)	3048	=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2447		3049
2448	Feeds the given event set into the event loop, as if the specified event	3050	Feeds the given event set into the event loop, as if the specified event
2449	had happened for the specified watcher (which must be a pointer to an	3051	had happened for the specified watcher (which must be a pointer to an
2450	initialised but not necessarily started event watcher).	3052	initialised but not necessarily started event watcher).
2451		3053
2452	=item ev_feed_fd_event (ev_loop *, int fd, int revents)	3054	=item ev_feed_fd_event (struct ev_loop *, int fd, int revents)
2453		3055
2454	Feed an event on the given fd, as if a file descriptor backend detected	3056	Feed an event on the given fd, as if a file descriptor backend detected
2455	the given events it.	3057	the given events it.
2456		3058
2457	=item ev_feed_signal_event (ev_loop *loop, int signum)	3059	=item ev_feed_signal_event (struct ev_loop *loop, int signum)
2458		3060
2459	Feed an event as if the given signal occurred (C<loop> must be the default	3061	Feed an event as if the given signal occurred (C<loop> must be the default
2460	loop!).	3062	loop!).
2461		3063
2462	=back	3064	=back
…		…
2584		3186
2585	myclass obj;	3187	myclass obj;
2586	ev::io iow;	3188	ev::io iow;
2587	iow.set <myclass, &myclass::io_cb> (&obj);	3189	iow.set <myclass, &myclass::io_cb> (&obj);
2588		3190
		3191	=item w->set (object *)
		3192
		3193	This is an B<experimental> feature that might go away in a future version.
		3194
		3195	This is a variation of a method callback - leaving out the method to call
		3196	will default the method to C<operator ()>, which makes it possible to use
		3197	functor objects without having to manually specify the C<operator ()> all
		3198	the time. Incidentally, you can then also leave out the template argument
		3199	list.
		3200
		3201	The C<operator ()> method prototype must be C<void operator ()(watcher &w,
		3202	int revents)>.
		3203
		3204	See the method-C<set> above for more details.
		3205
		3206	Example: use a functor object as callback.
		3207
		3208	struct myfunctor
		3209	{
		3210	void operator() (ev::io &w, int revents)
		3211	{
		3212	...
		3213	}
		3214	}
		3215
		3216	myfunctor f;
		3217
		3218	ev::io w;
		3219	w.set (&f);
		3220
2589	=item w->set<function> (void *data = 0)	3221	=item w->set<function> (void *data = 0)
2590		3222
2591	Also sets a callback, but uses a static method or plain function as	3223	Also sets a callback, but uses a static method or plain function as
2592	callback. The optional C<data> argument will be stored in the watcher's	3224	callback. The optional C<data> argument will be stored in the watcher's
2593	C<data> member and is free for you to use.	3225	C<data> member and is free for you to use.
2594		3226
2595	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.	3227	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2596		3228
2597	See the method-C<set> above for more details.	3229	See the method-C<set> above for more details.
2598		3230
2599	Example:	3231	Example: Use a plain function as callback.
2600		3232
2601	static void io_cb (ev::io &w, int revents) { }	3233	static void io_cb (ev::io &w, int revents) { }
2602	iow.set <io_cb> ();	3234	iow.set <io_cb> ();
2603		3235
2604	=item w->set (struct ev_loop *)	3236	=item w->set (struct ev_loop *)
…		…
2642	Example: Define a class with an IO and idle watcher, start one of them in	3274	Example: Define a class with an IO and idle watcher, start one of them in
2643	the constructor.	3275	the constructor.
2644		3276
2645	class myclass	3277	class myclass
2646	{	3278	{
2647	ev::io io; void io_cb (ev::io &w, int revents);	3279	ev::io io ; void io_cb (ev::io &w, int revents);
2648	ev:idle idle void idle_cb (ev::idle &w, int revents);	3280	ev::idle idle; void idle_cb (ev::idle &w, int revents);
2649		3281
2650	myclass (int fd)	3282	myclass (int fd)
2651	{	3283	{
2652	io .set <myclass, &myclass::io_cb > (this);	3284	io .set <myclass, &myclass::io_cb > (this);
2653	idle.set <myclass, &myclass::idle_cb> (this);	3285	idle.set <myclass, &myclass::idle_cb> (this);
…		…
2669	=item Perl	3301	=item Perl
2670		3302
2671	The EV module implements the full libev API and is actually used to test	3303	The EV module implements the full libev API and is actually used to test
2672	libev. EV is developed together with libev. Apart from the EV core module,	3304	libev. EV is developed together with libev. Apart from the EV core module,
2673	there are additional modules that implement libev-compatible interfaces	3305	there are additional modules that implement libev-compatible interfaces
2674	to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the	3306	to C<libadns> (C<EV::ADNS>, but C<AnyEvent::DNS> is preferred nowadays),
2675	C<libglib> event core (C<Glib::EV> and C<EV::Glib>).	3307	C<Net::SNMP> (C<Net::SNMP::EV>) and the C<libglib> event core (C<Glib::EV>
		3308	and C<EV::Glib>).
2676		3309
2677	It can be found and installed via CPAN, its homepage is at	3310	It can be found and installed via CPAN, its homepage is at
2678	L<http://software.schmorp.de/pkg/EV>.	3311	L<http://software.schmorp.de/pkg/EV>.
2679		3312
2680	=item Python	3313	=item Python
2681		3314
2682	Python bindings can be found at L<http://code.google.com/p/pyev/>. It	3315	Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2683	seems to be quite complete and well-documented. Note, however, that the	3316	seems to be quite complete and well-documented.
2684	patch they require for libev is outright dangerous as it breaks the ABI
2685	for everybody else, and therefore, should never be applied in an installed
2686	libev (if python requires an incompatible ABI then it needs to embed
2687	libev).
2688		3317
2689	=item Ruby	3318	=item Ruby
2690		3319
2691	Tony Arcieri has written a ruby extension that offers access to a subset	3320	Tony Arcieri has written a ruby extension that offers access to a subset
2692	of the libev API and adds file handle abstractions, asynchronous DNS and	3321	of the libev API and adds file handle abstractions, asynchronous DNS and
2693	more on top of it. It can be found via gem servers. Its homepage is at	3322	more on top of it. It can be found via gem servers. Its homepage is at
2694	L<http://rev.rubyforge.org/>.	3323	L<http://rev.rubyforge.org/>.
2695		3324
		3325	Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
		3326	makes rev work even on mingw.
		3327
		3328	=item Haskell
		3329
		3330	A haskell binding to libev is available at
		3331	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
		3332
2696	=item D	3333	=item D
2697		3334
2698	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	3335	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2699	be found at L<http://proj.llucax.com.ar/wiki/evd>.	3336	be found at L<http://proj.llucax.com.ar/wiki/evd>.
		3337
		3338	=item Ocaml
		3339
		3340	Erkki Seppala has written Ocaml bindings for libev, to be found at
		3341	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
2700		3342
2701	=back	3343	=back
2702		3344
2703		3345
2704	=head1 MACRO MAGIC	3346	=head1 MACRO MAGIC
…		…
2805		3447
2806	#define EV_STANDALONE 1	3448	#define EV_STANDALONE 1
2807	#include "ev.h"	3449	#include "ev.h"
2808		3450
2809	Both header files and implementation files can be compiled with a C++	3451	Both header files and implementation files can be compiled with a C++
2810	compiler (at least, thats a stated goal, and breakage will be treated	3452	compiler (at least, that's a stated goal, and breakage will be treated
2811	as a bug).	3453	as a bug).
2812		3454
2813	You need the following files in your source tree, or in a directory	3455	You need the following files in your source tree, or in a directory
2814	in your include path (e.g. in libev/ when using -Ilibev):	3456	in your include path (e.g. in libev/ when using -Ilibev):
2815		3457
…		…
2859		3501
2860	=head2 PREPROCESSOR SYMBOLS/MACROS	3502	=head2 PREPROCESSOR SYMBOLS/MACROS
2861		3503
2862	Libev can be configured via a variety of preprocessor symbols you have to	3504	Libev can be configured via a variety of preprocessor symbols you have to
2863	define before including any of its files. The default in the absence of	3505	define before including any of its files. The default in the absence of
2864	autoconf is noted for every option.	3506	autoconf is documented for every option.
2865		3507
2866	=over 4	3508	=over 4
2867		3509
2868	=item EV_STANDALONE	3510	=item EV_STANDALONE
2869		3511
…		…
2871	keeps libev from including F<config.h>, and it also defines dummy	3513	keeps libev from including F<config.h>, and it also defines dummy
2872	implementations for some libevent functions (such as logging, which is not	3514	implementations for some libevent functions (such as logging, which is not
2873	supported). It will also not define any of the structs usually found in	3515	supported). It will also not define any of the structs usually found in
2874	F<event.h> that are not directly supported by the libev core alone.	3516	F<event.h> that are not directly supported by the libev core alone.
2875		3517
		3518	In stanbdalone mode, libev will still try to automatically deduce the
		3519	configuration, but has to be more conservative.
		3520
2876	=item EV_USE_MONOTONIC	3521	=item EV_USE_MONOTONIC
2877		3522
2878	If defined to be C<1>, libev will try to detect the availability of the	3523	If defined to be C<1>, libev will try to detect the availability of the
2879	monotonic clock option at both compile time and runtime. Otherwise no use	3524	monotonic clock option at both compile time and runtime. Otherwise no
2880	of the monotonic clock option will be attempted. If you enable this, you	3525	use of the monotonic clock option will be attempted. If you enable this,
2881	usually have to link against librt or something similar. Enabling it when	3526	you usually have to link against librt or something similar. Enabling it
2882	the functionality isn't available is safe, though, although you have	3527	when the functionality isn't available is safe, though, although you have
2883	to make sure you link against any libraries where the C<clock_gettime>	3528	to make sure you link against any libraries where the C<clock_gettime>
2884	function is hiding in (often F<-lrt>).	3529	function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
2885		3530
2886	=item EV_USE_REALTIME	3531	=item EV_USE_REALTIME
2887		3532
2888	If defined to be C<1>, libev will try to detect the availability of the	3533	If defined to be C<1>, libev will try to detect the availability of the
2889	real-time clock option at compile time (and assume its availability at	3534	real-time clock option at compile time (and assume its availability
2890	runtime if successful). Otherwise no use of the real-time clock option will	3535	at runtime if successful). Otherwise no use of the real-time clock
2891	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	3536	option will be attempted. This effectively replaces C<gettimeofday>
2892	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the	3537	by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect
2893	note about libraries in the description of C<EV_USE_MONOTONIC>, though.	3538	correctness. See the note about libraries in the description of
		3539	C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of
		3540	C<EV_USE_CLOCK_SYSCALL>.
		3541
		3542	=item EV_USE_CLOCK_SYSCALL
		3543
		3544	If defined to be C<1>, libev will try to use a direct syscall instead
		3545	of calling the system-provided C<clock_gettime> function. This option
		3546	exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt>
		3547	unconditionally pulls in C<libpthread>, slowing down single-threaded
		3548	programs needlessly. Using a direct syscall is slightly slower (in
		3549	theory), because no optimised vdso implementation can be used, but avoids
		3550	the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or
		3551	higher, as it simplifies linking (no need for C<-lrt>).
2894		3552
2895	=item EV_USE_NANOSLEEP	3553	=item EV_USE_NANOSLEEP
2896		3554
2897	If defined to be C<1>, libev will assume that C<nanosleep ()> is available	3555	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2898	and will use it for delays. Otherwise it will use C<select ()>.	3556	and will use it for delays. Otherwise it will use C<select ()>.
…		…
2914		3572
2915	=item EV_SELECT_USE_FD_SET	3573	=item EV_SELECT_USE_FD_SET
2916		3574
2917	If defined to C<1>, then the select backend will use the system C<fd_set>	3575	If defined to C<1>, then the select backend will use the system C<fd_set>
2918	structure. This is useful if libev doesn't compile due to a missing	3576	structure. This is useful if libev doesn't compile due to a missing
2919	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on	3577	C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout
2920	exotic systems. This usually limits the range of file descriptors to some	3578	on exotic systems. This usually limits the range of file descriptors to
2921	low limit such as 1024 or might have other limitations (winsocket only	3579	some low limit such as 1024 or might have other limitations (winsocket
2922	allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might	3580	only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
2923	influence the size of the C<fd_set> used.	3581	configures the maximum size of the C<fd_set>.
2924		3582
2925	=item EV_SELECT_IS_WINSOCKET	3583	=item EV_SELECT_IS_WINSOCKET
2926		3584
2927	When defined to C<1>, the select backend will assume that	3585	When defined to C<1>, the select backend will assume that
2928	select/socket/connect etc. don't understand file descriptors but	3586	select/socket/connect etc. don't understand file descriptors but
…		…
3039	When doing priority-based operations, libev usually has to linearly search	3697	When doing priority-based operations, libev usually has to linearly search
3040	all the priorities, so having many of them (hundreds) uses a lot of space	3698	all the priorities, so having many of them (hundreds) uses a lot of space
3041	and time, so using the defaults of five priorities (-2 .. +2) is usually	3699	and time, so using the defaults of five priorities (-2 .. +2) is usually
3042	fine.	3700	fine.
3043		3701
3044	If your embedding application does not need any priorities, defining these both to	3702	If your embedding application does not need any priorities, defining these
3045	C<0> will save some memory and CPU.	3703	both to C<0> will save some memory and CPU.
3046		3704
3047	=item EV_PERIODIC_ENABLE	3705	=item EV_PERIODIC_ENABLE
3048		3706
3049	If undefined or defined to be C<1>, then periodic timers are supported. If	3707	If undefined or defined to be C<1>, then periodic timers are supported. If
3050	defined to be C<0>, then they are not. Disabling them saves a few kB of	3708	defined to be C<0>, then they are not. Disabling them saves a few kB of
…		…
3057	code.	3715	code.
3058		3716
3059	=item EV_EMBED_ENABLE	3717	=item EV_EMBED_ENABLE
3060		3718
3061	If undefined or defined to be C<1>, then embed watchers are supported. If	3719	If undefined or defined to be C<1>, then embed watchers are supported. If
3062	defined to be C<0>, then they are not.	3720	defined to be C<0>, then they are not. Embed watchers rely on most other
		3721	watcher types, which therefore must not be disabled.
3063		3722
3064	=item EV_STAT_ENABLE	3723	=item EV_STAT_ENABLE
3065		3724
3066	If undefined or defined to be C<1>, then stat watchers are supported. If	3725	If undefined or defined to be C<1>, then stat watchers are supported. If
3067	defined to be C<0>, then they are not.	3726	defined to be C<0>, then they are not.
…		…
3077	defined to be C<0>, then they are not.	3736	defined to be C<0>, then they are not.
3078		3737
3079	=item EV_MINIMAL	3738	=item EV_MINIMAL
3080		3739
3081	If you need to shave off some kilobytes of code at the expense of some	3740	If you need to shave off some kilobytes of code at the expense of some
3082	speed, define this symbol to C<1>. Currently this is used to override some	3741	speed (but with the full API), define this symbol to C<1>. Currently this
3083	inlining decisions, saves roughly 30% code size on amd64. It also selects a	3742	is used to override some inlining decisions, saves roughly 30% code size
3084	much smaller 2-heap for timer management over the default 4-heap.	3743	on amd64. It also selects a much smaller 2-heap for timer management over
		3744	the default 4-heap.
		3745
		3746	You can save even more by disabling watcher types you do not need
		3747	and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert>
		3748	(C<-DNDEBUG>) will usually reduce code size a lot.
		3749
		3750	Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to
		3751	provide a bare-bones event library. See C<ev.h> for details on what parts
		3752	of the API are still available, and do not complain if this subset changes
		3753	over time.
3085		3754
3086	=item EV_PID_HASHSIZE	3755	=item EV_PID_HASHSIZE
3087		3756
3088	C<ev_child> watchers use a small hash table to distribute workload by	3757	C<ev_child> watchers use a small hash table to distribute workload by
3089	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more	3758	pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
…		…
3099	two).	3768	two).
3100		3769
3101	=item EV_USE_4HEAP	3770	=item EV_USE_4HEAP
3102		3771
3103	Heaps are not very cache-efficient. To improve the cache-efficiency of the	3772	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3104	timer and periodics heap, libev uses a 4-heap when this symbol is defined	3773	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3105	to C<1>. The 4-heap uses more complicated (longer) code but has	3774	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3106	noticeably faster performance with many (thousands) of watchers.	3775	faster performance with many (thousands) of watchers.
3107		3776
3108	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	3777	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3109	(disabled).	3778	(disabled).
3110		3779
3111	=item EV_HEAP_CACHE_AT	3780	=item EV_HEAP_CACHE_AT
3112		3781
3113	Heaps are not very cache-efficient. To improve the cache-efficiency of the	3782	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3114	timer and periodics heap, libev can cache the timestamp (I<at>) within	3783	timer and periodics heaps, libev can cache the timestamp (I<at>) within
3115	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),	3784	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3116	which uses 8-12 bytes more per watcher and a few hundred bytes more code,	3785	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3117	but avoids random read accesses on heap changes. This improves performance	3786	but avoids random read accesses on heap changes. This improves performance
3118	noticeably with with many (hundreds) of watchers.	3787	noticeably with many (hundreds) of watchers.
3119		3788
3120	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	3789	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3121	(disabled).	3790	(disabled).
3122		3791
3123	=item EV_VERIFY	3792	=item EV_VERIFY
…		…
3129	called once per loop, which can slow down libev. If set to C<3>, then the	3798	called once per loop, which can slow down libev. If set to C<3>, then the
3130	verification code will be called very frequently, which will slow down	3799	verification code will be called very frequently, which will slow down
3131	libev considerably.	3800	libev considerably.
3132		3801
3133	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be	3802	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3134	C<0.>	3803	C<0>.
3135		3804
3136	=item EV_COMMON	3805	=item EV_COMMON
3137		3806
3138	By default, all watchers have a C<void *data> member. By redefining	3807	By default, all watchers have a C<void *data> member. By redefining
3139	this macro to a something else you can include more and other types of	3808	this macro to a something else you can include more and other types of
…		…
3156	and the way callbacks are invoked and set. Must expand to a struct member	3825	and the way callbacks are invoked and set. Must expand to a struct member
3157	definition and a statement, respectively. See the F<ev.h> header file for	3826	definition and a statement, respectively. See the F<ev.h> header file for
3158	their default definitions. One possible use for overriding these is to	3827	their default definitions. One possible use for overriding these is to
3159	avoid the C<struct ev_loop *> as first argument in all cases, or to use	3828	avoid the C<struct ev_loop *> as first argument in all cases, or to use
3160	method calls instead of plain function calls in C++.	3829	method calls instead of plain function calls in C++.
		3830
		3831	=back
3161		3832
3162	=head2 EXPORTED API SYMBOLS	3833	=head2 EXPORTED API SYMBOLS
3163		3834
3164	If you need to re-export the API (e.g. via a DLL) and you need a list of	3835	If you need to re-export the API (e.g. via a DLL) and you need a list of
3165	exported symbols, you can use the provided F<Symbol.*> files which list	3836	exported symbols, you can use the provided F<Symbol.*> files which list
…		…
3212	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	3883	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3213		3884
3214	#include "ev_cpp.h"	3885	#include "ev_cpp.h"
3215	#include "ev.c"	3886	#include "ev.c"
3216		3887
		3888	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES
3217		3889
3218	=head1 THREADS AND COROUTINES	3890	=head2 THREADS AND COROUTINES
3219		3891
3220	=head2 THREADS	3892	=head3 THREADS
3221		3893
3222	Libev itself is completely thread-safe, but it uses no locking. This	3894	All libev functions are reentrant and thread-safe unless explicitly
		3895	documented otherwise, but libev implements no locking itself. This means
3223	means that you can use as many loops as you want in parallel, as long as	3896	that you can use as many loops as you want in parallel, as long as there
3224	only one thread ever calls into one libev function with the same loop	3897	are no concurrent calls into any libev function with the same loop
3225	parameter.	3898	parameter (C<ev_default_*> calls have an implicit default loop parameter,
		3899	of course): libev guarantees that different event loops share no data
		3900	structures that need any locking.
3226		3901
3227	Or put differently: calls with different loop parameters can be done in	3902	Or to put it differently: calls with different loop parameters can be done
3228	parallel from multiple threads, calls with the same loop parameter must be	3903	concurrently from multiple threads, calls with the same loop parameter
3229	done serially (but can be done from different threads, as long as only one	3904	must be done serially (but can be done from different threads, as long as
3230	thread ever is inside a call at any point in time, e.g. by using a mutex	3905	only one thread ever is inside a call at any point in time, e.g. by using
3231	per loop).	3906	a mutex per loop).
		3907
		3908	Specifically to support threads (and signal handlers), libev implements
		3909	so-called C<ev_async> watchers, which allow some limited form of
		3910	concurrency on the same event loop, namely waking it up "from the
		3911	outside".
3232		3912
3233	If you want to know which design (one loop, locking, or multiple loops	3913	If you want to know which design (one loop, locking, or multiple loops
3234	without or something else still) is best for your problem, then I cannot	3914	without or something else still) is best for your problem, then I cannot
3235	help you. I can give some generic advice however:	3915	help you, but here is some generic advice:
3236		3916
3237	=over 4	3917	=over 4
3238		3918
3239	=item * most applications have a main thread: use the default libev loop	3919	=item * most applications have a main thread: use the default libev loop
3240	in that thread, or create a separate thread running only the default loop.	3920	in that thread, or create a separate thread running only the default loop.
…		…
3252		3932
3253	Choosing a model is hard - look around, learn, know that usually you can do	3933	Choosing a model is hard - look around, learn, know that usually you can do
3254	better than you currently do :-)	3934	better than you currently do :-)
3255		3935
3256	=item * often you need to talk to some other thread which blocks in the	3936	=item * often you need to talk to some other thread which blocks in the
		3937	event loop.
		3938
3257	event loop - C<ev_async> watchers can be used to wake them up from other	3939	C<ev_async> watchers can be used to wake them up from other threads safely
3258	threads safely (or from signal contexts...).	3940	(or from signal contexts...).
		3941
		3942	An example use would be to communicate signals or other events that only
		3943	work in the default loop by registering the signal watcher with the
		3944	default loop and triggering an C<ev_async> watcher from the default loop
		3945	watcher callback into the event loop interested in the signal.
3259		3946
3260	=back	3947	=back
3261		3948
		3949	=head4 THREAD LOCKING EXAMPLE
		3950
		3951	Here is a fictitious example of how to run an event loop in a different
		3952	thread than where callbacks are being invoked and watchers are
		3953	created/added/removed.
		3954
		3955	For a real-world example, see the C<EV::Loop::Async> perl module,
		3956	which uses exactly this technique (which is suited for many high-level
		3957	languages).
		3958
		3959	The example uses a pthread mutex to protect the loop data, a condition
		3960	variable to wait for callback invocations, an async watcher to notify the
		3961	event loop thread and an unspecified mechanism to wake up the main thread.
		3962
		3963	First, you need to associate some data with the event loop:
		3964
		3965	typedef struct {
		3966	mutex_t lock; /* global loop lock */
		3967	ev_async async_w;
		3968	thread_t tid;
		3969	cond_t invoke_cv;
		3970	} userdata;
		3971
		3972	void prepare_loop (EV_P)
		3973	{
		3974	// for simplicity, we use a static userdata struct.
		3975	static userdata u;
		3976
		3977	ev_async_init (&u->async_w, async_cb);
		3978	ev_async_start (EV_A_ &u->async_w);
		3979
		3980	pthread_mutex_init (&u->lock, 0);
		3981	pthread_cond_init (&u->invoke_cv, 0);
		3982
		3983	// now associate this with the loop
		3984	ev_set_userdata (EV_A_ u);
		3985	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3986	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3987
		3988	// then create the thread running ev_loop
		3989	pthread_create (&u->tid, 0, l_run, EV_A);
		3990	}
		3991
		3992	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3993	solely to wake up the event loop so it takes notice of any new watchers
		3994	that might have been added:
		3995
		3996	static void
		3997	async_cb (EV_P_ ev_async *w, int revents)
		3998	{
		3999	// just used for the side effects
		4000	}
		4001
		4002	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		4003	protecting the loop data, respectively.
		4004
		4005	static void
		4006	l_release (EV_P)
		4007	{
		4008	userdata *u = ev_userdata (EV_A);
		4009	pthread_mutex_unlock (&u->lock);
		4010	}
		4011
		4012	static void
		4013	l_acquire (EV_P)
		4014	{
		4015	userdata *u = ev_userdata (EV_A);
		4016	pthread_mutex_lock (&u->lock);
		4017	}
		4018
		4019	The event loop thread first acquires the mutex, and then jumps straight
		4020	into C<ev_loop>:
		4021
		4022	void *
		4023	l_run (void *thr_arg)
		4024	{
		4025	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		4026
		4027	l_acquire (EV_A);
		4028	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		4029	ev_loop (EV_A_ 0);
		4030	l_release (EV_A);
		4031
		4032	return 0;
		4033	}
		4034
		4035	Instead of invoking all pending watchers, the C<l_invoke> callback will
		4036	signal the main thread via some unspecified mechanism (signals? pipe
		4037	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		4038	have been called (in a while loop because a) spurious wakeups are possible
		4039	and b) skipping inter-thread-communication when there are no pending
		4040	watchers is very beneficial):
		4041
		4042	static void
		4043	l_invoke (EV_P)
		4044	{
		4045	userdata *u = ev_userdata (EV_A);
		4046
		4047	while (ev_pending_count (EV_A))
		4048	{
		4049	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		4050	pthread_cond_wait (&u->invoke_cv, &u->lock);
		4051	}
		4052	}
		4053
		4054	Now, whenever the main thread gets told to invoke pending watchers, it
		4055	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		4056	thread to continue:
		4057
		4058	static void
		4059	real_invoke_pending (EV_P)
		4060	{
		4061	userdata *u = ev_userdata (EV_A);
		4062
		4063	pthread_mutex_lock (&u->lock);
		4064	ev_invoke_pending (EV_A);
		4065	pthread_cond_signal (&u->invoke_cv);
		4066	pthread_mutex_unlock (&u->lock);
		4067	}
		4068
		4069	Whenever you want to start/stop a watcher or do other modifications to an
		4070	event loop, you will now have to lock:
		4071
		4072	ev_timer timeout_watcher;
		4073	userdata *u = ev_userdata (EV_A);
		4074
		4075	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		4076
		4077	pthread_mutex_lock (&u->lock);
		4078	ev_timer_start (EV_A_ &timeout_watcher);
		4079	ev_async_send (EV_A_ &u->async_w);
		4080	pthread_mutex_unlock (&u->lock);
		4081
		4082	Note that sending the C<ev_async> watcher is required because otherwise
		4083	an event loop currently blocking in the kernel will have no knowledge
		4084	about the newly added timer. By waking up the loop it will pick up any new
		4085	watchers in the next event loop iteration.
		4086
3262	=head2 COROUTINES	4087	=head3 COROUTINES
3263		4088
3264	Libev is much more accommodating to coroutines ("cooperative threads"):	4089	Libev is very accommodating to coroutines ("cooperative threads"):
3265	libev fully supports nesting calls to it's functions from different	4090	libev fully supports nesting calls to its functions from different
3266	coroutines (e.g. you can call C<ev_loop> on the same loop from two	4091	coroutines (e.g. you can call C<ev_loop> on the same loop from two
3267	different coroutines and switch freely between both coroutines running the	4092	different coroutines, and switch freely between both coroutines running
3268	loop, as long as you don't confuse yourself). The only exception is that	4093	the loop, as long as you don't confuse yourself). The only exception is
3269	you must not do this from C<ev_periodic> reschedule callbacks.	4094	that you must not do this from C<ev_periodic> reschedule callbacks.
3270		4095
3271	Care has been invested into making sure that libev does not keep local	4096	Care has been taken to ensure that libev does not keep local state inside
3272	state inside C<ev_loop>, and other calls do not usually allow coroutine	4097	C<ev_loop>, and other calls do not usually allow for coroutine switches as
3273	switches.	4098	they do not call any callbacks.
3274		4099
		4100	=head2 COMPILER WARNINGS
3275		4101
3276	=head1 COMPLEXITIES	4102	Depending on your compiler and compiler settings, you might get no or a
		4103	lot of warnings when compiling libev code. Some people are apparently
		4104	scared by this.
3277		4105
3278	In this section the complexities of (many of) the algorithms used inside	4106	However, these are unavoidable for many reasons. For one, each compiler
3279	libev will be explained. For complexity discussions about backends see the	4107	has different warnings, and each user has different tastes regarding
3280	documentation for C<ev_default_init>.	4108	warning options. "Warn-free" code therefore cannot be a goal except when
		4109	targeting a specific compiler and compiler-version.
3281		4110
3282	All of the following are about amortised time: If an array needs to be	4111	Another reason is that some compiler warnings require elaborate
3283	extended, libev needs to realloc and move the whole array, but this	4112	workarounds, or other changes to the code that make it less clear and less
3284	happens asymptotically never with higher number of elements, so O(1) might	4113	maintainable.
3285	mean it might do a lengthy realloc operation in rare cases, but on average
3286	it is much faster and asymptotically approaches constant time.
3287		4114
3288	=over 4	4115	And of course, some compiler warnings are just plain stupid, or simply
		4116	wrong (because they don't actually warn about the condition their message
		4117	seems to warn about). For example, certain older gcc versions had some
		4118	warnings that resulted an extreme number of false positives. These have
		4119	been fixed, but some people still insist on making code warn-free with
		4120	such buggy versions.
3289		4121
3290	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)	4122	While libev is written to generate as few warnings as possible,
		4123	"warn-free" code is not a goal, and it is recommended not to build libev
		4124	with any compiler warnings enabled unless you are prepared to cope with
		4125	them (e.g. by ignoring them). Remember that warnings are just that:
		4126	warnings, not errors, or proof of bugs.
3291		4127
3292	This means that, when you have a watcher that triggers in one hour and
3293	there are 100 watchers that would trigger before that then inserting will
3294	have to skip roughly seven (C<ld 100>) of these watchers.
3295		4128
3296	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)	4129	=head2 VALGRIND
3297		4130
3298	That means that changing a timer costs less than removing/adding them	4131	Valgrind has a special section here because it is a popular tool that is
3299	as only the relative motion in the event queue has to be paid for.	4132	highly useful. Unfortunately, valgrind reports are very hard to interpret.
3300		4133
3301	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)	4134	If you think you found a bug (memory leak, uninitialised data access etc.)
		4135	in libev, then check twice: If valgrind reports something like:
3302		4136
3303	These just add the watcher into an array or at the head of a list.	4137	==2274== definitely lost: 0 bytes in 0 blocks.
		4138	==2274== possibly lost: 0 bytes in 0 blocks.
		4139	==2274== still reachable: 256 bytes in 1 blocks.
3304		4140
3305	=item Stopping check/prepare/idle/fork/async watchers: O(1)	4141	Then there is no memory leak, just as memory accounted to global variables
		4142	is not a memleak - the memory is still being referenced, and didn't leak.
3306		4143
3307	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	4144	Similarly, under some circumstances, valgrind might report kernel bugs
		4145	as if it were a bug in libev (e.g. in realloc or in the poll backend,
		4146	although an acceptable workaround has been found here), or it might be
		4147	confused.
3308		4148
3309	These watchers are stored in lists then need to be walked to find the	4149	Keep in mind that valgrind is a very good tool, but only a tool. Don't
3310	correct watcher to remove. The lists are usually short (you don't usually	4150	make it into some kind of religion.
3311	have many watchers waiting for the same fd or signal).
3312		4151
3313	=item Finding the next timer in each loop iteration: O(1)	4152	If you are unsure about something, feel free to contact the mailing list
		4153	with the full valgrind report and an explanation on why you think this
		4154	is a bug in libev (best check the archives, too :). However, don't be
		4155	annoyed when you get a brisk "this is no bug" answer and take the chance
		4156	of learning how to interpret valgrind properly.
3314		4157
3315	By virtue of using a binary or 4-heap, the next timer is always found at a	4158	If you need, for some reason, empty reports from valgrind for your project
3316	fixed position in the storage array.	4159	I suggest using suppression lists.
3317		4160
3318	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
3319		4161
3320	A change means an I/O watcher gets started or stopped, which requires	4162	=head1 PORTABILITY NOTES
3321	libev to recalculate its status (and possibly tell the kernel, depending
3322	on backend and whether C<ev_io_set> was used).
3323		4163
3324	=item Activating one watcher (putting it into the pending state): O(1)
3325
3326	=item Priority handling: O(number_of_priorities)
3327
3328	Priorities are implemented by allocating some space for each
3329	priority. When doing priority-based operations, libev usually has to
3330	linearly search all the priorities, but starting/stopping and activating
3331	watchers becomes O(1) w.r.t. priority handling.
3332
3333	=item Sending an ev_async: O(1)
3334
3335	=item Processing ev_async_send: O(number_of_async_watchers)
3336
3337	=item Processing signals: O(max_signal_number)
3338
3339	Sending involves a system call I<iff> there were no other C<ev_async_send>
3340	calls in the current loop iteration. Checking for async and signal events
3341	involves iterating over all running async watchers or all signal numbers.
3342
3343	=back
3344
3345
3346	=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	4164	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3347		4165
3348	Win32 doesn't support any of the standards (e.g. POSIX) that libev	4166	Win32 doesn't support any of the standards (e.g. POSIX) that libev
3349	requires, and its I/O model is fundamentally incompatible with the POSIX	4167	requires, and its I/O model is fundamentally incompatible with the POSIX
3350	model. Libev still offers limited functionality on this platform in	4168	model. Libev still offers limited functionality on this platform in
3351	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4169	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
…		…
3358	way (note also that glib is the slowest event library known to man).	4176	way (note also that glib is the slowest event library known to man).
3359		4177
3360	There is no supported compilation method available on windows except	4178	There is no supported compilation method available on windows except
3361	embedding it into other applications.	4179	embedding it into other applications.
3362		4180
		4181	Sensible signal handling is officially unsupported by Microsoft - libev
		4182	tries its best, but under most conditions, signals will simply not work.
		4183
3363	Not a libev limitation but worth mentioning: windows apparently doesn't	4184	Not a libev limitation but worth mentioning: windows apparently doesn't
3364	accept large writes: instead of resulting in a partial write, windows will	4185	accept large writes: instead of resulting in a partial write, windows will
3365	either accept everything or return C<ENOBUFS> if the buffer is too large,	4186	either accept everything or return C<ENOBUFS> if the buffer is too large,
3366	so make sure you only write small amounts into your sockets (less than a	4187	so make sure you only write small amounts into your sockets (less than a
3367	megabyte seems safe, but thsi apparently depends on the amount of memory	4188	megabyte seems safe, but this apparently depends on the amount of memory
3368	available).	4189	available).
3369		4190
3370	Due to the many, low, and arbitrary limits on the win32 platform and	4191	Due to the many, low, and arbitrary limits on the win32 platform and
3371	the abysmal performance of winsockets, using a large number of sockets	4192	the abysmal performance of winsockets, using a large number of sockets
3372	is not recommended (and not reasonable). If your program needs to use	4193	is not recommended (and not reasonable). If your program needs to use
3373	more than a hundred or so sockets, then likely it needs to use a totally	4194	more than a hundred or so sockets, then likely it needs to use a totally
3374	different implementation for windows, as libev offers the POSIX readiness	4195	different implementation for windows, as libev offers the POSIX readiness
3375	notification model, which cannot be implemented efficiently on windows	4196	notification model, which cannot be implemented efficiently on windows
3376	(Microsoft monopoly games).	4197	(due to Microsoft monopoly games).
3377		4198
3378	A typical way to use libev under windows is to embed it (see the embedding	4199	A typical way to use libev under windows is to embed it (see the embedding
3379	section for details) and use the following F<evwrap.h> header file instead	4200	section for details) and use the following F<evwrap.h> header file instead
3380	of F<ev.h>:	4201	of F<ev.h>:
3381		4202
…		…
3383	#define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */	4204	#define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
3384		4205
3385	#include "ev.h"	4206	#include "ev.h"
3386		4207
3387	And compile the following F<evwrap.c> file into your project (make sure	4208	And compile the following F<evwrap.c> file into your project (make sure
3388	you do I<not> compile the F<ev.c> or any other embedded soruce files!):	4209	you do I<not> compile the F<ev.c> or any other embedded source files!):
3389		4210
3390	#include "evwrap.h"	4211	#include "evwrap.h"
3391	#include "ev.c"	4212	#include "ev.c"
3392		4213
3393	=over 4	4214	=over 4
…		…
3417		4238
3418	Early versions of winsocket's select only supported waiting for a maximum	4239	Early versions of winsocket's select only supported waiting for a maximum
3419	of C<64> handles (probably owning to the fact that all windows kernels	4240	of C<64> handles (probably owning to the fact that all windows kernels
3420	can only wait for C<64> things at the same time internally; Microsoft	4241	can only wait for C<64> things at the same time internally; Microsoft
3421	recommends spawning a chain of threads and wait for 63 handles and the	4242	recommends spawning a chain of threads and wait for 63 handles and the
3422	previous thread in each. Great).	4243	previous thread in each. Sounds great!).
3423		4244
3424	Newer versions support more handles, but you need to define C<FD_SETSIZE>	4245	Newer versions support more handles, but you need to define C<FD_SETSIZE>
3425	to some high number (e.g. C<2048>) before compiling the winsocket select	4246	to some high number (e.g. C<2048>) before compiling the winsocket select
3426	call (which might be in libev or elsewhere, for example, perl does its own	4247	call (which might be in libev or elsewhere, for example, perl and many
3427	select emulation on windows).	4248	other interpreters do their own select emulation on windows).
3428		4249
3429	Another limit is the number of file descriptors in the Microsoft runtime	4250	Another limit is the number of file descriptors in the Microsoft runtime
3430	libraries, which by default is C<64> (there must be a hidden I<64> fetish	4251	libraries, which by default is C<64> (there must be a hidden I<64>
3431	or something like this inside Microsoft). You can increase this by calling	4252	fetish or something like this inside Microsoft). You can increase this
3432	C<_setmaxstdio>, which can increase this limit to C<2048> (another	4253	by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3433	arbitrary limit), but is broken in many versions of the Microsoft runtime	4254	(another arbitrary limit), but is broken in many versions of the Microsoft
3434	libraries.
3435
3436	This might get you to about C<512> or C<2048> sockets (depending on	4255	runtime libraries. This might get you to about C<512> or C<2048> sockets
3437	windows version and/or the phase of the moon). To get more, you need to	4256	(depending on windows version and/or the phase of the moon). To get more,
3438	wrap all I/O functions and provide your own fd management, but the cost of	4257	you need to wrap all I/O functions and provide your own fd management, but
3439	calling select (O(n²)) will likely make this unworkable.	4258	the cost of calling select (O(n²)) will likely make this unworkable.
3440		4259
3441	=back	4260	=back
3442		4261
3443
3444	=head1 PORTABILITY REQUIREMENTS	4262	=head2 PORTABILITY REQUIREMENTS
3445		4263
3446	In addition to a working ISO-C implementation, libev relies on a few	4264	In addition to a working ISO-C implementation and of course the
3447	additional extensions:	4265	backend-specific APIs, libev relies on a few additional extensions:
3448		4266
3449	=over 4	4267	=over 4
3450		4268
3451	=item C<void (*)(ev_watcher_type *, int revents)> must have compatible	4269	=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
3452	calling conventions regardless of C<ev_watcher_type *>.	4270	calling conventions regardless of C<ev_watcher_type *>.
…		…
3458	calls them using an C<ev_watcher *> internally.	4276	calls them using an C<ev_watcher *> internally.
3459		4277
3460	=item C<sig_atomic_t volatile> must be thread-atomic as well	4278	=item C<sig_atomic_t volatile> must be thread-atomic as well
3461		4279
3462	The type C<sig_atomic_t volatile> (or whatever is defined as	4280	The type C<sig_atomic_t volatile> (or whatever is defined as
3463	C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different	4281	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
3464	threads. This is not part of the specification for C<sig_atomic_t>, but is	4282	threads. This is not part of the specification for C<sig_atomic_t>, but is
3465	believed to be sufficiently portable.	4283	believed to be sufficiently portable.
3466		4284
3467	=item C<sigprocmask> must work in a threaded environment	4285	=item C<sigprocmask> must work in a threaded environment
3468		4286
…		…
3477	except the initial one, and run the default loop in the initial thread as	4295	except the initial one, and run the default loop in the initial thread as
3478	well.	4296	well.
3479		4297
3480	=item C<long> must be large enough for common memory allocation sizes	4298	=item C<long> must be large enough for common memory allocation sizes
3481		4299
3482	To improve portability and simplify using libev, libev uses C<long>	4300	To improve portability and simplify its API, libev uses C<long> internally
3483	internally instead of C<size_t> when allocating its data structures. On	4301	instead of C<size_t> when allocating its data structures. On non-POSIX
3484	non-POSIX systems (Microsoft...) this might be unexpectedly low, but	4302	systems (Microsoft...) this might be unexpectedly low, but is still at
3485	is still at least 31 bits everywhere, which is enough for hundreds of	4303	least 31 bits everywhere, which is enough for hundreds of millions of
3486	millions of watchers.	4304	watchers.
3487		4305
3488	=item C<double> must hold a time value in seconds with enough accuracy	4306	=item C<double> must hold a time value in seconds with enough accuracy
3489		4307
3490	The type C<double> is used to represent timestamps. It is required to	4308	The type C<double> is used to represent timestamps. It is required to
3491	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	4309	have at least 51 bits of mantissa (and 9 bits of exponent), which is good
3492	enough for at least into the year 4000. This requirement is fulfilled by	4310	enough for at least into the year 4000. This requirement is fulfilled by
3493	implementations implementing IEEE 754 (basically all existing ones).	4311	implementations implementing IEEE 754, which is basically all existing
		4312	ones. With IEEE 754 doubles, you get microsecond accuracy until at least
		4313	2200.
3494		4314
3495	=back	4315	=back
3496		4316
3497	If you know of other additional requirements drop me a note.	4317	If you know of other additional requirements drop me a note.
3498		4318
3499		4319
3500	=head1 COMPILER WARNINGS	4320	=head1 ALGORITHMIC COMPLEXITIES
3501		4321
3502	Depending on your compiler and compiler settings, you might get no or a	4322	In this section the complexities of (many of) the algorithms used inside
3503	lot of warnings when compiling libev code. Some people are apparently	4323	libev will be documented. For complexity discussions about backends see
3504	scared by this.	4324	the documentation for C<ev_default_init>.
3505		4325
3506	However, these are unavoidable for many reasons. For one, each compiler	4326	All of the following are about amortised time: If an array needs to be
3507	has different warnings, and each user has different tastes regarding	4327	extended, libev needs to realloc and move the whole array, but this
3508	warning options. "Warn-free" code therefore cannot be a goal except when	4328	happens asymptotically rarer with higher number of elements, so O(1) might
3509	targeting a specific compiler and compiler-version.	4329	mean that libev does a lengthy realloc operation in rare cases, but on
		4330	average it is much faster and asymptotically approaches constant time.
3510		4331
3511	Another reason is that some compiler warnings require elaborate	4332	=over 4
3512	workarounds, or other changes to the code that make it less clear and less
3513	maintainable.
3514		4333
3515	And of course, some compiler warnings are just plain stupid, or simply	4334	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
3516	wrong (because they don't actually warn about the condition their message
3517	seems to warn about).
3518		4335
3519	While libev is written to generate as few warnings as possible,	4336	This means that, when you have a watcher that triggers in one hour and
3520	"warn-free" code is not a goal, and it is recommended not to build libev	4337	there are 100 watchers that would trigger before that, then inserting will
3521	with any compiler warnings enabled unless you are prepared to cope with	4338	have to skip roughly seven (C<ld 100>) of these watchers.
3522	them (e.g. by ignoring them). Remember that warnings are just that:
3523	warnings, not errors, or proof of bugs.
3524		4339
		4340	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
3525		4341
3526	=head1 VALGRIND	4342	That means that changing a timer costs less than removing/adding them,
		4343	as only the relative motion in the event queue has to be paid for.
3527		4344
3528	Valgrind has a special section here because it is a popular tool that is	4345	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
3529	highly useful, but valgrind reports are very hard to interpret.
3530		4346
3531	If you think you found a bug (memory leak, uninitialised data access etc.)	4347	These just add the watcher into an array or at the head of a list.
3532	in libev, then check twice: If valgrind reports something like:
3533		4348
3534	==2274== definitely lost: 0 bytes in 0 blocks.	4349	=item Stopping check/prepare/idle/fork/async watchers: O(1)
3535	==2274== possibly lost: 0 bytes in 0 blocks.
3536	==2274== still reachable: 256 bytes in 1 blocks.
3537		4350
3538	Then there is no memory leak. Similarly, under some circumstances,	4351	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
3539	valgrind might report kernel bugs as if it were a bug in libev, or it
3540	might be confused (it is a very good tool, but only a tool).
3541		4352
3542	If you are unsure about something, feel free to contact the mailing list	4353	These watchers are stored in lists, so they need to be walked to find the
3543	with the full valgrind report and an explanation on why you think this is	4354	correct watcher to remove. The lists are usually short (you don't usually
3544	a bug in libev. However, don't be annoyed when you get a brisk "this is	4355	have many watchers waiting for the same fd or signal: one is typical, two
3545	no bug" answer and take the chance of learning how to interpret valgrind	4356	is rare).
3546	properly.
3547		4357
3548	If you need, for some reason, empty reports from valgrind for your project	4358	=item Finding the next timer in each loop iteration: O(1)
3549	I suggest using suppression lists.
3550		4359
		4360	By virtue of using a binary or 4-heap, the next timer is always found at a
		4361	fixed position in the storage array.
		4362
		4363	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
		4364
		4365	A change means an I/O watcher gets started or stopped, which requires
		4366	libev to recalculate its status (and possibly tell the kernel, depending
		4367	on backend and whether C<ev_io_set> was used).
		4368
		4369	=item Activating one watcher (putting it into the pending state): O(1)
		4370
		4371	=item Priority handling: O(number_of_priorities)
		4372
		4373	Priorities are implemented by allocating some space for each
		4374	priority. When doing priority-based operations, libev usually has to
		4375	linearly search all the priorities, but starting/stopping and activating
		4376	watchers becomes O(1) with respect to priority handling.
		4377
		4378	=item Sending an ev_async: O(1)
		4379
		4380	=item Processing ev_async_send: O(number_of_async_watchers)
		4381
		4382	=item Processing signals: O(max_signal_number)
		4383
		4384	Sending involves a system call I<iff> there were no other C<ev_async_send>
		4385	calls in the current loop iteration. Checking for async and signal events
		4386	involves iterating over all running async watchers or all signal numbers.
		4387
		4388	=back
		4389
		4390
		4391	=head1 GLOSSARY
		4392
		4393	=over 4
		4394
		4395	=item active
		4396
		4397	A watcher is active as long as it has been started (has been attached to
		4398	an event loop) but not yet stopped (disassociated from the event loop).
		4399
		4400	=item application
		4401
		4402	In this document, an application is whatever is using libev.
		4403
		4404	=item callback
		4405
		4406	The address of a function that is called when some event has been
		4407	detected. Callbacks are being passed the event loop, the watcher that
		4408	received the event, and the actual event bitset.
		4409
		4410	=item callback invocation
		4411
		4412	The act of calling the callback associated with a watcher.
		4413
		4414	=item event
		4415
		4416	A change of state of some external event, such as data now being available
		4417	for reading on a file descriptor, time having passed or simply not having
		4418	any other events happening anymore.
		4419
		4420	In libev, events are represented as single bits (such as C<EV_READ> or
		4421	C<EV_TIMEOUT>).
		4422
		4423	=item event library
		4424
		4425	A software package implementing an event model and loop.
		4426
		4427	=item event loop
		4428
		4429	An entity that handles and processes external events and converts them
		4430	into callback invocations.
		4431
		4432	=item event model
		4433
		4434	The model used to describe how an event loop handles and processes
		4435	watchers and events.
		4436
		4437	=item pending
		4438
		4439	A watcher is pending as soon as the corresponding event has been detected,
		4440	and stops being pending as soon as the watcher will be invoked or its
		4441	pending status is explicitly cleared by the application.
		4442
		4443	A watcher can be pending, but not active. Stopping a watcher also clears
		4444	its pending status.
		4445
		4446	=item real time
		4447
		4448	The physical time that is observed. It is apparently strictly monotonic :)
		4449
		4450	=item wall-clock time
		4451
		4452	The time and date as shown on clocks. Unlike real time, it can actually
		4453	be wrong and jump forwards and backwards, e.g. when the you adjust your
		4454	clock.
		4455
		4456	=item watcher
		4457
		4458	A data structure that describes interest in certain events. Watchers need
		4459	to be started (attached to an event loop) before they can receive events.
		4460
		4461	=item watcher invocation
		4462
		4463	The act of calling the callback associated with a watcher.
		4464
		4465	=back
3551		4466
3552	=head1 AUTHOR	4467	=head1 AUTHOR
3553		4468
3554	Marc Lehmann <libev@schmorp.de>.	4469	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3555		4470

Diff Legend

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