ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.356 by root, Tue Jan 11 01:42:47 2011 UTC vs.
Revision 1.444 by root, Mon Oct 29 00:00:22 2018 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.
402		412
403	This works by calling C<getpid ()> on every iteration of the loop,	413	This works by calling C<getpid ()> on every iteration of the loop,
404	and thus this might slow down your event loop if you do a lot of loop	414	and thus this might slow down your event loop if you do a lot of loop
405	iterations and little real work, but is usually not noticeable (on my	415	iterations and little real work, but is usually not noticeable (on my
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
407	without a system call and thus I<very> fast, but my GNU/Linux system also has	417	sequence without a system call and thus I<very> fast, but my GNU/Linux
408	C<pthread_atfork> which is even faster).	418	system also has C<pthread_atfork> which is even faster). (Update: glibc
		419	versions 2.25 apparently removed the C<getpid> optimisation again).
409		420
410	The big advantage of this flag is that you can forget about fork (and	421	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	422	forget about forgetting to tell libev about forking, although you still
412	flag.	423	have to ignore C<SIGPIPE>) when you use this flag.
413		424
414	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	425	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
415	environment variable.	426	environment variable.
416		427
417	=item C<EVFLAG_NOINOTIFY>	428	=item C<EVFLAG_NOINOTIFY>
…		…
435	example) that can't properly initialise their signal masks.	446	example) that can't properly initialise their signal masks.
436		447
437	=item C<EVFLAG_NOSIGMASK>	448	=item C<EVFLAG_NOSIGMASK>
438		449
439	When this flag is specified, then libev will avoid to modify the signal	450	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	451	mask. Specifically, this means you have to make sure signals are unblocked
441	when you want to receive them.	452	when you want to receive them.
442		453
443	This behaviour is useful when you want to do your own signal handling, or	454	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	455	want to handle signals only in specific threads and want to avoid libev
445	unblocking the signals.	456	unblocking the signals.
		457
		458	It's also required by POSIX in a threaded program, as libev calls
		459	C<sigprocmask>, whose behaviour is officially unspecified.
446		460
447	This flag's behaviour will become the default in future versions of libev.	461	This flag's behaviour will become the default in future versions of libev.
448		462
449	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	463	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
450		464
…		…
480	=item C<EVBACKEND_EPOLL> (value 4, Linux)	494	=item C<EVBACKEND_EPOLL> (value 4, Linux)
481		495
482	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	496	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
483	kernels).	497	kernels).
484		498
485	For few fds, this backend is a bit little slower than poll and select,	499	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	500	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),	501	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).	502	fd), epoll scales either O(1) or O(active_fds).
489		503
490	The epoll mechanism deserves honorable mention as the most misdesigned	504	The epoll mechanism deserves honorable mention as the most misdesigned
491	of the more advanced event mechanisms: mere annoyances include silently	505	of the more advanced event mechanisms: mere annoyances include silently
492	dropping file descriptors, requiring a system call per change per file	506	dropping file descriptors, requiring a system call per change per file
493	descriptor (and unnecessary guessing of parameters), problems with dup,	507	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	510	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	511	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)	512	set, which can take considerable time (one syscall per file descriptor)
499	and is of course hard to detect.	513	and is of course hard to detect.
500		514
501	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	515	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	516	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	517	totally I<different> file descriptors (even already closed ones, so
504	even remove them from the set) than registered in the set (especially	518	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	519	(especially on SMP systems). Libev tries to counter these spurious
506	employing an additional generation counter and comparing that against the	520	notifications by employing an additional generation counter and comparing
507	events to filter out spurious ones, recreating the set when required. Last	521	that against the events to filter out spurious ones, recreating the set
		522	when required. Epoll also erroneously rounds down timeouts, but gives you
		523	no way to know when and by how much, so sometimes you have to busy-wait
		524	because epoll returns immediately despite a nonzero timeout. And last
508	not least, it also refuses to work with some file descriptors which work	525	not least, it also refuses to work with some file descriptors which work
509	perfectly fine with C<select> (files, many character devices...).	526	perfectly fine with C<select> (files, many character devices...).
510		527
511	Epoll is truly the train wreck analog among event poll mechanisms,	528	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
512	a frankenpoll, cobbled together in a hurry, no thought to design or	529	cobbled together in a hurry, no thought to design or interaction with
513	interaction with others.	530	others. Oh, the pain, will it ever stop...
514		531
515	While stopping, setting and starting an I/O watcher in the same iteration	532	While stopping, setting and starting an I/O watcher in the same iteration
516	will result in some caching, there is still a system call per such	533	will result in some caching, there is still a system call per such
517	incident (because the same I<file descriptor> could point to a different	534	incident (because the same I<file descriptor> could point to a different
518	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	535	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
555		572
556	It scales in the same way as the epoll backend, but the interface to the	573	It scales in the same way as the epoll backend, but the interface to the
557	kernel is more efficient (which says nothing about its actual speed, of	574	kernel is more efficient (which says nothing about its actual speed, of
558	course). While stopping, setting and starting an I/O watcher does never	575	course). While stopping, setting and starting an I/O watcher does never
559	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	576	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
560	two event changes per incident. Support for C<fork ()> is very bad (but	577	two event changes per incident. Support for C<fork ()> is very bad (you
561	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect	578	might have to leak fd's on fork, but it's more sane than epoll) and it
562	cases	579	drops fds silently in similarly hard-to-detect cases.
563		580
564	This backend usually performs well under most conditions.	581	This backend usually performs well under most conditions.
565		582
566	While nominally embeddable in other event loops, this doesn't work	583	While nominally embeddable in other event loops, this doesn't work
567	everywhere, so you might need to test for this. And since it is broken	584	everywhere, so you might need to test for this. And since it is broken
…		…
596	among the OS-specific backends (I vastly prefer correctness over speed	613	among the OS-specific backends (I vastly prefer correctness over speed
597	hacks).	614	hacks).
598		615
599	On the negative side, the interface is I<bizarre> - so bizarre that	616	On the negative side, the interface is I<bizarre> - so bizarre that
600	even sun itself gets it wrong in their code examples: The event polling	617	even sun itself gets it wrong in their code examples: The event polling
601	function sometimes returning events to the caller even though an error	618	function sometimes returns events to the caller even though an error
602	occurred, but with no indication whether it has done so or not (yes, it's	619	occurred, but with no indication whether it has done so or not (yes, it's
603	even documented that way) - deadly for edge-triggered interfaces where	620	even documented that way) - deadly for edge-triggered interfaces where you
604	you absolutely have to know whether an event occurred or not because you	621	absolutely have to know whether an event occurred or not because you have
605	have to re-arm the watcher.	622	to re-arm the watcher.
606		623
607	Fortunately libev seems to be able to work around these idiocies.	624	Fortunately libev seems to be able to work around these idiocies.
608		625
609	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	626	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
610	C<EVBACKEND_POLL>.	627	C<EVBACKEND_POLL>.
…		…
666	If you need dynamically allocated loops it is better to use C<ev_loop_new>	683	If you need dynamically allocated loops it is better to use C<ev_loop_new>
667	and C<ev_loop_destroy>.	684	and C<ev_loop_destroy>.
668		685
669	=item ev_loop_fork (loop)	686	=item ev_loop_fork (loop)
670		687
671	This function sets a flag that causes subsequent C<ev_run> iterations to	688	This function sets a flag that causes subsequent C<ev_run> iterations
672	reinitialise the kernel state for backends that have one. Despite the	689	to reinitialise the kernel state for backends that have one. Despite
673	name, you can call it anytime, but it makes most sense after forking, in	690	the name, you can call it anytime you are allowed to start or stop
674	the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the	691	watchers (except inside an C<ev_prepare> callback), but it makes most
		692	sense after forking, in the child process. You I<must> call it (or use
675	child before resuming or calling C<ev_run>.	693	C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
676		694
		695	In addition, if you want to reuse a loop (via this function or
		696	C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
		697
677	Again, you I<have> to call it on I<any> loop that you want to re-use after	698	Again, you I<have> to call it on I<any> loop that you want to re-use after
678	a fork, I<even if you do not plan to use the loop in the parent>. This is	699	a fork, I<even if you do not plan to use the loop in the parent>. This is
679	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	700	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
680	during fork.	701	during fork.
681		702
682	On the other hand, you only need to call this function in the child	703	On the other hand, you only need to call this function in the child
…		…
752		773
753	This function is rarely useful, but when some event callback runs for a	774	This function is rarely useful, but when some event callback runs for a
754	very long time without entering the event loop, updating libev's idea of	775	very long time without entering the event loop, updating libev's idea of
755	the current time is a good idea.	776	the current time is a good idea.
756		777
757	See also L<The special problem of time updates> in the C<ev_timer> section.	778	See also L</The special problem of time updates> in the C<ev_timer> section.
758		779
759	=item ev_suspend (loop)	780	=item ev_suspend (loop)
760		781
761	=item ev_resume (loop)	782	=item ev_resume (loop)
762		783
…		…
780	without a previous call to C<ev_suspend>.	801	without a previous call to C<ev_suspend>.
781		802
782	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	803	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
783	event loop time (see C<ev_now_update>).	804	event loop time (see C<ev_now_update>).
784		805
785	=item ev_run (loop, int flags)	806	=item bool ev_run (loop, int flags)
786		807
787	Finally, this is it, the event handler. This function usually is called	808	Finally, this is it, the event handler. This function usually is called
788	after you have initialised all your watchers and you want to start	809	after you have initialised all your watchers and you want to start
789	handling events. It will ask the operating system for any new events, call	810	handling events. It will ask the operating system for any new events, call
790	the watcher callbacks, an then repeat the whole process indefinitely: This	811	the watcher callbacks, and then repeat the whole process indefinitely: This
791	is why event loops are called I<loops>.	812	is why event loops are called I<loops>.
792		813
793	If the flags argument is specified as C<0>, it will keep handling events	814	If the flags argument is specified as C<0>, it will keep handling events
794	until either no event watchers are active anymore or C<ev_break> was	815	until either no event watchers are active anymore or C<ev_break> was
795	called.	816	called.
		817
		818	The return value is false if there are no more active watchers (which
		819	usually means "all jobs done" or "deadlock"), and true in all other cases
		820	(which usually means " you should call C<ev_run> again").
796		821
797	Please note that an explicit C<ev_break> is usually better than	822	Please note that an explicit C<ev_break> is usually better than
798	relying on all watchers to be stopped when deciding when a program has	823	relying on all watchers to be stopped when deciding when a program has
799	finished (especially in interactive programs), but having a program	824	finished (especially in interactive programs), but having a program
800	that automatically loops as long as it has to and no longer by virtue	825	that automatically loops as long as it has to and no longer by virtue
801	of relying on its watchers stopping correctly, that is truly a thing of	826	of relying on its watchers stopping correctly, that is truly a thing of
802	beauty.	827	beauty.
803		828
804	This function is also I<mostly> exception-safe - you can break out of	829	This function is I<mostly> exception-safe - you can break out of a
805	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++	830	C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
806	exception and so on. This does not decrement the C<ev_depth> value, nor	831	exception and so on. This does not decrement the C<ev_depth> value, nor
807	will it clear any outstanding C<EVBREAK_ONE> breaks.	832	will it clear any outstanding C<EVBREAK_ONE> breaks.
808		833
809	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	834	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
810	those events and any already outstanding ones, but will not wait and	835	those events and any already outstanding ones, but will not wait and
…		…
822	This is useful if you are waiting for some external event in conjunction	847	This is useful if you are waiting for some external event in conjunction
823	with something not expressible using other libev watchers (i.e. "roll your	848	with something not expressible using other libev watchers (i.e. "roll your
824	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	849	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
825	usually a better approach for this kind of thing.	850	usually a better approach for this kind of thing.
826		851
827	Here are the gory details of what C<ev_run> does:	852	Here are the gory details of what C<ev_run> does (this is for your
		853	understanding, not a guarantee that things will work exactly like this in
		854	future versions):
828		855
829	- Increment loop depth.	856	- Increment loop depth.
830	- Reset the ev_break status.	857	- Reset the ev_break status.
831	- Before the first iteration, call any pending watchers.	858	- Before the first iteration, call any pending watchers.
832	LOOP:	859	LOOP:
…		…
865	anymore.	892	anymore.
866		893
867	... queue jobs here, make sure they register event watchers as long	894	... queue jobs here, make sure they register event watchers as long
868	... as they still have work to do (even an idle watcher will do..)	895	... as they still have work to do (even an idle watcher will do..)
869	ev_run (my_loop, 0);	896	ev_run (my_loop, 0);
870	... jobs done or somebody called unloop. yeah!	897	... jobs done or somebody called break. yeah!
871		898
872	=item ev_break (loop, how)	899	=item ev_break (loop, how)
873		900
874	Can be used to make a call to C<ev_run> return early (but only after it	901	Can be used to make a call to C<ev_run> return early (but only after it
875	has processed all outstanding events). The C<how> argument must be either	902	has processed all outstanding events). The C<how> argument must be either
…		…
938	overhead for the actual polling but can deliver many events at once.	965	overhead for the actual polling but can deliver many events at once.
939		966
940	By setting a higher I<io collect interval> you allow libev to spend more	967	By setting a higher I<io collect interval> you allow libev to spend more
941	time collecting I/O events, so you can handle more events per iteration,	968	time collecting I/O events, so you can handle more events per iteration,
942	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	969	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
943	C<ev_timer>) will be not affected. Setting this to a non-null value will	970	C<ev_timer>) will not be affected. Setting this to a non-null value will
944	introduce an additional C<ev_sleep ()> call into most loop iterations. The	971	introduce an additional C<ev_sleep ()> call into most loop iterations. The
945	sleep time ensures that libev will not poll for I/O events more often then	972	sleep time ensures that libev will not poll for I/O events more often then
946	once per this interval, on average.	973	once per this interval, on average (as long as the host time resolution is
		974	good enough).
947		975
948	Likewise, by setting a higher I<timeout collect interval> you allow libev	976	Likewise, by setting a higher I<timeout collect interval> you allow libev
949	to spend more time collecting timeouts, at the expense of increased	977	to spend more time collecting timeouts, at the expense of increased
950	latency/jitter/inexactness (the watcher callback will be called	978	latency/jitter/inexactness (the watcher callback will be called
951	later). C<ev_io> watchers will not be affected. Setting this to a non-null	979	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
997	invoke the actual watchers inside another context (another thread etc.).	1025	invoke the actual watchers inside another context (another thread etc.).
998		1026
999	If you want to reset the callback, use C<ev_invoke_pending> as new	1027	If you want to reset the callback, use C<ev_invoke_pending> as new
1000	callback.	1028	callback.
1001		1029
1002	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))	1030	=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
1003		1031
1004	Sometimes you want to share the same loop between multiple threads. This	1032	Sometimes you want to share the same loop between multiple threads. This
1005	can be done relatively simply by putting mutex_lock/unlock calls around	1033	can be done relatively simply by putting mutex_lock/unlock calls around
1006	each call to a libev function.	1034	each call to a libev function.
1007		1035
1008	However, C<ev_run> can run an indefinite time, so it is not feasible	1036	However, C<ev_run> can run an indefinite time, so it is not feasible
1009	to wait for it to return. One way around this is to wake up the event	1037	to wait for it to return. One way around this is to wake up the event
1010	loop via C<ev_break> and C<av_async_send>, another way is to set these	1038	loop via C<ev_break> and C<ev_async_send>, another way is to set these
1011	I<release> and I<acquire> callbacks on the loop.	1039	I<release> and I<acquire> callbacks on the loop.
1012		1040
1013	When set, then C<release> will be called just before the thread is	1041	When set, then C<release> will be called just before the thread is
1014	suspended waiting for new events, and C<acquire> is called just	1042	suspended waiting for new events, and C<acquire> is called just
1015	afterwards.	1043	afterwards.
…		…
1155		1183
1156	=item C<EV_PREPARE>	1184	=item C<EV_PREPARE>
1157		1185
1158	=item C<EV_CHECK>	1186	=item C<EV_CHECK>
1159		1187
1160	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts	1188	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1161	to gather new events, and all C<ev_check> watchers are invoked just after	1189	gather new events, and all C<ev_check> watchers are queued (not invoked)
1162	C<ev_run> has gathered them, but before it invokes any callbacks for any	1190	just after C<ev_run> has gathered them, but before it queues any callbacks
		1191	for any received events. That means C<ev_prepare> watchers are the last
		1192	watchers invoked before the event loop sleeps or polls for new events, and
		1193	C<ev_check> watchers will be invoked before any other watchers of the same
		1194	or lower priority within an event loop iteration.
		1195
1163	received events. Callbacks of both watcher types can start and stop as	1196	Callbacks of both watcher types can start and stop as many watchers as
1164	many watchers as they want, and all of them will be taken into account	1197	they want, and all of them will be taken into account (for example, a
1165	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1198	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1166	C<ev_run> from blocking).	1199	blocking).
1167		1200
1168	=item C<EV_EMBED>	1201	=item C<EV_EMBED>
1169		1202
1170	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1203	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1171		1204
…		…
1294		1327
1295	=item callback ev_cb (ev_TYPE *watcher)	1328	=item callback ev_cb (ev_TYPE *watcher)
1296		1329
1297	Returns the callback currently set on the watcher.	1330	Returns the callback currently set on the watcher.
1298		1331
1299	=item ev_cb_set (ev_TYPE *watcher, callback)	1332	=item ev_set_cb (ev_TYPE *watcher, callback)
1300		1333
1301	Change the callback. You can change the callback at virtually any time	1334	Change the callback. You can change the callback at virtually any time
1302	(modulo threads).	1335	(modulo threads).
1303		1336
1304	=item ev_set_priority (ev_TYPE *watcher, int priority)	1337	=item ev_set_priority (ev_TYPE *watcher, int priority)
…		…
1322	or might not have been clamped to the valid range.	1355	or might not have been clamped to the valid range.
1323		1356
1324	The default priority used by watchers when no priority has been set is	1357	The default priority used by watchers when no priority has been set is
1325	always C<0>, which is supposed to not be too high and not be too low :).	1358	always C<0>, which is supposed to not be too high and not be too low :).
1326		1359
1327	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of	1360	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1328	priorities.	1361	priorities.
1329		1362
1330	=item ev_invoke (loop, ev_TYPE *watcher, int revents)	1363	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1331		1364
1332	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither	1365	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
…		…
1357	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1390	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1358	functions that do not need a watcher.	1391	functions that do not need a watcher.
1359		1392
1360	=back	1393	=back
1361		1394
1362	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1395	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1363		1396	OWN COMPOSITE WATCHERS> idioms.
1364	Each watcher has, by default, a member C<void *data> that you can change
1365	and read at any time: libev will completely ignore it. This can be used
1366	to associate arbitrary data with your watcher. If you need more data and
1367	don't want to allocate memory and store a pointer to it in that data
1368	member, you can also "subclass" the watcher type and provide your own
1369	data:
1370
1371	struct my_io
1372	{
1373	ev_io io;
1374	int otherfd;
1375	void *somedata;
1376	struct whatever *mostinteresting;
1377	};
1378
1379	...
1380	struct my_io w;
1381	ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383	And since your callback will be called with a pointer to the watcher, you
1384	can cast it back to your own type:
1385
1386	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1387	{
1388	struct my_io *w = (struct my_io *)w_;
1389	...
1390	}
1391
1392	More interesting and less C-conformant ways of casting your callback type
1393	instead have been omitted.
1394
1395	Another common scenario is to use some data structure with multiple
1396	embedded watchers:
1397
1398	struct my_biggy
1399	{
1400	int some_data;
1401	ev_timer t1;
1402	ev_timer t2;
1403	}
1404
1405	In this case getting the pointer to C<my_biggy> is a bit more
1406	complicated: Either you store the address of your C<my_biggy> struct
1407	in the C<data> member of the watcher (for woozies), or you need to use
1408	some pointer arithmetic using C<offsetof> inside your watchers (for real
1409	programmers):
1410
1411	#include <stddef.h>
1412
1413	static void
1414	t1_cb (EV_P_ ev_timer *w, int revents)
1415	{
1416	struct my_biggy big = (struct my_biggy *)
1417	(((char *)w) - offsetof (struct my_biggy, t1));
1418	}
1419
1420	static void
1421	t2_cb (EV_P_ ev_timer *w, int revents)
1422	{
1423	struct my_biggy big = (struct my_biggy *)
1424	(((char *)w) - offsetof (struct my_biggy, t2));
1425	}
1426		1397
1427	=head2 WATCHER STATES	1398	=head2 WATCHER STATES
1428		1399
1429	There are various watcher states mentioned throughout this manual -	1400	There are various watcher states mentioned throughout this manual -
1430	active, pending and so on. In this section these states and the rules to	1401	active, pending and so on. In this section these states and the rules to
1431	transition between them will be described in more detail - and while these	1402	transition between them will be described in more detail - and while these
1432	rules might look complicated, they usually do "the right thing".	1403	rules might look complicated, they usually do "the right thing".
1433		1404
1434	=over 4	1405	=over 4
1435		1406
1436	=item initialiased	1407	=item initialised
1437		1408
1438	Before a watcher can be registered with the event looop it has to be	1409	Before a watcher can be registered with the event loop it has to be
1439	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1410	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1411	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441		1412
1442	In this state it is simply some block of memory that is suitable for use	1413	In this state it is simply some block of memory that is suitable for
1443	in an event loop. It can be moved around, freed, reused etc. at will.	1414	use in an event loop. It can be moved around, freed, reused etc. at
		1415	will - as long as you either keep the memory contents intact, or call
		1416	C<ev_TYPE_init> again.
1444		1417
1445	=item started/running/active	1418	=item started/running/active
1446		1419
1447	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1420	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448	property of the event loop, and is actively waiting for events. While in	1421	property of the event loop, and is actively waiting for events. While in
…		…
1476	latter will clear any pending state the watcher might be in, regardless	1449	latter will clear any pending state the watcher might be in, regardless
1477	of whether it was active or not, so stopping a watcher explicitly before	1450	of whether it was active or not, so stopping a watcher explicitly before
1478	freeing it is often a good idea.	1451	freeing it is often a good idea.
1479		1452
1480	While stopped (and not pending) the watcher is essentially in the	1453	While stopped (and not pending) the watcher is essentially in the
1481	initialised state, that is it can be reused, moved, modified in any way	1454	initialised state, that is, it can be reused, moved, modified in any way
1482	you wish.	1455	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1456	it again).
1483		1457
1484	=back	1458	=back
1485		1459
1486	=head2 WATCHER PRIORITY MODELS	1460	=head2 WATCHER PRIORITY MODELS
1487		1461
…		…
1680	always get a readiness notification instantly, and your read (or possibly	1654	always get a readiness notification instantly, and your read (or possibly
1681	write) will still block on the disk I/O.	1655	write) will still block on the disk I/O.
1682		1656
1683	Another way to view it is that in the case of sockets, pipes, character	1657	Another way to view it is that in the case of sockets, pipes, character
1684	devices and so on, there is another party (the sender) that delivers data	1658	devices and so on, there is another party (the sender) that delivers data
1685	on it's own, but in the case of files, there is no such thing: the disk	1659	on its own, but in the case of files, there is no such thing: the disk
1686	will not send data on it's own, simply because it doesn't know what you	1660	will not send data on its own, simply because it doesn't know what you
1687	wish to read - you would first have to request some data.	1661	wish to read - you would first have to request some data.
1688		1662
1689	Since files are typically not-so-well supported by advanced notification	1663	Since files are typically not-so-well supported by advanced notification
1690	mechanism, libev tries hard to emulate POSIX behaviour with respect	1664	mechanism, libev tries hard to emulate POSIX behaviour with respect
1691	to files, even though you should not use it. The reason for this is	1665	to files, even though you should not use it. The reason for this is
…		…
1815	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1789	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1816	monotonic clock option helps a lot here).	1790	monotonic clock option helps a lot here).
1817		1791
1818	The callback is guaranteed to be invoked only I<after> its timeout has	1792	The callback is guaranteed to be invoked only I<after> its timeout has
1819	passed (not I<at>, so on systems with very low-resolution clocks this	1793	passed (not I<at>, so on systems with very low-resolution clocks this
1820	might introduce a small delay). If multiple timers become ready during the	1794	might introduce a small delay, see "the special problem of being too
		1795	early", below). If multiple timers become ready during the same loop
1821	same loop iteration then the ones with earlier time-out values are invoked	1796	iteration then the ones with earlier time-out values are invoked before
1822	before ones of the same priority with later time-out values (but this is	1797	ones of the same priority with later time-out values (but this is no
1823	no longer true when a callback calls C<ev_run> recursively).	1798	longer true when a callback calls C<ev_run> recursively).
1824		1799
1825	=head3 Be smart about timeouts	1800	=head3 Be smart about timeouts
1826		1801
1827	Many real-world problems involve some kind of timeout, usually for error	1802	Many real-world problems involve some kind of timeout, usually for error
1828	recovery. A typical example is an HTTP request - if the other side hangs,	1803	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1903		1878
1904	In this case, it would be more efficient to leave the C<ev_timer> alone,	1879	In this case, it would be more efficient to leave the C<ev_timer> alone,
1905	but remember the time of last activity, and check for a real timeout only	1880	but remember the time of last activity, and check for a real timeout only
1906	within the callback:	1881	within the callback:
1907		1882
		1883	ev_tstamp timeout = 60.;
1908	ev_tstamp last_activity; // time of last activity	1884	ev_tstamp last_activity; // time of last activity
		1885	ev_timer timer;
1909		1886
1910	static void	1887	static void
1911	callback (EV_P_ ev_timer *w, int revents)	1888	callback (EV_P_ ev_timer *w, int revents)
1912	{	1889	{
1913	ev_tstamp now = ev_now (EV_A);	1890	// calculate when the timeout would happen
1914	ev_tstamp timeout = last_activity + 60.;	1891	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1915		1892
1916	// if last_activity + 60. is older than now, we did time out	1893	// if negative, it means we the timeout already occurred
1917	if (timeout < now)	1894	if (after < 0.)
1918	{	1895	{
1919	// timeout occurred, take action	1896	// timeout occurred, take action
1920	}	1897	}
1921	else	1898	else
1922	{	1899	{
1923	// callback was invoked, but there was some activity, re-arm	1900	// callback was invoked, but there was some recent
1924	// the watcher to fire in last_activity + 60, which is	1901	// activity. simply restart the timer to time out
1925	// guaranteed to be in the future, so "again" is positive:	1902	// after "after" seconds, which is the earliest time
1926	w->repeat = timeout - now;	1903	// the timeout can occur.
		1904	ev_timer_set (w, after, 0.);
1927	ev_timer_again (EV_A_ w);	1905	ev_timer_start (EV_A_ w);
1928	}	1906	}
1929	}	1907	}
1930		1908
1931	To summarise the callback: first calculate the real timeout (defined	1909	To summarise the callback: first calculate in how many seconds the
1932	as "60 seconds after the last activity"), then check if that time has	1910	timeout will occur (by calculating the absolute time when it would occur,
1933	been reached, which means something I<did>, in fact, time out. Otherwise	1911	C<last_activity + timeout>, and subtracting the current time, C<ev_now
1934	the callback was invoked too early (C<timeout> is in the future), so	1912	(EV_A)> from that).
1935	re-schedule the timer to fire at that future time, to see if maybe we have
1936	a timeout then.
1937		1913
1938	Note how C<ev_timer_again> is used, taking advantage of the	1914	If this value is negative, then we are already past the timeout, i.e. we
1939	C<ev_timer_again> optimisation when the timer is already running.	1915	timed out, and need to do whatever is needed in this case.
		1916
		1917	Otherwise, we now the earliest time at which the timeout would trigger,
		1918	and simply start the timer with this timeout value.
		1919
		1920	In other words, each time the callback is invoked it will check whether
		1921	the timeout occurred. If not, it will simply reschedule itself to check
		1922	again at the earliest time it could time out. Rinse. Repeat.
1940		1923
1941	This scheme causes more callback invocations (about one every 60 seconds	1924	This scheme causes more callback invocations (about one every 60 seconds
1942	minus half the average time between activity), but virtually no calls to	1925	minus half the average time between activity), but virtually no calls to
1943	libev to change the timeout.	1926	libev to change the timeout.
1944		1927
1945	To start the timer, simply initialise the watcher and set C<last_activity>	1928	To start the machinery, simply initialise the watcher and set
1946	to the current time (meaning we just have some activity :), then call the	1929	C<last_activity> to the current time (meaning there was some activity just
1947	callback, which will "do the right thing" and start the timer:	1930	now), then call the callback, which will "do the right thing" and start
		1931	the timer:
1948		1932
		1933	last_activity = ev_now (EV_A);
1949	ev_init (timer, callback);	1934	ev_init (&timer, callback);
1950	last_activity = ev_now (loop);	1935	callback (EV_A_ &timer, 0);
1951	callback (loop, timer, EV_TIMER);
1952		1936
1953	And when there is some activity, simply store the current time in	1937	When there is some activity, simply store the current time in
1954	C<last_activity>, no libev calls at all:	1938	C<last_activity>, no libev calls at all:
1955		1939
		1940	if (activity detected)
1956	last_activity = ev_now (loop);	1941	last_activity = ev_now (EV_A);
		1942
		1943	When your timeout value changes, then the timeout can be changed by simply
		1944	providing a new value, stopping the timer and calling the callback, which
		1945	will again do the right thing (for example, time out immediately :).
		1946
		1947	timeout = new_value;
		1948	ev_timer_stop (EV_A_ &timer);
		1949	callback (EV_A_ &timer, 0);
1957		1950
1958	This technique is slightly more complex, but in most cases where the	1951	This technique is slightly more complex, but in most cases where the
1959	time-out is unlikely to be triggered, much more efficient.	1952	time-out is unlikely to be triggered, much more efficient.
1960
1961	Changing the timeout is trivial as well (if it isn't hard-coded in the
1962	callback :) - just change the timeout and invoke the callback, which will
1963	fix things for you.
1964		1953
1965	=item 4. Wee, just use a double-linked list for your timeouts.	1954	=item 4. Wee, just use a double-linked list for your timeouts.
1966		1955
1967	If there is not one request, but many thousands (millions...), all	1956	If there is not one request, but many thousands (millions...), all
1968	employing some kind of timeout with the same timeout value, then one can	1957	employing some kind of timeout with the same timeout value, then one can
…		…
1995	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	1984	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1996	rather complicated, but extremely efficient, something that really pays	1985	rather complicated, but extremely efficient, something that really pays
1997	off after the first million or so of active timers, i.e. it's usually	1986	off after the first million or so of active timers, i.e. it's usually
1998	overkill :)	1987	overkill :)
1999		1988
		1989	=head3 The special problem of being too early
		1990
		1991	If you ask a timer to call your callback after three seconds, then
		1992	you expect it to be invoked after three seconds - but of course, this
		1993	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1994	guaranteed to any precision by libev - imagine somebody suspending the
		1995	process with a STOP signal for a few hours for example.
		1996
		1997	So, libev tries to invoke your callback as soon as possible I<after> the
		1998	delay has occurred, but cannot guarantee this.
		1999
		2000	A less obvious failure mode is calling your callback too early: many event
		2001	loops compare timestamps with a "elapsed delay >= requested delay", but
		2002	this can cause your callback to be invoked much earlier than you would
		2003	expect.
		2004
		2005	To see why, imagine a system with a clock that only offers full second
		2006	resolution (think windows if you can't come up with a broken enough OS
		2007	yourself). If you schedule a one-second timer at the time 500.9, then the
		2008	event loop will schedule your timeout to elapse at a system time of 500
		2009	(500.9 truncated to the resolution) + 1, or 501.
		2010
		2011	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2012	501" and invoke the callback 0.1s after it was started, even though a
		2013	one-second delay was requested - this is being "too early", despite best
		2014	intentions.
		2015
		2016	This is the reason why libev will never invoke the callback if the elapsed
		2017	delay equals the requested delay, but only when the elapsed delay is
		2018	larger than the requested delay. In the example above, libev would only invoke
		2019	the callback at system time 502, or 1.1s after the timer was started.
		2020
		2021	So, while libev cannot guarantee that your callback will be invoked
		2022	exactly when requested, it I<can> and I<does> guarantee that the requested
		2023	delay has actually elapsed, or in other words, it always errs on the "too
		2024	late" side of things.
		2025
2000	=head3 The special problem of time updates	2026	=head3 The special problem of time updates
2001		2027
2002	Establishing the current time is a costly operation (it usually takes at	2028	Establishing the current time is a costly operation (it usually takes
2003	least two system calls): EV therefore updates its idea of the current	2029	at least one system call): EV therefore updates its idea of the current
2004	time only before and after C<ev_run> collects new events, which causes a	2030	time only before and after C<ev_run> collects new events, which causes a
2005	growing difference between C<ev_now ()> and C<ev_time ()> when handling	2031	growing difference between C<ev_now ()> and C<ev_time ()> when handling
2006	lots of events in one iteration.	2032	lots of events in one iteration.
2007		2033
2008	The relative timeouts are calculated relative to the C<ev_now ()>	2034	The relative timeouts are calculated relative to the C<ev_now ()>
2009	time. This is usually the right thing as this timestamp refers to the time	2035	time. This is usually the right thing as this timestamp refers to the time
2010	of the event triggering whatever timeout you are modifying/starting. If	2036	of the event triggering whatever timeout you are modifying/starting. If
2011	you suspect event processing to be delayed and you I<need> to base the	2037	you suspect event processing to be delayed and you I<need> to base the
2012	timeout on the current time, use something like this to adjust for this:	2038	timeout on the current time, use something like the following to adjust
		2039	for it:
2013		2040
2014	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2041	ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2015		2042
2016	If the event loop is suspended for a long time, you can also force an	2043	If the event loop is suspended for a long time, you can also force an
2017	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2044	update of the time returned by C<ev_now ()> by calling C<ev_now_update
2018	()>.	2045	()>, although that will push the event time of all outstanding events
		2046	further into the future.
		2047
		2048	=head3 The special problem of unsynchronised clocks
		2049
		2050	Modern systems have a variety of clocks - libev itself uses the normal
		2051	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2052	jumps).
		2053
		2054	Neither of these clocks is synchronised with each other or any other clock
		2055	on the system, so C<ev_time ()> might return a considerably different time
		2056	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2057	a call to C<gettimeofday> might return a second count that is one higher
		2058	than a directly following call to C<time>.
		2059
		2060	The moral of this is to only compare libev-related timestamps with
		2061	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2062	a second or so.
		2063
		2064	One more problem arises due to this lack of synchronisation: if libev uses
		2065	the system monotonic clock and you compare timestamps from C<ev_time>
		2066	or C<ev_now> from when you started your timer and when your callback is
		2067	invoked, you will find that sometimes the callback is a bit "early".
		2068
		2069	This is because C<ev_timer>s work in real time, not wall clock time, so
		2070	libev makes sure your callback is not invoked before the delay happened,
		2071	I<measured according to the real time>, not the system clock.
		2072
		2073	If your timeouts are based on a physical timescale (e.g. "time out this
		2074	connection after 100 seconds") then this shouldn't bother you as it is
		2075	exactly the right behaviour.
		2076
		2077	If you want to compare wall clock/system timestamps to your timers, then
		2078	you need to use C<ev_periodic>s, as these are based on the wall clock
		2079	time, where your comparisons will always generate correct results.
2019		2080
2020	=head3 The special problems of suspended animation	2081	=head3 The special problems of suspended animation
2021		2082
2022	When you leave the server world it is quite customary to hit machines that	2083	When you leave the server world it is quite customary to hit machines that
2023	can suspend/hibernate - what happens to the clocks during such a suspend?	2084	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
2053		2114
2054	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	2115	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
2055		2116
2056	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	2117	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
2057		2118
2058	Configure the timer to trigger after C<after> seconds. If C<repeat>	2119	Configure the timer to trigger after C<after> seconds (fractional and
2059	is C<0.>, then it will automatically be stopped once the timeout is	2120	negative values are supported). If C<repeat> is C<0.>, then it will
2060	reached. If it is positive, then the timer will automatically be	2121	automatically be stopped once the timeout is reached. If it is positive,
2061	configured to trigger again C<repeat> seconds later, again, and again,	2122	then the timer will automatically be configured to trigger again C<repeat>
2062	until stopped manually.	2123	seconds later, again, and again, until stopped manually.
2063		2124
2064	The timer itself will do a best-effort at avoiding drift, that is, if	2125	The timer itself will do a best-effort at avoiding drift, that is, if
2065	you configure a timer to trigger every 10 seconds, then it will normally	2126	you configure a timer to trigger every 10 seconds, then it will normally
2066	trigger at exactly 10 second intervals. If, however, your program cannot	2127	trigger at exactly 10 second intervals. If, however, your program cannot
2067	keep up with the timer (because it takes longer than those 10 seconds to	2128	keep up with the timer (because it takes longer than those 10 seconds to
2068	do stuff) the timer will not fire more than once per event loop iteration.	2129	do stuff) the timer will not fire more than once per event loop iteration.
2069		2130
2070	=item ev_timer_again (loop, ev_timer *)	2131	=item ev_timer_again (loop, ev_timer *)
2071		2132
2072	This will act as if the timer timed out and restart it again if it is	2133	This will act as if the timer timed out, and restarts it again if it is
2073	repeating. The exact semantics are:	2134	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2135	timeout to the C<repeat> value and calling C<ev_timer_start>.
2074		2136
		2137	The exact semantics are as in the following rules, all of which will be
		2138	applied to the watcher:
		2139
		2140	=over 4
		2141
2075	If the timer is pending, its pending status is cleared.	2142	=item If the timer is pending, the pending status is always cleared.
2076		2143
2077	If the timer is started but non-repeating, stop it (as if it timed out).	2144	=item If the timer is started but non-repeating, stop it (as if it timed
		2145	out, without invoking it).
2078		2146
2079	If the timer is repeating, either start it if necessary (with the	2147	=item If the timer is repeating, make the C<repeat> value the new timeout
2080	C<repeat> value), or reset the running timer to the C<repeat> value.	2148	and start the timer, if necessary.
2081		2149
		2150	=back
		2151
2082	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2152	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2083	usage example.	2153	usage example.
2084		2154
2085	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2155	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2086		2156
2087	Returns the remaining time until a timer fires. If the timer is active,	2157	Returns the remaining time until a timer fires. If the timer is active,
…		…
2140	Periodic watchers are also timers of a kind, but they are very versatile	2210	Periodic watchers are also timers of a kind, but they are very versatile
2141	(and unfortunately a bit complex).	2211	(and unfortunately a bit complex).
2142		2212
2143	Unlike C<ev_timer>, periodic watchers are not based on real time (or	2213	Unlike C<ev_timer>, periodic watchers are not based on real time (or
2144	relative time, the physical time that passes) but on wall clock time	2214	relative time, the physical time that passes) but on wall clock time
2145	(absolute time, the thing you can read on your calender or clock). The	2215	(absolute time, the thing you can read on your calendar or clock). The
2146	difference is that wall clock time can run faster or slower than real	2216	difference is that wall clock time can run faster or slower than real
2147	time, and time jumps are not uncommon (e.g. when you adjust your	2217	time, and time jumps are not uncommon (e.g. when you adjust your
2148	wrist-watch).	2218	wrist-watch).
2149		2219
2150	You can tell a periodic watcher to trigger after some specific point	2220	You can tell a periodic watcher to trigger after some specific point
…		…
2155	C<ev_timer>, which would still trigger roughly 10 seconds after starting	2225	C<ev_timer>, which would still trigger roughly 10 seconds after starting
2156	it, as it uses a relative timeout).	2226	it, as it uses a relative timeout).
2157		2227
2158	C<ev_periodic> watchers can also be used to implement vastly more complex	2228	C<ev_periodic> watchers can also be used to implement vastly more complex
2159	timers, such as triggering an event on each "midnight, local time", or	2229	timers, such as triggering an event on each "midnight, local time", or
2160	other complicated rules. This cannot be done with C<ev_timer> watchers, as	2230	other complicated rules. This cannot easily be done with C<ev_timer>
2161	those cannot react to time jumps.	2231	watchers, as those cannot react to time jumps.
2162		2232
2163	As with timers, the callback is guaranteed to be invoked only when the	2233	As with timers, the callback is guaranteed to be invoked only when the
2164	point in time where it is supposed to trigger has passed. If multiple	2234	point in time where it is supposed to trigger has passed. If multiple
2165	timers become ready during the same loop iteration then the ones with	2235	timers become ready during the same loop iteration then the ones with
2166	earlier time-out values are invoked before ones with later time-out values	2236	earlier time-out values are invoked before ones with later time-out values
…		…
2207		2277
2208	Another way to think about it (for the mathematically inclined) is that	2278	Another way to think about it (for the mathematically inclined) is that
2209	C<ev_periodic> will try to run the callback in this mode at the next possible	2279	C<ev_periodic> will try to run the callback in this mode at the next possible
2210	time where C<time = offset (mod interval)>, regardless of any time jumps.	2280	time where C<time = offset (mod interval)>, regardless of any time jumps.
2211		2281
2212	For numerical stability it is preferable that the C<offset> value is near	2282	The C<interval> I<MUST> be positive, and for numerical stability, the
2213	C<ev_now ()> (the current time), but there is no range requirement for	2283	interval value should be higher than C<1/8192> (which is around 100
2214	this value, and in fact is often specified as zero.	2284	microseconds) and C<offset> should be higher than C<0> and should have
		2285	at most a similar magnitude as the current time (say, within a factor of
		2286	ten). Typical values for offset are, in fact, C<0> or something between
		2287	C<0> and C<interval>, which is also the recommended range.
2215		2288
2216	Note also that there is an upper limit to how often a timer can fire (CPU	2289	Note also that there is an upper limit to how often a timer can fire (CPU
2217	speed for example), so if C<interval> is very small then timing stability	2290	speed for example), so if C<interval> is very small then timing stability
2218	will of course deteriorate. Libev itself tries to be exact to be about one	2291	will of course deteriorate. Libev itself tries to be exact to be about one
2219	millisecond (if the OS supports it and the machine is fast enough).	2292	millisecond (if the OS supports it and the machine is fast enough).
…		…
2249		2322
2250	NOTE: I<< This callback must always return a time that is higher than or	2323	NOTE: I<< This callback must always return a time that is higher than or
2251	equal to the passed C<now> value >>.	2324	equal to the passed C<now> value >>.
2252		2325
2253	This can be used to create very complex timers, such as a timer that	2326	This can be used to create very complex timers, such as a timer that
2254	triggers on "next midnight, local time". To do this, you would calculate the	2327	triggers on "next midnight, local time". To do this, you would calculate
2255	next midnight after C<now> and return the timestamp value for this. How	2328	the next midnight after C<now> and return the timestamp value for
2256	you do this is, again, up to you (but it is not trivial, which is the main	2329	this. Here is a (completely untested, no error checking) example on how to
2257	reason I omitted it as an example).	2330	do this:
		2331
		2332	#include <time.h>
		2333
		2334	static ev_tstamp
		2335	my_rescheduler (ev_periodic *w, ev_tstamp now)
		2336	{
		2337	time_t tnow = (time_t)now;
		2338	struct tm tm;
		2339	localtime_r (&tnow, &tm);
		2340
		2341	tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
		2342	++tm.tm_mday; // midnight next day
		2343
		2344	return mktime (&tm);
		2345	}
		2346
		2347	Note: this code might run into trouble on days that have more then two
		2348	midnights (beginning and end).
2258		2349
2259	=back	2350	=back
2260		2351
2261	=item ev_periodic_again (loop, ev_periodic *)	2352	=item ev_periodic_again (loop, ev_periodic *)
2262		2353
…		…
2327		2418
2328	ev_periodic hourly_tick;	2419	ev_periodic hourly_tick;
2329	ev_periodic_init (&hourly_tick, clock_cb,	2420	ev_periodic_init (&hourly_tick, clock_cb,
2330	fmod (ev_now (loop), 3600.), 3600., 0);	2421	fmod (ev_now (loop), 3600.), 3600., 0);
2331	ev_periodic_start (loop, &hourly_tick);	2422	ev_periodic_start (loop, &hourly_tick);
2332		2423
2333		2424
2334	=head2 C<ev_signal> - signal me when a signal gets signalled!	2425	=head2 C<ev_signal> - signal me when a signal gets signalled!
2335		2426
2336	Signal watchers will trigger an event when the process receives a specific	2427	Signal watchers will trigger an event when the process receives a specific
2337	signal one or more times. Even though signals are very asynchronous, libev	2428	signal one or more times. Even though signals are very asynchronous, libev
…		…
2347	only within the same loop, i.e. you can watch for C<SIGINT> in your	2438	only within the same loop, i.e. you can watch for C<SIGINT> in your
2348	default loop and for C<SIGIO> in another loop, but you cannot watch for	2439	default loop and for C<SIGIO> in another loop, but you cannot watch for
2349	C<SIGINT> in both the default loop and another loop at the same time. At	2440	C<SIGINT> in both the default loop and another loop at the same time. At
2350	the moment, C<SIGCHLD> is permanently tied to the default loop.	2441	the moment, C<SIGCHLD> is permanently tied to the default loop.
2351		2442
2352	When the first watcher gets started will libev actually register something	2443	Only after the first watcher for a signal is started will libev actually
2353	with the kernel (thus it coexists with your own signal handlers as long as	2444	register something with the kernel. It thus coexists with your own signal
2354	you don't register any with libev for the same signal).	2445	handlers as long as you don't register any with libev for the same signal.
2355		2446
2356	If possible and supported, libev will install its handlers with	2447	If possible and supported, libev will install its handlers with
2357	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2448	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2358	not be unduly interrupted. If you have a problem with system calls getting	2449	not be unduly interrupted. If you have a problem with system calls getting
2359	interrupted by signals you can block all signals in an C<ev_check> watcher	2450	interrupted by signals you can block all signals in an C<ev_check> watcher
…		…
2362	=head3 The special problem of inheritance over fork/execve/pthread_create	2453	=head3 The special problem of inheritance over fork/execve/pthread_create
2363		2454
2364	Both the signal mask (C<sigprocmask>) and the signal disposition	2455	Both the signal mask (C<sigprocmask>) and the signal disposition
2365	(C<sigaction>) are unspecified after starting a signal watcher (and after	2456	(C<sigaction>) are unspecified after starting a signal watcher (and after
2366	stopping it again), that is, libev might or might not block the signal,	2457	stopping it again), that is, libev might or might not block the signal,
2367	and might or might not set or restore the installed signal handler.	2458	and might or might not set or restore the installed signal handler (but
		2459	see C<EVFLAG_NOSIGMASK>).
2368		2460
2369	While this does not matter for the signal disposition (libev never	2461	While this does not matter for the signal disposition (libev never
2370	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2462	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2371	C<execve>), this matters for the signal mask: many programs do not expect	2463	C<execve>), this matters for the signal mask: many programs do not expect
2372	certain signals to be blocked.	2464	certain signals to be blocked.
…		…
2543		2635
2544	=head2 C<ev_stat> - did the file attributes just change?	2636	=head2 C<ev_stat> - did the file attributes just change?
2545		2637
2546	This watches a file system path for attribute changes. That is, it calls	2638	This watches a file system path for attribute changes. That is, it calls
2547	C<stat> on that path in regular intervals (or when the OS says it changed)	2639	C<stat> on that path in regular intervals (or when the OS says it changed)
2548	and sees if it changed compared to the last time, invoking the callback if	2640	and sees if it changed compared to the last time, invoking the callback
2549	it did.	2641	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2642	happen after the watcher has been started will be reported.
2550		2643
2551	The path does not need to exist: changing from "path exists" to "path does	2644	The path does not need to exist: changing from "path exists" to "path does
2552	not exist" is a status change like any other. The condition "path does not	2645	not exist" is a status change like any other. The condition "path does not
2553	exist" (or more correctly "path cannot be stat'ed") is signified by the	2646	exist" (or more correctly "path cannot be stat'ed") is signified by the
2554	C<st_nlink> field being zero (which is otherwise always forced to be at	2647	C<st_nlink> field being zero (which is otherwise always forced to be at
…		…
2784	Apart from keeping your process non-blocking (which is a useful	2877	Apart from keeping your process non-blocking (which is a useful
2785	effect on its own sometimes), idle watchers are a good place to do	2878	effect on its own sometimes), idle watchers are a good place to do
2786	"pseudo-background processing", or delay processing stuff to after the	2879	"pseudo-background processing", or delay processing stuff to after the
2787	event loop has handled all outstanding events.	2880	event loop has handled all outstanding events.
2788		2881
		2882	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2883
		2884	As long as there is at least one active idle watcher, libev will never
		2885	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2886	For this to work, the idle watcher doesn't need to be invoked at all - the
		2887	lowest priority will do.
		2888
		2889	This mode of operation can be useful together with an C<ev_check> watcher,
		2890	to do something on each event loop iteration - for example to balance load
		2891	between different connections.
		2892
		2893	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2894	example.
		2895
2789	=head3 Watcher-Specific Functions and Data Members	2896	=head3 Watcher-Specific Functions and Data Members
2790		2897
2791	=over 4	2898	=over 4
2792		2899
2793	=item ev_idle_init (ev_idle *, callback)	2900	=item ev_idle_init (ev_idle *, callback)
…		…
2804	callback, free it. Also, use no error checking, as usual.	2911	callback, free it. Also, use no error checking, as usual.
2805		2912
2806	static void	2913	static void
2807	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)	2914	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2808	{	2915	{
		2916	// stop the watcher
		2917	ev_idle_stop (loop, w);
		2918
		2919	// now we can free it
2809	free (w);	2920	free (w);
		2921
2810	// now do something you wanted to do when the program has	2922	// now do something you wanted to do when the program has
2811	// no longer anything immediate to do.	2923	// no longer anything immediate to do.
2812	}	2924	}
2813		2925
2814	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2926	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2816	ev_idle_start (loop, idle_watcher);	2928	ev_idle_start (loop, idle_watcher);
2817		2929
2818		2930
2819	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2931	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2820		2932
2821	Prepare and check watchers are usually (but not always) used in pairs:	2933	Prepare and check watchers are often (but not always) used in pairs:
2822	prepare watchers get invoked before the process blocks and check watchers	2934	prepare watchers get invoked before the process blocks and check watchers
2823	afterwards.	2935	afterwards.
2824		2936
2825	You I<must not> call C<ev_run> or similar functions that enter	2937	You I<must not> call C<ev_run> (or similar functions that enter the
2826	the current event loop from either C<ev_prepare> or C<ev_check>	2938	current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2827	watchers. Other loops than the current one are fine, however. The	2939	C<ev_check> watchers. Other loops than the current one are fine,
2828	rationale behind this is that you do not need to check for recursion in	2940	however. The rationale behind this is that you do not need to check
2829	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2941	for recursion in those watchers, i.e. the sequence will always be
2830	C<ev_check> so if you have one watcher of each kind they will always be	2942	C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2831	called in pairs bracketing the blocking call.	2943	kind they will always be called in pairs bracketing the blocking call.
2832		2944
2833	Their main purpose is to integrate other event mechanisms into libev and	2945	Their main purpose is to integrate other event mechanisms into libev and
2834	their use is somewhat advanced. They could be used, for example, to track	2946	their use is somewhat advanced. They could be used, for example, to track
2835	variable changes, implement your own watchers, integrate net-snmp or a	2947	variable changes, implement your own watchers, integrate net-snmp or a
2836	coroutine library and lots more. They are also occasionally useful if	2948	coroutine library and lots more. They are also occasionally useful if
…		…
2854	with priority higher than or equal to the event loop and one coroutine	2966	with priority higher than or equal to the event loop and one coroutine
2855	of lower priority, but only once, using idle watchers to keep the event	2967	of lower priority, but only once, using idle watchers to keep the event
2856	loop from blocking if lower-priority coroutines are active, thus mapping	2968	loop from blocking if lower-priority coroutines are active, thus mapping
2857	low-priority coroutines to idle/background tasks).	2969	low-priority coroutines to idle/background tasks).
2858		2970
2859	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2971	When used for this purpose, it is recommended to give C<ev_check> watchers
2860	priority, to ensure that they are being run before any other watchers	2972	highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2861	after the poll (this doesn't matter for C<ev_prepare> watchers).	2973	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		2974	watchers).
2862		2975
2863	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	2976	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2864	activate ("feed") events into libev. While libev fully supports this, they	2977	activate ("feed") events into libev. While libev fully supports this, they
2865	might get executed before other C<ev_check> watchers did their job. As	2978	might get executed before other C<ev_check> watchers did their job. As
2866	C<ev_check> watchers are often used to embed other (non-libev) event	2979	C<ev_check> watchers are often used to embed other (non-libev) event
2867	loops those other event loops might be in an unusable state until their	2980	loops those other event loops might be in an unusable state until their
2868	C<ev_check> watcher ran (always remind yourself to coexist peacefully with	2981	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2869	others).	2982	others).
		2983
		2984	=head3 Abusing an C<ev_check> watcher for its side-effect
		2985
		2986	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		2987	useful because they are called once per event loop iteration. For
		2988	example, if you want to handle a large number of connections fairly, you
		2989	normally only do a bit of work for each active connection, and if there
		2990	is more work to do, you wait for the next event loop iteration, so other
		2991	connections have a chance of making progress.
		2992
		2993	Using an C<ev_check> watcher is almost enough: it will be called on the
		2994	next event loop iteration. However, that isn't as soon as possible -
		2995	without external events, your C<ev_check> watcher will not be invoked.
		2996
		2997	This is where C<ev_idle> watchers come in handy - all you need is a
		2998	single global idle watcher that is active as long as you have one active
		2999	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		3000	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		3001	invoked. Neither watcher alone can do that.
2870		3002
2871	=head3 Watcher-Specific Functions and Data Members	3003	=head3 Watcher-Specific Functions and Data Members
2872		3004
2873	=over 4	3005	=over 4
2874		3006
…		…
3075		3207
3076	=over 4	3208	=over 4
3077		3209
3078	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	3210	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3079		3211
3080	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	3212	=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3081		3213
3082	Configures the watcher to embed the given loop, which must be	3214	Configures the watcher to embed the given loop, which must be
3083	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	3215	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3084	invoked automatically, otherwise it is the responsibility of the callback	3216	invoked automatically, otherwise it is the responsibility of the callback
3085	to invoke it (it will continue to be called until the sweep has been done,	3217	to invoke it (it will continue to be called until the sweep has been done,
…		…
3106	used).	3238	used).
3107		3239
3108	struct ev_loop *loop_hi = ev_default_init (0);	3240	struct ev_loop *loop_hi = ev_default_init (0);
3109	struct ev_loop *loop_lo = 0;	3241	struct ev_loop *loop_lo = 0;
3110	ev_embed embed;	3242	ev_embed embed;
3111		3243
3112	// see if there is a chance of getting one that works	3244	// see if there is a chance of getting one that works
3113	// (remember that a flags value of 0 means autodetection)	3245	// (remember that a flags value of 0 means autodetection)
3114	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3246	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3115	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3247	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3116	: 0;	3248	: 0;
…		…
3130	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3262	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3131		3263
3132	struct ev_loop *loop = ev_default_init (0);	3264	struct ev_loop *loop = ev_default_init (0);
3133	struct ev_loop *loop_socket = 0;	3265	struct ev_loop *loop_socket = 0;
3134	ev_embed embed;	3266	ev_embed embed;
3135		3267
3136	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3268	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3137	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3269	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3138	{	3270	{
3139	ev_embed_init (&embed, 0, loop_socket);	3271	ev_embed_init (&embed, 0, loop_socket);
3140	ev_embed_start (loop, &embed);	3272	ev_embed_start (loop, &embed);
…		…
3148		3280
3149	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3281	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3150		3282
3151	Fork watchers are called when a C<fork ()> was detected (usually because	3283	Fork watchers are called when a C<fork ()> was detected (usually because
3152	whoever is a good citizen cared to tell libev about it by calling	3284	whoever is a good citizen cared to tell libev about it by calling
3153	C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the	3285	C<ev_loop_fork>). The invocation is done before the event loop blocks next
3154	event loop blocks next and before C<ev_check> watchers are being called,	3286	and before C<ev_check> watchers are being called, and only in the child
3155	and only in the child after the fork. If whoever good citizen calling	3287	after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3156	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3288	and calls it in the wrong process, the fork handlers will be invoked, too,
3157	handlers will be invoked, too, of course.	3289	of course.
3158		3290
3159	=head3 The special problem of life after fork - how is it possible?	3291	=head3 The special problem of life after fork - how is it possible?
3160		3292
3161	Most uses of C<fork()> consist of forking, then some simple calls to set	3293	Most uses of C<fork ()> consist of forking, then some simple calls to set
3162	up/change the process environment, followed by a call to C<exec()>. This	3294	up/change the process environment, followed by a call to C<exec()>. This
3163	sequence should be handled by libev without any problems.	3295	sequence should be handled by libev without any problems.
3164		3296
3165	This changes when the application actually wants to do event handling	3297	This changes when the application actually wants to do event handling
3166	in the child, or both parent in child, in effect "continuing" after the	3298	in the child, or both parent in child, in effect "continuing" after the
…		…
3243	atexit (program_exits);	3375	atexit (program_exits);
3244		3376
3245		3377
3246	=head2 C<ev_async> - how to wake up an event loop	3378	=head2 C<ev_async> - how to wake up an event loop
3247		3379
3248	In general, you cannot use an C<ev_run> from multiple threads or other	3380	In general, you cannot use an C<ev_loop> from multiple threads or other
3249	asynchronous sources such as signal handlers (as opposed to multiple event	3381	asynchronous sources such as signal handlers (as opposed to multiple event
3250	loops - those are of course safe to use in different threads).	3382	loops - those are of course safe to use in different threads).
3251		3383
3252	Sometimes, however, you need to wake up an event loop you do not control,	3384	Sometimes, however, you need to wake up an event loop you do not control,
3253	for example because it belongs to another thread. This is what C<ev_async>	3385	for example because it belongs to another thread. This is what C<ev_async>
…		…
3255	it by calling C<ev_async_send>, which is thread- and signal safe.	3387	it by calling C<ev_async_send>, which is thread- and signal safe.
3256		3388
3257	This functionality is very similar to C<ev_signal> watchers, as signals,	3389	This functionality is very similar to C<ev_signal> watchers, as signals,
3258	too, are asynchronous in nature, and signals, too, will be compressed	3390	too, are asynchronous in nature, and signals, too, will be compressed
3259	(i.e. the number of callback invocations may be less than the number of	3391	(i.e. the number of callback invocations may be less than the number of
3260	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind	3392	C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3261	of "global async watchers" by using a watcher on an otherwise unused	3393	of "global async watchers" by using a watcher on an otherwise unused
3262	signal, and C<ev_feed_signal> to signal this watcher from another thread,	3394	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3263	even without knowing which loop owns the signal.	3395	even without knowing which loop owns the signal.
3264
3265	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
3266	just the default loop.
3267		3396
3268	=head3 Queueing	3397	=head3 Queueing
3269		3398
3270	C<ev_async> does not support queueing of data in any way. The reason	3399	C<ev_async> does not support queueing of data in any way. The reason
3271	is that the author does not know of a simple (or any) algorithm for a	3400	is that the author does not know of a simple (or any) algorithm for a
…		…
3363	trust me.	3492	trust me.
3364		3493
3365	=item ev_async_send (loop, ev_async *)	3494	=item ev_async_send (loop, ev_async *)
3366		3495
3367	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3496	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3368	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3497	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3498	returns.
		3499
3369	C<ev_feed_event>, this call is safe to do from other threads, signal or	3500	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3370	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3501	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3371	section below on what exactly this means).	3502	embedding section below on what exactly this means).
3372		3503
3373	Note that, as with other watchers in libev, multiple events might get	3504	Note that, as with other watchers in libev, multiple events might get
3374	compressed into a single callback invocation (another way to look at this	3505	compressed into a single callback invocation (another way to look at
3375	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3506	this is that C<ev_async> watchers are level-triggered: they are set on
3376	reset when the event loop detects that).	3507	C<ev_async_send>, reset when the event loop detects that).
3377		3508
3378	This call incurs the overhead of a system call only once per event loop	3509	This call incurs the overhead of at most one extra system call per event
3379	iteration, so while the overhead might be noticeable, it doesn't apply to	3510	loop iteration, if the event loop is blocked, and no syscall at all if
3380	repeated calls to C<ev_async_send> for the same event loop.	3511	the event loop (or your program) is processing events. That means that
		3512	repeated calls are basically free (there is no need to avoid calls for
		3513	performance reasons) and that the overhead becomes smaller (typically
		3514	zero) under load.
3381		3515
3382	=item bool = ev_async_pending (ev_async *)	3516	=item bool = ev_async_pending (ev_async *)
3383		3517
3384	Returns a non-zero value when C<ev_async_send> has been called on the	3518	Returns a non-zero value when C<ev_async_send> has been called on the
3385	watcher but the event has not yet been processed (or even noted) by the	3519	watcher but the event has not yet been processed (or even noted) by the
…		…
3402		3536
3403	There are some other functions of possible interest. Described. Here. Now.	3537	There are some other functions of possible interest. Described. Here. Now.
3404		3538
3405	=over 4	3539	=over 4
3406		3540
3407	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)	3541	=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3408		3542
3409	This function combines a simple timer and an I/O watcher, calls your	3543	This function combines a simple timer and an I/O watcher, calls your
3410	callback on whichever event happens first and automatically stops both	3544	callback on whichever event happens first and automatically stops both
3411	watchers. This is useful if you want to wait for a single event on an fd	3545	watchers. This is useful if you want to wait for a single event on an fd
3412	or timeout without having to allocate/configure/start/stop/free one or	3546	or timeout without having to allocate/configure/start/stop/free one or
…		…
3440	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3574	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3441		3575
3442	=item ev_feed_fd_event (loop, int fd, int revents)	3576	=item ev_feed_fd_event (loop, int fd, int revents)
3443		3577
3444	Feed an event on the given fd, as if a file descriptor backend detected	3578	Feed an event on the given fd, as if a file descriptor backend detected
3445	the given events it.	3579	the given events.
3446		3580
3447	=item ev_feed_signal_event (loop, int signum)	3581	=item ev_feed_signal_event (loop, int signum)
3448		3582
3449	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,	3583	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3450	which is async-safe.	3584	which is async-safe.
…		…
3455	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)	3589	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
3456		3590
3457	This section explains some common idioms that are not immediately	3591	This section explains some common idioms that are not immediately
3458	obvious. Note that examples are sprinkled over the whole manual, and this	3592	obvious. Note that examples are sprinkled over the whole manual, and this
3459	section only contains stuff that wouldn't fit anywhere else.	3593	section only contains stuff that wouldn't fit anywhere else.
		3594
		3595	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3596
		3597	Each watcher has, by default, a C<void *data> member that you can read
		3598	or modify at any time: libev will completely ignore it. This can be used
		3599	to associate arbitrary data with your watcher. If you need more data and
		3600	don't want to allocate memory separately and store a pointer to it in that
		3601	data member, you can also "subclass" the watcher type and provide your own
		3602	data:
		3603
		3604	struct my_io
		3605	{
		3606	ev_io io;
		3607	int otherfd;
		3608	void *somedata;
		3609	struct whatever *mostinteresting;
		3610	};
		3611
		3612	...
		3613	struct my_io w;
		3614	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3615
		3616	And since your callback will be called with a pointer to the watcher, you
		3617	can cast it back to your own type:
		3618
		3619	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3620	{
		3621	struct my_io *w = (struct my_io *)w_;
		3622	...
		3623	}
		3624
		3625	More interesting and less C-conformant ways of casting your callback
		3626	function type instead have been omitted.
		3627
		3628	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3629
		3630	Another common scenario is to use some data structure with multiple
		3631	embedded watchers, in effect creating your own watcher that combines
		3632	multiple libev event sources into one "super-watcher":
		3633
		3634	struct my_biggy
		3635	{
		3636	int some_data;
		3637	ev_timer t1;
		3638	ev_timer t2;
		3639	}
		3640
		3641	In this case getting the pointer to C<my_biggy> is a bit more
		3642	complicated: Either you store the address of your C<my_biggy> struct in
		3643	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3644	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3645	real programmers):
		3646
		3647	#include <stddef.h>
		3648
		3649	static void
		3650	t1_cb (EV_P_ ev_timer *w, int revents)
		3651	{
		3652	struct my_biggy big = (struct my_biggy *)
		3653	(((char *)w) - offsetof (struct my_biggy, t1));
		3654	}
		3655
		3656	static void
		3657	t2_cb (EV_P_ ev_timer *w, int revents)
		3658	{
		3659	struct my_biggy big = (struct my_biggy *)
		3660	(((char *)w) - offsetof (struct my_biggy, t2));
		3661	}
		3662
		3663	=head2 AVOIDING FINISHING BEFORE RETURNING
		3664
		3665	Often you have structures like this in event-based programs:
		3666
		3667	callback ()
		3668	{
		3669	free (request);
		3670	}
		3671
		3672	request = start_new_request (..., callback);
		3673
		3674	The intent is to start some "lengthy" operation. The C<request> could be
		3675	used to cancel the operation, or do other things with it.
		3676
		3677	It's not uncommon to have code paths in C<start_new_request> that
		3678	immediately invoke the callback, for example, to report errors. Or you add
		3679	some caching layer that finds that it can skip the lengthy aspects of the
		3680	operation and simply invoke the callback with the result.
		3681
		3682	The problem here is that this will happen I<before> C<start_new_request>
		3683	has returned, so C<request> is not set.
		3684
		3685	Even if you pass the request by some safer means to the callback, you
		3686	might want to do something to the request after starting it, such as
		3687	canceling it, which probably isn't working so well when the callback has
		3688	already been invoked.
		3689
		3690	A common way around all these issues is to make sure that
		3691	C<start_new_request> I<always> returns before the callback is invoked. If
		3692	C<start_new_request> immediately knows the result, it can artificially
		3693	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3694	example, or more sneakily, by reusing an existing (stopped) watcher and
		3695	pushing it into the pending queue:
		3696
		3697	ev_set_cb (watcher, callback);
		3698	ev_feed_event (EV_A_ watcher, 0);
		3699
		3700	This way, C<start_new_request> can safely return before the callback is
		3701	invoked, while not delaying callback invocation too much.
3460		3702
3461	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS	3703	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3462		3704
3463	Often (especially in GUI toolkits) there are places where you have	3705	Often (especially in GUI toolkits) there are places where you have
3464	I<modal> interaction, which is most easily implemented by recursively	3706	I<modal> interaction, which is most easily implemented by recursively
…		…
3466		3708
3467	This brings the problem of exiting - a callback might want to finish the	3709	This brings the problem of exiting - a callback might want to finish the
3468	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but	3710	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3469	a modal "Are you sure?" dialog is still waiting), or just the nested one	3711	a modal "Are you sure?" dialog is still waiting), or just the nested one
3470	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some	3712	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3471	other combination: In these cases, C<ev_break> will not work alone.	3713	other combination: In these cases, a simple C<ev_break> will not work.
3472		3714
3473	The solution is to maintain "break this loop" variable for each C<ev_run>	3715	The solution is to maintain "break this loop" variable for each C<ev_run>
3474	invocation, and use a loop around C<ev_run> until the condition is	3716	invocation, and use a loop around C<ev_run> until the condition is
3475	triggered, using C<EVRUN_ONCE>:	3717	triggered, using C<EVRUN_ONCE>:
3476		3718
…		…
3478	int exit_main_loop = 0;	3720	int exit_main_loop = 0;
3479		3721
3480	while (!exit_main_loop)	3722	while (!exit_main_loop)
3481	ev_run (EV_DEFAULT_ EVRUN_ONCE);	3723	ev_run (EV_DEFAULT_ EVRUN_ONCE);
3482		3724
3483	// in a model watcher	3725	// in a modal watcher
3484	int exit_nested_loop = 0;	3726	int exit_nested_loop = 0;
3485		3727
3486	while (!exit_nested_loop)	3728	while (!exit_nested_loop)
3487	ev_run (EV_A_ EVRUN_ONCE);	3729	ev_run (EV_A_ EVRUN_ONCE);
3488		3730
…		…
3498	exit_main_loop = exit_nested_loop = 1;	3740	exit_main_loop = exit_nested_loop = 1;
3499		3741
3500	=head2 THREAD LOCKING EXAMPLE	3742	=head2 THREAD LOCKING EXAMPLE
3501		3743
3502	Here is a fictitious example of how to run an event loop in a different	3744	Here is a fictitious example of how to run an event loop in a different
3503	thread than where callbacks are being invoked and watchers are	3745	thread from where callbacks are being invoked and watchers are
3504	created/added/removed.	3746	created/added/removed.
3505		3747
3506	For a real-world example, see the C<EV::Loop::Async> perl module,	3748	For a real-world example, see the C<EV::Loop::Async> perl module,
3507	which uses exactly this technique (which is suited for many high-level	3749	which uses exactly this technique (which is suited for many high-level
3508	languages).	3750	languages).
…		…
3534	// now associate this with the loop	3776	// now associate this with the loop
3535	ev_set_userdata (EV_A_ u);	3777	ev_set_userdata (EV_A_ u);
3536	ev_set_invoke_pending_cb (EV_A_ l_invoke);	3778	ev_set_invoke_pending_cb (EV_A_ l_invoke);
3537	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);	3779	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3538		3780
3539	// then create the thread running ev_loop	3781	// then create the thread running ev_run
3540	pthread_create (&u->tid, 0, l_run, EV_A);	3782	pthread_create (&u->tid, 0, l_run, EV_A);
3541	}	3783	}
3542		3784
3543	The callback for the C<ev_async> watcher does nothing: the watcher is used	3785	The callback for the C<ev_async> watcher does nothing: the watcher is used
3544	solely to wake up the event loop so it takes notice of any new watchers	3786	solely to wake up the event loop so it takes notice of any new watchers
…		…
3633	Note that sending the C<ev_async> watcher is required because otherwise	3875	Note that sending the C<ev_async> watcher is required because otherwise
3634	an event loop currently blocking in the kernel will have no knowledge	3876	an event loop currently blocking in the kernel will have no knowledge
3635	about the newly added timer. By waking up the loop it will pick up any new	3877	about the newly added timer. By waking up the loop it will pick up any new
3636	watchers in the next event loop iteration.	3878	watchers in the next event loop iteration.
3637		3879
		3880	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3881
		3882	While the overhead of a callback that e.g. schedules a thread is small, it
		3883	is still an overhead. If you embed libev, and your main usage is with some
		3884	kind of threads or coroutines, you might want to customise libev so that
		3885	doesn't need callbacks anymore.
		3886
		3887	Imagine you have coroutines that you can switch to using a function
		3888	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3889	and that due to some magic, the currently active coroutine is stored in a
		3890	global called C<current_coro>. Then you can build your own "wait for libev
		3891	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3892	the differing C<;> conventions):
		3893
		3894	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3895	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3896
		3897	That means instead of having a C callback function, you store the
		3898	coroutine to switch to in each watcher, and instead of having libev call
		3899	your callback, you instead have it switch to that coroutine.
		3900
		3901	A coroutine might now wait for an event with a function called
		3902	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3903	matter when, or whether the watcher is active or not when this function is
		3904	called):
		3905
		3906	void
		3907	wait_for_event (ev_watcher *w)
		3908	{
		3909	ev_set_cb (w, current_coro);
		3910	switch_to (libev_coro);
		3911	}
		3912
		3913	That basically suspends the coroutine inside C<wait_for_event> and
		3914	continues the libev coroutine, which, when appropriate, switches back to
		3915	this or any other coroutine.
		3916
		3917	You can do similar tricks if you have, say, threads with an event queue -
		3918	instead of storing a coroutine, you store the queue object and instead of
		3919	switching to a coroutine, you push the watcher onto the queue and notify
		3920	any waiters.
		3921
		3922	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3923	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3924
		3925	// my_ev.h
		3926	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3927	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3928	#include "../libev/ev.h"
		3929
		3930	// my_ev.c
		3931	#define EV_H "my_ev.h"
		3932	#include "../libev/ev.c"
		3933
		3934	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3935	F<my_ev.c> into your project. When properly specifying include paths, you
		3936	can even use F<ev.h> as header file name directly.
		3937
3638		3938
3639	=head1 LIBEVENT EMULATION	3939	=head1 LIBEVENT EMULATION
3640		3940
3641	Libev offers a compatibility emulation layer for libevent. It cannot	3941	Libev offers a compatibility emulation layer for libevent. It cannot
3642	emulate the internals of libevent, so here are some usage hints:	3942	emulate the internals of libevent, so here are some usage hints:
…		…
3671		3971
3672	=back	3972	=back
3673		3973
3674	=head1 C++ SUPPORT	3974	=head1 C++ SUPPORT
3675		3975
		3976	=head2 C API
		3977
		3978	The normal C API should work fine when used from C++: both ev.h and the
		3979	libev sources can be compiled as C++. Therefore, code that uses the C API
		3980	will work fine.
		3981
		3982	Proper exception specifications might have to be added to callbacks passed
		3983	to libev: exceptions may be thrown only from watcher callbacks, all
		3984	other callbacks (allocator, syserr, loop acquire/release and periodic
		3985	reschedule callbacks) must not throw exceptions, and might need a C<throw
		3986	()> specification. If you have code that needs to be compiled as both C
		3987	and C++ you can use the C<EV_THROW> macro for this:
		3988
		3989	static void
		3990	fatal_error (const char *msg) EV_THROW
		3991	{
		3992	perror (msg);
		3993	abort ();
		3994	}
		3995
		3996	...
		3997	ev_set_syserr_cb (fatal_error);
		3998
		3999	The only API functions that can currently throw exceptions are C<ev_run>,
		4000	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		4001	because it runs cleanup watchers).
		4002
		4003	Throwing exceptions in watcher callbacks is only supported if libev itself
		4004	is compiled with a C++ compiler or your C and C++ environments allow
		4005	throwing exceptions through C libraries (most do).
		4006
		4007	=head2 C++ API
		4008
3676	Libev comes with some simplistic wrapper classes for C++ that mainly allow	4009	Libev comes with some simplistic wrapper classes for C++ that mainly allow
3677	you to use some convenience methods to start/stop watchers and also change	4010	you to use some convenience methods to start/stop watchers and also change
3678	the callback model to a model using method callbacks on objects.	4011	the callback model to a model using method callbacks on objects.
3679		4012
3680	To use it,	4013	To use it,
3681		4014
3682	#include <ev++.h>	4015	#include <ev++.h>
3683		4016
3684	This automatically includes F<ev.h> and puts all of its definitions (many	4017	This automatically includes F<ev.h> and puts all of its definitions (many
3685	of them macros) into the global namespace. All C++ specific things are	4018	of them macros) into the global namespace. All C++ specific things are
3686	put into the C<ev> namespace. It should support all the same embedding	4019	put into the C<ev> namespace. It should support all the same embedding
…		…
3695	with C<operator ()> can be used as callbacks. Other types should be easy	4028	with C<operator ()> can be used as callbacks. Other types should be easy
3696	to add as long as they only need one additional pointer for context. If	4029	to add as long as they only need one additional pointer for context. If
3697	you need support for other types of functors please contact the author	4030	you need support for other types of functors please contact the author
3698	(preferably after implementing it).	4031	(preferably after implementing it).
3699		4032
		4033	For all this to work, your C++ compiler either has to use the same calling
		4034	conventions as your C compiler (for static member functions), or you have
		4035	to embed libev and compile libev itself as C++.
		4036
3700	Here is a list of things available in the C<ev> namespace:	4037	Here is a list of things available in the C<ev> namespace:
3701		4038
3702	=over 4	4039	=over 4
3703		4040
3704	=item C<ev::READ>, C<ev::WRITE> etc.	4041	=item C<ev::READ>, C<ev::WRITE> etc.
…		…
3713	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.	4050	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3714		4051
3715	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4052	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3716	the same name in the C<ev> namespace, with the exception of C<ev_signal>	4053	the same name in the C<ev> namespace, with the exception of C<ev_signal>
3717	which is called C<ev::sig> to avoid clashes with the C<signal> macro	4054	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3718	defines by many implementations.	4055	defined by many implementations.
3719		4056
3720	All of those classes have these methods:	4057	All of those classes have these methods:
3721		4058
3722	=over 4	4059	=over 4
3723		4060
…		…
3785	void operator() (ev::io &w, int revents)	4122	void operator() (ev::io &w, int revents)
3786	{	4123	{
3787	...	4124	...
3788	}	4125	}
3789	}	4126	}
3790		4127
3791	myfunctor f;	4128	myfunctor f;
3792		4129
3793	ev::io w;	4130	ev::io w;
3794	w.set (&f);	4131	w.set (&f);
3795		4132
…		…
3813	Associates a different C<struct ev_loop> with this watcher. You can only	4150	Associates a different C<struct ev_loop> with this watcher. You can only
3814	do this when the watcher is inactive (and not pending either).	4151	do this when the watcher is inactive (and not pending either).
3815		4152
3816	=item w->set ([arguments])	4153	=item w->set ([arguments])
3817		4154
3818	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this	4155	Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
3819	method or a suitable start method must be called at least once. Unlike the	4156	with the same arguments. Either this method or a suitable start method
3820	C counterpart, an active watcher gets automatically stopped and restarted	4157	must be called at least once. Unlike the C counterpart, an active watcher
3821	when reconfiguring it with this method.	4158	gets automatically stopped and restarted when reconfiguring it with this
		4159	method.
		4160
		4161	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4162	clashing with the C<set (loop)> method.
3822		4163
3823	=item w->start ()	4164	=item w->start ()
3824		4165
3825	Starts the watcher. Note that there is no C<loop> argument, as the	4166	Starts the watcher. Note that there is no C<loop> argument, as the
3826	constructor already stores the event loop.	4167	constructor already stores the event loop.
…		…
3856	watchers in the constructor.	4197	watchers in the constructor.
3857		4198
3858	class myclass	4199	class myclass
3859	{	4200	{
3860	ev::io io ; void io_cb (ev::io &w, int revents);	4201	ev::io io ; void io_cb (ev::io &w, int revents);
3861	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	4202	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3862	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4203	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3863		4204
3864	myclass (int fd)	4205	myclass (int fd)
3865	{	4206	{
3866	io .set <myclass, &myclass::io_cb > (this);	4207	io .set <myclass, &myclass::io_cb > (this);
…		…
3917	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4258	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3918		4259
3919	=item D	4260	=item D
3920		4261
3921	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4262	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3922	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4263	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3923		4264
3924	=item Ocaml	4265	=item Ocaml
3925		4266
3926	Erkki Seppala has written Ocaml bindings for libev, to be found at	4267	Erkki Seppala has written Ocaml bindings for libev, to be found at
3927	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4268	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3930		4271
3931	Brian Maher has written a partial interface to libev for lua (at the	4272	Brian Maher has written a partial interface to libev for lua (at the
3932	time of this writing, only C<ev_io> and C<ev_timer>), to be found at	4273	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3933	L<http://github.com/brimworks/lua-ev>.	4274	L<http://github.com/brimworks/lua-ev>.
3934		4275
		4276	=item Javascript
		4277
		4278	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4279
		4280	=item Others
		4281
		4282	There are others, and I stopped counting.
		4283
3935	=back	4284	=back
3936		4285
3937		4286
3938	=head1 MACRO MAGIC	4287	=head1 MACRO MAGIC
3939		4288
…		…
3975	suitable for use with C<EV_A>.	4324	suitable for use with C<EV_A>.
3976		4325
3977	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4326	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3978		4327
3979	Similar to the other two macros, this gives you the value of the default	4328	Similar to the other two macros, this gives you the value of the default
3980	loop, if multiple loops are supported ("ev loop default").	4329	loop, if multiple loops are supported ("ev loop default"). The default loop
		4330	will be initialised if it isn't already initialised.
		4331
		4332	For non-multiplicity builds, these macros do nothing, so you always have
		4333	to initialise the loop somewhere.
3981		4334
3982	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4335	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3983		4336
3984	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4337	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3985	default loop has been initialised (C<UC> == unchecked). Their behaviour	4338	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
4052	ev_vars.h	4405	ev_vars.h
4053	ev_wrap.h	4406	ev_wrap.h
4054		4407
4055	ev_win32.c required on win32 platforms only	4408	ev_win32.c required on win32 platforms only
4056		4409
4057	ev_select.c only when select backend is enabled (which is enabled by default)	4410	ev_select.c only when select backend is enabled
4058	ev_poll.c only when poll backend is enabled (disabled by default)	4411	ev_poll.c only when poll backend is enabled
4059	ev_epoll.c only when the epoll backend is enabled (disabled by default)	4412	ev_epoll.c only when the epoll backend is enabled
4060	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	4413	ev_kqueue.c only when the kqueue backend is enabled
4061	ev_port.c only when the solaris port backend is enabled (disabled by default)	4414	ev_port.c only when the solaris port backend is enabled
4062		4415
4063	F<ev.c> includes the backend files directly when enabled, so you only need	4416	F<ev.c> includes the backend files directly when enabled, so you only need
4064	to compile this single file.	4417	to compile this single file.
4065		4418
4066	=head3 LIBEVENT COMPATIBILITY API	4419	=head3 LIBEVENT COMPATIBILITY API
…		…
4130	supported). It will also not define any of the structs usually found in	4483	supported). It will also not define any of the structs usually found in
4131	F<event.h> that are not directly supported by the libev core alone.	4484	F<event.h> that are not directly supported by the libev core alone.
4132		4485
4133	In standalone mode, libev will still try to automatically deduce the	4486	In standalone mode, libev will still try to automatically deduce the
4134	configuration, but has to be more conservative.	4487	configuration, but has to be more conservative.
		4488
		4489	=item EV_USE_FLOOR
		4490
		4491	If defined to be C<1>, libev will use the C<floor ()> function for its
		4492	periodic reschedule calculations, otherwise libev will fall back on a
		4493	portable (slower) implementation. If you enable this, you usually have to
		4494	link against libm or something equivalent. Enabling this when the C<floor>
		4495	function is not available will fail, so the safe default is to not enable
		4496	this.
4135		4497
4136	=item EV_USE_MONOTONIC	4498	=item EV_USE_MONOTONIC
4137		4499
4138	If defined to be C<1>, libev will try to detect the availability of the	4500	If defined to be C<1>, libev will try to detect the availability of the
4139	monotonic clock option at both compile time and runtime. Otherwise no	4501	monotonic clock option at both compile time and runtime. Otherwise no
…		…
4224		4586
4225	If programs implement their own fd to handle mapping on win32, then this	4587	If programs implement their own fd to handle mapping on win32, then this
4226	macro can be used to override the C<close> function, useful to unregister	4588	macro can be used to override the C<close> function, useful to unregister
4227	file descriptors again. Note that the replacement function has to close	4589	file descriptors again. Note that the replacement function has to close
4228	the underlying OS handle.	4590	the underlying OS handle.
		4591
		4592	=item EV_USE_WSASOCKET
		4593
		4594	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4595	communication socket, which works better in some environments. Otherwise,
		4596	the normal C<socket> function will be used, which works better in other
		4597	environments.
4229		4598
4230	=item EV_USE_POLL	4599	=item EV_USE_POLL
4231		4600
4232	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4601	If defined to be C<1>, libev will compile in support for the C<poll>(2)
4233	backend. Otherwise it will be enabled on non-win32 platforms. It	4602	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
4269	If defined to be C<1>, libev will compile in support for the Linux inotify	4638	If defined to be C<1>, libev will compile in support for the Linux inotify
4270	interface to speed up C<ev_stat> watchers. Its actual availability will	4639	interface to speed up C<ev_stat> watchers. Its actual availability will
4271	be detected at runtime. If undefined, it will be enabled if the headers	4640	be detected at runtime. If undefined, it will be enabled if the headers
4272	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4641	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4273		4642
		4643	=item EV_NO_SMP
		4644
		4645	If defined to be C<1>, libev will assume that memory is always coherent
		4646	between threads, that is, threads can be used, but threads never run on
		4647	different cpus (or different cpu cores). This reduces dependencies
		4648	and makes libev faster.
		4649
		4650	=item EV_NO_THREADS
		4651
		4652	If defined to be C<1>, libev will assume that it will never be called from
		4653	different threads (that includes signal handlers), which is a stronger
		4654	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4655	libev faster.
		4656
4274	=item EV_ATOMIC_T	4657	=item EV_ATOMIC_T
4275		4658
4276	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4659	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4277	access is atomic with respect to other threads or signal contexts. No such	4660	access is atomic with respect to other threads or signal contexts. No
4278	type is easily found in the C language, so you can provide your own type	4661	such type is easily found in the C language, so you can provide your own
4279	that you know is safe for your purposes. It is used both for signal handler "locking"	4662	type that you know is safe for your purposes. It is used both for signal
4280	as well as for signal and thread safety in C<ev_async> watchers.	4663	handler "locking" as well as for signal and thread safety in C<ev_async>
		4664	watchers.
4281		4665
4282	In the absence of this define, libev will use C<sig_atomic_t volatile>	4666	In the absence of this define, libev will use C<sig_atomic_t volatile>
4283	(from F<signal.h>), which is usually good enough on most platforms.	4667	(from F<signal.h>), which is usually good enough on most platforms.
4284		4668
4285	=item EV_H (h)	4669	=item EV_H (h)
…		…
4312	will have the C<struct ev_loop *> as first argument, and you can create	4696	will have the C<struct ev_loop *> as first argument, and you can create
4313	additional independent event loops. Otherwise there will be no support	4697	additional independent event loops. Otherwise there will be no support
4314	for multiple event loops and there is no first event loop pointer	4698	for multiple event loops and there is no first event loop pointer
4315	argument. Instead, all functions act on the single default loop.	4699	argument. Instead, all functions act on the single default loop.
4316		4700
		4701	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4702	default loop when multiplicity is switched off - you always have to
		4703	initialise the loop manually in this case.
		4704
4317	=item EV_MINPRI	4705	=item EV_MINPRI
4318		4706
4319	=item EV_MAXPRI	4707	=item EV_MAXPRI
4320		4708
4321	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4709	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
4357	#define EV_USE_POLL 1	4745	#define EV_USE_POLL 1
4358	#define EV_CHILD_ENABLE 1	4746	#define EV_CHILD_ENABLE 1
4359	#define EV_ASYNC_ENABLE 1	4747	#define EV_ASYNC_ENABLE 1
4360		4748
4361	The actual value is a bitset, it can be a combination of the following	4749	The actual value is a bitset, it can be a combination of the following
4362	values:	4750	values (by default, all of these are enabled):
4363		4751
4364	=over 4	4752	=over 4
4365		4753
4366	=item C<1> - faster/larger code	4754	=item C<1> - faster/larger code
4367		4755
…		…
4371	code size by roughly 30% on amd64).	4759	code size by roughly 30% on amd64).
4372		4760
4373	When optimising for size, use of compiler flags such as C<-Os> with	4761	When optimising for size, use of compiler flags such as C<-Os> with
4374	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of	4762	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4375	assertions.	4763	assertions.
		4764
		4765	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4766	(e.g. gcc with C<-Os>).
4376		4767
4377	=item C<2> - faster/larger data structures	4768	=item C<2> - faster/larger data structures
4378		4769
4379	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4770	Replaces the small 2-heap for timer management by a faster 4-heap, larger
4380	hash table sizes and so on. This will usually further increase code size	4771	hash table sizes and so on. This will usually further increase code size
4381	and can additionally have an effect on the size of data structures at	4772	and can additionally have an effect on the size of data structures at
4382	runtime.	4773	runtime.
4383		4774
		4775	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4776	(e.g. gcc with C<-Os>).
		4777
4384	=item C<4> - full API configuration	4778	=item C<4> - full API configuration
4385		4779
4386	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4780	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4387	enables multiplicity (C<EV_MULTIPLICITY>=1).	4781	enables multiplicity (C<EV_MULTIPLICITY>=1).
4388		4782
…		…
4418		4812
4419	With an intelligent-enough linker (gcc+binutils are intelligent enough	4813	With an intelligent-enough linker (gcc+binutils are intelligent enough
4420	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4814	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4421	your program might be left out as well - a binary starting a timer and an	4815	your program might be left out as well - a binary starting a timer and an
4422	I/O watcher then might come out at only 5Kb.	4816	I/O watcher then might come out at only 5Kb.
		4817
		4818	=item EV_API_STATIC
		4819
		4820	If this symbol is defined (by default it is not), then all identifiers
		4821	will have static linkage. This means that libev will not export any
		4822	identifiers, and you cannot link against libev anymore. This can be useful
		4823	when you embed libev, only want to use libev functions in a single file,
		4824	and do not want its identifiers to be visible.
		4825
		4826	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4827	wants to use libev.
		4828
		4829	This option only works when libev is compiled with a C compiler, as C++
		4830	doesn't support the required declaration syntax.
4423		4831
4424	=item EV_AVOID_STDIO	4832	=item EV_AVOID_STDIO
4425		4833
4426	If this is set to C<1> at compiletime, then libev will avoid using stdio	4834	If this is set to C<1> at compiletime, then libev will avoid using stdio
4427	functions (printf, scanf, perror etc.). This will increase the code size	4835	functions (printf, scanf, perror etc.). This will increase the code size
…		…
4632	default loop and triggering an C<ev_async> watcher from the default loop	5040	default loop and triggering an C<ev_async> watcher from the default loop
4633	watcher callback into the event loop interested in the signal.	5041	watcher callback into the event loop interested in the signal.
4634		5042
4635	=back	5043	=back
4636		5044
4637	See also L<THREAD LOCKING EXAMPLE>.	5045	See also L</THREAD LOCKING EXAMPLE>.
4638		5046
4639	=head3 COROUTINES	5047	=head3 COROUTINES
4640		5048
4641	Libev is very accommodating to coroutines ("cooperative threads"):	5049	Libev is very accommodating to coroutines ("cooperative threads"):
4642	libev fully supports nesting calls to its functions from different	5050	libev fully supports nesting calls to its functions from different
…		…
4807	requires, and its I/O model is fundamentally incompatible with the POSIX	5215	requires, and its I/O model is fundamentally incompatible with the POSIX
4808	model. Libev still offers limited functionality on this platform in	5216	model. Libev still offers limited functionality on this platform in
4809	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5217	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4810	descriptors. This only applies when using Win32 natively, not when using	5218	descriptors. This only applies when using Win32 natively, not when using
4811	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	5219	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4812	as every compielr comes with a slightly differently broken/incompatible	5220	as every compiler comes with a slightly differently broken/incompatible
4813	environment.	5221	environment.
4814		5222
4815	Lifting these limitations would basically require the full	5223	Lifting these limitations would basically require the full
4816	re-implementation of the I/O system. If you are into this kind of thing,	5224	re-implementation of the I/O system. If you are into this kind of thing,
4817	then note that glib does exactly that for you in a very portable way (note	5225	then note that glib does exactly that for you in a very portable way (note
…		…
4911	structure (guaranteed by POSIX but not by ISO C for example), but it also	5319	structure (guaranteed by POSIX but not by ISO C for example), but it also
4912	assumes that the same (machine) code can be used to call any watcher	5320	assumes that the same (machine) code can be used to call any watcher
4913	callback: The watcher callbacks have different type signatures, but libev	5321	callback: The watcher callbacks have different type signatures, but libev
4914	calls them using an C<ev_watcher *> internally.	5322	calls them using an C<ev_watcher *> internally.
4915		5323
		5324	=item null pointers and integer zero are represented by 0 bytes
		5325
		5326	Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
		5327	relies on this setting pointers and integers to null.
		5328
4916	=item pointer accesses must be thread-atomic	5329	=item pointer accesses must be thread-atomic
4917		5330
4918	Accessing a pointer value must be atomic, it must both be readable and	5331	Accessing a pointer value must be atomic, it must both be readable and
4919	writable in one piece - this is the case on all current architectures.	5332	writable in one piece - this is the case on all current architectures.
4920		5333
…		…
4933	thread" or will block signals process-wide, both behaviours would	5346	thread" or will block signals process-wide, both behaviours would
4934	be compatible with libev. Interaction between C<sigprocmask> and	5347	be compatible with libev. Interaction between C<sigprocmask> and
4935	C<pthread_sigmask> could complicate things, however.	5348	C<pthread_sigmask> could complicate things, however.
4936		5349
4937	The most portable way to handle signals is to block signals in all threads	5350	The most portable way to handle signals is to block signals in all threads
4938	except the initial one, and run the default loop in the initial thread as	5351	except the initial one, and run the signal handling loop in the initial
4939	well.	5352	thread as well.
4940		5353
4941	=item C<long> must be large enough for common memory allocation sizes	5354	=item C<long> must be large enough for common memory allocation sizes
4942		5355
4943	To improve portability and simplify its API, libev uses C<long> internally	5356	To improve portability and simplify its API, libev uses C<long> internally
4944	instead of C<size_t> when allocating its data structures. On non-POSIX	5357	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4950		5363
4951	The type C<double> is used to represent timestamps. It is required to	5364	The type C<double> is used to represent timestamps. It is required to
4952	have at least 51 bits of mantissa (and 9 bits of exponent), which is	5365	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4953	good enough for at least into the year 4000 with millisecond accuracy	5366	good enough for at least into the year 4000 with millisecond accuracy
4954	(the design goal for libev). This requirement is overfulfilled by	5367	(the design goal for libev). This requirement is overfulfilled by
4955	implementations using IEEE 754, which is basically all existing ones. With	5368	implementations using IEEE 754, which is basically all existing ones.
		5369
4956	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5370	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5371	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5372	is either obsolete or somebody patched it to use C<long double> or
		5373	something like that, just kidding).
4957		5374
4958	=back	5375	=back
4959		5376
4960	If you know of other additional requirements drop me a note.	5377	If you know of other additional requirements drop me a note.
4961		5378
…		…
5023	=item Processing ev_async_send: O(number_of_async_watchers)	5440	=item Processing ev_async_send: O(number_of_async_watchers)
5024		5441
5025	=item Processing signals: O(max_signal_number)	5442	=item Processing signals: O(max_signal_number)
5026		5443
5027	Sending involves a system call I<iff> there were no other C<ev_async_send>	5444	Sending involves a system call I<iff> there were no other C<ev_async_send>
5028	calls in the current loop iteration. Checking for async and signal events	5445	calls in the current loop iteration and the loop is currently
		5446	blocked. Checking for async and signal events involves iterating over all
5029	involves iterating over all running async watchers or all signal numbers.	5447	running async watchers or all signal numbers.
5030		5448
5031	=back	5449	=back
5032		5450
5033		5451
5034	=head1 PORTING FROM LIBEV 3.X TO 4.X	5452	=head1 PORTING FROM LIBEV 3.X TO 4.X
…		…
5043	=over 4	5461	=over 4
5044		5462
5045	=item C<EV_COMPAT3> backwards compatibility mechanism	5463	=item C<EV_COMPAT3> backwards compatibility mechanism
5046		5464
5047	The backward compatibility mechanism can be controlled by	5465	The backward compatibility mechanism can be controlled by
5048	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>	5466	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5049	section.	5467	section.
5050		5468
5051	=item C<ev_default_destroy> and C<ev_default_fork> have been removed	5469	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5052		5470
5053	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:	5471	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
…		…
5096	=over 4	5514	=over 4
5097		5515
5098	=item active	5516	=item active
5099		5517
5100	A watcher is active as long as it has been started and not yet stopped.	5518	A watcher is active as long as it has been started and not yet stopped.
5101	See L<WATCHER STATES> for details.	5519	See L</WATCHER STATES> for details.
5102		5520
5103	=item application	5521	=item application
5104		5522
5105	In this document, an application is whatever is using libev.	5523	In this document, an application is whatever is using libev.
5106		5524
…		…
5142	watchers and events.	5560	watchers and events.
5143		5561
5144	=item pending	5562	=item pending
5145		5563
5146	A watcher is pending as soon as the corresponding event has been	5564	A watcher is pending as soon as the corresponding event has been
5147	detected. See L<WATCHER STATES> for details.	5565	detected. See L</WATCHER STATES> for details.
5148		5566
5149	=item real time	5567	=item real time
5150		5568
5151	The physical time that is observed. It is apparently strictly monotonic :)	5569	The physical time that is observed. It is apparently strictly monotonic :)
5152		5570
5153	=item wall-clock time	5571	=item wall-clock time
5154		5572
5155	The time and date as shown on clocks. Unlike real time, it can actually	5573	The time and date as shown on clocks. Unlike real time, it can actually
5156	be wrong and jump forwards and backwards, e.g. when the you adjust your	5574	be wrong and jump forwards and backwards, e.g. when you adjust your
5157	clock.	5575	clock.
5158		5576
5159	=item watcher	5577	=item watcher
5160		5578
5161	A data structure that describes interest in certain events. Watchers need	5579	A data structure that describes interest in certain events. Watchers need
…		…
5164	=back	5582	=back
5165		5583
5166	=head1 AUTHOR	5584	=head1 AUTHOR
5167		5585
5168	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5586	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5169	Magnusson and Emanuele Giaquinta.	5587	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5170		5588

Diff Legend

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