ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.352 by root, Mon Jan 10 14:30:15 2011 UTC vs.
Revision 1.437 by root, Sun Oct 11 15:55:48 2015 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.
…		…
406	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	416	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
407	without a system call and thus I<very> fast, but my GNU/Linux system also has	417	without a system call and thus I<very> fast, but my GNU/Linux system also has
408	C<pthread_atfork> which is even faster).	418	C<pthread_atfork> which is even faster).
409		419
410	The big advantage of this flag is that you can forget about fork (and	420	The big advantage of this flag is that you can forget about fork (and
411	forget about forgetting to tell libev about forking) when you use this	421	forget about forgetting to tell libev about forking, although you still
412	flag.	422	have to ignore C<SIGPIPE>) when you use this flag.
413		423
414	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	424	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
415	environment variable.	425	environment variable.
416		426
417	=item C<EVFLAG_NOINOTIFY>	427	=item C<EVFLAG_NOINOTIFY>
…		…
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	occured, 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 occured 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>.
…		…
664	If you need dynamically allocated loops it is better to use C<ev_loop_new>	682	If you need dynamically allocated loops it is better to use C<ev_loop_new>
665	and C<ev_loop_destroy>.	683	and C<ev_loop_destroy>.
666		684
667	=item ev_loop_fork (loop)	685	=item ev_loop_fork (loop)
668		686
669	This function sets a flag that causes subsequent C<ev_run> iterations to	687	This function sets a flag that causes subsequent C<ev_run> iterations
670	reinitialise the kernel state for backends that have one. Despite the	688	to reinitialise the kernel state for backends that have one. Despite
671	name, you can call it anytime, but it makes most sense after forking, in	689	the name, you can call it anytime you are allowed to start or stop
672	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the	690	watchers (except inside an C<ev_prepare> callback), but it makes most
		691	sense after forking, in the child process. You I<must> call it (or use
673	child before resuming or calling C<ev_run>.	692	C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
674		693
		694	In addition, if you want to reuse a loop (via this function or
		695	C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
		696
675	Again, you I<have> to call it on I<any> loop that you want to re-use after	697	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	698	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	699	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
678	during fork.	700	during fork.
679		701
680	On the other hand, you only need to call this function in the child	702	On the other hand, you only need to call this function in the child
…		…
750		772
751	This function is rarely useful, but when some event callback runs for a	773	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	774	very long time without entering the event loop, updating libev's idea of
753	the current time is a good idea.	775	the current time is a good idea.
754		776
755	See also L<The special problem of time updates> in the C<ev_timer> section.	777	See also L</The special problem of time updates> in the C<ev_timer> section.
756		778
757	=item ev_suspend (loop)	779	=item ev_suspend (loop)
758		780
759	=item ev_resume (loop)	781	=item ev_resume (loop)
760		782
…		…
778	without a previous call to C<ev_suspend>.	800	without a previous call to C<ev_suspend>.
779		801
780	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	802	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
781	event loop time (see C<ev_now_update>).	803	event loop time (see C<ev_now_update>).
782		804
783	=item ev_run (loop, int flags)	805	=item bool ev_run (loop, int flags)
784		806
785	Finally, this is it, the event handler. This function usually is called	807	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	808	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	809	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	810	the watcher callbacks, and then repeat the whole process indefinitely: This
789	is why event loops are called I<loops>.	811	is why event loops are called I<loops>.
790		812
791	If the flags argument is specified as C<0>, it will keep handling events	813	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	814	until either no event watchers are active anymore or C<ev_break> was
793	called.	815	called.
		816
		817	The return value is false if there are no more active watchers (which
		818	usually means "all jobs done" or "deadlock"), and true in all other cases
		819	(which usually means " you should call C<ev_run> again").
794		820
795	Please note that an explicit C<ev_break> is usually better than	821	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	822	relying on all watchers to be stopped when deciding when a program has
797	finished (especially in interactive programs), but having a program	823	finished (especially in interactive programs), but having a program
798	that automatically loops as long as it has to and no longer by virtue	824	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	825	of relying on its watchers stopping correctly, that is truly a thing of
800	beauty.	826	beauty.
801		827
802	This function is also I<mostly> exception-safe - you can break out of	828	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++	829	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	830	exception and so on. This does not decrement the C<ev_depth> value, nor
805	will it clear any outstanding C<EVBREAK_ONE> breaks.	831	will it clear any outstanding C<EVBREAK_ONE> breaks.
806		832
807	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	833	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	834	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	846	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	847	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	848	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.	849	usually a better approach for this kind of thing.
824		850
825	Here are the gory details of what C<ev_run> does:	851	Here are the gory details of what C<ev_run> does (this is for your
		852	understanding, not a guarantee that things will work exactly like this in
		853	future versions):
826		854
827	- Increment loop depth.	855	- Increment loop depth.
828	- Reset the ev_break status.	856	- Reset the ev_break status.
829	- Before the first iteration, call any pending watchers.	857	- Before the first iteration, call any pending watchers.
830	LOOP:	858	LOOP:
…		…
863	anymore.	891	anymore.
864		892
865	... queue jobs here, make sure they register event watchers as long	893	... 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..)	894	... as they still have work to do (even an idle watcher will do..)
867	ev_run (my_loop, 0);	895	ev_run (my_loop, 0);
868	... jobs done or somebody called unloop. yeah!	896	... jobs done or somebody called break. yeah!
869		897
870	=item ev_break (loop, how)	898	=item ev_break (loop, how)
871		899
872	Can be used to make a call to C<ev_run> return early (but only after it	900	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	901	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.	964	overhead for the actual polling but can deliver many events at once.
937		965
938	By setting a higher I<io collect interval> you allow libev to spend more	966	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,	967	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	968	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	969	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	970	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	971	sleep time ensures that libev will not poll for I/O events more often then
944	once per this interval, on average.	972	once per this interval, on average (as long as the host time resolution is
		973	good enough).
945		974
946	Likewise, by setting a higher I<timeout collect interval> you allow libev	975	Likewise, by setting a higher I<timeout collect interval> you allow libev
947	to spend more time collecting timeouts, at the expense of increased	976	to spend more time collecting timeouts, at the expense of increased
948	latency/jitter/inexactness (the watcher callback will be called	977	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	978	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.).	1024	invoke the actual watchers inside another context (another thread etc.).
996		1025
997	If you want to reset the callback, use C<ev_invoke_pending> as new	1026	If you want to reset the callback, use C<ev_invoke_pending> as new
998	callback.	1027	callback.
999		1028
1000	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))	1029	=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
1001		1030
1002	Sometimes you want to share the same loop between multiple threads. This	1031	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	1032	can be done relatively simply by putting mutex_lock/unlock calls around
1004	each call to a libev function.	1033	each call to a libev function.
1005		1034
1006	However, C<ev_run> can run an indefinite time, so it is not feasible	1035	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	1036	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	1037	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.	1038	I<release> and I<acquire> callbacks on the loop.
1010		1039
1011	When set, then C<release> will be called just before the thread is	1040	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	1041	suspended waiting for new events, and C<acquire> is called just
1013	afterwards.	1042	afterwards.
…		…
1153		1182
1154	=item C<EV_PREPARE>	1183	=item C<EV_PREPARE>
1155		1184
1156	=item C<EV_CHECK>	1185	=item C<EV_CHECK>
1157		1186
1158	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts	1187	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	1188	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	1189	just after C<ev_run> has gathered them, but before it queues any callbacks
		1190	for any received events. That means C<ev_prepare> watchers are the last
		1191	watchers invoked before the event loop sleeps or polls for new events, and
		1192	C<ev_check> watchers will be invoked before any other watchers of the same
		1193	or lower priority within an event loop iteration.
		1194
1161	received events. Callbacks of both watcher types can start and stop as	1195	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	1196	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	1197	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1164	C<ev_run> from blocking).	1198	blocking).
1165		1199
1166	=item C<EV_EMBED>	1200	=item C<EV_EMBED>
1167		1201
1168	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1202	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1169		1203
…		…
1292		1326
1293	=item callback ev_cb (ev_TYPE *watcher)	1327	=item callback ev_cb (ev_TYPE *watcher)
1294		1328
1295	Returns the callback currently set on the watcher.	1329	Returns the callback currently set on the watcher.
1296		1330
1297	=item ev_cb_set (ev_TYPE *watcher, callback)	1331	=item ev_set_cb (ev_TYPE *watcher, callback)
1298		1332
1299	Change the callback. You can change the callback at virtually any time	1333	Change the callback. You can change the callback at virtually any time
1300	(modulo threads).	1334	(modulo threads).
1301		1335
1302	=item ev_set_priority (ev_TYPE *watcher, int priority)	1336	=item ev_set_priority (ev_TYPE *watcher, int priority)
…		…
1320	or might not have been clamped to the valid range.	1354	or might not have been clamped to the valid range.
1321		1355
1322	The default priority used by watchers when no priority has been set is	1356	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 :).	1357	always C<0>, which is supposed to not be too high and not be too low :).
1324		1358
1325	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of	1359	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1326	priorities.	1360	priorities.
1327		1361
1328	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1362	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1329		1363
1330	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1364	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	1389	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1356	functions that do not need a watcher.	1390	functions that do not need a watcher.
1357		1391
1358	=back	1392	=back
1359		1393
1360	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1394	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1361		1395	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		1396
1425	=head2 WATCHER STATES	1397	=head2 WATCHER STATES
1426		1398
1427	There are various watcher states mentioned throughout this manual -	1399	There are various watcher states mentioned throughout this manual -
1428	active, pending and so on. In this section these states and the rules to	1400	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	1401	transition between them will be described in more detail - and while these
1430	rules might look complicated, they usually do "the right thing".	1402	rules might look complicated, they usually do "the right thing".
1431		1403
1432	=over 4	1404	=over 4
1433		1405
1434	=item initialiased	1406	=item initialised
1435		1407
1436	Before a watcher can be registered with the event looop it has to be	1408	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	1409	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.	1410	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1439		1411
1440	In this state it is simply some block of memory that is suitable for use	1412	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.	1413	use in an event loop. It can be moved around, freed, reused etc. at
		1414	will - as long as you either keep the memory contents intact, or call
		1415	C<ev_TYPE_init> again.
1442		1416
1443	=item started/running/active	1417	=item started/running/active
1444		1418
1445	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1419	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	1420	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	1448	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	1449	of whether it was active or not, so stopping a watcher explicitly before
1476	freeing it is often a good idea.	1450	freeing it is often a good idea.
1477		1451
1478	While stopped (and not pending) the watcher is essentially in the	1452	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	1453	initialised state, that is, it can be reused, moved, modified in any way
1480	you wish.	1454	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1455	it again).
1481		1456
1482	=back	1457	=back
1483		1458
1484	=head2 WATCHER PRIORITY MODELS	1459	=head2 WATCHER PRIORITY MODELS
1485		1460
…		…
1614	In general you can register as many read and/or write event watchers per	1589	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	1590	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	1591	descriptors to non-blocking mode is also usually a good idea (but not
1617	required if you know what you are doing).	1592	required if you know what you are doing).
1618		1593
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	1594	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	1595	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	1596	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	1597	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	1598	with a relatively standard program structure. Thus it is best to always
1630	this situation even with a relatively standard program structure. Thus	1599	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.	1600	preferable to a program hanging until some data arrives.
1633		1601
1634	If you cannot run the fd in non-blocking mode (for example you should	1602	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	1603	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	1604	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	1605	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	1606	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	1607	use C<SIGALRM> and an interval timer, just to be sure you won't block
1640	indefinitely.	1608	indefinitely.
1641		1609
1642	But really, best use non-blocking mode.	1610	But really, best use non-blocking mode.
1643		1611
…		…
1671		1639
1672	There is no workaround possible except not registering events	1640	There is no workaround possible except not registering events
1673	for potentially C<dup ()>'ed file descriptors, or to resort to	1641	for potentially C<dup ()>'ed file descriptors, or to resort to
1674	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1642	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1675		1643
		1644	=head3 The special problem of files
		1645
		1646	Many people try to use C<select> (or libev) on file descriptors
		1647	representing files, and expect it to become ready when their program
		1648	doesn't block on disk accesses (which can take a long time on their own).
		1649
		1650	However, this cannot ever work in the "expected" way - you get a readiness
		1651	notification as soon as the kernel knows whether and how much data is
		1652	there, and in the case of open files, that's always the case, so you
		1653	always get a readiness notification instantly, and your read (or possibly
		1654	write) will still block on the disk I/O.
		1655
		1656	Another way to view it is that in the case of sockets, pipes, character
		1657	devices and so on, there is another party (the sender) that delivers data
		1658	on its own, but in the case of files, there is no such thing: the disk
		1659	will not send data on its own, simply because it doesn't know what you
		1660	wish to read - you would first have to request some data.
		1661
		1662	Since files are typically not-so-well supported by advanced notification
		1663	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1664	to files, even though you should not use it. The reason for this is
		1665	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1666	usually a tty, often a pipe, but also sometimes files or special devices
		1667	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1668	F</dev/urandom>), and even though the file might better be served with
		1669	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1670	it "just works" instead of freezing.
		1671
		1672	So avoid file descriptors pointing to files when you know it (e.g. use
		1673	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1674	when you rarely read from a file instead of from a socket, and want to
		1675	reuse the same code path.
		1676
1676	=head3 The special problem of fork	1677	=head3 The special problem of fork
1677		1678
1678	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1679	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	1680	useless behaviour. Libev fully supports fork, but needs to be told about
1680	it in the child.	1681	it in the child if you want to continue to use it in the child.
1681		1682
1682	To support fork in your programs, you either have to call	1683	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,	1684	()> 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	1685	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1685	C<EVBACKEND_POLL>.
1686		1686
1687	=head3 The special problem of SIGPIPE	1687	=head3 The special problem of SIGPIPE
1688		1688
1689	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1689	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	1690	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	1788	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1789	monotonic clock option helps a lot here).	1789	monotonic clock option helps a lot here).
1790		1790
1791	The callback is guaranteed to be invoked only I<after> its timeout has	1791	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	1792	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	1793	might introduce a small delay, see "the special problem of being too
		1794	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	1795	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	1796	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).	1797	longer true when a callback calls C<ev_run> recursively).
1797		1798
1798	=head3 Be smart about timeouts	1799	=head3 Be smart about timeouts
1799		1800
1800	Many real-world problems involve some kind of timeout, usually for error	1801	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,	1802	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1876		1877
1877	In this case, it would be more efficient to leave the C<ev_timer> alone,	1878	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	1879	but remember the time of last activity, and check for a real timeout only
1879	within the callback:	1880	within the callback:
1880		1881
		1882	ev_tstamp timeout = 60.;
1881	ev_tstamp last_activity; // time of last activity	1883	ev_tstamp last_activity; // time of last activity
		1884	ev_timer timer;
1882		1885
1883	static void	1886	static void
1884	callback (EV_P_ ev_timer *w, int revents)	1887	callback (EV_P_ ev_timer *w, int revents)
1885	{	1888	{
1886	ev_tstamp now = ev_now (EV_A);	1889	// calculate when the timeout would happen
1887	ev_tstamp timeout = last_activity + 60.;	1890	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1888		1891
1889	// if last_activity + 60. is older than now, we did time out	1892	// if negative, it means we the timeout already occurred
1890	if (timeout < now)	1893	if (after < 0.)
1891	{	1894	{
1892	// timeout occurred, take action	1895	// timeout occurred, take action
1893	}	1896	}
1894	else	1897	else
1895	{	1898	{
1896	// callback was invoked, but there was some activity, re-arm	1899	// callback was invoked, but there was some recent
1897	// the watcher to fire in last_activity + 60, which is	1900	// activity. simply restart the timer to time out
1898	// guaranteed to be in the future, so "again" is positive:	1901	// after "after" seconds, which is the earliest time
1899	w->repeat = timeout - now;	1902	// the timeout can occur.
		1903	ev_timer_set (w, after, 0.);
1900	ev_timer_again (EV_A_ w);	1904	ev_timer_start (EV_A_ w);
1901	}	1905	}
1902	}	1906	}
1903		1907
1904	To summarise the callback: first calculate the real timeout (defined	1908	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	1909	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	1910	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	1911	(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		1912
1911	Note how C<ev_timer_again> is used, taking advantage of the	1913	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.	1914	timed out, and need to do whatever is needed in this case.
		1915
		1916	Otherwise, we now the earliest time at which the timeout would trigger,
		1917	and simply start the timer with this timeout value.
		1918
		1919	In other words, each time the callback is invoked it will check whether
		1920	the timeout occurred. If not, it will simply reschedule itself to check
		1921	again at the earliest time it could time out. Rinse. Repeat.
1913		1922
1914	This scheme causes more callback invocations (about one every 60 seconds	1923	This scheme causes more callback invocations (about one every 60 seconds
1915	minus half the average time between activity), but virtually no calls to	1924	minus half the average time between activity), but virtually no calls to
1916	libev to change the timeout.	1925	libev to change the timeout.
1917		1926
1918	To start the timer, simply initialise the watcher and set C<last_activity>	1927	To start the machinery, simply initialise the watcher and set
1919	to the current time (meaning we just have some activity :), then call the	1928	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:	1929	now), then call the callback, which will "do the right thing" and start
		1930	the timer:
1921		1931
		1932	last_activity = ev_now (EV_A);
1922	ev_init (timer, callback);	1933	ev_init (&timer, callback);
1923	last_activity = ev_now (loop);	1934	callback (EV_A_ &timer, 0);
1924	callback (loop, timer, EV_TIMER);
1925		1935
1926	And when there is some activity, simply store the current time in	1936	When there is some activity, simply store the current time in
1927	C<last_activity>, no libev calls at all:	1937	C<last_activity>, no libev calls at all:
1928		1938
		1939	if (activity detected)
1929	last_activity = ev_now (loop);	1940	last_activity = ev_now (EV_A);
		1941
		1942	When your timeout value changes, then the timeout can be changed by simply
		1943	providing a new value, stopping the timer and calling the callback, which
		1944	will again do the right thing (for example, time out immediately :).
		1945
		1946	timeout = new_value;
		1947	ev_timer_stop (EV_A_ &timer);
		1948	callback (EV_A_ &timer, 0);
1930		1949
1931	This technique is slightly more complex, but in most cases where the	1950	This technique is slightly more complex, but in most cases where the
1932	time-out is unlikely to be triggered, much more efficient.	1951	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		1952
1938	=item 4. Wee, just use a double-linked list for your timeouts.	1953	=item 4. Wee, just use a double-linked list for your timeouts.
1939		1954
1940	If there is not one request, but many thousands (millions...), all	1955	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	1956	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	1983	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	1984	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	1985	off after the first million or so of active timers, i.e. it's usually
1971	overkill :)	1986	overkill :)
1972		1987
		1988	=head3 The special problem of being too early
		1989
		1990	If you ask a timer to call your callback after three seconds, then
		1991	you expect it to be invoked after three seconds - but of course, this
		1992	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1993	guaranteed to any precision by libev - imagine somebody suspending the
		1994	process with a STOP signal for a few hours for example.
		1995
		1996	So, libev tries to invoke your callback as soon as possible I<after> the
		1997	delay has occurred, but cannot guarantee this.
		1998
		1999	A less obvious failure mode is calling your callback too early: many event
		2000	loops compare timestamps with a "elapsed delay >= requested delay", but
		2001	this can cause your callback to be invoked much earlier than you would
		2002	expect.
		2003
		2004	To see why, imagine a system with a clock that only offers full second
		2005	resolution (think windows if you can't come up with a broken enough OS
		2006	yourself). If you schedule a one-second timer at the time 500.9, then the
		2007	event loop will schedule your timeout to elapse at a system time of 500
		2008	(500.9 truncated to the resolution) + 1, or 501.
		2009
		2010	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2011	501" and invoke the callback 0.1s after it was started, even though a
		2012	one-second delay was requested - this is being "too early", despite best
		2013	intentions.
		2014
		2015	This is the reason why libev will never invoke the callback if the elapsed
		2016	delay equals the requested delay, but only when the elapsed delay is
		2017	larger than the requested delay. In the example above, libev would only invoke
		2018	the callback at system time 502, or 1.1s after the timer was started.
		2019
		2020	So, while libev cannot guarantee that your callback will be invoked
		2021	exactly when requested, it I<can> and I<does> guarantee that the requested
		2022	delay has actually elapsed, or in other words, it always errs on the "too
		2023	late" side of things.
		2024
1973	=head3 The special problem of time updates	2025	=head3 The special problem of time updates
1974		2026
1975	Establishing the current time is a costly operation (it usually takes at	2027	Establishing the current time is a costly operation (it usually takes
1976	least two system calls): EV therefore updates its idea of the current	2028	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	2029	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	2030	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1979	lots of events in one iteration.	2031	lots of events in one iteration.
1980		2032
1981	The relative timeouts are calculated relative to the C<ev_now ()>	2033	The relative timeouts are calculated relative to the C<ev_now ()>
1982	time. This is usually the right thing as this timestamp refers to the time	2034	time. This is usually the right thing as this timestamp refers to the time
1983	of the event triggering whatever timeout you are modifying/starting. If	2035	of the event triggering whatever timeout you are modifying/starting. If
1984	you suspect event processing to be delayed and you I<need> to base the	2036	you suspect event processing to be delayed and you I<need> to base the
1985	timeout on the current time, use something like this to adjust for this:	2037	timeout on the current time, use something like the following to adjust
		2038	for it:
1986		2039
1987	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2040	ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
1988		2041
1989	If the event loop is suspended for a long time, you can also force an	2042	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	2043	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1991	()>.	2044	()>, although that will push the event time of all outstanding events
		2045	further into the future.
		2046
		2047	=head3 The special problem of unsynchronised clocks
		2048
		2049	Modern systems have a variety of clocks - libev itself uses the normal
		2050	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2051	jumps).
		2052
		2053	Neither of these clocks is synchronised with each other or any other clock
		2054	on the system, so C<ev_time ()> might return a considerably different time
		2055	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2056	a call to C<gettimeofday> might return a second count that is one higher
		2057	than a directly following call to C<time>.
		2058
		2059	The moral of this is to only compare libev-related timestamps with
		2060	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2061	a second or so.
		2062
		2063	One more problem arises due to this lack of synchronisation: if libev uses
		2064	the system monotonic clock and you compare timestamps from C<ev_time>
		2065	or C<ev_now> from when you started your timer and when your callback is
		2066	invoked, you will find that sometimes the callback is a bit "early".
		2067
		2068	This is because C<ev_timer>s work in real time, not wall clock time, so
		2069	libev makes sure your callback is not invoked before the delay happened,
		2070	I<measured according to the real time>, not the system clock.
		2071
		2072	If your timeouts are based on a physical timescale (e.g. "time out this
		2073	connection after 100 seconds") then this shouldn't bother you as it is
		2074	exactly the right behaviour.
		2075
		2076	If you want to compare wall clock/system timestamps to your timers, then
		2077	you need to use C<ev_periodic>s, as these are based on the wall clock
		2078	time, where your comparisons will always generate correct results.
1992		2079
1993	=head3 The special problems of suspended animation	2080	=head3 The special problems of suspended animation
1994		2081
1995	When you leave the server world it is quite customary to hit machines that	2082	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?	2083	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	2127	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.	2128	do stuff) the timer will not fire more than once per event loop iteration.
2042		2129
2043	=item ev_timer_again (loop, ev_timer *)	2130	=item ev_timer_again (loop, ev_timer *)
2044		2131
2045	This will act as if the timer timed out and restart it again if it is	2132	This will act as if the timer timed out, and restarts it again if it is
2046	repeating. The exact semantics are:	2133	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2134	timeout to the C<repeat> value and calling C<ev_timer_start>.
2047		2135
		2136	The exact semantics are as in the following rules, all of which will be
		2137	applied to the watcher:
		2138
		2139	=over 4
		2140
2048	If the timer is pending, its pending status is cleared.	2141	=item If the timer is pending, the pending status is always cleared.
2049		2142
2050	If the timer is started but non-repeating, stop it (as if it timed out).	2143	=item If the timer is started but non-repeating, stop it (as if it timed
		2144	out, without invoking it).
2051		2145
2052	If the timer is repeating, either start it if necessary (with the	2146	=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.	2147	and start the timer, if necessary.
2054		2148
		2149	=back
		2150
2055	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2151	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2056	usage example.	2152	usage example.
2057		2153
2058	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2154	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2059		2155
2060	Returns the remaining time until a timer fires. If the timer is active,	2156	Returns the remaining time until a timer fires. If the timer is active,
…		…
2180		2276
2181	Another way to think about it (for the mathematically inclined) is that	2277	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	2278	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.	2279	time where C<time = offset (mod interval)>, regardless of any time jumps.
2184		2280
2185	For numerical stability it is preferable that the C<offset> value is near	2281	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	2282	interval value should be higher than C<1/8192> (which is around 100
2187	this value, and in fact is often specified as zero.	2283	microseconds) and C<offset> should be higher than C<0> and should have
		2284	at most a similar magnitude as the current time (say, within a factor of
		2285	ten). Typical values for offset are, in fact, C<0> or something between
		2286	C<0> and C<interval>, which is also the recommended range.
2188		2287
2189	Note also that there is an upper limit to how often a timer can fire (CPU	2288	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	2289	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	2290	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).	2291	millisecond (if the OS supports it and the machine is fast enough).
…		…
2300		2399
2301	ev_periodic hourly_tick;	2400	ev_periodic hourly_tick;
2302	ev_periodic_init (&hourly_tick, clock_cb,	2401	ev_periodic_init (&hourly_tick, clock_cb,
2303	fmod (ev_now (loop), 3600.), 3600., 0);	2402	fmod (ev_now (loop), 3600.), 3600., 0);
2304	ev_periodic_start (loop, &hourly_tick);	2403	ev_periodic_start (loop, &hourly_tick);
2305		2404
2306		2405
2307	=head2 C<ev_signal> - signal me when a signal gets signalled!	2406	=head2 C<ev_signal> - signal me when a signal gets signalled!
2308		2407
2309	Signal watchers will trigger an event when the process receives a specific	2408	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	2409	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	2419	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	2420	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	2421	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.	2422	the moment, C<SIGCHLD> is permanently tied to the default loop.
2324		2423
2325	When the first watcher gets started will libev actually register something	2424	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	2425	register something with the kernel. It thus coexists with your own signal
2327	you don't register any with libev for the same signal).	2426	handlers as long as you don't register any with libev for the same signal.
2328		2427
2329	If possible and supported, libev will install its handlers with	2428	If possible and supported, libev will install its handlers with
2330	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2429	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	2430	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	2431	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	2434	=head3 The special problem of inheritance over fork/execve/pthread_create
2336		2435
2337	Both the signal mask (C<sigprocmask>) and the signal disposition	2436	Both the signal mask (C<sigprocmask>) and the signal disposition
2338	(C<sigaction>) are unspecified after starting a signal watcher (and after	2437	(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,	2438	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.	2439	and might or might not set or restore the installed signal handler (but
		2440	see C<EVFLAG_NOSIGMASK>).
2341		2441
2342	While this does not matter for the signal disposition (libev never	2442	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	2443	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	2444	C<execve>), this matters for the signal mask: many programs do not expect
2345	certain signals to be blocked.	2445	certain signals to be blocked.
…		…
2516		2616
2517	=head2 C<ev_stat> - did the file attributes just change?	2617	=head2 C<ev_stat> - did the file attributes just change?
2518		2618
2519	This watches a file system path for attribute changes. That is, it calls	2619	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)	2620	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	2621	and sees if it changed compared to the last time, invoking the callback
2522	it did.	2622	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2623	happen after the watcher has been started will be reported.
2523		2624
2524	The path does not need to exist: changing from "path exists" to "path does	2625	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	2626	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	2627	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	2628	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	2858	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	2859	effect on its own sometimes), idle watchers are a good place to do
2759	"pseudo-background processing", or delay processing stuff to after the	2860	"pseudo-background processing", or delay processing stuff to after the
2760	event loop has handled all outstanding events.	2861	event loop has handled all outstanding events.
2761		2862
		2863	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2864
		2865	As long as there is at least one active idle watcher, libev will never
		2866	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2867	For this to work, the idle watcher doesn't need to be invoked at all - the
		2868	lowest priority will do.
		2869
		2870	This mode of operation can be useful together with an C<ev_check> watcher,
		2871	to do something on each event loop iteration - for example to balance load
		2872	between different connections.
		2873
		2874	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2875	example.
		2876
2762	=head3 Watcher-Specific Functions and Data Members	2877	=head3 Watcher-Specific Functions and Data Members
2763		2878
2764	=over 4	2879	=over 4
2765		2880
2766	=item ev_idle_init (ev_idle *, callback)	2881	=item ev_idle_init (ev_idle *, callback)
…		…
2777	callback, free it. Also, use no error checking, as usual.	2892	callback, free it. Also, use no error checking, as usual.
2778		2893
2779	static void	2894	static void
2780	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)	2895	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2781	{	2896	{
		2897	// stop the watcher
		2898	ev_idle_stop (loop, w);
		2899
		2900	// now we can free it
2782	free (w);	2901	free (w);
		2902
2783	// now do something you wanted to do when the program has	2903	// now do something you wanted to do when the program has
2784	// no longer anything immediate to do.	2904	// no longer anything immediate to do.
2785	}	2905	}
2786		2906
2787	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2907	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2789	ev_idle_start (loop, idle_watcher);	2909	ev_idle_start (loop, idle_watcher);
2790		2910
2791		2911
2792	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2912	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2793		2913
2794	Prepare and check watchers are usually (but not always) used in pairs:	2914	Prepare and check watchers are often (but not always) used in pairs:
2795	prepare watchers get invoked before the process blocks and check watchers	2915	prepare watchers get invoked before the process blocks and check watchers
2796	afterwards.	2916	afterwards.
2797		2917
2798	You I<must not> call C<ev_run> or similar functions that enter	2918	You I<must not> call C<ev_run> (or similar functions that enter the
2799	the current event loop from either C<ev_prepare> or C<ev_check>	2919	current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2800	watchers. Other loops than the current one are fine, however. The	2920	C<ev_check> watchers. Other loops than the current one are fine,
2801	rationale behind this is that you do not need to check for recursion in	2921	however. The rationale behind this is that you do not need to check
2802	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2922	for recursion in those watchers, i.e. the sequence will always be
2803	C<ev_check> so if you have one watcher of each kind they will always be	2923	C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2804	called in pairs bracketing the blocking call.	2924	kind they will always be called in pairs bracketing the blocking call.
2805		2925
2806	Their main purpose is to integrate other event mechanisms into libev and	2926	Their main purpose is to integrate other event mechanisms into libev and
2807	their use is somewhat advanced. They could be used, for example, to track	2927	their use is somewhat advanced. They could be used, for example, to track
2808	variable changes, implement your own watchers, integrate net-snmp or a	2928	variable changes, implement your own watchers, integrate net-snmp or a
2809	coroutine library and lots more. They are also occasionally useful if	2929	coroutine library and lots more. They are also occasionally useful if
…		…
2827	with priority higher than or equal to the event loop and one coroutine	2947	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	2948	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	2949	loop from blocking if lower-priority coroutines are active, thus mapping
2830	low-priority coroutines to idle/background tasks).	2950	low-priority coroutines to idle/background tasks).
2831		2951
2832	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2952	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	2953	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).	2954	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		2955	watchers).
2835		2956
2836	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	2957	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	2958	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	2959	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	2960	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	2961	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	2962	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2842	others).	2963	others).
		2964
		2965	=head3 Abusing an C<ev_check> watcher for its side-effect
		2966
		2967	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		2968	useful because they are called once per event loop iteration. For
		2969	example, if you want to handle a large number of connections fairly, you
		2970	normally only do a bit of work for each active connection, and if there
		2971	is more work to do, you wait for the next event loop iteration, so other
		2972	connections have a chance of making progress.
		2973
		2974	Using an C<ev_check> watcher is almost enough: it will be called on the
		2975	next event loop iteration. However, that isn't as soon as possible -
		2976	without external events, your C<ev_check> watcher will not be invoked.
		2977
		2978	This is where C<ev_idle> watchers come in handy - all you need is a
		2979	single global idle watcher that is active as long as you have one active
		2980	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		2981	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		2982	invoked. Neither watcher alone can do that.
2843		2983
2844	=head3 Watcher-Specific Functions and Data Members	2984	=head3 Watcher-Specific Functions and Data Members
2845		2985
2846	=over 4	2986	=over 4
2847		2987
…		…
3048		3188
3049	=over 4	3189	=over 4
3050		3190
3051	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	3191	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3052		3192
3053	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	3193	=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3054		3194
3055	Configures the watcher to embed the given loop, which must be	3195	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	3196	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	3197	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,	3198	to invoke it (it will continue to be called until the sweep has been done,
…		…
3079	used).	3219	used).
3080		3220
3081	struct ev_loop *loop_hi = ev_default_init (0);	3221	struct ev_loop *loop_hi = ev_default_init (0);
3082	struct ev_loop *loop_lo = 0;	3222	struct ev_loop *loop_lo = 0;
3083	ev_embed embed;	3223	ev_embed embed;
3084		3224
3085	// see if there is a chance of getting one that works	3225	// see if there is a chance of getting one that works
3086	// (remember that a flags value of 0 means autodetection)	3226	// (remember that a flags value of 0 means autodetection)
3087	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3227	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3088	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3228	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3089	: 0;	3229	: 0;
…		…
3103	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3243	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3104		3244
3105	struct ev_loop *loop = ev_default_init (0);	3245	struct ev_loop *loop = ev_default_init (0);
3106	struct ev_loop *loop_socket = 0;	3246	struct ev_loop *loop_socket = 0;
3107	ev_embed embed;	3247	ev_embed embed;
3108		3248
3109	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3249	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3110	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3250	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3111	{	3251	{
3112	ev_embed_init (&embed, 0, loop_socket);	3252	ev_embed_init (&embed, 0, loop_socket);
3113	ev_embed_start (loop, &embed);	3253	ev_embed_start (loop, &embed);
…		…
3121		3261
3122	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3262	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3123		3263
3124	Fork watchers are called when a C<fork ()> was detected (usually because	3264	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	3265	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	3266	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,	3267	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	3268	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	3269	and calls it in the wrong process, the fork handlers will be invoked, too,
3130	handlers will be invoked, too, of course.	3270	of course.
3131		3271
3132	=head3 The special problem of life after fork - how is it possible?	3272	=head3 The special problem of life after fork - how is it possible?
3133		3273
3134	Most uses of C<fork()> consist of forking, then some simple calls to set	3274	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	3275	up/change the process environment, followed by a call to C<exec()>. This
3136	sequence should be handled by libev without any problems.	3276	sequence should be handled by libev without any problems.
3137		3277
3138	This changes when the application actually wants to do event handling	3278	This changes when the application actually wants to do event handling
3139	in the child, or both parent in child, in effect "continuing" after the	3279	in the child, or both parent in child, in effect "continuing" after the
…		…
3216	atexit (program_exits);	3356	atexit (program_exits);
3217		3357
3218		3358
3219	=head2 C<ev_async> - how to wake up an event loop	3359	=head2 C<ev_async> - how to wake up an event loop
3220		3360
3221	In general, you cannot use an C<ev_run> from multiple threads or other	3361	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	3362	asynchronous sources such as signal handlers (as opposed to multiple event
3223	loops - those are of course safe to use in different threads).	3363	loops - those are of course safe to use in different threads).
3224		3364
3225	Sometimes, however, you need to wake up an event loop you do not control,	3365	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>	3366	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.	3368	it by calling C<ev_async_send>, which is thread- and signal safe.
3229		3369
3230	This functionality is very similar to C<ev_signal> watchers, as signals,	3370	This functionality is very similar to C<ev_signal> watchers, as signals,
3231	too, are asynchronous in nature, and signals, too, will be compressed	3371	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	3372	(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	3373	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	3374	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,	3375	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3236	even without knowing which loop owns the signal.	3376	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		3377
3241	=head3 Queueing	3378	=head3 Queueing
3242		3379
3243	C<ev_async> does not support queueing of data in any way. The reason	3380	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	3381	is that the author does not know of a simple (or any) algorithm for a
…		…
3336	trust me.	3473	trust me.
3337		3474
3338	=item ev_async_send (loop, ev_async *)	3475	=item ev_async_send (loop, ev_async *)
3339		3476
3340	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3477	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	3478	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3479	returns.
		3480
3342	C<ev_feed_event>, this call is safe to do from other threads, signal or	3481	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	3482	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3344	section below on what exactly this means).	3483	embedding section below on what exactly this means).
3345		3484
3346	Note that, as with other watchers in libev, multiple events might get	3485	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	3486	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>,	3487	this is that C<ev_async> watchers are level-triggered: they are set on
3349	reset when the event loop detects that).	3488	C<ev_async_send>, reset when the event loop detects that).
3350		3489
3351	This call incurs the overhead of a system call only once per event loop	3490	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	3491	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.	3492	the event loop (or your program) is processing events. That means that
		3493	repeated calls are basically free (there is no need to avoid calls for
		3494	performance reasons) and that the overhead becomes smaller (typically
		3495	zero) under load.
3354		3496
3355	=item bool = ev_async_pending (ev_async *)	3497	=item bool = ev_async_pending (ev_async *)
3356		3498
3357	Returns a non-zero value when C<ev_async_send> has been called on the	3499	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	3500	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);	3555	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3414		3556
3415	=item ev_feed_fd_event (loop, int fd, int revents)	3557	=item ev_feed_fd_event (loop, int fd, int revents)
3416		3558
3417	Feed an event on the given fd, as if a file descriptor backend detected	3559	Feed an event on the given fd, as if a file descriptor backend detected
3418	the given events it.	3560	the given events.
3419		3561
3420	=item ev_feed_signal_event (loop, int signum)	3562	=item ev_feed_signal_event (loop, int signum)
3421		3563
3422	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,	3564	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3423	which is async-safe.	3565	which is async-safe.
…		…
3429		3571
3430	This section explains some common idioms that are not immediately	3572	This section explains some common idioms that are not immediately
3431	obvious. Note that examples are sprinkled over the whole manual, and this	3573	obvious. Note that examples are sprinkled over the whole manual, and this
3432	section only contains stuff that wouldn't fit anywhere else.	3574	section only contains stuff that wouldn't fit anywhere else.
3433		3575
3434	=over 4	3576	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3435		3577
3436	=item Model/nested event loop invocations and exit conditions.	3578	Each watcher has, by default, a C<void *data> member that you can read
		3579	or modify at any time: libev will completely ignore it. This can be used
		3580	to associate arbitrary data with your watcher. If you need more data and
		3581	don't want to allocate memory separately and store a pointer to it in that
		3582	data member, you can also "subclass" the watcher type and provide your own
		3583	data:
		3584
		3585	struct my_io
		3586	{
		3587	ev_io io;
		3588	int otherfd;
		3589	void *somedata;
		3590	struct whatever *mostinteresting;
		3591	};
		3592
		3593	...
		3594	struct my_io w;
		3595	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3596
		3597	And since your callback will be called with a pointer to the watcher, you
		3598	can cast it back to your own type:
		3599
		3600	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3601	{
		3602	struct my_io *w = (struct my_io *)w_;
		3603	...
		3604	}
		3605
		3606	More interesting and less C-conformant ways of casting your callback
		3607	function type instead have been omitted.
		3608
		3609	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3610
		3611	Another common scenario is to use some data structure with multiple
		3612	embedded watchers, in effect creating your own watcher that combines
		3613	multiple libev event sources into one "super-watcher":
		3614
		3615	struct my_biggy
		3616	{
		3617	int some_data;
		3618	ev_timer t1;
		3619	ev_timer t2;
		3620	}
		3621
		3622	In this case getting the pointer to C<my_biggy> is a bit more
		3623	complicated: Either you store the address of your C<my_biggy> struct in
		3624	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3625	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3626	real programmers):
		3627
		3628	#include <stddef.h>
		3629
		3630	static void
		3631	t1_cb (EV_P_ ev_timer *w, int revents)
		3632	{
		3633	struct my_biggy big = (struct my_biggy *)
		3634	(((char *)w) - offsetof (struct my_biggy, t1));
		3635	}
		3636
		3637	static void
		3638	t2_cb (EV_P_ ev_timer *w, int revents)
		3639	{
		3640	struct my_biggy big = (struct my_biggy *)
		3641	(((char *)w) - offsetof (struct my_biggy, t2));
		3642	}
		3643
		3644	=head2 AVOIDING FINISHING BEFORE RETURNING
		3645
		3646	Often you have structures like this in event-based programs:
		3647
		3648	callback ()
		3649	{
		3650	free (request);
		3651	}
		3652
		3653	request = start_new_request (..., callback);
		3654
		3655	The intent is to start some "lengthy" operation. The C<request> could be
		3656	used to cancel the operation, or do other things with it.
		3657
		3658	It's not uncommon to have code paths in C<start_new_request> that
		3659	immediately invoke the callback, for example, to report errors. Or you add
		3660	some caching layer that finds that it can skip the lengthy aspects of the
		3661	operation and simply invoke the callback with the result.
		3662
		3663	The problem here is that this will happen I<before> C<start_new_request>
		3664	has returned, so C<request> is not set.
		3665
		3666	Even if you pass the request by some safer means to the callback, you
		3667	might want to do something to the request after starting it, such as
		3668	canceling it, which probably isn't working so well when the callback has
		3669	already been invoked.
		3670
		3671	A common way around all these issues is to make sure that
		3672	C<start_new_request> I<always> returns before the callback is invoked. If
		3673	C<start_new_request> immediately knows the result, it can artificially
		3674	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3675	example, or more sneakily, by reusing an existing (stopped) watcher and
		3676	pushing it into the pending queue:
		3677
		3678	ev_set_cb (watcher, callback);
		3679	ev_feed_event (EV_A_ watcher, 0);
		3680
		3681	This way, C<start_new_request> can safely return before the callback is
		3682	invoked, while not delaying callback invocation too much.
		3683
		3684	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3437		3685
3438	Often (especially in GUI toolkits) there are places where you have	3686	Often (especially in GUI toolkits) there are places where you have
3439	I<modal> interaction, which is most easily implemented by recursively	3687	I<modal> interaction, which is most easily implemented by recursively
3440	invoking C<ev_run>.	3688	invoking C<ev_run>.
3441		3689
3442	This brings the problem of exiting - a callback might want to finish the	3690	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	3691	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	3692	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	3693	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.	3694	other combination: In these cases, a simple C<ev_break> will not work.
3447		3695
3448	The solution is to maintain "break this loop" variable for each C<ev_run>	3696	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	3697	invocation, and use a loop around C<ev_run> until the condition is
3450	triggered, using C<EVRUN_ONCE>:	3698	triggered, using C<EVRUN_ONCE>:
3451		3699
…		…
3453	int exit_main_loop = 0;	3701	int exit_main_loop = 0;
3454		3702
3455	while (!exit_main_loop)	3703	while (!exit_main_loop)
3456	ev_run (EV_DEFAULT_ EVRUN_ONCE);	3704	ev_run (EV_DEFAULT_ EVRUN_ONCE);
3457		3705
3458	// in a model watcher	3706	// in a modal watcher
3459	int exit_nested_loop = 0;	3707	int exit_nested_loop = 0;
3460		3708
3461	while (!exit_nested_loop)	3709	while (!exit_nested_loop)
3462	ev_run (EV_A_ EVRUN_ONCE);	3710	ev_run (EV_A_ EVRUN_ONCE);
3463		3711
…		…
3470	exit_main_loop = 1;	3718	exit_main_loop = 1;
3471		3719
3472	// exit both	3720	// exit both
3473	exit_main_loop = exit_nested_loop = 1;	3721	exit_main_loop = exit_nested_loop = 1;
3474		3722
3475	=back	3723	=head2 THREAD LOCKING EXAMPLE
		3724
		3725	Here is a fictitious example of how to run an event loop in a different
		3726	thread from where callbacks are being invoked and watchers are
		3727	created/added/removed.
		3728
		3729	For a real-world example, see the C<EV::Loop::Async> perl module,
		3730	which uses exactly this technique (which is suited for many high-level
		3731	languages).
		3732
		3733	The example uses a pthread mutex to protect the loop data, a condition
		3734	variable to wait for callback invocations, an async watcher to notify the
		3735	event loop thread and an unspecified mechanism to wake up the main thread.
		3736
		3737	First, you need to associate some data with the event loop:
		3738
		3739	typedef struct {
		3740	mutex_t lock; /* global loop lock */
		3741	ev_async async_w;
		3742	thread_t tid;
		3743	cond_t invoke_cv;
		3744	} userdata;
		3745
		3746	void prepare_loop (EV_P)
		3747	{
		3748	// for simplicity, we use a static userdata struct.
		3749	static userdata u;
		3750
		3751	ev_async_init (&u->async_w, async_cb);
		3752	ev_async_start (EV_A_ &u->async_w);
		3753
		3754	pthread_mutex_init (&u->lock, 0);
		3755	pthread_cond_init (&u->invoke_cv, 0);
		3756
		3757	// now associate this with the loop
		3758	ev_set_userdata (EV_A_ u);
		3759	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3760	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3761
		3762	// then create the thread running ev_run
		3763	pthread_create (&u->tid, 0, l_run, EV_A);
		3764	}
		3765
		3766	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3767	solely to wake up the event loop so it takes notice of any new watchers
		3768	that might have been added:
		3769
		3770	static void
		3771	async_cb (EV_P_ ev_async *w, int revents)
		3772	{
		3773	// just used for the side effects
		3774	}
		3775
		3776	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3777	protecting the loop data, respectively.
		3778
		3779	static void
		3780	l_release (EV_P)
		3781	{
		3782	userdata *u = ev_userdata (EV_A);
		3783	pthread_mutex_unlock (&u->lock);
		3784	}
		3785
		3786	static void
		3787	l_acquire (EV_P)
		3788	{
		3789	userdata *u = ev_userdata (EV_A);
		3790	pthread_mutex_lock (&u->lock);
		3791	}
		3792
		3793	The event loop thread first acquires the mutex, and then jumps straight
		3794	into C<ev_run>:
		3795
		3796	void *
		3797	l_run (void *thr_arg)
		3798	{
		3799	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3800
		3801	l_acquire (EV_A);
		3802	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3803	ev_run (EV_A_ 0);
		3804	l_release (EV_A);
		3805
		3806	return 0;
		3807	}
		3808
		3809	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3810	signal the main thread via some unspecified mechanism (signals? pipe
		3811	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3812	have been called (in a while loop because a) spurious wakeups are possible
		3813	and b) skipping inter-thread-communication when there are no pending
		3814	watchers is very beneficial):
		3815
		3816	static void
		3817	l_invoke (EV_P)
		3818	{
		3819	userdata *u = ev_userdata (EV_A);
		3820
		3821	while (ev_pending_count (EV_A))
		3822	{
		3823	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3824	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3825	}
		3826	}
		3827
		3828	Now, whenever the main thread gets told to invoke pending watchers, it
		3829	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3830	thread to continue:
		3831
		3832	static void
		3833	real_invoke_pending (EV_P)
		3834	{
		3835	userdata *u = ev_userdata (EV_A);
		3836
		3837	pthread_mutex_lock (&u->lock);
		3838	ev_invoke_pending (EV_A);
		3839	pthread_cond_signal (&u->invoke_cv);
		3840	pthread_mutex_unlock (&u->lock);
		3841	}
		3842
		3843	Whenever you want to start/stop a watcher or do other modifications to an
		3844	event loop, you will now have to lock:
		3845
		3846	ev_timer timeout_watcher;
		3847	userdata *u = ev_userdata (EV_A);
		3848
		3849	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3850
		3851	pthread_mutex_lock (&u->lock);
		3852	ev_timer_start (EV_A_ &timeout_watcher);
		3853	ev_async_send (EV_A_ &u->async_w);
		3854	pthread_mutex_unlock (&u->lock);
		3855
		3856	Note that sending the C<ev_async> watcher is required because otherwise
		3857	an event loop currently blocking in the kernel will have no knowledge
		3858	about the newly added timer. By waking up the loop it will pick up any new
		3859	watchers in the next event loop iteration.
		3860
		3861	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3862
		3863	While the overhead of a callback that e.g. schedules a thread is small, it
		3864	is still an overhead. If you embed libev, and your main usage is with some
		3865	kind of threads or coroutines, you might want to customise libev so that
		3866	doesn't need callbacks anymore.
		3867
		3868	Imagine you have coroutines that you can switch to using a function
		3869	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3870	and that due to some magic, the currently active coroutine is stored in a
		3871	global called C<current_coro>. Then you can build your own "wait for libev
		3872	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3873	the differing C<;> conventions):
		3874
		3875	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3876	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3877
		3878	That means instead of having a C callback function, you store the
		3879	coroutine to switch to in each watcher, and instead of having libev call
		3880	your callback, you instead have it switch to that coroutine.
		3881
		3882	A coroutine might now wait for an event with a function called
		3883	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3884	matter when, or whether the watcher is active or not when this function is
		3885	called):
		3886
		3887	void
		3888	wait_for_event (ev_watcher *w)
		3889	{
		3890	ev_set_cb (w, current_coro);
		3891	switch_to (libev_coro);
		3892	}
		3893
		3894	That basically suspends the coroutine inside C<wait_for_event> and
		3895	continues the libev coroutine, which, when appropriate, switches back to
		3896	this or any other coroutine.
		3897
		3898	You can do similar tricks if you have, say, threads with an event queue -
		3899	instead of storing a coroutine, you store the queue object and instead of
		3900	switching to a coroutine, you push the watcher onto the queue and notify
		3901	any waiters.
		3902
		3903	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3904	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3905
		3906	// my_ev.h
		3907	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3908	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3909	#include "../libev/ev.h"
		3910
		3911	// my_ev.c
		3912	#define EV_H "my_ev.h"
		3913	#include "../libev/ev.c"
		3914
		3915	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3916	F<my_ev.c> into your project. When properly specifying include paths, you
		3917	can even use F<ev.h> as header file name directly.
3476		3918
3477		3919
3478	=head1 LIBEVENT EMULATION	3920	=head1 LIBEVENT EMULATION
3479		3921
3480	Libev offers a compatibility emulation layer for libevent. It cannot	3922	Libev offers a compatibility emulation layer for libevent. It cannot
…		…
3510		3952
3511	=back	3953	=back
3512		3954
3513	=head1 C++ SUPPORT	3955	=head1 C++ SUPPORT
3514		3956
		3957	=head2 C API
		3958
		3959	The normal C API should work fine when used from C++: both ev.h and the
		3960	libev sources can be compiled as C++. Therefore, code that uses the C API
		3961	will work fine.
		3962
		3963	Proper exception specifications might have to be added to callbacks passed
		3964	to libev: exceptions may be thrown only from watcher callbacks, all
		3965	other callbacks (allocator, syserr, loop acquire/release and periodic
		3966	reschedule callbacks) must not throw exceptions, and might need a C<throw
		3967	()> specification. If you have code that needs to be compiled as both C
		3968	and C++ you can use the C<EV_THROW> macro for this:
		3969
		3970	static void
		3971	fatal_error (const char *msg) EV_THROW
		3972	{
		3973	perror (msg);
		3974	abort ();
		3975	}
		3976
		3977	...
		3978	ev_set_syserr_cb (fatal_error);
		3979
		3980	The only API functions that can currently throw exceptions are C<ev_run>,
		3981	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		3982	because it runs cleanup watchers).
		3983
		3984	Throwing exceptions in watcher callbacks is only supported if libev itself
		3985	is compiled with a C++ compiler or your C and C++ environments allow
		3986	throwing exceptions through C libraries (most do).
		3987
		3988	=head2 C++ API
		3989
3515	Libev comes with some simplistic wrapper classes for C++ that mainly allow	3990	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	3991	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.	3992	the callback model to a model using method callbacks on objects.
3518		3993
3519	To use it,	3994	To use it,
3520		3995
3521	#include <ev++.h>	3996	#include <ev++.h>
3522		3997
3523	This automatically includes F<ev.h> and puts all of its definitions (many	3998	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	3999	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	4000	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	4009	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	4010	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	4011	you need support for other types of functors please contact the author
3537	(preferably after implementing it).	4012	(preferably after implementing it).
3538		4013
		4014	For all this to work, your C++ compiler either has to use the same calling
		4015	conventions as your C compiler (for static member functions), or you have
		4016	to embed libev and compile libev itself as C++.
		4017
3539	Here is a list of things available in the C<ev> namespace:	4018	Here is a list of things available in the C<ev> namespace:
3540		4019
3541	=over 4	4020	=over 4
3542		4021
3543	=item C<ev::READ>, C<ev::WRITE> etc.	4022	=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.	4031	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3553		4032
3554	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4033	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>	4034	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	4035	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3557	defines by many implementations.	4036	defined by many implementations.
3558		4037
3559	All of those classes have these methods:	4038	All of those classes have these methods:
3560		4039
3561	=over 4	4040	=over 4
3562		4041
…		…
3624	void operator() (ev::io &w, int revents)	4103	void operator() (ev::io &w, int revents)
3625	{	4104	{
3626	...	4105	...
3627	}	4106	}
3628	}	4107	}
3629		4108
3630	myfunctor f;	4109	myfunctor f;
3631		4110
3632	ev::io w;	4111	ev::io w;
3633	w.set (&f);	4112	w.set (&f);
3634		4113
…		…
3652	Associates a different C<struct ev_loop> with this watcher. You can only	4131	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).	4132	do this when the watcher is inactive (and not pending either).
3654		4133
3655	=item w->set ([arguments])	4134	=item w->set ([arguments])
3656		4135
3657	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this	4136	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	4137	with the same arguments. Either this method or a suitable start method
3659	C counterpart, an active watcher gets automatically stopped and restarted	4138	must be called at least once. Unlike the C counterpart, an active watcher
3660	when reconfiguring it with this method.	4139	gets automatically stopped and restarted when reconfiguring it with this
		4140	method.
		4141
		4142	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4143	clashing with the C<set (loop)> method.
3661		4144
3662	=item w->start ()	4145	=item w->start ()
3663		4146
3664	Starts the watcher. Note that there is no C<loop> argument, as the	4147	Starts the watcher. Note that there is no C<loop> argument, as the
3665	constructor already stores the event loop.	4148	constructor already stores the event loop.
…		…
3695	watchers in the constructor.	4178	watchers in the constructor.
3696		4179
3697	class myclass	4180	class myclass
3698	{	4181	{
3699	ev::io io ; void io_cb (ev::io &w, int revents);	4182	ev::io io ; void io_cb (ev::io &w, int revents);
3700	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	4183	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3701	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4184	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3702		4185
3703	myclass (int fd)	4186	myclass (int fd)
3704	{	4187	{
3705	io .set <myclass, &myclass::io_cb > (this);	4188	io .set <myclass, &myclass::io_cb > (this);
…		…
3756	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4239	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3757		4240
3758	=item D	4241	=item D
3759		4242
3760	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4243	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>.	4244	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3762		4245
3763	=item Ocaml	4246	=item Ocaml
3764		4247
3765	Erkki Seppala has written Ocaml bindings for libev, to be found at	4248	Erkki Seppala has written Ocaml bindings for libev, to be found at
3766	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4249	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3769		4252
3770	Brian Maher has written a partial interface to libev for lua (at the	4253	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	4254	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3772	L<http://github.com/brimworks/lua-ev>.	4255	L<http://github.com/brimworks/lua-ev>.
3773		4256
		4257	=item Javascript
		4258
		4259	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4260
		4261	=item Others
		4262
		4263	There are others, and I stopped counting.
		4264
3774	=back	4265	=back
3775		4266
3776		4267
3777	=head1 MACRO MAGIC	4268	=head1 MACRO MAGIC
3778		4269
…		…
3814	suitable for use with C<EV_A>.	4305	suitable for use with C<EV_A>.
3815		4306
3816	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4307	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3817		4308
3818	Similar to the other two macros, this gives you the value of the default	4309	Similar to the other two macros, this gives you the value of the default
3819	loop, if multiple loops are supported ("ev loop default").	4310	loop, if multiple loops are supported ("ev loop default"). The default loop
		4311	will be initialised if it isn't already initialised.
		4312
		4313	For non-multiplicity builds, these macros do nothing, so you always have
		4314	to initialise the loop somewhere.
3820		4315
3821	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4316	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3822		4317
3823	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4318	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	4319	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
3969	supported). It will also not define any of the structs usually found in	4464	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.	4465	F<event.h> that are not directly supported by the libev core alone.
3971		4466
3972	In standalone mode, libev will still try to automatically deduce the	4467	In standalone mode, libev will still try to automatically deduce the
3973	configuration, but has to be more conservative.	4468	configuration, but has to be more conservative.
		4469
		4470	=item EV_USE_FLOOR
		4471
		4472	If defined to be C<1>, libev will use the C<floor ()> function for its
		4473	periodic reschedule calculations, otherwise libev will fall back on a
		4474	portable (slower) implementation. If you enable this, you usually have to
		4475	link against libm or something equivalent. Enabling this when the C<floor>
		4476	function is not available will fail, so the safe default is to not enable
		4477	this.
3974		4478
3975	=item EV_USE_MONOTONIC	4479	=item EV_USE_MONOTONIC
3976		4480
3977	If defined to be C<1>, libev will try to detect the availability of the	4481	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	4482	monotonic clock option at both compile time and runtime. Otherwise no
…		…
4063		4567
4064	If programs implement their own fd to handle mapping on win32, then this	4568	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	4569	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	4570	file descriptors again. Note that the replacement function has to close
4067	the underlying OS handle.	4571	the underlying OS handle.
		4572
		4573	=item EV_USE_WSASOCKET
		4574
		4575	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4576	communication socket, which works better in some environments. Otherwise,
		4577	the normal C<socket> function will be used, which works better in other
		4578	environments.
4068		4579
4069	=item EV_USE_POLL	4580	=item EV_USE_POLL
4070		4581
4071	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4582	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	4583	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	4619	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	4620	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	4621	be detected at runtime. If undefined, it will be enabled if the headers
4111	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4622	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4112		4623
		4624	=item EV_NO_SMP
		4625
		4626	If defined to be C<1>, libev will assume that memory is always coherent
		4627	between threads, that is, threads can be used, but threads never run on
		4628	different cpus (or different cpu cores). This reduces dependencies
		4629	and makes libev faster.
		4630
		4631	=item EV_NO_THREADS
		4632
		4633	If defined to be C<1>, libev will assume that it will never be called from
		4634	different threads (that includes signal handlers), which is a stronger
		4635	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4636	libev faster.
		4637
4113	=item EV_ATOMIC_T	4638	=item EV_ATOMIC_T
4114		4639
4115	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4640	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	4641	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	4642	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"	4643	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.	4644	handler "locking" as well as for signal and thread safety in C<ev_async>
		4645	watchers.
4120		4646
4121	In the absence of this define, libev will use C<sig_atomic_t volatile>	4647	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.	4648	(from F<signal.h>), which is usually good enough on most platforms.
4123		4649
4124	=item EV_H (h)	4650	=item EV_H (h)
…		…
4151	will have the C<struct ev_loop *> as first argument, and you can create	4677	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	4678	additional independent event loops. Otherwise there will be no support
4153	for multiple event loops and there is no first event loop pointer	4679	for multiple event loops and there is no first event loop pointer
4154	argument. Instead, all functions act on the single default loop.	4680	argument. Instead, all functions act on the single default loop.
4155		4681
		4682	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4683	default loop when multiplicity is switched off - you always have to
		4684	initialise the loop manually in this case.
		4685
4156	=item EV_MINPRI	4686	=item EV_MINPRI
4157		4687
4158	=item EV_MAXPRI	4688	=item EV_MAXPRI
4159		4689
4160	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4690	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
4196	#define EV_USE_POLL 1	4726	#define EV_USE_POLL 1
4197	#define EV_CHILD_ENABLE 1	4727	#define EV_CHILD_ENABLE 1
4198	#define EV_ASYNC_ENABLE 1	4728	#define EV_ASYNC_ENABLE 1
4199		4729
4200	The actual value is a bitset, it can be a combination of the following	4730	The actual value is a bitset, it can be a combination of the following
4201	values:	4731	values (by default, all of these are enabled):
4202		4732
4203	=over 4	4733	=over 4
4204		4734
4205	=item C<1> - faster/larger code	4735	=item C<1> - faster/larger code
4206		4736
…		…
4210	code size by roughly 30% on amd64).	4740	code size by roughly 30% on amd64).
4211		4741
4212	When optimising for size, use of compiler flags such as C<-Os> with	4742	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	4743	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4214	assertions.	4744	assertions.
		4745
		4746	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4747	(e.g. gcc with C<-Os>).
4215		4748
4216	=item C<2> - faster/larger data structures	4749	=item C<2> - faster/larger data structures
4217		4750
4218	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4751	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	4752	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	4753	and can additionally have an effect on the size of data structures at
4221	runtime.	4754	runtime.
4222		4755
		4756	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4757	(e.g. gcc with C<-Os>).
		4758
4223	=item C<4> - full API configuration	4759	=item C<4> - full API configuration
4224		4760
4225	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4761	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4226	enables multiplicity (C<EV_MULTIPLICITY>=1).	4762	enables multiplicity (C<EV_MULTIPLICITY>=1).
4227		4763
…		…
4257		4793
4258	With an intelligent-enough linker (gcc+binutils are intelligent enough	4794	With an intelligent-enough linker (gcc+binutils are intelligent enough
4259	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4795	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	4796	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.	4797	I/O watcher then might come out at only 5Kb.
		4798
		4799	=item EV_API_STATIC
		4800
		4801	If this symbol is defined (by default it is not), then all identifiers
		4802	will have static linkage. This means that libev will not export any
		4803	identifiers, and you cannot link against libev anymore. This can be useful
		4804	when you embed libev, only want to use libev functions in a single file,
		4805	and do not want its identifiers to be visible.
		4806
		4807	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4808	wants to use libev.
		4809
		4810	This option only works when libev is compiled with a C compiler, as C++
		4811	doesn't support the required declaration syntax.
4262		4812
4263	=item EV_AVOID_STDIO	4813	=item EV_AVOID_STDIO
4264		4814
4265	If this is set to C<1> at compiletime, then libev will avoid using stdio	4815	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	4816	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:	4960	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4411		4961
4412	#include "ev_cpp.h"	4962	#include "ev_cpp.h"
4413	#include "ev.c"	4963	#include "ev.c"
4414		4964
4415	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4965	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4416		4966
4417	=head2 THREADS AND COROUTINES	4967	=head2 THREADS AND COROUTINES
4418		4968
4419	=head3 THREADS	4969	=head3 THREADS
4420		4970
…		…
4471	default loop and triggering an C<ev_async> watcher from the default loop	5021	default loop and triggering an C<ev_async> watcher from the default loop
4472	watcher callback into the event loop interested in the signal.	5022	watcher callback into the event loop interested in the signal.
4473		5023
4474	=back	5024	=back
4475		5025
4476	=head4 THREAD LOCKING EXAMPLE	5026	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		5027
4614	=head3 COROUTINES	5028	=head3 COROUTINES
4615		5029
4616	Libev is very accommodating to coroutines ("cooperative threads"):	5030	Libev is very accommodating to coroutines ("cooperative threads"):
4617	libev fully supports nesting calls to its functions from different	5031	libev fully supports nesting calls to its functions from different
…		…
4782	requires, and its I/O model is fundamentally incompatible with the POSIX	5196	requires, and its I/O model is fundamentally incompatible with the POSIX
4783	model. Libev still offers limited functionality on this platform in	5197	model. Libev still offers limited functionality on this platform in
4784	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5198	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4785	descriptors. This only applies when using Win32 natively, not when using	5199	descriptors. This only applies when using Win32 natively, not when using
4786	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	5200	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4787	as every compielr comes with a slightly differently broken/incompatible	5201	as every compiler comes with a slightly differently broken/incompatible
4788	environment.	5202	environment.
4789		5203
4790	Lifting these limitations would basically require the full	5204	Lifting these limitations would basically require the full
4791	re-implementation of the I/O system. If you are into this kind of thing,	5205	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	5206	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	5322	thread" or will block signals process-wide, both behaviours would
4909	be compatible with libev. Interaction between C<sigprocmask> and	5323	be compatible with libev. Interaction between C<sigprocmask> and
4910	C<pthread_sigmask> could complicate things, however.	5324	C<pthread_sigmask> could complicate things, however.
4911		5325
4912	The most portable way to handle signals is to block signals in all threads	5326	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	5327	except the initial one, and run the signal handling loop in the initial
4914	well.	5328	thread as well.
4915		5329
4916	=item C<long> must be large enough for common memory allocation sizes	5330	=item C<long> must be large enough for common memory allocation sizes
4917		5331
4918	To improve portability and simplify its API, libev uses C<long> internally	5332	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	5333	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4925		5339
4926	The type C<double> is used to represent timestamps. It is required to	5340	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	5341	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	5342	good enough for at least into the year 4000 with millisecond accuracy
4929	(the design goal for libev). This requirement is overfulfilled by	5343	(the design goal for libev). This requirement is overfulfilled by
4930	implementations using IEEE 754, which is basically all existing ones. With	5344	implementations using IEEE 754, which is basically all existing ones.
		5345
4931	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5346	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5347	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5348	is either obsolete or somebody patched it to use C<long double> or
		5349	something like that, just kidding).
4932		5350
4933	=back	5351	=back
4934		5352
4935	If you know of other additional requirements drop me a note.	5353	If you know of other additional requirements drop me a note.
4936		5354
…		…
4998	=item Processing ev_async_send: O(number_of_async_watchers)	5416	=item Processing ev_async_send: O(number_of_async_watchers)
4999		5417
5000	=item Processing signals: O(max_signal_number)	5418	=item Processing signals: O(max_signal_number)
5001		5419
5002	Sending involves a system call I<iff> there were no other C<ev_async_send>	5420	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	5421	calls in the current loop iteration and the loop is currently
		5422	blocked. Checking for async and signal events involves iterating over all
5004	involves iterating over all running async watchers or all signal numbers.	5423	running async watchers or all signal numbers.
5005		5424
5006	=back	5425	=back
5007		5426
5008		5427
5009	=head1 PORTING FROM LIBEV 3.X TO 4.X	5428	=head1 PORTING FROM LIBEV 3.X TO 4.X
…		…
5018	=over 4	5437	=over 4
5019		5438
5020	=item C<EV_COMPAT3> backwards compatibility mechanism	5439	=item C<EV_COMPAT3> backwards compatibility mechanism
5021		5440
5022	The backward compatibility mechanism can be controlled by	5441	The backward compatibility mechanism can be controlled by
5023	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>	5442	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5024	section.	5443	section.
5025		5444
5026	=item C<ev_default_destroy> and C<ev_default_fork> have been removed	5445	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5027		5446
5028	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:	5447	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
…		…
5071	=over 4	5490	=over 4
5072		5491
5073	=item active	5492	=item active
5074		5493
5075	A watcher is active as long as it has been started and not yet stopped.	5494	A watcher is active as long as it has been started and not yet stopped.
5076	See L<WATCHER STATES> for details.	5495	See L</WATCHER STATES> for details.
5077		5496
5078	=item application	5497	=item application
5079		5498
5080	In this document, an application is whatever is using libev.	5499	In this document, an application is whatever is using libev.
5081		5500
…		…
5117	watchers and events.	5536	watchers and events.
5118		5537
5119	=item pending	5538	=item pending
5120		5539
5121	A watcher is pending as soon as the corresponding event has been	5540	A watcher is pending as soon as the corresponding event has been
5122	detected. See L<WATCHER STATES> for details.	5541	detected. See L</WATCHER STATES> for details.
5123		5542
5124	=item real time	5543	=item real time
5125		5544
5126	The physical time that is observed. It is apparently strictly monotonic :)	5545	The physical time that is observed. It is apparently strictly monotonic :)
5127		5546
5128	=item wall-clock time	5547	=item wall-clock time
5129		5548
5130	The time and date as shown on clocks. Unlike real time, it can actually	5549	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	5550	be wrong and jump forwards and backwards, e.g. when you adjust your
5132	clock.	5551	clock.
5133		5552
5134	=item watcher	5553	=item watcher
5135		5554
5136	A data structure that describes interest in certain events. Watchers need	5555	A data structure that describes interest in certain events. Watchers need
…		…
5139	=back	5558	=back
5140		5559
5141	=head1 AUTHOR	5560	=head1 AUTHOR
5142		5561
5143	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5562	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5144	Magnusson and Emanuele Giaquinta.	5563	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5145		5564

Diff Legend

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