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

Comparing libev/ev.pod (file contents):
Revision 1.60 by root, Wed Nov 28 18:29:30 2007 UTC vs.
Revision 1.100 by root, Sat Dec 22 11:49:17 2007 UTC

…		…
48	return 0;	48	return 0;
49	}	49	}
50		50
51	=head1 DESCRIPTION	51	=head1 DESCRIPTION
52		52
		53	The newest version of this document is also available as a html-formatted
		54	web page you might find easier to navigate when reading it for the first
		55	time: L<http://cvs.schmorp.de/libev/ev.html>.
		56
53	Libev is an event loop: you register interest in certain events (such as a	57	Libev is an event loop: you register interest in certain events (such as a
54	file descriptor being readable or a timeout occuring), and it will manage	58	file descriptor being readable or a timeout occurring), and it will manage
55	these event sources and provide your program with events.	59	these event sources and provide your program with events.
56		60
57	To do this, it must take more or less complete control over your process	61	To do this, it must take more or less complete control over your process
58	(or thread) by executing the I<event loop> handler, and will then	62	(or thread) by executing the I<event loop> handler, and will then
59	communicate events via a callback mechanism.	63	communicate events via a callback mechanism.
…		…
94	Libev represents time as a single floating point number, representing the	98	Libev represents time as a single floating point number, representing the
95	(fractional) number of seconds since the (POSIX) epoch (somewhere near	99	(fractional) number of seconds since the (POSIX) epoch (somewhere near
96	the beginning of 1970, details are complicated, don't ask). This type is	100	the beginning of 1970, details are complicated, don't ask). This type is
97	called C<ev_tstamp>, which is what you should use too. It usually aliases	101	called C<ev_tstamp>, which is what you should use too. It usually aliases
98	to the C<double> type in C, and when you need to do any calculations on	102	to the C<double> type in C, and when you need to do any calculations on
99	it, you should treat it as such.	103	it, you should treat it as some floatingpoint value. Unlike the name
		104	component C<stamp> might indicate, it is also used for time differences
		105	throughout libev.
100		106
101	=head1 GLOBAL FUNCTIONS	107	=head1 GLOBAL FUNCTIONS
102		108
103	These functions can be called anytime, even before initialising the	109	These functions can be called anytime, even before initialising the
104	library in any way.	110	library in any way.
…		…
109		115
110	Returns the current time as libev would use it. Please note that the	116	Returns the current time as libev would use it. Please note that the
111	C<ev_now> function is usually faster and also often returns the timestamp	117	C<ev_now> function is usually faster and also often returns the timestamp
112	you actually want to know.	118	you actually want to know.
113		119
		120	=item ev_sleep (ev_tstamp interval)
		121
		122	Sleep for the given interval: The current thread will be blocked until
		123	either it is interrupted or the given time interval has passed. Basically
		124	this is a subsecond-resolution C<sleep ()>.
		125
114	=item int ev_version_major ()	126	=item int ev_version_major ()
115		127
116	=item int ev_version_minor ()	128	=item int ev_version_minor ()
117		129
118	You can find out the major and minor version numbers of the library	130	You can find out the major and minor ABI version numbers of the library
119	you linked against by calling the functions C<ev_version_major> and	131	you linked against by calling the functions C<ev_version_major> and
120	C<ev_version_minor>. If you want, you can compare against the global	132	C<ev_version_minor>. If you want, you can compare against the global
121	symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the	133	symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
122	version of the library your program was compiled against.	134	version of the library your program was compiled against.
123		135
		136	These version numbers refer to the ABI version of the library, not the
		137	release version.
		138
124	Usually, it's a good idea to terminate if the major versions mismatch,	139	Usually, it's a good idea to terminate if the major versions mismatch,
125	as this indicates an incompatible change. Minor versions are usually	140	as this indicates an incompatible change. Minor versions are usually
126	compatible to older versions, so a larger minor version alone is usually	141	compatible to older versions, so a larger minor version alone is usually
127	not a problem.	142	not a problem.
128		143
129	Example: Make sure we haven't accidentally been linked against the wrong	144	Example: Make sure we haven't accidentally been linked against the wrong
130	version.	145	version.
…		…
266	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	281	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
267	override the flags completely if it is found in the environment. This is	282	override the flags completely if it is found in the environment. This is
268	useful to try out specific backends to test their performance, or to work	283	useful to try out specific backends to test their performance, or to work
269	around bugs.	284	around bugs.
270		285
		286	=item C<EVFLAG_FORKCHECK>
		287
		288	Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
		289	a fork, you can also make libev check for a fork in each iteration by
		290	enabling this flag.
		291
		292	This works by calling C<getpid ()> on every iteration of the loop,
		293	and thus this might slow down your event loop if you do a lot of loop
		294	iterations and little real work, but is usually not noticeable (on my
		295	Linux system for example, C<getpid> is actually a simple 5-insn sequence
		296	without a syscall and thus I<very> fast, but my Linux system also has
		297	C<pthread_atfork> which is even faster).
		298
		299	The big advantage of this flag is that you can forget about fork (and
		300	forget about forgetting to tell libev about forking) when you use this
		301	flag.
		302
		303	This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
		304	environment variable.
		305
271	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	306	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
272		307
273	This is your standard select(2) backend. Not I<completely> standard, as	308	This is your standard select(2) backend. Not I<completely> standard, as
274	libev tries to roll its own fd_set with no limits on the number of fds,	309	libev tries to roll its own fd_set with no limits on the number of fds,
275	but if that fails, expect a fairly low limit on the number of fds when	310	but if that fails, expect a fairly low limit on the number of fds when
…		…
284	lot of inactive fds). It scales similarly to select, i.e. O(total_fds).	319	lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
285		320
286	=item C<EVBACKEND_EPOLL> (value 4, Linux)	321	=item C<EVBACKEND_EPOLL> (value 4, Linux)
287		322
288	For few fds, this backend is a bit little slower than poll and select,	323	For few fds, this backend is a bit little slower than poll and select,
289	but it scales phenomenally better. While poll and select usually scale like	324	but it scales phenomenally better. While poll and select usually scale
290	O(total_fds) where n is the total number of fds (or the highest fd), epoll scales	325	like O(total_fds) where n is the total number of fds (or the highest fd),
291	either O(1) or O(active_fds).	326	epoll scales either O(1) or O(active_fds). The epoll design has a number
		327	of shortcomings, such as silently dropping events in some hard-to-detect
		328	cases and rewiring a syscall per fd change, no fork support and bad
		329	support for dup:
292		330
293	While stopping and starting an I/O watcher in the same iteration will	331	While stopping, setting and starting an I/O watcher in the same iteration
294	result in some caching, there is still a syscall per such incident	332	will result in some caching, there is still a syscall per such incident
295	(because the fd could point to a different file description now), so its	333	(because the fd could point to a different file description now), so its
296	best to avoid that. Also, dup()ed file descriptors might not work very	334	best to avoid that. Also, C<dup ()>'ed file descriptors might not work
297	well if you register events for both fds.	335	very well if you register events for both fds.
298		336
299	Please note that epoll sometimes generates spurious notifications, so you	337	Please note that epoll sometimes generates spurious notifications, so you
300	need to use non-blocking I/O or other means to avoid blocking when no data	338	need to use non-blocking I/O or other means to avoid blocking when no data
301	(or space) is available.	339	(or space) is available.
302		340
303	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	341	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
304		342
305	Kqueue deserves special mention, as at the time of this writing, it	343	Kqueue deserves special mention, as at the time of this writing, it
306	was broken on all BSDs except NetBSD (usually it doesn't work with	344	was broken on all BSDs except NetBSD (usually it doesn't work reliably
307	anything but sockets and pipes, except on Darwin, where of course its	345	with anything but sockets and pipes, except on Darwin, where of course
308	completely useless). For this reason its not being "autodetected"	346	it's completely useless). For this reason it's not being "autodetected"
309	unless you explicitly specify it explicitly in the flags (i.e. using	347	unless you explicitly specify it explicitly in the flags (i.e. using
310	C<EVBACKEND_KQUEUE>).	348	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
		349	system like NetBSD.
		350
		351	You still can embed kqueue into a normal poll or select backend and use it
		352	only for sockets (after having made sure that sockets work with kqueue on
		353	the target platform). See C<ev_embed> watchers for more info.
311		354
312	It scales in the same way as the epoll backend, but the interface to the	355	It scales in the same way as the epoll backend, but the interface to the
313	kernel is more efficient (which says nothing about its actual speed, of	356	kernel is more efficient (which says nothing about its actual speed, of
314	course). While starting and stopping an I/O watcher does not cause an	357	course). While stopping, setting and starting an I/O watcher does never
315	extra syscall as with epoll, it still adds up to four event changes per	358	cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
316	incident, so its best to avoid that.	359	two event changes per incident, support for C<fork ()> is very bad and it
		360	drops fds silently in similarly hard-to-detect cases.
317		361
318	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)	362	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
319		363
320	This is not implemented yet (and might never be).	364	This is not implemented yet (and might never be).
321		365
322	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	366	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
323		367
324	This uses the Solaris 10 port mechanism. As with everything on Solaris,	368	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
325	it's really slow, but it still scales very well (O(active_fds)).	369	it's really slow, but it still scales very well (O(active_fds)).
326		370
327	Please note that solaris ports can result in a lot of spurious	371	Please note that solaris event ports can deliver a lot of spurious
328	notifications, so you need to use non-blocking I/O or other means to avoid	372	notifications, so you need to use non-blocking I/O or other means to avoid
329	blocking when no data (or space) is available.	373	blocking when no data (or space) is available.
330		374
331	=item C<EVBACKEND_ALL>	375	=item C<EVBACKEND_ALL>
332		376
…		…
375	Destroys the default loop again (frees all memory and kernel state	419	Destroys the default loop again (frees all memory and kernel state
376	etc.). None of the active event watchers will be stopped in the normal	420	etc.). None of the active event watchers will be stopped in the normal
377	sense, so e.g. C<ev_is_active> might still return true. It is your	421	sense, so e.g. C<ev_is_active> might still return true. It is your
378	responsibility to either stop all watchers cleanly yoursef I<before>	422	responsibility to either stop all watchers cleanly yoursef I<before>
379	calling this function, or cope with the fact afterwards (which is usually	423	calling this function, or cope with the fact afterwards (which is usually
380	the easiest thing, youc na just ignore the watchers and/or C<free ()> them	424	the easiest thing, you can just ignore the watchers and/or C<free ()> them
381	for example).	425	for example).
		426
		427	Note that certain global state, such as signal state, will not be freed by
		428	this function, and related watchers (such as signal and child watchers)
		429	would need to be stopped manually.
		430
		431	In general it is not advisable to call this function except in the
		432	rare occasion where you really need to free e.g. the signal handling
		433	pipe fds. If you need dynamically allocated loops it is better to use
		434	C<ev_loop_new> and C<ev_loop_destroy>).
382		435
383	=item ev_loop_destroy (loop)	436	=item ev_loop_destroy (loop)
384		437
385	Like C<ev_default_destroy>, but destroys an event loop created by an	438	Like C<ev_default_destroy>, but destroys an event loop created by an
386	earlier call to C<ev_loop_new>.	439	earlier call to C<ev_loop_new>.
…		…
410		463
411	Like C<ev_default_fork>, but acts on an event loop created by	464	Like C<ev_default_fork>, but acts on an event loop created by
412	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	465	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
413	after fork, and how you do this is entirely your own problem.	466	after fork, and how you do this is entirely your own problem.
414		467
		468	=item unsigned int ev_loop_count (loop)
		469
		470	Returns the count of loop iterations for the loop, which is identical to
		471	the number of times libev did poll for new events. It starts at C<0> and
		472	happily wraps around with enough iterations.
		473
		474	This value can sometimes be useful as a generation counter of sorts (it
		475	"ticks" the number of loop iterations), as it roughly corresponds with
		476	C<ev_prepare> and C<ev_check> calls.
		477
415	=item unsigned int ev_backend (loop)	478	=item unsigned int ev_backend (loop)
416		479
417	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	480	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
418	use.	481	use.
419		482
…		…
421		484
422	Returns the current "event loop time", which is the time the event loop	485	Returns the current "event loop time", which is the time the event loop
423	received events and started processing them. This timestamp does not	486	received events and started processing them. This timestamp does not
424	change as long as callbacks are being processed, and this is also the base	487	change as long as callbacks are being processed, and this is also the base
425	time used for relative timers. You can treat it as the timestamp of the	488	time used for relative timers. You can treat it as the timestamp of the
426	event occuring (or more correctly, libev finding out about it).	489	event occurring (or more correctly, libev finding out about it).
427		490
428	=item ev_loop (loop, int flags)	491	=item ev_loop (loop, int flags)
429		492
430	Finally, this is it, the event handler. This function usually is called	493	Finally, this is it, the event handler. This function usually is called
431	after you initialised all your watchers and you want to start handling	494	after you initialised all your watchers and you want to start handling
…		…
452	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	515	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
453	usually a better approach for this kind of thing.	516	usually a better approach for this kind of thing.
454		517
455	Here are the gory details of what C<ev_loop> does:	518	Here are the gory details of what C<ev_loop> does:
456		519
		520	- Before the first iteration, call any pending watchers.
457	* If there are no active watchers (reference count is zero), return.	521	* If there are no active watchers (reference count is zero), return.
458	- Queue prepare watchers and then call all outstanding watchers.	522	- Queue all prepare watchers and then call all outstanding watchers.
459	- If we have been forked, recreate the kernel state.	523	- If we have been forked, recreate the kernel state.
460	- Update the kernel state with all outstanding changes.	524	- Update the kernel state with all outstanding changes.
461	- Update the "event loop time".	525	- Update the "event loop time".
462	- Calculate for how long to block.	526	- Calculate for how long to block.
463	- Block the process, waiting for any events.	527	- Block the process, waiting for any events.
…		…
514	Example: For some weird reason, unregister the above signal handler again.	578	Example: For some weird reason, unregister the above signal handler again.
515		579
516	ev_ref (loop);	580	ev_ref (loop);
517	ev_signal_stop (loop, &exitsig);	581	ev_signal_stop (loop, &exitsig);
518		582
		583	=item ev_set_io_collect_interval (loop, ev_tstamp interval)
		584
		585	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
		586
		587	These advanced functions influence the time that libev will spend waiting
		588	for events. Both are by default C<0>, meaning that libev will try to
		589	invoke timer/periodic callbacks and I/O callbacks with minimum latency.
		590
		591	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
		592	allows libev to delay invocation of I/O and timer/periodic callbacks to
		593	increase efficiency of loop iterations.
		594
		595	The background is that sometimes your program runs just fast enough to
		596	handle one (or very few) event(s) per loop iteration. While this makes
		597	the program responsive, it also wastes a lot of CPU time to poll for new
		598	events, especially with backends like C<select ()> which have a high
		599	overhead for the actual polling but can deliver many events at once.
		600
		601	By setting a higher I<io collect interval> you allow libev to spend more
		602	time collecting I/O events, so you can handle more events per iteration,
		603	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
		604	C<ev_timer>) will be not affected. Setting this to a non-null bvalue will
		605	introduce an additional C<ev_sleep ()> call into most loop iterations.
		606
		607	Likewise, by setting a higher I<timeout collect interval> you allow libev
		608	to spend more time collecting timeouts, at the expense of increased
		609	latency (the watcher callback will be called later). C<ev_io> watchers
		610	will not be affected. Setting this to a non-null value will not introduce
		611	any overhead in libev.
		612
		613	Many (busy) programs can usually benefit by setting the io collect
		614	interval to a value near C<0.1> or so, which is often enough for
		615	interactive servers (of course not for games), likewise for timeouts. It
		616	usually doesn't make much sense to set it to a lower value than C<0.01>,
		617	as this approsaches the timing granularity of most systems.
		618
519	=back	619	=back
520		620
521		621
522	=head1 ANATOMY OF A WATCHER	622	=head1 ANATOMY OF A WATCHER
523		623
…		…
702	=item bool ev_is_pending (ev_TYPE *watcher)	802	=item bool ev_is_pending (ev_TYPE *watcher)
703		803
704	Returns a true value iff the watcher is pending, (i.e. it has outstanding	804	Returns a true value iff the watcher is pending, (i.e. it has outstanding
705	events but its callback has not yet been invoked). As long as a watcher	805	events but its callback has not yet been invoked). As long as a watcher
706	is pending (but not active) you must not call an init function on it (but	806	is pending (but not active) you must not call an init function on it (but
707	C<ev_TYPE_set> is safe) and you must make sure the watcher is available to	807	C<ev_TYPE_set> is safe), you must not change its priority, and you must
708	libev (e.g. you cnanot C<free ()> it).	808	make sure the watcher is available to libev (e.g. you cannot C<free ()>
		809	it).
709		810
710	=item callback ev_cb (ev_TYPE *watcher)	811	=item callback ev_cb (ev_TYPE *watcher)
711		812
712	Returns the callback currently set on the watcher.	813	Returns the callback currently set on the watcher.
713		814
714	=item ev_cb_set (ev_TYPE *watcher, callback)	815	=item ev_cb_set (ev_TYPE *watcher, callback)
715		816
716	Change the callback. You can change the callback at virtually any time	817	Change the callback. You can change the callback at virtually any time
717	(modulo threads).	818	(modulo threads).
		819
		820	=item ev_set_priority (ev_TYPE *watcher, priority)
		821
		822	=item int ev_priority (ev_TYPE *watcher)
		823
		824	Set and query the priority of the watcher. The priority is a small
		825	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
		826	(default: C<-2>). Pending watchers with higher priority will be invoked
		827	before watchers with lower priority, but priority will not keep watchers
		828	from being executed (except for C<ev_idle> watchers).
		829
		830	This means that priorities are I<only> used for ordering callback
		831	invocation after new events have been received. This is useful, for
		832	example, to reduce latency after idling, or more often, to bind two
		833	watchers on the same event and make sure one is called first.
		834
		835	If you need to suppress invocation when higher priority events are pending
		836	you need to look at C<ev_idle> watchers, which provide this functionality.
		837
		838	You I<must not> change the priority of a watcher as long as it is active or
		839	pending.
		840
		841	The default priority used by watchers when no priority has been set is
		842	always C<0>, which is supposed to not be too high and not be too low :).
		843
		844	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		845	fine, as long as you do not mind that the priority value you query might
		846	or might not have been adjusted to be within valid range.
		847
		848	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
		849
		850	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
		851	C<loop> nor C<revents> need to be valid as long as the watcher callback
		852	can deal with that fact.
		853
		854	=item int ev_clear_pending (loop, ev_TYPE *watcher)
		855
		856	If the watcher is pending, this function returns clears its pending status
		857	and returns its C<revents> bitset (as if its callback was invoked). If the
		858	watcher isn't pending it does nothing and returns C<0>.
718		859
719	=back	860	=back
720		861
721		862
722	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	863	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
…		…
828	it is best to always use non-blocking I/O: An extra C<read>(2) returning	969	it is best to always use non-blocking I/O: An extra C<read>(2) returning
829	C<EAGAIN> is far preferable to a program hanging until some data arrives.	970	C<EAGAIN> is far preferable to a program hanging until some data arrives.
830		971
831	If you cannot run the fd in non-blocking mode (for example you should not	972	If you cannot run the fd in non-blocking mode (for example you should not
832	play around with an Xlib connection), then you have to seperately re-test	973	play around with an Xlib connection), then you have to seperately re-test
833	wether a file descriptor is really ready with a known-to-be good interface	974	whether a file descriptor is really ready with a known-to-be good interface
834	such as poll (fortunately in our Xlib example, Xlib already does this on	975	such as poll (fortunately in our Xlib example, Xlib already does this on
835	its own, so its quite safe to use).	976	its own, so its quite safe to use).
		977
		978	=head3 The special problem of disappearing file descriptors
		979
		980	Some backends (e.g. kqueue, epoll) need to be told about closing a file
		981	descriptor (either by calling C<close> explicitly or by any other means,
		982	such as C<dup>). The reason is that you register interest in some file
		983	descriptor, but when it goes away, the operating system will silently drop
		984	this interest. If another file descriptor with the same number then is
		985	registered with libev, there is no efficient way to see that this is, in
		986	fact, a different file descriptor.
		987
		988	To avoid having to explicitly tell libev about such cases, libev follows
		989	the following policy: Each time C<ev_io_set> is being called, libev
		990	will assume that this is potentially a new file descriptor, otherwise
		991	it is assumed that the file descriptor stays the same. That means that
		992	you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
		993	descriptor even if the file descriptor number itself did not change.
		994
		995	This is how one would do it normally anyway, the important point is that
		996	the libev application should not optimise around libev but should leave
		997	optimisations to libev.
		998
		999	=head3 The special problem of dup'ed file descriptors
		1000
		1001	Some backends (e.g. epoll), cannot register events for file descriptors,
		1002	but only events for the underlying file descriptions. That menas when you
		1003	have C<dup ()>'ed file descriptors and register events for them, only one
		1004	file descriptor might actually receive events.
		1005
		1006	There is no workaorund possible except not registering events
		1007	for potentially C<dup ()>'ed file descriptors or to resort to
		1008	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
		1009
		1010	=head3 The special problem of fork
		1011
		1012	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
		1013	useless behaviour. Libev fully supports fork, but needs to be told about
		1014	it in the child.
		1015
		1016	To support fork in your programs, you either have to call
		1017	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
		1018	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
		1019	C<EVBACKEND_POLL>.
		1020
		1021
		1022	=head3 Watcher-Specific Functions
836		1023
837	=over 4	1024	=over 4
838		1025
839	=item ev_io_init (ev_io *, callback, int fd, int events)	1026	=item ev_io_init (ev_io *, callback, int fd, int events)
840		1027
…		…
894		1081
895	The callback is guarenteed to be invoked only when its timeout has passed,	1082	The callback is guarenteed to be invoked only when its timeout has passed,
896	but if multiple timers become ready during the same loop iteration then	1083	but if multiple timers become ready during the same loop iteration then
897	order of execution is undefined.	1084	order of execution is undefined.
898		1085
		1086	=head3 Watcher-Specific Functions and Data Members
		1087
899	=over 4	1088	=over 4
900		1089
901	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1090	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
902		1091
903	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	1092	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
…		…
916	=item ev_timer_again (loop)	1105	=item ev_timer_again (loop)
917		1106
918	This will act as if the timer timed out and restart it again if it is	1107	This will act as if the timer timed out and restart it again if it is
919	repeating. The exact semantics are:	1108	repeating. The exact semantics are:
920		1109
		1110	If the timer is pending, its pending status is cleared.
		1111
921	If the timer is started but nonrepeating, stop it.	1112	If the timer is started but nonrepeating, stop it (as if it timed out).
922		1113
923	If the timer is repeating, either start it if necessary (with the repeat	1114	If the timer is repeating, either start it if necessary (with the
924	value), or reset the running timer to the repeat value.	1115	C<repeat> value), or reset the running timer to the C<repeat> value.
925		1116
926	This sounds a bit complicated, but here is a useful and typical	1117	This sounds a bit complicated, but here is a useful and typical
927	example: Imagine you have a tcp connection and you want a so-called	1118	example: Imagine you have a tcp connection and you want a so-called idle
928	idle timeout, that is, you want to be called when there have been,	1119	timeout, that is, you want to be called when there have been, say, 60
929	say, 60 seconds of inactivity on the socket. The easiest way to do	1120	seconds of inactivity on the socket. The easiest way to do this is to
930	this is to configure an C<ev_timer> with C<after>=C<repeat>=C<60> and calling	1121	configure an C<ev_timer> with a C<repeat> value of C<60> and then call
931	C<ev_timer_again> each time you successfully read or write some data. If	1122	C<ev_timer_again> each time you successfully read or write some data. If
932	you go into an idle state where you do not expect data to travel on the	1123	you go into an idle state where you do not expect data to travel on the
933	socket, you can stop the timer, and again will automatically restart it if	1124	socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
934	need be.	1125	automatically restart it if need be.
935		1126
936	You can also ignore the C<after> value and C<ev_timer_start> altogether	1127	That means you can ignore the C<after> value and C<ev_timer_start>
937	and only ever use the C<repeat> value:	1128	altogether and only ever use the C<repeat> value and C<ev_timer_again>:
938		1129
939	ev_timer_init (timer, callback, 0., 5.);	1130	ev_timer_init (timer, callback, 0., 5.);
940	ev_timer_again (loop, timer);	1131	ev_timer_again (loop, timer);
941	...	1132	...
942	timer->again = 17.;	1133	timer->again = 17.;
943	ev_timer_again (loop, timer);	1134	ev_timer_again (loop, timer);
944	...	1135	...
945	timer->again = 10.;	1136	timer->again = 10.;
946	ev_timer_again (loop, timer);	1137	ev_timer_again (loop, timer);
947		1138
948	This is more efficient then stopping/starting the timer eahc time you want	1139	This is more slightly efficient then stopping/starting the timer each time
949	to modify its timeout value.	1140	you want to modify its timeout value.
950		1141
951	=item ev_tstamp repeat [read-write]	1142	=item ev_tstamp repeat [read-write]
952		1143
953	The current C<repeat> value. Will be used each time the watcher times out	1144	The current C<repeat> value. Will be used each time the watcher times out
954	or C<ev_timer_again> is called and determines the next timeout (if any),	1145	or C<ev_timer_again> is called and determines the next timeout (if any),
…		…
996	but on wallclock time (absolute time). You can tell a periodic watcher	1187	but on wallclock time (absolute time). You can tell a periodic watcher
997	to trigger "at" some specific point in time. For example, if you tell a	1188	to trigger "at" some specific point in time. For example, if you tell a
998	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()	1189	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
999	+ 10.>) and then reset your system clock to the last year, then it will	1190	+ 10.>) and then reset your system clock to the last year, then it will
1000	take a year to trigger the event (unlike an C<ev_timer>, which would trigger	1191	take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1001	roughly 10 seconds later and of course not if you reset your system time	1192	roughly 10 seconds later).
1002	again).
1003		1193
1004	They can also be used to implement vastly more complex timers, such as	1194	They can also be used to implement vastly more complex timers, such as
1005	triggering an event on eahc midnight, local time.	1195	triggering an event on each midnight, local time or other, complicated,
		1196	rules.
1006		1197
1007	As with timers, the callback is guarenteed to be invoked only when the	1198	As with timers, the callback is guarenteed to be invoked only when the
1008	time (C<at>) has been passed, but if multiple periodic timers become ready	1199	time (C<at>) has been passed, but if multiple periodic timers become ready
1009	during the same loop iteration then order of execution is undefined.	1200	during the same loop iteration then order of execution is undefined.
1010		1201
		1202	=head3 Watcher-Specific Functions and Data Members
		1203
1011	=over 4	1204	=over 4
1012		1205
1013	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1206	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1014		1207
1015	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	1208	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
…		…
1017	Lots of arguments, lets sort it out... There are basically three modes of	1210	Lots of arguments, lets sort it out... There are basically three modes of
1018	operation, and we will explain them from simplest to complex:	1211	operation, and we will explain them from simplest to complex:
1019		1212
1020	=over 4	1213	=over 4
1021		1214
1022	=item * absolute timer (interval = reschedule_cb = 0)	1215	=item * absolute timer (at = time, interval = reschedule_cb = 0)
1023		1216
1024	In this configuration the watcher triggers an event at the wallclock time	1217	In this configuration the watcher triggers an event at the wallclock time
1025	C<at> and doesn't repeat. It will not adjust when a time jump occurs,	1218	C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1026	that is, if it is to be run at January 1st 2011 then it will run when the	1219	that is, if it is to be run at January 1st 2011 then it will run when the
1027	system time reaches or surpasses this time.	1220	system time reaches or surpasses this time.
1028		1221
1029	=item * non-repeating interval timer (interval > 0, reschedule_cb = 0)	1222	=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1030		1223
1031	In this mode the watcher will always be scheduled to time out at the next	1224	In this mode the watcher will always be scheduled to time out at the next
1032	C<at + N * interval> time (for some integer N) and then repeat, regardless	1225	C<at + N * interval> time (for some integer N, which can also be negative)
1033	of any time jumps.	1226	and then repeat, regardless of any time jumps.
1034		1227
1035	This can be used to create timers that do not drift with respect to system	1228	This can be used to create timers that do not drift with respect to system
1036	time:	1229	time:
1037		1230
1038	ev_periodic_set (&periodic, 0., 3600., 0);	1231	ev_periodic_set (&periodic, 0., 3600., 0);
…		…
1044		1237
1045	Another way to think about it (for the mathematically inclined) is that	1238	Another way to think about it (for the mathematically inclined) is that
1046	C<ev_periodic> will try to run the callback in this mode at the next possible	1239	C<ev_periodic> will try to run the callback in this mode at the next possible
1047	time where C<time = at (mod interval)>, regardless of any time jumps.	1240	time where C<time = at (mod interval)>, regardless of any time jumps.
1048		1241
		1242	For numerical stability it is preferable that the C<at> value is near
		1243	C<ev_now ()> (the current time), but there is no range requirement for
		1244	this value.
		1245
1049	=item * manual reschedule mode (reschedule_cb = callback)	1246	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1050		1247
1051	In this mode the values for C<interval> and C<at> are both being	1248	In this mode the values for C<interval> and C<at> are both being
1052	ignored. Instead, each time the periodic watcher gets scheduled, the	1249	ignored. Instead, each time the periodic watcher gets scheduled, the
1053	reschedule callback will be called with the watcher as first, and the	1250	reschedule callback will be called with the watcher as first, and the
1054	current time as second argument.	1251	current time as second argument.
1055		1252
1056	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	1253	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1057	ever, or make any event loop modifications>. If you need to stop it,	1254	ever, or make any event loop modifications>. If you need to stop it,
1058	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by	1255	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1059	starting a prepare watcher).	1256	starting an C<ev_prepare> watcher, which is legal).
1060		1257
1061	Its prototype is C<ev_tstamp (reschedule_cb)(struct ev_periodic w,	1258	Its prototype is C<ev_tstamp (reschedule_cb)(struct ev_periodic w,
1062	ev_tstamp now)>, e.g.:	1259	ev_tstamp now)>, e.g.:
1063		1260
1064	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)	1261	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
…		…
1087	Simply stops and restarts the periodic watcher again. This is only useful	1284	Simply stops and restarts the periodic watcher again. This is only useful
1088	when you changed some parameters or the reschedule callback would return	1285	when you changed some parameters or the reschedule callback would return
1089	a different time than the last time it was called (e.g. in a crond like	1286	a different time than the last time it was called (e.g. in a crond like
1090	program when the crontabs have changed).	1287	program when the crontabs have changed).
1091		1288
		1289	=item ev_tstamp offset [read-write]
		1290
		1291	When repeating, this contains the offset value, otherwise this is the
		1292	absolute point in time (the C<at> value passed to C<ev_periodic_set>).
		1293
		1294	Can be modified any time, but changes only take effect when the periodic
		1295	timer fires or C<ev_periodic_again> is being called.
		1296
1092	=item ev_tstamp interval [read-write]	1297	=item ev_tstamp interval [read-write]
1093		1298
1094	The current interval value. Can be modified any time, but changes only	1299	The current interval value. Can be modified any time, but changes only
1095	take effect when the periodic timer fires or C<ev_periodic_again> is being	1300	take effect when the periodic timer fires or C<ev_periodic_again> is being
1096	called.	1301	called.
…		…
1098	=item ev_tstamp (reschedule_cb)(struct ev_periodic w, ev_tstamp now) [read-write]	1303	=item ev_tstamp (reschedule_cb)(struct ev_periodic w, ev_tstamp now) [read-write]
1099		1304
1100	The current reschedule callback, or C<0>, if this functionality is	1305	The current reschedule callback, or C<0>, if this functionality is
1101	switched off. Can be changed any time, but changes only take effect when	1306	switched off. Can be changed any time, but changes only take effect when
1102	the periodic timer fires or C<ev_periodic_again> is being called.	1307	the periodic timer fires or C<ev_periodic_again> is being called.
		1308
		1309	=item ev_tstamp at [read-only]
		1310
		1311	When active, contains the absolute time that the watcher is supposed to
		1312	trigger next.
1103		1313
1104	=back	1314	=back
1105		1315
1106	Example: Call a callback every hour, or, more precisely, whenever the	1316	Example: Call a callback every hour, or, more precisely, whenever the
1107	system clock is divisible by 3600. The callback invocation times have	1317	system clock is divisible by 3600. The callback invocation times have
…		…
1149	with the kernel (thus it coexists with your own signal handlers as long	1359	with the kernel (thus it coexists with your own signal handlers as long
1150	as you don't register any with libev). Similarly, when the last signal	1360	as you don't register any with libev). Similarly, when the last signal
1151	watcher for a signal is stopped libev will reset the signal handler to	1361	watcher for a signal is stopped libev will reset the signal handler to
1152	SIG_DFL (regardless of what it was set to before).	1362	SIG_DFL (regardless of what it was set to before).
1153		1363
		1364	=head3 Watcher-Specific Functions and Data Members
		1365
1154	=over 4	1366	=over 4
1155		1367
1156	=item ev_signal_init (ev_signal *, callback, int signum)	1368	=item ev_signal_init (ev_signal *, callback, int signum)
1157		1369
1158	=item ev_signal_set (ev_signal *, int signum)	1370	=item ev_signal_set (ev_signal *, int signum)
…		…
1169		1381
1170	=head2 C<ev_child> - watch out for process status changes	1382	=head2 C<ev_child> - watch out for process status changes
1171		1383
1172	Child watchers trigger when your process receives a SIGCHLD in response to	1384	Child watchers trigger when your process receives a SIGCHLD in response to
1173	some child status changes (most typically when a child of yours dies).	1385	some child status changes (most typically when a child of yours dies).
		1386
		1387	=head3 Watcher-Specific Functions and Data Members
1174		1388
1175	=over 4	1389	=over 4
1176		1390
1177	=item ev_child_init (ev_child *, callback, int pid)	1391	=item ev_child_init (ev_child *, callback, int pid)
1178		1392
…		…
1246	reader). Inotify will be used to give hints only and should not change the	1460	reader). Inotify will be used to give hints only and should not change the
1247	semantics of C<ev_stat> watchers, which means that libev sometimes needs	1461	semantics of C<ev_stat> watchers, which means that libev sometimes needs
1248	to fall back to regular polling again even with inotify, but changes are	1462	to fall back to regular polling again even with inotify, but changes are
1249	usually detected immediately, and if the file exists there will be no	1463	usually detected immediately, and if the file exists there will be no
1250	polling.	1464	polling.
		1465
		1466	=head3 Watcher-Specific Functions and Data Members
1251		1467
1252	=over 4	1468	=over 4
1253		1469
1254	=item ev_stat_init (ev_stat , callback, const char path, ev_tstamp interval)	1470	=item ev_stat_init (ev_stat , callback, const char path, ev_tstamp interval)
1255		1471
…		…
1319	ev_stat_start (loop, &passwd);	1535	ev_stat_start (loop, &passwd);
1320		1536
1321		1537
1322	=head2 C<ev_idle> - when you've got nothing better to do...	1538	=head2 C<ev_idle> - when you've got nothing better to do...
1323		1539
1324	Idle watchers trigger events when there are no other events are pending	1540	Idle watchers trigger events when no other events of the same or higher
1325	(prepare, check and other idle watchers do not count). That is, as long	1541	priority are pending (prepare, check and other idle watchers do not
1326	as your process is busy handling sockets or timeouts (or even signals,	1542	count).
1327	imagine) it will not be triggered. But when your process is idle all idle	1543
1328	watchers are being called again and again, once per event loop iteration -	1544	That is, as long as your process is busy handling sockets or timeouts
		1545	(or even signals, imagine) of the same or higher priority it will not be
		1546	triggered. But when your process is idle (or only lower-priority watchers
		1547	are pending), the idle watchers are being called once per event loop
1329	until stopped, that is, or your process receives more events and becomes	1548	iteration - until stopped, that is, or your process receives more events
1330	busy.	1549	and becomes busy again with higher priority stuff.
1331		1550
1332	The most noteworthy effect is that as long as any idle watchers are	1551	The most noteworthy effect is that as long as any idle watchers are
1333	active, the process will not block when waiting for new events.	1552	active, the process will not block when waiting for new events.
1334		1553
1335	Apart from keeping your process non-blocking (which is a useful	1554	Apart from keeping your process non-blocking (which is a useful
1336	effect on its own sometimes), idle watchers are a good place to do	1555	effect on its own sometimes), idle watchers are a good place to do
1337	"pseudo-background processing", or delay processing stuff to after the	1556	"pseudo-background processing", or delay processing stuff to after the
1338	event loop has handled all outstanding events.	1557	event loop has handled all outstanding events.
		1558
		1559	=head3 Watcher-Specific Functions and Data Members
1339		1560
1340	=over 4	1561	=over 4
1341		1562
1342	=item ev_idle_init (ev_signal *, callback)	1563	=item ev_idle_init (ev_signal *, callback)
1343		1564
…		…
1401	with priority higher than or equal to the event loop and one coroutine	1622	with priority higher than or equal to the event loop and one coroutine
1402	of lower priority, but only once, using idle watchers to keep the event	1623	of lower priority, but only once, using idle watchers to keep the event
1403	loop from blocking if lower-priority coroutines are active, thus mapping	1624	loop from blocking if lower-priority coroutines are active, thus mapping
1404	low-priority coroutines to idle/background tasks).	1625	low-priority coroutines to idle/background tasks).
1405		1626
		1627	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
		1628	priority, to ensure that they are being run before any other watchers
		1629	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
		1630	too) should not activate ("feed") events into libev. While libev fully
		1631	supports this, they will be called before other C<ev_check> watchers
		1632	did their job. As C<ev_check> watchers are often used to embed other
		1633	(non-libev) event loops those other event loops might be in an unusable
		1634	state until their C<ev_check> watcher ran (always remind yourself to
		1635	coexist peacefully with others).
		1636
		1637	=head3 Watcher-Specific Functions and Data Members
		1638
1406	=over 4	1639	=over 4
1407		1640
1408	=item ev_prepare_init (ev_prepare *, callback)	1641	=item ev_prepare_init (ev_prepare *, callback)
1409		1642
1410	=item ev_check_init (ev_check *, callback)	1643	=item ev_check_init (ev_check *, callback)
…		…
1413	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>	1646	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1414	macros, but using them is utterly, utterly and completely pointless.	1647	macros, but using them is utterly, utterly and completely pointless.
1415		1648
1416	=back	1649	=back
1417		1650
1418	Example: To include a library such as adns, you would add IO watchers	1651	There are a number of principal ways to embed other event loops or modules
1419	and a timeout watcher in a prepare handler, as required by libadns, and	1652	into libev. Here are some ideas on how to include libadns into libev
		1653	(there is a Perl module named C<EV::ADNS> that does this, which you could
		1654	use for an actually working example. Another Perl module named C<EV::Glib>
		1655	embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
		1656	into the Glib event loop).
		1657
		1658	Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1420	in a check watcher, destroy them and call into libadns. What follows is	1659	and in a check watcher, destroy them and call into libadns. What follows
1421	pseudo-code only of course:	1660	is pseudo-code only of course. This requires you to either use a low
		1661	priority for the check watcher or use C<ev_clear_pending> explicitly, as
		1662	the callbacks for the IO/timeout watchers might not have been called yet.
1422		1663
1423	static ev_io iow [nfd];	1664	static ev_io iow [nfd];
1424	static ev_timer tw;	1665	static ev_timer tw;
1425		1666
1426	static void	1667	static void
1427	io_cb (ev_loop loop, ev_io w, int revents)	1668	io_cb (ev_loop loop, ev_io w, int revents)
1428	{	1669	{
1429	// set the relevant poll flags
1430	// could also call adns_processreadable etc. here
1431	struct pollfd fd = (struct pollfd )w->data;
1432	if (revents & EV_READ ) fd->revents \|= fd->events & POLLIN;
1433	if (revents & EV_WRITE) fd->revents \|= fd->events & POLLOUT;
1434	}	1670	}
1435		1671
1436	// create io watchers for each fd and a timer before blocking	1672	// create io watchers for each fd and a timer before blocking
1437	static void	1673	static void
1438	adns_prepare_cb (ev_loop loop, ev_prepare w, int revents)	1674	adns_prepare_cb (ev_loop loop, ev_prepare w, int revents)
1439	{	1675	{
1440	int timeout = 3600000;truct pollfd fds [nfd];	1676	int timeout = 3600000;
		1677	struct pollfd fds [nfd];
1441	// actual code will need to loop here and realloc etc.	1678	// actual code will need to loop here and realloc etc.
1442	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	1679	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1443		1680
1444	/* the callback is illegal, but won't be called as we stop during check */	1681	/* the callback is illegal, but won't be called as we stop during check */
1445	ev_timer_init (&tw, 0, timeout * 1e-3);	1682	ev_timer_init (&tw, 0, timeout * 1e-3);
1446	ev_timer_start (loop, &tw);	1683	ev_timer_start (loop, &tw);
1447		1684
1448	// create on ev_io per pollfd	1685	// create one ev_io per pollfd
1449	for (int i = 0; i < nfd; ++i)	1686	for (int i = 0; i < nfd; ++i)
1450	{	1687	{
1451	ev_io_init (iow + i, io_cb, fds [i].fd,	1688	ev_io_init (iow + i, io_cb, fds [i].fd,
1452	((fds [i].events & POLLIN ? EV_READ : 0)	1689	((fds [i].events & POLLIN ? EV_READ : 0)
1453	\| (fds [i].events & POLLOUT ? EV_WRITE : 0)));	1690	\| (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1454		1691
1455	fds [i].revents = 0;	1692	fds [i].revents = 0;
1456	iow [i].data = fds + i;
1457	ev_io_start (loop, iow + i);	1693	ev_io_start (loop, iow + i);
1458	}	1694	}
1459	}	1695	}
1460		1696
1461	// stop all watchers after blocking	1697	// stop all watchers after blocking
…		…
1463	adns_check_cb (ev_loop loop, ev_check w, int revents)	1699	adns_check_cb (ev_loop loop, ev_check w, int revents)
1464	{	1700	{
1465	ev_timer_stop (loop, &tw);	1701	ev_timer_stop (loop, &tw);
1466		1702
1467	for (int i = 0; i < nfd; ++i)	1703	for (int i = 0; i < nfd; ++i)
		1704	{
		1705	// set the relevant poll flags
		1706	// could also call adns_processreadable etc. here
		1707	struct pollfd *fd = fds + i;
		1708	int revents = ev_clear_pending (iow + i);
		1709	if (revents & EV_READ ) fd->revents \|= fd->events & POLLIN;
		1710	if (revents & EV_WRITE) fd->revents \|= fd->events & POLLOUT;
		1711
		1712	// now stop the watcher
1468	ev_io_stop (loop, iow + i);	1713	ev_io_stop (loop, iow + i);
		1714	}
1469		1715
1470	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));	1716	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
		1717	}
		1718
		1719	Method 2: This would be just like method 1, but you run C<adns_afterpoll>
		1720	in the prepare watcher and would dispose of the check watcher.
		1721
		1722	Method 3: If the module to be embedded supports explicit event
		1723	notification (adns does), you can also make use of the actual watcher
		1724	callbacks, and only destroy/create the watchers in the prepare watcher.
		1725
		1726	static void
		1727	timer_cb (EV_P_ ev_timer *w, int revents)
		1728	{
		1729	adns_state ads = (adns_state)w->data;
		1730	update_now (EV_A);
		1731
		1732	adns_processtimeouts (ads, &tv_now);
		1733	}
		1734
		1735	static void
		1736	io_cb (EV_P_ ev_io *w, int revents)
		1737	{
		1738	adns_state ads = (adns_state)w->data;
		1739	update_now (EV_A);
		1740
		1741	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
		1742	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
		1743	}
		1744
		1745	// do not ever call adns_afterpoll
		1746
		1747	Method 4: Do not use a prepare or check watcher because the module you
		1748	want to embed is too inflexible to support it. Instead, youc na override
		1749	their poll function. The drawback with this solution is that the main
		1750	loop is now no longer controllable by EV. The C<Glib::EV> module does
		1751	this.
		1752
		1753	static gint
		1754	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
		1755	{
		1756	int got_events = 0;
		1757
		1758	for (n = 0; n < nfds; ++n)
		1759	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events
		1760
		1761	if (timeout >= 0)
		1762	// create/start timer
		1763
		1764	// poll
		1765	ev_loop (EV_A_ 0);
		1766
		1767	// stop timer again
		1768	if (timeout >= 0)
		1769	ev_timer_stop (EV_A_ &to);
		1770
		1771	// stop io watchers again - their callbacks should have set
		1772	for (n = 0; n < nfds; ++n)
		1773	ev_io_stop (EV_A_ iow [n]);
		1774
		1775	return got_events;
1471	}	1776	}
1472		1777
1473		1778
1474	=head2 C<ev_embed> - when one backend isn't enough...	1779	=head2 C<ev_embed> - when one backend isn't enough...
1475		1780
…		…
1539	ev_embed_start (loop_hi, &embed);	1844	ev_embed_start (loop_hi, &embed);
1540	}	1845	}
1541	else	1846	else
1542	loop_lo = loop_hi;	1847	loop_lo = loop_hi;
1543		1848
		1849	=head3 Watcher-Specific Functions and Data Members
		1850
1544	=over 4	1851	=over 4
1545		1852
1546	=item ev_embed_init (ev_embed , callback, struct ev_loop embedded_loop)	1853	=item ev_embed_init (ev_embed , callback, struct ev_loop embedded_loop)
1547		1854
1548	=item ev_embed_set (ev_embed , callback, struct ev_loop embedded_loop)	1855	=item ev_embed_set (ev_embed , callback, struct ev_loop embedded_loop)
…		…
1557		1864
1558	Make a single, non-blocking sweep over the embedded loop. This works	1865	Make a single, non-blocking sweep over the embedded loop. This works
1559	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most	1866	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1560	apropriate way for embedded loops.	1867	apropriate way for embedded loops.
1561		1868
1562	=item struct ev_loop *loop [read-only]	1869	=item struct ev_loop *other [read-only]
1563		1870
1564	The embedded event loop.	1871	The embedded event loop.
1565		1872
1566	=back	1873	=back
1567		1874
…		…
1574	event loop blocks next and before C<ev_check> watchers are being called,	1881	event loop blocks next and before C<ev_check> watchers are being called,
1575	and only in the child after the fork. If whoever good citizen calling	1882	and only in the child after the fork. If whoever good citizen calling
1576	C<ev_default_fork> cheats and calls it in the wrong process, the fork	1883	C<ev_default_fork> cheats and calls it in the wrong process, the fork
1577	handlers will be invoked, too, of course.	1884	handlers will be invoked, too, of course.
1578		1885
		1886	=head3 Watcher-Specific Functions and Data Members
		1887
1579	=over 4	1888	=over 4
1580		1889
1581	=item ev_fork_init (ev_signal *, callback)	1890	=item ev_fork_init (ev_signal *, callback)
1582		1891
1583	Initialises and configures the fork watcher - it has no parameters of any	1892	Initialises and configures the fork watcher - it has no parameters of any
…		…
1679		1988
1680	To use it,	1989	To use it,
1681		1990
1682	#include <ev++.h>	1991	#include <ev++.h>
1683		1992
1684	(it is not installed by default). This automatically includes F<ev.h>	1993	This automatically includes F<ev.h> and puts all of its definitions (many
1685	and puts all of its definitions (many of them macros) into the global	1994	of them macros) into the global namespace. All C++ specific things are
1686	namespace. All C++ specific things are put into the C<ev> namespace.	1995	put into the C<ev> namespace. It should support all the same embedding
		1996	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1687		1997
1688	It should support all the same embedding options as F<ev.h>, most notably	1998	Care has been taken to keep the overhead low. The only data member the C++
1689	C<EV_MULTIPLICITY>.	1999	classes add (compared to plain C-style watchers) is the event loop pointer
		2000	that the watcher is associated with (or no additional members at all if
		2001	you disable C<EV_MULTIPLICITY> when embedding libev).
		2002
		2003	Currently, functions, and static and non-static member functions can be
		2004	used as callbacks. Other types should be easy to add as long as they only
		2005	need one additional pointer for context. If you need support for other
		2006	types of functors please contact the author (preferably after implementing
		2007	it).
1690		2008
1691	Here is a list of things available in the C<ev> namespace:	2009	Here is a list of things available in the C<ev> namespace:
1692		2010
1693	=over 4	2011	=over 4
1694		2012
…		…
1710		2028
1711	All of those classes have these methods:	2029	All of those classes have these methods:
1712		2030
1713	=over 4	2031	=over 4
1714		2032
1715	=item ev::TYPE::TYPE (object , object::method )	2033	=item ev::TYPE::TYPE ()
1716		2034
1717	=item ev::TYPE::TYPE (object , object::method , struct ev_loop *)	2035	=item ev::TYPE::TYPE (struct ev_loop *)
1718		2036
1719	=item ev::TYPE::~TYPE	2037	=item ev::TYPE::~TYPE
1720		2038
1721	The constructor takes a pointer to an object and a method pointer to	2039	The constructor (optionally) takes an event loop to associate the watcher
1722	the event handler callback to call in this class. The constructor calls	2040	with. If it is omitted, it will use C<EV_DEFAULT>.
1723	C<ev_init> for you, which means you have to call the C<set> method	2041
1724	before starting it. If you do not specify a loop then the constructor	2042	The constructor calls C<ev_init> for you, which means you have to call the
1725	automatically associates the default loop with this watcher.	2043	C<set> method before starting it.
		2044
		2045	It will not set a callback, however: You have to call the templated C<set>
		2046	method to set a callback before you can start the watcher.
		2047
		2048	(The reason why you have to use a method is a limitation in C++ which does
		2049	not allow explicit template arguments for constructors).
1726		2050
1727	The destructor automatically stops the watcher if it is active.	2051	The destructor automatically stops the watcher if it is active.
		2052
		2053	=item w->set<class, &class::method> (object *)
		2054
		2055	This method sets the callback method to call. The method has to have a
		2056	signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
		2057	first argument and the C<revents> as second. The object must be given as
		2058	parameter and is stored in the C<data> member of the watcher.
		2059
		2060	This method synthesizes efficient thunking code to call your method from
		2061	the C callback that libev requires. If your compiler can inline your
		2062	callback (i.e. it is visible to it at the place of the C<set> call and
		2063	your compiler is good :), then the method will be fully inlined into the
		2064	thunking function, making it as fast as a direct C callback.
		2065
		2066	Example: simple class declaration and watcher initialisation
		2067
		2068	struct myclass
		2069	{
		2070	void io_cb (ev::io &w, int revents) { }
		2071	}
		2072
		2073	myclass obj;
		2074	ev::io iow;
		2075	iow.set <myclass, &myclass::io_cb> (&obj);
		2076
		2077	=item w->set<function> (void *data = 0)
		2078
		2079	Also sets a callback, but uses a static method or plain function as
		2080	callback. The optional C<data> argument will be stored in the watcher's
		2081	C<data> member and is free for you to use.
		2082
		2083	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
		2084
		2085	See the method-C<set> above for more details.
		2086
		2087	Example:
		2088
		2089	static void io_cb (ev::io &w, int revents) { }
		2090	iow.set <io_cb> ();
1728		2091
1729	=item w->set (struct ev_loop *)	2092	=item w->set (struct ev_loop *)
1730		2093
1731	Associates a different C<struct ev_loop> with this watcher. You can only	2094	Associates a different C<struct ev_loop> with this watcher. You can only
1732	do this when the watcher is inactive (and not pending either).	2095	do this when the watcher is inactive (and not pending either).
1733		2096
1734	=item w->set ([args])	2097	=item w->set ([args])
1735		2098
1736	Basically the same as C<ev_TYPE_set>, with the same args. Must be	2099	Basically the same as C<ev_TYPE_set>, with the same args. Must be
1737	called at least once. Unlike the C counterpart, an active watcher gets	2100	called at least once. Unlike the C counterpart, an active watcher gets
1738	automatically stopped and restarted.	2101	automatically stopped and restarted when reconfiguring it with this
		2102	method.
1739		2103
1740	=item w->start ()	2104	=item w->start ()
1741		2105
1742	Starts the watcher. Note that there is no C<loop> argument as the	2106	Starts the watcher. Note that there is no C<loop> argument, as the
1743	constructor already takes the loop.	2107	constructor already stores the event loop.
1744		2108
1745	=item w->stop ()	2109	=item w->stop ()
1746		2110
1747	Stops the watcher if it is active. Again, no C<loop> argument.	2111	Stops the watcher if it is active. Again, no C<loop> argument.
1748		2112
1749	=item w->again () C<ev::timer>, C<ev::periodic> only	2113	=item w->again () (C<ev::timer>, C<ev::periodic> only)
1750		2114
1751	For C<ev::timer> and C<ev::periodic>, this invokes the corresponding	2115	For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1752	C<ev_TYPE_again> function.	2116	C<ev_TYPE_again> function.
1753		2117
1754	=item w->sweep () C<ev::embed> only	2118	=item w->sweep () (C<ev::embed> only)
1755		2119
1756	Invokes C<ev_embed_sweep>.	2120	Invokes C<ev_embed_sweep>.
1757		2121
1758	=item w->update () C<ev::stat> only	2122	=item w->update () (C<ev::stat> only)
1759		2123
1760	Invokes C<ev_stat_stat>.	2124	Invokes C<ev_stat_stat>.
1761		2125
1762	=back	2126	=back
1763		2127
…		…
1773		2137
1774	myclass ();	2138	myclass ();
1775	}	2139	}
1776		2140
1777	myclass::myclass (int fd)	2141	myclass::myclass (int fd)
1778	: io (this, &myclass::io_cb),
1779	idle (this, &myclass::idle_cb)
1780	{	2142	{
		2143	io .set <myclass, &myclass::io_cb > (this);
		2144	idle.set <myclass, &myclass::idle_cb> (this);
		2145
1781	io.start (fd, ev::READ);	2146	io.start (fd, ev::READ);
1782	}	2147	}
1783		2148
1784		2149
1785	=head1 MACRO MAGIC	2150	=head1 MACRO MAGIC
1786		2151
1787	Libev can be compiled with a variety of options, the most fundemantal is	2152	Libev can be compiled with a variety of options, the most fundamantal
1788	C<EV_MULTIPLICITY>. This option determines wether (most) functions and	2153	of which is C<EV_MULTIPLICITY>. This option determines whether (most)
1789	callbacks have an initial C<struct ev_loop *> argument.	2154	functions and callbacks have an initial C<struct ev_loop *> argument.
1790		2155
1791	To make it easier to write programs that cope with either variant, the	2156	To make it easier to write programs that cope with either variant, the
1792	following macros are defined:	2157	following macros are defined:
1793		2158
1794	=over 4	2159	=over 4
…		…
1826	Similar to the other two macros, this gives you the value of the default	2191	Similar to the other two macros, this gives you the value of the default
1827	loop, if multiple loops are supported ("ev loop default").	2192	loop, if multiple loops are supported ("ev loop default").
1828		2193
1829	=back	2194	=back
1830		2195
1831	Example: Declare and initialise a check watcher, working regardless of	2196	Example: Declare and initialise a check watcher, utilising the above
1832	wether multiple loops are supported or not.	2197	macros so it will work regardless of whether multiple loops are supported
		2198	or not.
1833		2199
1834	static void	2200	static void
1835	check_cb (EV_P_ ev_timer *w, int revents)	2201	check_cb (EV_P_ ev_timer *w, int revents)
1836	{	2202	{
1837	ev_check_stop (EV_A_ w);	2203	ev_check_stop (EV_A_ w);
…		…
1840	ev_check check;	2206	ev_check check;
1841	ev_check_init (&check, check_cb);	2207	ev_check_init (&check, check_cb);
1842	ev_check_start (EV_DEFAULT_ &check);	2208	ev_check_start (EV_DEFAULT_ &check);
1843	ev_loop (EV_DEFAULT_ 0);	2209	ev_loop (EV_DEFAULT_ 0);
1844		2210
1845
1846	=head1 EMBEDDING	2211	=head1 EMBEDDING
1847		2212
1848	Libev can (and often is) directly embedded into host	2213	Libev can (and often is) directly embedded into host
1849	applications. Examples of applications that embed it include the Deliantra	2214	applications. Examples of applications that embed it include the Deliantra
1850	Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)	2215	Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1851	and rxvt-unicode.	2216	and rxvt-unicode.
1852		2217
1853	The goal is to enable you to just copy the neecssary files into your	2218	The goal is to enable you to just copy the necessary files into your
1854	source directory without having to change even a single line in them, so	2219	source directory without having to change even a single line in them, so
1855	you can easily upgrade by simply copying (or having a checked-out copy of	2220	you can easily upgrade by simply copying (or having a checked-out copy of
1856	libev somewhere in your source tree).	2221	libev somewhere in your source tree).
1857		2222
1858	=head2 FILESETS	2223	=head2 FILESETS
…		…
1889	ev_vars.h	2254	ev_vars.h
1890	ev_wrap.h	2255	ev_wrap.h
1891		2256
1892	ev_win32.c required on win32 platforms only	2257	ev_win32.c required on win32 platforms only
1893		2258
1894	ev_select.c only when select backend is enabled (which is by default)	2259	ev_select.c only when select backend is enabled (which is enabled by default)
1895	ev_poll.c only when poll backend is enabled (disabled by default)	2260	ev_poll.c only when poll backend is enabled (disabled by default)
1896	ev_epoll.c only when the epoll backend is enabled (disabled by default)	2261	ev_epoll.c only when the epoll backend is enabled (disabled by default)
1897	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	2262	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1898	ev_port.c only when the solaris port backend is enabled (disabled by default)	2263	ev_port.c only when the solaris port backend is enabled (disabled by default)
1899		2264
…		…
1948		2313
1949	If defined to be C<1>, libev will try to detect the availability of the	2314	If defined to be C<1>, libev will try to detect the availability of the
1950	monotonic clock option at both compiletime and runtime. Otherwise no use	2315	monotonic clock option at both compiletime and runtime. Otherwise no use
1951	of the monotonic clock option will be attempted. If you enable this, you	2316	of the monotonic clock option will be attempted. If you enable this, you
1952	usually have to link against librt or something similar. Enabling it when	2317	usually have to link against librt or something similar. Enabling it when
1953	the functionality isn't available is safe, though, althoguh you have	2318	the functionality isn't available is safe, though, although you have
1954	to make sure you link against any libraries where the C<clock_gettime>	2319	to make sure you link against any libraries where the C<clock_gettime>
1955	function is hiding in (often F<-lrt>).	2320	function is hiding in (often F<-lrt>).
1956		2321
1957	=item EV_USE_REALTIME	2322	=item EV_USE_REALTIME
1958		2323
1959	If defined to be C<1>, libev will try to detect the availability of the	2324	If defined to be C<1>, libev will try to detect the availability of the
1960	realtime clock option at compiletime (and assume its availability at	2325	realtime clock option at compiletime (and assume its availability at
1961	runtime if successful). Otherwise no use of the realtime clock option will	2326	runtime if successful). Otherwise no use of the realtime clock option will
1962	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	2327	be attempted. This effectively replaces C<gettimeofday> by C<clock_get
1963	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries	2328	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
1964	in the description of C<EV_USE_MONOTONIC>, though.	2329	note about libraries in the description of C<EV_USE_MONOTONIC>, though.
		2330
		2331	=item EV_USE_NANOSLEEP
		2332
		2333	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
		2334	and will use it for delays. Otherwise it will use C<select ()>.
1965		2335
1966	=item EV_USE_SELECT	2336	=item EV_USE_SELECT
1967		2337
1968	If undefined or defined to be C<1>, libev will compile in support for the	2338	If undefined or defined to be C<1>, libev will compile in support for the
1969	C<select>(2) backend. No attempt at autodetection will be done: if no	2339	C<select>(2) backend. No attempt at autodetection will be done: if no
…		…
2062	will have the C<struct ev_loop *> as first argument, and you can create	2432	will have the C<struct ev_loop *> as first argument, and you can create
2063	additional independent event loops. Otherwise there will be no support	2433	additional independent event loops. Otherwise there will be no support
2064	for multiple event loops and there is no first event loop pointer	2434	for multiple event loops and there is no first event loop pointer
2065	argument. Instead, all functions act on the single default loop.	2435	argument. Instead, all functions act on the single default loop.
2066		2436
		2437	=item EV_MINPRI
		2438
		2439	=item EV_MAXPRI
		2440
		2441	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
		2442	C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
		2443	provide for more priorities by overriding those symbols (usually defined
		2444	to be C<-2> and C<2>, respectively).
		2445
		2446	When doing priority-based operations, libev usually has to linearly search
		2447	all the priorities, so having many of them (hundreds) uses a lot of space
		2448	and time, so using the defaults of five priorities (-2 .. +2) is usually
		2449	fine.
		2450
		2451	If your embedding app does not need any priorities, defining these both to
		2452	C<0> will save some memory and cpu.
		2453
2067	=item EV_PERIODIC_ENABLE	2454	=item EV_PERIODIC_ENABLE
2068		2455
2069	If undefined or defined to be C<1>, then periodic timers are supported. If	2456	If undefined or defined to be C<1>, then periodic timers are supported. If
		2457	defined to be C<0>, then they are not. Disabling them saves a few kB of
		2458	code.
		2459
		2460	=item EV_IDLE_ENABLE
		2461
		2462	If undefined or defined to be C<1>, then idle watchers are supported. If
2070	defined to be C<0>, then they are not. Disabling them saves a few kB of	2463	defined to be C<0>, then they are not. Disabling them saves a few kB of
2071	code.	2464	code.
2072		2465
2073	=item EV_EMBED_ENABLE	2466	=item EV_EMBED_ENABLE
2074		2467
…		…
2125		2518
2126	=item ev_set_cb (ev, cb)	2519	=item ev_set_cb (ev, cb)
2127		2520
2128	Can be used to change the callback member declaration in each watcher,	2521	Can be used to change the callback member declaration in each watcher,
2129	and the way callbacks are invoked and set. Must expand to a struct member	2522	and the way callbacks are invoked and set. Must expand to a struct member
2130	definition and a statement, respectively. See the F<ev.v> header file for	2523	definition and a statement, respectively. See the F<ev.h> header file for
2131	their default definitions. One possible use for overriding these is to	2524	their default definitions. One possible use for overriding these is to
2132	avoid the C<struct ev_loop *> as first argument in all cases, or to use	2525	avoid the C<struct ev_loop *> as first argument in all cases, or to use
2133	method calls instead of plain function calls in C++.	2526	method calls instead of plain function calls in C++.
		2527
		2528	=head2 EXPORTED API SYMBOLS
		2529
		2530	If you need to re-export the API (e.g. via a dll) and you need a list of
		2531	exported symbols, you can use the provided F<Symbol.*> files which list
		2532	all public symbols, one per line:
		2533
		2534	Symbols.ev for libev proper
		2535	Symbols.event for the libevent emulation
		2536
		2537	This can also be used to rename all public symbols to avoid clashes with
		2538	multiple versions of libev linked together (which is obviously bad in
		2539	itself, but sometimes it is inconvinient to avoid this).
		2540
		2541	A sed command like this will create wrapper C<#define>'s that you need to
		2542	include before including F<ev.h>:
		2543
		2544	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
		2545
		2546	This would create a file F<wrap.h> which essentially looks like this:
		2547
		2548	#define ev_backend myprefix_ev_backend
		2549	#define ev_check_start myprefix_ev_check_start
		2550	#define ev_check_stop myprefix_ev_check_stop
		2551	...
2134		2552
2135	=head2 EXAMPLES	2553	=head2 EXAMPLES
2136		2554
2137	For a real-world example of a program the includes libev	2555	For a real-world example of a program the includes libev
2138	verbatim, you can have a look at the EV perl module	2556	verbatim, you can have a look at the EV perl module
…		…
2141	interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file	2559	interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2142	will be compiled. It is pretty complex because it provides its own header	2560	will be compiled. It is pretty complex because it provides its own header
2143	file.	2561	file.
2144		2562
2145	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	2563	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2146	that everybody includes and which overrides some autoconf choices:	2564	that everybody includes and which overrides some configure choices:
2147		2565
		2566	#define EV_MINIMAL 1
2148	#define EV_USE_POLL 0	2567	#define EV_USE_POLL 0
2149	#define EV_MULTIPLICITY 0	2568	#define EV_MULTIPLICITY 0
2150	#define EV_PERIODICS 0	2569	#define EV_PERIODIC_ENABLE 0
		2570	#define EV_STAT_ENABLE 0
		2571	#define EV_FORK_ENABLE 0
2151	#define EV_CONFIG_H <config.h>	2572	#define EV_CONFIG_H <config.h>
		2573	#define EV_MINPRI 0
		2574	#define EV_MAXPRI 0
2152		2575
2153	#include "ev++.h"	2576	#include "ev++.h"
2154		2577
2155	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	2578	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2156		2579
…		…
2162		2585
2163	In this section the complexities of (many of) the algorithms used inside	2586	In this section the complexities of (many of) the algorithms used inside
2164	libev will be explained. For complexity discussions about backends see the	2587	libev will be explained. For complexity discussions about backends see the
2165	documentation for C<ev_default_init>.	2588	documentation for C<ev_default_init>.
2166		2589
		2590	All of the following are about amortised time: If an array needs to be
		2591	extended, libev needs to realloc and move the whole array, but this
		2592	happens asymptotically never with higher number of elements, so O(1) might
		2593	mean it might do a lengthy realloc operation in rare cases, but on average
		2594	it is much faster and asymptotically approaches constant time.
		2595
2167	=over 4	2596	=over 4
2168		2597
2169	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)	2598	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2170		2599
		2600	This means that, when you have a watcher that triggers in one hour and
		2601	there are 100 watchers that would trigger before that then inserting will
		2602	have to skip those 100 watchers.
		2603
2171	=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)	2604	=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2172		2605
		2606	That means that for changing a timer costs less than removing/adding them
		2607	as only the relative motion in the event queue has to be paid for.
		2608
2173	=item Starting io/check/prepare/idle/signal/child watchers: O(1)	2609	=item Starting io/check/prepare/idle/signal/child watchers: O(1)
2174		2610
		2611	These just add the watcher into an array or at the head of a list.
2175	=item Stopping check/prepare/idle watchers: O(1)	2612	=item Stopping check/prepare/idle watchers: O(1)
2176		2613
2177	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	2614	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2178		2615
		2616	These watchers are stored in lists then need to be walked to find the
		2617	correct watcher to remove. The lists are usually short (you don't usually
		2618	have many watchers waiting for the same fd or signal).
		2619
2179	=item Finding the next timer per loop iteration: O(1)	2620	=item Finding the next timer per loop iteration: O(1)
2180		2621
2181	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)	2622	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2182		2623
		2624	A change means an I/O watcher gets started or stopped, which requires
		2625	libev to recalculate its status (and possibly tell the kernel).
		2626
2183	=item Activating one watcher: O(1)	2627	=item Activating one watcher: O(1)
2184		2628
		2629	=item Priority handling: O(number_of_priorities)
		2630
		2631	Priorities are implemented by allocating some space for each
		2632	priority. When doing priority-based operations, libev usually has to
		2633	linearly search all the priorities.
		2634
2185	=back	2635	=back
2186		2636
2187		2637
2188	=head1 AUTHOR	2638	=head1 AUTHOR
2189		2639

Diff Legend

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

Comparing libev/ev.pod (file contents): Revision 1.60 by root, Wed Nov 28 18:29:30 2007 UTC vs. Revision 1.100 by root, Sat Dec 22 11:49:17 2007 UTC

Diff Legend

Comparing libev/ev.pod (file contents):
Revision 1.60 by root, Wed Nov 28 18:29:30 2007 UTC vs.
Revision 1.100 by root, Sat Dec 22 11:49:17 2007 UTC