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

Comparing libev/ev.pod (file contents):
Revision 1.336 by root, Mon Oct 25 11:10:10 2010 UTC vs.
Revision 1.379 by root, Tue Jul 12 23:32:10 2011 UTC

…		…
58	ev_timer_start (loop, &timeout_watcher);	58	ev_timer_start (loop, &timeout_watcher);
59		59
60	// now wait for events to arrive	60	// now wait for events to arrive
61	ev_run (loop, 0);	61	ev_run (loop, 0);
62		62
63	// unloop was called, so exit	63	// break was called, so exit
64	return 0;	64	return 0;
65	}	65	}
66		66
67	=head1 ABOUT THIS DOCUMENT	67	=head1 ABOUT THIS DOCUMENT
68		68
…		…
178	you actually want to know. Also interesting is the combination of	178	you actually want to know. Also interesting is the combination of
179	C<ev_update_now> and C<ev_now>.	179	C<ev_update_now> and C<ev_now>.
180		180
181	=item ev_sleep (ev_tstamp interval)	181	=item ev_sleep (ev_tstamp interval)
182		182
183	Sleep for the given interval: The current thread will be blocked until	183	Sleep for the given interval: The current thread will be blocked
184	either it is interrupted or the given time interval has passed. Basically	184	until either it is interrupted or the given time interval has
		185	passed (approximately - it might return a bit earlier even if not
		186	interrupted). Returns immediately if C<< interval <= 0 >>.
		187
185	this is a sub-second-resolution C<sleep ()>.	188	Basically this is a sub-second-resolution C<sleep ()>.
		189
		190	The range of the C<interval> is limited - libev only guarantees to work
		191	with sleep times of up to one day (C<< interval <= 86400 >>).
186		192
187	=item int ev_version_major ()	193	=item int ev_version_major ()
188		194
189	=item int ev_version_minor ()	195	=item int ev_version_minor ()
190		196
…		…
241	the current system, you would need to look at C<ev_embeddable_backends ()	247	the current system, you would need to look at C<ev_embeddable_backends ()
242	& ev_supported_backends ()>, likewise for recommended ones.	248	& ev_supported_backends ()>, likewise for recommended ones.
243		249
244	See the description of C<ev_embed> watchers for more info.	250	See the description of C<ev_embed> watchers for more info.
245		251
246	=item ev_set_allocator (void (cb)(void *ptr, long size)) [NOT REENTRANT]	252	=item ev_set_allocator (void (cb)(void *ptr, long size))
247		253
248	Sets the allocation function to use (the prototype is similar - the	254	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	255	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	256	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	257	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
277	}	283	}
278		284
279	...	285	...
280	ev_set_allocator (persistent_realloc);	286	ev_set_allocator (persistent_realloc);
281		287
282	=item ev_set_syserr_cb (void (cb)(const char msg)); [NOT REENTRANT]	288	=item ev_set_syserr_cb (void (cb)(const char msg))
283		289
284	Set the callback function to call on a retryable system call error (such	290	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	291	as failed select, poll, epoll_wait). The message is a printable string
286	indicating the system call or subsystem causing the problem. If this	292	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	293	callback is set, then libev will expect it to remedy the situation, no
…		…
299	}	305	}
300		306
301	...	307	...
302	ev_set_syserr_cb (fatal_error);	308	ev_set_syserr_cb (fatal_error);
303		309
		310	=item ev_feed_signal (int signum)
		311
		312	This function can be used to "simulate" a signal receive. It is completely
		313	safe to call this function at any time, from any context, including signal
		314	handlers or random threads.
		315
		316	Its main use is to customise signal handling in your process, especially
		317	in the presence of threads. For example, you could block signals
		318	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		319	creating any loops), and in one thread, use C<sigwait> or any other
		320	mechanism to wait for signals, then "deliver" them to libev by calling
		321	C<ev_feed_signal>.
		322
304	=back	323	=back
305		324
306	=head1 FUNCTIONS CONTROLLING EVENT LOOPS	325	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
307		326
308	An event loop is described by a C<struct ev_loop *> (the C<struct> is	327	An event loop is described by a C<struct ev_loop *> (the C<struct> is
…		…
355	=item struct ev_loop *ev_loop_new (unsigned int flags)	374	=item struct ev_loop *ev_loop_new (unsigned int flags)
356		375
357	This will create and initialise a new event loop object. If the loop	376	This will create and initialise a new event loop object. If the loop
358	could not be initialised, returns false.	377	could not be initialised, returns false.
359		378
360	Note that this function I<is> thread-safe, and one common way to use	379	This function is thread-safe, and one common way to use libev with
361	libev with threads is indeed to create one loop per thread, and using the	380	threads is indeed to create one loop per thread, and using the default
362	default loop in the "main" or "initial" thread.	381	loop in the "main" or "initial" thread.
363		382
364	The flags argument can be used to specify special behaviour or specific	383	The flags argument can be used to specify special behaviour or specific
365	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	384	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
366		385
367	The following flags are supported:	386	The following flags are supported:
…		…
402	environment variable.	421	environment variable.
403		422
404	=item C<EVFLAG_NOINOTIFY>	423	=item C<EVFLAG_NOINOTIFY>
405		424
406	When this flag is specified, then libev will not attempt to use the	425	When this flag is specified, then libev will not attempt to use the
407	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and	426	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
408	testing, this flag can be useful to conserve inotify file descriptors, as	427	testing, this flag can be useful to conserve inotify file descriptors, as
409	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.	428	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
410		429
411	=item C<EVFLAG_SIGNALFD>	430	=item C<EVFLAG_SIGNALFD>
412		431
413	When this flag is specified, then libev will attempt to use the	432	When this flag is specified, then libev will attempt to use the
414	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API	433	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
415	delivers signals synchronously, which makes it both faster and might make	434	delivers signals synchronously, which makes it both faster and might make
416	it possible to get the queued signal data. It can also simplify signal	435	it possible to get the queued signal data. It can also simplify signal
417	handling with threads, as long as you properly block signals in your	436	handling with threads, as long as you properly block signals in your
418	threads that are not interested in handling them.	437	threads that are not interested in handling them.
419		438
420	Signalfd will not be used by default as this changes your signal mask, and	439	Signalfd will not be used by default as this changes your signal mask, and
421	there are a lot of shoddy libraries and programs (glib's threadpool for	440	there are a lot of shoddy libraries and programs (glib's threadpool for
422	example) that can't properly initialise their signal masks.	441	example) that can't properly initialise their signal masks.
		442
		443	=item C<EVFLAG_NOSIGMASK>
		444
		445	When this flag is specified, then libev will avoid to modify the signal
		446	mask. Specifically, this means you have to make sure signals are unblocked
		447	when you want to receive them.
		448
		449	This behaviour is useful when you want to do your own signal handling, or
		450	want to handle signals only in specific threads and want to avoid libev
		451	unblocking the signals.
		452
		453	It's also required by POSIX in a threaded program, as libev calls
		454	C<sigprocmask>, whose behaviour is officially unspecified.
		455
		456	This flag's behaviour will become the default in future versions of libev.
423		457
424	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	458	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
425		459
426	This is your standard select(2) backend. Not I<completely> standard, as	460	This is your standard select(2) backend. Not I<completely> standard, as
427	libev tries to roll its own fd_set with no limits on the number of fds,	461	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
455	=item C<EVBACKEND_EPOLL> (value 4, Linux)	489	=item C<EVBACKEND_EPOLL> (value 4, Linux)
456		490
457	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	491	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
458	kernels).	492	kernels).
459		493
460	For few fds, this backend is a bit little slower than poll and select,	494	For few fds, this backend is a bit little slower than poll and select, but
461	but it scales phenomenally better. While poll and select usually scale	495	it scales phenomenally better. While poll and select usually scale like
462	like O(total_fds) where n is the total number of fds (or the highest fd),	496	O(total_fds) where total_fds is the total number of fds (or the highest
463	epoll scales either O(1) or O(active_fds).	497	fd), epoll scales either O(1) or O(active_fds).
464		498
465	The epoll mechanism deserves honorable mention as the most misdesigned	499	The epoll mechanism deserves honorable mention as the most misdesigned
466	of the more advanced event mechanisms: mere annoyances include silently	500	of the more advanced event mechanisms: mere annoyances include silently
467	dropping file descriptors, requiring a system call per change per file	501	dropping file descriptors, requiring a system call per change per file
468	descriptor (and unnecessary guessing of parameters), problems with dup and	502	descriptor (and unnecessary guessing of parameters), problems with dup,
		503	returning before the timeout value, resulting in additional iterations
		504	(and only giving 5ms accuracy while select on the same platform gives
469	so on. The biggest issue is fork races, however - if a program forks then	505	0.1ms) and so on. The biggest issue is fork races, however - if a program
470	I<both> parent and child process have to recreate the epoll set, which can	506	forks then I<both> parent and child process have to recreate the epoll
471	take considerable time (one syscall per file descriptor) and is of course	507	set, which can take considerable time (one syscall per file descriptor)
472	hard to detect.	508	and is of course hard to detect.
473		509
474	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	510	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
475	of course I<doesn't>, and epoll just loves to report events for totally	511	but of course I<doesn't>, and epoll just loves to report events for
476	I<different> file descriptors (even already closed ones, so one cannot	512	totally I<different> file descriptors (even already closed ones, so
477	even remove them from the set) than registered in the set (especially	513	one cannot even remove them from the set) than registered in the set
478	on SMP systems). Libev tries to counter these spurious notifications by	514	(especially on SMP systems). Libev tries to counter these spurious
479	employing an additional generation counter and comparing that against the	515	notifications by employing an additional generation counter and comparing
480	events to filter out spurious ones, recreating the set when required. Last	516	that against the events to filter out spurious ones, recreating the set
		517	when required. Epoll also erroneously rounds down timeouts, but gives you
		518	no way to know when and by how much, so sometimes you have to busy-wait
		519	because epoll returns immediately despite a nonzero timeout. And last
481	not least, it also refuses to work with some file descriptors which work	520	not least, it also refuses to work with some file descriptors which work
482	perfectly fine with C<select> (files, many character devices...).	521	perfectly fine with C<select> (files, many character devices...).
		522
		523	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
		524	cobbled together in a hurry, no thought to design or interaction with
		525	others. Oh, the pain, will it ever stop...
483		526
484	While stopping, setting and starting an I/O watcher in the same iteration	527	While stopping, setting and starting an I/O watcher in the same iteration
485	will result in some caching, there is still a system call per such	528	will result in some caching, there is still a system call per such
486	incident (because the same I<file descriptor> could point to a different	529	incident (because the same I<file descriptor> could point to a different
487	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	530	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
553	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	596	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
554		597
555	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	598	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
556	it's really slow, but it still scales very well (O(active_fds)).	599	it's really slow, but it still scales very well (O(active_fds)).
557		600
558	Please note that Solaris event ports can deliver a lot of spurious
559	notifications, so you need to use non-blocking I/O or other means to avoid
560	blocking when no data (or space) is available.
561
562	While this backend scales well, it requires one system call per active	601	While this backend scales well, it requires one system call per active
563	file descriptor per loop iteration. For small and medium numbers of file	602	file descriptor per loop iteration. For small and medium numbers of file
564	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	603	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
565	might perform better.	604	might perform better.
566		605
567	On the positive side, with the exception of the spurious readiness	606	On the positive side, this backend actually performed fully to
568	notifications, this backend actually performed fully to specification
569	in all tests and is fully embeddable, which is a rare feat among the	607	specification in all tests and is fully embeddable, which is a rare feat
570	OS-specific backends (I vastly prefer correctness over speed hacks).	608	among the OS-specific backends (I vastly prefer correctness over speed
		609	hacks).
		610
		611	On the negative side, the interface is I<bizarre> - so bizarre that
		612	even sun itself gets it wrong in their code examples: The event polling
		613	function sometimes returns events to the caller even though an error
		614	occurred, but with no indication whether it has done so or not (yes, it's
		615	even documented that way) - deadly for edge-triggered interfaces where you
		616	absolutely have to know whether an event occurred or not because you have
		617	to re-arm the watcher.
		618
		619	Fortunately libev seems to be able to work around these idiocies.
571		620
572	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	621	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
573	C<EVBACKEND_POLL>.	622	C<EVBACKEND_POLL>.
574		623
575	=item C<EVBACKEND_ALL>	624	=item C<EVBACKEND_ALL>
576		625
577	Try all backends (even potentially broken ones that wouldn't be tried	626	Try all backends (even potentially broken ones that wouldn't be tried
578	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	627	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
579	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	628	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
580		629
581	It is definitely not recommended to use this flag.	630	It is definitely not recommended to use this flag, use whatever
		631	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		632	at all.
		633
		634	=item C<EVBACKEND_MASK>
		635
		636	Not a backend at all, but a mask to select all backend bits from a
		637	C<flags> value, in case you want to mask out any backends from a flags
		638	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
582		639
583	=back	640	=back
584		641
585	If one or more of the backend flags are or'ed into the flags value,	642	If one or more of the backend flags are or'ed into the flags value,
586	then only these backends will be tried (in the reverse order as listed	643	then only these backends will be tried (in the reverse order as listed
…		…
615	This function is normally used on loop objects allocated by	672	This function is normally used on loop objects allocated by
616	C<ev_loop_new>, but it can also be used on the default loop returned by	673	C<ev_loop_new>, but it can also be used on the default loop returned by
617	C<ev_default_loop>, in which case it is not thread-safe.	674	C<ev_default_loop>, in which case it is not thread-safe.
618		675
619	Note that it is not advisable to call this function on the default loop	676	Note that it is not advisable to call this function on the default loop
620	except in the rare occasion where you really need to free it's resources.	677	except in the rare occasion where you really need to free its resources.
621	If you need dynamically allocated loops it is better to use C<ev_loop_new>	678	If you need dynamically allocated loops it is better to use C<ev_loop_new>
622	and C<ev_loop_destroy>.	679	and C<ev_loop_destroy>.
623		680
624	=item ev_loop_fork (loop)	681	=item ev_loop_fork (loop)
625		682
…		…
673	prepare and check phases.	730	prepare and check phases.
674		731
675	=item unsigned int ev_depth (loop)	732	=item unsigned int ev_depth (loop)
676		733
677	Returns the number of times C<ev_run> was entered minus the number of	734	Returns the number of times C<ev_run> was entered minus the number of
678	times C<ev_run> was exited, in other words, the recursion depth.	735	times C<ev_run> was exited normally, in other words, the recursion depth.
679		736
680	Outside C<ev_run>, this number is zero. In a callback, this number is	737	Outside C<ev_run>, this number is zero. In a callback, this number is
681	C<1>, unless C<ev_run> was invoked recursively (or from another thread),	738	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
682	in which case it is higher.	739	in which case it is higher.
683		740
684	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread	741	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
685	etc.), doesn't count as "exit" - consider this as a hint to avoid such	742	throwing an exception etc.), doesn't count as "exit" - consider this
686	ungentleman-like behaviour unless it's really convenient.	743	as a hint to avoid such ungentleman-like behaviour unless it's really
		744	convenient, in which case it is fully supported.
687		745
688	=item unsigned int ev_backend (loop)	746	=item unsigned int ev_backend (loop)
689		747
690	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	748	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
691	use.	749	use.
…		…
753	finished (especially in interactive programs), but having a program	811	finished (especially in interactive programs), but having a program
754	that automatically loops as long as it has to and no longer by virtue	812	that automatically loops as long as it has to and no longer by virtue
755	of relying on its watchers stopping correctly, that is truly a thing of	813	of relying on its watchers stopping correctly, that is truly a thing of
756	beauty.	814	beauty.
757		815
		816	This function is also I<mostly> exception-safe - you can break out of
		817	a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		818	exception and so on. This does not decrement the C<ev_depth> value, nor
		819	will it clear any outstanding C<EVBREAK_ONE> breaks.
		820
758	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	821	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
759	those events and any already outstanding ones, but will not wait and	822	those events and any already outstanding ones, but will not wait and
760	block your process in case there are no events and will return after one	823	block your process in case there are no events and will return after one
761	iteration of the loop. This is sometimes useful to poll and handle new	824	iteration of the loop. This is sometimes useful to poll and handle new
762	events while doing lengthy calculations, to keep the program responsive.	825	events while doing lengthy calculations, to keep the program responsive.
…		…
771	This is useful if you are waiting for some external event in conjunction	834	This is useful if you are waiting for some external event in conjunction
772	with something not expressible using other libev watchers (i.e. "roll your	835	with something not expressible using other libev watchers (i.e. "roll your
773	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	836	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
774	usually a better approach for this kind of thing.	837	usually a better approach for this kind of thing.
775		838
776	Here are the gory details of what C<ev_run> does:	839	Here are the gory details of what C<ev_run> does (this is for your
		840	understanding, not a guarantee that things will work exactly like this in
		841	future versions):
777		842
778	- Increment loop depth.	843	- Increment loop depth.
779	- Reset the ev_break status.	844	- Reset the ev_break status.
780	- Before the first iteration, call any pending watchers.	845	- Before the first iteration, call any pending watchers.
781	LOOP:	846	LOOP:
…		…
814	anymore.	879	anymore.
815		880
816	... queue jobs here, make sure they register event watchers as long	881	... queue jobs here, make sure they register event watchers as long
817	... as they still have work to do (even an idle watcher will do..)	882	... as they still have work to do (even an idle watcher will do..)
818	ev_run (my_loop, 0);	883	ev_run (my_loop, 0);
819	... jobs done or somebody called unloop. yeah!	884	... jobs done or somebody called break. yeah!
820		885
821	=item ev_break (loop, how)	886	=item ev_break (loop, how)
822		887
823	Can be used to make a call to C<ev_run> return early (but only after it	888	Can be used to make a call to C<ev_run> return early (but only after it
824	has processed all outstanding events). The C<how> argument must be either	889	has processed all outstanding events). The C<how> argument must be either
825	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or	890	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
826	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.	891	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
827		892
828	This "break state" will be cleared when entering C<ev_run> again.	893	This "break state" will be cleared on the next call to C<ev_run>.
829		894
830	It is safe to call C<ev_break> from outside any C<ev_run> calls, too.	895	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		896	which case it will have no effect.
831		897
832	=item ev_ref (loop)	898	=item ev_ref (loop)
833		899
834	=item ev_unref (loop)	900	=item ev_unref (loop)
835		901
…		…
856	running when nothing else is active.	922	running when nothing else is active.
857		923
858	ev_signal exitsig;	924	ev_signal exitsig;
859	ev_signal_init (&exitsig, sig_cb, SIGINT);	925	ev_signal_init (&exitsig, sig_cb, SIGINT);
860	ev_signal_start (loop, &exitsig);	926	ev_signal_start (loop, &exitsig);
861	evf_unref (loop);	927	ev_unref (loop);
862		928
863	Example: For some weird reason, unregister the above signal handler again.	929	Example: For some weird reason, unregister the above signal handler again.
864		930
865	ev_ref (loop);	931	ev_ref (loop);
866	ev_signal_stop (loop, &exitsig);	932	ev_signal_stop (loop, &exitsig);
…		…
886	overhead for the actual polling but can deliver many events at once.	952	overhead for the actual polling but can deliver many events at once.
887		953
888	By setting a higher I<io collect interval> you allow libev to spend more	954	By setting a higher I<io collect interval> you allow libev to spend more
889	time collecting I/O events, so you can handle more events per iteration,	955	time collecting I/O events, so you can handle more events per iteration,
890	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	956	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
891	C<ev_timer>) will be not affected. Setting this to a non-null value will	957	C<ev_timer>) will not be affected. Setting this to a non-null value will
892	introduce an additional C<ev_sleep ()> call into most loop iterations. The	958	introduce an additional C<ev_sleep ()> call into most loop iterations. The
893	sleep time ensures that libev will not poll for I/O events more often then	959	sleep time ensures that libev will not poll for I/O events more often then
894	once per this interval, on average.	960	once per this interval, on average (as long as the host time resolution is
		961	good enough).
895		962
896	Likewise, by setting a higher I<timeout collect interval> you allow libev	963	Likewise, by setting a higher I<timeout collect interval> you allow libev
897	to spend more time collecting timeouts, at the expense of increased	964	to spend more time collecting timeouts, at the expense of increased
898	latency/jitter/inexactness (the watcher callback will be called	965	latency/jitter/inexactness (the watcher callback will be called
899	later). C<ev_io> watchers will not be affected. Setting this to a non-null	966	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
978	See also the locking example in the C<THREADS> section later in this	1045	See also the locking example in the C<THREADS> section later in this
979	document.	1046	document.
980		1047
981	=item ev_set_userdata (loop, void *data)	1048	=item ev_set_userdata (loop, void *data)
982		1049
983	=item ev_userdata (loop)	1050	=item void *ev_userdata (loop)
984		1051
985	Set and retrieve a single C<void *> associated with a loop. When	1052	Set and retrieve a single C<void *> associated with a loop. When
986	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1053	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
987	C<0.>	1054	C<0>.
988		1055
989	These two functions can be used to associate arbitrary data with a loop,	1056	These two functions can be used to associate arbitrary data with a loop,
990	and are intended solely for the C<invoke_pending_cb>, C<release> and	1057	and are intended solely for the C<invoke_pending_cb>, C<release> and
991	C<acquire> callbacks described above, but of course can be (ab-)used for	1058	C<acquire> callbacks described above, but of course can be (ab-)used for
992	any other purpose as well.	1059	any other purpose as well.
…		…
1305	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related	1372	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1306	functions that do not need a watcher.	1373	functions that do not need a watcher.
1307		1374
1308	=back	1375	=back
1309		1376
1310	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	1377	See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1311		1378	OWN COMPOSITE WATCHERS> idioms.
1312	Each watcher has, by default, a member C<void *data> that you can change
1313	and read at any time: libev will completely ignore it. This can be used
1314	to associate arbitrary data with your watcher. If you need more data and
1315	don't want to allocate memory and store a pointer to it in that data
1316	member, you can also "subclass" the watcher type and provide your own
1317	data:
1318
1319	struct my_io
1320	{
1321	ev_io io;
1322	int otherfd;
1323	void *somedata;
1324	struct whatever *mostinteresting;
1325	};
1326
1327	...
1328	struct my_io w;
1329	ev_io_init (&w.io, my_cb, fd, EV_READ);
1330
1331	And since your callback will be called with a pointer to the watcher, you
1332	can cast it back to your own type:
1333
1334	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
1335	{
1336	struct my_io w = (struct my_io )w_;
1337	...
1338	}
1339
1340	More interesting and less C-conformant ways of casting your callback type
1341	instead have been omitted.
1342
1343	Another common scenario is to use some data structure with multiple
1344	embedded watchers:
1345
1346	struct my_biggy
1347	{
1348	int some_data;
1349	ev_timer t1;
1350	ev_timer t2;
1351	}
1352
1353	In this case getting the pointer to C<my_biggy> is a bit more
1354	complicated: Either you store the address of your C<my_biggy> struct
1355	in the C<data> member of the watcher (for woozies), or you need to use
1356	some pointer arithmetic using C<offsetof> inside your watchers (for real
1357	programmers):
1358
1359	#include <stddef.h>
1360
1361	static void
1362	t1_cb (EV_P_ ev_timer *w, int revents)
1363	{
1364	struct my_biggy big = (struct my_biggy *)
1365	(((char *)w) - offsetof (struct my_biggy, t1));
1366	}
1367
1368	static void
1369	t2_cb (EV_P_ ev_timer *w, int revents)
1370	{
1371	struct my_biggy big = (struct my_biggy *)
1372	(((char *)w) - offsetof (struct my_biggy, t2));
1373	}
1374		1379
1375	=head2 WATCHER STATES	1380	=head2 WATCHER STATES
1376		1381
1377	There are various watcher states mentioned throughout this manual -	1382	There are various watcher states mentioned throughout this manual -
1378	active, pending and so on. In this section these states and the rules to	1383	active, pending and so on. In this section these states and the rules to
…		…
1381		1386
1382	=over 4	1387	=over 4
1383		1388
1384	=item initialiased	1389	=item initialiased
1385		1390
1386	Before a watcher can be registered with the event looop it has to be	1391	Before a watcher can be registered with the event loop it has to be
1387	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1392	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1388	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1393	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1389		1394
1390	In this state it is simply some block of memory that is suitable for use	1395	In this state it is simply some block of memory that is suitable for
1391	in an event loop. It can be moved around, freed, reused etc. at will.	1396	use in an event loop. It can be moved around, freed, reused etc. at
		1397	will - as long as you either keep the memory contents intact, or call
		1398	C<ev_TYPE_init> again.
1392		1399
1393	=item started/running/active	1400	=item started/running/active
1394		1401
1395	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1402	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1396	property of the event loop, and is actively waiting for events. While in	1403	property of the event loop, and is actively waiting for events. While in
…		…
1424	latter will clear any pending state the watcher might be in, regardless	1431	latter will clear any pending state the watcher might be in, regardless
1425	of whether it was active or not, so stopping a watcher explicitly before	1432	of whether it was active or not, so stopping a watcher explicitly before
1426	freeing it is often a good idea.	1433	freeing it is often a good idea.
1427		1434
1428	While stopped (and not pending) the watcher is essentially in the	1435	While stopped (and not pending) the watcher is essentially in the
1429	initialised state, that is it can be reused, moved, modified in any way	1436	initialised state, that is, it can be reused, moved, modified in any way
1430	you wish.	1437	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1438	it again).
1431		1439
1432	=back	1440	=back
1433		1441
1434	=head2 WATCHER PRIORITY MODELS	1442	=head2 WATCHER PRIORITY MODELS
1435		1443
…		…
1564	In general you can register as many read and/or write event watchers per	1572	In general you can register as many read and/or write event watchers per
1565	fd as you want (as long as you don't confuse yourself). Setting all file	1573	fd as you want (as long as you don't confuse yourself). Setting all file
1566	descriptors to non-blocking mode is also usually a good idea (but not	1574	descriptors to non-blocking mode is also usually a good idea (but not
1567	required if you know what you are doing).	1575	required if you know what you are doing).
1568		1576
1569	If you cannot use non-blocking mode, then force the use of a
1570	known-to-be-good backend (at the time of this writing, this includes only
1571	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1572	descriptors for which non-blocking operation makes no sense (such as
1573	files) - libev doesn't guarantee any specific behaviour in that case.
1574
1575	Another thing you have to watch out for is that it is quite easy to	1577	Another thing you have to watch out for is that it is quite easy to
1576	receive "spurious" readiness notifications, that is your callback might	1578	receive "spurious" readiness notifications, that is, your callback might
1577	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1579	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1578	because there is no data. Not only are some backends known to create a	1580	because there is no data. It is very easy to get into this situation even
1579	lot of those (for example Solaris ports), it is very easy to get into	1581	with a relatively standard program structure. Thus it is best to always
1580	this situation even with a relatively standard program structure. Thus	1582	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1581	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1582	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1583	preferable to a program hanging until some data arrives.
1583		1584
1584	If you cannot run the fd in non-blocking mode (for example you should	1585	If you cannot run the fd in non-blocking mode (for example you should
1585	not play around with an Xlib connection), then you have to separately	1586	not play around with an Xlib connection), then you have to separately
1586	re-test whether a file descriptor is really ready with a known-to-be good	1587	re-test whether a file descriptor is really ready with a known-to-be good
1587	interface such as poll (fortunately in our Xlib example, Xlib already	1588	interface such as poll (fortunately in the case of Xlib, it already does
1588	does this on its own, so its quite safe to use). Some people additionally	1589	this on its own, so its quite safe to use). Some people additionally
1589	use C<SIGALRM> and an interval timer, just to be sure you won't block	1590	use C<SIGALRM> and an interval timer, just to be sure you won't block
1590	indefinitely.	1591	indefinitely.
1591		1592
1592	But really, best use non-blocking mode.	1593	But really, best use non-blocking mode.
1593		1594
…		…
1621		1622
1622	There is no workaround possible except not registering events	1623	There is no workaround possible except not registering events
1623	for potentially C<dup ()>'ed file descriptors, or to resort to	1624	for potentially C<dup ()>'ed file descriptors, or to resort to
1624	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1625	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1625		1626
		1627	=head3 The special problem of files
		1628
		1629	Many people try to use C<select> (or libev) on file descriptors
		1630	representing files, and expect it to become ready when their program
		1631	doesn't block on disk accesses (which can take a long time on their own).
		1632
		1633	However, this cannot ever work in the "expected" way - you get a readiness
		1634	notification as soon as the kernel knows whether and how much data is
		1635	there, and in the case of open files, that's always the case, so you
		1636	always get a readiness notification instantly, and your read (or possibly
		1637	write) will still block on the disk I/O.
		1638
		1639	Another way to view it is that in the case of sockets, pipes, character
		1640	devices and so on, there is another party (the sender) that delivers data
		1641	on its own, but in the case of files, there is no such thing: the disk
		1642	will not send data on its own, simply because it doesn't know what you
		1643	wish to read - you would first have to request some data.
		1644
		1645	Since files are typically not-so-well supported by advanced notification
		1646	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1647	to files, even though you should not use it. The reason for this is
		1648	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1649	usually a tty, often a pipe, but also sometimes files or special devices
		1650	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1651	F</dev/urandom>), and even though the file might better be served with
		1652	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1653	it "just works" instead of freezing.
		1654
		1655	So avoid file descriptors pointing to files when you know it (e.g. use
		1656	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1657	when you rarely read from a file instead of from a socket, and want to
		1658	reuse the same code path.
		1659
1626	=head3 The special problem of fork	1660	=head3 The special problem of fork
1627		1661
1628	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1662	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1629	useless behaviour. Libev fully supports fork, but needs to be told about	1663	useless behaviour. Libev fully supports fork, but needs to be told about
1630	it in the child.	1664	it in the child if you want to continue to use it in the child.
1631		1665
1632	To support fork in your programs, you either have to call	1666	To support fork in your child processes, you have to call C<ev_loop_fork
1633	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1667	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1634	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1668	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1635	C<EVBACKEND_POLL>.
1636		1669
1637	=head3 The special problem of SIGPIPE	1670	=head3 The special problem of SIGPIPE
1638		1671
1639	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1672	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1640	when writing to a pipe whose other end has been closed, your program gets	1673	when writing to a pipe whose other end has been closed, your program gets
…		…
1990	keep up with the timer (because it takes longer than those 10 seconds to	2023	keep up with the timer (because it takes longer than those 10 seconds to
1991	do stuff) the timer will not fire more than once per event loop iteration.	2024	do stuff) the timer will not fire more than once per event loop iteration.
1992		2025
1993	=item ev_timer_again (loop, ev_timer *)	2026	=item ev_timer_again (loop, ev_timer *)
1994		2027
1995	This will act as if the timer timed out and restart it again if it is	2028	This will act as if the timer timed out and restarts it again if it is
1996	repeating. The exact semantics are:	2029	repeating. The exact semantics are:
1997		2030
1998	If the timer is pending, its pending status is cleared.	2031	If the timer is pending, its pending status is cleared.
1999		2032
2000	If the timer is started but non-repeating, stop it (as if it timed out).	2033	If the timer is started but non-repeating, stop it (as if it timed out).
…		…
2130		2163
2131	Another way to think about it (for the mathematically inclined) is that	2164	Another way to think about it (for the mathematically inclined) is that
2132	C<ev_periodic> will try to run the callback in this mode at the next possible	2165	C<ev_periodic> will try to run the callback in this mode at the next possible
2133	time where C<time = offset (mod interval)>, regardless of any time jumps.	2166	time where C<time = offset (mod interval)>, regardless of any time jumps.
2134		2167
2135	For numerical stability it is preferable that the C<offset> value is near	2168	The C<interval> I<MUST> be positive, and for numerical stability, the
2136	C<ev_now ()> (the current time), but there is no range requirement for	2169	interval value should be higher than C<1/8192> (which is around 100
2137	this value, and in fact is often specified as zero.	2170	microseconds) and C<offset> should be higher than C<0> and should have
		2171	at most a similar magnitude as the current time (say, within a factor of
		2172	ten). Typical values for offset are, in fact, C<0> or something between
		2173	C<0> and C<interval>, which is also the recommended range.
2138		2174
2139	Note also that there is an upper limit to how often a timer can fire (CPU	2175	Note also that there is an upper limit to how often a timer can fire (CPU
2140	speed for example), so if C<interval> is very small then timing stability	2176	speed for example), so if C<interval> is very small then timing stability
2141	will of course deteriorate. Libev itself tries to be exact to be about one	2177	will of course deteriorate. Libev itself tries to be exact to be about one
2142	millisecond (if the OS supports it and the machine is fast enough).	2178	millisecond (if the OS supports it and the machine is fast enough).
…		…
2256		2292
2257	=head2 C<ev_signal> - signal me when a signal gets signalled!	2293	=head2 C<ev_signal> - signal me when a signal gets signalled!
2258		2294
2259	Signal watchers will trigger an event when the process receives a specific	2295	Signal watchers will trigger an event when the process receives a specific
2260	signal one or more times. Even though signals are very asynchronous, libev	2296	signal one or more times. Even though signals are very asynchronous, libev
2261	will try it's best to deliver signals synchronously, i.e. as part of the	2297	will try its best to deliver signals synchronously, i.e. as part of the
2262	normal event processing, like any other event.	2298	normal event processing, like any other event.
2263		2299
2264	If you want signals to be delivered truly asynchronously, just use	2300	If you want signals to be delivered truly asynchronously, just use
2265	C<sigaction> as you would do without libev and forget about sharing	2301	C<sigaction> as you would do without libev and forget about sharing
2266	the signal. You can even use C<ev_async> from a signal handler to	2302	the signal. You can even use C<ev_async> from a signal handler to
…		…
2285	=head3 The special problem of inheritance over fork/execve/pthread_create	2321	=head3 The special problem of inheritance over fork/execve/pthread_create
2286		2322
2287	Both the signal mask (C<sigprocmask>) and the signal disposition	2323	Both the signal mask (C<sigprocmask>) and the signal disposition
2288	(C<sigaction>) are unspecified after starting a signal watcher (and after	2324	(C<sigaction>) are unspecified after starting a signal watcher (and after
2289	stopping it again), that is, libev might or might not block the signal,	2325	stopping it again), that is, libev might or might not block the signal,
2290	and might or might not set or restore the installed signal handler.	2326	and might or might not set or restore the installed signal handler (but
		2327	see C<EVFLAG_NOSIGMASK>).
2291		2328
2292	While this does not matter for the signal disposition (libev never	2329	While this does not matter for the signal disposition (libev never
2293	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2330	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2294	C<execve>), this matters for the signal mask: many programs do not expect	2331	C<execve>), this matters for the signal mask: many programs do not expect
2295	certain signals to be blocked.	2332	certain signals to be blocked.
…		…
2308	I<has> to modify the signal mask, at least temporarily.	2345	I<has> to modify the signal mask, at least temporarily.
2309		2346
2310	So I can't stress this enough: I<If you do not reset your signal mask when	2347	So I can't stress this enough: I<If you do not reset your signal mask when
2311	you expect it to be empty, you have a race condition in your code>. This	2348	you expect it to be empty, you have a race condition in your code>. This
2312	is not a libev-specific thing, this is true for most event libraries.	2349	is not a libev-specific thing, this is true for most event libraries.
		2350
		2351	=head3 The special problem of threads signal handling
		2352
		2353	POSIX threads has problematic signal handling semantics, specifically,
		2354	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2355	threads in a process block signals, which is hard to achieve.
		2356
		2357	When you want to use sigwait (or mix libev signal handling with your own
		2358	for the same signals), you can tackle this problem by globally blocking
		2359	all signals before creating any threads (or creating them with a fully set
		2360	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2361	loops. Then designate one thread as "signal receiver thread" which handles
		2362	these signals. You can pass on any signals that libev might be interested
		2363	in by calling C<ev_feed_signal>.
2313		2364
2314	=head3 Watcher-Specific Functions and Data Members	2365	=head3 Watcher-Specific Functions and Data Members
2315		2366
2316	=over 4	2367	=over 4
2317		2368
…		…
3152	atexit (program_exits);	3203	atexit (program_exits);
3153		3204
3154		3205
3155	=head2 C<ev_async> - how to wake up an event loop	3206	=head2 C<ev_async> - how to wake up an event loop
3156		3207
3157	In general, you cannot use an C<ev_run> from multiple threads or other	3208	In general, you cannot use an C<ev_loop> from multiple threads or other
3158	asynchronous sources such as signal handlers (as opposed to multiple event	3209	asynchronous sources such as signal handlers (as opposed to multiple event
3159	loops - those are of course safe to use in different threads).	3210	loops - those are of course safe to use in different threads).
3160		3211
3161	Sometimes, however, you need to wake up an event loop you do not control,	3212	Sometimes, however, you need to wake up an event loop you do not control,
3162	for example because it belongs to another thread. This is what C<ev_async>	3213	for example because it belongs to another thread. This is what C<ev_async>
…		…
3164	it by calling C<ev_async_send>, which is thread- and signal safe.	3215	it by calling C<ev_async_send>, which is thread- and signal safe.
3165		3216
3166	This functionality is very similar to C<ev_signal> watchers, as signals,	3217	This functionality is very similar to C<ev_signal> watchers, as signals,
3167	too, are asynchronous in nature, and signals, too, will be compressed	3218	too, are asynchronous in nature, and signals, too, will be compressed
3168	(i.e. the number of callback invocations may be less than the number of	3219	(i.e. the number of callback invocations may be less than the number of
3169	C<ev_async_sent> calls).	3220	C<ev_async_sent> calls). In fact, you could use signal watchers as a kind
3170		3221	of "global async watchers" by using a watcher on an otherwise unused
3171	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3222	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3172	just the default loop.	3223	even without knowing which loop owns the signal.
3173		3224
3174	=head3 Queueing	3225	=head3 Queueing
3175		3226
3176	C<ev_async> does not support queueing of data in any way. The reason	3227	C<ev_async> does not support queueing of data in any way. The reason
3177	is that the author does not know of a simple (or any) algorithm for a	3228	is that the author does not know of a simple (or any) algorithm for a
…		…
3269	trust me.	3320	trust me.
3270		3321
3271	=item ev_async_send (loop, ev_async *)	3322	=item ev_async_send (loop, ev_async *)
3272		3323
3273	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3324	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3274	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3325	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3326	returns.
		3327
3275	C<ev_feed_event>, this call is safe to do from other threads, signal or	3328	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3276	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3329	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3277	section below on what exactly this means).	3330	embedding section below on what exactly this means).
3278		3331
3279	Note that, as with other watchers in libev, multiple events might get	3332	Note that, as with other watchers in libev, multiple events might get
3280	compressed into a single callback invocation (another way to look at this	3333	compressed into a single callback invocation (another way to look at
3281	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3334	this is that C<ev_async> watchers are level-triggered: they are set on
3282	reset when the event loop detects that).	3335	C<ev_async_send>, reset when the event loop detects that).
3283		3336
3284	This call incurs the overhead of a system call only once per event loop	3337	This call incurs the overhead of at most one extra system call per event
3285	iteration, so while the overhead might be noticeable, it doesn't apply to	3338	loop iteration, if the event loop is blocked, and no syscall at all if
3286	repeated calls to C<ev_async_send> for the same event loop.	3339	the event loop (or your program) is processing events. That means that
		3340	repeated calls are basically free (there is no need to avoid calls for
		3341	performance reasons) and that the overhead becomes smaller (typically
		3342	zero) under load.
3287		3343
3288	=item bool = ev_async_pending (ev_async *)	3344	=item bool = ev_async_pending (ev_async *)
3289		3345
3290	Returns a non-zero value when C<ev_async_send> has been called on the	3346	Returns a non-zero value when C<ev_async_send> has been called on the
3291	watcher but the event has not yet been processed (or even noted) by the	3347	watcher but the event has not yet been processed (or even noted) by the
…		…
3350	Feed an event on the given fd, as if a file descriptor backend detected	3406	Feed an event on the given fd, as if a file descriptor backend detected
3351	the given events it.	3407	the given events it.
3352		3408
3353	=item ev_feed_signal_event (loop, int signum)	3409	=item ev_feed_signal_event (loop, int signum)
3354		3410
3355	Feed an event as if the given signal occurred (C<loop> must be the default	3411	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3356	loop!).	3412	which is async-safe.
3357		3413
3358	=back	3414	=back
		3415
		3416
		3417	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3418
		3419	This section explains some common idioms that are not immediately
		3420	obvious. Note that examples are sprinkled over the whole manual, and this
		3421	section only contains stuff that wouldn't fit anywhere else.
		3422
		3423	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3424
		3425	Each watcher has, by default, a C<void *data> member that you can read
		3426	or modify at any time: libev will completely ignore it. This can be used
		3427	to associate arbitrary data with your watcher. If you need more data and
		3428	don't want to allocate memory separately and store a pointer to it in that
		3429	data member, you can also "subclass" the watcher type and provide your own
		3430	data:
		3431
		3432	struct my_io
		3433	{
		3434	ev_io io;
		3435	int otherfd;
		3436	void *somedata;
		3437	struct whatever *mostinteresting;
		3438	};
		3439
		3440	...
		3441	struct my_io w;
		3442	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3443
		3444	And since your callback will be called with a pointer to the watcher, you
		3445	can cast it back to your own type:
		3446
		3447	static void my_cb (struct ev_loop loop, ev_io w_, int revents)
		3448	{
		3449	struct my_io w = (struct my_io )w_;
		3450	...
		3451	}
		3452
		3453	More interesting and less C-conformant ways of casting your callback
		3454	function type instead have been omitted.
		3455
		3456	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3457
		3458	Another common scenario is to use some data structure with multiple
		3459	embedded watchers, in effect creating your own watcher that combines
		3460	multiple libev event sources into one "super-watcher":
		3461
		3462	struct my_biggy
		3463	{
		3464	int some_data;
		3465	ev_timer t1;
		3466	ev_timer t2;
		3467	}
		3468
		3469	In this case getting the pointer to C<my_biggy> is a bit more
		3470	complicated: Either you store the address of your C<my_biggy> struct in
		3471	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3472	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3473	real programmers):
		3474
		3475	#include <stddef.h>
		3476
		3477	static void
		3478	t1_cb (EV_P_ ev_timer *w, int revents)
		3479	{
		3480	struct my_biggy big = (struct my_biggy *)
		3481	(((char *)w) - offsetof (struct my_biggy, t1));
		3482	}
		3483
		3484	static void
		3485	t2_cb (EV_P_ ev_timer *w, int revents)
		3486	{
		3487	struct my_biggy big = (struct my_biggy *)
		3488	(((char *)w) - offsetof (struct my_biggy, t2));
		3489	}
		3490
		3491	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3492
		3493	Often (especially in GUI toolkits) there are places where you have
		3494	I<modal> interaction, which is most easily implemented by recursively
		3495	invoking C<ev_run>.
		3496
		3497	This brings the problem of exiting - a callback might want to finish the
		3498	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3499	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3500	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3501	other combination: In these cases, C<ev_break> will not work alone.
		3502
		3503	The solution is to maintain "break this loop" variable for each C<ev_run>
		3504	invocation, and use a loop around C<ev_run> until the condition is
		3505	triggered, using C<EVRUN_ONCE>:
		3506
		3507	// main loop
		3508	int exit_main_loop = 0;
		3509
		3510	while (!exit_main_loop)
		3511	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3512
		3513	// in a model watcher
		3514	int exit_nested_loop = 0;
		3515
		3516	while (!exit_nested_loop)
		3517	ev_run (EV_A_ EVRUN_ONCE);
		3518
		3519	To exit from any of these loops, just set the corresponding exit variable:
		3520
		3521	// exit modal loop
		3522	exit_nested_loop = 1;
		3523
		3524	// exit main program, after modal loop is finished
		3525	exit_main_loop = 1;
		3526
		3527	// exit both
		3528	exit_main_loop = exit_nested_loop = 1;
		3529
		3530	=head2 THREAD LOCKING EXAMPLE
		3531
		3532	Here is a fictitious example of how to run an event loop in a different
		3533	thread from where callbacks are being invoked and watchers are
		3534	created/added/removed.
		3535
		3536	For a real-world example, see the C<EV::Loop::Async> perl module,
		3537	which uses exactly this technique (which is suited for many high-level
		3538	languages).
		3539
		3540	The example uses a pthread mutex to protect the loop data, a condition
		3541	variable to wait for callback invocations, an async watcher to notify the
		3542	event loop thread and an unspecified mechanism to wake up the main thread.
		3543
		3544	First, you need to associate some data with the event loop:
		3545
		3546	typedef struct {
		3547	mutex_t lock; /* global loop lock */
		3548	ev_async async_w;
		3549	thread_t tid;
		3550	cond_t invoke_cv;
		3551	} userdata;
		3552
		3553	void prepare_loop (EV_P)
		3554	{
		3555	// for simplicity, we use a static userdata struct.
		3556	static userdata u;
		3557
		3558	ev_async_init (&u->async_w, async_cb);
		3559	ev_async_start (EV_A_ &u->async_w);
		3560
		3561	pthread_mutex_init (&u->lock, 0);
		3562	pthread_cond_init (&u->invoke_cv, 0);
		3563
		3564	// now associate this with the loop
		3565	ev_set_userdata (EV_A_ u);
		3566	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3567	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3568
		3569	// then create the thread running ev_run
		3570	pthread_create (&u->tid, 0, l_run, EV_A);
		3571	}
		3572
		3573	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3574	solely to wake up the event loop so it takes notice of any new watchers
		3575	that might have been added:
		3576
		3577	static void
		3578	async_cb (EV_P_ ev_async *w, int revents)
		3579	{
		3580	// just used for the side effects
		3581	}
		3582
		3583	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3584	protecting the loop data, respectively.
		3585
		3586	static void
		3587	l_release (EV_P)
		3588	{
		3589	userdata *u = ev_userdata (EV_A);
		3590	pthread_mutex_unlock (&u->lock);
		3591	}
		3592
		3593	static void
		3594	l_acquire (EV_P)
		3595	{
		3596	userdata *u = ev_userdata (EV_A);
		3597	pthread_mutex_lock (&u->lock);
		3598	}
		3599
		3600	The event loop thread first acquires the mutex, and then jumps straight
		3601	into C<ev_run>:
		3602
		3603	void *
		3604	l_run (void *thr_arg)
		3605	{
		3606	struct ev_loop loop = (struct ev_loop )thr_arg;
		3607
		3608	l_acquire (EV_A);
		3609	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3610	ev_run (EV_A_ 0);
		3611	l_release (EV_A);
		3612
		3613	return 0;
		3614	}
		3615
		3616	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3617	signal the main thread via some unspecified mechanism (signals? pipe
		3618	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3619	have been called (in a while loop because a) spurious wakeups are possible
		3620	and b) skipping inter-thread-communication when there are no pending
		3621	watchers is very beneficial):
		3622
		3623	static void
		3624	l_invoke (EV_P)
		3625	{
		3626	userdata *u = ev_userdata (EV_A);
		3627
		3628	while (ev_pending_count (EV_A))
		3629	{
		3630	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3631	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3632	}
		3633	}
		3634
		3635	Now, whenever the main thread gets told to invoke pending watchers, it
		3636	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3637	thread to continue:
		3638
		3639	static void
		3640	real_invoke_pending (EV_P)
		3641	{
		3642	userdata *u = ev_userdata (EV_A);
		3643
		3644	pthread_mutex_lock (&u->lock);
		3645	ev_invoke_pending (EV_A);
		3646	pthread_cond_signal (&u->invoke_cv);
		3647	pthread_mutex_unlock (&u->lock);
		3648	}
		3649
		3650	Whenever you want to start/stop a watcher or do other modifications to an
		3651	event loop, you will now have to lock:
		3652
		3653	ev_timer timeout_watcher;
		3654	userdata *u = ev_userdata (EV_A);
		3655
		3656	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3657
		3658	pthread_mutex_lock (&u->lock);
		3659	ev_timer_start (EV_A_ &timeout_watcher);
		3660	ev_async_send (EV_A_ &u->async_w);
		3661	pthread_mutex_unlock (&u->lock);
		3662
		3663	Note that sending the C<ev_async> watcher is required because otherwise
		3664	an event loop currently blocking in the kernel will have no knowledge
		3665	about the newly added timer. By waking up the loop it will pick up any new
		3666	watchers in the next event loop iteration.
		3667
		3668	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3669
		3670	While the overhead of a callback that e.g. schedules a thread is small, it
		3671	is still an overhead. If you embed libev, and your main usage is with some
		3672	kind of threads or coroutines, you might want to customise libev so that
		3673	doesn't need callbacks anymore.
		3674
		3675	Imagine you have coroutines that you can switch to using a function
		3676	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3677	and that due to some magic, the currently active coroutine is stored in a
		3678	global called C<current_coro>. Then you can build your own "wait for libev
		3679	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3680	the differing C<;> conventions):
		3681
		3682	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3683	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3684
		3685	That means instead of having a C callback function, you store the
		3686	coroutine to switch to in each watcher, and instead of having libev call
		3687	your callback, you instead have it switch to that coroutine.
		3688
		3689	A coroutine might now wait for an event with a function called
		3690	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3691	matter when, or whether the watcher is active or not when this function is
		3692	called):
		3693
		3694	void
		3695	wait_for_event (ev_watcher *w)
		3696	{
		3697	ev_cb_set (w) = current_coro;
		3698	switch_to (libev_coro);
		3699	}
		3700
		3701	That basically suspends the coroutine inside C<wait_for_event> and
		3702	continues the libev coroutine, which, when appropriate, switches back to
		3703	this or any other coroutine. I am sure if you sue this your own :)
		3704
		3705	You can do similar tricks if you have, say, threads with an event queue -
		3706	instead of storing a coroutine, you store the queue object and instead of
		3707	switching to a coroutine, you push the watcher onto the queue and notify
		3708	any waiters.
		3709
		3710	To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
		3711	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3712
		3713	// my_ev.h
		3714	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3715	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
		3716	#include "../libev/ev.h"
		3717
		3718	// my_ev.c
		3719	#define EV_H "my_ev.h"
		3720	#include "../libev/ev.c"
		3721
		3722	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3723	F<my_ev.c> into your project. When properly specifying include paths, you
		3724	can even use F<ev.h> as header file name directly.
3359		3725
3360		3726
3361	=head1 LIBEVENT EMULATION	3727	=head1 LIBEVENT EMULATION
3362		3728
3363	Libev offers a compatibility emulation layer for libevent. It cannot	3729	Libev offers a compatibility emulation layer for libevent. It cannot
3364	emulate the internals of libevent, so here are some usage hints:	3730	emulate the internals of libevent, so here are some usage hints:
3365		3731
3366	=over 4	3732	=over 4
		3733
		3734	=item * Only the libevent-1.4.1-beta API is being emulated.
		3735
		3736	This was the newest libevent version available when libev was implemented,
		3737	and is still mostly unchanged in 2010.
3367		3738
3368	=item * Use it by including <event.h>, as usual.	3739	=item * Use it by including <event.h>, as usual.
3369		3740
3370	=item * The following members are fully supported: ev_base, ev_callback,	3741	=item * The following members are fully supported: ev_base, ev_callback,
3371	ev_arg, ev_fd, ev_res, ev_events.	3742	ev_arg, ev_fd, ev_res, ev_events.
…		…
3377	=item * Priorities are not currently supported. Initialising priorities	3748	=item * Priorities are not currently supported. Initialising priorities
3378	will fail and all watchers will have the same priority, even though there	3749	will fail and all watchers will have the same priority, even though there
3379	is an ev_pri field.	3750	is an ev_pri field.
3380		3751
3381	=item * In libevent, the last base created gets the signals, in libev, the	3752	=item * In libevent, the last base created gets the signals, in libev, the
3382	first base created (== the default loop) gets the signals.	3753	base that registered the signal gets the signals.
3383		3754
3384	=item * Other members are not supported.	3755	=item * Other members are not supported.
3385		3756
3386	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3757	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3387	to use the libev header file and library.	3758	to use the libev header file and library.
…		…
3406	Care has been taken to keep the overhead low. The only data member the C++	3777	Care has been taken to keep the overhead low. The only data member the C++
3407	classes add (compared to plain C-style watchers) is the event loop pointer	3778	classes add (compared to plain C-style watchers) is the event loop pointer
3408	that the watcher is associated with (or no additional members at all if	3779	that the watcher is associated with (or no additional members at all if
3409	you disable C<EV_MULTIPLICITY> when embedding libev).	3780	you disable C<EV_MULTIPLICITY> when embedding libev).
3410		3781
3411	Currently, functions, and static and non-static member functions can be	3782	Currently, functions, static and non-static member functions and classes
3412	used as callbacks. Other types should be easy to add as long as they only	3783	with C<operator ()> can be used as callbacks. Other types should be easy
3413	need one additional pointer for context. If you need support for other	3784	to add as long as they only need one additional pointer for context. If
3414	types of functors please contact the author (preferably after implementing	3785	you need support for other types of functors please contact the author
3415	it).	3786	(preferably after implementing it).
3416		3787
3417	Here is a list of things available in the C<ev> namespace:	3788	Here is a list of things available in the C<ev> namespace:
3418		3789
3419	=over 4	3790	=over 4
3420		3791
…		…
3573	watchers in the constructor.	3944	watchers in the constructor.
3574		3945
3575	class myclass	3946	class myclass
3576	{	3947	{
3577	ev::io io ; void io_cb (ev::io &w, int revents);	3948	ev::io io ; void io_cb (ev::io &w, int revents);
3578	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	3949	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3579	ev::idle idle; void idle_cb (ev::idle &w, int revents);	3950	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3580		3951
3581	myclass (int fd)	3952	myclass (int fd)
3582	{	3953	{
3583	io .set <myclass, &myclass::io_cb > (this);	3954	io .set <myclass, &myclass::io_cb > (this);
…		…
3634	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4005	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3635		4006
3636	=item D	4007	=item D
3637		4008
3638	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4009	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3639	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4010	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3640		4011
3641	=item Ocaml	4012	=item Ocaml
3642		4013
3643	Erkki Seppala has written Ocaml bindings for libev, to be found at	4014	Erkki Seppala has written Ocaml bindings for libev, to be found at
3644	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4015	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3847	supported). It will also not define any of the structs usually found in	4218	supported). It will also not define any of the structs usually found in
3848	F<event.h> that are not directly supported by the libev core alone.	4219	F<event.h> that are not directly supported by the libev core alone.
3849		4220
3850	In standalone mode, libev will still try to automatically deduce the	4221	In standalone mode, libev will still try to automatically deduce the
3851	configuration, but has to be more conservative.	4222	configuration, but has to be more conservative.
		4223
		4224	=item EV_USE_FLOOR
		4225
		4226	If defined to be C<1>, libev will use the C<floor ()> function for its
		4227	periodic reschedule calculations, otherwise libev will fall back on a
		4228	portable (slower) implementation. If you enable this, you usually have to
		4229	link against libm or something equivalent. Enabling this when the C<floor>
		4230	function is not available will fail, so the safe default is to not enable
		4231	this.
3852		4232
3853	=item EV_USE_MONOTONIC	4233	=item EV_USE_MONOTONIC
3854		4234
3855	If defined to be C<1>, libev will try to detect the availability of the	4235	If defined to be C<1>, libev will try to detect the availability of the
3856	monotonic clock option at both compile time and runtime. Otherwise no	4236	monotonic clock option at both compile time and runtime. Otherwise no
…		…
3989	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4369	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
3990		4370
3991	=item EV_ATOMIC_T	4371	=item EV_ATOMIC_T
3992		4372
3993	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4373	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
3994	access is atomic with respect to other threads or signal contexts. No such	4374	access is atomic and serialised with respect to other threads or signal
3995	type is easily found in the C language, so you can provide your own type	4375	contexts. No such type is easily found in the C language, so you can
3996	that you know is safe for your purposes. It is used both for signal handler "locking"	4376	provide your own type that you know is safe for your purposes. It is used
3997	as well as for signal and thread safety in C<ev_async> watchers.	4377	both for signal handler "locking" as well as for signal and thread safety
		4378	in C<ev_async> watchers.
3998		4379
3999	In the absence of this define, libev will use C<sig_atomic_t volatile>	4380	In the absence of this define, libev will use C<sig_atomic_t volatile>
4000	(from F<signal.h>), which is usually good enough on most platforms.	4381	(from F<signal.h>), which is usually good enough on most platforms,
		4382	although strictly speaking using a type that also implies a memory fence
		4383	is required.
4001		4384
4002	=item EV_H (h)	4385	=item EV_H (h)
4003		4386
4004	The name of the F<ev.h> header file used to include it. The default if	4387	The name of the F<ev.h> header file used to include it. The default if
4005	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be	4388	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
…		…
4288	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4671	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4289		4672
4290	#include "ev_cpp.h"	4673	#include "ev_cpp.h"
4291	#include "ev.c"	4674	#include "ev.c"
4292		4675
4293	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4676	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4294		4677
4295	=head2 THREADS AND COROUTINES	4678	=head2 THREADS AND COROUTINES
4296		4679
4297	=head3 THREADS	4680	=head3 THREADS
4298		4681
…		…
4349	default loop and triggering an C<ev_async> watcher from the default loop	4732	default loop and triggering an C<ev_async> watcher from the default loop
4350	watcher callback into the event loop interested in the signal.	4733	watcher callback into the event loop interested in the signal.
4351		4734
4352	=back	4735	=back
4353		4736
4354	=head4 THREAD LOCKING EXAMPLE	4737	See also L<THREAD LOCKING EXAMPLE>.
4355
4356	Here is a fictitious example of how to run an event loop in a different
4357	thread than where callbacks are being invoked and watchers are
4358	created/added/removed.
4359
4360	For a real-world example, see the C<EV::Loop::Async> perl module,
4361	which uses exactly this technique (which is suited for many high-level
4362	languages).
4363
4364	The example uses a pthread mutex to protect the loop data, a condition
4365	variable to wait for callback invocations, an async watcher to notify the
4366	event loop thread and an unspecified mechanism to wake up the main thread.
4367
4368	First, you need to associate some data with the event loop:
4369
4370	typedef struct {
4371	mutex_t lock; /* global loop lock */
4372	ev_async async_w;
4373	thread_t tid;
4374	cond_t invoke_cv;
4375	} userdata;
4376
4377	void prepare_loop (EV_P)
4378	{
4379	// for simplicity, we use a static userdata struct.
4380	static userdata u;
4381
4382	ev_async_init (&u->async_w, async_cb);
4383	ev_async_start (EV_A_ &u->async_w);
4384
4385	pthread_mutex_init (&u->lock, 0);
4386	pthread_cond_init (&u->invoke_cv, 0);
4387
4388	// now associate this with the loop
4389	ev_set_userdata (EV_A_ u);
4390	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4391	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4392
4393	// then create the thread running ev_loop
4394	pthread_create (&u->tid, 0, l_run, EV_A);
4395	}
4396
4397	The callback for the C<ev_async> watcher does nothing: the watcher is used
4398	solely to wake up the event loop so it takes notice of any new watchers
4399	that might have been added:
4400
4401	static void
4402	async_cb (EV_P_ ev_async *w, int revents)
4403	{
4404	// just used for the side effects
4405	}
4406
4407	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4408	protecting the loop data, respectively.
4409
4410	static void
4411	l_release (EV_P)
4412	{
4413	userdata *u = ev_userdata (EV_A);
4414	pthread_mutex_unlock (&u->lock);
4415	}
4416
4417	static void
4418	l_acquire (EV_P)
4419	{
4420	userdata *u = ev_userdata (EV_A);
4421	pthread_mutex_lock (&u->lock);
4422	}
4423
4424	The event loop thread first acquires the mutex, and then jumps straight
4425	into C<ev_run>:
4426
4427	void *
4428	l_run (void *thr_arg)
4429	{
4430	struct ev_loop loop = (struct ev_loop )thr_arg;
4431
4432	l_acquire (EV_A);
4433	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4434	ev_run (EV_A_ 0);
4435	l_release (EV_A);
4436
4437	return 0;
4438	}
4439
4440	Instead of invoking all pending watchers, the C<l_invoke> callback will
4441	signal the main thread via some unspecified mechanism (signals? pipe
4442	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4443	have been called (in a while loop because a) spurious wakeups are possible
4444	and b) skipping inter-thread-communication when there are no pending
4445	watchers is very beneficial):
4446
4447	static void
4448	l_invoke (EV_P)
4449	{
4450	userdata *u = ev_userdata (EV_A);
4451
4452	while (ev_pending_count (EV_A))
4453	{
4454	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4455	pthread_cond_wait (&u->invoke_cv, &u->lock);
4456	}
4457	}
4458
4459	Now, whenever the main thread gets told to invoke pending watchers, it
4460	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4461	thread to continue:
4462
4463	static void
4464	real_invoke_pending (EV_P)
4465	{
4466	userdata *u = ev_userdata (EV_A);
4467
4468	pthread_mutex_lock (&u->lock);
4469	ev_invoke_pending (EV_A);
4470	pthread_cond_signal (&u->invoke_cv);
4471	pthread_mutex_unlock (&u->lock);
4472	}
4473
4474	Whenever you want to start/stop a watcher or do other modifications to an
4475	event loop, you will now have to lock:
4476
4477	ev_timer timeout_watcher;
4478	userdata *u = ev_userdata (EV_A);
4479
4480	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4481
4482	pthread_mutex_lock (&u->lock);
4483	ev_timer_start (EV_A_ &timeout_watcher);
4484	ev_async_send (EV_A_ &u->async_w);
4485	pthread_mutex_unlock (&u->lock);
4486
4487	Note that sending the C<ev_async> watcher is required because otherwise
4488	an event loop currently blocking in the kernel will have no knowledge
4489	about the newly added timer. By waking up the loop it will pick up any new
4490	watchers in the next event loop iteration.
4491		4738
4492	=head3 COROUTINES	4739	=head3 COROUTINES
4493		4740
4494	Libev is very accommodating to coroutines ("cooperative threads"):	4741	Libev is very accommodating to coroutines ("cooperative threads"):
4495	libev fully supports nesting calls to its functions from different	4742	libev fully supports nesting calls to its functions from different
…		…
4660	requires, and its I/O model is fundamentally incompatible with the POSIX	4907	requires, and its I/O model is fundamentally incompatible with the POSIX
4661	model. Libev still offers limited functionality on this platform in	4908	model. Libev still offers limited functionality on this platform in
4662	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	4909	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4663	descriptors. This only applies when using Win32 natively, not when using	4910	descriptors. This only applies when using Win32 natively, not when using
4664	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	4911	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4665	as every compielr comes with a slightly differently broken/incompatible	4912	as every compiler comes with a slightly differently broken/incompatible
4666	environment.	4913	environment.
4667		4914
4668	Lifting these limitations would basically require the full	4915	Lifting these limitations would basically require the full
4669	re-implementation of the I/O system. If you are into this kind of thing,	4916	re-implementation of the I/O system. If you are into this kind of thing,
4670	then note that glib does exactly that for you in a very portable way (note	4917	then note that glib does exactly that for you in a very portable way (note
…		…
4803		5050
4804	The type C<double> is used to represent timestamps. It is required to	5051	The type C<double> is used to represent timestamps. It is required to
4805	have at least 51 bits of mantissa (and 9 bits of exponent), which is	5052	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4806	good enough for at least into the year 4000 with millisecond accuracy	5053	good enough for at least into the year 4000 with millisecond accuracy
4807	(the design goal for libev). This requirement is overfulfilled by	5054	(the design goal for libev). This requirement is overfulfilled by
4808	implementations using IEEE 754, which is basically all existing ones. With	5055	implementations using IEEE 754, which is basically all existing ones.
		5056
4809	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5057	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5058	year 2255 (and millisecond accuray till the year 287396 - by then, libev
		5059	is either obsolete or somebody patched it to use C<long double> or
		5060	something like that, just kidding).
4810		5061
4811	=back	5062	=back
4812		5063
4813	If you know of other additional requirements drop me a note.	5064	If you know of other additional requirements drop me a note.
4814		5065
…		…
4876	=item Processing ev_async_send: O(number_of_async_watchers)	5127	=item Processing ev_async_send: O(number_of_async_watchers)
4877		5128
4878	=item Processing signals: O(max_signal_number)	5129	=item Processing signals: O(max_signal_number)
4879		5130
4880	Sending involves a system call I<iff> there were no other C<ev_async_send>	5131	Sending involves a system call I<iff> there were no other C<ev_async_send>
4881	calls in the current loop iteration. Checking for async and signal events	5132	calls in the current loop iteration and the loop is currently
		5133	blocked. Checking for async and signal events involves iterating over all
4882	involves iterating over all running async watchers or all signal numbers.	5134	running async watchers or all signal numbers.
4883		5135
4884	=back	5136	=back
4885		5137
4886		5138
4887	=head1 PORTING FROM LIBEV 3.X TO 4.X	5139	=head1 PORTING FROM LIBEV 3.X TO 4.X
…		…
5004	The physical time that is observed. It is apparently strictly monotonic :)	5256	The physical time that is observed. It is apparently strictly monotonic :)
5005		5257
5006	=item wall-clock time	5258	=item wall-clock time
5007		5259
5008	The time and date as shown on clocks. Unlike real time, it can actually	5260	The time and date as shown on clocks. Unlike real time, it can actually
5009	be wrong and jump forwards and backwards, e.g. when the you adjust your	5261	be wrong and jump forwards and backwards, e.g. when you adjust your
5010	clock.	5262	clock.
5011		5263
5012	=item watcher	5264	=item watcher
5013		5265
5014	A data structure that describes interest in certain events. Watchers need	5266	A data structure that describes interest in certain events. Watchers need
…		…
5017	=back	5269	=back
5018		5270
5019	=head1 AUTHOR	5271	=head1 AUTHOR
5020		5272
5021	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael	5273	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5022	Magnusson and Emanuele Giaquinta.	5274	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5023		5275

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.336 by root, Mon Oct 25 11:10:10 2010 UTC vs. Revision 1.379 by root, Tue Jul 12 23:32:10 2011 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.336 by root, Mon Oct 25 11:10:10 2010 UTC vs.
Revision 1.379 by root, Tue Jul 12 23:32:10 2011 UTC