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

Comparing libev/ev.pod (file contents):
Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs.
Revision 1.432 by root, Sat Apr 26 14:28:48 2014 UTC

…		…
		1	=encoding utf-8
		2
1	=head1 NAME	3	=head1 NAME
2		4
3	libev - a high performance full-featured event loop written in C	5	libev - a high performance full-featured event loop written in C
4		6
5	=head1 SYNOPSIS	7	=head1 SYNOPSIS
58	ev_timer_start (loop, &timeout_watcher);	60	ev_timer_start (loop, &timeout_watcher);
59		61
60	// now wait for events to arrive	62	// now wait for events to arrive
61	ev_run (loop, 0);	63	ev_run (loop, 0);
62		64
63	// unloop was called, so exit	65	// break was called, so exit
64	return 0;	66	return 0;
65	}	67	}
66		68
67	=head1 ABOUT THIS DOCUMENT	69	=head1 ABOUT THIS DOCUMENT
68		70
…		…
82		84
83	=head1 WHAT TO READ WHEN IN A HURRY	85	=head1 WHAT TO READ WHEN IN A HURRY
84		86
85	This manual tries to be very detailed, but unfortunately, this also makes	87	This manual tries to be very detailed, but unfortunately, this also makes
86	it very long. If you just want to know the basics of libev, I suggest	88	it very long. If you just want to know the basics of libev, I suggest
87	reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and	89	reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
88	look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and	90	look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
89	C<ev_timer> sections in L<WATCHER TYPES>.	91	C<ev_timer> sections in L</WATCHER TYPES>.
90		92
91	=head1 ABOUT LIBEV	93	=head1 ABOUT LIBEV
92		94
93	Libev is an event loop: you register interest in certain events (such as a	95	Libev is an event loop: you register interest in certain events (such as a
94	file descriptor being readable or a timeout occurring), and it will manage	96	file descriptor being readable or a timeout occurring), and it will manage
…		…
174	=item ev_tstamp ev_time ()	176	=item ev_tstamp ev_time ()
175		177
176	Returns the current time as libev would use it. Please note that the	178	Returns the current time as libev would use it. Please note that the
177	C<ev_now> function is usually faster and also often returns the timestamp	179	C<ev_now> function is usually faster and also often returns the timestamp
178	you actually want to know. Also interesting is the combination of	180	you actually want to know. Also interesting is the combination of
179	C<ev_update_now> and C<ev_now>.	181	C<ev_now_update> and C<ev_now>.
180		182
181	=item ev_sleep (ev_tstamp interval)	183	=item ev_sleep (ev_tstamp interval)
182		184
183	Sleep for the given interval: The current thread will be blocked until	185	Sleep for the given interval: The current thread will be blocked
184	either it is interrupted or the given time interval has passed. Basically	186	until either it is interrupted or the given time interval has
		187	passed (approximately - it might return a bit earlier even if not
		188	interrupted). Returns immediately if C<< interval <= 0 >>.
		189
185	this is a sub-second-resolution C<sleep ()>.	190	Basically this is a sub-second-resolution C<sleep ()>.
		191
		192	The range of the C<interval> is limited - libev only guarantees to work
		193	with sleep times of up to one day (C<< interval <= 86400 >>).
186		194
187	=item int ev_version_major ()	195	=item int ev_version_major ()
188		196
189	=item int ev_version_minor ()	197	=item int ev_version_minor ()
190		198
…		…
241	the current system, you would need to look at C<ev_embeddable_backends ()	249	the current system, you would need to look at C<ev_embeddable_backends ()
242	& ev_supported_backends ()>, likewise for recommended ones.	250	& ev_supported_backends ()>, likewise for recommended ones.
243		251
244	See the description of C<ev_embed> watchers for more info.	252	See the description of C<ev_embed> watchers for more info.
245		253
246	=item ev_set_allocator (void (cb)(void *ptr, long size))	254	=item ev_set_allocator (void (cb)(void *ptr, long size) throw ())
247		255
248	Sets the allocation function to use (the prototype is similar - the	256	Sets the allocation function to use (the prototype is similar - the
249	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	257	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
250	used to allocate and free memory (no surprises here). If it returns zero	258	used to allocate and free memory (no surprises here). If it returns zero
251	when memory needs to be allocated (C<size != 0>), the library might abort	259	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
277	}	285	}
278		286
279	...	287	...
280	ev_set_allocator (persistent_realloc);	288	ev_set_allocator (persistent_realloc);
281		289
282	=item ev_set_syserr_cb (void (cb)(const char msg))	290	=item ev_set_syserr_cb (void (cb)(const char msg) throw ())
283		291
284	Set the callback function to call on a retryable system call error (such	292	Set the callback function to call on a retryable system call error (such
285	as failed select, poll, epoll_wait). The message is a printable string	293	as failed select, poll, epoll_wait). The message is a printable string
286	indicating the system call or subsystem causing the problem. If this	294	indicating the system call or subsystem causing the problem. If this
287	callback is set, then libev will expect it to remedy the situation, no	295	callback is set, then libev will expect it to remedy the situation, no
…		…
390		398
391	If this flag bit is or'ed into the flag value (or the program runs setuid	399	If this flag bit is or'ed into the flag value (or the program runs setuid
392	or setgid) then libev will I<not> look at the environment variable	400	or setgid) then libev will I<not> look at the environment variable
393	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	401	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
394	override the flags completely if it is found in the environment. This is	402	override the flags completely if it is found in the environment. This is
395	useful to try out specific backends to test their performance, or to work	403	useful to try out specific backends to test their performance, to work
396	around bugs.	404	around bugs, or to make libev threadsafe (accessing environment variables
		405	cannot be done in a threadsafe way, but usually it works if no other
		406	thread modifies them).
397		407
398	=item C<EVFLAG_FORKCHECK>	408	=item C<EVFLAG_FORKCHECK>
399		409
400	Instead of calling C<ev_loop_fork> manually after a fork, you can also	410	Instead of calling C<ev_loop_fork> manually after a fork, you can also
401	make libev check for a fork in each iteration by enabling this flag.	411	make libev check for a fork in each iteration by enabling this flag.
…		…
435	example) that can't properly initialise their signal masks.	445	example) that can't properly initialise their signal masks.
436		446
437	=item C<EVFLAG_NOSIGMASK>	447	=item C<EVFLAG_NOSIGMASK>
438		448
439	When this flag is specified, then libev will avoid to modify the signal	449	When this flag is specified, then libev will avoid to modify the signal
440	mask. Specifically, this means you ahve to make sure signals are unblocked	450	mask. Specifically, this means you have to make sure signals are unblocked
441	when you want to receive them.	451	when you want to receive them.
442		452
443	This behaviour is useful when you want to do your own signal handling, or	453	This behaviour is useful when you want to do your own signal handling, or
444	want to handle signals only in specific threads and want to avoid libev	454	want to handle signals only in specific threads and want to avoid libev
445	unblocking the signals.	455	unblocking the signals.
		456
		457	It's also required by POSIX in a threaded program, as libev calls
		458	C<sigprocmask>, whose behaviour is officially unspecified.
446		459
447	This flag's behaviour will become the default in future versions of libev.	460	This flag's behaviour will become the default in future versions of libev.
448		461
449	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	462	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
450		463
…		…
480	=item C<EVBACKEND_EPOLL> (value 4, Linux)	493	=item C<EVBACKEND_EPOLL> (value 4, Linux)
481		494
482	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	495	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
483	kernels).	496	kernels).
484		497
485	For few fds, this backend is a bit little slower than poll and select,	498	For few fds, this backend is a bit little slower than poll and select, but
486	but it scales phenomenally better. While poll and select usually scale	499	it scales phenomenally better. While poll and select usually scale like
487	like O(total_fds) where n is the total number of fds (or the highest fd),	500	O(total_fds) where total_fds is the total number of fds (or the highest
488	epoll scales either O(1) or O(active_fds).	501	fd), epoll scales either O(1) or O(active_fds).
489		502
490	The epoll mechanism deserves honorable mention as the most misdesigned	503	The epoll mechanism deserves honorable mention as the most misdesigned
491	of the more advanced event mechanisms: mere annoyances include silently	504	of the more advanced event mechanisms: mere annoyances include silently
492	dropping file descriptors, requiring a system call per change per file	505	dropping file descriptors, requiring a system call per change per file
493	descriptor (and unnecessary guessing of parameters), problems with dup,	506	descriptor (and unnecessary guessing of parameters), problems with dup,
…		…
496	0.1ms) and so on. The biggest issue is fork races, however - if a program	509	0.1ms) and so on. The biggest issue is fork races, however - if a program
497	forks then I<both> parent and child process have to recreate the epoll	510	forks then I<both> parent and child process have to recreate the epoll
498	set, which can take considerable time (one syscall per file descriptor)	511	set, which can take considerable time (one syscall per file descriptor)
499	and is of course hard to detect.	512	and is of course hard to detect.
500		513
501	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	514	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
502	of course I<doesn't>, and epoll just loves to report events for totally	515	but of course I<doesn't>, and epoll just loves to report events for
503	I<different> file descriptors (even already closed ones, so one cannot	516	totally I<different> file descriptors (even already closed ones, so
504	even remove them from the set) than registered in the set (especially	517	one cannot even remove them from the set) than registered in the set
505	on SMP systems). Libev tries to counter these spurious notifications by	518	(especially on SMP systems). Libev tries to counter these spurious
506	employing an additional generation counter and comparing that against the	519	notifications by employing an additional generation counter and comparing
507	events to filter out spurious ones, recreating the set when required. Last	520	that against the events to filter out spurious ones, recreating the set
		521	when required. Epoll also erroneously rounds down timeouts, but gives you
		522	no way to know when and by how much, so sometimes you have to busy-wait
		523	because epoll returns immediately despite a nonzero timeout. And last
508	not least, it also refuses to work with some file descriptors which work	524	not least, it also refuses to work with some file descriptors which work
509	perfectly fine with C<select> (files, many character devices...).	525	perfectly fine with C<select> (files, many character devices...).
510		526
511	Epoll is truly the train wreck analog among event poll mechanisms.	527	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
		528	cobbled together in a hurry, no thought to design or interaction with
		529	others. Oh, the pain, will it ever stop...
512		530
513	While stopping, setting and starting an I/O watcher in the same iteration	531	While stopping, setting and starting an I/O watcher in the same iteration
514	will result in some caching, there is still a system call per such	532	will result in some caching, there is still a system call per such
515	incident (because the same I<file descriptor> could point to a different	533	incident (because the same I<file descriptor> could point to a different
516	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	534	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
553		571
554	It scales in the same way as the epoll backend, but the interface to the	572	It scales in the same way as the epoll backend, but the interface to the
555	kernel is more efficient (which says nothing about its actual speed, of	573	kernel is more efficient (which says nothing about its actual speed, of
556	course). While stopping, setting and starting an I/O watcher does never	574	course). While stopping, setting and starting an I/O watcher does never
557	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	575	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
558	two event changes per incident. Support for C<fork ()> is very bad (but	576	two event changes per incident. Support for C<fork ()> is very bad (you
559	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect	577	might have to leak fd's on fork, but it's more sane than epoll) and it
560	cases	578	drops fds silently in similarly hard-to-detect cases.
561		579
562	This backend usually performs well under most conditions.	580	This backend usually performs well under most conditions.
563		581
564	While nominally embeddable in other event loops, this doesn't work	582	While nominally embeddable in other event loops, this doesn't work
565	everywhere, so you might need to test for this. And since it is broken	583	everywhere, so you might need to test for this. And since it is broken
…		…
594	among the OS-specific backends (I vastly prefer correctness over speed	612	among the OS-specific backends (I vastly prefer correctness over speed
595	hacks).	613	hacks).
596		614
597	On the negative side, the interface is I<bizarre> - so bizarre that	615	On the negative side, the interface is I<bizarre> - so bizarre that
598	even sun itself gets it wrong in their code examples: The event polling	616	even sun itself gets it wrong in their code examples: The event polling
599	function sometimes returning events to the caller even though an error	617	function sometimes returns events to the caller even though an error
600	occurred, but with no indication whether it has done so or not (yes, it's	618	occurred, but with no indication whether it has done so or not (yes, it's
601	even documented that way) - deadly for edge-triggered interfaces where	619	even documented that way) - deadly for edge-triggered interfaces where you
602	you absolutely have to know whether an event occurred or not because you	620	absolutely have to know whether an event occurred or not because you have
603	have to re-arm the watcher.	621	to re-arm the watcher.
604		622
605	Fortunately libev seems to be able to work around these idiocies.	623	Fortunately libev seems to be able to work around these idiocies.
606		624
607	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	625	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
608	C<EVBACKEND_POLL>.	626	C<EVBACKEND_POLL>.
…		…
670	reinitialise the kernel state for backends that have one. Despite the	688	reinitialise the kernel state for backends that have one. Despite the
671	name, you can call it anytime, but it makes most sense after forking, in	689	name, you can call it anytime, but it makes most sense after forking, in
672	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the	690	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
673	child before resuming or calling C<ev_run>.	691	child before resuming or calling C<ev_run>.
674		692
675	Again, you I<have> to call it on I<any> loop that you want to re-use after	693	Again, you I<have> to call it on I<any> loop that you want to re-use after
676	a fork, I<even if you do not plan to use the loop in the parent>. This is	694	a fork, I<even if you do not plan to use the loop in the parent>. This is
677	because some kernel interfaces cough I<kqueue> cough do funny things	695	because some kernel interfaces cough I<kqueue> cough do funny things
678	during fork.	696	during fork.
679		697
680	On the other hand, you only need to call this function in the child	698	On the other hand, you only need to call this function in the child
…		…
750		768
751	This function is rarely useful, but when some event callback runs for a	769	This function is rarely useful, but when some event callback runs for a
752	very long time without entering the event loop, updating libev's idea of	770	very long time without entering the event loop, updating libev's idea of
753	the current time is a good idea.	771	the current time is a good idea.
754		772
755	See also L<The special problem of time updates> in the C<ev_timer> section.	773	See also L</The special problem of time updates> in the C<ev_timer> section.
756		774
757	=item ev_suspend (loop)	775	=item ev_suspend (loop)
758		776
759	=item ev_resume (loop)	777	=item ev_resume (loop)
760		778
…		…
778	without a previous call to C<ev_suspend>.	796	without a previous call to C<ev_suspend>.
779		797
780	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	798	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
781	event loop time (see C<ev_now_update>).	799	event loop time (see C<ev_now_update>).
782		800
783	=item ev_run (loop, int flags)	801	=item bool ev_run (loop, int flags)
784		802
785	Finally, this is it, the event handler. This function usually is called	803	Finally, this is it, the event handler. This function usually is called
786	after you have initialised all your watchers and you want to start	804	after you have initialised all your watchers and you want to start
787	handling events. It will ask the operating system for any new events, call	805	handling events. It will ask the operating system for any new events, call
788	the watcher callbacks, an then repeat the whole process indefinitely: This	806	the watcher callbacks, and then repeat the whole process indefinitely: This
789	is why event loops are called I<loops>.	807	is why event loops are called I<loops>.
790		808
791	If the flags argument is specified as C<0>, it will keep handling events	809	If the flags argument is specified as C<0>, it will keep handling events
792	until either no event watchers are active anymore or C<ev_break> was	810	until either no event watchers are active anymore or C<ev_break> was
793	called.	811	called.
		812
		813	The return value is false if there are no more active watchers (which
		814	usually means "all jobs done" or "deadlock"), and true in all other cases
		815	(which usually means " you should call C<ev_run> again").
794		816
795	Please note that an explicit C<ev_break> is usually better than	817	Please note that an explicit C<ev_break> is usually better than
796	relying on all watchers to be stopped when deciding when a program has	818	relying on all watchers to be stopped when deciding when a program has
797	finished (especially in interactive programs), but having a program	819	finished (especially in interactive programs), but having a program
798	that automatically loops as long as it has to and no longer by virtue	820	that automatically loops as long as it has to and no longer by virtue
799	of relying on its watchers stopping correctly, that is truly a thing of	821	of relying on its watchers stopping correctly, that is truly a thing of
800	beauty.	822	beauty.
801		823
802	This function is also I<mostly> exception-safe - you can break out of	824	This function is I<mostly> exception-safe - you can break out of a
803	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++	825	C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
804	exception and so on. This does not decrement the C<ev_depth> value, nor	826	exception and so on. This does not decrement the C<ev_depth> value, nor
805	will it clear any outstanding C<EVBREAK_ONE> breaks.	827	will it clear any outstanding C<EVBREAK_ONE> breaks.
806		828
807	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	829	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
808	those events and any already outstanding ones, but will not wait and	830	those events and any already outstanding ones, but will not wait and
…		…
820	This is useful if you are waiting for some external event in conjunction	842	This is useful if you are waiting for some external event in conjunction
821	with something not expressible using other libev watchers (i.e. "roll your	843	with something not expressible using other libev watchers (i.e. "roll your
822	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	844	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
823	usually a better approach for this kind of thing.	845	usually a better approach for this kind of thing.
824		846
825	Here are the gory details of what C<ev_run> does:	847	Here are the gory details of what C<ev_run> does (this is for your
		848	understanding, not a guarantee that things will work exactly like this in
		849	future versions):
826		850
827	- Increment loop depth.	851	- Increment loop depth.
828	- Reset the ev_break status.	852	- Reset the ev_break status.
829	- Before the first iteration, call any pending watchers.	853	- Before the first iteration, call any pending watchers.
830	LOOP:	854	LOOP:
…		…
863	anymore.	887	anymore.
864		888
865	... queue jobs here, make sure they register event watchers as long	889	... queue jobs here, make sure they register event watchers as long
866	... as they still have work to do (even an idle watcher will do..)	890	... as they still have work to do (even an idle watcher will do..)
867	ev_run (my_loop, 0);	891	ev_run (my_loop, 0);
868	... jobs done or somebody called unloop. yeah!	892	... jobs done or somebody called break. yeah!
869		893
870	=item ev_break (loop, how)	894	=item ev_break (loop, how)
871		895
872	Can be used to make a call to C<ev_run> return early (but only after it	896	Can be used to make a call to C<ev_run> return early (but only after it
873	has processed all outstanding events). The C<how> argument must be either	897	has processed all outstanding events). The C<how> argument must be either
…		…
936	overhead for the actual polling but can deliver many events at once.	960	overhead for the actual polling but can deliver many events at once.
937		961
938	By setting a higher I<io collect interval> you allow libev to spend more	962	By setting a higher I<io collect interval> you allow libev to spend more
939	time collecting I/O events, so you can handle more events per iteration,	963	time collecting I/O events, so you can handle more events per iteration,
940	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	964	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
941	C<ev_timer>) will be not affected. Setting this to a non-null value will	965	C<ev_timer>) will not be affected. Setting this to a non-null value will
942	introduce an additional C<ev_sleep ()> call into most loop iterations. The	966	introduce an additional C<ev_sleep ()> call into most loop iterations. The
943	sleep time ensures that libev will not poll for I/O events more often then	967	sleep time ensures that libev will not poll for I/O events more often then
944	once per this interval, on average.	968	once per this interval, on average (as long as the host time resolution is
		969	good enough).
945		970
946	Likewise, by setting a higher I<timeout collect interval> you allow libev	971	Likewise, by setting a higher I<timeout collect interval> you allow libev
947	to spend more time collecting timeouts, at the expense of increased	972	to spend more time collecting timeouts, at the expense of increased
948	latency/jitter/inexactness (the watcher callback will be called	973	latency/jitter/inexactness (the watcher callback will be called
949	later). C<ev_io> watchers will not be affected. Setting this to a non-null	974	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
995	invoke the actual watchers inside another context (another thread etc.).	1020	invoke the actual watchers inside another context (another thread etc.).
996		1021
997	If you want to reset the callback, use C<ev_invoke_pending> as new	1022	If you want to reset the callback, use C<ev_invoke_pending> as new
998	callback.	1023	callback.
999		1024
1000	=item ev_set_loop_release_cb (loop, void (release)(EV_P), void (acquire)(EV_P))	1025	=item ev_set_loop_release_cb (loop, void (release)(EV_P) throw (), void (acquire)(EV_P) throw ())
1001		1026
1002	Sometimes you want to share the same loop between multiple threads. This	1027	Sometimes you want to share the same loop between multiple threads. This
1003	can be done relatively simply by putting mutex_lock/unlock calls around	1028	can be done relatively simply by putting mutex_lock/unlock calls around
1004	each call to a libev function.	1029	each call to a libev function.
1005		1030
1006	However, C<ev_run> can run an indefinite time, so it is not feasible	1031	However, C<ev_run> can run an indefinite time, so it is not feasible
1007	to wait for it to return. One way around this is to wake up the event	1032	to wait for it to return. One way around this is to wake up the event
1008	loop via C<ev_break> and C<av_async_send>, another way is to set these	1033	loop via C<ev_break> and C<ev_async_send>, another way is to set these
1009	I<release> and I<acquire> callbacks on the loop.	1034	I<release> and I<acquire> callbacks on the loop.
1010		1035
1011	When set, then C<release> will be called just before the thread is	1036	When set, then C<release> will be called just before the thread is
1012	suspended waiting for new events, and C<acquire> is called just	1037	suspended waiting for new events, and C<acquire> is called just
1013	afterwards.	1038	afterwards.
…		…
1153		1178
1154	=item C<EV_PREPARE>	1179	=item C<EV_PREPARE>
1155		1180
1156	=item C<EV_CHECK>	1181	=item C<EV_CHECK>
1157		1182
1158	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts	1183	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1159	to gather new events, and all C<ev_check> watchers are invoked just after	1184	gather new events, and all C<ev_check> watchers are queued (not invoked)
1160	C<ev_run> has gathered them, but before it invokes any callbacks for any	1185	just after C<ev_run> has gathered them, but before it queues any callbacks
		1186	for any received events. That means C<ev_prepare> watchers are the last
		1187	watchers invoked before the event loop sleeps or polls for new events, and
		1188	C<ev_check> watchers will be invoked before any other watchers of the same
		1189	or lower priority within an event loop iteration.
		1190
1161	received events. Callbacks of both watcher types can start and stop as	1191	Callbacks of both watcher types can start and stop as many watchers as
1162	many watchers as they want, and all of them will be taken into account	1192	they want, and all of them will be taken into account (for example, a
1163	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1193	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1164	C<ev_run> from blocking).	1194	blocking).
1165		1195
1166	=item C<EV_EMBED>	1196	=item C<EV_EMBED>
1167		1197
1168	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1198	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1169		1199
…		…
1292		1322
1293	=item callback ev_cb (ev_TYPE *watcher)	1323	=item callback ev_cb (ev_TYPE *watcher)
1294		1324
1295	Returns the callback currently set on the watcher.	1325	Returns the callback currently set on the watcher.
1296		1326
1297	=item ev_cb_set (ev_TYPE *watcher, callback)	1327	=item ev_set_cb (ev_TYPE *watcher, callback)
1298		1328
1299	Change the callback. You can change the callback at virtually any time	1329	Change the callback. You can change the callback at virtually any time
1300	(modulo threads).	1330	(modulo threads).
1301		1331
1302	=item ev_set_priority (ev_TYPE *watcher, int priority)	1332	=item ev_set_priority (ev_TYPE *watcher, int priority)
…		…
1320	or might not have been clamped to the valid range.	1350	or might not have been clamped to the valid range.
1321		1351
1322	The default priority used by watchers when no priority has been set is	1352	The default priority used by watchers when no priority has been set is
1323	always C<0>, which is supposed to not be too high and not be too low :).	1353	always C<0>, which is supposed to not be too high and not be too low :).
1324		1354
1325	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of	1355	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1326	priorities.	1356	priorities.
1327		1357
1328	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1358	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1329		1359
1330	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1360	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
…		…
1355	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1385	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1356	functions that do not need a watcher.	1386	functions that do not need a watcher.
1357		1387
1358	=back	1388	=back
1359		1389
1360	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1390	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1361		1391	OWN COMPOSITE WATCHERS> idioms.
1362	Each watcher has, by default, a member C<void *data> that you can change
1363	and read at any time: libev will completely ignore it. This can be used
1364	to associate arbitrary data with your watcher. If you need more data and
1365	don't want to allocate memory and store a pointer to it in that data
1366	member, you can also "subclass" the watcher type and provide your own
1367	data:
1368
1369	struct my_io
1370	{
1371	ev_io io;
1372	int otherfd;
1373	void *somedata;
1374	struct whatever *mostinteresting;
1375	};
1376
1377	...
1378	struct my_io w;
1379	ev_io_init (&w.io, my_cb, fd, EV_READ);
1380
1381	And since your callback will be called with a pointer to the watcher, you
1382	can cast it back to your own type:
1383
1384	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1385	{
1386	struct my_io w = (struct my_io )w_;
1387	...
1388	}
1389
1390	More interesting and less C-conformant ways of casting your callback type
1391	instead have been omitted.
1392
1393	Another common scenario is to use some data structure with multiple
1394	embedded watchers:
1395
1396	struct my_biggy
1397	{
1398	int some_data;
1399	ev_timer t1;
1400	ev_timer t2;
1401	}
1402
1403	In this case getting the pointer to C<my_biggy> is a bit more
1404	complicated: Either you store the address of your C<my_biggy> struct
1405	in the C<data> member of the watcher (for woozies), or you need to use
1406	some pointer arithmetic using C<offsetof> inside your watchers (for real
1407	programmers):
1408
1409	#include <stddef.h>
1410
1411	static void
1412	t1_cb (EV_P_ ev_timer *w, int revents)
1413	{
1414	struct my_biggy big = (struct my_biggy *)
1415	(((char *)w) - offsetof (struct my_biggy, t1));
1416	}
1417
1418	static void
1419	t2_cb (EV_P_ ev_timer *w, int revents)
1420	{
1421	struct my_biggy big = (struct my_biggy *)
1422	(((char *)w) - offsetof (struct my_biggy, t2));
1423	}
1424		1392
1425	=head2 WATCHER STATES	1393	=head2 WATCHER STATES
1426		1394
1427	There are various watcher states mentioned throughout this manual -	1395	There are various watcher states mentioned throughout this manual -
1428	active, pending and so on. In this section these states and the rules to	1396	active, pending and so on. In this section these states and the rules to
1429	transition between them will be described in more detail - and while these	1397	transition between them will be described in more detail - and while these
1430	rules might look complicated, they usually do "the right thing".	1398	rules might look complicated, they usually do "the right thing".
1431		1399
1432	=over 4	1400	=over 4
1433		1401
1434	=item initialiased	1402	=item initialised
1435		1403
1436	Before a watcher can be registered with the event looop it has to be	1404	Before a watcher can be registered with the event loop it has to be
1437	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1405	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1438	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1406	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1439		1407
1440	In this state it is simply some block of memory that is suitable for use	1408	In this state it is simply some block of memory that is suitable for
1441	in an event loop. It can be moved around, freed, reused etc. at will.	1409	use in an event loop. It can be moved around, freed, reused etc. at
		1410	will - as long as you either keep the memory contents intact, or call
		1411	C<ev_TYPE_init> again.
1442		1412
1443	=item started/running/active	1413	=item started/running/active
1444		1414
1445	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1415	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1446	property of the event loop, and is actively waiting for events. While in	1416	property of the event loop, and is actively waiting for events. While in
…		…
1474	latter will clear any pending state the watcher might be in, regardless	1444	latter will clear any pending state the watcher might be in, regardless
1475	of whether it was active or not, so stopping a watcher explicitly before	1445	of whether it was active or not, so stopping a watcher explicitly before
1476	freeing it is often a good idea.	1446	freeing it is often a good idea.
1477		1447
1478	While stopped (and not pending) the watcher is essentially in the	1448	While stopped (and not pending) the watcher is essentially in the
1479	initialised state, that is it can be reused, moved, modified in any way	1449	initialised state, that is, it can be reused, moved, modified in any way
1480	you wish.	1450	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1451	it again).
1481		1452
1482	=back	1453	=back
1483		1454
1484	=head2 WATCHER PRIORITY MODELS	1455	=head2 WATCHER PRIORITY MODELS
1485		1456
…		…
1614	In general you can register as many read and/or write event watchers per	1585	In general you can register as many read and/or write event watchers per
1615	fd as you want (as long as you don't confuse yourself). Setting all file	1586	fd as you want (as long as you don't confuse yourself). Setting all file
1616	descriptors to non-blocking mode is also usually a good idea (but not	1587	descriptors to non-blocking mode is also usually a good idea (but not
1617	required if you know what you are doing).	1588	required if you know what you are doing).
1618		1589
1619	If you cannot use non-blocking mode, then force the use of a
1620	known-to-be-good backend (at the time of this writing, this includes only
1621	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1622	descriptors for which non-blocking operation makes no sense (such as
1623	files) - libev doesn't guarantee any specific behaviour in that case.
1624
1625	Another thing you have to watch out for is that it is quite easy to	1590	Another thing you have to watch out for is that it is quite easy to
1626	receive "spurious" readiness notifications, that is your callback might	1591	receive "spurious" readiness notifications, that is, your callback might
1627	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1592	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1628	because there is no data. Not only are some backends known to create a	1593	because there is no data. It is very easy to get into this situation even
1629	lot of those (for example Solaris ports), it is very easy to get into	1594	with a relatively standard program structure. Thus it is best to always
1630	this situation even with a relatively standard program structure. Thus	1595	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1631	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1632	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1596	preferable to a program hanging until some data arrives.
1633		1597
1634	If you cannot run the fd in non-blocking mode (for example you should	1598	If you cannot run the fd in non-blocking mode (for example you should
1635	not play around with an Xlib connection), then you have to separately	1599	not play around with an Xlib connection), then you have to separately
1636	re-test whether a file descriptor is really ready with a known-to-be good	1600	re-test whether a file descriptor is really ready with a known-to-be good
1637	interface such as poll (fortunately in our Xlib example, Xlib already	1601	interface such as poll (fortunately in the case of Xlib, it already does
1638	does this on its own, so its quite safe to use). Some people additionally	1602	this on its own, so its quite safe to use). Some people additionally
1639	use C<SIGALRM> and an interval timer, just to be sure you won't block	1603	use C<SIGALRM> and an interval timer, just to be sure you won't block
1640	indefinitely.	1604	indefinitely.
1641		1605
1642	But really, best use non-blocking mode.	1606	But really, best use non-blocking mode.
1643		1607
…		…
1671		1635
1672	There is no workaround possible except not registering events	1636	There is no workaround possible except not registering events
1673	for potentially C<dup ()>'ed file descriptors, or to resort to	1637	for potentially C<dup ()>'ed file descriptors, or to resort to
1674	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1638	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1675		1639
		1640	=head3 The special problem of files
		1641
		1642	Many people try to use C<select> (or libev) on file descriptors
		1643	representing files, and expect it to become ready when their program
		1644	doesn't block on disk accesses (which can take a long time on their own).
		1645
		1646	However, this cannot ever work in the "expected" way - you get a readiness
		1647	notification as soon as the kernel knows whether and how much data is
		1648	there, and in the case of open files, that's always the case, so you
		1649	always get a readiness notification instantly, and your read (or possibly
		1650	write) will still block on the disk I/O.
		1651
		1652	Another way to view it is that in the case of sockets, pipes, character
		1653	devices and so on, there is another party (the sender) that delivers data
		1654	on its own, but in the case of files, there is no such thing: the disk
		1655	will not send data on its own, simply because it doesn't know what you
		1656	wish to read - you would first have to request some data.
		1657
		1658	Since files are typically not-so-well supported by advanced notification
		1659	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1660	to files, even though you should not use it. The reason for this is
		1661	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1662	usually a tty, often a pipe, but also sometimes files or special devices
		1663	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1664	F</dev/urandom>), and even though the file might better be served with
		1665	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1666	it "just works" instead of freezing.
		1667
		1668	So avoid file descriptors pointing to files when you know it (e.g. use
		1669	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1670	when you rarely read from a file instead of from a socket, and want to
		1671	reuse the same code path.
		1672
1676	=head3 The special problem of fork	1673	=head3 The special problem of fork
1677		1674
1678	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1675	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1679	useless behaviour. Libev fully supports fork, but needs to be told about	1676	useless behaviour. Libev fully supports fork, but needs to be told about
1680	it in the child.	1677	it in the child if you want to continue to use it in the child.
1681		1678
1682	To support fork in your programs, you either have to call	1679	To support fork in your child processes, you have to call C<ev_loop_fork
1683	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1680	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1684	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1681	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1685	C<EVBACKEND_POLL>.
1686		1682
1687	=head3 The special problem of SIGPIPE	1683	=head3 The special problem of SIGPIPE
1688		1684
1689	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1685	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1690	when writing to a pipe whose other end has been closed, your program gets	1686	when writing to a pipe whose other end has been closed, your program gets
…		…
1788	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1784	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1789	monotonic clock option helps a lot here).	1785	monotonic clock option helps a lot here).
1790		1786
1791	The callback is guaranteed to be invoked only I<after> its timeout has	1787	The callback is guaranteed to be invoked only I<after> its timeout has
1792	passed (not I<at>, so on systems with very low-resolution clocks this	1788	passed (not I<at>, so on systems with very low-resolution clocks this
1793	might introduce a small delay). If multiple timers become ready during the	1789	might introduce a small delay, see "the special problem of being too
		1790	early", below). If multiple timers become ready during the same loop
1794	same loop iteration then the ones with earlier time-out values are invoked	1791	iteration then the ones with earlier time-out values are invoked before
1795	before ones of the same priority with later time-out values (but this is	1792	ones of the same priority with later time-out values (but this is no
1796	no longer true when a callback calls C<ev_run> recursively).	1793	longer true when a callback calls C<ev_run> recursively).
1797		1794
1798	=head3 Be smart about timeouts	1795	=head3 Be smart about timeouts
1799		1796
1800	Many real-world problems involve some kind of timeout, usually for error	1797	Many real-world problems involve some kind of timeout, usually for error
1801	recovery. A typical example is an HTTP request - if the other side hangs,	1798	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1876		1873
1877	In this case, it would be more efficient to leave the C<ev_timer> alone,	1874	In this case, it would be more efficient to leave the C<ev_timer> alone,
1878	but remember the time of last activity, and check for a real timeout only	1875	but remember the time of last activity, and check for a real timeout only
1879	within the callback:	1876	within the callback:
1880		1877
		1878	ev_tstamp timeout = 60.;
1881	ev_tstamp last_activity; // time of last activity	1879	ev_tstamp last_activity; // time of last activity
		1880	ev_timer timer;
1882		1881
1883	static void	1882	static void
1884	callback (EV_P_ ev_timer *w, int revents)	1883	callback (EV_P_ ev_timer *w, int revents)
1885	{	1884	{
1886	ev_tstamp now = ev_now (EV_A);	1885	// calculate when the timeout would happen
1887	ev_tstamp timeout = last_activity + 60.;	1886	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1888		1887
1889	// if last_activity + 60. is older than now, we did time out	1888	// if negative, it means we the timeout already occurred
1890	if (timeout < now)	1889	if (after < 0.)
1891	{	1890	{
1892	// timeout occurred, take action	1891	// timeout occurred, take action
1893	}	1892	}
1894	else	1893	else
1895	{	1894	{
1896	// callback was invoked, but there was some activity, re-arm	1895	// callback was invoked, but there was some recent
1897	// the watcher to fire in last_activity + 60, which is	1896	// activity. simply restart the timer to time out
1898	// guaranteed to be in the future, so "again" is positive:	1897	// after "after" seconds, which is the earliest time
1899	w->repeat = timeout - now;	1898	// the timeout can occur.
		1899	ev_timer_set (w, after, 0.);
1900	ev_timer_again (EV_A_ w);	1900	ev_timer_start (EV_A_ w);
1901	}	1901	}
1902	}	1902	}
1903		1903
1904	To summarise the callback: first calculate the real timeout (defined	1904	To summarise the callback: first calculate in how many seconds the
1905	as "60 seconds after the last activity"), then check if that time has	1905	timeout will occur (by calculating the absolute time when it would occur,
1906	been reached, which means something I<did>, in fact, time out. Otherwise	1906	C<last_activity + timeout>, and subtracting the current time, C<ev_now
1907	the callback was invoked too early (C<timeout> is in the future), so	1907	(EV_A)> from that).
1908	re-schedule the timer to fire at that future time, to see if maybe we have
1909	a timeout then.
1910		1908
1911	Note how C<ev_timer_again> is used, taking advantage of the	1909	If this value is negative, then we are already past the timeout, i.e. we
1912	C<ev_timer_again> optimisation when the timer is already running.	1910	timed out, and need to do whatever is needed in this case.
		1911
		1912	Otherwise, we now the earliest time at which the timeout would trigger,
		1913	and simply start the timer with this timeout value.
		1914
		1915	In other words, each time the callback is invoked it will check whether
		1916	the timeout occurred. If not, it will simply reschedule itself to check
		1917	again at the earliest time it could time out. Rinse. Repeat.
1913		1918
1914	This scheme causes more callback invocations (about one every 60 seconds	1919	This scheme causes more callback invocations (about one every 60 seconds
1915	minus half the average time between activity), but virtually no calls to	1920	minus half the average time between activity), but virtually no calls to
1916	libev to change the timeout.	1921	libev to change the timeout.
1917		1922
1918	To start the timer, simply initialise the watcher and set C<last_activity>	1923	To start the machinery, simply initialise the watcher and set
1919	to the current time (meaning we just have some activity :), then call the	1924	C<last_activity> to the current time (meaning there was some activity just
1920	callback, which will "do the right thing" and start the timer:	1925	now), then call the callback, which will "do the right thing" and start
		1926	the timer:
1921		1927
		1928	last_activity = ev_now (EV_A);
1922	ev_init (timer, callback);	1929	ev_init (&timer, callback);
1923	last_activity = ev_now (loop);	1930	callback (EV_A_ &timer, 0);
1924	callback (loop, timer, EV_TIMER);
1925		1931
1926	And when there is some activity, simply store the current time in	1932	When there is some activity, simply store the current time in
1927	C<last_activity>, no libev calls at all:	1933	C<last_activity>, no libev calls at all:
1928		1934
		1935	if (activity detected)
1929	last_activity = ev_now (loop);	1936	last_activity = ev_now (EV_A);
		1937
		1938	When your timeout value changes, then the timeout can be changed by simply
		1939	providing a new value, stopping the timer and calling the callback, which
		1940	will again do the right thing (for example, time out immediately :).
		1941
		1942	timeout = new_value;
		1943	ev_timer_stop (EV_A_ &timer);
		1944	callback (EV_A_ &timer, 0);
1930		1945
1931	This technique is slightly more complex, but in most cases where the	1946	This technique is slightly more complex, but in most cases where the
1932	time-out is unlikely to be triggered, much more efficient.	1947	time-out is unlikely to be triggered, much more efficient.
1933
1934	Changing the timeout is trivial as well (if it isn't hard-coded in the
1935	callback :) - just change the timeout and invoke the callback, which will
1936	fix things for you.
1937		1948
1938	=item 4. Wee, just use a double-linked list for your timeouts.	1949	=item 4. Wee, just use a double-linked list for your timeouts.
1939		1950
1940	If there is not one request, but many thousands (millions...), all	1951	If there is not one request, but many thousands (millions...), all
1941	employing some kind of timeout with the same timeout value, then one can	1952	employing some kind of timeout with the same timeout value, then one can
…		…
1968	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	1979	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1969	rather complicated, but extremely efficient, something that really pays	1980	rather complicated, but extremely efficient, something that really pays
1970	off after the first million or so of active timers, i.e. it's usually	1981	off after the first million or so of active timers, i.e. it's usually
1971	overkill :)	1982	overkill :)
1972		1983
		1984	=head3 The special problem of being too early
		1985
		1986	If you ask a timer to call your callback after three seconds, then
		1987	you expect it to be invoked after three seconds - but of course, this
		1988	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1989	guaranteed to any precision by libev - imagine somebody suspending the
		1990	process with a STOP signal for a few hours for example.
		1991
		1992	So, libev tries to invoke your callback as soon as possible I<after> the
		1993	delay has occurred, but cannot guarantee this.
		1994
		1995	A less obvious failure mode is calling your callback too early: many event
		1996	loops compare timestamps with a "elapsed delay >= requested delay", but
		1997	this can cause your callback to be invoked much earlier than you would
		1998	expect.
		1999
		2000	To see why, imagine a system with a clock that only offers full second
		2001	resolution (think windows if you can't come up with a broken enough OS
		2002	yourself). If you schedule a one-second timer at the time 500.9, then the
		2003	event loop will schedule your timeout to elapse at a system time of 500
		2004	(500.9 truncated to the resolution) + 1, or 501.
		2005
		2006	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2007	501" and invoke the callback 0.1s after it was started, even though a
		2008	one-second delay was requested - this is being "too early", despite best
		2009	intentions.
		2010
		2011	This is the reason why libev will never invoke the callback if the elapsed
		2012	delay equals the requested delay, but only when the elapsed delay is
		2013	larger than the requested delay. In the example above, libev would only invoke
		2014	the callback at system time 502, or 1.1s after the timer was started.
		2015
		2016	So, while libev cannot guarantee that your callback will be invoked
		2017	exactly when requested, it I<can> and I<does> guarantee that the requested
		2018	delay has actually elapsed, or in other words, it always errs on the "too
		2019	late" side of things.
		2020
1973	=head3 The special problem of time updates	2021	=head3 The special problem of time updates
1974		2022
1975	Establishing the current time is a costly operation (it usually takes at	2023	Establishing the current time is a costly operation (it usually takes
1976	least two system calls): EV therefore updates its idea of the current	2024	at least one system call): EV therefore updates its idea of the current
1977	time only before and after C<ev_run> collects new events, which causes a	2025	time only before and after C<ev_run> collects new events, which causes a
1978	growing difference between C<ev_now ()> and C<ev_time ()> when handling	2026	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1979	lots of events in one iteration.	2027	lots of events in one iteration.
1980		2028
1981	The relative timeouts are calculated relative to the C<ev_now ()>	2029	The relative timeouts are calculated relative to the C<ev_now ()>
…		…
1987	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2035	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1988		2036
1989	If the event loop is suspended for a long time, you can also force an	2037	If the event loop is suspended for a long time, you can also force an
1990	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2038	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1991	()>.	2039	()>.
		2040
		2041	=head3 The special problem of unsynchronised clocks
		2042
		2043	Modern systems have a variety of clocks - libev itself uses the normal
		2044	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2045	jumps).
		2046
		2047	Neither of these clocks is synchronised with each other or any other clock
		2048	on the system, so C<ev_time ()> might return a considerably different time
		2049	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2050	a call to C<gettimeofday> might return a second count that is one higher
		2051	than a directly following call to C<time>.
		2052
		2053	The moral of this is to only compare libev-related timestamps with
		2054	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2055	a second or so.
		2056
		2057	One more problem arises due to this lack of synchronisation: if libev uses
		2058	the system monotonic clock and you compare timestamps from C<ev_time>
		2059	or C<ev_now> from when you started your timer and when your callback is
		2060	invoked, you will find that sometimes the callback is a bit "early".
		2061
		2062	This is because C<ev_timer>s work in real time, not wall clock time, so
		2063	libev makes sure your callback is not invoked before the delay happened,
		2064	I<measured according to the real time>, not the system clock.
		2065
		2066	If your timeouts are based on a physical timescale (e.g. "time out this
		2067	connection after 100 seconds") then this shouldn't bother you as it is
		2068	exactly the right behaviour.
		2069
		2070	If you want to compare wall clock/system timestamps to your timers, then
		2071	you need to use C<ev_periodic>s, as these are based on the wall clock
		2072	time, where your comparisons will always generate correct results.
1992		2073
1993	=head3 The special problems of suspended animation	2074	=head3 The special problems of suspended animation
1994		2075
1995	When you leave the server world it is quite customary to hit machines that	2076	When you leave the server world it is quite customary to hit machines that
1996	can suspend/hibernate - what happens to the clocks during such a suspend?	2077	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
2040	keep up with the timer (because it takes longer than those 10 seconds to	2121	keep up with the timer (because it takes longer than those 10 seconds to
2041	do stuff) the timer will not fire more than once per event loop iteration.	2122	do stuff) the timer will not fire more than once per event loop iteration.
2042		2123
2043	=item ev_timer_again (loop, ev_timer *)	2124	=item ev_timer_again (loop, ev_timer *)
2044		2125
2045	This will act as if the timer timed out and restart it again if it is	2126	This will act as if the timer timed out, and restarts it again if it is
2046	repeating. The exact semantics are:	2127	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2128	timeout to the C<repeat> value and calling C<ev_timer_start>.
2047		2129
		2130	The exact semantics are as in the following rules, all of which will be
		2131	applied to the watcher:
		2132
		2133	=over 4
		2134
2048	If the timer is pending, its pending status is cleared.	2135	=item If the timer is pending, the pending status is always cleared.
2049		2136
2050	If the timer is started but non-repeating, stop it (as if it timed out).	2137	=item If the timer is started but non-repeating, stop it (as if it timed
		2138	out, without invoking it).
2051		2139
2052	If the timer is repeating, either start it if necessary (with the	2140	=item If the timer is repeating, make the C<repeat> value the new timeout
2053	C<repeat> value), or reset the running timer to the C<repeat> value.	2141	and start the timer, if necessary.
2054		2142
		2143	=back
		2144
2055	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2145	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2056	usage example.	2146	usage example.
2057		2147
2058	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2148	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2059		2149
2060	Returns the remaining time until a timer fires. If the timer is active,	2150	Returns the remaining time until a timer fires. If the timer is active,
…		…
2180		2270
2181	Another way to think about it (for the mathematically inclined) is that	2271	Another way to think about it (for the mathematically inclined) is that
2182	C<ev_periodic> will try to run the callback in this mode at the next possible	2272	C<ev_periodic> will try to run the callback in this mode at the next possible
2183	time where C<time = offset (mod interval)>, regardless of any time jumps.	2273	time where C<time = offset (mod interval)>, regardless of any time jumps.
2184		2274
2185	For numerical stability it is preferable that the C<offset> value is near	2275	The C<interval> I<MUST> be positive, and for numerical stability, the
2186	C<ev_now ()> (the current time), but there is no range requirement for	2276	interval value should be higher than C<1/8192> (which is around 100
2187	this value, and in fact is often specified as zero.	2277	microseconds) and C<offset> should be higher than C<0> and should have
		2278	at most a similar magnitude as the current time (say, within a factor of
		2279	ten). Typical values for offset are, in fact, C<0> or something between
		2280	C<0> and C<interval>, which is also the recommended range.
2188		2281
2189	Note also that there is an upper limit to how often a timer can fire (CPU	2282	Note also that there is an upper limit to how often a timer can fire (CPU
2190	speed for example), so if C<interval> is very small then timing stability	2283	speed for example), so if C<interval> is very small then timing stability
2191	will of course deteriorate. Libev itself tries to be exact to be about one	2284	will of course deteriorate. Libev itself tries to be exact to be about one
2192	millisecond (if the OS supports it and the machine is fast enough).	2285	millisecond (if the OS supports it and the machine is fast enough).
…		…
2300		2393
2301	ev_periodic hourly_tick;	2394	ev_periodic hourly_tick;
2302	ev_periodic_init (&hourly_tick, clock_cb,	2395	ev_periodic_init (&hourly_tick, clock_cb,
2303	fmod (ev_now (loop), 3600.), 3600., 0);	2396	fmod (ev_now (loop), 3600.), 3600., 0);
2304	ev_periodic_start (loop, &hourly_tick);	2397	ev_periodic_start (loop, &hourly_tick);
2305		2398
2306		2399
2307	=head2 C<ev_signal> - signal me when a signal gets signalled!	2400	=head2 C<ev_signal> - signal me when a signal gets signalled!
2308		2401
2309	Signal watchers will trigger an event when the process receives a specific	2402	Signal watchers will trigger an event when the process receives a specific
2310	signal one or more times. Even though signals are very asynchronous, libev	2403	signal one or more times. Even though signals are very asynchronous, libev
…		…
2320	only within the same loop, i.e. you can watch for C<SIGINT> in your	2413	only within the same loop, i.e. you can watch for C<SIGINT> in your
2321	default loop and for C<SIGIO> in another loop, but you cannot watch for	2414	default loop and for C<SIGIO> in another loop, but you cannot watch for
2322	C<SIGINT> in both the default loop and another loop at the same time. At	2415	C<SIGINT> in both the default loop and another loop at the same time. At
2323	the moment, C<SIGCHLD> is permanently tied to the default loop.	2416	the moment, C<SIGCHLD> is permanently tied to the default loop.
2324		2417
2325	When the first watcher gets started will libev actually register something	2418	Only after the first watcher for a signal is started will libev actually
2326	with the kernel (thus it coexists with your own signal handlers as long as	2419	register something with the kernel. It thus coexists with your own signal
2327	you don't register any with libev for the same signal).	2420	handlers as long as you don't register any with libev for the same signal.
2328		2421
2329	If possible and supported, libev will install its handlers with	2422	If possible and supported, libev will install its handlers with
2330	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2423	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2331	not be unduly interrupted. If you have a problem with system calls getting	2424	not be unduly interrupted. If you have a problem with system calls getting
2332	interrupted by signals you can block all signals in an C<ev_check> watcher	2425	interrupted by signals you can block all signals in an C<ev_check> watcher
…		…
2335	=head3 The special problem of inheritance over fork/execve/pthread_create	2428	=head3 The special problem of inheritance over fork/execve/pthread_create
2336		2429
2337	Both the signal mask (C<sigprocmask>) and the signal disposition	2430	Both the signal mask (C<sigprocmask>) and the signal disposition
2338	(C<sigaction>) are unspecified after starting a signal watcher (and after	2431	(C<sigaction>) are unspecified after starting a signal watcher (and after
2339	stopping it again), that is, libev might or might not block the signal,	2432	stopping it again), that is, libev might or might not block the signal,
2340	and might or might not set or restore the installed signal handler.	2433	and might or might not set or restore the installed signal handler (but
		2434	see C<EVFLAG_NOSIGMASK>).
2341		2435
2342	While this does not matter for the signal disposition (libev never	2436	While this does not matter for the signal disposition (libev never
2343	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2437	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2344	C<execve>), this matters for the signal mask: many programs do not expect	2438	C<execve>), this matters for the signal mask: many programs do not expect
2345	certain signals to be blocked.	2439	certain signals to be blocked.
…		…
2516		2610
2517	=head2 C<ev_stat> - did the file attributes just change?	2611	=head2 C<ev_stat> - did the file attributes just change?
2518		2612
2519	This watches a file system path for attribute changes. That is, it calls	2613	This watches a file system path for attribute changes. That is, it calls
2520	C<stat> on that path in regular intervals (or when the OS says it changed)	2614	C<stat> on that path in regular intervals (or when the OS says it changed)
2521	and sees if it changed compared to the last time, invoking the callback if	2615	and sees if it changed compared to the last time, invoking the callback
2522	it did.	2616	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2617	happen after the watcher has been started will be reported.
2523		2618
2524	The path does not need to exist: changing from "path exists" to "path does	2619	The path does not need to exist: changing from "path exists" to "path does
2525	not exist" is a status change like any other. The condition "path does not	2620	not exist" is a status change like any other. The condition "path does not
2526	exist" (or more correctly "path cannot be stat'ed") is signified by the	2621	exist" (or more correctly "path cannot be stat'ed") is signified by the
2527	C<st_nlink> field being zero (which is otherwise always forced to be at	2622	C<st_nlink> field being zero (which is otherwise always forced to be at
…		…
2757	Apart from keeping your process non-blocking (which is a useful	2852	Apart from keeping your process non-blocking (which is a useful
2758	effect on its own sometimes), idle watchers are a good place to do	2853	effect on its own sometimes), idle watchers are a good place to do
2759	"pseudo-background processing", or delay processing stuff to after the	2854	"pseudo-background processing", or delay processing stuff to after the
2760	event loop has handled all outstanding events.	2855	event loop has handled all outstanding events.
2761		2856
		2857	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2858
		2859	As long as there is at least one active idle watcher, libev will never
		2860	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2861	For this to work, the idle watcher doesn't need to be invoked at all - the
		2862	lowest priority will do.
		2863
		2864	This mode of operation can be useful together with an C<ev_check> watcher,
		2865	to do something on each event loop iteration - for example to balance load
		2866	between different connections.
		2867
		2868	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2869	example.
		2870
2762	=head3 Watcher-Specific Functions and Data Members	2871	=head3 Watcher-Specific Functions and Data Members
2763		2872
2764	=over 4	2873	=over 4
2765		2874
2766	=item ev_idle_init (ev_idle *, callback)	2875	=item ev_idle_init (ev_idle *, callback)
…		…
2777	callback, free it. Also, use no error checking, as usual.	2886	callback, free it. Also, use no error checking, as usual.
2778		2887
2779	static void	2888	static void
2780	idle_cb (struct ev_loop loop, ev_idle w, int revents)	2889	idle_cb (struct ev_loop loop, ev_idle w, int revents)
2781	{	2890	{
		2891	// stop the watcher
		2892	ev_idle_stop (loop, w);
		2893
		2894	// now we can free it
2782	free (w);	2895	free (w);
		2896
2783	// now do something you wanted to do when the program has	2897	// now do something you wanted to do when the program has
2784	// no longer anything immediate to do.	2898	// no longer anything immediate to do.
2785	}	2899	}
2786		2900
2787	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2901	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2789	ev_idle_start (loop, idle_watcher);	2903	ev_idle_start (loop, idle_watcher);
2790		2904
2791		2905
2792	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2906	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2793		2907
2794	Prepare and check watchers are usually (but not always) used in pairs:	2908	Prepare and check watchers are often (but not always) used in pairs:
2795	prepare watchers get invoked before the process blocks and check watchers	2909	prepare watchers get invoked before the process blocks and check watchers
2796	afterwards.	2910	afterwards.
2797		2911
2798	You I<must not> call C<ev_run> or similar functions that enter	2912	You I<must not> call C<ev_run> or similar functions that enter
2799	the current event loop from either C<ev_prepare> or C<ev_check>	2913	the current event loop from either C<ev_prepare> or C<ev_check>
…		…
2827	with priority higher than or equal to the event loop and one coroutine	2941	with priority higher than or equal to the event loop and one coroutine
2828	of lower priority, but only once, using idle watchers to keep the event	2942	of lower priority, but only once, using idle watchers to keep the event
2829	loop from blocking if lower-priority coroutines are active, thus mapping	2943	loop from blocking if lower-priority coroutines are active, thus mapping
2830	low-priority coroutines to idle/background tasks).	2944	low-priority coroutines to idle/background tasks).
2831		2945
2832	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2946	When used for this purpose, it is recommended to give C<ev_check> watchers
2833	priority, to ensure that they are being run before any other watchers	2947	highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2834	after the poll (this doesn't matter for C<ev_prepare> watchers).	2948	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		2949	watchers).
2835		2950
2836	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	2951	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2837	activate ("feed") events into libev. While libev fully supports this, they	2952	activate ("feed") events into libev. While libev fully supports this, they
2838	might get executed before other C<ev_check> watchers did their job. As	2953	might get executed before other C<ev_check> watchers did their job. As
2839	C<ev_check> watchers are often used to embed other (non-libev) event	2954	C<ev_check> watchers are often used to embed other (non-libev) event
2840	loops those other event loops might be in an unusable state until their	2955	loops those other event loops might be in an unusable state until their
2841	C<ev_check> watcher ran (always remind yourself to coexist peacefully with	2956	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2842	others).	2957	others).
		2958
		2959	=head3 Abusing an C<ev_check> watcher for its side-effect
		2960
		2961	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		2962	useful because they are called once per event loop iteration. For
		2963	example, if you want to handle a large number of connections fairly, you
		2964	normally only do a bit of work for each active connection, and if there
		2965	is more work to do, you wait for the next event loop iteration, so other
		2966	connections have a chance of making progress.
		2967
		2968	Using an C<ev_check> watcher is almost enough: it will be called on the
		2969	next event loop iteration. However, that isn't as soon as possible -
		2970	without external events, your C<ev_check> watcher will not be invoked.
		2971
		2972	This is where C<ev_idle> watchers come in handy - all you need is a
		2973	single global idle watcher that is active as long as you have one active
		2974	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		2975	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		2976	invoked. Neither watcher alone can do that.
2843		2977
2844	=head3 Watcher-Specific Functions and Data Members	2978	=head3 Watcher-Specific Functions and Data Members
2845		2979
2846	=over 4	2980	=over 4
2847		2981
…		…
3048		3182
3049	=over 4	3183	=over 4
3050		3184
3051	=item ev_embed_init (ev_embed , callback, struct ev_loop embedded_loop)	3185	=item ev_embed_init (ev_embed , callback, struct ev_loop embedded_loop)
3052		3186
3053	=item ev_embed_set (ev_embed , callback, struct ev_loop embedded_loop)	3187	=item ev_embed_set (ev_embed , struct ev_loop embedded_loop)
3054		3188
3055	Configures the watcher to embed the given loop, which must be	3189	Configures the watcher to embed the given loop, which must be
3056	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	3190	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3057	invoked automatically, otherwise it is the responsibility of the callback	3191	invoked automatically, otherwise it is the responsibility of the callback
3058	to invoke it (it will continue to be called until the sweep has been done,	3192	to invoke it (it will continue to be called until the sweep has been done,
…		…
3079	used).	3213	used).
3080		3214
3081	struct ev_loop *loop_hi = ev_default_init (0);	3215	struct ev_loop *loop_hi = ev_default_init (0);
3082	struct ev_loop *loop_lo = 0;	3216	struct ev_loop *loop_lo = 0;
3083	ev_embed embed;	3217	ev_embed embed;
3084		3218
3085	// see if there is a chance of getting one that works	3219	// see if there is a chance of getting one that works
3086	// (remember that a flags value of 0 means autodetection)	3220	// (remember that a flags value of 0 means autodetection)
3087	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3221	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3088	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3222	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3089	: 0;	3223	: 0;
…		…
3103	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3237	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3104		3238
3105	struct ev_loop *loop = ev_default_init (0);	3239	struct ev_loop *loop = ev_default_init (0);
3106	struct ev_loop *loop_socket = 0;	3240	struct ev_loop *loop_socket = 0;
3107	ev_embed embed;	3241	ev_embed embed;
3108		3242
3109	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3243	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3110	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3244	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3111	{	3245	{
3112	ev_embed_init (&embed, 0, loop_socket);	3246	ev_embed_init (&embed, 0, loop_socket);
3113	ev_embed_start (loop, &embed);	3247	ev_embed_start (loop, &embed);
…		…
3121		3255
3122	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3256	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3123		3257
3124	Fork watchers are called when a C<fork ()> was detected (usually because	3258	Fork watchers are called when a C<fork ()> was detected (usually because
3125	whoever is a good citizen cared to tell libev about it by calling	3259	whoever is a good citizen cared to tell libev about it by calling
3126	C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the	3260	C<ev_loop_fork>). The invocation is done before the event loop blocks next
3127	event loop blocks next and before C<ev_check> watchers are being called,	3261	and before C<ev_check> watchers are being called, and only in the child
3128	and only in the child after the fork. If whoever good citizen calling	3262	after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3129	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3263	and calls it in the wrong process, the fork handlers will be invoked, too,
3130	handlers will be invoked, too, of course.	3264	of course.
3131		3265
3132	=head3 The special problem of life after fork - how is it possible?	3266	=head3 The special problem of life after fork - how is it possible?
3133		3267
3134	Most uses of C<fork()> consist of forking, then some simple calls to set	3268	Most uses of C<fork()> consist of forking, then some simple calls to set
3135	up/change the process environment, followed by a call to C<exec()>. This	3269	up/change the process environment, followed by a call to C<exec()>. This
…		…
3216	atexit (program_exits);	3350	atexit (program_exits);
3217		3351
3218		3352
3219	=head2 C<ev_async> - how to wake up an event loop	3353	=head2 C<ev_async> - how to wake up an event loop
3220		3354
3221	In general, you cannot use an C<ev_run> from multiple threads or other	3355	In general, you cannot use an C<ev_loop> from multiple threads or other
3222	asynchronous sources such as signal handlers (as opposed to multiple event	3356	asynchronous sources such as signal handlers (as opposed to multiple event
3223	loops - those are of course safe to use in different threads).	3357	loops - those are of course safe to use in different threads).
3224		3358
3225	Sometimes, however, you need to wake up an event loop you do not control,	3359	Sometimes, however, you need to wake up an event loop you do not control,
3226	for example because it belongs to another thread. This is what C<ev_async>	3360	for example because it belongs to another thread. This is what C<ev_async>
…		…
3228	it by calling C<ev_async_send>, which is thread- and signal safe.	3362	it by calling C<ev_async_send>, which is thread- and signal safe.
3229		3363
3230	This functionality is very similar to C<ev_signal> watchers, as signals,	3364	This functionality is very similar to C<ev_signal> watchers, as signals,
3231	too, are asynchronous in nature, and signals, too, will be compressed	3365	too, are asynchronous in nature, and signals, too, will be compressed
3232	(i.e. the number of callback invocations may be less than the number of	3366	(i.e. the number of callback invocations may be less than the number of
3233	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind	3367	C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3234	of "global async watchers" by using a watcher on an otherwise unused	3368	of "global async watchers" by using a watcher on an otherwise unused
3235	signal, and C<ev_feed_signal> to signal this watcher from another thread,	3369	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3236	even without knowing which loop owns the signal.	3370	even without knowing which loop owns the signal.
3237
3238	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3239	just the default loop.
3240		3371
3241	=head3 Queueing	3372	=head3 Queueing
3242		3373
3243	C<ev_async> does not support queueing of data in any way. The reason	3374	C<ev_async> does not support queueing of data in any way. The reason
3244	is that the author does not know of a simple (or any) algorithm for a	3375	is that the author does not know of a simple (or any) algorithm for a
…		…
3336	trust me.	3467	trust me.
3337		3468
3338	=item ev_async_send (loop, ev_async *)	3469	=item ev_async_send (loop, ev_async *)
3339		3470
3340	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3471	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3341	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3472	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3473	returns.
		3474
3342	C<ev_feed_event>, this call is safe to do from other threads, signal or	3475	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3343	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3476	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3344	section below on what exactly this means).	3477	embedding section below on what exactly this means).
3345		3478
3346	Note that, as with other watchers in libev, multiple events might get	3479	Note that, as with other watchers in libev, multiple events might get
3347	compressed into a single callback invocation (another way to look at this	3480	compressed into a single callback invocation (another way to look at
3348	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3481	this is that C<ev_async> watchers are level-triggered: they are set on
3349	reset when the event loop detects that).	3482	C<ev_async_send>, reset when the event loop detects that).
3350		3483
3351	This call incurs the overhead of a system call only once per event loop	3484	This call incurs the overhead of at most one extra system call per event
3352	iteration, so while the overhead might be noticeable, it doesn't apply to	3485	loop iteration, if the event loop is blocked, and no syscall at all if
3353	repeated calls to C<ev_async_send> for the same event loop.	3486	the event loop (or your program) is processing events. That means that
		3487	repeated calls are basically free (there is no need to avoid calls for
		3488	performance reasons) and that the overhead becomes smaller (typically
		3489	zero) under load.
3354		3490
3355	=item bool = ev_async_pending (ev_async *)	3491	=item bool = ev_async_pending (ev_async *)
3356		3492
3357	Returns a non-zero value when C<ev_async_send> has been called on the	3493	Returns a non-zero value when C<ev_async_send> has been called on the
3358	watcher but the event has not yet been processed (or even noted) by the	3494	watcher but the event has not yet been processed (or even noted) by the
…		…
3413	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3549	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3414		3550
3415	=item ev_feed_fd_event (loop, int fd, int revents)	3551	=item ev_feed_fd_event (loop, int fd, int revents)
3416		3552
3417	Feed an event on the given fd, as if a file descriptor backend detected	3553	Feed an event on the given fd, as if a file descriptor backend detected
3418	the given events it.	3554	the given events.
3419		3555
3420	=item ev_feed_signal_event (loop, int signum)	3556	=item ev_feed_signal_event (loop, int signum)
3421		3557
3422	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,	3558	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3423	which is async-safe.	3559	which is async-safe.
…		…
3429		3565
3430	This section explains some common idioms that are not immediately	3566	This section explains some common idioms that are not immediately
3431	obvious. Note that examples are sprinkled over the whole manual, and this	3567	obvious. Note that examples are sprinkled over the whole manual, and this
3432	section only contains stuff that wouldn't fit anywhere else.	3568	section only contains stuff that wouldn't fit anywhere else.
3433		3569
3434	=over 4	3570	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3435		3571
3436	=item Model/nested event loop invocations and exit conditions.	3572	Each watcher has, by default, a C<void *data> member that you can read
		3573	or modify at any time: libev will completely ignore it. This can be used
		3574	to associate arbitrary data with your watcher. If you need more data and
		3575	don't want to allocate memory separately and store a pointer to it in that
		3576	data member, you can also "subclass" the watcher type and provide your own
		3577	data:
		3578
		3579	struct my_io
		3580	{
		3581	ev_io io;
		3582	int otherfd;
		3583	void *somedata;
		3584	struct whatever *mostinteresting;
		3585	};
		3586
		3587	...
		3588	struct my_io w;
		3589	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3590
		3591	And since your callback will be called with a pointer to the watcher, you
		3592	can cast it back to your own type:
		3593
		3594	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
		3595	{
		3596	struct my_io w = (struct my_io )w_;
		3597	...
		3598	}
		3599
		3600	More interesting and less C-conformant ways of casting your callback
		3601	function type instead have been omitted.
		3602
		3603	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3604
		3605	Another common scenario is to use some data structure with multiple
		3606	embedded watchers, in effect creating your own watcher that combines
		3607	multiple libev event sources into one "super-watcher":
		3608
		3609	struct my_biggy
		3610	{
		3611	int some_data;
		3612	ev_timer t1;
		3613	ev_timer t2;
		3614	}
		3615
		3616	In this case getting the pointer to C<my_biggy> is a bit more
		3617	complicated: Either you store the address of your C<my_biggy> struct in
		3618	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3619	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3620	real programmers):
		3621
		3622	#include <stddef.h>
		3623
		3624	static void
		3625	t1_cb (EV_P_ ev_timer *w, int revents)
		3626	{
		3627	struct my_biggy big = (struct my_biggy *)
		3628	(((char *)w) - offsetof (struct my_biggy, t1));
		3629	}
		3630
		3631	static void
		3632	t2_cb (EV_P_ ev_timer *w, int revents)
		3633	{
		3634	struct my_biggy big = (struct my_biggy *)
		3635	(((char *)w) - offsetof (struct my_biggy, t2));
		3636	}
		3637
		3638	=head2 AVOIDING FINISHING BEFORE RETURNING
		3639
		3640	Often you have structures like this in event-based programs:
		3641
		3642	callback ()
		3643	{
		3644	free (request);
		3645	}
		3646
		3647	request = start_new_request (..., callback);
		3648
		3649	The intent is to start some "lengthy" operation. The C<request> could be
		3650	used to cancel the operation, or do other things with it.
		3651
		3652	It's not uncommon to have code paths in C<start_new_request> that
		3653	immediately invoke the callback, for example, to report errors. Or you add
		3654	some caching layer that finds that it can skip the lengthy aspects of the
		3655	operation and simply invoke the callback with the result.
		3656
		3657	The problem here is that this will happen I<before> C<start_new_request>
		3658	has returned, so C<request> is not set.
		3659
		3660	Even if you pass the request by some safer means to the callback, you
		3661	might want to do something to the request after starting it, such as
		3662	canceling it, which probably isn't working so well when the callback has
		3663	already been invoked.
		3664
		3665	A common way around all these issues is to make sure that
		3666	C<start_new_request> I<always> returns before the callback is invoked. If
		3667	C<start_new_request> immediately knows the result, it can artificially
		3668	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3669	example, or more sneakily, by reusing an existing (stopped) watcher and
		3670	pushing it into the pending queue:
		3671
		3672	ev_set_cb (watcher, callback);
		3673	ev_feed_event (EV_A_ watcher, 0);
		3674
		3675	This way, C<start_new_request> can safely return before the callback is
		3676	invoked, while not delaying callback invocation too much.
		3677
		3678	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3437		3679
3438	Often (especially in GUI toolkits) there are places where you have	3680	Often (especially in GUI toolkits) there are places where you have
3439	I<modal> interaction, which is most easily implemented by recursively	3681	I<modal> interaction, which is most easily implemented by recursively
3440	invoking C<ev_run>.	3682	invoking C<ev_run>.
3441		3683
3442	This brings the problem of exiting - a callback might want to finish the	3684	This brings the problem of exiting - a callback might want to finish the
3443	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but	3685	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3444	a modal "Are you sure?" dialog is still waiting), or just the nested one	3686	a modal "Are you sure?" dialog is still waiting), or just the nested one
3445	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some	3687	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3446	other combination: In these cases, C<ev_break> will not work alone.	3688	other combination: In these cases, a simple C<ev_break> will not work.
3447		3689
3448	The solution is to maintain "break this loop" variable for each C<ev_run>	3690	The solution is to maintain "break this loop" variable for each C<ev_run>
3449	invocation, and use a loop around C<ev_run> until the condition is	3691	invocation, and use a loop around C<ev_run> until the condition is
3450	triggered, using C<EVRUN_ONCE>:	3692	triggered, using C<EVRUN_ONCE>:
3451		3693
…		…
3453	int exit_main_loop = 0;	3695	int exit_main_loop = 0;
3454		3696
3455	while (!exit_main_loop)	3697	while (!exit_main_loop)
3456	ev_run (EV_DEFAULT_ EVRUN_ONCE);	3698	ev_run (EV_DEFAULT_ EVRUN_ONCE);
3457		3699
3458	// in a model watcher	3700	// in a modal watcher
3459	int exit_nested_loop = 0;	3701	int exit_nested_loop = 0;
3460		3702
3461	while (!exit_nested_loop)	3703	while (!exit_nested_loop)
3462	ev_run (EV_A_ EVRUN_ONCE);	3704	ev_run (EV_A_ EVRUN_ONCE);
3463		3705
…		…
3470	exit_main_loop = 1;	3712	exit_main_loop = 1;
3471		3713
3472	// exit both	3714	// exit both
3473	exit_main_loop = exit_nested_loop = 1;	3715	exit_main_loop = exit_nested_loop = 1;
3474		3716
3475	=back	3717	=head2 THREAD LOCKING EXAMPLE
		3718
		3719	Here is a fictitious example of how to run an event loop in a different
		3720	thread from where callbacks are being invoked and watchers are
		3721	created/added/removed.
		3722
		3723	For a real-world example, see the C<EV::Loop::Async> perl module,
		3724	which uses exactly this technique (which is suited for many high-level
		3725	languages).
		3726
		3727	The example uses a pthread mutex to protect the loop data, a condition
		3728	variable to wait for callback invocations, an async watcher to notify the
		3729	event loop thread and an unspecified mechanism to wake up the main thread.
		3730
		3731	First, you need to associate some data with the event loop:
		3732
		3733	typedef struct {
		3734	mutex_t lock; /* global loop lock */
		3735	ev_async async_w;
		3736	thread_t tid;
		3737	cond_t invoke_cv;
		3738	} userdata;
		3739
		3740	void prepare_loop (EV_P)
		3741	{
		3742	// for simplicity, we use a static userdata struct.
		3743	static userdata u;
		3744
		3745	ev_async_init (&u->async_w, async_cb);
		3746	ev_async_start (EV_A_ &u->async_w);
		3747
		3748	pthread_mutex_init (&u->lock, 0);
		3749	pthread_cond_init (&u->invoke_cv, 0);
		3750
		3751	// now associate this with the loop
		3752	ev_set_userdata (EV_A_ u);
		3753	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3754	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3755
		3756	// then create the thread running ev_run
		3757	pthread_create (&u->tid, 0, l_run, EV_A);
		3758	}
		3759
		3760	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3761	solely to wake up the event loop so it takes notice of any new watchers
		3762	that might have been added:
		3763
		3764	static void
		3765	async_cb (EV_P_ ev_async *w, int revents)
		3766	{
		3767	// just used for the side effects
		3768	}
		3769
		3770	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3771	protecting the loop data, respectively.
		3772
		3773	static void
		3774	l_release (EV_P)
		3775	{
		3776	userdata *u = ev_userdata (EV_A);
		3777	pthread_mutex_unlock (&u->lock);
		3778	}
		3779
		3780	static void
		3781	l_acquire (EV_P)
		3782	{
		3783	userdata *u = ev_userdata (EV_A);
		3784	pthread_mutex_lock (&u->lock);
		3785	}
		3786
		3787	The event loop thread first acquires the mutex, and then jumps straight
		3788	into C<ev_run>:
		3789
		3790	void *
		3791	l_run (void *thr_arg)
		3792	{
		3793	struct ev_loop loop = (struct ev_loop )thr_arg;
		3794
		3795	l_acquire (EV_A);
		3796	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3797	ev_run (EV_A_ 0);
		3798	l_release (EV_A);
		3799
		3800	return 0;
		3801	}
		3802
		3803	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3804	signal the main thread via some unspecified mechanism (signals? pipe
		3805	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3806	have been called (in a while loop because a) spurious wakeups are possible
		3807	and b) skipping inter-thread-communication when there are no pending
		3808	watchers is very beneficial):
		3809
		3810	static void
		3811	l_invoke (EV_P)
		3812	{
		3813	userdata *u = ev_userdata (EV_A);
		3814
		3815	while (ev_pending_count (EV_A))
		3816	{
		3817	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3818	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3819	}
		3820	}
		3821
		3822	Now, whenever the main thread gets told to invoke pending watchers, it
		3823	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3824	thread to continue:
		3825
		3826	static void
		3827	real_invoke_pending (EV_P)
		3828	{
		3829	userdata *u = ev_userdata (EV_A);
		3830
		3831	pthread_mutex_lock (&u->lock);
		3832	ev_invoke_pending (EV_A);
		3833	pthread_cond_signal (&u->invoke_cv);
		3834	pthread_mutex_unlock (&u->lock);
		3835	}
		3836
		3837	Whenever you want to start/stop a watcher or do other modifications to an
		3838	event loop, you will now have to lock:
		3839
		3840	ev_timer timeout_watcher;
		3841	userdata *u = ev_userdata (EV_A);
		3842
		3843	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3844
		3845	pthread_mutex_lock (&u->lock);
		3846	ev_timer_start (EV_A_ &timeout_watcher);
		3847	ev_async_send (EV_A_ &u->async_w);
		3848	pthread_mutex_unlock (&u->lock);
		3849
		3850	Note that sending the C<ev_async> watcher is required because otherwise
		3851	an event loop currently blocking in the kernel will have no knowledge
		3852	about the newly added timer. By waking up the loop it will pick up any new
		3853	watchers in the next event loop iteration.
		3854
		3855	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3856
		3857	While the overhead of a callback that e.g. schedules a thread is small, it
		3858	is still an overhead. If you embed libev, and your main usage is with some
		3859	kind of threads or coroutines, you might want to customise libev so that
		3860	doesn't need callbacks anymore.
		3861
		3862	Imagine you have coroutines that you can switch to using a function
		3863	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3864	and that due to some magic, the currently active coroutine is stored in a
		3865	global called C<current_coro>. Then you can build your own "wait for libev
		3866	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3867	the differing C<;> conventions):
		3868
		3869	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3870	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3871
		3872	That means instead of having a C callback function, you store the
		3873	coroutine to switch to in each watcher, and instead of having libev call
		3874	your callback, you instead have it switch to that coroutine.
		3875
		3876	A coroutine might now wait for an event with a function called
		3877	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3878	matter when, or whether the watcher is active or not when this function is
		3879	called):
		3880
		3881	void
		3882	wait_for_event (ev_watcher *w)
		3883	{
		3884	ev_set_cb (w, current_coro);
		3885	switch_to (libev_coro);
		3886	}
		3887
		3888	That basically suspends the coroutine inside C<wait_for_event> and
		3889	continues the libev coroutine, which, when appropriate, switches back to
		3890	this or any other coroutine.
		3891
		3892	You can do similar tricks if you have, say, threads with an event queue -
		3893	instead of storing a coroutine, you store the queue object and instead of
		3894	switching to a coroutine, you push the watcher onto the queue and notify
		3895	any waiters.
		3896
		3897	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3898	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3899
		3900	// my_ev.h
		3901	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3902	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3903	#include "../libev/ev.h"
		3904
		3905	// my_ev.c
		3906	#define EV_H "my_ev.h"
		3907	#include "../libev/ev.c"
		3908
		3909	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3910	F<my_ev.c> into your project. When properly specifying include paths, you
		3911	can even use F<ev.h> as header file name directly.
3476		3912
3477		3913
3478	=head1 LIBEVENT EMULATION	3914	=head1 LIBEVENT EMULATION
3479		3915
3480	Libev offers a compatibility emulation layer for libevent. It cannot	3916	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
3510		3946
3511	=back	3947	=back
3512		3948
3513	=head1 C++ SUPPORT	3949	=head1 C++ SUPPORT
3514		3950
		3951	=head2 C API
		3952
		3953	The normal C API should work fine when used from C++: both ev.h and the
		3954	libev sources can be compiled as C++. Therefore, code that uses the C API
		3955	will work fine.
		3956
		3957	Proper exception specifications might have to be added to callbacks passed
		3958	to libev: exceptions may be thrown only from watcher callbacks, all
		3959	other callbacks (allocator, syserr, loop acquire/release and periodic
		3960	reschedule callbacks) must not throw exceptions, and might need a C<throw
		3961	()> specification. If you have code that needs to be compiled as both C
		3962	and C++ you can use the C<EV_THROW> macro for this:
		3963
		3964	static void
		3965	fatal_error (const char *msg) EV_THROW
		3966	{
		3967	perror (msg);
		3968	abort ();
		3969	}
		3970
		3971	...
		3972	ev_set_syserr_cb (fatal_error);
		3973
		3974	The only API functions that can currently throw exceptions are C<ev_run>,
		3975	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		3976	because it runs cleanup watchers).
		3977
		3978	Throwing exceptions in watcher callbacks is only supported if libev itself
		3979	is compiled with a C++ compiler or your C and C++ environments allow
		3980	throwing exceptions through C libraries (most do).
		3981
		3982	=head2 C++ API
		3983
3515	Libev comes with some simplistic wrapper classes for C++ that mainly allow	3984	Libev comes with some simplistic wrapper classes for C++ that mainly allow
3516	you to use some convenience methods to start/stop watchers and also change	3985	you to use some convenience methods to start/stop watchers and also change
3517	the callback model to a model using method callbacks on objects.	3986	the callback model to a model using method callbacks on objects.
3518		3987
3519	To use it,	3988	To use it,
3520		3989
3521	#include <ev++.h>	3990	#include <ev++.h>
3522		3991
3523	This automatically includes F<ev.h> and puts all of its definitions (many	3992	This automatically includes F<ev.h> and puts all of its definitions (many
3524	of them macros) into the global namespace. All C++ specific things are	3993	of them macros) into the global namespace. All C++ specific things are
3525	put into the C<ev> namespace. It should support all the same embedding	3994	put into the C<ev> namespace. It should support all the same embedding
…		…
3534	with C<operator ()> can be used as callbacks. Other types should be easy	4003	with C<operator ()> can be used as callbacks. Other types should be easy
3535	to add as long as they only need one additional pointer for context. If	4004	to add as long as they only need one additional pointer for context. If
3536	you need support for other types of functors please contact the author	4005	you need support for other types of functors please contact the author
3537	(preferably after implementing it).	4006	(preferably after implementing it).
3538		4007
		4008	For all this to work, your C++ compiler either has to use the same calling
		4009	conventions as your C compiler (for static member functions), or you have
		4010	to embed libev and compile libev itself as C++.
		4011
3539	Here is a list of things available in the C<ev> namespace:	4012	Here is a list of things available in the C<ev> namespace:
3540		4013
3541	=over 4	4014	=over 4
3542		4015
3543	=item C<ev::READ>, C<ev::WRITE> etc.	4016	=item C<ev::READ>, C<ev::WRITE> etc.
…		…
3552	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.	4025	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3553		4026
3554	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4027	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3555	the same name in the C<ev> namespace, with the exception of C<ev_signal>	4028	the same name in the C<ev> namespace, with the exception of C<ev_signal>
3556	which is called C<ev::sig> to avoid clashes with the C<signal> macro	4029	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3557	defines by many implementations.	4030	defined by many implementations.
3558		4031
3559	All of those classes have these methods:	4032	All of those classes have these methods:
3560		4033
3561	=over 4	4034	=over 4
3562		4035
…		…
3624	void operator() (ev::io &w, int revents)	4097	void operator() (ev::io &w, int revents)
3625	{	4098	{
3626	...	4099	...
3627	}	4100	}
3628	}	4101	}
3629		4102
3630	myfunctor f;	4103	myfunctor f;
3631		4104
3632	ev::io w;	4105	ev::io w;
3633	w.set (&f);	4106	w.set (&f);
3634		4107
…		…
3652	Associates a different C<struct ev_loop> with this watcher. You can only	4125	Associates a different C<struct ev_loop> with this watcher. You can only
3653	do this when the watcher is inactive (and not pending either).	4126	do this when the watcher is inactive (and not pending either).
3654		4127
3655	=item w->set ([arguments])	4128	=item w->set ([arguments])
3656		4129
3657	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this	4130	Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
3658	method or a suitable start method must be called at least once. Unlike the	4131	with the same arguments. Either this method or a suitable start method
3659	C counterpart, an active watcher gets automatically stopped and restarted	4132	must be called at least once. Unlike the C counterpart, an active watcher
3660	when reconfiguring it with this method.	4133	gets automatically stopped and restarted when reconfiguring it with this
		4134	method.
		4135
		4136	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4137	clashing with the C<set (loop)> method.
3661		4138
3662	=item w->start ()	4139	=item w->start ()
3663		4140
3664	Starts the watcher. Note that there is no C<loop> argument, as the	4141	Starts the watcher. Note that there is no C<loop> argument, as the
3665	constructor already stores the event loop.	4142	constructor already stores the event loop.
…		…
3695	watchers in the constructor.	4172	watchers in the constructor.
3696		4173
3697	class myclass	4174	class myclass
3698	{	4175	{
3699	ev::io io ; void io_cb (ev::io &w, int revents);	4176	ev::io io ; void io_cb (ev::io &w, int revents);
3700	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	4177	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3701	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4178	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3702		4179
3703	myclass (int fd)	4180	myclass (int fd)
3704	{	4181	{
3705	io .set <myclass, &myclass::io_cb > (this);	4182	io .set <myclass, &myclass::io_cb > (this);
…		…
3756	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4233	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3757		4234
3758	=item D	4235	=item D
3759		4236
3760	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4237	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3761	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4238	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3762		4239
3763	=item Ocaml	4240	=item Ocaml
3764		4241
3765	Erkki Seppala has written Ocaml bindings for libev, to be found at	4242	Erkki Seppala has written Ocaml bindings for libev, to be found at
3766	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4243	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3769		4246
3770	Brian Maher has written a partial interface to libev for lua (at the	4247	Brian Maher has written a partial interface to libev for lua (at the
3771	time of this writing, only C<ev_io> and C<ev_timer>), to be found at	4248	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3772	L<http://github.com/brimworks/lua-ev>.	4249	L<http://github.com/brimworks/lua-ev>.
3773		4250
		4251	=item Javascript
		4252
		4253	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4254
		4255	=item Others
		4256
		4257	There are others, and I stopped counting.
		4258
3774	=back	4259	=back
3775		4260
3776		4261
3777	=head1 MACRO MAGIC	4262	=head1 MACRO MAGIC
3778		4263
…		…
3814	suitable for use with C<EV_A>.	4299	suitable for use with C<EV_A>.
3815		4300
3816	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4301	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3817		4302
3818	Similar to the other two macros, this gives you the value of the default	4303	Similar to the other two macros, this gives you the value of the default
3819	loop, if multiple loops are supported ("ev loop default").	4304	loop, if multiple loops are supported ("ev loop default"). The default loop
		4305	will be initialised if it isn't already initialised.
		4306
		4307	For non-multiplicity builds, these macros do nothing, so you always have
		4308	to initialise the loop somewhere.
3820		4309
3821	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4310	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3822		4311
3823	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4312	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3824	default loop has been initialised (C<UC> == unchecked). Their behaviour	4313	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
3969	supported). It will also not define any of the structs usually found in	4458	supported). It will also not define any of the structs usually found in
3970	F<event.h> that are not directly supported by the libev core alone.	4459	F<event.h> that are not directly supported by the libev core alone.
3971		4460
3972	In standalone mode, libev will still try to automatically deduce the	4461	In standalone mode, libev will still try to automatically deduce the
3973	configuration, but has to be more conservative.	4462	configuration, but has to be more conservative.
		4463
		4464	=item EV_USE_FLOOR
		4465
		4466	If defined to be C<1>, libev will use the C<floor ()> function for its
		4467	periodic reschedule calculations, otherwise libev will fall back on a
		4468	portable (slower) implementation. If you enable this, you usually have to
		4469	link against libm or something equivalent. Enabling this when the C<floor>
		4470	function is not available will fail, so the safe default is to not enable
		4471	this.
3974		4472
3975	=item EV_USE_MONOTONIC	4473	=item EV_USE_MONOTONIC
3976		4474
3977	If defined to be C<1>, libev will try to detect the availability of the	4475	If defined to be C<1>, libev will try to detect the availability of the
3978	monotonic clock option at both compile time and runtime. Otherwise no	4476	monotonic clock option at both compile time and runtime. Otherwise no
…		…
4063		4561
4064	If programs implement their own fd to handle mapping on win32, then this	4562	If programs implement their own fd to handle mapping on win32, then this
4065	macro can be used to override the C<close> function, useful to unregister	4563	macro can be used to override the C<close> function, useful to unregister
4066	file descriptors again. Note that the replacement function has to close	4564	file descriptors again. Note that the replacement function has to close
4067	the underlying OS handle.	4565	the underlying OS handle.
		4566
		4567	=item EV_USE_WSASOCKET
		4568
		4569	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4570	communication socket, which works better in some environments. Otherwise,
		4571	the normal C<socket> function will be used, which works better in other
		4572	environments.
4068		4573
4069	=item EV_USE_POLL	4574	=item EV_USE_POLL
4070		4575
4071	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4576	If defined to be C<1>, libev will compile in support for the C<poll>(2)
4072	backend. Otherwise it will be enabled on non-win32 platforms. It	4577	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
4108	If defined to be C<1>, libev will compile in support for the Linux inotify	4613	If defined to be C<1>, libev will compile in support for the Linux inotify
4109	interface to speed up C<ev_stat> watchers. Its actual availability will	4614	interface to speed up C<ev_stat> watchers. Its actual availability will
4110	be detected at runtime. If undefined, it will be enabled if the headers	4615	be detected at runtime. If undefined, it will be enabled if the headers
4111	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4616	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4112		4617
		4618	=item EV_NO_SMP
		4619
		4620	If defined to be C<1>, libev will assume that memory is always coherent
		4621	between threads, that is, threads can be used, but threads never run on
		4622	different cpus (or different cpu cores). This reduces dependencies
		4623	and makes libev faster.
		4624
		4625	=item EV_NO_THREADS
		4626
		4627	If defined to be C<1>, libev will assume that it will never be called from
		4628	different threads (that includes signal handlers), which is a stronger
		4629	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4630	libev faster.
		4631
4113	=item EV_ATOMIC_T	4632	=item EV_ATOMIC_T
4114		4633
4115	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4634	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4116	access is atomic with respect to other threads or signal contexts. No such	4635	access is atomic with respect to other threads or signal contexts. No
4117	type is easily found in the C language, so you can provide your own type	4636	such type is easily found in the C language, so you can provide your own
4118	that you know is safe for your purposes. It is used both for signal handler "locking"	4637	type that you know is safe for your purposes. It is used both for signal
4119	as well as for signal and thread safety in C<ev_async> watchers.	4638	handler "locking" as well as for signal and thread safety in C<ev_async>
		4639	watchers.
4120		4640
4121	In the absence of this define, libev will use C<sig_atomic_t volatile>	4641	In the absence of this define, libev will use C<sig_atomic_t volatile>
4122	(from F<signal.h>), which is usually good enough on most platforms.	4642	(from F<signal.h>), which is usually good enough on most platforms.
4123		4643
4124	=item EV_H (h)	4644	=item EV_H (h)
…		…
4151	will have the C<struct ev_loop *> as first argument, and you can create	4671	will have the C<struct ev_loop *> as first argument, and you can create
4152	additional independent event loops. Otherwise there will be no support	4672	additional independent event loops. Otherwise there will be no support
4153	for multiple event loops and there is no first event loop pointer	4673	for multiple event loops and there is no first event loop pointer
4154	argument. Instead, all functions act on the single default loop.	4674	argument. Instead, all functions act on the single default loop.
4155		4675
		4676	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4677	default loop when multiplicity is switched off - you always have to
		4678	initialise the loop manually in this case.
		4679
4156	=item EV_MINPRI	4680	=item EV_MINPRI
4157		4681
4158	=item EV_MAXPRI	4682	=item EV_MAXPRI
4159		4683
4160	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4684	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
4196	#define EV_USE_POLL 1	4720	#define EV_USE_POLL 1
4197	#define EV_CHILD_ENABLE 1	4721	#define EV_CHILD_ENABLE 1
4198	#define EV_ASYNC_ENABLE 1	4722	#define EV_ASYNC_ENABLE 1
4199		4723
4200	The actual value is a bitset, it can be a combination of the following	4724	The actual value is a bitset, it can be a combination of the following
4201	values:	4725	values (by default, all of these are enabled):
4202		4726
4203	=over 4	4727	=over 4
4204		4728
4205	=item C<1> - faster/larger code	4729	=item C<1> - faster/larger code
4206		4730
…		…
4210	code size by roughly 30% on amd64).	4734	code size by roughly 30% on amd64).
4211		4735
4212	When optimising for size, use of compiler flags such as C<-Os> with	4736	When optimising for size, use of compiler flags such as C<-Os> with
4213	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of	4737	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4214	assertions.	4738	assertions.
		4739
		4740	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4741	(e.g. gcc with C<-Os>).
4215		4742
4216	=item C<2> - faster/larger data structures	4743	=item C<2> - faster/larger data structures
4217		4744
4218	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4745	Replaces the small 2-heap for timer management by a faster 4-heap, larger
4219	hash table sizes and so on. This will usually further increase code size	4746	hash table sizes and so on. This will usually further increase code size
4220	and can additionally have an effect on the size of data structures at	4747	and can additionally have an effect on the size of data structures at
4221	runtime.	4748	runtime.
4222		4749
		4750	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4751	(e.g. gcc with C<-Os>).
		4752
4223	=item C<4> - full API configuration	4753	=item C<4> - full API configuration
4224		4754
4225	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4755	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4226	enables multiplicity (C<EV_MULTIPLICITY>=1).	4756	enables multiplicity (C<EV_MULTIPLICITY>=1).
4227		4757
…		…
4257		4787
4258	With an intelligent-enough linker (gcc+binutils are intelligent enough	4788	With an intelligent-enough linker (gcc+binutils are intelligent enough
4259	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4789	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4260	your program might be left out as well - a binary starting a timer and an	4790	your program might be left out as well - a binary starting a timer and an
4261	I/O watcher then might come out at only 5Kb.	4791	I/O watcher then might come out at only 5Kb.
		4792
		4793	=item EV_API_STATIC
		4794
		4795	If this symbol is defined (by default it is not), then all identifiers
		4796	will have static linkage. This means that libev will not export any
		4797	identifiers, and you cannot link against libev anymore. This can be useful
		4798	when you embed libev, only want to use libev functions in a single file,
		4799	and do not want its identifiers to be visible.
		4800
		4801	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4802	wants to use libev.
		4803
		4804	This option only works when libev is compiled with a C compiler, as C++
		4805	doesn't support the required declaration syntax.
4262		4806
4263	=item EV_AVOID_STDIO	4807	=item EV_AVOID_STDIO
4264		4808
4265	If this is set to C<1> at compiletime, then libev will avoid using stdio	4809	If this is set to C<1> at compiletime, then libev will avoid using stdio
4266	functions (printf, scanf, perror etc.). This will increase the code size	4810	functions (printf, scanf, perror etc.). This will increase the code size
…		…
4410	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4954	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4411		4955
4412	#include "ev_cpp.h"	4956	#include "ev_cpp.h"
4413	#include "ev.c"	4957	#include "ev.c"
4414		4958
4415	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4959	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4416		4960
4417	=head2 THREADS AND COROUTINES	4961	=head2 THREADS AND COROUTINES
4418		4962
4419	=head3 THREADS	4963	=head3 THREADS
4420		4964
…		…
4471	default loop and triggering an C<ev_async> watcher from the default loop	5015	default loop and triggering an C<ev_async> watcher from the default loop
4472	watcher callback into the event loop interested in the signal.	5016	watcher callback into the event loop interested in the signal.
4473		5017
4474	=back	5018	=back
4475		5019
4476	=head4 THREAD LOCKING EXAMPLE	5020	See also L</THREAD LOCKING EXAMPLE>.
4477
4478	Here is a fictitious example of how to run an event loop in a different
4479	thread than where callbacks are being invoked and watchers are
4480	created/added/removed.
4481
4482	For a real-world example, see the C<EV::Loop::Async> perl module,
4483	which uses exactly this technique (which is suited for many high-level
4484	languages).
4485
4486	The example uses a pthread mutex to protect the loop data, a condition
4487	variable to wait for callback invocations, an async watcher to notify the
4488	event loop thread and an unspecified mechanism to wake up the main thread.
4489
4490	First, you need to associate some data with the event loop:
4491
4492	typedef struct {
4493	mutex_t lock; /* global loop lock */
4494	ev_async async_w;
4495	thread_t tid;
4496	cond_t invoke_cv;
4497	} userdata;
4498
4499	void prepare_loop (EV_P)
4500	{
4501	// for simplicity, we use a static userdata struct.
4502	static userdata u;
4503
4504	ev_async_init (&u->async_w, async_cb);
4505	ev_async_start (EV_A_ &u->async_w);
4506
4507	pthread_mutex_init (&u->lock, 0);
4508	pthread_cond_init (&u->invoke_cv, 0);
4509
4510	// now associate this with the loop
4511	ev_set_userdata (EV_A_ u);
4512	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4513	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4514
4515	// then create the thread running ev_loop
4516	pthread_create (&u->tid, 0, l_run, EV_A);
4517	}
4518
4519	The callback for the C<ev_async> watcher does nothing: the watcher is used
4520	solely to wake up the event loop so it takes notice of any new watchers
4521	that might have been added:
4522
4523	static void
4524	async_cb (EV_P_ ev_async *w, int revents)
4525	{
4526	// just used for the side effects
4527	}
4528
4529	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4530	protecting the loop data, respectively.
4531
4532	static void
4533	l_release (EV_P)
4534	{
4535	userdata *u = ev_userdata (EV_A);
4536	pthread_mutex_unlock (&u->lock);
4537	}
4538
4539	static void
4540	l_acquire (EV_P)
4541	{
4542	userdata *u = ev_userdata (EV_A);
4543	pthread_mutex_lock (&u->lock);
4544	}
4545
4546	The event loop thread first acquires the mutex, and then jumps straight
4547	into C<ev_run>:
4548
4549	void *
4550	l_run (void *thr_arg)
4551	{
4552	struct ev_loop loop = (struct ev_loop )thr_arg;
4553
4554	l_acquire (EV_A);
4555	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4556	ev_run (EV_A_ 0);
4557	l_release (EV_A);
4558
4559	return 0;
4560	}
4561
4562	Instead of invoking all pending watchers, the C<l_invoke> callback will
4563	signal the main thread via some unspecified mechanism (signals? pipe
4564	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4565	have been called (in a while loop because a) spurious wakeups are possible
4566	and b) skipping inter-thread-communication when there are no pending
4567	watchers is very beneficial):
4568
4569	static void
4570	l_invoke (EV_P)
4571	{
4572	userdata *u = ev_userdata (EV_A);
4573
4574	while (ev_pending_count (EV_A))
4575	{
4576	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4577	pthread_cond_wait (&u->invoke_cv, &u->lock);
4578	}
4579	}
4580
4581	Now, whenever the main thread gets told to invoke pending watchers, it
4582	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4583	thread to continue:
4584
4585	static void
4586	real_invoke_pending (EV_P)
4587	{
4588	userdata *u = ev_userdata (EV_A);
4589
4590	pthread_mutex_lock (&u->lock);
4591	ev_invoke_pending (EV_A);
4592	pthread_cond_signal (&u->invoke_cv);
4593	pthread_mutex_unlock (&u->lock);
4594	}
4595
4596	Whenever you want to start/stop a watcher or do other modifications to an
4597	event loop, you will now have to lock:
4598
4599	ev_timer timeout_watcher;
4600	userdata *u = ev_userdata (EV_A);
4601
4602	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4603
4604	pthread_mutex_lock (&u->lock);
4605	ev_timer_start (EV_A_ &timeout_watcher);
4606	ev_async_send (EV_A_ &u->async_w);
4607	pthread_mutex_unlock (&u->lock);
4608
4609	Note that sending the C<ev_async> watcher is required because otherwise
4610	an event loop currently blocking in the kernel will have no knowledge
4611	about the newly added timer. By waking up the loop it will pick up any new
4612	watchers in the next event loop iteration.
4613		5021
4614	=head3 COROUTINES	5022	=head3 COROUTINES
4615		5023
4616	Libev is very accommodating to coroutines ("cooperative threads"):	5024	Libev is very accommodating to coroutines ("cooperative threads"):
4617	libev fully supports nesting calls to its functions from different	5025	libev fully supports nesting calls to its functions from different
…		…
4782	requires, and its I/O model is fundamentally incompatible with the POSIX	5190	requires, and its I/O model is fundamentally incompatible with the POSIX
4783	model. Libev still offers limited functionality on this platform in	5191	model. Libev still offers limited functionality on this platform in
4784	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5192	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4785	descriptors. This only applies when using Win32 natively, not when using	5193	descriptors. This only applies when using Win32 natively, not when using
4786	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	5194	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4787	as every compielr comes with a slightly differently broken/incompatible	5195	as every compiler comes with a slightly differently broken/incompatible
4788	environment.	5196	environment.
4789		5197
4790	Lifting these limitations would basically require the full	5198	Lifting these limitations would basically require the full
4791	re-implementation of the I/O system. If you are into this kind of thing,	5199	re-implementation of the I/O system. If you are into this kind of thing,
4792	then note that glib does exactly that for you in a very portable way (note	5200	then note that glib does exactly that for you in a very portable way (note
…		…
4908	thread" or will block signals process-wide, both behaviours would	5316	thread" or will block signals process-wide, both behaviours would
4909	be compatible with libev. Interaction between C<sigprocmask> and	5317	be compatible with libev. Interaction between C<sigprocmask> and
4910	C<pthread_sigmask> could complicate things, however.	5318	C<pthread_sigmask> could complicate things, however.
4911		5319
4912	The most portable way to handle signals is to block signals in all threads	5320	The most portable way to handle signals is to block signals in all threads
4913	except the initial one, and run the default loop in the initial thread as	5321	except the initial one, and run the signal handling loop in the initial
4914	well.	5322	thread as well.
4915		5323
4916	=item C<long> must be large enough for common memory allocation sizes	5324	=item C<long> must be large enough for common memory allocation sizes
4917		5325
4918	To improve portability and simplify its API, libev uses C<long> internally	5326	To improve portability and simplify its API, libev uses C<long> internally
4919	instead of C<size_t> when allocating its data structures. On non-POSIX	5327	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4925		5333
4926	The type C<double> is used to represent timestamps. It is required to	5334	The type C<double> is used to represent timestamps. It is required to
4927	have at least 51 bits of mantissa (and 9 bits of exponent), which is	5335	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4928	good enough for at least into the year 4000 with millisecond accuracy	5336	good enough for at least into the year 4000 with millisecond accuracy
4929	(the design goal for libev). This requirement is overfulfilled by	5337	(the design goal for libev). This requirement is overfulfilled by
4930	implementations using IEEE 754, which is basically all existing ones. With	5338	implementations using IEEE 754, which is basically all existing ones.
		5339
4931	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5340	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5341	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5342	is either obsolete or somebody patched it to use C<long double> or
		5343	something like that, just kidding).
4932		5344
4933	=back	5345	=back
4934		5346
4935	If you know of other additional requirements drop me a note.	5347	If you know of other additional requirements drop me a note.
4936		5348
…		…
4998	=item Processing ev_async_send: O(number_of_async_watchers)	5410	=item Processing ev_async_send: O(number_of_async_watchers)
4999		5411
5000	=item Processing signals: O(max_signal_number)	5412	=item Processing signals: O(max_signal_number)
5001		5413
5002	Sending involves a system call I<iff> there were no other C<ev_async_send>	5414	Sending involves a system call I<iff> there were no other C<ev_async_send>
5003	calls in the current loop iteration. Checking for async and signal events	5415	calls in the current loop iteration and the loop is currently
		5416	blocked. Checking for async and signal events involves iterating over all
5004	involves iterating over all running async watchers or all signal numbers.	5417	running async watchers or all signal numbers.
5005		5418
5006	=back	5419	=back
5007		5420
5008		5421
5009	=head1 PORTING FROM LIBEV 3.X TO 4.X	5422	=head1 PORTING FROM LIBEV 3.X TO 4.X
…		…
5018	=over 4	5431	=over 4
5019		5432
5020	=item C<EV_COMPAT3> backwards compatibility mechanism	5433	=item C<EV_COMPAT3> backwards compatibility mechanism
5021		5434
5022	The backward compatibility mechanism can be controlled by	5435	The backward compatibility mechanism can be controlled by
5023	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>	5436	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5024	section.	5437	section.
5025		5438
5026	=item C<ev_default_destroy> and C<ev_default_fork> have been removed	5439	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5027		5440
5028	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:	5441	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
…		…
5071	=over 4	5484	=over 4
5072		5485
5073	=item active	5486	=item active
5074		5487
5075	A watcher is active as long as it has been started and not yet stopped.	5488	A watcher is active as long as it has been started and not yet stopped.
5076	See L<WATCHER STATES> for details.	5489	See L</WATCHER STATES> for details.
5077		5490
5078	=item application	5491	=item application
5079		5492
5080	In this document, an application is whatever is using libev.	5493	In this document, an application is whatever is using libev.
5081		5494
…		…
5117	watchers and events.	5530	watchers and events.
5118		5531
5119	=item pending	5532	=item pending
5120		5533
5121	A watcher is pending as soon as the corresponding event has been	5534	A watcher is pending as soon as the corresponding event has been
5122	detected. See L<WATCHER STATES> for details.	5535	detected. See L</WATCHER STATES> for details.
5123		5536
5124	=item real time	5537	=item real time
5125		5538
5126	The physical time that is observed. It is apparently strictly monotonic :)	5539	The physical time that is observed. It is apparently strictly monotonic :)
5127		5540
5128	=item wall-clock time	5541	=item wall-clock time
5129		5542
5130	The time and date as shown on clocks. Unlike real time, it can actually	5543	The time and date as shown on clocks. Unlike real time, it can actually
5131	be wrong and jump forwards and backwards, e.g. when the you adjust your	5544	be wrong and jump forwards and backwards, e.g. when you adjust your
5132	clock.	5545	clock.
5133		5546
5134	=item watcher	5547	=item watcher
5135		5548
5136	A data structure that describes interest in certain events. Watchers need	5549	A data structure that describes interest in certain events. Watchers need
…		…
5139	=back	5552	=back
5140		5553
5141	=head1 AUTHOR	5554	=head1 AUTHOR
5142		5555
5143	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5556	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5144	Magnusson and Emanuele Giaquinta.	5557	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5145		5558

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs. Revision 1.432 by root, Sat Apr 26 14:28:48 2014 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.353 by root, Mon Jan 10 14:36:44 2011 UTC vs.
Revision 1.432 by root, Sat Apr 26 14:28:48 2014 UTC