[ViewVC] Diff of: cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.163 by root, Sat May 31 23:19:23 2008 UTC vs.
Revision 1.195 by root, Mon Oct 20 17:50:48 2008 UTC

…		…
2		2
3	libev - a high performance full-featured event loop written in C	3	libev - a high performance full-featured event loop written in C
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	#include <ev.h>	7	#include <ev.h>
8		8
9	=head2 EXAMPLE PROGRAM	9	=head2 EXAMPLE PROGRAM
10		10
11	// a single header file is required	11	// a single header file is required
12	#include <ev.h>	12	#include <ev.h>
13		13
14	// every watcher type has its own typedef'd struct	14	// every watcher type has its own typedef'd struct
15	// with the name ev_<type>	15	// with the name ev_<type>
16	ev_io stdin_watcher;	16	ev_io stdin_watcher;
17	ev_timer timeout_watcher;	17	ev_timer timeout_watcher;
18		18
19	// all watcher callbacks have a similar signature	19	// all watcher callbacks have a similar signature
20	// this callback is called when data is readable on stdin	20	// this callback is called when data is readable on stdin
21	static void	21	static void
22	stdin_cb (EV_P_ struct ev_io *w, int revents)	22	stdin_cb (EV_P_ struct ev_io *w, int revents)
23	{	23	{
24	puts ("stdin ready");	24	puts ("stdin ready");
25	// for one-shot events, one must manually stop the watcher	25	// for one-shot events, one must manually stop the watcher
26	// with its corresponding stop function.	26	// with its corresponding stop function.
27	ev_io_stop (EV_A_ w);	27	ev_io_stop (EV_A_ w);
28		28
29	// this causes all nested ev_loop's to stop iterating	29	// this causes all nested ev_loop's to stop iterating
30	ev_unloop (EV_A_ EVUNLOOP_ALL);	30	ev_unloop (EV_A_ EVUNLOOP_ALL);
31	}	31	}
32		32
33	// another callback, this time for a time-out	33	// another callback, this time for a time-out
34	static void	34	static void
35	timeout_cb (EV_P_ struct ev_timer *w, int revents)	35	timeout_cb (EV_P_ struct ev_timer *w, int revents)
36	{	36	{
37	puts ("timeout");	37	puts ("timeout");
38	// this causes the innermost ev_loop to stop iterating	38	// this causes the innermost ev_loop to stop iterating
39	ev_unloop (EV_A_ EVUNLOOP_ONE);	39	ev_unloop (EV_A_ EVUNLOOP_ONE);
40	}	40	}
41		41
42	int	42	int
43	main (void)	43	main (void)
44	{	44	{
45	// use the default event loop unless you have special needs	45	// use the default event loop unless you have special needs
46	struct ev_loop *loop = ev_default_loop (0);	46	struct ev_loop *loop = ev_default_loop (0);
47		47
48	// initialise an io watcher, then start it	48	// initialise an io watcher, then start it
49	// this one will watch for stdin to become readable	49	// this one will watch for stdin to become readable
50	ev_io_init (&stdin_watcher, stdin_cb, /STDIN_FILENO/ 0, EV_READ);	50	ev_io_init (&stdin_watcher, stdin_cb, /STDIN_FILENO/ 0, EV_READ);
51	ev_io_start (loop, &stdin_watcher);	51	ev_io_start (loop, &stdin_watcher);
52		52
53	// initialise a timer watcher, then start it	53	// initialise a timer watcher, then start it
54	// simple non-repeating 5.5 second timeout	54	// simple non-repeating 5.5 second timeout
55	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);	55	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
56	ev_timer_start (loop, &timeout_watcher);	56	ev_timer_start (loop, &timeout_watcher);
57		57
58	// now wait for events to arrive	58	// now wait for events to arrive
59	ev_loop (loop, 0);	59	ev_loop (loop, 0);
60		60
61	// unloop was called, so exit	61	// unloop was called, so exit
62	return 0;	62	return 0;
63	}	63	}
64		64
65	=head1 DESCRIPTION	65	=head1 DESCRIPTION
66		66
67	The newest version of this document is also available as an html-formatted	67	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	68	web page you might find easier to navigate when reading it for the first
…		…
178	not a problem.	178	not a problem.
179		179
180	Example: Make sure we haven't accidentally been linked against the wrong	180	Example: Make sure we haven't accidentally been linked against the wrong
181	version.	181	version.
182		182
183	assert (("libev version mismatch",	183	assert (("libev version mismatch",
184	ev_version_major () == EV_VERSION_MAJOR	184	ev_version_major () == EV_VERSION_MAJOR
185	&& ev_version_minor () >= EV_VERSION_MINOR));	185	&& ev_version_minor () >= EV_VERSION_MINOR));
186		186
187	=item unsigned int ev_supported_backends ()	187	=item unsigned int ev_supported_backends ()
188		188
189	Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>	189	Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
190	value) compiled into this binary of libev (independent of their	190	value) compiled into this binary of libev (independent of their
…		…
192	a description of the set values.	192	a description of the set values.
193		193
194	Example: make sure we have the epoll method, because yeah this is cool and	194	Example: make sure we have the epoll method, because yeah this is cool and
195	a must have and can we have a torrent of it please!!!11	195	a must have and can we have a torrent of it please!!!11
196		196
197	assert (("sorry, no epoll, no sex",	197	assert (("sorry, no epoll, no sex",
198	ev_supported_backends () & EVBACKEND_EPOLL));	198	ev_supported_backends () & EVBACKEND_EPOLL));
199		199
200	=item unsigned int ev_recommended_backends ()	200	=item unsigned int ev_recommended_backends ()
201		201
202	Return the set of all backends compiled into this binary of libev and also	202	Return the set of all backends compiled into this binary of libev and also
203	recommended for this platform. This set is often smaller than the one	203	recommended for this platform. This set is often smaller than the one
…		…
214	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	214	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
215	recommended ones.	215	recommended ones.
216		216
217	See the description of C<ev_embed> watchers for more info.	217	See the description of C<ev_embed> watchers for more info.
218		218
219	=item ev_set_allocator (void (cb)(void *ptr, long size))	219	=item ev_set_allocator (void (cb)(void *ptr, long size)) [NOT REENTRANT]
220		220
221	Sets the allocation function to use (the prototype is similar - the	221	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	222	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	223	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	224	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
250	}	250	}
251		251
252	...	252	...
253	ev_set_allocator (persistent_realloc);	253	ev_set_allocator (persistent_realloc);
254		254
255	=item ev_set_syserr_cb (void (cb)(const char msg));	255	=item ev_set_syserr_cb (void (cb)(const char msg)); [NOT REENTRANT]
256		256
257	Set the callback function to call on a retryable system call error (such	257	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	258	as failed select, poll, epoll_wait). The message is a printable string
259	indicating the system call or subsystem causing the problem. If this	259	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	260	callback is set, then libev will expect it to remedy the situation, no
…		…
359	writing a server, you should C<accept ()> in a loop to accept as many	359	writing a server, you should C<accept ()> in a loop to accept as many
360	connections as possible during one iteration. You might also want to have	360	connections as possible during one iteration. You might also want to have
361	a look at C<ev_set_io_collect_interval ()> to increase the amount of	361	a look at C<ev_set_io_collect_interval ()> to increase the amount of
362	readiness notifications you get per iteration.	362	readiness notifications you get per iteration.
363		363
		364	This backend maps C<EV_READ> to the C<readfds> set and C<EV_WRITE> to the
		365	C<writefds> set (and to work around Microsoft Windows bugs, also onto the
		366	C<exceptfds> set on that platform).
		367
364	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)	368	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
365		369
366	And this is your standard poll(2) backend. It's more complicated	370	And this is your standard poll(2) backend. It's more complicated
367	than select, but handles sparse fds better and has no artificial	371	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	372	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,	373	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	374	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
371	performance tips.	375	performance tips.
		376
		377	This backend maps C<EV_READ> to C<POLLIN \| POLLERR \| POLLHUP>, and
		378	C<EV_WRITE> to C<POLLOUT \| POLLERR \| POLLHUP>.
372		379
373	=item C<EVBACKEND_EPOLL> (value 4, Linux)	380	=item C<EVBACKEND_EPOLL> (value 4, Linux)
374		381
375	For few fds, this backend is a bit little slower than poll and select,	382	For few fds, this backend is a bit little slower than poll and select,
376	but it scales phenomenally better. While poll and select usually scale	383	but it scales phenomenally better. While poll and select usually scale
…		…
389	Please note that epoll sometimes generates spurious notifications, so you	396	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	397	need to use non-blocking I/O or other means to avoid blocking when no data
391	(or space) is available.	398	(or space) is available.
392		399
393	Best performance from this backend is achieved by not unregistering all	400	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.	401	watchers for a file descriptor until it has been closed, if possible,
395	keep at least one watcher active per fd at all times.	402	i.e. keep at least one watcher active per fd at all times. Stopping and
		403	starting a watcher (without re-setting it) also usually doesn't cause
		404	extra overhead.
396		405
397	While nominally embeddable in other event loops, this feature is broken in	406	While nominally embeddable in other event loops, this feature is broken in
398	all kernel versions tested so far.	407	all kernel versions tested so far.
399		408
		409	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		410	C<EVBACKEND_POLL>.
		411
400	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	412	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
401		413
402	Kqueue deserves special mention, as at the time of this writing, it	414	Kqueue deserves special mention, as at the time of this writing, it was
403	was broken on all BSDs except NetBSD (usually it doesn't work reliably	415	broken on all BSDs except NetBSD (usually it doesn't work reliably with
404	with anything but sockets and pipes, except on Darwin, where of course	416	anything but sockets and pipes, except on Darwin, where of course it's
405	it's completely useless). For this reason it's not being "auto-detected"	417	completely useless). For this reason it's not being "auto-detected" unless
406	unless you explicitly specify it explicitly in the flags (i.e. using	418	you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or
407	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)	419	libev was compiled on a known-to-be-good (-enough) system like NetBSD.
408	system like NetBSD.
409		420
410	You still can embed kqueue into a normal poll or select backend and use it	421	You still can embed kqueue into a normal poll or select backend and use it
411	only for sockets (after having made sure that sockets work with kqueue on	422	only for sockets (after having made sure that sockets work with kqueue on
412	the target platform). See C<ev_embed> watchers for more info.	423	the target platform). See C<ev_embed> watchers for more info.
413		424
414	It scales in the same way as the epoll backend, but the interface to the	425	It scales in the same way as the epoll backend, but the interface to the
415	kernel is more efficient (which says nothing about its actual speed, of	426	kernel is more efficient (which says nothing about its actual speed, of
416	course). While stopping, setting and starting an I/O watcher does never	427	course). While stopping, setting and starting an I/O watcher does never
417	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	428	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
418	two event changes per incident, support for C<fork ()> is very bad and it	429	two event changes per incident. Support for C<fork ()> is very bad and it
419	drops fds silently in similarly hard-to-detect cases.	430	drops fds silently in similarly hard-to-detect cases.
420		431
421	This backend usually performs well under most conditions.	432	This backend usually performs well under most conditions.
422		433
423	While nominally embeddable in other event loops, this doesn't work	434	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	435	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	436	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	437	(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	438	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and, did I mention it,
428	sockets.	439	using it only for sockets.
		440
		441	This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
		442	C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
		443	C<NOTE_EOF>.
429		444
430	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)	445	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
431		446
432	This is not implemented yet (and might never be, unless you send me an	447	This is not implemented yet (and might never be, unless you send me an
433	implementation). According to reports, C</dev/poll> only supports sockets	448	implementation). According to reports, C</dev/poll> only supports sockets
…		…
446	While this backend scales well, it requires one system call per active	461	While this backend scales well, it requires one system call per active
447	file descriptor per loop iteration. For small and medium numbers of file	462	file descriptor per loop iteration. For small and medium numbers of file
448	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	463	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
449	might perform better.	464	might perform better.
450		465
451	On the positive side, ignoring the spurious readiness notifications, this	466	On the positive side, with the exception of the spurious readiness
452	backend actually performed to specification in all tests and is fully	467	notifications, this backend actually performed fully to specification
453	embeddable, which is a rare feat among the OS-specific backends.	468	in all tests and is fully embeddable, which is a rare feat among the
		469	OS-specific backends.
		470
		471	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
		472	C<EVBACKEND_POLL>.
454		473
455	=item C<EVBACKEND_ALL>	474	=item C<EVBACKEND_ALL>
456		475
457	Try all backends (even potentially broken ones that wouldn't be tried	476	Try all backends (even potentially broken ones that wouldn't be tried
458	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	477	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
…		…
464		483
465	If one or more of these are or'ed into the flags value, then only these	484	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	485	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.	486	specified, all backends in C<ev_recommended_backends ()> will be tried.
468		487
469	The most typical usage is like this:	488	Example: This is the most typical usage.
470		489
471	if (!ev_default_loop (0))	490	if (!ev_default_loop (0))
472	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	491	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
473		492
474	Restrict libev to the select and poll backends, and do not allow	493	Example: Restrict libev to the select and poll backends, and do not allow
475	environment settings to be taken into account:	494	environment settings to be taken into account:
476		495
477	ev_default_loop (EVBACKEND_POLL \| EVBACKEND_SELECT \| EVFLAG_NOENV);	496	ev_default_loop (EVBACKEND_POLL \| EVBACKEND_SELECT \| EVFLAG_NOENV);
478		497
479	Use whatever libev has to offer, but make sure that kqueue is used if	498	Example: Use whatever libev has to offer, but make sure that kqueue is
480	available (warning, breaks stuff, best use only with your own private	499	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):	500	private event loop and only if you know the OS supports your types of
		501	fds):
482		502
483	ev_default_loop (ev_recommended_backends () \| EVBACKEND_KQUEUE);	503	ev_default_loop (ev_recommended_backends () \| EVBACKEND_KQUEUE);
484		504
485	=item struct ev_loop *ev_loop_new (unsigned int flags)	505	=item struct ev_loop *ev_loop_new (unsigned int flags)
486		506
487	Similar to C<ev_default_loop>, but always creates a new event loop that is	507	Similar to C<ev_default_loop>, but always creates a new event loop that is
488	always distinct from the default loop. Unlike the default loop, it cannot	508	always distinct from the default loop. Unlike the default loop, it cannot
…		…
493	libev with threads is indeed to create one loop per thread, and using the	513	libev with threads is indeed to create one loop per thread, and using the
494	default loop in the "main" or "initial" thread.	514	default loop in the "main" or "initial" thread.
495		515
496	Example: Try to create a event loop that uses epoll and nothing else.	516	Example: Try to create a event loop that uses epoll and nothing else.
497		517
498	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL \| EVFLAG_NOENV);	518	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL \| EVFLAG_NOENV);
499	if (!epoller)	519	if (!epoller)
500	fatal ("no epoll found here, maybe it hides under your chair");	520	fatal ("no epoll found here, maybe it hides under your chair");
501		521
502	=item ev_default_destroy ()	522	=item ev_default_destroy ()
503		523
504	Destroys the default loop again (frees all memory and kernel state	524	Destroys the default loop again (frees all memory and kernel state
505	etc.). None of the active event watchers will be stopped in the normal	525	etc.). None of the active event watchers will be stopped in the normal
…		…
544		564
545	=item ev_loop_fork (loop)	565	=item ev_loop_fork (loop)
546		566
547	Like C<ev_default_fork>, but acts on an event loop created by	567	Like C<ev_default_fork>, but acts on an event loop created by
548	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	568	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
549	after fork, and how you do this is entirely your own problem.	569	after fork that you want to re-use in the child, and how you do this is
		570	entirely your own problem.
550		571
551	=item int ev_is_default_loop (loop)	572	=item int ev_is_default_loop (loop)
552		573
553	Returns true when the given loop actually is the default loop, false otherwise.	574	Returns true when the given loop is, in fact, the default loop, and false
		575	otherwise.
554		576
555	=item unsigned int ev_loop_count (loop)	577	=item unsigned int ev_loop_count (loop)
556		578
557	Returns the count of loop iterations for the loop, which is identical to	579	Returns the count of loop iterations for the loop, which is identical to
558	the number of times libev did poll for new events. It starts at C<0> and	580	the number of times libev did poll for new events. It starts at C<0> and
…		…
573	received events and started processing them. This timestamp does not	595	received events and started processing them. This timestamp does not
574	change as long as callbacks are being processed, and this is also the base	596	change as long as callbacks are being processed, and this is also the base
575	time used for relative timers. You can treat it as the timestamp of the	597	time used for relative timers. You can treat it as the timestamp of the
576	event occurring (or more correctly, libev finding out about it).	598	event occurring (or more correctly, libev finding out about it).
577		599
		600	=item ev_now_update (loop)
		601
		602	Establishes the current time by querying the kernel, updating the time
		603	returned by C<ev_now ()> in the progress. This is a costly operation and
		604	is usually done automatically within C<ev_loop ()>.
		605
		606	This function is rarely useful, but when some event callback runs for a
		607	very long time without entering the event loop, updating libev's idea of
		608	the current time is a good idea.
		609
		610	See also "The special problem of time updates" in the C<ev_timer> section.
		611
578	=item ev_loop (loop, int flags)	612	=item ev_loop (loop, int flags)
579		613
580	Finally, this is it, the event handler. This function usually is called	614	Finally, this is it, the event handler. This function usually is called
581	after you initialised all your watchers and you want to start handling	615	after you initialised all your watchers and you want to start handling
582	events.	616	events.
…		…
584	If the flags argument is specified as C<0>, it will not return until	618	If the flags argument is specified as C<0>, it will not return until
585	either no event watchers are active anymore or C<ev_unloop> was called.	619	either no event watchers are active anymore or C<ev_unloop> was called.
586		620
587	Please note that an explicit C<ev_unloop> is usually better than	621	Please note that an explicit C<ev_unloop> is usually better than
588	relying on all watchers to be stopped when deciding when a program has	622	relying on all watchers to be stopped when deciding when a program has
589	finished (especially in interactive programs), but having a program that	623	finished (especially in interactive programs), but having a program
590	automatically loops as long as it has to and no longer by virtue of	624	that automatically loops as long as it has to and no longer by virtue
591	relying on its watchers stopping correctly is a thing of beauty.	625	of relying on its watchers stopping correctly, that is truly a thing of
		626	beauty.
592		627
593	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle	628	A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
594	those events and any outstanding ones, but will not block your process in	629	those events and any already outstanding ones, but will not block your
595	case there are no events and will return after one iteration of the loop.	630	process in case there are no events and will return after one iteration of
		631	the loop.
596		632
597	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if	633	A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
598	necessary) and will handle those and any outstanding ones. It will block	634	necessary) and will handle those and any already outstanding ones. It
599	your process until at least one new event arrives, and will return after	635	will block your process until at least one new event arrives (which could
600	one iteration of the loop. This is useful if you are waiting for some	636	be an event internal to libev itself, so there is no guarentee that a
601	external event in conjunction with something not expressible using other	637	user-registered callback will be called), and will return after one
		638	iteration of the loop.
		639
		640	This is useful if you are waiting for some external event in conjunction
		641	with something not expressible using other libev watchers (i.e. "roll your
602	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	642	own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
603	usually a better approach for this kind of thing.	643	usually a better approach for this kind of thing.
604		644
605	Here are the gory details of what C<ev_loop> does:	645	Here are the gory details of what C<ev_loop> does:
606		646
607	- Before the first iteration, call any pending watchers.	647	- Before the first iteration, call any pending watchers.
608	* If EVFLAG_FORKCHECK was used, check for a fork.	648	* If EVFLAG_FORKCHECK was used, check for a fork.
609	- If a fork was detected, queue and call all fork watchers.	649	- If a fork was detected (by any means), queue and call all fork watchers.
610	- Queue and call all prepare watchers.	650	- Queue and call all prepare watchers.
611	- If we have been forked, recreate the kernel state.	651	- If we have been forked, detach and recreate the kernel state
		652	as to not disturb the other process.
612	- Update the kernel state with all outstanding changes.	653	- Update the kernel state with all outstanding changes.
613	- Update the "event loop time".	654	- Update the "event loop time" (ev_now ()).
614	- Calculate for how long to sleep or block, if at all	655	- Calculate for how long to sleep or block, if at all
615	(active idle watchers, EVLOOP_NONBLOCK or not having	656	(active idle watchers, EVLOOP_NONBLOCK or not having
616	any active watchers at all will result in not sleeping).	657	any active watchers at all will result in not sleeping).
617	- Sleep if the I/O and timer collect interval say so.	658	- Sleep if the I/O and timer collect interval say so.
618	- Block the process, waiting for any events.	659	- Block the process, waiting for any events.
619	- Queue all outstanding I/O (fd) events.	660	- Queue all outstanding I/O (fd) events.
620	- Update the "event loop time" and do time jump handling.	661	- Update the "event loop time" (ev_now ()), and do time jump adjustments.
621	- Queue all outstanding timers.	662	- Queue all expired timers.
622	- Queue all outstanding periodics.	663	- Queue all expired periodics.
623	- If no events are pending now, queue all idle watchers.	664	- Unless any events are pending now, queue all idle watchers.
624	- Queue all check watchers.	665	- Queue all check watchers.
625	- Call all queued watchers in reverse order (i.e. check watchers first).	666	- Call all queued watchers in reverse order (i.e. check watchers first).
626	Signals and child watchers are implemented as I/O watchers, and will	667	Signals and child watchers are implemented as I/O watchers, and will
627	be handled here by queueing them when their watcher gets executed.	668	be handled here by queueing them when their watcher gets executed.
628	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	669	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
…		…
633	anymore.	674	anymore.
634		675
635	... queue jobs here, make sure they register event watchers as long	676	... queue jobs here, make sure they register event watchers as long
636	... as they still have work to do (even an idle watcher will do..)	677	... as they still have work to do (even an idle watcher will do..)
637	ev_loop (my_loop, 0);	678	ev_loop (my_loop, 0);
638	... jobs done. yeah!	679	... jobs done or somebody called unloop. yeah!
639		680
640	=item ev_unloop (loop, how)	681	=item ev_unloop (loop, how)
641		682
642	Can be used to make a call to C<ev_loop> return early (but only after it	683	Can be used to make a call to C<ev_loop> return early (but only after it
643	has processed all outstanding events). The C<how> argument must be either	684	has processed all outstanding events). The C<how> argument must be either
644	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	685	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
645	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	686	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
646		687
647	This "unloop state" will be cleared when entering C<ev_loop> again.	688	This "unloop state" will be cleared when entering C<ev_loop> again.
648		689
		690	It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls.
		691
649	=item ev_ref (loop)	692	=item ev_ref (loop)
650		693
651	=item ev_unref (loop)	694	=item ev_unref (loop)
652		695
653	Ref/unref can be used to add or remove a reference count on the event	696	Ref/unref can be used to add or remove a reference count on the event
654	loop: Every watcher keeps one reference, and as long as the reference	697	loop: Every watcher keeps one reference, and as long as the reference
655	count is nonzero, C<ev_loop> will not return on its own. If you have	698	count is nonzero, C<ev_loop> will not return on its own.
		699
656	a watcher you never unregister that should not keep C<ev_loop> from	700	If you have a watcher you never unregister that should not keep C<ev_loop>
657	returning, ev_unref() after starting, and ev_ref() before stopping it. For	701	from returning, call ev_unref() after starting, and ev_ref() before
		702	stopping it.
		703
658	example, libev itself uses this for its internal signal pipe: It is not	704	As an example, libev itself uses this for its internal signal pipe: It is
659	visible to the libev user and should not keep C<ev_loop> from exiting if	705	not visible to the libev user and should not keep C<ev_loop> from exiting
660	no event watchers registered by it are active. It is also an excellent	706	if no event watchers registered by it are active. It is also an excellent
661	way to do this for generic recurring timers or from within third-party	707	way to do this for generic recurring timers or from within third-party
662	libraries. Just remember to I<unref after start> and I<ref before stop>	708	libraries. Just remember to I<unref after start> and I<ref before stop>
663	(but only if the watcher wasn't active before, or was active before,	709	(but only if the watcher wasn't active before, or was active before,
664	respectively).	710	respectively).
665		711
666	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	712	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
667	running when nothing else is active.	713	running when nothing else is active.
668		714
669	struct ev_signal exitsig;	715	struct ev_signal exitsig;
670	ev_signal_init (&exitsig, sig_cb, SIGINT);	716	ev_signal_init (&exitsig, sig_cb, SIGINT);
671	ev_signal_start (loop, &exitsig);	717	ev_signal_start (loop, &exitsig);
672	evf_unref (loop);	718	evf_unref (loop);
673		719
674	Example: For some weird reason, unregister the above signal handler again.	720	Example: For some weird reason, unregister the above signal handler again.
675		721
676	ev_ref (loop);	722	ev_ref (loop);
677	ev_signal_stop (loop, &exitsig);	723	ev_signal_stop (loop, &exitsig);
678		724
679	=item ev_set_io_collect_interval (loop, ev_tstamp interval)	725	=item ev_set_io_collect_interval (loop, ev_tstamp interval)
680		726
681	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)	727	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
682		728
683	These advanced functions influence the time that libev will spend waiting	729	These advanced functions influence the time that libev will spend waiting
684	for events. Both are by default C<0>, meaning that libev will try to	730	for events. Both time intervals are by default C<0>, meaning that libev
685	invoke timer/periodic callbacks and I/O callbacks with minimum latency.	731	will try to invoke timer/periodic callbacks and I/O callbacks with minimum
		732	latency.
686		733
687	Setting these to a higher value (the C<interval> I<must> be >= C<0>)	734	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
688	allows libev to delay invocation of I/O and timer/periodic callbacks to	735	allows libev to delay invocation of I/O and timer/periodic callbacks
689	increase efficiency of loop iterations.	736	to increase efficiency of loop iterations (or to increase power-saving
		737	opportunities).
690		738
691	The background is that sometimes your program runs just fast enough to	739	The idea is that sometimes your program runs just fast enough to handle
692	handle one (or very few) event(s) per loop iteration. While this makes	740	one (or very few) event(s) per loop iteration. While this makes the
693	the program responsive, it also wastes a lot of CPU time to poll for new	741	program responsive, it also wastes a lot of CPU time to poll for new
694	events, especially with backends like C<select ()> which have a high	742	events, especially with backends like C<select ()> which have a high
695	overhead for the actual polling but can deliver many events at once.	743	overhead for the actual polling but can deliver many events at once.
696		744
697	By setting a higher I<io collect interval> you allow libev to spend more	745	By setting a higher I<io collect interval> you allow libev to spend more
698	time collecting I/O events, so you can handle more events per iteration,	746	time collecting I/O events, so you can handle more events per iteration,
…		…
700	C<ev_timer>) will be not affected. Setting this to a non-null value will	748	C<ev_timer>) will be not affected. Setting this to a non-null value will
701	introduce an additional C<ev_sleep ()> call into most loop iterations.	749	introduce an additional C<ev_sleep ()> call into most loop iterations.
702		750
703	Likewise, by setting a higher I<timeout collect interval> you allow libev	751	Likewise, by setting a higher I<timeout collect interval> you allow libev
704	to spend more time collecting timeouts, at the expense of increased	752	to spend more time collecting timeouts, at the expense of increased
705	latency (the watcher callback will be called later). C<ev_io> watchers	753	latency/jitter/inexactness (the watcher callback will be called
706	will not be affected. Setting this to a non-null value will not introduce	754	later). C<ev_io> watchers will not be affected. Setting this to a non-null
707	any overhead in libev.	755	value will not introduce any overhead in libev.
708		756
709	Many (busy) programs can usually benefit by setting the I/O collect	757	Many (busy) programs can usually benefit by setting the I/O collect
710	interval to a value near C<0.1> or so, which is often enough for	758	interval to a value near C<0.1> or so, which is often enough for
711	interactive servers (of course not for games), likewise for timeouts. It	759	interactive servers (of course not for games), likewise for timeouts. It
712	usually doesn't make much sense to set it to a lower value than C<0.01>,	760	usually doesn't make much sense to set it to a lower value than C<0.01>,
713	as this approaches the timing granularity of most systems.	761	as this approaches the timing granularity of most systems.
714		762
		763	Setting the I<timeout collect interval> can improve the opportunity for
		764	saving power, as the program will "bundle" timer callback invocations that
		765	are "near" in time together, by delaying some, thus reducing the number of
		766	times the process sleeps and wakes up again. Another useful technique to
		767	reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
		768	they fire on, say, one-second boundaries only.
		769
715	=item ev_loop_verify (loop)	770	=item ev_loop_verify (loop)
716		771
717	This function only does something when C<EV_VERIFY> support has been	772	This function only does something when C<EV_VERIFY> support has been
718	compiled in. It tries to go through all internal structures and checks	773	compiled in. which is the default for non-minimal builds. It tries to go
719	them for validity. If anything is found to be inconsistent, it will print	774	through all internal structures and checks them for validity. If anything
720	an error message to standard error and call C<abort ()>.	775	is found to be inconsistent, it will print an error message to standard
		776	error and call C<abort ()>.
721		777
722	This can be used to catch bugs inside libev itself: under normal	778	This can be used to catch bugs inside libev itself: under normal
723	circumstances, this function will never abort as of course libev keeps its	779	circumstances, this function will never abort as of course libev keeps its
724	data structures consistent.	780	data structures consistent.
725		781
…		…
730		786
731	A watcher is a structure that you create and register to record your	787	A watcher is a structure that you create and register to record your
732	interest in some event. For instance, if you want to wait for STDIN to	788	interest in some event. For instance, if you want to wait for STDIN to
733	become readable, you would create an C<ev_io> watcher for that:	789	become readable, you would create an C<ev_io> watcher for that:
734		790
735	static void my_cb (struct ev_loop loop, struct ev_io w, int revents)	791	static void my_cb (struct ev_loop loop, struct ev_io w, int revents)
736	{	792	{
737	ev_io_stop (w);	793	ev_io_stop (w);
738	ev_unloop (loop, EVUNLOOP_ALL);	794	ev_unloop (loop, EVUNLOOP_ALL);
739	}	795	}
740		796
741	struct ev_loop *loop = ev_default_loop (0);	797	struct ev_loop *loop = ev_default_loop (0);
742	struct ev_io stdin_watcher;	798	struct ev_io stdin_watcher;
743	ev_init (&stdin_watcher, my_cb);	799	ev_init (&stdin_watcher, my_cb);
744	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);	800	ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
745	ev_io_start (loop, &stdin_watcher);	801	ev_io_start (loop, &stdin_watcher);
746	ev_loop (loop, 0);	802	ev_loop (loop, 0);
747		803
748	As you can see, you are responsible for allocating the memory for your	804	As you can see, you are responsible for allocating the memory for your
749	watcher structures (and it is usually a bad idea to do this on the stack,	805	watcher structures (and it is usually a bad idea to do this on the stack,
750	although this can sometimes be quite valid).	806	although this can sometimes be quite valid).
751		807
…		…
841	happen because the watcher could not be properly started because libev	897	happen because the watcher could not be properly started because libev
842	ran out of memory, a file descriptor was found to be closed or any other	898	ran out of memory, a file descriptor was found to be closed or any other
843	problem. You best act on it by reporting the problem and somehow coping	899	problem. You best act on it by reporting the problem and somehow coping
844	with the watcher being stopped.	900	with the watcher being stopped.
845		901
846	Libev will usually signal a few "dummy" events together with an error,	902	Libev will usually signal a few "dummy" events together with an error, for
847	for example it might indicate that a fd is readable or writable, and if	903	example it might indicate that a fd is readable or writable, and if your
848	your callbacks is well-written it can just attempt the operation and cope	904	callbacks is well-written it can just attempt the operation and cope with
849	with the error from read() or write(). This will not work in multi-threaded	905	the error from read() or write(). This will not work in multi-threaded
850	programs, though, so beware.	906	programs, though, as the fd could already be closed and reused for another
		907	thing, so beware.
851		908
852	=back	909	=back
853		910
854	=head2 GENERIC WATCHER FUNCTIONS	911	=head2 GENERIC WATCHER FUNCTIONS
855		912
…		…
871	(or never started) and there are no pending events outstanding.	928	(or never started) and there are no pending events outstanding.
872		929
873	The callback is always of type C<void ()(ev_loop loop, ev_TYPE *watcher,	930	The callback is always of type C<void ()(ev_loop loop, ev_TYPE *watcher,
874	int revents)>.	931	int revents)>.
875		932
		933	Example: Initialise an C<ev_io> watcher in two steps.
		934
		935	ev_io w;
		936	ev_init (&w, my_cb);
		937	ev_io_set (&w, STDIN_FILENO, EV_READ);
		938
876	=item C<ev_TYPE_set> (ev_TYPE *, [args])	939	=item C<ev_TYPE_set> (ev_TYPE *, [args])
877		940
878	This macro initialises the type-specific parts of a watcher. You need to	941	This macro initialises the type-specific parts of a watcher. You need to
879	call C<ev_init> at least once before you call this macro, but you can	942	call C<ev_init> at least once before you call this macro, but you can
880	call C<ev_TYPE_set> any number of times. You must not, however, call this	943	call C<ev_TYPE_set> any number of times. You must not, however, call this
…		…
882	difference to the C<ev_init> macro).	945	difference to the C<ev_init> macro).
883		946
884	Although some watcher types do not have type-specific arguments	947	Although some watcher types do not have type-specific arguments
885	(e.g. C<ev_prepare>) you still need to call its C<set> macro.	948	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
886		949
		950	See C<ev_init>, above, for an example.
		951
887	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])	952	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
888		953
889	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro	954	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
890	calls into a single call. This is the most convenient method to initialise	955	calls into a single call. This is the most convenient method to initialise
891	a watcher. The same limitations apply, of course.	956	a watcher. The same limitations apply, of course.
892		957
		958	Example: Initialise and set an C<ev_io> watcher in one step.
		959
		960	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
		961
893	=item C<ev_TYPE_start> (loop , ev_TYPE watcher)	962	=item C<ev_TYPE_start> (loop , ev_TYPE watcher)
894		963
895	Starts (activates) the given watcher. Only active watchers will receive	964	Starts (activates) the given watcher. Only active watchers will receive
896	events. If the watcher is already active nothing will happen.	965	events. If the watcher is already active nothing will happen.
897		966
		967	Example: Start the C<ev_io> watcher that is being abused as example in this
		968	whole section.
		969
		970	ev_io_start (EV_DEFAULT_UC, &w);
		971
898	=item C<ev_TYPE_stop> (loop , ev_TYPE watcher)	972	=item C<ev_TYPE_stop> (loop , ev_TYPE watcher)
899		973
900	Stops the given watcher again (if active) and clears the pending	974	Stops the given watcher if active, and clears the pending status (whether
		975	the watcher was active or not).
		976
901	status. It is possible that stopped watchers are pending (for example,	977	It is possible that stopped watchers are pending - for example,
902	non-repeating timers are being stopped when they become pending), but	978	non-repeating timers are being stopped when they become pending - but
903	C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If	979	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
904	you want to free or reuse the memory used by the watcher it is therefore a	980	pending. If you want to free or reuse the memory used by the watcher it is
905	good idea to always call its C<ev_TYPE_stop> function.	981	therefore a good idea to always call its C<ev_TYPE_stop> function.
906		982
907	=item bool ev_is_active (ev_TYPE *watcher)	983	=item bool ev_is_active (ev_TYPE *watcher)
908		984
909	Returns a true value iff the watcher is active (i.e. it has been started	985	Returns a true value iff the watcher is active (i.e. it has been started
910	and not yet been stopped). As long as a watcher is active you must not modify	986	and not yet been stopped). As long as a watcher is active you must not modify
…		…
958		1034
959	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1035	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
960		1036
961	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1037	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
962	C<loop> nor C<revents> need to be valid as long as the watcher callback	1038	C<loop> nor C<revents> need to be valid as long as the watcher callback
963	can deal with that fact.	1039	can deal with that fact, as both are simply passed through to the
		1040	callback.
964		1041
965	=item int ev_clear_pending (loop, ev_TYPE *watcher)	1042	=item int ev_clear_pending (loop, ev_TYPE *watcher)
966		1043
967	If the watcher is pending, this function returns clears its pending status	1044	If the watcher is pending, this function clears its pending status and
968	and returns its C<revents> bitset (as if its callback was invoked). If the	1045	returns its C<revents> bitset (as if its callback was invoked). If the
969	watcher isn't pending it does nothing and returns C<0>.	1046	watcher isn't pending it does nothing and returns C<0>.
970		1047
		1048	Sometimes it can be useful to "poll" a watcher instead of waiting for its
		1049	callback to be invoked, which can be accomplished with this function.
		1050
971	=back	1051	=back
972		1052
973		1053
974	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1054	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
975		1055
976	Each watcher has, by default, a member C<void *data> that you can change	1056	Each watcher has, by default, a member C<void *data> that you can change
977	and read at any time, libev will completely ignore it. This can be used	1057	and read at any time: libev will completely ignore it. This can be used
978	to associate arbitrary data with your watcher. If you need more data and	1058	to associate arbitrary data with your watcher. If you need more data and
979	don't want to allocate memory and store a pointer to it in that data	1059	don't want to allocate memory and store a pointer to it in that data
980	member, you can also "subclass" the watcher type and provide your own	1060	member, you can also "subclass" the watcher type and provide your own
981	data:	1061	data:
982		1062
983	struct my_io	1063	struct my_io
984	{	1064	{
985	struct ev_io io;	1065	struct ev_io io;
986	int otherfd;	1066	int otherfd;
987	void *somedata;	1067	void *somedata;
988	struct whatever *mostinteresting;	1068	struct whatever *mostinteresting;
989	}	1069	};
		1070
		1071	...
		1072	struct my_io w;
		1073	ev_io_init (&w.io, my_cb, fd, EV_READ);
990		1074
991	And since your callback will be called with a pointer to the watcher, you	1075	And since your callback will be called with a pointer to the watcher, you
992	can cast it back to your own type:	1076	can cast it back to your own type:
993		1077
994	static void my_cb (struct ev_loop loop, struct ev_io w_, int revents)	1078	static void my_cb (struct ev_loop loop, struct ev_io w_, int revents)
995	{	1079	{
996	struct my_io w = (struct my_io )w_;	1080	struct my_io w = (struct my_io )w_;
997	...	1081	...
998	}	1082	}
999		1083
1000	More interesting and less C-conformant ways of casting your callback type	1084	More interesting and less C-conformant ways of casting your callback type
1001	instead have been omitted.	1085	instead have been omitted.
1002		1086
1003	Another common scenario is having some data structure with multiple	1087	Another common scenario is to use some data structure with multiple
1004	watchers:	1088	embedded watchers:
1005		1089
1006	struct my_biggy	1090	struct my_biggy
1007	{	1091	{
1008	int some_data;	1092	int some_data;
1009	ev_timer t1;	1093	ev_timer t1;
1010	ev_timer t2;	1094	ev_timer t2;
1011	}	1095	}
1012		1096
1013	In this case getting the pointer to C<my_biggy> is a bit more complicated,	1097	In this case getting the pointer to C<my_biggy> is a bit more
1014	you need to use C<offsetof>:	1098	complicated: Either you store the address of your C<my_biggy> struct
		1099	in the C<data> member of the watcher (for woozies), or you need to use
		1100	some pointer arithmetic using C<offsetof> inside your watchers (for real
		1101	programmers):
1015		1102
1016	#include <stddef.h>	1103	#include <stddef.h>
1017		1104
1018	static void	1105	static void
1019	t1_cb (EV_P_ struct ev_timer *w, int revents)	1106	t1_cb (EV_P_ struct ev_timer *w, int revents)
1020	{	1107	{
1021	struct my_biggy big = (struct my_biggy *	1108	struct my_biggy big = (struct my_biggy *
1022	(((char *)w) - offsetof (struct my_biggy, t1));	1109	(((char *)w) - offsetof (struct my_biggy, t1));
1023	}	1110	}
1024		1111
1025	static void	1112	static void
1026	t2_cb (EV_P_ struct ev_timer *w, int revents)	1113	t2_cb (EV_P_ struct ev_timer *w, int revents)
1027	{	1114	{
1028	struct my_biggy big = (struct my_biggy *	1115	struct my_biggy big = (struct my_biggy *
1029	(((char *)w) - offsetof (struct my_biggy, t2));	1116	(((char *)w) - offsetof (struct my_biggy, t2));
1030	}	1117	}
1031		1118
1032		1119
1033	=head1 WATCHER TYPES	1120	=head1 WATCHER TYPES
1034		1121
1035	This section describes each watcher in detail, but will not repeat	1122	This section describes each watcher in detail, but will not repeat
…		…
1059	In general you can register as many read and/or write event watchers per	1146	In general you can register as many read and/or write event watchers per
1060	fd as you want (as long as you don't confuse yourself). Setting all file	1147	fd as you want (as long as you don't confuse yourself). Setting all file
1061	descriptors to non-blocking mode is also usually a good idea (but not	1148	descriptors to non-blocking mode is also usually a good idea (but not
1062	required if you know what you are doing).	1149	required if you know what you are doing).
1063		1150
1064	If you must do this, then force the use of a known-to-be-good backend	1151	If you cannot use non-blocking mode, then force the use of a
1065	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and	1152	known-to-be-good backend (at the time of this writing, this includes only
1066	C<EVBACKEND_POLL>).	1153	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>).
1067		1154
1068	Another thing you have to watch out for is that it is quite easy to	1155	Another thing you have to watch out for is that it is quite easy to
1069	receive "spurious" readiness notifications, that is your callback might	1156	receive "spurious" readiness notifications, that is your callback might
1070	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1157	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1071	because there is no data. Not only are some backends known to create a	1158	because there is no data. Not only are some backends known to create a
1072	lot of those (for example Solaris ports), it is very easy to get into	1159	lot of those (for example Solaris ports), it is very easy to get into
1073	this situation even with a relatively standard program structure. Thus	1160	this situation even with a relatively standard program structure. Thus
1074	it is best to always use non-blocking I/O: An extra C<read>(2) returning	1161	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1075	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1162	C<EAGAIN> is far preferable to a program hanging until some data arrives.
1076		1163
1077	If you cannot run the fd in non-blocking mode (for example you should not	1164	If you cannot run the fd in non-blocking mode (for example you should
1078	play around with an Xlib connection), then you have to separately re-test	1165	not play around with an Xlib connection), then you have to separately
1079	whether a file descriptor is really ready with a known-to-be good interface	1166	re-test whether a file descriptor is really ready with a known-to-be good
1080	such as poll (fortunately in our Xlib example, Xlib already does this on	1167	interface such as poll (fortunately in our Xlib example, Xlib already
1081	its own, so its quite safe to use).	1168	does this on its own, so its quite safe to use). Some people additionally
		1169	use C<SIGALRM> and an interval timer, just to be sure you won't block
		1170	indefinitely.
		1171
		1172	But really, best use non-blocking mode.
1082		1173
1083	=head3 The special problem of disappearing file descriptors	1174	=head3 The special problem of disappearing file descriptors
1084		1175
1085	Some backends (e.g. kqueue, epoll) need to be told about closing a file	1176	Some backends (e.g. kqueue, epoll) need to be told about closing a file
1086	descriptor (either by calling C<close> explicitly or by any other means,	1177	descriptor (either due to calling C<close> explicitly or any other means,
1087	such as C<dup>). The reason is that you register interest in some file	1178	such as C<dup2>). The reason is that you register interest in some file
1088	descriptor, but when it goes away, the operating system will silently drop	1179	descriptor, but when it goes away, the operating system will silently drop
1089	this interest. If another file descriptor with the same number then is	1180	this interest. If another file descriptor with the same number then is
1090	registered with libev, there is no efficient way to see that this is, in	1181	registered with libev, there is no efficient way to see that this is, in
1091	fact, a different file descriptor.	1182	fact, a different file descriptor.
1092		1183
…		…
1123	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1214	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1124	C<EVBACKEND_POLL>.	1215	C<EVBACKEND_POLL>.
1125		1216
1126	=head3 The special problem of SIGPIPE	1217	=head3 The special problem of SIGPIPE
1127		1218
1128	While not really specific to libev, it is easy to forget about SIGPIPE:	1219	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1129	when reading from a pipe whose other end has been closed, your program	1220	when writing to a pipe whose other end has been closed, your program gets
1130	gets send a SIGPIPE, which, by default, aborts your program. For most	1221	sent a SIGPIPE, which, by default, aborts your program. For most programs
1131	programs this is sensible behaviour, for daemons, this is usually	1222	this is sensible behaviour, for daemons, this is usually undesirable.
1132	undesirable.
1133		1223
1134	So when you encounter spurious, unexplained daemon exits, make sure you	1224	So when you encounter spurious, unexplained daemon exits, make sure you
1135	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon	1225	ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1136	somewhere, as that would have given you a big clue).	1226	somewhere, as that would have given you a big clue).
1137		1227
…		…
1143	=item ev_io_init (ev_io *, callback, int fd, int events)	1233	=item ev_io_init (ev_io *, callback, int fd, int events)
1144		1234
1145	=item ev_io_set (ev_io *, int fd, int events)	1235	=item ev_io_set (ev_io *, int fd, int events)
1146		1236
1147	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to	1237	Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1148	receive events for and events is either C<EV_READ>, C<EV_WRITE> or	1238	receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or
1149	C<EV_READ \| EV_WRITE> to receive the given events.	1239	C<EV_READ \| EV_WRITE>, to express the desire to receive the given events.
1150		1240
1151	=item int fd [read-only]	1241	=item int fd [read-only]
1152		1242
1153	The file descriptor being watched.	1243	The file descriptor being watched.
1154		1244
…		…
1162		1252
1163	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well	1253	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1164	readable, but only once. Since it is likely line-buffered, you could	1254	readable, but only once. Since it is likely line-buffered, you could
1165	attempt to read a whole line in the callback.	1255	attempt to read a whole line in the callback.
1166		1256
1167	static void	1257	static void
1168	stdin_readable_cb (struct ev_loop loop, struct ev_io w, int revents)	1258	stdin_readable_cb (struct ev_loop loop, struct ev_io w, int revents)
1169	{	1259	{
1170	ev_io_stop (loop, w);	1260	ev_io_stop (loop, w);
1171	.. read from stdin here (or from w->fd) and haqndle any I/O errors	1261	.. read from stdin here (or from w->fd) and handle any I/O errors
1172	}	1262	}
1173		1263
1174	...	1264	...
1175	struct ev_loop *loop = ev_default_init (0);	1265	struct ev_loop *loop = ev_default_init (0);
1176	struct ev_io stdin_readable;	1266	struct ev_io stdin_readable;
1177	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);	1267	ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1178	ev_io_start (loop, &stdin_readable);	1268	ev_io_start (loop, &stdin_readable);
1179	ev_loop (loop, 0);	1269	ev_loop (loop, 0);
1180		1270
1181		1271
1182	=head2 C<ev_timer> - relative and optionally repeating timeouts	1272	=head2 C<ev_timer> - relative and optionally repeating timeouts
1183		1273
1184	Timer watchers are simple relative timers that generate an event after a	1274	Timer watchers are simple relative timers that generate an event after a
1185	given time, and optionally repeating in regular intervals after that.	1275	given time, and optionally repeating in regular intervals after that.
1186		1276
1187	The timers are based on real time, that is, if you register an event that	1277	The timers are based on real time, that is, if you register an event that
1188	times out after an hour and you reset your system clock to January last	1278	times out after an hour and you reset your system clock to January last
1189	year, it will still time out after (roughly) and hour. "Roughly" because	1279	year, it will still time out after (roughly) one hour. "Roughly" because
1190	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1280	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1191	monotonic clock option helps a lot here).	1281	monotonic clock option helps a lot here).
		1282
		1283	The callback is guaranteed to be invoked only I<after> its timeout has
		1284	passed, but if multiple timers become ready during the same loop iteration
		1285	then order of execution is undefined.
		1286
		1287	=head3 The special problem of time updates
		1288
		1289	Establishing the current time is a costly operation (it usually takes at
		1290	least two system calls): EV therefore updates its idea of the current
		1291	time only before and after C<ev_loop> collects new events, which causes a
		1292	growing difference between C<ev_now ()> and C<ev_time ()> when handling
		1293	lots of events in one iteration.
1192		1294
1193	The relative timeouts are calculated relative to the C<ev_now ()>	1295	The relative timeouts are calculated relative to the C<ev_now ()>
1194	time. This is usually the right thing as this timestamp refers to the time	1296	time. This is usually the right thing as this timestamp refers to the time
1195	of the event triggering whatever timeout you are modifying/starting. If	1297	of the event triggering whatever timeout you are modifying/starting. If
1196	you suspect event processing to be delayed and you I<need> to base the timeout	1298	you suspect event processing to be delayed and you I<need> to base the
1197	on the current time, use something like this to adjust for this:	1299	timeout on the current time, use something like this to adjust for this:
1198		1300
1199	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	1301	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1200		1302
1201	The callback is guaranteed to be invoked only after its timeout has passed,	1303	If the event loop is suspended for a long time, you can also force an
1202	but if multiple timers become ready during the same loop iteration then	1304	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1203	order of execution is undefined.	1305	()>.
1204		1306
1205	=head3 Watcher-Specific Functions and Data Members	1307	=head3 Watcher-Specific Functions and Data Members
1206		1308
1207	=over 4	1309	=over 4
1208		1310
…		…
1257	ev_timer_again (loop, timer);	1359	ev_timer_again (loop, timer);
1258		1360
1259	This is more slightly efficient then stopping/starting the timer each time	1361	This is more slightly efficient then stopping/starting the timer each time
1260	you want to modify its timeout value.	1362	you want to modify its timeout value.
1261		1363
		1364	Note, however, that it is often even more efficient to remember the
		1365	time of the last activity and let the timer time-out naturally. In the
		1366	callback, you then check whether the time-out is real, or, if there was
		1367	some activity, you reschedule the watcher to time-out in "last_activity +
		1368	timeout - ev_now ()" seconds.
		1369
1262	=item ev_tstamp repeat [read-write]	1370	=item ev_tstamp repeat [read-write]
1263		1371
1264	The current C<repeat> value. Will be used each time the watcher times out	1372	The current C<repeat> value. Will be used each time the watcher times out
1265	or C<ev_timer_again> is called and determines the next timeout (if any),	1373	or C<ev_timer_again> is called, and determines the next timeout (if any),
1266	which is also when any modifications are taken into account.	1374	which is also when any modifications are taken into account.
1267		1375
1268	=back	1376	=back
1269		1377
1270	=head3 Examples	1378	=head3 Examples
1271		1379
1272	Example: Create a timer that fires after 60 seconds.	1380	Example: Create a timer that fires after 60 seconds.
1273		1381
1274	static void	1382	static void
1275	one_minute_cb (struct ev_loop loop, struct ev_timer w, int revents)	1383	one_minute_cb (struct ev_loop loop, struct ev_timer w, int revents)
1276	{	1384	{
1277	.. one minute over, w is actually stopped right here	1385	.. one minute over, w is actually stopped right here
1278	}	1386	}
1279		1387
1280	struct ev_timer mytimer;	1388	struct ev_timer mytimer;
1281	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);	1389	ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1282	ev_timer_start (loop, &mytimer);	1390	ev_timer_start (loop, &mytimer);
1283		1391
1284	Example: Create a timeout timer that times out after 10 seconds of	1392	Example: Create a timeout timer that times out after 10 seconds of
1285	inactivity.	1393	inactivity.
1286		1394
1287	static void	1395	static void
1288	timeout_cb (struct ev_loop loop, struct ev_timer w, int revents)	1396	timeout_cb (struct ev_loop loop, struct ev_timer w, int revents)
1289	{	1397	{
1290	.. ten seconds without any activity	1398	.. ten seconds without any activity
1291	}	1399	}
1292		1400
1293	struct ev_timer mytimer;	1401	struct ev_timer mytimer;
1294	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */	1402	ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1295	ev_timer_again (&mytimer); /* start timer */	1403	ev_timer_again (&mytimer); /* start timer */
1296	ev_loop (loop, 0);	1404	ev_loop (loop, 0);
1297		1405
1298	// and in some piece of code that gets executed on any "activity":	1406	// and in some piece of code that gets executed on any "activity":
1299	// reset the timeout to start ticking again at 10 seconds	1407	// reset the timeout to start ticking again at 10 seconds
1300	ev_timer_again (&mytimer);	1408	ev_timer_again (&mytimer);
1301		1409
1302		1410
1303	=head2 C<ev_periodic> - to cron or not to cron?	1411	=head2 C<ev_periodic> - to cron or not to cron?
1304		1412
1305	Periodic watchers are also timers of a kind, but they are very versatile	1413	Periodic watchers are also timers of a kind, but they are very versatile
…		…
1314	to trigger the event (unlike an C<ev_timer>, which would still trigger	1422	to trigger the event (unlike an C<ev_timer>, which would still trigger
1315	roughly 10 seconds later as it uses a relative timeout).	1423	roughly 10 seconds later as it uses a relative timeout).
1316		1424
1317	C<ev_periodic>s can also be used to implement vastly more complex timers,	1425	C<ev_periodic>s can also be used to implement vastly more complex timers,
1318	such as triggering an event on each "midnight, local time", or other	1426	such as triggering an event on each "midnight, local time", or other
1319	complicated, rules.	1427	complicated rules.
1320		1428
1321	As with timers, the callback is guaranteed to be invoked only when the	1429	As with timers, the callback is guaranteed to be invoked only when the
1322	time (C<at>) has passed, but if multiple periodic timers become ready	1430	time (C<at>) has passed, but if multiple periodic timers become ready
1323	during the same loop iteration then order of execution is undefined.	1431	during the same loop iteration, then order of execution is undefined.
1324		1432
1325	=head3 Watcher-Specific Functions and Data Members	1433	=head3 Watcher-Specific Functions and Data Members
1326		1434
1327	=over 4	1435	=over 4
1328		1436
1329	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1437	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1330		1438
1331	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	1439	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1332		1440
1333	Lots of arguments, lets sort it out... There are basically three modes of	1441	Lots of arguments, lets sort it out... There are basically three modes of
1334	operation, and we will explain them from simplest to complex:	1442	operation, and we will explain them from simplest to most complex:
1335		1443
1336	=over 4	1444	=over 4
1337		1445
1338	=item * absolute timer (at = time, interval = reschedule_cb = 0)	1446	=item * absolute timer (at = time, interval = reschedule_cb = 0)
1339		1447
1340	In this configuration the watcher triggers an event after the wall clock	1448	In this configuration the watcher triggers an event after the wall clock
1341	time C<at> has passed and doesn't repeat. It will not adjust when a time	1449	time C<at> has passed. It will not repeat and will not adjust when a time
1342	jump occurs, that is, if it is to be run at January 1st 2011 then it will	1450	jump occurs, that is, if it is to be run at January 1st 2011 then it will
1343	run when the system time reaches or surpasses this time.	1451	only run when the system clock reaches or surpasses this time.
1344		1452
1345	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)	1453	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1346		1454
1347	In this mode the watcher will always be scheduled to time out at the next	1455	In this mode the watcher will always be scheduled to time out at the next
1348	C<at + N * interval> time (for some integer N, which can also be negative)	1456	C<at + N * interval> time (for some integer N, which can also be negative)
1349	and then repeat, regardless of any time jumps.	1457	and then repeat, regardless of any time jumps.
1350		1458
1351	This can be used to create timers that do not drift with respect to system	1459	This can be used to create timers that do not drift with respect to the
1352	time, for example, here is a C<ev_periodic> that triggers each hour, on	1460	system clock, for example, here is a C<ev_periodic> that triggers each
1353	the hour:	1461	hour, on the hour:
1354		1462
1355	ev_periodic_set (&periodic, 0., 3600., 0);	1463	ev_periodic_set (&periodic, 0., 3600., 0);
1356		1464
1357	This doesn't mean there will always be 3600 seconds in between triggers,	1465	This doesn't mean there will always be 3600 seconds in between triggers,
1358	but only that the callback will be called when the system time shows a	1466	but only that the callback will be called when the system time shows a
…		…
1445	=back	1553	=back
1446		1554
1447	=head3 Examples	1555	=head3 Examples
1448		1556
1449	Example: Call a callback every hour, or, more precisely, whenever the	1557	Example: Call a callback every hour, or, more precisely, whenever the
1450	system clock is divisible by 3600. The callback invocation times have	1558	system time is divisible by 3600. The callback invocation times have
1451	potentially a lot of jitter, but good long-term stability.	1559	potentially a lot of jitter, but good long-term stability.
1452		1560
1453	static void	1561	static void
1454	clock_cb (struct ev_loop loop, struct ev_io w, int revents)	1562	clock_cb (struct ev_loop loop, struct ev_io w, int revents)
1455	{	1563	{
1456	... its now a full hour (UTC, or TAI or whatever your clock follows)	1564	... its now a full hour (UTC, or TAI or whatever your clock follows)
1457	}	1565	}
1458		1566
1459	struct ev_periodic hourly_tick;	1567	struct ev_periodic hourly_tick;
1460	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);	1568	ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1461	ev_periodic_start (loop, &hourly_tick);	1569	ev_periodic_start (loop, &hourly_tick);
1462		1570
1463	Example: The same as above, but use a reschedule callback to do it:	1571	Example: The same as above, but use a reschedule callback to do it:
1464		1572
1465	#include <math.h>	1573	#include <math.h>
1466		1574
1467	static ev_tstamp	1575	static ev_tstamp
1468	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)	1576	my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1469	{	1577	{
1470	return fmod (now, 3600.) + 3600.;	1578	return now + (3600. - fmod (now, 3600.));
1471	}	1579	}
1472		1580
1473	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);	1581	ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1474		1582
1475	Example: Call a callback every hour, starting now:	1583	Example: Call a callback every hour, starting now:
1476		1584
1477	struct ev_periodic hourly_tick;	1585	struct ev_periodic hourly_tick;
1478	ev_periodic_init (&hourly_tick, clock_cb,	1586	ev_periodic_init (&hourly_tick, clock_cb,
1479	fmod (ev_now (loop), 3600.), 3600., 0);	1587	fmod (ev_now (loop), 3600.), 3600., 0);
1480	ev_periodic_start (loop, &hourly_tick);	1588	ev_periodic_start (loop, &hourly_tick);
1481		1589
1482		1590
1483	=head2 C<ev_signal> - signal me when a signal gets signalled!	1591	=head2 C<ev_signal> - signal me when a signal gets signalled!
1484		1592
1485	Signal watchers will trigger an event when the process receives a specific	1593	Signal watchers will trigger an event when the process receives a specific
1486	signal one or more times. Even though signals are very asynchronous, libev	1594	signal one or more times. Even though signals are very asynchronous, libev
1487	will try it's best to deliver signals synchronously, i.e. as part of the	1595	will try it's best to deliver signals synchronously, i.e. as part of the
1488	normal event processing, like any other event.	1596	normal event processing, like any other event.
1489		1597
		1598	If you want signals asynchronously, just use C<sigaction> as you would
		1599	do without libev and forget about sharing the signal. You can even use
		1600	C<ev_async> from a signal handler to synchronously wake up an event loop.
		1601
1490	You can configure as many watchers as you like per signal. Only when the	1602	You can configure as many watchers as you like per signal. Only when the
1491	first watcher gets started will libev actually register a signal watcher	1603	first watcher gets started will libev actually register a signal handler
1492	with the kernel (thus it coexists with your own signal handlers as long	1604	with the kernel (thus it coexists with your own signal handlers as long as
1493	as you don't register any with libev). Similarly, when the last signal	1605	you don't register any with libev for the same signal). Similarly, when
1494	watcher for a signal is stopped libev will reset the signal handler to	1606	the last signal watcher for a signal is stopped, libev will reset the
1495	SIG_DFL (regardless of what it was set to before).	1607	signal handler to SIG_DFL (regardless of what it was set to before).
1496		1608
1497	If possible and supported, libev will install its handlers with	1609	If possible and supported, libev will install its handlers with
1498	C<SA_RESTART> behaviour enabled, so system calls should not be unduly	1610	C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1499	interrupted. If you have a problem with system calls getting interrupted by	1611	interrupted. If you have a problem with system calls getting interrupted by
1500	signals you can block all signals in an C<ev_check> watcher and unblock	1612	signals you can block all signals in an C<ev_check> watcher and unblock
…		…
1517		1629
1518	=back	1630	=back
1519		1631
1520	=head3 Examples	1632	=head3 Examples
1521		1633
1522	Example: Try to exit cleanly on SIGINT and SIGTERM.	1634	Example: Try to exit cleanly on SIGINT.
1523		1635
1524	static void	1636	static void
1525	sigint_cb (struct ev_loop loop, struct ev_signal w, int revents)	1637	sigint_cb (struct ev_loop loop, struct ev_signal w, int revents)
1526	{	1638	{
1527	ev_unloop (loop, EVUNLOOP_ALL);	1639	ev_unloop (loop, EVUNLOOP_ALL);
1528	}	1640	}
1529		1641
1530	struct ev_signal signal_watcher;	1642	struct ev_signal signal_watcher;
1531	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	1643	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1532	ev_signal_start (loop, &sigint_cb);	1644	ev_signal_start (loop, &signal_watcher);
1533		1645
1534		1646
1535	=head2 C<ev_child> - watch out for process status changes	1647	=head2 C<ev_child> - watch out for process status changes
1536		1648
1537	Child watchers trigger when your process receives a SIGCHLD in response to	1649	Child watchers trigger when your process receives a SIGCHLD in response to
1538	some child status changes (most typically when a child of yours dies). It	1650	some child status changes (most typically when a child of yours dies or
1539	is permissible to install a child watcher I<after> the child has been	1651	exits). It is permissible to install a child watcher I<after> the child
1540	forked (which implies it might have already exited), as long as the event	1652	has been forked (which implies it might have already exited), as long
1541	loop isn't entered (or is continued from a watcher).	1653	as the event loop isn't entered (or is continued from a watcher), i.e.,
		1654	forking and then immediately registering a watcher for the child is fine,
		1655	but forking and registering a watcher a few event loop iterations later is
		1656	not.
1542		1657
1543	Only the default event loop is capable of handling signals, and therefore	1658	Only the default event loop is capable of handling signals, and therefore
1544	you can only register child watchers in the default event loop.	1659	you can only register child watchers in the default event loop.
1545		1660
1546	=head3 Process Interaction	1661	=head3 Process Interaction
…		…
1559	handler, you can override it easily by installing your own handler for	1674	handler, you can override it easily by installing your own handler for
1560	C<SIGCHLD> after initialising the default loop, and making sure the	1675	C<SIGCHLD> after initialising the default loop, and making sure the
1561	default loop never gets destroyed. You are encouraged, however, to use an	1676	default loop never gets destroyed. You are encouraged, however, to use an
1562	event-based approach to child reaping and thus use libev's support for	1677	event-based approach to child reaping and thus use libev's support for
1563	that, so other libev users can use C<ev_child> watchers freely.	1678	that, so other libev users can use C<ev_child> watchers freely.
		1679
		1680	=head3 Stopping the Child Watcher
		1681
		1682	Currently, the child watcher never gets stopped, even when the
		1683	child terminates, so normally one needs to stop the watcher in the
		1684	callback. Future versions of libev might stop the watcher automatically
		1685	when a child exit is detected.
1564		1686
1565	=head3 Watcher-Specific Functions and Data Members	1687	=head3 Watcher-Specific Functions and Data Members
1566		1688
1567	=over 4	1689	=over 4
1568		1690
…		…
1597	=head3 Examples	1719	=head3 Examples
1598		1720
1599	Example: C<fork()> a new process and install a child handler to wait for	1721	Example: C<fork()> a new process and install a child handler to wait for
1600	its completion.	1722	its completion.
1601		1723
1602	ev_child cw;	1724	ev_child cw;
1603		1725
1604	static void	1726	static void
1605	child_cb (EV_P_ struct ev_child *w, int revents)	1727	child_cb (EV_P_ struct ev_child *w, int revents)
1606	{	1728	{
1607	ev_child_stop (EV_A_ w);	1729	ev_child_stop (EV_A_ w);
1608	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);	1730	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1609	}	1731	}
1610		1732
1611	pid_t pid = fork ();	1733	pid_t pid = fork ();
1612		1734
1613	if (pid < 0)	1735	if (pid < 0)
1614	// error	1736	// error
1615	else if (pid == 0)	1737	else if (pid == 0)
1616	{	1738	{
1617	// the forked child executes here	1739	// the forked child executes here
1618	exit (1);	1740	exit (1);
1619	}	1741	}
1620	else	1742	else
1621	{	1743	{
1622	ev_child_init (&cw, child_cb, pid, 0);	1744	ev_child_init (&cw, child_cb, pid, 0);
1623	ev_child_start (EV_DEFAULT_ &cw);	1745	ev_child_start (EV_DEFAULT_ &cw);
1624	}	1746	}
1625		1747
1626		1748
1627	=head2 C<ev_stat> - did the file attributes just change?	1749	=head2 C<ev_stat> - did the file attributes just change?
1628		1750
1629	This watches a file system path for attribute changes. That is, it calls	1751	This watches a file system path for attribute changes. That is, it calls
…		…
1637	the stat buffer having unspecified contents.	1759	the stat buffer having unspecified contents.
1638		1760
1639	The path I<should> be absolute and I<must not> end in a slash. If it is	1761	The path I<should> be absolute and I<must not> end in a slash. If it is
1640	relative and your working directory changes, the behaviour is undefined.	1762	relative and your working directory changes, the behaviour is undefined.
1641		1763
1642	Since there is no standard to do this, the portable implementation simply	1764	Since there is no standard kernel interface to do this, the portable
1643	calls C<stat (2)> regularly on the path to see if it changed somehow. You	1765	implementation simply calls C<stat (2)> regularly on the path to see if
1644	can specify a recommended polling interval for this case. If you specify	1766	it changed somehow. You can specify a recommended polling interval for
1645	a polling interval of C<0> (highly recommended!) then a I<suitable,	1767	this case. If you specify a polling interval of C<0> (highly recommended!)
1646	unspecified default> value will be used (which you can expect to be around	1768	then a I<suitable, unspecified default> value will be used (which
1647	five seconds, although this might change dynamically). Libev will also	1769	you can expect to be around five seconds, although this might change
1648	impose a minimum interval which is currently around C<0.1>, but thats	1770	dynamically). Libev will also impose a minimum interval which is currently
1649	usually overkill.	1771	around C<0.1>, but thats usually overkill.
1650		1772
1651	This watcher type is not meant for massive numbers of stat watchers,	1773	This watcher type is not meant for massive numbers of stat watchers,
1652	as even with OS-supported change notifications, this can be	1774	as even with OS-supported change notifications, this can be
1653	resource-intensive.	1775	resource-intensive.
1654		1776
1655	At the time of this writing, only the Linux inotify interface is	1777	At the time of this writing, the only OS-specific interface implemented
1656	implemented (implementing kqueue support is left as an exercise for the	1778	is the Linux inotify interface (implementing kqueue support is left as
1657	reader, note, however, that the author sees no way of implementing ev_stat	1779	an exercise for the reader. Note, however, that the author sees no way
1658	semantics with kqueue). Inotify will be used to give hints only and should	1780	of implementing C<ev_stat> semantics with kqueue).
1659	not change the semantics of C<ev_stat> watchers, which means that libev
1660	sometimes needs to fall back to regular polling again even with inotify,
1661	but changes are usually detected immediately, and if the file exists there
1662	will be no polling.
1663		1781
1664	=head3 ABI Issues (Largefile Support)	1782	=head3 ABI Issues (Largefile Support)
1665		1783
1666	Libev by default (unless the user overrides this) uses the default	1784	Libev by default (unless the user overrides this) uses the default
1667	compilation environment, which means that on systems with optionally	1785	compilation environment, which means that on systems with large file
1668	disabled large file support, you get the 32 bit version of the stat	1786	support disabled by default, you get the 32 bit version of the stat
1669	structure. When using the library from programs that change the ABI to	1787	structure. When using the library from programs that change the ABI to
1670	use 64 bit file offsets the programs will fail. In that case you have to	1788	use 64 bit file offsets the programs will fail. In that case you have to
1671	compile libev with the same flags to get binary compatibility. This is	1789	compile libev with the same flags to get binary compatibility. This is
1672	obviously the case with any flags that change the ABI, but the problem is	1790	obviously the case with any flags that change the ABI, but the problem is
1673	most noticeably with ev_stat and large file support.	1791	most noticeably disabled with ev_stat and large file support.
1674		1792
1675	=head3 Inotify	1793	The solution for this is to lobby your distribution maker to make large
		1794	file interfaces available by default (as e.g. FreeBSD does) and not
		1795	optional. Libev cannot simply switch on large file support because it has
		1796	to exchange stat structures with application programs compiled using the
		1797	default compilation environment.
		1798
		1799	=head3 Inotify and Kqueue
1676		1800
1677	When C<inotify (7)> support has been compiled into libev (generally only	1801	When C<inotify (7)> support has been compiled into libev (generally only
1678	available on Linux) and present at runtime, it will be used to speed up	1802	available with Linux) and present at runtime, it will be used to speed up
1679	change detection where possible. The inotify descriptor will be created lazily	1803	change detection where possible. The inotify descriptor will be created lazily
1680	when the first C<ev_stat> watcher is being started.	1804	when the first C<ev_stat> watcher is being started.
1681		1805
1682	Inotify presence does not change the semantics of C<ev_stat> watchers	1806	Inotify presence does not change the semantics of C<ev_stat> watchers
1683	except that changes might be detected earlier, and in some cases, to avoid	1807	except that changes might be detected earlier, and in some cases, to avoid
1684	making regular C<stat> calls. Even in the presence of inotify support	1808	making regular C<stat> calls. Even in the presence of inotify support
1685	there are many cases where libev has to resort to regular C<stat> polling.	1809	there are many cases where libev has to resort to regular C<stat> polling,
		1810	but as long as the path exists, libev usually gets away without polling.
1686		1811
1687	(There is no support for kqueue, as apparently it cannot be used to	1812	There is no support for kqueue, as apparently it cannot be used to
1688	implement this functionality, due to the requirement of having a file	1813	implement this functionality, due to the requirement of having a file
1689	descriptor open on the object at all times).	1814	descriptor open on the object at all times, and detecting renames, unlinks
		1815	etc. is difficult.
1690		1816
1691	=head3 The special problem of stat time resolution	1817	=head3 The special problem of stat time resolution
1692		1818
1693	The C<stat ()> system call only supports full-second resolution portably, and	1819	The C<stat ()> system call only supports full-second resolution portably, and
1694	even on systems where the resolution is higher, many file systems still	1820	even on systems where the resolution is higher, most file systems still
1695	only support whole seconds.	1821	only support whole seconds.
1696		1822
1697	That means that, if the time is the only thing that changes, you can	1823	That means that, if the time is the only thing that changes, you can
1698	easily miss updates: on the first update, C<ev_stat> detects a change and	1824	easily miss updates: on the first update, C<ev_stat> detects a change and
1699	calls your callback, which does something. When there is another update	1825	calls your callback, which does something. When there is another update
1700	within the same second, C<ev_stat> will be unable to detect it as the stat	1826	within the same second, C<ev_stat> will be unable to detect unless the
1701	data does not change.	1827	stat data does change in other ways (e.g. file size).
1702		1828
1703	The solution to this is to delay acting on a change for slightly more	1829	The solution to this is to delay acting on a change for slightly more
1704	than a second (or till slightly after the next full second boundary), using	1830	than a second (or till slightly after the next full second boundary), using
1705	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);	1831	a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1706	ev_timer_again (loop, w)>).	1832	ev_timer_again (loop, w)>).
…		…
1726	C<path>. The C<interval> is a hint on how quickly a change is expected to	1852	C<path>. The C<interval> is a hint on how quickly a change is expected to
1727	be detected and should normally be specified as C<0> to let libev choose	1853	be detected and should normally be specified as C<0> to let libev choose
1728	a suitable value. The memory pointed to by C<path> must point to the same	1854	a suitable value. The memory pointed to by C<path> must point to the same
1729	path for as long as the watcher is active.	1855	path for as long as the watcher is active.
1730		1856
1731	The callback will receive C<EV_STAT> when a change was detected, relative	1857	The callback will receive an C<EV_STAT> event when a change was detected,
1732	to the attributes at the time the watcher was started (or the last change	1858	relative to the attributes at the time the watcher was started (or the
1733	was detected).	1859	last change was detected).
1734		1860
1735	=item ev_stat_stat (loop, ev_stat *)	1861	=item ev_stat_stat (loop, ev_stat *)
1736		1862
1737	Updates the stat buffer immediately with new values. If you change the	1863	Updates the stat buffer immediately with new values. If you change the
1738	watched path in your callback, you could call this function to avoid	1864	watched path in your callback, you could call this function to avoid
…		…
1767		1893
1768	=head3 Examples	1894	=head3 Examples
1769		1895
1770	Example: Watch C</etc/passwd> for attribute changes.	1896	Example: Watch C</etc/passwd> for attribute changes.
1771		1897
1772	static void	1898	static void
1773	passwd_cb (struct ev_loop loop, ev_stat w, int revents)	1899	passwd_cb (struct ev_loop loop, ev_stat w, int revents)
1774	{	1900	{
1775	/* /etc/passwd changed in some way */	1901	/* /etc/passwd changed in some way */
1776	if (w->attr.st_nlink)	1902	if (w->attr.st_nlink)
1777	{	1903	{
1778	printf ("passwd current size %ld\n", (long)w->attr.st_size);	1904	printf ("passwd current size %ld\n", (long)w->attr.st_size);
1779	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);	1905	printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1780	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);	1906	printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1781	}	1907	}
1782	else	1908	else
1783	/* you shalt not abuse printf for puts */	1909	/* you shalt not abuse printf for puts */
1784	puts ("wow, /etc/passwd is not there, expect problems. "	1910	puts ("wow, /etc/passwd is not there, expect problems. "
1785	"if this is windows, they already arrived\n");	1911	"if this is windows, they already arrived\n");
1786	}	1912	}
1787		1913
1788	...	1914	...
1789	ev_stat passwd;	1915	ev_stat passwd;
1790		1916
1791	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);	1917	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1792	ev_stat_start (loop, &passwd);	1918	ev_stat_start (loop, &passwd);
1793		1919
1794	Example: Like above, but additionally use a one-second delay so we do not	1920	Example: Like above, but additionally use a one-second delay so we do not
1795	miss updates (however, frequent updates will delay processing, too, so	1921	miss updates (however, frequent updates will delay processing, too, so
1796	one might do the work both on C<ev_stat> callback invocation I<and> on	1922	one might do the work both on C<ev_stat> callback invocation I<and> on
1797	C<ev_timer> callback invocation).	1923	C<ev_timer> callback invocation).
1798		1924
1799	static ev_stat passwd;	1925	static ev_stat passwd;
1800	static ev_timer timer;	1926	static ev_timer timer;
1801		1927
1802	static void	1928	static void
1803	timer_cb (EV_P_ ev_timer *w, int revents)	1929	timer_cb (EV_P_ ev_timer *w, int revents)
1804	{	1930	{
1805	ev_timer_stop (EV_A_ w);	1931	ev_timer_stop (EV_A_ w);
1806		1932
1807	/* now it's one second after the most recent passwd change */	1933	/* now it's one second after the most recent passwd change */
1808	}	1934	}
1809		1935
1810	static void	1936	static void
1811	stat_cb (EV_P_ ev_stat *w, int revents)	1937	stat_cb (EV_P_ ev_stat *w, int revents)
1812	{	1938	{
1813	/* reset the one-second timer */	1939	/* reset the one-second timer */
1814	ev_timer_again (EV_A_ &timer);	1940	ev_timer_again (EV_A_ &timer);
1815	}	1941	}
1816		1942
1817	...	1943	...
1818	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);	1944	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1819	ev_stat_start (loop, &passwd);	1945	ev_stat_start (loop, &passwd);
1820	ev_timer_init (&timer, timer_cb, 0., 1.02);	1946	ev_timer_init (&timer, timer_cb, 0., 1.02);
1821		1947
1822		1948
1823	=head2 C<ev_idle> - when you've got nothing better to do...	1949	=head2 C<ev_idle> - when you've got nothing better to do...
1824		1950
1825	Idle watchers trigger events when no other events of the same or higher	1951	Idle watchers trigger events when no other events of the same or higher
1826	priority are pending (prepare, check and other idle watchers do not	1952	priority are pending (prepare, check and other idle watchers do not count
1827	count).	1953	as receiving "events").
1828		1954
1829	That is, as long as your process is busy handling sockets or timeouts	1955	That is, as long as your process is busy handling sockets or timeouts
1830	(or even signals, imagine) of the same or higher priority it will not be	1956	(or even signals, imagine) of the same or higher priority it will not be
1831	triggered. But when your process is idle (or only lower-priority watchers	1957	triggered. But when your process is idle (or only lower-priority watchers
1832	are pending), the idle watchers are being called once per event loop	1958	are pending), the idle watchers are being called once per event loop
…		…
1856	=head3 Examples	1982	=head3 Examples
1857		1983
1858	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the	1984	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1859	callback, free it. Also, use no error checking, as usual.	1985	callback, free it. Also, use no error checking, as usual.
1860		1986
1861	static void	1987	static void
1862	idle_cb (struct ev_loop loop, struct ev_idle w, int revents)	1988	idle_cb (struct ev_loop loop, struct ev_idle w, int revents)
1863	{	1989	{
1864	free (w);	1990	free (w);
1865	// now do something you wanted to do when the program has	1991	// now do something you wanted to do when the program has
1866	// no longer anything immediate to do.	1992	// no longer anything immediate to do.
1867	}	1993	}
1868		1994
1869	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));	1995	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1870	ev_idle_init (idle_watcher, idle_cb);	1996	ev_idle_init (idle_watcher, idle_cb);
1871	ev_idle_start (loop, idle_cb);	1997	ev_idle_start (loop, idle_cb);
1872		1998
1873		1999
1874	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2000	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1875		2001
1876	Prepare and check watchers are usually (but not always) used in tandem:	2002	Prepare and check watchers are usually (but not always) used in pairs:
1877	prepare watchers get invoked before the process blocks and check watchers	2003	prepare watchers get invoked before the process blocks and check watchers
1878	afterwards.	2004	afterwards.
1879		2005
1880	You I<must not> call C<ev_loop> or similar functions that enter	2006	You I<must not> call C<ev_loop> or similar functions that enter
1881	the current event loop from either C<ev_prepare> or C<ev_check>	2007	the current event loop from either C<ev_prepare> or C<ev_check>
…		…
1884	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2010	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1885	C<ev_check> so if you have one watcher of each kind they will always be	2011	C<ev_check> so if you have one watcher of each kind they will always be
1886	called in pairs bracketing the blocking call.	2012	called in pairs bracketing the blocking call.
1887		2013
1888	Their main purpose is to integrate other event mechanisms into libev and	2014	Their main purpose is to integrate other event mechanisms into libev and
1889	their use is somewhat advanced. This could be used, for example, to track	2015	their use is somewhat advanced. They could be used, for example, to track
1890	variable changes, implement your own watchers, integrate net-snmp or a	2016	variable changes, implement your own watchers, integrate net-snmp or a
1891	coroutine library and lots more. They are also occasionally useful if	2017	coroutine library and lots more. They are also occasionally useful if
1892	you cache some data and want to flush it before blocking (for example,	2018	you cache some data and want to flush it before blocking (for example,
1893	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>	2019	in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1894	watcher).	2020	watcher).
1895		2021
1896	This is done by examining in each prepare call which file descriptors need	2022	This is done by examining in each prepare call which file descriptors
1897	to be watched by the other library, registering C<ev_io> watchers for	2023	need to be watched by the other library, registering C<ev_io> watchers
1898	them and starting an C<ev_timer> watcher for any timeouts (many libraries	2024	for them and starting an C<ev_timer> watcher for any timeouts (many
1899	provide just this functionality). Then, in the check watcher you check for	2025	libraries provide exactly this functionality). Then, in the check watcher,
1900	any events that occurred (by checking the pending status of all watchers	2026	you check for any events that occurred (by checking the pending status
1901	and stopping them) and call back into the library. The I/O and timer	2027	of all watchers and stopping them) and call back into the library. The
1902	callbacks will never actually be called (but must be valid nevertheless,	2028	I/O and timer callbacks will never actually be called (but must be valid
1903	because you never know, you know?).	2029	nevertheless, because you never know, you know?).
1904		2030
1905	As another example, the Perl Coro module uses these hooks to integrate	2031	As another example, the Perl Coro module uses these hooks to integrate
1906	coroutines into libev programs, by yielding to other active coroutines	2032	coroutines into libev programs, by yielding to other active coroutines
1907	during each prepare and only letting the process block if no coroutines	2033	during each prepare and only letting the process block if no coroutines
1908	are ready to run (it's actually more complicated: it only runs coroutines	2034	are ready to run (it's actually more complicated: it only runs coroutines
…		…
1911	loop from blocking if lower-priority coroutines are active, thus mapping	2037	loop from blocking if lower-priority coroutines are active, thus mapping
1912	low-priority coroutines to idle/background tasks).	2038	low-priority coroutines to idle/background tasks).
1913		2039
1914	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2040	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1915	priority, to ensure that they are being run before any other watchers	2041	priority, to ensure that they are being run before any other watchers
		2042	after the poll (this doesn't matter for C<ev_prepare> watchers).
		2043
1916	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,	2044	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
1917	too) should not activate ("feed") events into libev. While libev fully	2045	activate ("feed") events into libev. While libev fully supports this, they
1918	supports this, they might get executed before other C<ev_check> watchers	2046	might get executed before other C<ev_check> watchers did their job. As
1919	did their job. As C<ev_check> watchers are often used to embed other	2047	C<ev_check> watchers are often used to embed other (non-libev) event
1920	(non-libev) event loops those other event loops might be in an unusable	2048	loops those other event loops might be in an unusable state until their
1921	state until their C<ev_check> watcher ran (always remind yourself to	2049	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1922	coexist peacefully with others).	2050	others).
1923		2051
1924	=head3 Watcher-Specific Functions and Data Members	2052	=head3 Watcher-Specific Functions and Data Members
1925		2053
1926	=over 4	2054	=over 4
1927		2055
…		…
1929		2057
1930	=item ev_check_init (ev_check *, callback)	2058	=item ev_check_init (ev_check *, callback)
1931		2059
1932	Initialises and configures the prepare or check watcher - they have no	2060	Initialises and configures the prepare or check watcher - they have no
1933	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>	2061	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1934	macros, but using them is utterly, utterly and completely pointless.	2062	macros, but using them is utterly, utterly, utterly and completely
		2063	pointless.
1935		2064
1936	=back	2065	=back
1937		2066
1938	=head3 Examples	2067	=head3 Examples
1939		2068
…		…
1948	and in a check watcher, destroy them and call into libadns. What follows	2077	and in a check watcher, destroy them and call into libadns. What follows
1949	is pseudo-code only of course. This requires you to either use a low	2078	is pseudo-code only of course. This requires you to either use a low
1950	priority for the check watcher or use C<ev_clear_pending> explicitly, as	2079	priority for the check watcher or use C<ev_clear_pending> explicitly, as
1951	the callbacks for the IO/timeout watchers might not have been called yet.	2080	the callbacks for the IO/timeout watchers might not have been called yet.
1952		2081
1953	static ev_io iow [nfd];	2082	static ev_io iow [nfd];
1954	static ev_timer tw;	2083	static ev_timer tw;
1955		2084
1956	static void	2085	static void
1957	io_cb (ev_loop loop, ev_io w, int revents)	2086	io_cb (ev_loop loop, ev_io w, int revents)
1958	{	2087	{
1959	}	2088	}
1960		2089
1961	// create io watchers for each fd and a timer before blocking	2090	// create io watchers for each fd and a timer before blocking
1962	static void	2091	static void
1963	adns_prepare_cb (ev_loop loop, ev_prepare w, int revents)	2092	adns_prepare_cb (ev_loop loop, ev_prepare w, int revents)
1964	{	2093	{
1965	int timeout = 3600000;	2094	int timeout = 3600000;
1966	struct pollfd fds [nfd];	2095	struct pollfd fds [nfd];
1967	// actual code will need to loop here and realloc etc.	2096	// actual code will need to loop here and realloc etc.
1968	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	2097	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1969		2098
1970	/* the callback is illegal, but won't be called as we stop during check */	2099	/* the callback is illegal, but won't be called as we stop during check */
1971	ev_timer_init (&tw, 0, timeout * 1e-3);	2100	ev_timer_init (&tw, 0, timeout * 1e-3);
1972	ev_timer_start (loop, &tw);	2101	ev_timer_start (loop, &tw);
1973		2102
1974	// create one ev_io per pollfd	2103	// create one ev_io per pollfd
1975	for (int i = 0; i < nfd; ++i)	2104	for (int i = 0; i < nfd; ++i)
1976	{	2105	{
1977	ev_io_init (iow + i, io_cb, fds [i].fd,	2106	ev_io_init (iow + i, io_cb, fds [i].fd,
1978	((fds [i].events & POLLIN ? EV_READ : 0)	2107	((fds [i].events & POLLIN ? EV_READ : 0)
1979	\| (fds [i].events & POLLOUT ? EV_WRITE : 0)));	2108	\| (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1980		2109
1981	fds [i].revents = 0;	2110	fds [i].revents = 0;
1982	ev_io_start (loop, iow + i);	2111	ev_io_start (loop, iow + i);
1983	}	2112	}
1984	}	2113	}
1985		2114
1986	// stop all watchers after blocking	2115	// stop all watchers after blocking
1987	static void	2116	static void
1988	adns_check_cb (ev_loop loop, ev_check w, int revents)	2117	adns_check_cb (ev_loop loop, ev_check w, int revents)
1989	{	2118	{
1990	ev_timer_stop (loop, &tw);	2119	ev_timer_stop (loop, &tw);
1991		2120
1992	for (int i = 0; i < nfd; ++i)	2121	for (int i = 0; i < nfd; ++i)
1993	{	2122	{
1994	// set the relevant poll flags	2123	// set the relevant poll flags
1995	// could also call adns_processreadable etc. here	2124	// could also call adns_processreadable etc. here
1996	struct pollfd *fd = fds + i;	2125	struct pollfd *fd = fds + i;
1997	int revents = ev_clear_pending (iow + i);	2126	int revents = ev_clear_pending (iow + i);
1998	if (revents & EV_READ ) fd->revents \|= fd->events & POLLIN;	2127	if (revents & EV_READ ) fd->revents \|= fd->events & POLLIN;
1999	if (revents & EV_WRITE) fd->revents \|= fd->events & POLLOUT;	2128	if (revents & EV_WRITE) fd->revents \|= fd->events & POLLOUT;
2000		2129
2001	// now stop the watcher	2130	// now stop the watcher
2002	ev_io_stop (loop, iow + i);	2131	ev_io_stop (loop, iow + i);
2003	}	2132	}
2004		2133
2005	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));	2134	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
2006	}	2135	}
2007		2136
2008	Method 2: This would be just like method 1, but you run C<adns_afterpoll>	2137	Method 2: This would be just like method 1, but you run C<adns_afterpoll>
2009	in the prepare watcher and would dispose of the check watcher.	2138	in the prepare watcher and would dispose of the check watcher.
2010		2139
2011	Method 3: If the module to be embedded supports explicit event	2140	Method 3: If the module to be embedded supports explicit event
2012	notification (libadns does), you can also make use of the actual watcher	2141	notification (libadns does), you can also make use of the actual watcher
2013	callbacks, and only destroy/create the watchers in the prepare watcher.	2142	callbacks, and only destroy/create the watchers in the prepare watcher.
2014		2143
2015	static void	2144	static void
2016	timer_cb (EV_P_ ev_timer *w, int revents)	2145	timer_cb (EV_P_ ev_timer *w, int revents)
2017	{	2146	{
2018	adns_state ads = (adns_state)w->data;	2147	adns_state ads = (adns_state)w->data;
2019	update_now (EV_A);	2148	update_now (EV_A);
2020		2149
2021	adns_processtimeouts (ads, &tv_now);	2150	adns_processtimeouts (ads, &tv_now);
2022	}	2151	}
2023		2152
2024	static void	2153	static void
2025	io_cb (EV_P_ ev_io *w, int revents)	2154	io_cb (EV_P_ ev_io *w, int revents)
2026	{	2155	{
2027	adns_state ads = (adns_state)w->data;	2156	adns_state ads = (adns_state)w->data;
2028	update_now (EV_A);	2157	update_now (EV_A);
2029		2158
2030	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);	2159	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
2031	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);	2160	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
2032	}	2161	}
2033		2162
2034	// do not ever call adns_afterpoll	2163	// do not ever call adns_afterpoll
2035		2164
2036	Method 4: Do not use a prepare or check watcher because the module you	2165	Method 4: Do not use a prepare or check watcher because the module you
2037	want to embed is too inflexible to support it. Instead, you can override	2166	want to embed is not flexible enough to support it. Instead, you can
2038	their poll function. The drawback with this solution is that the main	2167	override their poll function. The drawback with this solution is that the
2039	loop is now no longer controllable by EV. The C<Glib::EV> module does	2168	main loop is now no longer controllable by EV. The C<Glib::EV> module uses
2040	this.	2169	this approach, effectively embedding EV as a client into the horrible
		2170	libglib event loop.
2041		2171
2042	static gint	2172	static gint
2043	event_poll_func (GPollFD *fds, guint nfds, gint timeout)	2173	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
2044	{	2174	{
2045	int got_events = 0;	2175	int got_events = 0;
2046		2176
2047	for (n = 0; n < nfds; ++n)	2177	for (n = 0; n < nfds; ++n)
2048	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events	2178	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events
2049		2179
2050	if (timeout >= 0)	2180	if (timeout >= 0)
2051	// create/start timer	2181	// create/start timer
2052		2182
2053	// poll	2183	// poll
2054	ev_loop (EV_A_ 0);	2184	ev_loop (EV_A_ 0);
2055		2185
2056	// stop timer again	2186	// stop timer again
2057	if (timeout >= 0)	2187	if (timeout >= 0)
2058	ev_timer_stop (EV_A_ &to);	2188	ev_timer_stop (EV_A_ &to);
2059		2189
2060	// stop io watchers again - their callbacks should have set	2190	// stop io watchers again - their callbacks should have set
2061	for (n = 0; n < nfds; ++n)	2191	for (n = 0; n < nfds; ++n)
2062	ev_io_stop (EV_A_ iow [n]);	2192	ev_io_stop (EV_A_ iow [n]);
2063		2193
2064	return got_events;	2194	return got_events;
2065	}	2195	}
2066		2196
2067		2197
2068	=head2 C<ev_embed> - when one backend isn't enough...	2198	=head2 C<ev_embed> - when one backend isn't enough...
2069		2199
2070	This is a rather advanced watcher type that lets you embed one event loop	2200	This is a rather advanced watcher type that lets you embed one event loop
…		…
2076	prioritise I/O.	2206	prioritise I/O.
2077		2207
2078	As an example for a bug workaround, the kqueue backend might only support	2208	As an example for a bug workaround, the kqueue backend might only support
2079	sockets on some platform, so it is unusable as generic backend, but you	2209	sockets on some platform, so it is unusable as generic backend, but you
2080	still want to make use of it because you have many sockets and it scales	2210	still want to make use of it because you have many sockets and it scales
2081	so nicely. In this case, you would create a kqueue-based loop and embed it	2211	so nicely. In this case, you would create a kqueue-based loop and embed
2082	into your default loop (which might use e.g. poll). Overall operation will	2212	it into your default loop (which might use e.g. poll). Overall operation
2083	be a bit slower because first libev has to poll and then call kevent, but	2213	will be a bit slower because first libev has to call C<poll> and then
2084	at least you can use both at what they are best.	2214	C<kevent>, but at least you can use both mechanisms for what they are
		2215	best: C<kqueue> for scalable sockets and C<poll> if you want it to work :)
2085		2216
2086	As for prioritising I/O: rarely you have the case where some fds have	2217	As for prioritising I/O: under rare circumstances you have the case where
2087	to be watched and handled very quickly (with low latency), and even	2218	some fds have to be watched and handled very quickly (with low latency),
2088	priorities and idle watchers might have too much overhead. In this case	2219	and even priorities and idle watchers might have too much overhead. In
2089	you would put all the high priority stuff in one loop and all the rest in	2220	this case you would put all the high priority stuff in one loop and all
2090	a second one, and embed the second one in the first.	2221	the rest in a second one, and embed the second one in the first.
2091		2222
2092	As long as the watcher is active, the callback will be invoked every time	2223	As long as the watcher is active, the callback will be invoked every time
2093	there might be events pending in the embedded loop. The callback must then	2224	there might be events pending in the embedded loop. The callback must then
2094	call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke	2225	call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
2095	their callbacks (you could also start an idle watcher to give the embedded	2226	their callbacks (you could also start an idle watcher to give the embedded
…		…
2103	interested in that.	2234	interested in that.
2104		2235
2105	Also, there have not currently been made special provisions for forking:	2236	Also, there have not currently been made special provisions for forking:
2106	when you fork, you not only have to call C<ev_loop_fork> on both loops,	2237	when you fork, you not only have to call C<ev_loop_fork> on both loops,
2107	but you will also have to stop and restart any C<ev_embed> watchers	2238	but you will also have to stop and restart any C<ev_embed> watchers
2108	yourself.	2239	yourself - but you can use a fork watcher to handle this automatically,
		2240	and future versions of libev might do just that.
2109		2241
2110	Unfortunately, not all backends are embeddable, only the ones returned by	2242	Unfortunately, not all backends are embeddable: only the ones returned by
2111	C<ev_embeddable_backends> are, which, unfortunately, does not include any	2243	C<ev_embeddable_backends> are, which, unfortunately, does not include any
2112	portable one.	2244	portable one.
2113		2245
2114	So when you want to use this feature you will always have to be prepared	2246	So when you want to use this feature you will always have to be prepared
2115	that you cannot get an embeddable loop. The recommended way to get around	2247	that you cannot get an embeddable loop. The recommended way to get around
2116	this is to have a separate variables for your embeddable loop, try to	2248	this is to have a separate variables for your embeddable loop, try to
2117	create it, and if that fails, use the normal loop for everything.	2249	create it, and if that fails, use the normal loop for everything.
		2250
		2251	=head3 C<ev_embed> and fork
		2252
		2253	While the C<ev_embed> watcher is running, forks in the embedding loop will
		2254	automatically be applied to the embedded loop as well, so no special
		2255	fork handling is required in that case. When the watcher is not running,
		2256	however, it is still the task of the libev user to call C<ev_loop_fork ()>
		2257	as applicable.
2118		2258
2119	=head3 Watcher-Specific Functions and Data Members	2259	=head3 Watcher-Specific Functions and Data Members
2120		2260
2121	=over 4	2261	=over 4
2122		2262
…		…
2148	event loop. If that is not possible, use the default loop. The default	2288	event loop. If that is not possible, use the default loop. The default
2149	loop is stored in C<loop_hi>, while the embeddable loop is stored in	2289	loop is stored in C<loop_hi>, while the embeddable loop is stored in
2150	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be	2290	C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2151	used).	2291	used).
2152		2292
2153	struct ev_loop *loop_hi = ev_default_init (0);	2293	struct ev_loop *loop_hi = ev_default_init (0);
2154	struct ev_loop *loop_lo = 0;	2294	struct ev_loop *loop_lo = 0;
2155	struct ev_embed embed;	2295	struct ev_embed embed;
2156		2296
2157	// see if there is a chance of getting one that works	2297	// see if there is a chance of getting one that works
2158	// (remember that a flags value of 0 means autodetection)	2298	// (remember that a flags value of 0 means autodetection)
2159	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	2299	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2160	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	2300	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2161	: 0;	2301	: 0;
2162		2302
2163	// if we got one, then embed it, otherwise default to loop_hi	2303	// if we got one, then embed it, otherwise default to loop_hi
2164	if (loop_lo)	2304	if (loop_lo)
2165	{	2305	{
2166	ev_embed_init (&embed, 0, loop_lo);	2306	ev_embed_init (&embed, 0, loop_lo);
2167	ev_embed_start (loop_hi, &embed);	2307	ev_embed_start (loop_hi, &embed);
2168	}	2308	}
2169	else	2309	else
2170	loop_lo = loop_hi;	2310	loop_lo = loop_hi;
2171		2311
2172	Example: Check if kqueue is available but not recommended and create	2312	Example: Check if kqueue is available but not recommended and create
2173	a kqueue backend for use with sockets (which usually work with any	2313	a kqueue backend for use with sockets (which usually work with any
2174	kqueue implementation). Store the kqueue/socket-only event loop in	2314	kqueue implementation). Store the kqueue/socket-only event loop in
2175	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	2315	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2176		2316
2177	struct ev_loop *loop = ev_default_init (0);	2317	struct ev_loop *loop = ev_default_init (0);
2178	struct ev_loop *loop_socket = 0;	2318	struct ev_loop *loop_socket = 0;
2179	struct ev_embed embed;	2319	struct ev_embed embed;
2180		2320
2181	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	2321	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2182	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	2322	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2183	{	2323	{
2184	ev_embed_init (&embed, 0, loop_socket);	2324	ev_embed_init (&embed, 0, loop_socket);
2185	ev_embed_start (loop, &embed);	2325	ev_embed_start (loop, &embed);
2186	}	2326	}
2187		2327
2188	if (!loop_socket)	2328	if (!loop_socket)
2189	loop_socket = loop;	2329	loop_socket = loop;
2190		2330
2191	// now use loop_socket for all sockets, and loop for everything else	2331	// now use loop_socket for all sockets, and loop for everything else
2192		2332
2193		2333
2194	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	2334	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2195		2335
2196	Fork watchers are called when a C<fork ()> was detected (usually because	2336	Fork watchers are called when a C<fork ()> was detected (usually because
…		…
2240	is that the author does not know of a simple (or any) algorithm for a	2380	is that the author does not know of a simple (or any) algorithm for a
2241	multiple-writer-single-reader queue that works in all cases and doesn't	2381	multiple-writer-single-reader queue that works in all cases and doesn't
2242	need elaborate support such as pthreads.	2382	need elaborate support such as pthreads.
2243		2383
2244	That means that if you want to queue data, you have to provide your own	2384	That means that if you want to queue data, you have to provide your own
2245	queue. But at least I can tell you would implement locking around your	2385	queue. But at least I can tell you how to implement locking around your
2246	queue:	2386	queue:
2247		2387
2248	=over 4	2388	=over 4
2249		2389
2250	=item queueing from a signal handler context	2390	=item queueing from a signal handler context
2251		2391
2252	To implement race-free queueing, you simply add to the queue in the signal	2392	To implement race-free queueing, you simply add to the queue in the signal
2253	handler but you block the signal handler in the watcher callback. Here is an example that does that for	2393	handler but you block the signal handler in the watcher callback. Here is
2254	some fictitious SIGUSR1 handler:	2394	an example that does that for some fictitious SIGUSR1 handler:
2255		2395
2256	static ev_async mysig;	2396	static ev_async mysig;
2257		2397
2258	static void	2398	static void
2259	sigusr1_handler (void)	2399	sigusr1_handler (void)
…		…
2326		2466
2327	=item ev_async_init (ev_async *, callback)	2467	=item ev_async_init (ev_async *, callback)
2328		2468
2329	Initialises and configures the async watcher - it has no parameters of any	2469	Initialises and configures the async watcher - it has no parameters of any
2330	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,	2470	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
2331	believe me.	2471	trust me.
2332		2472
2333	=item ev_async_send (loop, ev_async *)	2473	=item ev_async_send (loop, ev_async *)
2334		2474
2335	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	2475	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2336	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	2476	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2337	C<ev_feed_event>, this call is safe to do in other threads, signal or	2477	C<ev_feed_event>, this call is safe to do from other threads, signal or
2338	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	2478	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2339	section below on what exactly this means).	2479	section below on what exactly this means).
2340		2480
2341	This call incurs the overhead of a system call only once per loop iteration,	2481	This call incurs the overhead of a system call only once per loop iteration,
2342	so while the overhead might be noticeable, it doesn't apply to repeated	2482	so while the overhead might be noticeable, it doesn't apply to repeated
…		…
2366	=over 4	2506	=over 4
2367		2507
2368	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)	2508	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
2369		2509
2370	This function combines a simple timer and an I/O watcher, calls your	2510	This function combines a simple timer and an I/O watcher, calls your
2371	callback on whichever event happens first and automatically stop both	2511	callback on whichever event happens first and automatically stops both
2372	watchers. This is useful if you want to wait for a single event on an fd	2512	watchers. This is useful if you want to wait for a single event on an fd
2373	or timeout without having to allocate/configure/start/stop/free one or	2513	or timeout without having to allocate/configure/start/stop/free one or
2374	more watchers yourself.	2514	more watchers yourself.
2375		2515
2376	If C<fd> is less than 0, then no I/O watcher will be started and events	2516	If C<fd> is less than 0, then no I/O watcher will be started and the
2377	is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and	2517	C<events> argument is being ignored. Otherwise, an C<ev_io> watcher for
2378	C<events> set will be created and started.	2518	the given C<fd> and C<events> set will be created and started.
2379		2519
2380	If C<timeout> is less than 0, then no timeout watcher will be	2520	If C<timeout> is less than 0, then no timeout watcher will be
2381	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and	2521	started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2382	repeat = 0) will be started. While C<0> is a valid timeout, it is of	2522	repeat = 0) will be started. C<0> is a valid timeout.
2383	dubious value.
2384		2523
2385	The callback has the type C<void (cb)(int revents, void arg)> and gets	2524	The callback has the type C<void (cb)(int revents, void arg)> and gets
2386	passed an C<revents> set like normal event callbacks (a combination of	2525	passed an C<revents> set like normal event callbacks (a combination of
2387	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>	2526	C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2388	value passed to C<ev_once>:	2527	value passed to C<ev_once>. Note that it is possible to receive I<both>
		2528	a timeout and an io event at the same time - you probably should give io
		2529	events precedence.
2389		2530
		2531	Example: wait up to ten seconds for data to appear on STDIN_FILENO.
		2532
2390	static void stdin_ready (int revents, void *arg)	2533	static void stdin_ready (int revents, void *arg)
2391	{	2534	{
2392	if (revents & EV_TIMEOUT)
2393	/* doh, nothing entered */;
2394	else if (revents & EV_READ)	2535	if (revents & EV_READ)
2395	/* stdin might have data for us, joy! */;	2536	/* stdin might have data for us, joy! */;
		2537	else if (revents & EV_TIMEOUT)
		2538	/* doh, nothing entered */;
2396	}	2539	}
2397		2540
2398	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	2541	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2399		2542
2400	=item ev_feed_event (ev_loop , watcher , int revents)	2543	=item ev_feed_event (ev_loop , watcher , int revents)
2401		2544
2402	Feeds the given event set into the event loop, as if the specified event	2545	Feeds the given event set into the event loop, as if the specified event
2403	had happened for the specified watcher (which must be a pointer to an	2546	had happened for the specified watcher (which must be a pointer to an
…		…
2452	you to use some convenience methods to start/stop watchers and also change	2595	you to use some convenience methods to start/stop watchers and also change
2453	the callback model to a model using method callbacks on objects.	2596	the callback model to a model using method callbacks on objects.
2454		2597
2455	To use it,	2598	To use it,
2456		2599
2457	#include <ev++.h>	2600	#include <ev++.h>
2458		2601
2459	This automatically includes F<ev.h> and puts all of its definitions (many	2602	This automatically includes F<ev.h> and puts all of its definitions (many
2460	of them macros) into the global namespace. All C++ specific things are	2603	of them macros) into the global namespace. All C++ specific things are
2461	put into the C<ev> namespace. It should support all the same embedding	2604	put into the C<ev> namespace. It should support all the same embedding
2462	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.	2605	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
…		…
2529	your compiler is good :), then the method will be fully inlined into the	2672	your compiler is good :), then the method will be fully inlined into the
2530	thunking function, making it as fast as a direct C callback.	2673	thunking function, making it as fast as a direct C callback.
2531		2674
2532	Example: simple class declaration and watcher initialisation	2675	Example: simple class declaration and watcher initialisation
2533		2676
2534	struct myclass	2677	struct myclass
2535	{	2678	{
2536	void io_cb (ev::io &w, int revents) { }	2679	void io_cb (ev::io &w, int revents) { }
2537	}	2680	}
2538		2681
2539	myclass obj;	2682	myclass obj;
2540	ev::io iow;	2683	ev::io iow;
2541	iow.set <myclass, &myclass::io_cb> (&obj);	2684	iow.set <myclass, &myclass::io_cb> (&obj);
2542		2685
2543	=item w->set<function> (void *data = 0)	2686	=item w->set<function> (void *data = 0)
2544		2687
2545	Also sets a callback, but uses a static method or plain function as	2688	Also sets a callback, but uses a static method or plain function as
2546	callback. The optional C<data> argument will be stored in the watcher's	2689	callback. The optional C<data> argument will be stored in the watcher's
…		…
2548		2691
2549	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.	2692	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2550		2693
2551	See the method-C<set> above for more details.	2694	See the method-C<set> above for more details.
2552		2695
2553	Example:	2696	Example: Use a plain function as callback.
2554		2697
2555	static void io_cb (ev::io &w, int revents) { }	2698	static void io_cb (ev::io &w, int revents) { }
2556	iow.set <io_cb> ();	2699	iow.set <io_cb> ();
2557		2700
2558	=item w->set (struct ev_loop *)	2701	=item w->set (struct ev_loop *)
2559		2702
2560	Associates a different C<struct ev_loop> with this watcher. You can only	2703	Associates a different C<struct ev_loop> with this watcher. You can only
2561	do this when the watcher is inactive (and not pending either).	2704	do this when the watcher is inactive (and not pending either).
…		…
2594	=back	2737	=back
2595		2738
2596	Example: Define a class with an IO and idle watcher, start one of them in	2739	Example: Define a class with an IO and idle watcher, start one of them in
2597	the constructor.	2740	the constructor.
2598		2741
2599	class myclass	2742	class myclass
2600	{	2743	{
2601	ev::io io; void io_cb (ev::io &w, int revents);	2744	ev::io io ; void io_cb (ev::io &w, int revents);
2602	ev:idle idle void idle_cb (ev::idle &w, int revents);	2745	ev::idle idle; void idle_cb (ev::idle &w, int revents);
2603		2746
2604	myclass (int fd)	2747	myclass (int fd)
2605	{	2748	{
2606	io .set <myclass, &myclass::io_cb > (this);	2749	io .set <myclass, &myclass::io_cb > (this);
2607	idle.set <myclass, &myclass::idle_cb> (this);	2750	idle.set <myclass, &myclass::idle_cb> (this);
2608		2751
2609	io.start (fd, ev::READ);	2752	io.start (fd, ev::READ);
2610	}	2753	}
2611	};	2754	};
2612		2755
2613		2756
2614	=head1 OTHER LANGUAGE BINDINGS	2757	=head1 OTHER LANGUAGE BINDINGS
2615		2758
2616	Libev does not offer other language bindings itself, but bindings for a	2759	Libev does not offer other language bindings itself, but bindings for a
…		…
2623	=item Perl	2766	=item Perl
2624		2767
2625	The EV module implements the full libev API and is actually used to test	2768	The EV module implements the full libev API and is actually used to test
2626	libev. EV is developed together with libev. Apart from the EV core module,	2769	libev. EV is developed together with libev. Apart from the EV core module,
2627	there are additional modules that implement libev-compatible interfaces	2770	there are additional modules that implement libev-compatible interfaces
2628	to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the	2771	to C<libadns> (C<EV::ADNS>, but C<AnyEvent::DNS> is preferred nowadays),
2629	C<libglib> event core (C<Glib::EV> and C<EV::Glib>).	2772	C<Net::SNMP> (C<Net::SNMP::EV>) and the C<libglib> event core (C<Glib::EV>
		2773	and C<EV::Glib>).
2630		2774
2631	It can be found and installed via CPAN, its homepage is found at	2775	It can be found and installed via CPAN, its homepage is at
2632	L<http://software.schmorp.de/pkg/EV>.	2776	L<http://software.schmorp.de/pkg/EV>.
		2777
		2778	=item Python
		2779
		2780	Python bindings can be found at L<http://code.google.com/p/pyev/>. It
		2781	seems to be quite complete and well-documented. Note, however, that the
		2782	patch they require for libev is outright dangerous as it breaks the ABI
		2783	for everybody else, and therefore, should never be applied in an installed
		2784	libev (if python requires an incompatible ABI then it needs to embed
		2785	libev).
2633		2786
2634	=item Ruby	2787	=item Ruby
2635		2788
2636	Tony Arcieri has written a ruby extension that offers access to a subset	2789	Tony Arcieri has written a ruby extension that offers access to a subset
2637	of the libev API and adds file handle abstractions, asynchronous DNS and	2790	of the libev API and adds file handle abstractions, asynchronous DNS and
…		…
2639	L<http://rev.rubyforge.org/>.	2792	L<http://rev.rubyforge.org/>.
2640		2793
2641	=item D	2794	=item D
2642		2795
2643	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	2796	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2644	be found at L<http://git.llucax.com.ar/?p=software/ev.d.git;a=summary>.	2797	be found at L<http://proj.llucax.com.ar/wiki/evd>.
2645		2798
2646	=back	2799	=back
2647		2800
2648		2801
2649	=head1 MACRO MAGIC	2802	=head1 MACRO MAGIC
…		…
2661		2814
2662	This provides the loop I<argument> for functions, if one is required ("ev	2815	This provides the loop I<argument> for functions, if one is required ("ev
2663	loop argument"). The C<EV_A> form is used when this is the sole argument,	2816	loop argument"). The C<EV_A> form is used when this is the sole argument,
2664	C<EV_A_> is used when other arguments are following. Example:	2817	C<EV_A_> is used when other arguments are following. Example:
2665		2818
2666	ev_unref (EV_A);	2819	ev_unref (EV_A);
2667	ev_timer_add (EV_A_ watcher);	2820	ev_timer_add (EV_A_ watcher);
2668	ev_loop (EV_A_ 0);	2821	ev_loop (EV_A_ 0);
2669		2822
2670	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,	2823	It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2671	which is often provided by the following macro.	2824	which is often provided by the following macro.
2672		2825
2673	=item C<EV_P>, C<EV_P_>	2826	=item C<EV_P>, C<EV_P_>
2674		2827
2675	This provides the loop I<parameter> for functions, if one is required ("ev	2828	This provides the loop I<parameter> for functions, if one is required ("ev
2676	loop parameter"). The C<EV_P> form is used when this is the sole parameter,	2829	loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2677	C<EV_P_> is used when other parameters are following. Example:	2830	C<EV_P_> is used when other parameters are following. Example:
2678		2831
2679	// this is how ev_unref is being declared	2832	// this is how ev_unref is being declared
2680	static void ev_unref (EV_P);	2833	static void ev_unref (EV_P);
2681		2834
2682	// this is how you can declare your typical callback	2835	// this is how you can declare your typical callback
2683	static void cb (EV_P_ ev_timer *w, int revents)	2836	static void cb (EV_P_ ev_timer *w, int revents)
2684		2837
2685	It declares a parameter C<loop> of type C<struct ev_loop *>, quite	2838	It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2686	suitable for use with C<EV_A>.	2839	suitable for use with C<EV_A>.
2687		2840
2688	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	2841	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
…		…
2704		2857
2705	Example: Declare and initialise a check watcher, utilising the above	2858	Example: Declare and initialise a check watcher, utilising the above
2706	macros so it will work regardless of whether multiple loops are supported	2859	macros so it will work regardless of whether multiple loops are supported
2707	or not.	2860	or not.
2708		2861
2709	static void	2862	static void
2710	check_cb (EV_P_ ev_timer *w, int revents)	2863	check_cb (EV_P_ ev_timer *w, int revents)
2711	{	2864	{
2712	ev_check_stop (EV_A_ w);	2865	ev_check_stop (EV_A_ w);
2713	}	2866	}
2714		2867
2715	ev_check check;	2868	ev_check check;
2716	ev_check_init (&check, check_cb);	2869	ev_check_init (&check, check_cb);
2717	ev_check_start (EV_DEFAULT_ &check);	2870	ev_check_start (EV_DEFAULT_ &check);
2718	ev_loop (EV_DEFAULT_ 0);	2871	ev_loop (EV_DEFAULT_ 0);
2719		2872
2720	=head1 EMBEDDING	2873	=head1 EMBEDDING
2721		2874
2722	Libev can (and often is) directly embedded into host	2875	Libev can (and often is) directly embedded into host
2723	applications. Examples of applications that embed it include the Deliantra	2876	applications. Examples of applications that embed it include the Deliantra
…		…
2737	=head3 CORE EVENT LOOP	2890	=head3 CORE EVENT LOOP
2738		2891
2739	To include only the libev core (all the C<ev_*> functions), with manual	2892	To include only the libev core (all the C<ev_*> functions), with manual
2740	configuration (no autoconf):	2893	configuration (no autoconf):
2741		2894
2742	#define EV_STANDALONE 1	2895	#define EV_STANDALONE 1
2743	#include "ev.c"	2896	#include "ev.c"
2744		2897
2745	This will automatically include F<ev.h>, too, and should be done in a	2898	This will automatically include F<ev.h>, too, and should be done in a
2746	single C source file only to provide the function implementations. To use	2899	single C source file only to provide the function implementations. To use
2747	it, do the same for F<ev.h> in all files wishing to use this API (best	2900	it, do the same for F<ev.h> in all files wishing to use this API (best
2748	done by writing a wrapper around F<ev.h> that you can include instead and	2901	done by writing a wrapper around F<ev.h> that you can include instead and
2749	where you can put other configuration options):	2902	where you can put other configuration options):
2750		2903
2751	#define EV_STANDALONE 1	2904	#define EV_STANDALONE 1
2752	#include "ev.h"	2905	#include "ev.h"
2753		2906
2754	Both header files and implementation files can be compiled with a C++	2907	Both header files and implementation files can be compiled with a C++
2755	compiler (at least, thats a stated goal, and breakage will be treated	2908	compiler (at least, thats a stated goal, and breakage will be treated
2756	as a bug).	2909	as a bug).
2757		2910
2758	You need the following files in your source tree, or in a directory	2911	You need the following files in your source tree, or in a directory
2759	in your include path (e.g. in libev/ when using -Ilibev):	2912	in your include path (e.g. in libev/ when using -Ilibev):
2760		2913
2761	ev.h	2914	ev.h
2762	ev.c	2915	ev.c
2763	ev_vars.h	2916	ev_vars.h
2764	ev_wrap.h	2917	ev_wrap.h
2765		2918
2766	ev_win32.c required on win32 platforms only	2919	ev_win32.c required on win32 platforms only
2767		2920
2768	ev_select.c only when select backend is enabled (which is enabled by default)	2921	ev_select.c only when select backend is enabled (which is enabled by default)
2769	ev_poll.c only when poll backend is enabled (disabled by default)	2922	ev_poll.c only when poll backend is enabled (disabled by default)
2770	ev_epoll.c only when the epoll backend is enabled (disabled by default)	2923	ev_epoll.c only when the epoll backend is enabled (disabled by default)
2771	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	2924	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2772	ev_port.c only when the solaris port backend is enabled (disabled by default)	2925	ev_port.c only when the solaris port backend is enabled (disabled by default)
2773		2926
2774	F<ev.c> includes the backend files directly when enabled, so you only need	2927	F<ev.c> includes the backend files directly when enabled, so you only need
2775	to compile this single file.	2928	to compile this single file.
2776		2929
2777	=head3 LIBEVENT COMPATIBILITY API	2930	=head3 LIBEVENT COMPATIBILITY API
2778		2931
2779	To include the libevent compatibility API, also include:	2932	To include the libevent compatibility API, also include:
2780		2933
2781	#include "event.c"	2934	#include "event.c"
2782		2935
2783	in the file including F<ev.c>, and:	2936	in the file including F<ev.c>, and:
2784		2937
2785	#include "event.h"	2938	#include "event.h"
2786		2939
2787	in the files that want to use the libevent API. This also includes F<ev.h>.	2940	in the files that want to use the libevent API. This also includes F<ev.h>.
2788		2941
2789	You need the following additional files for this:	2942	You need the following additional files for this:
2790		2943
2791	event.h	2944	event.h
2792	event.c	2945	event.c
2793		2946
2794	=head3 AUTOCONF SUPPORT	2947	=head3 AUTOCONF SUPPORT
2795		2948
2796	Instead of using C<EV_STANDALONE=1> and providing your configuration in	2949	Instead of using C<EV_STANDALONE=1> and providing your configuration in
2797	whatever way you want, you can also C<m4_include([libev.m4])> in your	2950	whatever way you want, you can also C<m4_include([libev.m4])> in your
2798	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then	2951	F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2799	include F<config.h> and configure itself accordingly.	2952	include F<config.h> and configure itself accordingly.
2800		2953
2801	For this of course you need the m4 file:	2954	For this of course you need the m4 file:
2802		2955
2803	libev.m4	2956	libev.m4
2804		2957
2805	=head2 PREPROCESSOR SYMBOLS/MACROS	2958	=head2 PREPROCESSOR SYMBOLS/MACROS
2806		2959
2807	Libev can be configured via a variety of preprocessor symbols you have to	2960	Libev can be configured via a variety of preprocessor symbols you have to
2808	define before including any of its files. The default in the absence of	2961	define before including any of its files. The default in the absence of
2809	autoconf is noted for every option.	2962	autoconf is documented for every option.
2810		2963
2811	=over 4	2964	=over 4
2812		2965
2813	=item EV_STANDALONE	2966	=item EV_STANDALONE
2814		2967
…		…
2984	When doing priority-based operations, libev usually has to linearly search	3137	When doing priority-based operations, libev usually has to linearly search
2985	all the priorities, so having many of them (hundreds) uses a lot of space	3138	all the priorities, so having many of them (hundreds) uses a lot of space
2986	and time, so using the defaults of five priorities (-2 .. +2) is usually	3139	and time, so using the defaults of five priorities (-2 .. +2) is usually
2987	fine.	3140	fine.
2988		3141
2989	If your embedding application does not need any priorities, defining these both to	3142	If your embedding application does not need any priorities, defining these
2990	C<0> will save some memory and CPU.	3143	both to C<0> will save some memory and CPU.
2991		3144
2992	=item EV_PERIODIC_ENABLE	3145	=item EV_PERIODIC_ENABLE
2993		3146
2994	If undefined or defined to be C<1>, then periodic timers are supported. If	3147	If undefined or defined to be C<1>, then periodic timers are supported. If
2995	defined to be C<0>, then they are not. Disabling them saves a few kB of	3148	defined to be C<0>, then they are not. Disabling them saves a few kB of
…		…
3002	code.	3155	code.
3003		3156
3004	=item EV_EMBED_ENABLE	3157	=item EV_EMBED_ENABLE
3005		3158
3006	If undefined or defined to be C<1>, then embed watchers are supported. If	3159	If undefined or defined to be C<1>, then embed watchers are supported. If
3007	defined to be C<0>, then they are not.	3160	defined to be C<0>, then they are not. Embed watchers rely on most other
		3161	watcher types, which therefore must not be disabled.
3008		3162
3009	=item EV_STAT_ENABLE	3163	=item EV_STAT_ENABLE
3010		3164
3011	If undefined or defined to be C<1>, then stat watchers are supported. If	3165	If undefined or defined to be C<1>, then stat watchers are supported. If
3012	defined to be C<0>, then they are not.	3166	defined to be C<0>, then they are not.
…		…
3044	two).	3198	two).
3045		3199
3046	=item EV_USE_4HEAP	3200	=item EV_USE_4HEAP
3047		3201
3048	Heaps are not very cache-efficient. To improve the cache-efficiency of the	3202	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3049	timer and periodics heap, libev uses a 4-heap when this symbol is defined	3203	timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3050	to C<1>. The 4-heap uses more complicated (longer) code but has	3204	to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3051	noticeably faster performance with many (thousands) of watchers.	3205	faster performance with many (thousands) of watchers.
3052		3206
3053	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	3207	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3054	(disabled).	3208	(disabled).
3055		3209
3056	=item EV_HEAP_CACHE_AT	3210	=item EV_HEAP_CACHE_AT
3057		3211
3058	Heaps are not very cache-efficient. To improve the cache-efficiency of the	3212	Heaps are not very cache-efficient. To improve the cache-efficiency of the
3059	timer and periodics heap, libev can cache the timestamp (I<at>) within	3213	timer and periodics heaps, libev can cache the timestamp (I<at>) within
3060	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),	3214	the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3061	which uses 8-12 bytes more per watcher and a few hundred bytes more code,	3215	which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3062	but avoids random read accesses on heap changes. This improves performance	3216	but avoids random read accesses on heap changes. This improves performance
3063	noticeably with with many (hundreds) of watchers.	3217	noticeably with many (hundreds) of watchers.
3064		3218
3065	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>	3219	The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3066	(disabled).	3220	(disabled).
3067		3221
3068	=item EV_VERIFY	3222	=item EV_VERIFY
…		…
3074	called once per loop, which can slow down libev. If set to C<3>, then the	3228	called once per loop, which can slow down libev. If set to C<3>, then the
3075	verification code will be called very frequently, which will slow down	3229	verification code will be called very frequently, which will slow down
3076	libev considerably.	3230	libev considerably.
3077		3231
3078	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be	3232	The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3079	C<0.>	3233	C<0>.
3080		3234
3081	=item EV_COMMON	3235	=item EV_COMMON
3082		3236
3083	By default, all watchers have a C<void *data> member. By redefining	3237	By default, all watchers have a C<void *data> member. By redefining
3084	this macro to a something else you can include more and other types of	3238	this macro to a something else you can include more and other types of
3085	members. You have to define it each time you include one of the files,	3239	members. You have to define it each time you include one of the files,
3086	though, and it must be identical each time.	3240	though, and it must be identical each time.
3087		3241
3088	For example, the perl EV module uses something like this:	3242	For example, the perl EV module uses something like this:
3089		3243
3090	#define EV_COMMON \	3244	#define EV_COMMON \
3091	SV self; / contains this struct */ \	3245	SV self; / contains this struct */ \
3092	SV cb_sv, fh /* note no trailing ";" */	3246	SV cb_sv, fh /* note no trailing ";" */
3093		3247
3094	=item EV_CB_DECLARE (type)	3248	=item EV_CB_DECLARE (type)
3095		3249
3096	=item EV_CB_INVOKE (watcher, revents)	3250	=item EV_CB_INVOKE (watcher, revents)
3097		3251
…		…
3102	definition and a statement, respectively. See the F<ev.h> header file for	3256	definition and a statement, respectively. See the F<ev.h> header file for
3103	their default definitions. One possible use for overriding these is to	3257	their default definitions. One possible use for overriding these is to
3104	avoid the C<struct ev_loop *> as first argument in all cases, or to use	3258	avoid the C<struct ev_loop *> as first argument in all cases, or to use
3105	method calls instead of plain function calls in C++.	3259	method calls instead of plain function calls in C++.
3106		3260
		3261	=back
		3262
3107	=head2 EXPORTED API SYMBOLS	3263	=head2 EXPORTED API SYMBOLS
3108		3264
3109	If you need to re-export the API (e.g. via a DLL) and you need a list of	3265	If you need to re-export the API (e.g. via a DLL) and you need a list of
3110	exported symbols, you can use the provided F<Symbol.*> files which list	3266	exported symbols, you can use the provided F<Symbol.*> files which list
3111	all public symbols, one per line:	3267	all public symbols, one per line:
3112		3268
3113	Symbols.ev for libev proper	3269	Symbols.ev for libev proper
3114	Symbols.event for the libevent emulation	3270	Symbols.event for the libevent emulation
3115		3271
3116	This can also be used to rename all public symbols to avoid clashes with	3272	This can also be used to rename all public symbols to avoid clashes with
3117	multiple versions of libev linked together (which is obviously bad in	3273	multiple versions of libev linked together (which is obviously bad in
3118	itself, but sometimes it is inconvenient to avoid this).	3274	itself, but sometimes it is inconvenient to avoid this).
3119		3275
…		…
3140	file.	3296	file.
3141		3297
3142	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	3298	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3143	that everybody includes and which overrides some configure choices:	3299	that everybody includes and which overrides some configure choices:
3144		3300
3145	#define EV_MINIMAL 1	3301	#define EV_MINIMAL 1
3146	#define EV_USE_POLL 0	3302	#define EV_USE_POLL 0
3147	#define EV_MULTIPLICITY 0	3303	#define EV_MULTIPLICITY 0
3148	#define EV_PERIODIC_ENABLE 0	3304	#define EV_PERIODIC_ENABLE 0
3149	#define EV_STAT_ENABLE 0	3305	#define EV_STAT_ENABLE 0
3150	#define EV_FORK_ENABLE 0	3306	#define EV_FORK_ENABLE 0
3151	#define EV_CONFIG_H <config.h>	3307	#define EV_CONFIG_H <config.h>
3152	#define EV_MINPRI 0	3308	#define EV_MINPRI 0
3153	#define EV_MAXPRI 0	3309	#define EV_MAXPRI 0
3154		3310
3155	#include "ev++.h"	3311	#include "ev++.h"
3156		3312
3157	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	3313	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3158		3314
3159	#include "ev_cpp.h"	3315	#include "ev_cpp.h"
3160	#include "ev.c"	3316	#include "ev.c"
3161		3317
		3318	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES
3162		3319
3163	=head1 THREADS AND COROUTINES	3320	=head2 THREADS AND COROUTINES
3164		3321
3165	=head2 THREADS	3322	=head3 THREADS
3166		3323
3167	Libev itself is completely thread-safe, but it uses no locking. This	3324	All libev functions are reentrant and thread-safe unless explicitly
		3325	documented otherwise, but libev implements no locking itself. This means
3168	means that you can use as many loops as you want in parallel, as long as	3326	that you can use as many loops as you want in parallel, as long as there
3169	only one thread ever calls into one libev function with the same loop	3327	are no concurrent calls into any libev function with the same loop
3170	parameter.	3328	parameter (C<ev_default_*> calls have an implicit default loop parameter,
		3329	of course): libev guarantees that different event loops share no data
		3330	structures that need any locking.
3171		3331
3172	Or put differently: calls with different loop parameters can be done in	3332	Or to put it differently: calls with different loop parameters can be done
3173	parallel from multiple threads, calls with the same loop parameter must be	3333	concurrently from multiple threads, calls with the same loop parameter
3174	done serially (but can be done from different threads, as long as only one	3334	must be done serially (but can be done from different threads, as long as
3175	thread ever is inside a call at any point in time, e.g. by using a mutex	3335	only one thread ever is inside a call at any point in time, e.g. by using
3176	per loop).	3336	a mutex per loop).
3177		3337
3178	If you want to know which design is best for your problem, then I cannot	3338	Specifically to support threads (and signal handlers), libev implements
		3339	so-called C<ev_async> watchers, which allow some limited form of
		3340	concurrency on the same event loop, namely waking it up "from the
		3341	outside".
		3342
		3343	If you want to know which design (one loop, locking, or multiple loops
		3344	without or something else still) is best for your problem, then I cannot
3179	help you but by giving some generic advice:	3345	help you, but here is some generic advice:
3180		3346
3181	=over 4	3347	=over 4
3182		3348
3183	=item * most applications have a main thread: use the default libev loop	3349	=item * most applications have a main thread: use the default libev loop
3184	in that thread, or create a separate thread running only the default loop.	3350	in that thread, or create a separate thread running only the default loop.
…		…
3196		3362
3197	Choosing a model is hard - look around, learn, know that usually you can do	3363	Choosing a model is hard - look around, learn, know that usually you can do
3198	better than you currently do :-)	3364	better than you currently do :-)
3199		3365
3200	=item * often you need to talk to some other thread which blocks in the	3366	=item * often you need to talk to some other thread which blocks in the
		3367	event loop.
		3368
3201	event loop - C<ev_async> watchers can be used to wake them up from other	3369	C<ev_async> watchers can be used to wake them up from other threads safely
3202	threads safely (or from signal contexts...).	3370	(or from signal contexts...).
		3371
		3372	An example use would be to communicate signals or other events that only
		3373	work in the default loop by registering the signal watcher with the
		3374	default loop and triggering an C<ev_async> watcher from the default loop
		3375	watcher callback into the event loop interested in the signal.
3203		3376
3204	=back	3377	=back
3205		3378
3206	=head2 COROUTINES	3379	=head3 COROUTINES
3207		3380
3208	Libev is much more accommodating to coroutines ("cooperative threads"):	3381	Libev is very accommodating to coroutines ("cooperative threads"):
3209	libev fully supports nesting calls to it's functions from different	3382	libev fully supports nesting calls to its functions from different
3210	coroutines (e.g. you can call C<ev_loop> on the same loop from two	3383	coroutines (e.g. you can call C<ev_loop> on the same loop from two
3211	different coroutines and switch freely between both coroutines running the	3384	different coroutines, and switch freely between both coroutines running the
3212	loop, as long as you don't confuse yourself). The only exception is that	3385	loop, as long as you don't confuse yourself). The only exception is that
3213	you must not do this from C<ev_periodic> reschedule callbacks.	3386	you must not do this from C<ev_periodic> reschedule callbacks.
3214		3387
3215	Care has been invested into making sure that libev does not keep local	3388	Care has been taken to ensure that libev does not keep local state inside
3216	state inside C<ev_loop>, and other calls do not usually allow coroutine	3389	C<ev_loop>, and other calls do not usually allow for coroutine switches as
3217	switches.	3390	they do not clal any callbacks.
3218		3391
		3392	=head2 COMPILER WARNINGS
3219		3393
3220	=head1 COMPLEXITIES	3394	Depending on your compiler and compiler settings, you might get no or a
		3395	lot of warnings when compiling libev code. Some people are apparently
		3396	scared by this.
3221		3397
3222	In this section the complexities of (many of) the algorithms used inside	3398	However, these are unavoidable for many reasons. For one, each compiler
3223	libev will be explained. For complexity discussions about backends see the	3399	has different warnings, and each user has different tastes regarding
3224	documentation for C<ev_default_init>.	3400	warning options. "Warn-free" code therefore cannot be a goal except when
		3401	targeting a specific compiler and compiler-version.
3225		3402
3226	All of the following are about amortised time: If an array needs to be	3403	Another reason is that some compiler warnings require elaborate
3227	extended, libev needs to realloc and move the whole array, but this	3404	workarounds, or other changes to the code that make it less clear and less
3228	happens asymptotically never with higher number of elements, so O(1) might	3405	maintainable.
3229	mean it might do a lengthy realloc operation in rare cases, but on average
3230	it is much faster and asymptotically approaches constant time.
3231		3406
3232	=over 4	3407	And of course, some compiler warnings are just plain stupid, or simply
		3408	wrong (because they don't actually warn about the condition their message
		3409	seems to warn about). For example, certain older gcc versions had some
		3410	warnings that resulted an extreme number of false positives. These have
		3411	been fixed, but some people still insist on making code warn-free with
		3412	such buggy versions.
3233		3413
3234	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)	3414	While libev is written to generate as few warnings as possible,
		3415	"warn-free" code is not a goal, and it is recommended not to build libev
		3416	with any compiler warnings enabled unless you are prepared to cope with
		3417	them (e.g. by ignoring them). Remember that warnings are just that:
		3418	warnings, not errors, or proof of bugs.
3235		3419
3236	This means that, when you have a watcher that triggers in one hour and
3237	there are 100 watchers that would trigger before that then inserting will
3238	have to skip roughly seven (C<ld 100>) of these watchers.
3239		3420
3240	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)	3421	=head2 VALGRIND
3241		3422
3242	That means that changing a timer costs less than removing/adding them	3423	Valgrind has a special section here because it is a popular tool that is
3243	as only the relative motion in the event queue has to be paid for.	3424	highly useful. Unfortunately, valgrind reports are very hard to interpret.
3244		3425
3245	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)	3426	If you think you found a bug (memory leak, uninitialised data access etc.)
		3427	in libev, then check twice: If valgrind reports something like:
3246		3428
3247	These just add the watcher into an array or at the head of a list.	3429	==2274== definitely lost: 0 bytes in 0 blocks.
		3430	==2274== possibly lost: 0 bytes in 0 blocks.
		3431	==2274== still reachable: 256 bytes in 1 blocks.
3248		3432
3249	=item Stopping check/prepare/idle/fork/async watchers: O(1)	3433	Then there is no memory leak, just as memory accounted to global variables
		3434	is not a memleak - the memory is still being refernced, and didn't leak.
3250		3435
3251	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	3436	Similarly, under some circumstances, valgrind might report kernel bugs
		3437	as if it were a bug in libev (e.g. in realloc or in the poll backend,
		3438	although an acceptable workaround has been found here), or it might be
		3439	confused.
3252		3440
3253	These watchers are stored in lists then need to be walked to find the	3441	Keep in mind that valgrind is a very good tool, but only a tool. Don't
3254	correct watcher to remove. The lists are usually short (you don't usually	3442	make it into some kind of religion.
3255	have many watchers waiting for the same fd or signal).
3256		3443
3257	=item Finding the next timer in each loop iteration: O(1)	3444	If you are unsure about something, feel free to contact the mailing list
		3445	with the full valgrind report and an explanation on why you think this
		3446	is a bug in libev (best check the archives, too :). However, don't be
		3447	annoyed when you get a brisk "this is no bug" answer and take the chance
		3448	of learning how to interpret valgrind properly.
3258		3449
3259	By virtue of using a binary or 4-heap, the next timer is always found at a	3450	If you need, for some reason, empty reports from valgrind for your project
3260	fixed position in the storage array.	3451	I suggest using suppression lists.
3261		3452
3262	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
3263		3453
3264	A change means an I/O watcher gets started or stopped, which requires	3454	=head1 PORTABILITY NOTES
3265	libev to recalculate its status (and possibly tell the kernel, depending
3266	on backend and whether C<ev_io_set> was used).
3267		3455
3268	=item Activating one watcher (putting it into the pending state): O(1)
3269
3270	=item Priority handling: O(number_of_priorities)
3271
3272	Priorities are implemented by allocating some space for each
3273	priority. When doing priority-based operations, libev usually has to
3274	linearly search all the priorities, but starting/stopping and activating
3275	watchers becomes O(1) w.r.t. priority handling.
3276
3277	=item Sending an ev_async: O(1)
3278
3279	=item Processing ev_async_send: O(number_of_async_watchers)
3280
3281	=item Processing signals: O(max_signal_number)
3282
3283	Sending involves a system call I<iff> there were no other C<ev_async_send>
3284	calls in the current loop iteration. Checking for async and signal events
3285	involves iterating over all running async watchers or all signal numbers.
3286
3287	=back
3288
3289
3290	=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS	3456	=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3291		3457
3292	Win32 doesn't support any of the standards (e.g. POSIX) that libev	3458	Win32 doesn't support any of the standards (e.g. POSIX) that libev
3293	requires, and its I/O model is fundamentally incompatible with the POSIX	3459	requires, and its I/O model is fundamentally incompatible with the POSIX
3294	model. Libev still offers limited functionality on this platform in	3460	model. Libev still offers limited functionality on this platform in
3295	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	3461	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
…		…
3306		3472
3307	Not a libev limitation but worth mentioning: windows apparently doesn't	3473	Not a libev limitation but worth mentioning: windows apparently doesn't
3308	accept large writes: instead of resulting in a partial write, windows will	3474	accept large writes: instead of resulting in a partial write, windows will
3309	either accept everything or return C<ENOBUFS> if the buffer is too large,	3475	either accept everything or return C<ENOBUFS> if the buffer is too large,
3310	so make sure you only write small amounts into your sockets (less than a	3476	so make sure you only write small amounts into your sockets (less than a
3311	megabyte seems safe, but thsi apparently depends on the amount of memory	3477	megabyte seems safe, but this apparently depends on the amount of memory
3312	available).	3478	available).
3313		3479
3314	Due to the many, low, and arbitrary limits on the win32 platform and	3480	Due to the many, low, and arbitrary limits on the win32 platform and
3315	the abysmal performance of winsockets, using a large number of sockets	3481	the abysmal performance of winsockets, using a large number of sockets
3316	is not recommended (and not reasonable). If your program needs to use	3482	is not recommended (and not reasonable). If your program needs to use
3317	more than a hundred or so sockets, then likely it needs to use a totally	3483	more than a hundred or so sockets, then likely it needs to use a totally
3318	different implementation for windows, as libev offers the POSIX readiness	3484	different implementation for windows, as libev offers the POSIX readiness
3319	notification model, which cannot be implemented efficiently on windows	3485	notification model, which cannot be implemented efficiently on windows
3320	(Microsoft monopoly games).	3486	(Microsoft monopoly games).
3321		3487
		3488	A typical way to use libev under windows is to embed it (see the embedding
		3489	section for details) and use the following F<evwrap.h> header file instead
		3490	of F<ev.h>:
		3491
		3492	#define EV_STANDALONE /* keeps ev from requiring config.h */
		3493	#define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
		3494
		3495	#include "ev.h"
		3496
		3497	And compile the following F<evwrap.c> file into your project (make sure
		3498	you do I<not> compile the F<ev.c> or any other embedded source files!):
		3499
		3500	#include "evwrap.h"
		3501	#include "ev.c"
		3502
3322	=over 4	3503	=over 4
3323		3504
3324	=item The winsocket select function	3505	=item The winsocket select function
3325		3506
3326	The winsocket C<select> function doesn't follow POSIX in that it	3507	The winsocket C<select> function doesn't follow POSIX in that it
3327	requires socket I<handles> and not socket I<file descriptors> (it is	3508	requires socket I<handles> and not socket I<file descriptors> (it is
3328	also extremely buggy). This makes select very inefficient, and also	3509	also extremely buggy). This makes select very inefficient, and also
3329	requires a mapping from file descriptors to socket handles. See the	3510	requires a mapping from file descriptors to socket handles (the Microsoft
		3511	C runtime provides the function C<_open_osfhandle> for this). See the
3330	discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and	3512	discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3331	C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.	3513	C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3332		3514
3333	The configuration for a "naked" win32 using the Microsoft runtime	3515	The configuration for a "naked" win32 using the Microsoft runtime
3334	libraries and raw winsocket select is:	3516	libraries and raw winsocket select is:
3335		3517
3336	#define EV_USE_SELECT 1	3518	#define EV_USE_SELECT 1
3337	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */	3519	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3338		3520
3339	Note that winsockets handling of fd sets is O(n), so you can easily get a	3521	Note that winsockets handling of fd sets is O(n), so you can easily get a
3340	complexity in the O(n²) range when using win32.	3522	complexity in the O(n²) range when using win32.
3341		3523
3342	=item Limited number of file descriptors	3524	=item Limited number of file descriptors
…		…
3366	wrap all I/O functions and provide your own fd management, but the cost of	3548	wrap all I/O functions and provide your own fd management, but the cost of
3367	calling select (O(n²)) will likely make this unworkable.	3549	calling select (O(n²)) will likely make this unworkable.
3368		3550
3369	=back	3551	=back
3370		3552
3371
3372	=head1 PORTABILITY REQUIREMENTS	3553	=head2 PORTABILITY REQUIREMENTS
3373		3554
3374	In addition to a working ISO-C implementation, libev relies on a few	3555	In addition to a working ISO-C implementation and of course the
3375	additional extensions:	3556	backend-specific APIs, libev relies on a few additional extensions:
3376		3557
3377	=over 4	3558	=over 4
3378		3559
		3560	=item C<void ()(ev_watcher_type , int revents)> must have compatible
		3561	calling conventions regardless of C<ev_watcher_type *>.
		3562
		3563	Libev assumes not only that all watcher pointers have the same internal
		3564	structure (guaranteed by POSIX but not by ISO C for example), but it also
		3565	assumes that the same (machine) code can be used to call any watcher
		3566	callback: The watcher callbacks have different type signatures, but libev
		3567	calls them using an C<ev_watcher *> internally.
		3568
3379	=item C<sig_atomic_t volatile> must be thread-atomic as well	3569	=item C<sig_atomic_t volatile> must be thread-atomic as well
3380		3570
3381	The type C<sig_atomic_t volatile> (or whatever is defined as	3571	The type C<sig_atomic_t volatile> (or whatever is defined as
3382	C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different	3572	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
3383	threads. This is not part of the specification for C<sig_atomic_t>, but is	3573	threads. This is not part of the specification for C<sig_atomic_t>, but is
3384	believed to be sufficiently portable.	3574	believed to be sufficiently portable.
3385		3575
3386	=item C<sigprocmask> must work in a threaded environment	3576	=item C<sigprocmask> must work in a threaded environment
3387		3577
…		…
3396	except the initial one, and run the default loop in the initial thread as	3586	except the initial one, and run the default loop in the initial thread as
3397	well.	3587	well.
3398		3588
3399	=item C<long> must be large enough for common memory allocation sizes	3589	=item C<long> must be large enough for common memory allocation sizes
3400		3590
3401	To improve portability and simplify using libev, libev uses C<long>	3591	To improve portability and simplify its API, libev uses C<long> internally
3402	internally instead of C<size_t> when allocating its data structures. On	3592	instead of C<size_t> when allocating its data structures. On non-POSIX
3403	non-POSIX systems (Microsoft...) this might be unexpectedly low, but	3593	systems (Microsoft...) this might be unexpectedly low, but is still at
3404	is still at least 31 bits everywhere, which is enough for hundreds of	3594	least 31 bits everywhere, which is enough for hundreds of millions of
3405	millions of watchers.	3595	watchers.
3406		3596
3407	=item C<double> must hold a time value in seconds with enough accuracy	3597	=item C<double> must hold a time value in seconds with enough accuracy
3408		3598
3409	The type C<double> is used to represent timestamps. It is required to	3599	The type C<double> is used to represent timestamps. It is required to
3410	have at least 51 bits of mantissa (and 9 bits of exponent), which is good	3600	have at least 51 bits of mantissa (and 9 bits of exponent), which is good
…		…
3414	=back	3604	=back
3415		3605
3416	If you know of other additional requirements drop me a note.	3606	If you know of other additional requirements drop me a note.
3417		3607
3418		3608
3419	=head1 COMPILER WARNINGS	3609	=head1 ALGORITHMIC COMPLEXITIES
3420		3610
3421	Depending on your compiler and compiler settings, you might get no or a	3611	In this section the complexities of (many of) the algorithms used inside
3422	lot of warnings when compiling libev code. Some people are apparently	3612	libev will be documented. For complexity discussions about backends see
3423	scared by this.	3613	the documentation for C<ev_default_init>.
3424		3614
3425	However, these are unavoidable for many reasons. For one, each compiler	3615	All of the following are about amortised time: If an array needs to be
3426	has different warnings, and each user has different tastes regarding	3616	extended, libev needs to realloc and move the whole array, but this
3427	warning options. "Warn-free" code therefore cannot be a goal except when	3617	happens asymptotically rarer with higher number of elements, so O(1) might
3428	targeting a specific compiler and compiler-version.	3618	mean that libev does a lengthy realloc operation in rare cases, but on
		3619	average it is much faster and asymptotically approaches constant time.
3429		3620
3430	Another reason is that some compiler warnings require elaborate	3621	=over 4
3431	workarounds, or other changes to the code that make it less clear and less
3432	maintainable.
3433		3622
3434	And of course, some compiler warnings are just plain stupid, or simply	3623	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
3435	wrong (because they don't actually warn about the condition their message
3436	seems to warn about).
3437		3624
3438	While libev is written to generate as few warnings as possible,	3625	This means that, when you have a watcher that triggers in one hour and
3439	"warn-free" code is not a goal, and it is recommended not to build libev	3626	there are 100 watchers that would trigger before that, then inserting will
3440	with any compiler warnings enabled unless you are prepared to cope with	3627	have to skip roughly seven (C<ld 100>) of these watchers.
3441	them (e.g. by ignoring them). Remember that warnings are just that:
3442	warnings, not errors, or proof of bugs.
3443		3628
		3629	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
3444		3630
3445	=head1 VALGRIND	3631	That means that changing a timer costs less than removing/adding them,
		3632	as only the relative motion in the event queue has to be paid for.
3446		3633
3447	Valgrind has a special section here because it is a popular tool that is	3634	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
3448	highly useful, but valgrind reports are very hard to interpret.
3449		3635
3450	If you think you found a bug (memory leak, uninitialised data access etc.)	3636	These just add the watcher into an array or at the head of a list.
3451	in libev, then check twice: If valgrind reports something like:
3452		3637
3453	==2274== definitely lost: 0 bytes in 0 blocks.	3638	=item Stopping check/prepare/idle/fork/async watchers: O(1)
3454	==2274== possibly lost: 0 bytes in 0 blocks.
3455	==2274== still reachable: 256 bytes in 1 blocks.
3456		3639
3457	Then there is no memory leak. Similarly, under some circumstances,	3640	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
3458	valgrind might report kernel bugs as if it were a bug in libev, or it
3459	might be confused (it is a very good tool, but only a tool).
3460		3641
3461	If you are unsure about something, feel free to contact the mailing list	3642	These watchers are stored in lists, so they need to be walked to find the
3462	with the full valgrind report and an explanation on why you think this is	3643	correct watcher to remove. The lists are usually short (you don't usually
3463	a bug in libev. However, don't be annoyed when you get a brisk "this is	3644	have many watchers waiting for the same fd or signal: one is typical, two
3464	no bug" answer and take the chance of learning how to interpret valgrind	3645	is rare).
3465	properly.
3466		3646
3467	If you need, for some reason, empty reports from valgrind for your project	3647	=item Finding the next timer in each loop iteration: O(1)
3468	I suggest using suppression lists.	3648
		3649	By virtue of using a binary or 4-heap, the next timer is always found at a
		3650	fixed position in the storage array.
		3651
		3652	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
		3653
		3654	A change means an I/O watcher gets started or stopped, which requires
		3655	libev to recalculate its status (and possibly tell the kernel, depending
		3656	on backend and whether C<ev_io_set> was used).
		3657
		3658	=item Activating one watcher (putting it into the pending state): O(1)
		3659
		3660	=item Priority handling: O(number_of_priorities)
		3661
		3662	Priorities are implemented by allocating some space for each
		3663	priority. When doing priority-based operations, libev usually has to
		3664	linearly search all the priorities, but starting/stopping and activating
		3665	watchers becomes O(1) with respect to priority handling.
		3666
		3667	=item Sending an ev_async: O(1)
		3668
		3669	=item Processing ev_async_send: O(number_of_async_watchers)
		3670
		3671	=item Processing signals: O(max_signal_number)
		3672
		3673	Sending involves a system call I<iff> there were no other C<ev_async_send>
		3674	calls in the current loop iteration. Checking for async and signal events
		3675	involves iterating over all running async watchers or all signal numbers.
		3676
		3677	=back
3469		3678
3470		3679
3471	=head1 AUTHOR	3680	=head1 AUTHOR
3472		3681
3473	Marc Lehmann <libev@schmorp.de>.	3682	Marc Lehmann <libev@schmorp.de>.

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.163 by root, Sat May 31 23:19:23 2008 UTC vs. Revision 1.195 by root, Mon Oct 20 17:50:48 2008 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.163 by root, Sat May 31 23:19:23 2008 UTC vs.
Revision 1.195 by root, Mon Oct 20 17:50:48 2008 UTC