ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.58 by root, Wed Nov 28 11:31:34 2007 UTC vs.
Revision 1.134 by root, Sat Mar 8 07:04:56 2008 UTC

…		…
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	#include <ev.h>	7	#include <ev.h>
8		8
9	=head1 EXAMPLE PROGRAM	9	=head2 EXAMPLE PROGRAM
10		10
11	#include <ev.h>	11	#include <ev.h>
12		12
13	ev_io stdin_watcher;	13	ev_io stdin_watcher;
14	ev_timer timeout_watcher;	14	ev_timer timeout_watcher;
…		…
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.
…		…
61	You register interest in certain events by registering so-called I<event	65	You register interest in certain events by registering so-called I<event
62	watchers>, which are relatively small C structures you initialise with the	66	watchers>, which are relatively small C structures you initialise with the
63	details of the event, and then hand it over to libev by I<starting> the	67	details of the event, and then hand it over to libev by I<starting> the
64	watcher.	68	watcher.
65		69
66	=head1 FEATURES	70	=head2 FEATURES
67		71
68	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the	72	Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
69	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms	73	BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
70	for file descriptor events (C<ev_io>), the Linux C<inotify> interface	74	for file descriptor events (C<ev_io>), the Linux C<inotify> interface
71	(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers	75	(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
…		…
78		82
79	It also is quite fast (see this	83	It also is quite fast (see this
80	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent	84	L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
81	for example).	85	for example).
82		86
83	=head1 CONVENTIONS	87	=head2 CONVENTIONS
84		88
85	Libev is very configurable. In this manual the default configuration will	89	Libev is very configurable. In this manual the default configuration will
86	be described, which supports multiple event loops. For more info about	90	be described, which supports multiple event loops. For more info about
87	various configuration options please have a look at B<EMBED> section in	91	various configuration options please have a look at B<EMBED> section in
88	this manual. If libev was configured without support for multiple event	92	this manual. If libev was configured without support for multiple event
89	loops, then all functions taking an initial argument of name C<loop>	93	loops, then all functions taking an initial argument of name C<loop>
90	(which is always of type C<struct ev_loop *>) will not have this argument.	94	(which is always of type C<struct ev_loop *>) will not have this argument.
91		95
92	=head1 TIME REPRESENTATION	96	=head2 TIME REPRESENTATION
93		97
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.
…		…
163	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	178	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
164	recommended ones.	179	recommended ones.
165		180
166	See the description of C<ev_embed> watchers for more info.	181	See the description of C<ev_embed> watchers for more info.
167		182
168	=item ev_set_allocator (void *(*cb)(void *ptr, size_t size))	183	=item ev_set_allocator (void *(*cb)(void *ptr, long size))
169		184
170	Sets the allocation function to use (the prototype and semantics are	185	Sets the allocation function to use (the prototype is similar - the
171	identical to the realloc C function). It is used to allocate and free	186	semantics is identical - to the realloc C function). It is used to
172	memory (no surprises here). If it returns zero when memory needs to be	187	allocate and free memory (no surprises here). If it returns zero when
173	allocated, the library might abort or take some potentially destructive	188	memory needs to be allocated, the library might abort or take some
174	action. The default is your system realloc function.	189	potentially destructive action. The default is your system realloc
		190	function.
175		191
176	You could override this function in high-availability programs to, say,	192	You could override this function in high-availability programs to, say,
177	free some memory if it cannot allocate memory, to use a special allocator,	193	free some memory if it cannot allocate memory, to use a special allocator,
178	or even to sleep a while and retry until some memory is available.	194	or even to sleep a while and retry until some memory is available.
179		195
…		…
244	flags. If that is troubling you, check C<ev_backend ()> afterwards).	260	flags. If that is troubling you, check C<ev_backend ()> afterwards).
245		261
246	If you don't know what event loop to use, use the one returned from this	262	If you don't know what event loop to use, use the one returned from this
247	function.	263	function.
248		264
		265	The default loop is the only loop that can handle C<ev_signal> and
		266	C<ev_child> watchers, and to do this, it always registers a handler
		267	for C<SIGCHLD>. If this is a problem for your app you can either
		268	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
		269	can simply overwrite the C<SIGCHLD> signal handler I<after> calling
		270	C<ev_default_init>.
		271
249	The flags argument can be used to specify special behaviour or specific	272	The flags argument can be used to specify special behaviour or specific
250	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	273	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
251		274
252	The following flags are supported:	275	The following flags are supported:
253		276
…		…
265	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	288	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
266	override the flags completely if it is found in the environment. This is	289	override the flags completely if it is found in the environment. This is
267	useful to try out specific backends to test their performance, or to work	290	useful to try out specific backends to test their performance, or to work
268	around bugs.	291	around bugs.
269		292
		293	=item C<EVFLAG_FORKCHECK>
		294
		295	Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
		296	a fork, you can also make libev check for a fork in each iteration by
		297	enabling this flag.
		298
		299	This works by calling C<getpid ()> on every iteration of the loop,
		300	and thus this might slow down your event loop if you do a lot of loop
		301	iterations and little real work, but is usually not noticeable (on my
		302	Linux system for example, C<getpid> is actually a simple 5-insn sequence
		303	without a syscall and thus I<very> fast, but my Linux system also has
		304	C<pthread_atfork> which is even faster).
		305
		306	The big advantage of this flag is that you can forget about fork (and
		307	forget about forgetting to tell libev about forking) when you use this
		308	flag.
		309
		310	This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
		311	environment variable.
		312
270	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	313	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
271		314
272	This is your standard select(2) backend. Not I<completely> standard, as	315	This is your standard select(2) backend. Not I<completely> standard, as
273	libev tries to roll its own fd_set with no limits on the number of fds,	316	libev tries to roll its own fd_set with no limits on the number of fds,
274	but if that fails, expect a fairly low limit on the number of fds when	317	but if that fails, expect a fairly low limit on the number of fds when
275	using this backend. It doesn't scale too well (O(highest_fd)), but its usually	318	using this backend. It doesn't scale too well (O(highest_fd)), but its
276	the fastest backend for a low number of fds.	319	usually the fastest backend for a low number of (low-numbered :) fds.
		320
		321	To get good performance out of this backend you need a high amount of
		322	parallelity (most of the file descriptors should be busy). If you are
		323	writing a server, you should C<accept ()> in a loop to accept as many
		324	connections as possible during one iteration. You might also want to have
		325	a look at C<ev_set_io_collect_interval ()> to increase the amount of
		326	readyness notifications you get per iteration.
277		327
278	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)	328	=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
279		329
280	And this is your standard poll(2) backend. It's more complicated than	330	And this is your standard poll(2) backend. It's more complicated
281	select, but handles sparse fds better and has no artificial limit on the	331	than select, but handles sparse fds better and has no artificial
282	number of fds you can use (except it will slow down considerably with a	332	limit on the number of fds you can use (except it will slow down
283	lot of inactive fds). It scales similarly to select, i.e. O(total_fds).	333	considerably with a lot of inactive fds). It scales similarly to select,
		334	i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
		335	performance tips.
284		336
285	=item C<EVBACKEND_EPOLL> (value 4, Linux)	337	=item C<EVBACKEND_EPOLL> (value 4, Linux)
286		338
287	For few fds, this backend is a bit little slower than poll and select,	339	For few fds, this backend is a bit little slower than poll and select,
288	but it scales phenomenally better. While poll and select usually scale like	340	but it scales phenomenally better. While poll and select usually scale
289	O(total_fds) where n is the total number of fds (or the highest fd), epoll scales	341	like O(total_fds) where n is the total number of fds (or the highest fd),
290	either O(1) or O(active_fds).	342	epoll scales either O(1) or O(active_fds). The epoll design has a number
		343	of shortcomings, such as silently dropping events in some hard-to-detect
		344	cases and rewiring a syscall per fd change, no fork support and bad
		345	support for dup.
291		346
292	While stopping and starting an I/O watcher in the same iteration will	347	While stopping, setting and starting an I/O watcher in the same iteration
293	result in some caching, there is still a syscall per such incident	348	will result in some caching, there is still a syscall per such incident
294	(because the fd could point to a different file description now), so its	349	(because the fd could point to a different file description now), so its
295	best to avoid that. Also, dup()ed file descriptors might not work very	350	best to avoid that. Also, C<dup ()>'ed file descriptors might not work
296	well if you register events for both fds.	351	very well if you register events for both fds.
297		352
298	Please note that epoll sometimes generates spurious notifications, so you	353	Please note that epoll sometimes generates spurious notifications, so you
299	need to use non-blocking I/O or other means to avoid blocking when no data	354	need to use non-blocking I/O or other means to avoid blocking when no data
300	(or space) is available.	355	(or space) is available.
301		356
		357	Best performance from this backend is achieved by not unregistering all
		358	watchers for a file descriptor until it has been closed, if possible, i.e.
		359	keep at least one watcher active per fd at all times.
		360
		361	While nominally embeddeble in other event loops, this feature is broken in
		362	all kernel versions tested so far.
		363
302	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)	364	=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
303		365
304	Kqueue deserves special mention, as at the time of this writing, it	366	Kqueue deserves special mention, as at the time of this writing, it
305	was broken on all BSDs except NetBSD (usually it doesn't work with	367	was broken on all BSDs except NetBSD (usually it doesn't work reliably
306	anything but sockets and pipes, except on Darwin, where of course its	368	with anything but sockets and pipes, except on Darwin, where of course
307	completely useless). For this reason its not being "autodetected"	369	it's completely useless). For this reason it's not being "autodetected"
308	unless you explicitly specify it explicitly in the flags (i.e. using	370	unless you explicitly specify it explicitly in the flags (i.e. using
309	C<EVBACKEND_KQUEUE>).	371	C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
		372	system like NetBSD.
		373
		374	You still can embed kqueue into a normal poll or select backend and use it
		375	only for sockets (after having made sure that sockets work with kqueue on
		376	the target platform). See C<ev_embed> watchers for more info.
310		377
311	It scales in the same way as the epoll backend, but the interface to the	378	It scales in the same way as the epoll backend, but the interface to the
312	kernel is more efficient (which says nothing about its actual speed, of	379	kernel is more efficient (which says nothing about its actual speed, of
313	course). While starting and stopping an I/O watcher does not cause an	380	course). While stopping, setting and starting an I/O watcher does never
314	extra syscall as with epoll, it still adds up to four event changes per	381	cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
315	incident, so its best to avoid that.	382	two event changes per incident, support for C<fork ()> is very bad and it
		383	drops fds silently in similarly hard-to-detect cases.
		384
		385	This backend usually performs well under most conditions.
		386
		387	While nominally embeddable in other event loops, this doesn't work
		388	everywhere, so you might need to test for this. And since it is broken
		389	almost everywhere, you should only use it when you have a lot of sockets
		390	(for which it usually works), by embedding it into another event loop
		391	(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
		392	sockets.
316		393
317	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)	394	=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
318		395
319	This is not implemented yet (and might never be).	396	This is not implemented yet (and might never be, unless you send me an
		397	implementation). According to reports, C</dev/poll> only supports sockets
		398	and is not embeddable, which would limit the usefulness of this backend
		399	immensely.
320		400
321	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	401	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
322		402
323	This uses the Solaris 10 port mechanism. As with everything on Solaris,	403	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
324	it's really slow, but it still scales very well (O(active_fds)).	404	it's really slow, but it still scales very well (O(active_fds)).
325		405
326	Please note that solaris ports can result in a lot of spurious	406	Please note that solaris event ports can deliver a lot of spurious
327	notifications, so you need to use non-blocking I/O or other means to avoid	407	notifications, so you need to use non-blocking I/O or other means to avoid
328	blocking when no data (or space) is available.	408	blocking when no data (or space) is available.
		409
		410	While this backend scales well, it requires one system call per active
		411	file descriptor per loop iteration. For small and medium numbers of file
		412	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
		413	might perform better.
		414
		415	On the positive side, ignoring the spurious readyness notifications, this
		416	backend actually performed to specification in all tests and is fully
		417	embeddable, which is a rare feat among the OS-specific backends.
329		418
330	=item C<EVBACKEND_ALL>	419	=item C<EVBACKEND_ALL>
331		420
332	Try all backends (even potentially broken ones that wouldn't be tried	421	Try all backends (even potentially broken ones that wouldn't be tried
333	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	422	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
334	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	423	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
335		424
		425	It is definitely not recommended to use this flag.
		426
336	=back	427	=back
337		428
338	If one or more of these are ored into the flags value, then only these	429	If one or more of these are ored into the flags value, then only these
339	backends will be tried (in the reverse order as given here). If none are	430	backends will be tried (in the reverse order as listed here). If none are
340	specified, most compiled-in backend will be tried, usually in reverse	431	specified, all backends in C<ev_recommended_backends ()> will be tried.
341	order of their flag values :)
342		432
343	The most typical usage is like this:	433	The most typical usage is like this:
344		434
345	if (!ev_default_loop (0))	435	if (!ev_default_loop (0))
346	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");	436	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
…		…
374	Destroys the default loop again (frees all memory and kernel state	464	Destroys the default loop again (frees all memory and kernel state
375	etc.). None of the active event watchers will be stopped in the normal	465	etc.). None of the active event watchers will be stopped in the normal
376	sense, so e.g. C<ev_is_active> might still return true. It is your	466	sense, so e.g. C<ev_is_active> might still return true. It is your
377	responsibility to either stop all watchers cleanly yoursef I<before>	467	responsibility to either stop all watchers cleanly yoursef I<before>
378	calling this function, or cope with the fact afterwards (which is usually	468	calling this function, or cope with the fact afterwards (which is usually
379	the easiest thing, youc na just ignore the watchers and/or C<free ()> them	469	the easiest thing, you can just ignore the watchers and/or C<free ()> them
380	for example).	470	for example).
		471
		472	Note that certain global state, such as signal state, will not be freed by
		473	this function, and related watchers (such as signal and child watchers)
		474	would need to be stopped manually.
		475
		476	In general it is not advisable to call this function except in the
		477	rare occasion where you really need to free e.g. the signal handling
		478	pipe fds. If you need dynamically allocated loops it is better to use
		479	C<ev_loop_new> and C<ev_loop_destroy>).
381		480
382	=item ev_loop_destroy (loop)	481	=item ev_loop_destroy (loop)
383		482
384	Like C<ev_default_destroy>, but destroys an event loop created by an	483	Like C<ev_default_destroy>, but destroys an event loop created by an
385	earlier call to C<ev_loop_new>.	484	earlier call to C<ev_loop_new>.
386		485
387	=item ev_default_fork ()	486	=item ev_default_fork ()
388		487
		488	This function sets a flag that causes subsequent C<ev_loop> iterations
389	This function reinitialises the kernel state for backends that have	489	to reinitialise the kernel state for backends that have one. Despite the
390	one. Despite the name, you can call it anytime, but it makes most sense	490	name, you can call it anytime, but it makes most sense after forking, in
391	after forking, in either the parent or child process (or both, but that	491	the child process (or both child and parent, but that again makes little
392	again makes little sense).	492	sense). You I<must> call it in the child before using any of the libev
		493	functions, and it will only take effect at the next C<ev_loop> iteration.
393		494
394	You I<must> call this function in the child process after forking if and	495	On the other hand, you only need to call this function in the child
395	only if you want to use the event library in both processes. If you just	496	process if and only if you want to use the event library in the child. If
396	fork+exec, you don't have to call it.	497	you just fork+exec, you don't have to call it at all.
397		498
398	The function itself is quite fast and it's usually not a problem to call	499	The function itself is quite fast and it's usually not a problem to call
399	it just in case after a fork. To make this easy, the function will fit in	500	it just in case after a fork. To make this easy, the function will fit in
400	quite nicely into a call to C<pthread_atfork>:	501	quite nicely into a call to C<pthread_atfork>:
401		502
402	pthread_atfork (0, 0, ev_default_fork);	503	pthread_atfork (0, 0, ev_default_fork);
403		504
404	At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
405	without calling this function, so if you force one of those backends you
406	do not need to care.
407
408	=item ev_loop_fork (loop)	505	=item ev_loop_fork (loop)
409		506
410	Like C<ev_default_fork>, but acts on an event loop created by	507	Like C<ev_default_fork>, but acts on an event loop created by
411	C<ev_loop_new>. Yes, you have to call this on every allocated event loop	508	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
412	after fork, and how you do this is entirely your own problem.	509	after fork, and how you do this is entirely your own problem.
		510
		511	=item int ev_is_default_loop (loop)
		512
		513	Returns true when the given loop actually is the default loop, false otherwise.
		514
		515	=item unsigned int ev_loop_count (loop)
		516
		517	Returns the count of loop iterations for the loop, which is identical to
		518	the number of times libev did poll for new events. It starts at C<0> and
		519	happily wraps around with enough iterations.
		520
		521	This value can sometimes be useful as a generation counter of sorts (it
		522	"ticks" the number of loop iterations), as it roughly corresponds with
		523	C<ev_prepare> and C<ev_check> calls.
413		524
414	=item unsigned int ev_backend (loop)	525	=item unsigned int ev_backend (loop)
415		526
416	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	527	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
417	use.	528	use.
…		…
420		531
421	Returns the current "event loop time", which is the time the event loop	532	Returns the current "event loop time", which is the time the event loop
422	received events and started processing them. This timestamp does not	533	received events and started processing them. This timestamp does not
423	change as long as callbacks are being processed, and this is also the base	534	change as long as callbacks are being processed, and this is also the base
424	time used for relative timers. You can treat it as the timestamp of the	535	time used for relative timers. You can treat it as the timestamp of the
425	event occuring (or more correctly, libev finding out about it).	536	event occurring (or more correctly, libev finding out about it).
426		537
427	=item ev_loop (loop, int flags)	538	=item ev_loop (loop, int flags)
428		539
429	Finally, this is it, the event handler. This function usually is called	540	Finally, this is it, the event handler. This function usually is called
430	after you initialised all your watchers and you want to start handling	541	after you initialised all your watchers and you want to start handling
…		…
451	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is	562	libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
452	usually a better approach for this kind of thing.	563	usually a better approach for this kind of thing.
453		564
454	Here are the gory details of what C<ev_loop> does:	565	Here are the gory details of what C<ev_loop> does:
455		566
456	* If there are no active watchers (reference count is zero), return.	567	- Before the first iteration, call any pending watchers.
457	- Queue prepare watchers and then call all outstanding watchers.	568	* If EVFLAG_FORKCHECK was used, check for a fork.
		569	- If a fork was detected, queue and call all fork watchers.
		570	- Queue and call all prepare watchers.
458	- If we have been forked, recreate the kernel state.	571	- If we have been forked, recreate the kernel state.
459	- Update the kernel state with all outstanding changes.	572	- Update the kernel state with all outstanding changes.
460	- Update the "event loop time".	573	- Update the "event loop time".
461	- Calculate for how long to block.	574	- Calculate for how long to sleep or block, if at all
		575	(active idle watchers, EVLOOP_NONBLOCK or not having
		576	any active watchers at all will result in not sleeping).
		577	- Sleep if the I/O and timer collect interval say so.
462	- Block the process, waiting for any events.	578	- Block the process, waiting for any events.
463	- Queue all outstanding I/O (fd) events.	579	- Queue all outstanding I/O (fd) events.
464	- Update the "event loop time" and do time jump handling.	580	- Update the "event loop time" and do time jump handling.
465	- Queue all outstanding timers.	581	- Queue all outstanding timers.
466	- Queue all outstanding periodics.	582	- Queue all outstanding periodics.
467	- If no events are pending now, queue all idle watchers.	583	- If no events are pending now, queue all idle watchers.
468	- Queue all check watchers.	584	- Queue all check watchers.
469	- Call all queued watchers in reverse order (i.e. check watchers first).	585	- Call all queued watchers in reverse order (i.e. check watchers first).
470	Signals and child watchers are implemented as I/O watchers, and will	586	Signals and child watchers are implemented as I/O watchers, and will
471	be handled here by queueing them when their watcher gets executed.	587	be handled here by queueing them when their watcher gets executed.
472	- If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK	588	- If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
473	were used, return, otherwise continue with step *.	589	were used, or there are no active watchers, return, otherwise
		590	continue with step *.
474		591
475	Example: Queue some jobs and then loop until no events are outsanding	592	Example: Queue some jobs and then loop until no events are outstanding
476	anymore.	593	anymore.
477		594
478	... queue jobs here, make sure they register event watchers as long	595	... queue jobs here, make sure they register event watchers as long
479	... as they still have work to do (even an idle watcher will do..)	596	... as they still have work to do (even an idle watcher will do..)
480	ev_loop (my_loop, 0);	597	ev_loop (my_loop, 0);
…		…
484		601
485	Can be used to make a call to C<ev_loop> return early (but only after it	602	Can be used to make a call to C<ev_loop> return early (but only after it
486	has processed all outstanding events). The C<how> argument must be either	603	has processed all outstanding events). The C<how> argument must be either
487	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or	604	C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
488	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.	605	C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
		606
		607	This "unloop state" will be cleared when entering C<ev_loop> again.
489		608
490	=item ev_ref (loop)	609	=item ev_ref (loop)
491		610
492	=item ev_unref (loop)	611	=item ev_unref (loop)
493		612
…		…
498	returning, ev_unref() after starting, and ev_ref() before stopping it. For	617	returning, ev_unref() after starting, and ev_ref() before stopping it. For
499	example, libev itself uses this for its internal signal pipe: It is not	618	example, libev itself uses this for its internal signal pipe: It is not
500	visible to the libev user and should not keep C<ev_loop> from exiting if	619	visible to the libev user and should not keep C<ev_loop> from exiting if
501	no event watchers registered by it are active. It is also an excellent	620	no event watchers registered by it are active. It is also an excellent
502	way to do this for generic recurring timers or from within third-party	621	way to do this for generic recurring timers or from within third-party
503	libraries. Just remember to I<unref after start> and I<ref before stop>.	622	libraries. Just remember to I<unref after start> and I<ref before stop>
		623	(but only if the watcher wasn't active before, or was active before,
		624	respectively).
504		625
505	Example: Create a signal watcher, but keep it from keeping C<ev_loop>	626	Example: Create a signal watcher, but keep it from keeping C<ev_loop>
506	running when nothing else is active.	627	running when nothing else is active.
507		628
508	struct ev_signal exitsig;	629	struct ev_signal exitsig;
…		…
512		633
513	Example: For some weird reason, unregister the above signal handler again.	634	Example: For some weird reason, unregister the above signal handler again.
514		635
515	ev_ref (loop);	636	ev_ref (loop);
516	ev_signal_stop (loop, &exitsig);	637	ev_signal_stop (loop, &exitsig);
		638
		639	=item ev_set_io_collect_interval (loop, ev_tstamp interval)
		640
		641	=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
		642
		643	These advanced functions influence the time that libev will spend waiting
		644	for events. Both are by default C<0>, meaning that libev will try to
		645	invoke timer/periodic callbacks and I/O callbacks with minimum latency.
		646
		647	Setting these to a higher value (the C<interval> I<must> be >= C<0>)
		648	allows libev to delay invocation of I/O and timer/periodic callbacks to
		649	increase efficiency of loop iterations.
		650
		651	The background is that sometimes your program runs just fast enough to
		652	handle one (or very few) event(s) per loop iteration. While this makes
		653	the program responsive, it also wastes a lot of CPU time to poll for new
		654	events, especially with backends like C<select ()> which have a high
		655	overhead for the actual polling but can deliver many events at once.
		656
		657	By setting a higher I<io collect interval> you allow libev to spend more
		658	time collecting I/O events, so you can handle more events per iteration,
		659	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
		660	C<ev_timer>) will be not affected. Setting this to a non-null value will
		661	introduce an additional C<ev_sleep ()> call into most loop iterations.
		662
		663	Likewise, by setting a higher I<timeout collect interval> you allow libev
		664	to spend more time collecting timeouts, at the expense of increased
		665	latency (the watcher callback will be called later). C<ev_io> watchers
		666	will not be affected. Setting this to a non-null value will not introduce
		667	any overhead in libev.
		668
		669	Many (busy) programs can usually benefit by setting the io collect
		670	interval to a value near C<0.1> or so, which is often enough for
		671	interactive servers (of course not for games), likewise for timeouts. It
		672	usually doesn't make much sense to set it to a lower value than C<0.01>,
		673	as this approsaches the timing granularity of most systems.
517		674
518	=back	675	=back
519		676
520		677
521	=head1 ANATOMY OF A WATCHER	678	=head1 ANATOMY OF A WATCHER
…		…
621	=item C<EV_FORK>	778	=item C<EV_FORK>
622		779
623	The event loop has been resumed in the child process after fork (see	780	The event loop has been resumed in the child process after fork (see
624	C<ev_fork>).	781	C<ev_fork>).
625		782
		783	=item C<EV_ASYNC>
		784
		785	The given async watcher has been asynchronously notified (see C<ev_async>).
		786
626	=item C<EV_ERROR>	787	=item C<EV_ERROR>
627		788
628	An unspecified error has occured, the watcher has been stopped. This might	789	An unspecified error has occured, the watcher has been stopped. This might
629	happen because the watcher could not be properly started because libev	790	happen because the watcher could not be properly started because libev
630	ran out of memory, a file descriptor was found to be closed or any other	791	ran out of memory, a file descriptor was found to be closed or any other
…		…
701	=item bool ev_is_pending (ev_TYPE *watcher)	862	=item bool ev_is_pending (ev_TYPE *watcher)
702		863
703	Returns a true value iff the watcher is pending, (i.e. it has outstanding	864	Returns a true value iff the watcher is pending, (i.e. it has outstanding
704	events but its callback has not yet been invoked). As long as a watcher	865	events but its callback has not yet been invoked). As long as a watcher
705	is pending (but not active) you must not call an init function on it (but	866	is pending (but not active) you must not call an init function on it (but
706	C<ev_TYPE_set> is safe) and you must make sure the watcher is available to	867	C<ev_TYPE_set> is safe), you must not change its priority, and you must
707	libev (e.g. you cnanot C<free ()> it).	868	make sure the watcher is available to libev (e.g. you cannot C<free ()>
		869	it).
708		870
709	=item callback ev_cb (ev_TYPE *watcher)	871	=item callback ev_cb (ev_TYPE *watcher)
710		872
711	Returns the callback currently set on the watcher.	873	Returns the callback currently set on the watcher.
712		874
713	=item ev_cb_set (ev_TYPE *watcher, callback)	875	=item ev_cb_set (ev_TYPE *watcher, callback)
714		876
715	Change the callback. You can change the callback at virtually any time	877	Change the callback. You can change the callback at virtually any time
716	(modulo threads).	878	(modulo threads).
		879
		880	=item ev_set_priority (ev_TYPE *watcher, priority)
		881
		882	=item int ev_priority (ev_TYPE *watcher)
		883
		884	Set and query the priority of the watcher. The priority is a small
		885	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
		886	(default: C<-2>). Pending watchers with higher priority will be invoked
		887	before watchers with lower priority, but priority will not keep watchers
		888	from being executed (except for C<ev_idle> watchers).
		889
		890	This means that priorities are I<only> used for ordering callback
		891	invocation after new events have been received. This is useful, for
		892	example, to reduce latency after idling, or more often, to bind two
		893	watchers on the same event and make sure one is called first.
		894
		895	If you need to suppress invocation when higher priority events are pending
		896	you need to look at C<ev_idle> watchers, which provide this functionality.
		897
		898	You I<must not> change the priority of a watcher as long as it is active or
		899	pending.
		900
		901	The default priority used by watchers when no priority has been set is
		902	always C<0>, which is supposed to not be too high and not be too low :).
		903
		904	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		905	fine, as long as you do not mind that the priority value you query might
		906	or might not have been adjusted to be within valid range.
		907
		908	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
		909
		910	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
		911	C<loop> nor C<revents> need to be valid as long as the watcher callback
		912	can deal with that fact.
		913
		914	=item int ev_clear_pending (loop, ev_TYPE *watcher)
		915
		916	If the watcher is pending, this function returns clears its pending status
		917	and returns its C<revents> bitset (as if its callback was invoked). If the
		918	watcher isn't pending it does nothing and returns C<0>.
717		919
718	=back	920	=back
719		921
720		922
721	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER	923	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
…		…
806	In general you can register as many read and/or write event watchers per	1008	In general you can register as many read and/or write event watchers per
807	fd as you want (as long as you don't confuse yourself). Setting all file	1009	fd as you want (as long as you don't confuse yourself). Setting all file
808	descriptors to non-blocking mode is also usually a good idea (but not	1010	descriptors to non-blocking mode is also usually a good idea (but not
809	required if you know what you are doing).	1011	required if you know what you are doing).
810		1012
811	You have to be careful with dup'ed file descriptors, though. Some backends
812	(the linux epoll backend is a notable example) cannot handle dup'ed file
813	descriptors correctly if you register interest in two or more fds pointing
814	to the same underlying file/socket/etc. description (that is, they share
815	the same underlying "file open").
816
817	If you must do this, then force the use of a known-to-be-good backend	1013	If you must do this, then force the use of a known-to-be-good backend
818	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and	1014	(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
819	C<EVBACKEND_POLL>).	1015	C<EVBACKEND_POLL>).
820		1016
821	Another thing you have to watch out for is that it is quite easy to	1017	Another thing you have to watch out for is that it is quite easy to
…		…
827	it is best to always use non-blocking I/O: An extra C<read>(2) returning	1023	it is best to always use non-blocking I/O: An extra C<read>(2) returning
828	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1024	C<EAGAIN> is far preferable to a program hanging until some data arrives.
829		1025
830	If you cannot run the fd in non-blocking mode (for example you should not	1026	If you cannot run the fd in non-blocking mode (for example you should not
831	play around with an Xlib connection), then you have to seperately re-test	1027	play around with an Xlib connection), then you have to seperately re-test
832	wether a file descriptor is really ready with a known-to-be good interface	1028	whether a file descriptor is really ready with a known-to-be good interface
833	such as poll (fortunately in our Xlib example, Xlib already does this on	1029	such as poll (fortunately in our Xlib example, Xlib already does this on
834	its own, so its quite safe to use).	1030	its own, so its quite safe to use).
		1031
		1032	=head3 The special problem of disappearing file descriptors
		1033
		1034	Some backends (e.g. kqueue, epoll) need to be told about closing a file
		1035	descriptor (either by calling C<close> explicitly or by any other means,
		1036	such as C<dup>). The reason is that you register interest in some file
		1037	descriptor, but when it goes away, the operating system will silently drop
		1038	this interest. If another file descriptor with the same number then is
		1039	registered with libev, there is no efficient way to see that this is, in
		1040	fact, a different file descriptor.
		1041
		1042	To avoid having to explicitly tell libev about such cases, libev follows
		1043	the following policy: Each time C<ev_io_set> is being called, libev
		1044	will assume that this is potentially a new file descriptor, otherwise
		1045	it is assumed that the file descriptor stays the same. That means that
		1046	you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
		1047	descriptor even if the file descriptor number itself did not change.
		1048
		1049	This is how one would do it normally anyway, the important point is that
		1050	the libev application should not optimise around libev but should leave
		1051	optimisations to libev.
		1052
		1053	=head3 The special problem of dup'ed file descriptors
		1054
		1055	Some backends (e.g. epoll), cannot register events for file descriptors,
		1056	but only events for the underlying file descriptions. That means when you
		1057	have C<dup ()>'ed file descriptors or weirder constellations, and register
		1058	events for them, only one file descriptor might actually receive events.
		1059
		1060	There is no workaround possible except not registering events
		1061	for potentially C<dup ()>'ed file descriptors, or to resort to
		1062	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
		1063
		1064	=head3 The special problem of fork
		1065
		1066	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
		1067	useless behaviour. Libev fully supports fork, but needs to be told about
		1068	it in the child.
		1069
		1070	To support fork in your programs, you either have to call
		1071	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
		1072	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
		1073	C<EVBACKEND_POLL>.
		1074
		1075
		1076	=head3 Watcher-Specific Functions
835		1077
836	=over 4	1078	=over 4
837		1079
838	=item ev_io_init (ev_io *, callback, int fd, int events)	1080	=item ev_io_init (ev_io *, callback, int fd, int events)
839		1081
…		…
850	=item int events [read-only]	1092	=item int events [read-only]
851		1093
852	The events being watched.	1094	The events being watched.
853		1095
854	=back	1096	=back
		1097
		1098	=head3 Examples
855		1099
856	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well	1100	Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
857	readable, but only once. Since it is likely line-buffered, you could	1101	readable, but only once. Since it is likely line-buffered, you could
858	attempt to read a whole line in the callback.	1102	attempt to read a whole line in the callback.
859		1103
…		…
893		1137
894	The callback is guarenteed to be invoked only when its timeout has passed,	1138	The callback is guarenteed to be invoked only when its timeout has passed,
895	but if multiple timers become ready during the same loop iteration then	1139	but if multiple timers become ready during the same loop iteration then
896	order of execution is undefined.	1140	order of execution is undefined.
897		1141
		1142	=head3 Watcher-Specific Functions and Data Members
		1143
898	=over 4	1144	=over 4
899		1145
900	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)	1146	=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
901		1147
902	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)	1148	=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
…		…
910	configure a timer to trigger every 10 seconds, then it will trigger at	1156	configure a timer to trigger every 10 seconds, then it will trigger at
911	exactly 10 second intervals. If, however, your program cannot keep up with	1157	exactly 10 second intervals. If, however, your program cannot keep up with
912	the timer (because it takes longer than those 10 seconds to do stuff) the	1158	the timer (because it takes longer than those 10 seconds to do stuff) the
913	timer will not fire more than once per event loop iteration.	1159	timer will not fire more than once per event loop iteration.
914		1160
915	=item ev_timer_again (loop)	1161	=item ev_timer_again (loop, ev_timer *)
916		1162
917	This will act as if the timer timed out and restart it again if it is	1163	This will act as if the timer timed out and restart it again if it is
918	repeating. The exact semantics are:	1164	repeating. The exact semantics are:
919		1165
		1166	If the timer is pending, its pending status is cleared.
		1167
920	If the timer is started but nonrepeating, stop it.	1168	If the timer is started but nonrepeating, stop it (as if it timed out).
921		1169
922	If the timer is repeating, either start it if necessary (with the repeat	1170	If the timer is repeating, either start it if necessary (with the
923	value), or reset the running timer to the repeat value.	1171	C<repeat> value), or reset the running timer to the C<repeat> value.
924		1172
925	This sounds a bit complicated, but here is a useful and typical	1173	This sounds a bit complicated, but here is a useful and typical
926	example: Imagine you have a tcp connection and you want a so-called	1174	example: Imagine you have a tcp connection and you want a so-called idle
927	idle timeout, that is, you want to be called when there have been,	1175	timeout, that is, you want to be called when there have been, say, 60
928	say, 60 seconds of inactivity on the socket. The easiest way to do	1176	seconds of inactivity on the socket. The easiest way to do this is to
929	this is to configure an C<ev_timer> with C<after>=C<repeat>=C<60> and calling	1177	configure an C<ev_timer> with a C<repeat> value of C<60> and then call
930	C<ev_timer_again> each time you successfully read or write some data. If	1178	C<ev_timer_again> each time you successfully read or write some data. If
931	you go into an idle state where you do not expect data to travel on the	1179	you go into an idle state where you do not expect data to travel on the
932	socket, you can stop the timer, and again will automatically restart it if	1180	socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
933	need be.	1181	automatically restart it if need be.
934		1182
935	You can also ignore the C<after> value and C<ev_timer_start> altogether	1183	That means you can ignore the C<after> value and C<ev_timer_start>
936	and only ever use the C<repeat> value:	1184	altogether and only ever use the C<repeat> value and C<ev_timer_again>:
937		1185
938	ev_timer_init (timer, callback, 0., 5.);	1186	ev_timer_init (timer, callback, 0., 5.);
939	ev_timer_again (loop, timer);	1187	ev_timer_again (loop, timer);
940	...	1188	...
941	timer->again = 17.;	1189	timer->again = 17.;
942	ev_timer_again (loop, timer);	1190	ev_timer_again (loop, timer);
943	...	1191	...
944	timer->again = 10.;	1192	timer->again = 10.;
945	ev_timer_again (loop, timer);	1193	ev_timer_again (loop, timer);
946		1194
947	This is more efficient then stopping/starting the timer eahc time you want	1195	This is more slightly efficient then stopping/starting the timer each time
948	to modify its timeout value.	1196	you want to modify its timeout value.
949		1197
950	=item ev_tstamp repeat [read-write]	1198	=item ev_tstamp repeat [read-write]
951		1199
952	The current C<repeat> value. Will be used each time the watcher times out	1200	The current C<repeat> value. Will be used each time the watcher times out
953	or C<ev_timer_again> is called and determines the next timeout (if any),	1201	or C<ev_timer_again> is called and determines the next timeout (if any),
954	which is also when any modifications are taken into account.	1202	which is also when any modifications are taken into account.
955		1203
956	=back	1204	=back
		1205
		1206	=head3 Examples
957		1207
958	Example: Create a timer that fires after 60 seconds.	1208	Example: Create a timer that fires after 60 seconds.
959		1209
960	static void	1210	static void
961	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)	1211	one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
…		…
995	but on wallclock time (absolute time). You can tell a periodic watcher	1245	but on wallclock time (absolute time). You can tell a periodic watcher
996	to trigger "at" some specific point in time. For example, if you tell a	1246	to trigger "at" some specific point in time. For example, if you tell a
997	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()	1247	periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
998	+ 10.>) and then reset your system clock to the last year, then it will	1248	+ 10.>) and then reset your system clock to the last year, then it will
999	take a year to trigger the event (unlike an C<ev_timer>, which would trigger	1249	take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1000	roughly 10 seconds later and of course not if you reset your system time	1250	roughly 10 seconds later).
1001	again).
1002		1251
1003	They can also be used to implement vastly more complex timers, such as	1252	They can also be used to implement vastly more complex timers, such as
1004	triggering an event on eahc midnight, local time.	1253	triggering an event on each midnight, local time or other, complicated,
		1254	rules.
1005		1255
1006	As with timers, the callback is guarenteed to be invoked only when the	1256	As with timers, the callback is guarenteed to be invoked only when the
1007	time (C<at>) has been passed, but if multiple periodic timers become ready	1257	time (C<at>) has been passed, but if multiple periodic timers become ready
1008	during the same loop iteration then order of execution is undefined.	1258	during the same loop iteration then order of execution is undefined.
1009		1259
		1260	=head3 Watcher-Specific Functions and Data Members
		1261
1010	=over 4	1262	=over 4
1011		1263
1012	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)	1264	=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1013		1265
1014	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)	1266	=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
…		…
1016	Lots of arguments, lets sort it out... There are basically three modes of	1268	Lots of arguments, lets sort it out... There are basically three modes of
1017	operation, and we will explain them from simplest to complex:	1269	operation, and we will explain them from simplest to complex:
1018		1270
1019	=over 4	1271	=over 4
1020		1272
1021	=item * absolute timer (interval = reschedule_cb = 0)	1273	=item * absolute timer (at = time, interval = reschedule_cb = 0)
1022		1274
1023	In this configuration the watcher triggers an event at the wallclock time	1275	In this configuration the watcher triggers an event at the wallclock time
1024	C<at> and doesn't repeat. It will not adjust when a time jump occurs,	1276	C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1025	that is, if it is to be run at January 1st 2011 then it will run when the	1277	that is, if it is to be run at January 1st 2011 then it will run when the
1026	system time reaches or surpasses this time.	1278	system time reaches or surpasses this time.
1027		1279
1028	=item * non-repeating interval timer (interval > 0, reschedule_cb = 0)	1280	=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1029		1281
1030	In this mode the watcher will always be scheduled to time out at the next	1282	In this mode the watcher will always be scheduled to time out at the next
1031	C<at + N * interval> time (for some integer N) and then repeat, regardless	1283	C<at + N * interval> time (for some integer N, which can also be negative)
1032	of any time jumps.	1284	and then repeat, regardless of any time jumps.
1033		1285
1034	This can be used to create timers that do not drift with respect to system	1286	This can be used to create timers that do not drift with respect to system
1035	time:	1287	time:
1036		1288
1037	ev_periodic_set (&periodic, 0., 3600., 0);	1289	ev_periodic_set (&periodic, 0., 3600., 0);
…		…
1043		1295
1044	Another way to think about it (for the mathematically inclined) is that	1296	Another way to think about it (for the mathematically inclined) is that
1045	C<ev_periodic> will try to run the callback in this mode at the next possible	1297	C<ev_periodic> will try to run the callback in this mode at the next possible
1046	time where C<time = at (mod interval)>, regardless of any time jumps.	1298	time where C<time = at (mod interval)>, regardless of any time jumps.
1047		1299
		1300	For numerical stability it is preferable that the C<at> value is near
		1301	C<ev_now ()> (the current time), but there is no range requirement for
		1302	this value.
		1303
1048	=item * manual reschedule mode (reschedule_cb = callback)	1304	=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1049		1305
1050	In this mode the values for C<interval> and C<at> are both being	1306	In this mode the values for C<interval> and C<at> are both being
1051	ignored. Instead, each time the periodic watcher gets scheduled, the	1307	ignored. Instead, each time the periodic watcher gets scheduled, the
1052	reschedule callback will be called with the watcher as first, and the	1308	reschedule callback will be called with the watcher as first, and the
1053	current time as second argument.	1309	current time as second argument.
1054		1310
1055	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,	1311	NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1056	ever, or make any event loop modifications>. If you need to stop it,	1312	ever, or make any event loop modifications>. If you need to stop it,
1057	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by	1313	return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1058	starting a prepare watcher).	1314	starting an C<ev_prepare> watcher, which is legal).
1059		1315
1060	Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,	1316	Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1061	ev_tstamp now)>, e.g.:	1317	ev_tstamp now)>, e.g.:
1062		1318
1063	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)	1319	static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
…		…
1086	Simply stops and restarts the periodic watcher again. This is only useful	1342	Simply stops and restarts the periodic watcher again. This is only useful
1087	when you changed some parameters or the reschedule callback would return	1343	when you changed some parameters or the reschedule callback would return
1088	a different time than the last time it was called (e.g. in a crond like	1344	a different time than the last time it was called (e.g. in a crond like
1089	program when the crontabs have changed).	1345	program when the crontabs have changed).
1090		1346
		1347	=item ev_tstamp offset [read-write]
		1348
		1349	When repeating, this contains the offset value, otherwise this is the
		1350	absolute point in time (the C<at> value passed to C<ev_periodic_set>).
		1351
		1352	Can be modified any time, but changes only take effect when the periodic
		1353	timer fires or C<ev_periodic_again> is being called.
		1354
1091	=item ev_tstamp interval [read-write]	1355	=item ev_tstamp interval [read-write]
1092		1356
1093	The current interval value. Can be modified any time, but changes only	1357	The current interval value. Can be modified any time, but changes only
1094	take effect when the periodic timer fires or C<ev_periodic_again> is being	1358	take effect when the periodic timer fires or C<ev_periodic_again> is being
1095	called.	1359	called.
…		…
1098		1362
1099	The current reschedule callback, or C<0>, if this functionality is	1363	The current reschedule callback, or C<0>, if this functionality is
1100	switched off. Can be changed any time, but changes only take effect when	1364	switched off. Can be changed any time, but changes only take effect when
1101	the periodic timer fires or C<ev_periodic_again> is being called.	1365	the periodic timer fires or C<ev_periodic_again> is being called.
1102		1366
		1367	=item ev_tstamp at [read-only]
		1368
		1369	When active, contains the absolute time that the watcher is supposed to
		1370	trigger next.
		1371
1103	=back	1372	=back
		1373
		1374	=head3 Examples
1104		1375
1105	Example: Call a callback every hour, or, more precisely, whenever the	1376	Example: Call a callback every hour, or, more precisely, whenever the
1106	system clock is divisible by 3600. The callback invocation times have	1377	system clock is divisible by 3600. The callback invocation times have
1107	potentially a lot of jittering, but good long-term stability.	1378	potentially a lot of jittering, but good long-term stability.
1108		1379
…		…
1148	with the kernel (thus it coexists with your own signal handlers as long	1419	with the kernel (thus it coexists with your own signal handlers as long
1149	as you don't register any with libev). Similarly, when the last signal	1420	as you don't register any with libev). Similarly, when the last signal
1150	watcher for a signal is stopped libev will reset the signal handler to	1421	watcher for a signal is stopped libev will reset the signal handler to
1151	SIG_DFL (regardless of what it was set to before).	1422	SIG_DFL (regardless of what it was set to before).
1152		1423
		1424	=head3 Watcher-Specific Functions and Data Members
		1425
1153	=over 4	1426	=over 4
1154		1427
1155	=item ev_signal_init (ev_signal *, callback, int signum)	1428	=item ev_signal_init (ev_signal *, callback, int signum)
1156		1429
1157	=item ev_signal_set (ev_signal *, int signum)	1430	=item ev_signal_set (ev_signal *, int signum)
…		…
1163		1436
1164	The signal the watcher watches out for.	1437	The signal the watcher watches out for.
1165		1438
1166	=back	1439	=back
1167		1440
		1441	=head3 Examples
		1442
		1443	Example: Try to exit cleanly on SIGINT and SIGTERM.
		1444
		1445	static void
		1446	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
		1447	{
		1448	ev_unloop (loop, EVUNLOOP_ALL);
		1449	}
		1450
		1451	struct ev_signal signal_watcher;
		1452	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
		1453	ev_signal_start (loop, &sigint_cb);
		1454
1168		1455
1169	=head2 C<ev_child> - watch out for process status changes	1456	=head2 C<ev_child> - watch out for process status changes
1170		1457
1171	Child watchers trigger when your process receives a SIGCHLD in response to	1458	Child watchers trigger when your process receives a SIGCHLD in response to
1172	some child status changes (most typically when a child of yours dies).	1459	some child status changes (most typically when a child of yours dies). It
		1460	is permissible to install a child watcher I<after> the child has been
		1461	forked (which implies it might have already exited), as long as the event
		1462	loop isn't entered (or is continued from a watcher).
		1463
		1464	Only the default event loop is capable of handling signals, and therefore
		1465	you can only rgeister child watchers in the default event loop.
		1466
		1467	=head3 Process Interaction
		1468
		1469	Libev grabs C<SIGCHLD> as soon as the default event loop is
		1470	initialised. This is necessary to guarantee proper behaviour even if
		1471	the first child watcher is started after the child exits. The occurance
		1472	of C<SIGCHLD> is recorded asynchronously, but child reaping is done
		1473	synchronously as part of the event loop processing. Libev always reaps all
		1474	children, even ones not watched.
		1475
		1476	=head3 Overriding the Built-In Processing
		1477
		1478	Libev offers no special support for overriding the built-in child
		1479	processing, but if your application collides with libev's default child
		1480	handler, you can override it easily by installing your own handler for
		1481	C<SIGCHLD> after initialising the default loop, and making sure the
		1482	default loop never gets destroyed. You are encouraged, however, to use an
		1483	event-based approach to child reaping and thus use libev's support for
		1484	that, so other libev users can use C<ev_child> watchers freely.
		1485
		1486	=head3 Watcher-Specific Functions and Data Members
1173		1487
1174	=over 4	1488	=over 4
1175		1489
1176	=item ev_child_init (ev_child *, callback, int pid)	1490	=item ev_child_init (ev_child *, callback, int pid, int trace)
1177		1491
1178	=item ev_child_set (ev_child *, int pid)	1492	=item ev_child_set (ev_child *, int pid, int trace)
1179		1493
1180	Configures the watcher to wait for status changes of process C<pid> (or	1494	Configures the watcher to wait for status changes of process C<pid> (or
1181	I<any> process if C<pid> is specified as C<0>). The callback can look	1495	I<any> process if C<pid> is specified as C<0>). The callback can look
1182	at the C<rstatus> member of the C<ev_child> watcher structure to see	1496	at the C<rstatus> member of the C<ev_child> watcher structure to see
1183	the status word (use the macros from C<sys/wait.h> and see your systems	1497	the status word (use the macros from C<sys/wait.h> and see your systems
1184	C<waitpid> documentation). The C<rpid> member contains the pid of the	1498	C<waitpid> documentation). The C<rpid> member contains the pid of the
1185	process causing the status change.	1499	process causing the status change. C<trace> must be either C<0> (only
		1500	activate the watcher when the process terminates) or C<1> (additionally
		1501	activate the watcher when the process is stopped or continued).
1186		1502
1187	=item int pid [read-only]	1503	=item int pid [read-only]
1188		1504
1189	The process id this watcher watches out for, or C<0>, meaning any process id.	1505	The process id this watcher watches out for, or C<0>, meaning any process id.
1190		1506
…		…
1197	The process exit/trace status caused by C<rpid> (see your systems	1513	The process exit/trace status caused by C<rpid> (see your systems
1198	C<waitpid> and C<sys/wait.h> documentation for details).	1514	C<waitpid> and C<sys/wait.h> documentation for details).
1199		1515
1200	=back	1516	=back
1201		1517
1202	Example: Try to exit cleanly on SIGINT and SIGTERM.	1518	=head3 Examples
		1519
		1520	Example: C<fork()> a new process and install a child handler to wait for
		1521	its completion.
		1522
		1523	ev_child cw;
1203		1524
1204	static void	1525	static void
1205	sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)	1526	child_cb (EV_P_ struct ev_child *w, int revents)
1206	{	1527	{
1207	ev_unloop (loop, EVUNLOOP_ALL);	1528	ev_child_stop (EV_A_ w);
		1529	printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1208	}	1530	}
1209		1531
1210	struct ev_signal signal_watcher;	1532	pid_t pid = fork ();
1211	ev_signal_init (&signal_watcher, sigint_cb, SIGINT);	1533
1212	ev_signal_start (loop, &sigint_cb);	1534	if (pid < 0)
		1535	// error
		1536	else if (pid == 0)
		1537	{
		1538	// the forked child executes here
		1539	exit (1);
		1540	}
		1541	else
		1542	{
		1543	ev_child_init (&cw, child_cb, pid, 0);
		1544	ev_child_start (EV_DEFAULT_ &cw);
		1545	}
1213		1546
1214		1547
1215	=head2 C<ev_stat> - did the file attributes just change?	1548	=head2 C<ev_stat> - did the file attributes just change?
1216		1549
1217	This watches a filesystem path for attribute changes. That is, it calls	1550	This watches a filesystem path for attribute changes. That is, it calls
…		…
1221	The path does not need to exist: changing from "path exists" to "path does	1554	The path does not need to exist: changing from "path exists" to "path does
1222	not exist" is a status change like any other. The condition "path does	1555	not exist" is a status change like any other. The condition "path does
1223	not exist" is signified by the C<st_nlink> field being zero (which is	1556	not exist" is signified by the C<st_nlink> field being zero (which is
1224	otherwise always forced to be at least one) and all the other fields of	1557	otherwise always forced to be at least one) and all the other fields of
1225	the stat buffer having unspecified contents.	1558	the stat buffer having unspecified contents.
		1559
		1560	The path I<should> be absolute and I<must not> end in a slash. If it is
		1561	relative and your working directory changes, the behaviour is undefined.
1226		1562
1227	Since there is no standard to do this, the portable implementation simply	1563	Since there is no standard to do this, the portable implementation simply
1228	calls C<stat (2)> regularly on the path to see if it changed somehow. You	1564	calls C<stat (2)> regularly on the path to see if it changed somehow. You
1229	can specify a recommended polling interval for this case. If you specify	1565	can specify a recommended polling interval for this case. If you specify
1230	a polling interval of C<0> (highly recommended!) then a I<suitable,	1566	a polling interval of C<0> (highly recommended!) then a I<suitable,
…		…
1243	semantics of C<ev_stat> watchers, which means that libev sometimes needs	1579	semantics of C<ev_stat> watchers, which means that libev sometimes needs
1244	to fall back to regular polling again even with inotify, but changes are	1580	to fall back to regular polling again even with inotify, but changes are
1245	usually detected immediately, and if the file exists there will be no	1581	usually detected immediately, and if the file exists there will be no
1246	polling.	1582	polling.
1247		1583
		1584	=head3 Inotify
		1585
		1586	When C<inotify (7)> support has been compiled into libev (generally only
		1587	available on Linux) and present at runtime, it will be used to speed up
		1588	change detection where possible. The inotify descriptor will be created lazily
		1589	when the first C<ev_stat> watcher is being started.
		1590
		1591	Inotify presense does not change the semantics of C<ev_stat> watchers
		1592	except that changes might be detected earlier, and in some cases, to avoid
		1593	making regular C<stat> calls. Even in the presense of inotify support
		1594	there are many cases where libev has to resort to regular C<stat> polling.
		1595
		1596	(There is no support for kqueue, as apparently it cannot be used to
		1597	implement this functionality, due to the requirement of having a file
		1598	descriptor open on the object at all times).
		1599
		1600	=head3 The special problem of stat time resolution
		1601
		1602	The C<stat ()> syscall only supports full-second resolution portably, and
		1603	even on systems where the resolution is higher, many filesystems still
		1604	only support whole seconds.
		1605
		1606	That means that, if the time is the only thing that changes, you might
		1607	miss updates: on the first update, C<ev_stat> detects a change and calls
		1608	your callback, which does something. When there is another update within
		1609	the same second, C<ev_stat> will be unable to detect it.
		1610
		1611	The solution to this is to delay acting on a change for a second (or till
		1612	the next second boundary), using a roughly one-second delay C<ev_timer>
		1613	(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
		1614	is added to work around small timing inconsistencies of some operating
		1615	systems.
		1616
		1617	=head3 Watcher-Specific Functions and Data Members
		1618
1248	=over 4	1619	=over 4
1249		1620
1250	=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)	1621	=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1251		1622
1252	=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)	1623	=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
…		…
1259		1630
1260	The callback will be receive C<EV_STAT> when a change was detected,	1631	The callback will be receive C<EV_STAT> when a change was detected,
1261	relative to the attributes at the time the watcher was started (or the	1632	relative to the attributes at the time the watcher was started (or the
1262	last change was detected).	1633	last change was detected).
1263		1634
1264	=item ev_stat_stat (ev_stat *)	1635	=item ev_stat_stat (loop, ev_stat *)
1265		1636
1266	Updates the stat buffer immediately with new values. If you change the	1637	Updates the stat buffer immediately with new values. If you change the
1267	watched path in your callback, you could call this fucntion to avoid	1638	watched path in your callback, you could call this fucntion to avoid
1268	detecting this change (while introducing a race condition). Can also be	1639	detecting this change (while introducing a race condition). Can also be
1269	useful simply to find out the new values.	1640	useful simply to find out the new values.
…		…
1287	=item const char *path [read-only]	1658	=item const char *path [read-only]
1288		1659
1289	The filesystem path that is being watched.	1660	The filesystem path that is being watched.
1290		1661
1291	=back	1662	=back
		1663
		1664	=head3 Examples
1292		1665
1293	Example: Watch C</etc/passwd> for attribute changes.	1666	Example: Watch C</etc/passwd> for attribute changes.
1294		1667
1295	static void	1668	static void
1296	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)	1669	passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
…		…
1309	}	1682	}
1310		1683
1311	...	1684	...
1312	ev_stat passwd;	1685	ev_stat passwd;
1313		1686
1314	ev_stat_init (&passwd, passwd_cb, "/etc/passwd");	1687	ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1315	ev_stat_start (loop, &passwd);	1688	ev_stat_start (loop, &passwd);
1316		1689
		1690	Example: Like above, but additionally use a one-second delay so we do not
		1691	miss updates (however, frequent updates will delay processing, too, so
		1692	one might do the work both on C<ev_stat> callback invocation I<and> on
		1693	C<ev_timer> callback invocation).
		1694
		1695	static ev_stat passwd;
		1696	static ev_timer timer;
		1697
		1698	static void
		1699	timer_cb (EV_P_ ev_timer *w, int revents)
		1700	{
		1701	ev_timer_stop (EV_A_ w);
		1702
		1703	/* now it's one second after the most recent passwd change */
		1704	}
		1705
		1706	static void
		1707	stat_cb (EV_P_ ev_stat *w, int revents)
		1708	{
		1709	/* reset the one-second timer */
		1710	ev_timer_again (EV_A_ &timer);
		1711	}
		1712
		1713	...
		1714	ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
		1715	ev_stat_start (loop, &passwd);
		1716	ev_timer_init (&timer, timer_cb, 0., 1.01);
		1717
1317		1718
1318	=head2 C<ev_idle> - when you've got nothing better to do...	1719	=head2 C<ev_idle> - when you've got nothing better to do...
1319		1720
1320	Idle watchers trigger events when there are no other events are pending	1721	Idle watchers trigger events when no other events of the same or higher
1321	(prepare, check and other idle watchers do not count). That is, as long	1722	priority are pending (prepare, check and other idle watchers do not
1322	as your process is busy handling sockets or timeouts (or even signals,	1723	count).
1323	imagine) it will not be triggered. But when your process is idle all idle	1724
1324	watchers are being called again and again, once per event loop iteration -	1725	That is, as long as your process is busy handling sockets or timeouts
		1726	(or even signals, imagine) of the same or higher priority it will not be
		1727	triggered. But when your process is idle (or only lower-priority watchers
		1728	are pending), the idle watchers are being called once per event loop
1325	until stopped, that is, or your process receives more events and becomes	1729	iteration - until stopped, that is, or your process receives more events
1326	busy.	1730	and becomes busy again with higher priority stuff.
1327		1731
1328	The most noteworthy effect is that as long as any idle watchers are	1732	The most noteworthy effect is that as long as any idle watchers are
1329	active, the process will not block when waiting for new events.	1733	active, the process will not block when waiting for new events.
1330		1734
1331	Apart from keeping your process non-blocking (which is a useful	1735	Apart from keeping your process non-blocking (which is a useful
1332	effect on its own sometimes), idle watchers are a good place to do	1736	effect on its own sometimes), idle watchers are a good place to do
1333	"pseudo-background processing", or delay processing stuff to after the	1737	"pseudo-background processing", or delay processing stuff to after the
1334	event loop has handled all outstanding events.	1738	event loop has handled all outstanding events.
1335		1739
		1740	=head3 Watcher-Specific Functions and Data Members
		1741
1336	=over 4	1742	=over 4
1337		1743
1338	=item ev_idle_init (ev_signal *, callback)	1744	=item ev_idle_init (ev_signal *, callback)
1339		1745
1340	Initialises and configures the idle watcher - it has no parameters of any	1746	Initialises and configures the idle watcher - it has no parameters of any
1341	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,	1747	kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1342	believe me.	1748	believe me.
1343		1749
1344	=back	1750	=back
		1751
		1752	=head3 Examples
1345		1753
1346	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the	1754	Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1347	callback, free it. Also, use no error checking, as usual.	1755	callback, free it. Also, use no error checking, as usual.
1348		1756
1349	static void	1757	static void
1350	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)	1758	idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1351	{	1759	{
1352	free (w);	1760	free (w);
1353	// now do something you wanted to do when the program has	1761	// now do something you wanted to do when the program has
1354	// no longer asnything immediate to do.	1762	// no longer anything immediate to do.
1355	}	1763	}
1356		1764
1357	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));	1765	struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1358	ev_idle_init (idle_watcher, idle_cb);	1766	ev_idle_init (idle_watcher, idle_cb);
1359	ev_idle_start (loop, idle_cb);	1767	ev_idle_start (loop, idle_cb);
…		…
1397	with priority higher than or equal to the event loop and one coroutine	1805	with priority higher than or equal to the event loop and one coroutine
1398	of lower priority, but only once, using idle watchers to keep the event	1806	of lower priority, but only once, using idle watchers to keep the event
1399	loop from blocking if lower-priority coroutines are active, thus mapping	1807	loop from blocking if lower-priority coroutines are active, thus mapping
1400	low-priority coroutines to idle/background tasks).	1808	low-priority coroutines to idle/background tasks).
1401		1809
		1810	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
		1811	priority, to ensure that they are being run before any other watchers
		1812	after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
		1813	too) should not activate ("feed") events into libev. While libev fully
		1814	supports this, they will be called before other C<ev_check> watchers
		1815	did their job. As C<ev_check> watchers are often used to embed other
		1816	(non-libev) event loops those other event loops might be in an unusable
		1817	state until their C<ev_check> watcher ran (always remind yourself to
		1818	coexist peacefully with others).
		1819
		1820	=head3 Watcher-Specific Functions and Data Members
		1821
1402	=over 4	1822	=over 4
1403		1823
1404	=item ev_prepare_init (ev_prepare *, callback)	1824	=item ev_prepare_init (ev_prepare *, callback)
1405		1825
1406	=item ev_check_init (ev_check *, callback)	1826	=item ev_check_init (ev_check *, callback)
…		…
1409	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>	1829	parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1410	macros, but using them is utterly, utterly and completely pointless.	1830	macros, but using them is utterly, utterly and completely pointless.
1411		1831
1412	=back	1832	=back
1413		1833
1414	Example: To include a library such as adns, you would add IO watchers	1834	=head3 Examples
1415	and a timeout watcher in a prepare handler, as required by libadns, and	1835
		1836	There are a number of principal ways to embed other event loops or modules
		1837	into libev. Here are some ideas on how to include libadns into libev
		1838	(there is a Perl module named C<EV::ADNS> that does this, which you could
		1839	use for an actually working example. Another Perl module named C<EV::Glib>
		1840	embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
		1841	into the Glib event loop).
		1842
		1843	Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1416	in a check watcher, destroy them and call into libadns. What follows is	1844	and in a check watcher, destroy them and call into libadns. What follows
1417	pseudo-code only of course:	1845	is pseudo-code only of course. This requires you to either use a low
		1846	priority for the check watcher or use C<ev_clear_pending> explicitly, as
		1847	the callbacks for the IO/timeout watchers might not have been called yet.
1418		1848
1419	static ev_io iow [nfd];	1849	static ev_io iow [nfd];
1420	static ev_timer tw;	1850	static ev_timer tw;
1421		1851
1422	static void	1852	static void
1423	io_cb (ev_loop *loop, ev_io *w, int revents)	1853	io_cb (ev_loop *loop, ev_io *w, int revents)
1424	{	1854	{
1425	// set the relevant poll flags
1426	// could also call adns_processreadable etc. here
1427	struct pollfd *fd = (struct pollfd *)w->data;
1428	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1429	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1430	}	1855	}
1431		1856
1432	// create io watchers for each fd and a timer before blocking	1857	// create io watchers for each fd and a timer before blocking
1433	static void	1858	static void
1434	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)	1859	adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1435	{	1860	{
1436	int timeout = 3600000;truct pollfd fds [nfd];	1861	int timeout = 3600000;
		1862	struct pollfd fds [nfd];
1437	// actual code will need to loop here and realloc etc.	1863	// actual code will need to loop here and realloc etc.
1438	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));	1864	adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1439		1865
1440	/* the callback is illegal, but won't be called as we stop during check */	1866	/* the callback is illegal, but won't be called as we stop during check */
1441	ev_timer_init (&tw, 0, timeout * 1e-3);	1867	ev_timer_init (&tw, 0, timeout * 1e-3);
1442	ev_timer_start (loop, &tw);	1868	ev_timer_start (loop, &tw);
1443		1869
1444	// create on ev_io per pollfd	1870	// create one ev_io per pollfd
1445	for (int i = 0; i < nfd; ++i)	1871	for (int i = 0; i < nfd; ++i)
1446	{	1872	{
1447	ev_io_init (iow + i, io_cb, fds [i].fd,	1873	ev_io_init (iow + i, io_cb, fds [i].fd,
1448	((fds [i].events & POLLIN ? EV_READ : 0)	1874	((fds [i].events & POLLIN ? EV_READ : 0)
1449	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));	1875	| (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1450		1876
1451	fds [i].revents = 0;	1877	fds [i].revents = 0;
1452	iow [i].data = fds + i;
1453	ev_io_start (loop, iow + i);	1878	ev_io_start (loop, iow + i);
1454	}	1879	}
1455	}	1880	}
1456		1881
1457	// stop all watchers after blocking	1882	// stop all watchers after blocking
…		…
1459	adns_check_cb (ev_loop *loop, ev_check *w, int revents)	1884	adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1460	{	1885	{
1461	ev_timer_stop (loop, &tw);	1886	ev_timer_stop (loop, &tw);
1462		1887
1463	for (int i = 0; i < nfd; ++i)	1888	for (int i = 0; i < nfd; ++i)
		1889	{
		1890	// set the relevant poll flags
		1891	// could also call adns_processreadable etc. here
		1892	struct pollfd *fd = fds + i;
		1893	int revents = ev_clear_pending (iow + i);
		1894	if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
		1895	if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
		1896
		1897	// now stop the watcher
1464	ev_io_stop (loop, iow + i);	1898	ev_io_stop (loop, iow + i);
		1899	}
1465		1900
1466	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));	1901	adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
		1902	}
		1903
		1904	Method 2: This would be just like method 1, but you run C<adns_afterpoll>
		1905	in the prepare watcher and would dispose of the check watcher.
		1906
		1907	Method 3: If the module to be embedded supports explicit event
		1908	notification (adns does), you can also make use of the actual watcher
		1909	callbacks, and only destroy/create the watchers in the prepare watcher.
		1910
		1911	static void
		1912	timer_cb (EV_P_ ev_timer *w, int revents)
		1913	{
		1914	adns_state ads = (adns_state)w->data;
		1915	update_now (EV_A);
		1916
		1917	adns_processtimeouts (ads, &tv_now);
		1918	}
		1919
		1920	static void
		1921	io_cb (EV_P_ ev_io *w, int revents)
		1922	{
		1923	adns_state ads = (adns_state)w->data;
		1924	update_now (EV_A);
		1925
		1926	if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
		1927	if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
		1928	}
		1929
		1930	// do not ever call adns_afterpoll
		1931
		1932	Method 4: Do not use a prepare or check watcher because the module you
		1933	want to embed is too inflexible to support it. Instead, youc na override
		1934	their poll function. The drawback with this solution is that the main
		1935	loop is now no longer controllable by EV. The C<Glib::EV> module does
		1936	this.
		1937
		1938	static gint
		1939	event_poll_func (GPollFD *fds, guint nfds, gint timeout)
		1940	{
		1941	int got_events = 0;
		1942
		1943	for (n = 0; n < nfds; ++n)
		1944	// create/start io watcher that sets the relevant bits in fds[n] and increment got_events
		1945
		1946	if (timeout >= 0)
		1947	// create/start timer
		1948
		1949	// poll
		1950	ev_loop (EV_A_ 0);
		1951
		1952	// stop timer again
		1953	if (timeout >= 0)
		1954	ev_timer_stop (EV_A_ &to);
		1955
		1956	// stop io watchers again - their callbacks should have set
		1957	for (n = 0; n < nfds; ++n)
		1958	ev_io_stop (EV_A_ iow [n]);
		1959
		1960	return got_events;
1467	}	1961	}
1468		1962
1469		1963
1470	=head2 C<ev_embed> - when one backend isn't enough...	1964	=head2 C<ev_embed> - when one backend isn't enough...
1471		1965
…		…
1514	portable one.	2008	portable one.
1515		2009
1516	So when you want to use this feature you will always have to be prepared	2010	So when you want to use this feature you will always have to be prepared
1517	that you cannot get an embeddable loop. The recommended way to get around	2011	that you cannot get an embeddable loop. The recommended way to get around
1518	this is to have a separate variables for your embeddable loop, try to	2012	this is to have a separate variables for your embeddable loop, try to
1519	create it, and if that fails, use the normal loop for everything:	2013	create it, and if that fails, use the normal loop for everything.
		2014
		2015	=head3 Watcher-Specific Functions and Data Members
		2016
		2017	=over 4
		2018
		2019	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
		2020
		2021	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
		2022
		2023	Configures the watcher to embed the given loop, which must be
		2024	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
		2025	invoked automatically, otherwise it is the responsibility of the callback
		2026	to invoke it (it will continue to be called until the sweep has been done,
		2027	if you do not want thta, you need to temporarily stop the embed watcher).
		2028
		2029	=item ev_embed_sweep (loop, ev_embed *)
		2030
		2031	Make a single, non-blocking sweep over the embedded loop. This works
		2032	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
		2033	apropriate way for embedded loops.
		2034
		2035	=item struct ev_loop *other [read-only]
		2036
		2037	The embedded event loop.
		2038
		2039	=back
		2040
		2041	=head3 Examples
		2042
		2043	Example: Try to get an embeddable event loop and embed it into the default
		2044	event loop. If that is not possible, use the default loop. The default
		2045	loop is stored in C<loop_hi>, while the mebeddable loop is stored in
		2046	C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
		2047	used).
1520		2048
1521	struct ev_loop *loop_hi = ev_default_init (0);	2049	struct ev_loop *loop_hi = ev_default_init (0);
1522	struct ev_loop *loop_lo = 0;	2050	struct ev_loop *loop_lo = 0;
1523	struct ev_embed embed;	2051	struct ev_embed embed;
1524		2052
…		…
1535	ev_embed_start (loop_hi, &embed);	2063	ev_embed_start (loop_hi, &embed);
1536	}	2064	}
1537	else	2065	else
1538	loop_lo = loop_hi;	2066	loop_lo = loop_hi;
1539		2067
1540	=over 4	2068	Example: Check if kqueue is available but not recommended and create
		2069	a kqueue backend for use with sockets (which usually work with any
		2070	kqueue implementation). Store the kqueue/socket-only event loop in
		2071	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1541		2072
1542	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	2073	struct ev_loop *loop = ev_default_init (0);
		2074	struct ev_loop *loop_socket = 0;
		2075	struct ev_embed embed;
		2076
		2077	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
		2078	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
		2079	{
		2080	ev_embed_init (&embed, 0, loop_socket);
		2081	ev_embed_start (loop, &embed);
		2082	}
1543		2083
1544	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	2084	if (!loop_socket)
		2085	loop_socket = loop;
1545		2086
1546	Configures the watcher to embed the given loop, which must be	2087	// now use loop_socket for all sockets, and loop for everything else
1547	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1548	invoked automatically, otherwise it is the responsibility of the callback
1549	to invoke it (it will continue to be called until the sweep has been done,
1550	if you do not want thta, you need to temporarily stop the embed watcher).
1551
1552	=item ev_embed_sweep (loop, ev_embed *)
1553
1554	Make a single, non-blocking sweep over the embedded loop. This works
1555	similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1556	apropriate way for embedded loops.
1557
1558	=item struct ev_loop *loop [read-only]
1559
1560	The embedded event loop.
1561
1562	=back
1563		2088
1564		2089
1565	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	2090	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1566		2091
1567	Fork watchers are called when a C<fork ()> was detected (usually because	2092	Fork watchers are called when a C<fork ()> was detected (usually because
…		…
1570	event loop blocks next and before C<ev_check> watchers are being called,	2095	event loop blocks next and before C<ev_check> watchers are being called,
1571	and only in the child after the fork. If whoever good citizen calling	2096	and only in the child after the fork. If whoever good citizen calling
1572	C<ev_default_fork> cheats and calls it in the wrong process, the fork	2097	C<ev_default_fork> cheats and calls it in the wrong process, the fork
1573	handlers will be invoked, too, of course.	2098	handlers will be invoked, too, of course.
1574		2099
		2100	=head3 Watcher-Specific Functions and Data Members
		2101
1575	=over 4	2102	=over 4
1576		2103
1577	=item ev_fork_init (ev_signal *, callback)	2104	=item ev_fork_init (ev_signal *, callback)
1578		2105
1579	Initialises and configures the fork watcher - it has no parameters of any	2106	Initialises and configures the fork watcher - it has no parameters of any
1580	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	2107	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1581	believe me.	2108	believe me.
		2109
		2110	=back
		2111
		2112
		2113	=head2 C<ev_async> - how to wake up another event loop
		2114
		2115	In general, you cannot use an C<ev_loop> from multiple threads or other
		2116	asynchronous sources such as signal handlers (as opposed to multiple event
		2117	loops - those are of course safe to use in different threads).
		2118
		2119	Sometimes, however, you need to wake up another event loop you do not
		2120	control, for example because it belongs to another thread. This is what
		2121	C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
		2122	can signal it by calling C<ev_async_send>, which is thread- and signal
		2123	safe.
		2124
		2125	This functionality is very similar to C<ev_signal> watchers, as signals,
		2126	too, are asynchronous in nature, and signals, too, will be compressed
		2127	(i.e. the number of callback invocations may be less than the number of
		2128	C<ev_async_sent> calls).
		2129
		2130	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
		2131	just the default loop.
		2132
		2133	=head3 Queueing
		2134
		2135	C<ev_async> does not support queueing of data in any way. The reason
		2136	is that the author does not know of a simple (or any) algorithm for a
		2137	multiple-writer-single-reader queue that works in all cases and doesn't
		2138	need elaborate support such as pthreads.
		2139
		2140	That means that if you want to queue data, you have to provide your own
		2141	queue. But at least I can tell you would implement locking around your
		2142	queue:
		2143
		2144	=over 4
		2145
		2146	=item queueing from a signal handler context
		2147
		2148	To implement race-free queueing, you simply add to the queue in the signal
		2149	handler but you block the signal handler in the watcher callback. Here is an example that does that for
		2150	some fictitiuous SIGUSR1 handler:
		2151
		2152	static ev_async mysig;
		2153
		2154	static void
		2155	sigusr1_handler (void)
		2156	{
		2157	sometype data;
		2158
		2159	// no locking etc.
		2160	queue_put (data);
		2161	ev_async_send (EV_DEFAULT_ &mysig);
		2162	}
		2163
		2164	static void
		2165	mysig_cb (EV_P_ ev_async *w, int revents)
		2166	{
		2167	sometype data;
		2168	sigset_t block, prev;
		2169
		2170	sigemptyset (&block);
		2171	sigaddset (&block, SIGUSR1);
		2172	sigprocmask (SIG_BLOCK, &block, &prev);
		2173
		2174	while (queue_get (&data))
		2175	process (data);
		2176
		2177	if (sigismember (&prev, SIGUSR1)
		2178	sigprocmask (SIG_UNBLOCK, &block, 0);
		2179	}
		2180
		2181	(Note: pthreads in theory requires you to use C<pthread_setmask>
		2182	instead of C<sigprocmask> when you use threads, but libev doesn't do it
		2183	either...).
		2184
		2185	=item queueing from a thread context
		2186
		2187	The strategy for threads is different, as you cannot (easily) block
		2188	threads but you can easily preempt them, so to queue safely you need to
		2189	employ a traditional mutex lock, such as in this pthread example:
		2190
		2191	static ev_async mysig;
		2192	static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
		2193
		2194	static void
		2195	otherthread (void)
		2196	{
		2197	// only need to lock the actual queueing operation
		2198	pthread_mutex_lock (&mymutex);
		2199	queue_put (data);
		2200	pthread_mutex_unlock (&mymutex);
		2201
		2202	ev_async_send (EV_DEFAULT_ &mysig);
		2203	}
		2204
		2205	static void
		2206	mysig_cb (EV_P_ ev_async *w, int revents)
		2207	{
		2208	pthread_mutex_lock (&mymutex);
		2209
		2210	while (queue_get (&data))
		2211	process (data);
		2212
		2213	pthread_mutex_unlock (&mymutex);
		2214	}
		2215
		2216	=back
		2217
		2218
		2219	=head3 Watcher-Specific Functions and Data Members
		2220
		2221	=over 4
		2222
		2223	=item ev_async_init (ev_async *, callback)
		2224
		2225	Initialises and configures the async watcher - it has no parameters of any
		2226	kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
		2227	believe me.
		2228
		2229	=item ev_async_send (loop, ev_async *)
		2230
		2231	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
		2232	an C<EV_ASYNC> event on the watcher into the event loop. Unlike
		2233	C<ev_feed_event>, this call is safe to do in other threads, signal or
		2234	similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding
		2235	section below on what exactly this means).
		2236
		2237	This call incurs the overhead of a syscall only once per loop iteration,
		2238	so while the overhead might be noticable, it doesn't apply to repeated
		2239	calls to C<ev_async_send>.
1582		2240
1583	=back	2241	=back
1584		2242
1585		2243
1586	=head1 OTHER FUNCTIONS	2244	=head1 OTHER FUNCTIONS
…		…
1675		2333
1676	To use it,	2334	To use it,
1677		2335
1678	#include <ev++.h>	2336	#include <ev++.h>
1679		2337
1680	(it is not installed by default). This automatically includes F<ev.h>	2338	This automatically includes F<ev.h> and puts all of its definitions (many
1681	and puts all of its definitions (many of them macros) into the global	2339	of them macros) into the global namespace. All C++ specific things are
1682	namespace. All C++ specific things are put into the C<ev> namespace.	2340	put into the C<ev> namespace. It should support all the same embedding
		2341	options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1683		2342
1684	It should support all the same embedding options as F<ev.h>, most notably	2343	Care has been taken to keep the overhead low. The only data member the C++
1685	C<EV_MULTIPLICITY>.	2344	classes add (compared to plain C-style watchers) is the event loop pointer
		2345	that the watcher is associated with (or no additional members at all if
		2346	you disable C<EV_MULTIPLICITY> when embedding libev).
		2347
		2348	Currently, functions, and static and non-static member functions can be
		2349	used as callbacks. Other types should be easy to add as long as they only
		2350	need one additional pointer for context. If you need support for other
		2351	types of functors please contact the author (preferably after implementing
		2352	it).
1686		2353
1687	Here is a list of things available in the C<ev> namespace:	2354	Here is a list of things available in the C<ev> namespace:
1688		2355
1689	=over 4	2356	=over 4
1690		2357
…		…
1706		2373
1707	All of those classes have these methods:	2374	All of those classes have these methods:
1708		2375
1709	=over 4	2376	=over 4
1710		2377
1711	=item ev::TYPE::TYPE (object *, object::method *)	2378	=item ev::TYPE::TYPE ()
1712		2379
1713	=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *)	2380	=item ev::TYPE::TYPE (struct ev_loop *)
1714		2381
1715	=item ev::TYPE::~TYPE	2382	=item ev::TYPE::~TYPE
1716		2383
1717	The constructor takes a pointer to an object and a method pointer to	2384	The constructor (optionally) takes an event loop to associate the watcher
1718	the event handler callback to call in this class. The constructor calls	2385	with. If it is omitted, it will use C<EV_DEFAULT>.
1719	C<ev_init> for you, which means you have to call the C<set> method	2386
1720	before starting it. If you do not specify a loop then the constructor	2387	The constructor calls C<ev_init> for you, which means you have to call the
1721	automatically associates the default loop with this watcher.	2388	C<set> method before starting it.
		2389
		2390	It will not set a callback, however: You have to call the templated C<set>
		2391	method to set a callback before you can start the watcher.
		2392
		2393	(The reason why you have to use a method is a limitation in C++ which does
		2394	not allow explicit template arguments for constructors).
1722		2395
1723	The destructor automatically stops the watcher if it is active.	2396	The destructor automatically stops the watcher if it is active.
		2397
		2398	=item w->set<class, &class::method> (object *)
		2399
		2400	This method sets the callback method to call. The method has to have a
		2401	signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
		2402	first argument and the C<revents> as second. The object must be given as
		2403	parameter and is stored in the C<data> member of the watcher.
		2404
		2405	This method synthesizes efficient thunking code to call your method from
		2406	the C callback that libev requires. If your compiler can inline your
		2407	callback (i.e. it is visible to it at the place of the C<set> call and
		2408	your compiler is good :), then the method will be fully inlined into the
		2409	thunking function, making it as fast as a direct C callback.
		2410
		2411	Example: simple class declaration and watcher initialisation
		2412
		2413	struct myclass
		2414	{
		2415	void io_cb (ev::io &w, int revents) { }
		2416	}
		2417
		2418	myclass obj;
		2419	ev::io iow;
		2420	iow.set <myclass, &myclass::io_cb> (&obj);
		2421
		2422	=item w->set<function> (void *data = 0)
		2423
		2424	Also sets a callback, but uses a static method or plain function as
		2425	callback. The optional C<data> argument will be stored in the watcher's
		2426	C<data> member and is free for you to use.
		2427
		2428	The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
		2429
		2430	See the method-C<set> above for more details.
		2431
		2432	Example:
		2433
		2434	static void io_cb (ev::io &w, int revents) { }
		2435	iow.set <io_cb> ();
1724		2436
1725	=item w->set (struct ev_loop *)	2437	=item w->set (struct ev_loop *)
1726		2438
1727	Associates a different C<struct ev_loop> with this watcher. You can only	2439	Associates a different C<struct ev_loop> with this watcher. You can only
1728	do this when the watcher is inactive (and not pending either).	2440	do this when the watcher is inactive (and not pending either).
1729		2441
1730	=item w->set ([args])	2442	=item w->set ([args])
1731		2443
1732	Basically the same as C<ev_TYPE_set>, with the same args. Must be	2444	Basically the same as C<ev_TYPE_set>, with the same args. Must be
1733	called at least once. Unlike the C counterpart, an active watcher gets	2445	called at least once. Unlike the C counterpart, an active watcher gets
1734	automatically stopped and restarted.	2446	automatically stopped and restarted when reconfiguring it with this
		2447	method.
1735		2448
1736	=item w->start ()	2449	=item w->start ()
1737		2450
1738	Starts the watcher. Note that there is no C<loop> argument as the	2451	Starts the watcher. Note that there is no C<loop> argument, as the
1739	constructor already takes the loop.	2452	constructor already stores the event loop.
1740		2453
1741	=item w->stop ()	2454	=item w->stop ()
1742		2455
1743	Stops the watcher if it is active. Again, no C<loop> argument.	2456	Stops the watcher if it is active. Again, no C<loop> argument.
1744		2457
1745	=item w->again () C<ev::timer>, C<ev::periodic> only	2458	=item w->again () (C<ev::timer>, C<ev::periodic> only)
1746		2459
1747	For C<ev::timer> and C<ev::periodic>, this invokes the corresponding	2460	For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1748	C<ev_TYPE_again> function.	2461	C<ev_TYPE_again> function.
1749		2462
1750	=item w->sweep () C<ev::embed> only	2463	=item w->sweep () (C<ev::embed> only)
1751		2464
1752	Invokes C<ev_embed_sweep>.	2465	Invokes C<ev_embed_sweep>.
1753		2466
1754	=item w->update () C<ev::stat> only	2467	=item w->update () (C<ev::stat> only)
1755		2468
1756	Invokes C<ev_stat_stat>.	2469	Invokes C<ev_stat_stat>.
1757		2470
1758	=back	2471	=back
1759		2472
…		…
1762	Example: Define a class with an IO and idle watcher, start one of them in	2475	Example: Define a class with an IO and idle watcher, start one of them in
1763	the constructor.	2476	the constructor.
1764		2477
1765	class myclass	2478	class myclass
1766	{	2479	{
1767	ev_io io; void io_cb (ev::io &w, int revents);	2480	ev::io io; void io_cb (ev::io &w, int revents);
1768	ev_idle idle void idle_cb (ev::idle &w, int revents);	2481	ev:idle idle void idle_cb (ev::idle &w, int revents);
1769		2482
1770	myclass ();	2483	myclass (int fd)
1771	}
1772
1773	myclass::myclass (int fd)
1774	: io (this, &myclass::io_cb),
1775	idle (this, &myclass::idle_cb)
1776	{	2484	{
		2485	io .set <myclass, &myclass::io_cb > (this);
		2486	idle.set <myclass, &myclass::idle_cb> (this);
		2487
1777	io.start (fd, ev::READ);	2488	io.start (fd, ev::READ);
		2489	}
1778	}	2490	};
1779		2491
1780		2492
1781	=head1 MACRO MAGIC	2493	=head1 MACRO MAGIC
1782		2494
1783	Libev can be compiled with a variety of options, the most fundemantal is	2495	Libev can be compiled with a variety of options, the most fundamantal
1784	C<EV_MULTIPLICITY>. This option determines wether (most) functions and	2496	of which is C<EV_MULTIPLICITY>. This option determines whether (most)
1785	callbacks have an initial C<struct ev_loop *> argument.	2497	functions and callbacks have an initial C<struct ev_loop *> argument.
1786		2498
1787	To make it easier to write programs that cope with either variant, the	2499	To make it easier to write programs that cope with either variant, the
1788	following macros are defined:	2500	following macros are defined:
1789		2501
1790	=over 4	2502	=over 4
…		…
1822	Similar to the other two macros, this gives you the value of the default	2534	Similar to the other two macros, this gives you the value of the default
1823	loop, if multiple loops are supported ("ev loop default").	2535	loop, if multiple loops are supported ("ev loop default").
1824		2536
1825	=back	2537	=back
1826		2538
1827	Example: Declare and initialise a check watcher, working regardless of	2539	Example: Declare and initialise a check watcher, utilising the above
1828	wether multiple loops are supported or not.	2540	macros so it will work regardless of whether multiple loops are supported
		2541	or not.
1829		2542
1830	static void	2543	static void
1831	check_cb (EV_P_ ev_timer *w, int revents)	2544	check_cb (EV_P_ ev_timer *w, int revents)
1832	{	2545	{
1833	ev_check_stop (EV_A_ w);	2546	ev_check_stop (EV_A_ w);
…		…
1836	ev_check check;	2549	ev_check check;
1837	ev_check_init (&check, check_cb);	2550	ev_check_init (&check, check_cb);
1838	ev_check_start (EV_DEFAULT_ &check);	2551	ev_check_start (EV_DEFAULT_ &check);
1839	ev_loop (EV_DEFAULT_ 0);	2552	ev_loop (EV_DEFAULT_ 0);
1840		2553
1841
1842	=head1 EMBEDDING	2554	=head1 EMBEDDING
1843		2555
1844	Libev can (and often is) directly embedded into host	2556	Libev can (and often is) directly embedded into host
1845	applications. Examples of applications that embed it include the Deliantra	2557	applications. Examples of applications that embed it include the Deliantra
1846	Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)	2558	Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1847	and rxvt-unicode.	2559	and rxvt-unicode.
1848		2560
1849	The goal is to enable you to just copy the neecssary files into your	2561	The goal is to enable you to just copy the necessary files into your
1850	source directory without having to change even a single line in them, so	2562	source directory without having to change even a single line in them, so
1851	you can easily upgrade by simply copying (or having a checked-out copy of	2563	you can easily upgrade by simply copying (or having a checked-out copy of
1852	libev somewhere in your source tree).	2564	libev somewhere in your source tree).
1853		2565
1854	=head2 FILESETS	2566	=head2 FILESETS
…		…
1885	ev_vars.h	2597	ev_vars.h
1886	ev_wrap.h	2598	ev_wrap.h
1887		2599
1888	ev_win32.c required on win32 platforms only	2600	ev_win32.c required on win32 platforms only
1889		2601
1890	ev_select.c only when select backend is enabled (which is by default)	2602	ev_select.c only when select backend is enabled (which is enabled by default)
1891	ev_poll.c only when poll backend is enabled (disabled by default)	2603	ev_poll.c only when poll backend is enabled (disabled by default)
1892	ev_epoll.c only when the epoll backend is enabled (disabled by default)	2604	ev_epoll.c only when the epoll backend is enabled (disabled by default)
1893	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	2605	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1894	ev_port.c only when the solaris port backend is enabled (disabled by default)	2606	ev_port.c only when the solaris port backend is enabled (disabled by default)
1895		2607
…		…
1944		2656
1945	If defined to be C<1>, libev will try to detect the availability of the	2657	If defined to be C<1>, libev will try to detect the availability of the
1946	monotonic clock option at both compiletime and runtime. Otherwise no use	2658	monotonic clock option at both compiletime and runtime. Otherwise no use
1947	of the monotonic clock option will be attempted. If you enable this, you	2659	of the monotonic clock option will be attempted. If you enable this, you
1948	usually have to link against librt or something similar. Enabling it when	2660	usually have to link against librt or something similar. Enabling it when
1949	the functionality isn't available is safe, though, althoguh you have	2661	the functionality isn't available is safe, though, although you have
1950	to make sure you link against any libraries where the C<clock_gettime>	2662	to make sure you link against any libraries where the C<clock_gettime>
1951	function is hiding in (often F<-lrt>).	2663	function is hiding in (often F<-lrt>).
1952		2664
1953	=item EV_USE_REALTIME	2665	=item EV_USE_REALTIME
1954		2666
1955	If defined to be C<1>, libev will try to detect the availability of the	2667	If defined to be C<1>, libev will try to detect the availability of the
1956	realtime clock option at compiletime (and assume its availability at	2668	realtime clock option at compiletime (and assume its availability at
1957	runtime if successful). Otherwise no use of the realtime clock option will	2669	runtime if successful). Otherwise no use of the realtime clock option will
1958	be attempted. This effectively replaces C<gettimeofday> by C<clock_get	2670	be attempted. This effectively replaces C<gettimeofday> by C<clock_get
1959	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries	2671	(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
1960	in the description of C<EV_USE_MONOTONIC>, though.	2672	note about libraries in the description of C<EV_USE_MONOTONIC>, though.
		2673
		2674	=item EV_USE_NANOSLEEP
		2675
		2676	If defined to be C<1>, libev will assume that C<nanosleep ()> is available
		2677	and will use it for delays. Otherwise it will use C<select ()>.
1961		2678
1962	=item EV_USE_SELECT	2679	=item EV_USE_SELECT
1963		2680
1964	If undefined or defined to be C<1>, libev will compile in support for the	2681	If undefined or defined to be C<1>, libev will compile in support for the
1965	C<select>(2) backend. No attempt at autodetection will be done: if no	2682	C<select>(2) backend. No attempt at autodetection will be done: if no
…		…
1983	wants osf handles on win32 (this is the case when the select to	2700	wants osf handles on win32 (this is the case when the select to
1984	be used is the winsock select). This means that it will call	2701	be used is the winsock select). This means that it will call
1985	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,	2702	C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
1986	it is assumed that all these functions actually work on fds, even	2703	it is assumed that all these functions actually work on fds, even
1987	on win32. Should not be defined on non-win32 platforms.	2704	on win32. Should not be defined on non-win32 platforms.
		2705
		2706	=item EV_FD_TO_WIN32_HANDLE
		2707
		2708	If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
		2709	file descriptors to socket handles. When not defining this symbol (the
		2710	default), then libev will call C<_get_osfhandle>, which is usually
		2711	correct. In some cases, programs use their own file descriptor management,
		2712	in which case they can provide this function to map fds to socket handles.
1988		2713
1989	=item EV_USE_POLL	2714	=item EV_USE_POLL
1990		2715
1991	If defined to be C<1>, libev will compile in support for the C<poll>(2)	2716	If defined to be C<1>, libev will compile in support for the C<poll>(2)
1992	backend. Otherwise it will be enabled on non-win32 platforms. It	2717	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
2026		2751
2027	If defined to be C<1>, libev will compile in support for the Linux inotify	2752	If defined to be C<1>, libev will compile in support for the Linux inotify
2028	interface to speed up C<ev_stat> watchers. Its actual availability will	2753	interface to speed up C<ev_stat> watchers. Its actual availability will
2029	be detected at runtime.	2754	be detected at runtime.
2030		2755
		2756	=item EV_ATOMIC_T
		2757
		2758	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
		2759	access is atomic with respect to other threads or signal contexts. No such
		2760	type is easily found in the C language, so you can provide your own type
		2761	that you know is safe for your purposes. It is used both for signal handler "locking"
		2762	as well as for signal and thread safety in C<ev_async> watchers.
		2763
		2764	In the absense of this define, libev will use C<sig_atomic_t volatile>
		2765	(from F<signal.h>), which is usually good enough on most platforms.
		2766
2031	=item EV_H	2767	=item EV_H
2032		2768
2033	The name of the F<ev.h> header file used to include it. The default if	2769	The name of the F<ev.h> header file used to include it. The default if
2034	undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This	2770	undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2035	can be used to virtually rename the F<ev.h> header file in case of conflicts.	2771	used to virtually rename the F<ev.h> header file in case of conflicts.
2036		2772
2037	=item EV_CONFIG_H	2773	=item EV_CONFIG_H
2038		2774
2039	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override	2775	If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2040	F<ev.c>'s idea of where to find the F<config.h> file, similarly to	2776	F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2041	C<EV_H>, above.	2777	C<EV_H>, above.
2042		2778
2043	=item EV_EVENT_H	2779	=item EV_EVENT_H
2044		2780
2045	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea	2781	Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2046	of how the F<event.h> header can be found.	2782	of how the F<event.h> header can be found, the default is C<"event.h">.
2047		2783
2048	=item EV_PROTOTYPES	2784	=item EV_PROTOTYPES
2049		2785
2050	If defined to be C<0>, then F<ev.h> will not define any function	2786	If defined to be C<0>, then F<ev.h> will not define any function
2051	prototypes, but still define all the structs and other symbols. This is	2787	prototypes, but still define all the structs and other symbols. This is
…		…
2058	will have the C<struct ev_loop *> as first argument, and you can create	2794	will have the C<struct ev_loop *> as first argument, and you can create
2059	additional independent event loops. Otherwise there will be no support	2795	additional independent event loops. Otherwise there will be no support
2060	for multiple event loops and there is no first event loop pointer	2796	for multiple event loops and there is no first event loop pointer
2061	argument. Instead, all functions act on the single default loop.	2797	argument. Instead, all functions act on the single default loop.
2062		2798
		2799	=item EV_MINPRI
		2800
		2801	=item EV_MAXPRI
		2802
		2803	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
		2804	C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
		2805	provide for more priorities by overriding those symbols (usually defined
		2806	to be C<-2> and C<2>, respectively).
		2807
		2808	When doing priority-based operations, libev usually has to linearly search
		2809	all the priorities, so having many of them (hundreds) uses a lot of space
		2810	and time, so using the defaults of five priorities (-2 .. +2) is usually
		2811	fine.
		2812
		2813	If your embedding app does not need any priorities, defining these both to
		2814	C<0> will save some memory and cpu.
		2815
2063	=item EV_PERIODIC_ENABLE	2816	=item EV_PERIODIC_ENABLE
2064		2817
2065	If undefined or defined to be C<1>, then periodic timers are supported. If	2818	If undefined or defined to be C<1>, then periodic timers are supported. If
2066	defined to be C<0>, then they are not. Disabling them saves a few kB of	2819	defined to be C<0>, then they are not. Disabling them saves a few kB of
2067	code.	2820	code.
2068		2821
		2822	=item EV_IDLE_ENABLE
		2823
		2824	If undefined or defined to be C<1>, then idle watchers are supported. If
		2825	defined to be C<0>, then they are not. Disabling them saves a few kB of
		2826	code.
		2827
2069	=item EV_EMBED_ENABLE	2828	=item EV_EMBED_ENABLE
2070		2829
2071	If undefined or defined to be C<1>, then embed watchers are supported. If	2830	If undefined or defined to be C<1>, then embed watchers are supported. If
2072	defined to be C<0>, then they are not.	2831	defined to be C<0>, then they are not.
2073		2832
…		…
2077	defined to be C<0>, then they are not.	2836	defined to be C<0>, then they are not.
2078		2837
2079	=item EV_FORK_ENABLE	2838	=item EV_FORK_ENABLE
2080		2839
2081	If undefined or defined to be C<1>, then fork watchers are supported. If	2840	If undefined or defined to be C<1>, then fork watchers are supported. If
		2841	defined to be C<0>, then they are not.
		2842
		2843	=item EV_ASYNC_ENABLE
		2844
		2845	If undefined or defined to be C<1>, then async watchers are supported. If
2082	defined to be C<0>, then they are not.	2846	defined to be C<0>, then they are not.
2083		2847
2084	=item EV_MINIMAL	2848	=item EV_MINIMAL
2085		2849
2086	If you need to shave off some kilobytes of code at the expense of some	2850	If you need to shave off some kilobytes of code at the expense of some
…		…
2094	than enough. If you need to manage thousands of children you might want to	2858	than enough. If you need to manage thousands of children you might want to
2095	increase this value (I<must> be a power of two).	2859	increase this value (I<must> be a power of two).
2096		2860
2097	=item EV_INOTIFY_HASHSIZE	2861	=item EV_INOTIFY_HASHSIZE
2098		2862
2099	C<ev_staz> watchers use a small hash table to distribute workload by	2863	C<ev_stat> watchers use a small hash table to distribute workload by
2100	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),	2864	inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2101	usually more than enough. If you need to manage thousands of C<ev_stat>	2865	usually more than enough. If you need to manage thousands of C<ev_stat>
2102	watchers you might want to increase this value (I<must> be a power of	2866	watchers you might want to increase this value (I<must> be a power of
2103	two).	2867	two).
2104		2868
…		…
2121		2885
2122	=item ev_set_cb (ev, cb)	2886	=item ev_set_cb (ev, cb)
2123		2887
2124	Can be used to change the callback member declaration in each watcher,	2888	Can be used to change the callback member declaration in each watcher,
2125	and the way callbacks are invoked and set. Must expand to a struct member	2889	and the way callbacks are invoked and set. Must expand to a struct member
2126	definition and a statement, respectively. See the F<ev.v> header file for	2890	definition and a statement, respectively. See the F<ev.h> header file for
2127	their default definitions. One possible use for overriding these is to	2891	their default definitions. One possible use for overriding these is to
2128	avoid the C<struct ev_loop *> as first argument in all cases, or to use	2892	avoid the C<struct ev_loop *> as first argument in all cases, or to use
2129	method calls instead of plain function calls in C++.	2893	method calls instead of plain function calls in C++.
		2894
		2895	=head2 EXPORTED API SYMBOLS
		2896
		2897	If you need to re-export the API (e.g. via a dll) and you need a list of
		2898	exported symbols, you can use the provided F<Symbol.*> files which list
		2899	all public symbols, one per line:
		2900
		2901	Symbols.ev for libev proper
		2902	Symbols.event for the libevent emulation
		2903
		2904	This can also be used to rename all public symbols to avoid clashes with
		2905	multiple versions of libev linked together (which is obviously bad in
		2906	itself, but sometimes it is inconvinient to avoid this).
		2907
		2908	A sed command like this will create wrapper C<#define>'s that you need to
		2909	include before including F<ev.h>:
		2910
		2911	<Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
		2912
		2913	This would create a file F<wrap.h> which essentially looks like this:
		2914
		2915	#define ev_backend myprefix_ev_backend
		2916	#define ev_check_start myprefix_ev_check_start
		2917	#define ev_check_stop myprefix_ev_check_stop
		2918	...
2130		2919
2131	=head2 EXAMPLES	2920	=head2 EXAMPLES
2132		2921
2133	For a real-world example of a program the includes libev	2922	For a real-world example of a program the includes libev
2134	verbatim, you can have a look at the EV perl module	2923	verbatim, you can have a look at the EV perl module
…		…
2137	interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file	2926	interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2138	will be compiled. It is pretty complex because it provides its own header	2927	will be compiled. It is pretty complex because it provides its own header
2139	file.	2928	file.
2140		2929
2141	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file	2930	The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2142	that everybody includes and which overrides some autoconf choices:	2931	that everybody includes and which overrides some configure choices:
2143		2932
		2933	#define EV_MINIMAL 1
2144	#define EV_USE_POLL 0	2934	#define EV_USE_POLL 0
2145	#define EV_MULTIPLICITY 0	2935	#define EV_MULTIPLICITY 0
2146	#define EV_PERIODICS 0	2936	#define EV_PERIODIC_ENABLE 0
		2937	#define EV_STAT_ENABLE 0
		2938	#define EV_FORK_ENABLE 0
2147	#define EV_CONFIG_H <config.h>	2939	#define EV_CONFIG_H <config.h>
		2940	#define EV_MINPRI 0
		2941	#define EV_MAXPRI 0
2148		2942
2149	#include "ev++.h"	2943	#include "ev++.h"
2150		2944
2151	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	2945	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2152		2946
…		…
2158		2952
2159	In this section the complexities of (many of) the algorithms used inside	2953	In this section the complexities of (many of) the algorithms used inside
2160	libev will be explained. For complexity discussions about backends see the	2954	libev will be explained. For complexity discussions about backends see the
2161	documentation for C<ev_default_init>.	2955	documentation for C<ev_default_init>.
2162		2956
		2957	All of the following are about amortised time: If an array needs to be
		2958	extended, libev needs to realloc and move the whole array, but this
		2959	happens asymptotically never with higher number of elements, so O(1) might
		2960	mean it might do a lengthy realloc operation in rare cases, but on average
		2961	it is much faster and asymptotically approaches constant time.
		2962
2163	=over 4	2963	=over 4
2164		2964
2165	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)	2965	=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2166		2966
		2967	This means that, when you have a watcher that triggers in one hour and
		2968	there are 100 watchers that would trigger before that then inserting will
		2969	have to skip roughly seven (C<ld 100>) of these watchers.
		2970
2167	=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)	2971	=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2168		2972
		2973	That means that changing a timer costs less than removing/adding them
		2974	as only the relative motion in the event queue has to be paid for.
		2975
2169	=item Starting io/check/prepare/idle/signal/child watchers: O(1)	2976	=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2170		2977
		2978	These just add the watcher into an array or at the head of a list.
		2979
2171	=item Stopping check/prepare/idle watchers: O(1)	2980	=item Stopping check/prepare/idle/fork/async watchers: O(1)
2172		2981
2173	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))	2982	=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2174		2983
		2984	These watchers are stored in lists then need to be walked to find the
		2985	correct watcher to remove. The lists are usually short (you don't usually
		2986	have many watchers waiting for the same fd or signal).
		2987
2175	=item Finding the next timer per loop iteration: O(1)	2988	=item Finding the next timer in each loop iteration: O(1)
		2989
		2990	By virtue of using a binary heap, the next timer is always found at the
		2991	beginning of the storage array.
2176		2992
2177	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)	2993	=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2178		2994
2179	=item Activating one watcher: O(1)	2995	A change means an I/O watcher gets started or stopped, which requires
		2996	libev to recalculate its status (and possibly tell the kernel, depending
		2997	on backend and wether C<ev_io_set> was used).
		2998
		2999	=item Activating one watcher (putting it into the pending state): O(1)
		3000
		3001	=item Priority handling: O(number_of_priorities)
		3002
		3003	Priorities are implemented by allocating some space for each
		3004	priority. When doing priority-based operations, libev usually has to
		3005	linearly search all the priorities, but starting/stopping and activating
		3006	watchers becomes O(1) w.r.t. priority handling.
		3007
		3008	=item Sending an ev_async: O(1)
		3009
		3010	=item Processing ev_async_send: O(number_of_async_watchers)
		3011
		3012	=item Processing signals: O(max_signal_number)
		3013
		3014	Sending involves a syscall I<iff> there were no other C<ev_async_send>
		3015	calls in the current loop iteration. Checking for async and signal events
		3016	involves iterating over all running async watchers or all signal numbers.
2180		3017
2181	=back	3018	=back
2182		3019
2183		3020
		3021	=head1 Win32 platform limitations and workarounds
		3022
		3023	Win32 doesn't support any of the standards (e.g. POSIX) that libev
		3024	requires, and its I/O model is fundamentally incompatible with the POSIX
		3025	model. Libev still offers limited functionality on this platform in
		3026	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
		3027	descriptors. This only applies when using Win32 natively, not when using
		3028	e.g. cygwin.
		3029
		3030	There is no supported compilation method available on windows except
		3031	embedding it into other applications.
		3032
		3033	Due to the many, low, and arbitrary limits on the win32 platform and the
		3034	abysmal performance of winsockets, using a large number of sockets is not
		3035	recommended (and not reasonable). If your program needs to use more than
		3036	a hundred or so sockets, then likely it needs to use a totally different
		3037	implementation for windows, as libev offers the POSIX model, which cannot
		3038	be implemented efficiently on windows (microsoft monopoly games).
		3039
		3040	=over 4
		3041
		3042	=item The winsocket select function
		3043
		3044	The winsocket C<select> function doesn't follow POSIX in that it requires
		3045	socket I<handles> and not socket I<file descriptors>. This makes select
		3046	very inefficient, and also requires a mapping from file descriptors
		3047	to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
		3048	C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
		3049	symbols for more info.
		3050
		3051	The configuration for a "naked" win32 using the microsoft runtime
		3052	libraries and raw winsocket select is:
		3053
		3054	#define EV_USE_SELECT 1
		3055	#define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
		3056
		3057	Note that winsockets handling of fd sets is O(n), so you can easily get a
		3058	complexity in the O(n²) range when using win32.
		3059
		3060	=item Limited number of file descriptors
		3061
		3062	Windows has numerous arbitrary (and low) limits on things. Early versions
		3063	of winsocket's select only supported waiting for a max. of C<64> handles
		3064	(probably owning to the fact that all windows kernels can only wait for
		3065	C<64> things at the same time internally; microsoft recommends spawning a
		3066	chain of threads and wait for 63 handles and the previous thread in each).
		3067
		3068	Newer versions support more handles, but you need to define C<FD_SETSIZE>
		3069	to some high number (e.g. C<2048>) before compiling the winsocket select
		3070	call (which might be in libev or elsewhere, for example, perl does its own
		3071	select emulation on windows).
		3072
		3073	Another limit is the number of file descriptors in the microsoft runtime
		3074	libraries, which by default is C<64> (there must be a hidden I<64> fetish
		3075	or something like this inside microsoft). You can increase this by calling
		3076	C<_setmaxstdio>, which can increase this limit to C<2048> (another
		3077	arbitrary limit), but is broken in many versions of the microsoft runtime
		3078	libraries.
		3079
		3080	This might get you to about C<512> or C<2048> sockets (depending on
		3081	windows version and/or the phase of the moon). To get more, you need to
		3082	wrap all I/O functions and provide your own fd management, but the cost of
		3083	calling select (O(n²)) will likely make this unworkable.
		3084
		3085	=back
		3086
		3087
2184	=head1 AUTHOR	3088	=head1 AUTHOR
2185		3089
2186	Marc Lehmann <libev@schmorp.de>.	3090	Marc Lehmann <libev@schmorp.de>.
2187		3091

Diff Legend

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