ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libev/ev.pod

Comparing libev/ev.pod (file contents):
Revision 1.316 by root, Fri Oct 22 09:34:01 2010 UTC vs.
Revision 1.440 by root, Tue Jan 31 09:31:43 2017 UTC

		1	=encoding utf-8
		2
1	=head1 NAME	3	=head1 NAME
2		4
3	libev - a high performance full-featured event loop written in C	5	libev - a high performance full-featured event loop written in C
4		6
5	=head1 SYNOPSIS	7	=head1 SYNOPSIS
…		…
43		45
44	int	46	int
45	main (void)	47	main (void)
46	{	48	{
47	// use the default event loop unless you have special needs	49	// use the default event loop unless you have special needs
48	struct ev_loop *loop = ev_default_loop (0);	50	struct ev_loop *loop = EV_DEFAULT;
49		51
50	// initialise an io watcher, then start it	52	// initialise an io watcher, then start it
51	// this one will watch for stdin to become readable	53	// this one will watch for stdin to become readable
52	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);	54	ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53	ev_io_start (loop, &stdin_watcher);	55	ev_io_start (loop, &stdin_watcher);
…		…
58	ev_timer_start (loop, &timeout_watcher);	60	ev_timer_start (loop, &timeout_watcher);
59		61
60	// now wait for events to arrive	62	// now wait for events to arrive
61	ev_run (loop, 0);	63	ev_run (loop, 0);
62		64
63	// unloop was called, so exit	65	// break was called, so exit
64	return 0;	66	return 0;
65	}	67	}
66		68
67	=head1 ABOUT THIS DOCUMENT	69	=head1 ABOUT THIS DOCUMENT
68		70
…		…
77	on event-based programming, nor will it introduce event-based programming	79	on event-based programming, nor will it introduce event-based programming
78	with libev.	80	with libev.
79		81
80	Familiarity with event based programming techniques in general is assumed	82	Familiarity with event based programming techniques in general is assumed
81	throughout this document.	83	throughout this document.
		84
		85	=head1 WHAT TO READ WHEN IN A HURRY
		86
		87	This manual tries to be very detailed, but unfortunately, this also makes
		88	it very long. If you just want to know the basics of libev, I suggest
		89	reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
		90	look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
		91	C<ev_timer> sections in L</WATCHER TYPES>.
82		92
83	=head1 ABOUT LIBEV	93	=head1 ABOUT LIBEV
84		94
85	Libev is an event loop: you register interest in certain events (such as a	95	Libev is an event loop: you register interest in certain events (such as a
86	file descriptor being readable or a timeout occurring), and it will manage	96	file descriptor being readable or a timeout occurring), and it will manage
…		…
124	this argument.	134	this argument.
125		135
126	=head2 TIME REPRESENTATION	136	=head2 TIME REPRESENTATION
127		137
128	Libev represents time as a single floating point number, representing	138	Libev represents time as a single floating point number, representing
129	the (fractional) number of seconds since the (POSIX) epoch (in practise	139	the (fractional) number of seconds since the (POSIX) epoch (in practice
130	somewhere near the beginning of 1970, details are complicated, don't	140	somewhere near the beginning of 1970, details are complicated, don't
131	ask). This type is called C<ev_tstamp>, which is what you should use	141	ask). This type is called C<ev_tstamp>, which is what you should use
132	too. It usually aliases to the C<double> type in C. When you need to do	142	too. It usually aliases to the C<double> type in C. When you need to do
133	any calculations on it, you should treat it as some floating point value.	143	any calculations on it, you should treat it as some floating point value.
134		144
…		…
165		175
166	=item ev_tstamp ev_time ()	176	=item ev_tstamp ev_time ()
167		177
168	Returns the current time as libev would use it. Please note that the	178	Returns the current time as libev would use it. Please note that the
169	C<ev_now> function is usually faster and also often returns the timestamp	179	C<ev_now> function is usually faster and also often returns the timestamp
170	you actually want to know.	180	you actually want to know. Also interesting is the combination of
		181	C<ev_now_update> and C<ev_now>.
171		182
172	=item ev_sleep (ev_tstamp interval)	183	=item ev_sleep (ev_tstamp interval)
173		184
174	Sleep for the given interval: The current thread will be blocked until	185	Sleep for the given interval: The current thread will be blocked
175	either it is interrupted or the given time interval has passed. Basically	186	until either it is interrupted or the given time interval has
		187	passed (approximately - it might return a bit earlier even if not
		188	interrupted). Returns immediately if C<< interval <= 0 >>.
		189
176	this is a sub-second-resolution C<sleep ()>.	190	Basically this is a sub-second-resolution C<sleep ()>.
		191
		192	The range of the C<interval> is limited - libev only guarantees to work
		193	with sleep times of up to one day (C<< interval <= 86400 >>).
177		194
178	=item int ev_version_major ()	195	=item int ev_version_major ()
179		196
180	=item int ev_version_minor ()	197	=item int ev_version_minor ()
181		198
…		…
192	as this indicates an incompatible change. Minor versions are usually	209	as this indicates an incompatible change. Minor versions are usually
193	compatible to older versions, so a larger minor version alone is usually	210	compatible to older versions, so a larger minor version alone is usually
194	not a problem.	211	not a problem.
195		212
196	Example: Make sure we haven't accidentally been linked against the wrong	213	Example: Make sure we haven't accidentally been linked against the wrong
197	version (note, however, that this will not detect ABI mismatches :).	214	version (note, however, that this will not detect other ABI mismatches,
		215	such as LFS or reentrancy).
198		216
199	assert (("libev version mismatch",	217	assert (("libev version mismatch",
200	ev_version_major () == EV_VERSION_MAJOR	218	ev_version_major () == EV_VERSION_MAJOR
201	&& ev_version_minor () >= EV_VERSION_MINOR));	219	&& ev_version_minor () >= EV_VERSION_MINOR));
202		220
…		…
213	assert (("sorry, no epoll, no sex",	231	assert (("sorry, no epoll, no sex",
214	ev_supported_backends () & EVBACKEND_EPOLL));	232	ev_supported_backends () & EVBACKEND_EPOLL));
215		233
216	=item unsigned int ev_recommended_backends ()	234	=item unsigned int ev_recommended_backends ()
217		235
218	Return the set of all backends compiled into this binary of libev and also	236	Return the set of all backends compiled into this binary of libev and
219	recommended for this platform. This set is often smaller than the one	237	also recommended for this platform, meaning it will work for most file
		238	descriptor types. This set is often smaller than the one returned by
220	returned by C<ev_supported_backends>, as for example kqueue is broken on	239	C<ev_supported_backends>, as for example kqueue is broken on most BSDs
221	most BSDs and will not be auto-detected unless you explicitly request it	240	and will not be auto-detected unless you explicitly request it (assuming
222	(assuming you know what you are doing). This is the set of backends that	241	you know what you are doing). This is the set of backends that libev will
223	libev will probe for if you specify no backends explicitly.	242	probe for if you specify no backends explicitly.
224		243
225	=item unsigned int ev_embeddable_backends ()	244	=item unsigned int ev_embeddable_backends ()
226		245
227	Returns the set of backends that are embeddable in other event loops. This	246	Returns the set of backends that are embeddable in other event loops. This
228	is the theoretical, all-platform, value. To find which backends	247	value is platform-specific but can include backends not available on the
229	might be supported on the current system, you would need to look at	248	current system. To find which embeddable backends might be supported on
230	C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for	249	the current system, you would need to look at C<ev_embeddable_backends ()
231	recommended ones.	250	& ev_supported_backends ()>, likewise for recommended ones.
232		251
233	See the description of C<ev_embed> watchers for more info.	252	See the description of C<ev_embed> watchers for more info.
234		253
235	=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]	254	=item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ())
236		255
237	Sets the allocation function to use (the prototype is similar - the	256	Sets the allocation function to use (the prototype is similar - the
238	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is	257	semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
239	used to allocate and free memory (no surprises here). If it returns zero	258	used to allocate and free memory (no surprises here). If it returns zero
240	when memory needs to be allocated (C<size != 0>), the library might abort	259	when memory needs to be allocated (C<size != 0>), the library might abort
…		…
266	}	285	}
267		286
268	...	287	...
269	ev_set_allocator (persistent_realloc);	288	ev_set_allocator (persistent_realloc);
270		289
271	=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]	290	=item ev_set_syserr_cb (void (*cb)(const char *msg) throw ())
272		291
273	Set the callback function to call on a retryable system call error (such	292	Set the callback function to call on a retryable system call error (such
274	as failed select, poll, epoll_wait). The message is a printable string	293	as failed select, poll, epoll_wait). The message is a printable string
275	indicating the system call or subsystem causing the problem. If this	294	indicating the system call or subsystem causing the problem. If this
276	callback is set, then libev will expect it to remedy the situation, no	295	callback is set, then libev will expect it to remedy the situation, no
…		…
288	}	307	}
289		308
290	...	309	...
291	ev_set_syserr_cb (fatal_error);	310	ev_set_syserr_cb (fatal_error);
292		311
		312	=item ev_feed_signal (int signum)
		313
		314	This function can be used to "simulate" a signal receive. It is completely
		315	safe to call this function at any time, from any context, including signal
		316	handlers or random threads.
		317
		318	Its main use is to customise signal handling in your process, especially
		319	in the presence of threads. For example, you could block signals
		320	by default in all threads (and specifying C<EVFLAG_NOSIGMASK> when
		321	creating any loops), and in one thread, use C<sigwait> or any other
		322	mechanism to wait for signals, then "deliver" them to libev by calling
		323	C<ev_feed_signal>.
		324
293	=back	325	=back
294		326
295	=head1 FUNCTIONS CONTROLLING THE EVENT LOOP	327	=head1 FUNCTIONS CONTROLLING EVENT LOOPS
296		328
297	An event loop is described by a C<struct ev_loop *> (the C<struct> is	329	An event loop is described by a C<struct ev_loop *> (the C<struct> is
298	I<not> optional in this case unless libev 3 compatibility is disabled, as	330	I<not> optional in this case unless libev 3 compatibility is disabled, as
299	libev 3 had an C<ev_loop> function colliding with the struct name).	331	libev 3 had an C<ev_loop> function colliding with the struct name).
300		332
301	The library knows two types of such loops, the I<default> loop, which	333	The library knows two types of such loops, the I<default> loop, which
302	supports signals and child events, and dynamically created event loops	334	supports child process events, and dynamically created event loops which
303	which do not.	335	do not.
304		336
305	=over 4	337	=over 4
306		338
307	=item struct ev_loop *ev_default_loop (unsigned int flags)	339	=item struct ev_loop *ev_default_loop (unsigned int flags)
308		340
309	This will initialise the default event loop if it hasn't been initialised	341	This returns the "default" event loop object, which is what you should
310	yet and return it. If the default loop could not be initialised, returns	342	normally use when you just need "the event loop". Event loop objects and
311	false. If it already was initialised it simply returns it (and ignores the	343	the C<flags> parameter are described in more detail in the entry for
312	flags. If that is troubling you, check C<ev_backend ()> afterwards).	344	C<ev_loop_new>.
		345
		346	If the default loop is already initialised then this function simply
		347	returns it (and ignores the flags. If that is troubling you, check
		348	C<ev_backend ()> afterwards). Otherwise it will create it with the given
		349	flags, which should almost always be C<0>, unless the caller is also the
		350	one calling C<ev_run> or otherwise qualifies as "the main program".
313		351
314	If you don't know what event loop to use, use the one returned from this	352	If you don't know what event loop to use, use the one returned from this
315	function.	353	function (or via the C<EV_DEFAULT> macro).
316		354
317	Note that this function is I<not> thread-safe, so if you want to use it	355	Note that this function is I<not> thread-safe, so if you want to use it
318	from multiple threads, you have to lock (note also that this is unlikely,	356	from multiple threads, you have to employ some kind of mutex (note also
319	as loops cannot be shared easily between threads anyway).	357	that this case is unlikely, as loops cannot be shared easily between
		358	threads anyway).
320		359
321	The default loop is the only loop that can handle C<ev_signal> and	360	The default loop is the only loop that can handle C<ev_child> watchers,
322	C<ev_child> watchers, and to do this, it always registers a handler	361	and to do this, it always registers a handler for C<SIGCHLD>. If this is
323	for C<SIGCHLD>. If this is a problem for your application you can either	362	a problem for your application you can either create a dynamic loop with
324	create a dynamic loop with C<ev_loop_new> that doesn't do that, or you	363	C<ev_loop_new> which doesn't do that, or you can simply overwrite the
325	can simply overwrite the C<SIGCHLD> signal handler I<after> calling	364	C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
326	C<ev_default_init>.	365
		366	Example: This is the most typical usage.
		367
		368	if (!ev_default_loop (0))
		369	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
		370
		371	Example: Restrict libev to the select and poll backends, and do not allow
		372	environment settings to be taken into account:
		373
		374	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
		375
		376	=item struct ev_loop *ev_loop_new (unsigned int flags)
		377
		378	This will create and initialise a new event loop object. If the loop
		379	could not be initialised, returns false.
		380
		381	This function is thread-safe, and one common way to use libev with
		382	threads is indeed to create one loop per thread, and using the default
		383	loop in the "main" or "initial" thread.
327		384
328	The flags argument can be used to specify special behaviour or specific	385	The flags argument can be used to specify special behaviour or specific
329	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).	386	backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
330		387
331	The following flags are supported:	388	The following flags are supported:
…		…
341		398
342	If this flag bit is or'ed into the flag value (or the program runs setuid	399	If this flag bit is or'ed into the flag value (or the program runs setuid
343	or setgid) then libev will I<not> look at the environment variable	400	or setgid) then libev will I<not> look at the environment variable
344	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will	401	C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
345	override the flags completely if it is found in the environment. This is	402	override the flags completely if it is found in the environment. This is
346	useful to try out specific backends to test their performance, or to work	403	useful to try out specific backends to test their performance, to work
347	around bugs.	404	around bugs, or to make libev threadsafe (accessing environment variables
		405	cannot be done in a threadsafe way, but usually it works if no other
		406	thread modifies them).
348		407
349	=item C<EVFLAG_FORKCHECK>	408	=item C<EVFLAG_FORKCHECK>
350		409
351	Instead of calling C<ev_loop_fork> manually after a fork, you can also	410	Instead of calling C<ev_loop_fork> manually after a fork, you can also
352	make libev check for a fork in each iteration by enabling this flag.	411	make libev check for a fork in each iteration by enabling this flag.
…		…
357	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence	416	GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
358	without a system call and thus I<very> fast, but my GNU/Linux system also has	417	without a system call and thus I<very> fast, but my GNU/Linux system also has
359	C<pthread_atfork> which is even faster).	418	C<pthread_atfork> which is even faster).
360		419
361	The big advantage of this flag is that you can forget about fork (and	420	The big advantage of this flag is that you can forget about fork (and
362	forget about forgetting to tell libev about forking) when you use this	421	forget about forgetting to tell libev about forking, although you still
363	flag.	422	have to ignore C<SIGPIPE>) when you use this flag.
364		423
365	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>	424	This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
366	environment variable.	425	environment variable.
367		426
368	=item C<EVFLAG_NOINOTIFY>	427	=item C<EVFLAG_NOINOTIFY>
369		428
370	When this flag is specified, then libev will not attempt to use the	429	When this flag is specified, then libev will not attempt to use the
371	I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and	430	I<inotify> API for its C<ev_stat> watchers. Apart from debugging and
372	testing, this flag can be useful to conserve inotify file descriptors, as	431	testing, this flag can be useful to conserve inotify file descriptors, as
373	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.	432	otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374		433
375	=item C<EVFLAG_SIGNALFD>	434	=item C<EVFLAG_SIGNALFD>
376		435
377	When this flag is specified, then libev will attempt to use the	436	When this flag is specified, then libev will attempt to use the
378	I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API	437	I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API
379	delivers signals synchronously, which makes it both faster and might make	438	delivers signals synchronously, which makes it both faster and might make
380	it possible to get the queued signal data. It can also simplify signal	439	it possible to get the queued signal data. It can also simplify signal
381	handling with threads, as long as you properly block signals in your	440	handling with threads, as long as you properly block signals in your
382	threads that are not interested in handling them.	441	threads that are not interested in handling them.
383		442
384	Signalfd will not be used by default as this changes your signal mask, and	443	Signalfd will not be used by default as this changes your signal mask, and
385	there are a lot of shoddy libraries and programs (glib's threadpool for	444	there are a lot of shoddy libraries and programs (glib's threadpool for
386	example) that can't properly initialise their signal masks.	445	example) that can't properly initialise their signal masks.
		446
		447	=item C<EVFLAG_NOSIGMASK>
		448
		449	When this flag is specified, then libev will avoid to modify the signal
		450	mask. Specifically, this means you have to make sure signals are unblocked
		451	when you want to receive them.
		452
		453	This behaviour is useful when you want to do your own signal handling, or
		454	want to handle signals only in specific threads and want to avoid libev
		455	unblocking the signals.
		456
		457	It's also required by POSIX in a threaded program, as libev calls
		458	C<sigprocmask>, whose behaviour is officially unspecified.
		459
		460	This flag's behaviour will become the default in future versions of libev.
387		461
388	=item C<EVBACKEND_SELECT> (value 1, portable select backend)	462	=item C<EVBACKEND_SELECT> (value 1, portable select backend)
389		463
390	This is your standard select(2) backend. Not I<completely> standard, as	464	This is your standard select(2) backend. Not I<completely> standard, as
391	libev tries to roll its own fd_set with no limits on the number of fds,	465	libev tries to roll its own fd_set with no limits on the number of fds,
…		…
419	=item C<EVBACKEND_EPOLL> (value 4, Linux)	493	=item C<EVBACKEND_EPOLL> (value 4, Linux)
420		494
421	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9	495	Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422	kernels).	496	kernels).
423		497
424	For few fds, this backend is a bit little slower than poll and select,	498	For few fds, this backend is a bit little slower than poll and select, but
425	but it scales phenomenally better. While poll and select usually scale	499	it scales phenomenally better. While poll and select usually scale like
426	like O(total_fds) where n is the total number of fds (or the highest fd),	500	O(total_fds) where total_fds is the total number of fds (or the highest
427	epoll scales either O(1) or O(active_fds).	501	fd), epoll scales either O(1) or O(active_fds).
428		502
429	The epoll mechanism deserves honorable mention as the most misdesigned	503	The epoll mechanism deserves honorable mention as the most misdesigned
430	of the more advanced event mechanisms: mere annoyances include silently	504	of the more advanced event mechanisms: mere annoyances include silently
431	dropping file descriptors, requiring a system call per change per file	505	dropping file descriptors, requiring a system call per change per file
432	descriptor (and unnecessary guessing of parameters), problems with dup and	506	descriptor (and unnecessary guessing of parameters), problems with dup,
		507	returning before the timeout value, resulting in additional iterations
		508	(and only giving 5ms accuracy while select on the same platform gives
433	so on. The biggest issue is fork races, however - if a program forks then	509	0.1ms) and so on. The biggest issue is fork races, however - if a program
434	I<both> parent and child process have to recreate the epoll set, which can	510	forks then I<both> parent and child process have to recreate the epoll
435	take considerable time (one syscall per file descriptor) and is of course	511	set, which can take considerable time (one syscall per file descriptor)
436	hard to detect.	512	and is of course hard to detect.
437		513
438	Epoll is also notoriously buggy - embedding epoll fds I<should> work, but	514	Epoll is also notoriously buggy - embedding epoll fds I<should> work,
439	of course I<doesn't>, and epoll just loves to report events for totally	515	but of course I<doesn't>, and epoll just loves to report events for
440	I<different> file descriptors (even already closed ones, so one cannot	516	totally I<different> file descriptors (even already closed ones, so
441	even remove them from the set) than registered in the set (especially	517	one cannot even remove them from the set) than registered in the set
442	on SMP systems). Libev tries to counter these spurious notifications by	518	(especially on SMP systems). Libev tries to counter these spurious
443	employing an additional generation counter and comparing that against the	519	notifications by employing an additional generation counter and comparing
444	events to filter out spurious ones, recreating the set when required. Last	520	that against the events to filter out spurious ones, recreating the set
		521	when required. Epoll also erroneously rounds down timeouts, but gives you
		522	no way to know when and by how much, so sometimes you have to busy-wait
		523	because epoll returns immediately despite a nonzero timeout. And last
445	not least, it also refuses to work with some file descriptors which work	524	not least, it also refuses to work with some file descriptors which work
446	perfectly fine with C<select> (files, many character devices...).	525	perfectly fine with C<select> (files, many character devices...).
		526
		527	Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
		528	cobbled together in a hurry, no thought to design or interaction with
		529	others. Oh, the pain, will it ever stop...
447		530
448	While stopping, setting and starting an I/O watcher in the same iteration	531	While stopping, setting and starting an I/O watcher in the same iteration
449	will result in some caching, there is still a system call per such	532	will result in some caching, there is still a system call per such
450	incident (because the same I<file descriptor> could point to a different	533	incident (because the same I<file descriptor> could point to a different
451	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed	534	I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
…		…
488		571
489	It scales in the same way as the epoll backend, but the interface to the	572	It scales in the same way as the epoll backend, but the interface to the
490	kernel is more efficient (which says nothing about its actual speed, of	573	kernel is more efficient (which says nothing about its actual speed, of
491	course). While stopping, setting and starting an I/O watcher does never	574	course). While stopping, setting and starting an I/O watcher does never
492	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to	575	cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
493	two event changes per incident. Support for C<fork ()> is very bad (but	576	two event changes per incident. Support for C<fork ()> is very bad (you
494	sane, unlike epoll) and it drops fds silently in similarly hard-to-detect	577	might have to leak fd's on fork, but it's more sane than epoll) and it
495	cases	578	drops fds silently in similarly hard-to-detect cases.
496		579
497	This backend usually performs well under most conditions.	580	This backend usually performs well under most conditions.
498		581
499	While nominally embeddable in other event loops, this doesn't work	582	While nominally embeddable in other event loops, this doesn't work
500	everywhere, so you might need to test for this. And since it is broken	583	everywhere, so you might need to test for this. And since it is broken
…		…
517	=item C<EVBACKEND_PORT> (value 32, Solaris 10)	600	=item C<EVBACKEND_PORT> (value 32, Solaris 10)
518		601
519	This uses the Solaris 10 event port mechanism. As with everything on Solaris,	602	This uses the Solaris 10 event port mechanism. As with everything on Solaris,
520	it's really slow, but it still scales very well (O(active_fds)).	603	it's really slow, but it still scales very well (O(active_fds)).
521		604
522	Please note that Solaris event ports can deliver a lot of spurious
523	notifications, so you need to use non-blocking I/O or other means to avoid
524	blocking when no data (or space) is available.
525
526	While this backend scales well, it requires one system call per active	605	While this backend scales well, it requires one system call per active
527	file descriptor per loop iteration. For small and medium numbers of file	606	file descriptor per loop iteration. For small and medium numbers of file
528	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend	607	descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
529	might perform better.	608	might perform better.
530		609
531	On the positive side, with the exception of the spurious readiness	610	On the positive side, this backend actually performed fully to
532	notifications, this backend actually performed fully to specification
533	in all tests and is fully embeddable, which is a rare feat among the	611	specification in all tests and is fully embeddable, which is a rare feat
534	OS-specific backends (I vastly prefer correctness over speed hacks).	612	among the OS-specific backends (I vastly prefer correctness over speed
		613	hacks).
		614
		615	On the negative side, the interface is I<bizarre> - so bizarre that
		616	even sun itself gets it wrong in their code examples: The event polling
		617	function sometimes returns events to the caller even though an error
		618	occurred, but with no indication whether it has done so or not (yes, it's
		619	even documented that way) - deadly for edge-triggered interfaces where you
		620	absolutely have to know whether an event occurred or not because you have
		621	to re-arm the watcher.
		622
		623	Fortunately libev seems to be able to work around these idiocies.
535		624
536	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as	625	This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
537	C<EVBACKEND_POLL>.	626	C<EVBACKEND_POLL>.
538		627
539	=item C<EVBACKEND_ALL>	628	=item C<EVBACKEND_ALL>
540		629
541	Try all backends (even potentially broken ones that wouldn't be tried	630	Try all backends (even potentially broken ones that wouldn't be tried
542	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as	631	with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
543	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.	632	C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
544		633
545	It is definitely not recommended to use this flag.	634	It is definitely not recommended to use this flag, use whatever
		635	C<ev_recommended_backends ()> returns, or simply do not specify a backend
		636	at all.
		637
		638	=item C<EVBACKEND_MASK>
		639
		640	Not a backend at all, but a mask to select all backend bits from a
		641	C<flags> value, in case you want to mask out any backends from a flags
		642	value (e.g. when modifying the C<LIBEV_FLAGS> environment variable).
546		643
547	=back	644	=back
548		645
549	If one or more of the backend flags are or'ed into the flags value,	646	If one or more of the backend flags are or'ed into the flags value,
550	then only these backends will be tried (in the reverse order as listed	647	then only these backends will be tried (in the reverse order as listed
551	here). If none are specified, all backends in C<ev_recommended_backends	648	here). If none are specified, all backends in C<ev_recommended_backends
552	()> will be tried.	649	()> will be tried.
553		650
554	Example: This is the most typical usage.
555
556	if (!ev_default_loop (0))
557	fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
558
559	Example: Restrict libev to the select and poll backends, and do not allow
560	environment settings to be taken into account:
561
562	ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
563
564	Example: Use whatever libev has to offer, but make sure that kqueue is
565	used if available (warning, breaks stuff, best use only with your own
566	private event loop and only if you know the OS supports your types of
567	fds):
568
569	ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
570
571	=item struct ev_loop *ev_loop_new (unsigned int flags)
572
573	Similar to C<ev_default_loop>, but always creates a new event loop that is
574	always distinct from the default loop.
575
576	Note that this function I<is> thread-safe, and one common way to use
577	libev with threads is indeed to create one loop per thread, and using the
578	default loop in the "main" or "initial" thread.
579
580	Example: Try to create a event loop that uses epoll and nothing else.	651	Example: Try to create a event loop that uses epoll and nothing else.
581		652
582	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);	653	struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
583	if (!epoller)	654	if (!epoller)
584	fatal ("no epoll found here, maybe it hides under your chair");	655	fatal ("no epoll found here, maybe it hides under your chair");
585		656
		657	Example: Use whatever libev has to offer, but make sure that kqueue is
		658	used if available.
		659
		660	struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
		661
586	=item ev_default_destroy ()	662	=item ev_loop_destroy (loop)
587		663
588	Destroys the default loop (frees all memory and kernel state etc.). None	664	Destroys an event loop object (frees all memory and kernel state
589	of the active event watchers will be stopped in the normal sense, so	665	etc.). None of the active event watchers will be stopped in the normal
590	e.g. C<ev_is_active> might still return true. It is your responsibility to	666	sense, so e.g. C<ev_is_active> might still return true. It is your
591	either stop all watchers cleanly yourself I<before> calling this function,	667	responsibility to either stop all watchers cleanly yourself I<before>
592	or cope with the fact afterwards (which is usually the easiest thing, you	668	calling this function, or cope with the fact afterwards (which is usually
593	can just ignore the watchers and/or C<free ()> them for example).	669	the easiest thing, you can just ignore the watchers and/or C<free ()> them
		670	for example).
594		671
595	Note that certain global state, such as signal state (and installed signal	672	Note that certain global state, such as signal state (and installed signal
596	handlers), will not be freed by this function, and related watchers (such	673	handlers), will not be freed by this function, and related watchers (such
597	as signal and child watchers) would need to be stopped manually.	674	as signal and child watchers) would need to be stopped manually.
598		675
599	In general it is not advisable to call this function except in the	676	This function is normally used on loop objects allocated by
600	rare occasion where you really need to free e.g. the signal handling	677	C<ev_loop_new>, but it can also be used on the default loop returned by
		678	C<ev_default_loop>, in which case it is not thread-safe.
		679
		680	Note that it is not advisable to call this function on the default loop
		681	except in the rare occasion where you really need to free its resources.
601	pipe fds. If you need dynamically allocated loops it is better to use	682	If you need dynamically allocated loops it is better to use C<ev_loop_new>
602	C<ev_loop_new> and C<ev_loop_destroy>.	683	and C<ev_loop_destroy>.
603		684
604	=item ev_loop_destroy (loop)	685	=item ev_loop_fork (loop)
605
606	Like C<ev_default_destroy>, but destroys an event loop created by an
607	earlier call to C<ev_loop_new>.
608
609	=item ev_default_fork ()
610		686
611	This function sets a flag that causes subsequent C<ev_run> iterations	687	This function sets a flag that causes subsequent C<ev_run> iterations
612	to reinitialise the kernel state for backends that have one. Despite the	688	to reinitialise the kernel state for backends that have one. Despite
613	name, you can call it anytime, but it makes most sense after forking, in	689	the name, you can call it anytime you are allowed to start or stop
614	the child process (or both child and parent, but that again makes little	690	watchers (except inside an C<ev_prepare> callback), but it makes most
615	sense). You I<must> call it in the child before using any of the libev	691	sense after forking, in the child process. You I<must> call it (or use
616	functions, and it will only take effect at the next C<ev_run> iteration.	692	C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
617		693
		694	In addition, if you want to reuse a loop (via this function or
		695	C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
		696
618	Again, you I<have> to call it on I<any> loop that you want to re-use after	697	Again, you I<have> to call it on I<any> loop that you want to re-use after
619	a fork, I<even if you do not plan to use the loop in the parent>. This is	698	a fork, I<even if you do not plan to use the loop in the parent>. This is
620	because some kernel interfaces *cough* I<kqueue> *cough* do funny things	699	because some kernel interfaces *cough* I<kqueue> *cough* do funny things
621	during fork.	700	during fork.
622		701
623	On the other hand, you only need to call this function in the child	702	On the other hand, you only need to call this function in the child
…		…
626	call it at all (in fact, C<epoll> is so badly broken that it makes a	705	call it at all (in fact, C<epoll> is so badly broken that it makes a
627	difference, but libev will usually detect this case on its own and do a	706	difference, but libev will usually detect this case on its own and do a
628	costly reset of the backend).	707	costly reset of the backend).
629		708
630	The function itself is quite fast and it's usually not a problem to call	709	The function itself is quite fast and it's usually not a problem to call
631	it just in case after a fork. To make this easy, the function will fit in	710	it just in case after a fork.
632	quite nicely into a call to C<pthread_atfork>:
633		711
		712	Example: Automate calling C<ev_loop_fork> on the default loop when
		713	using pthreads.
		714
		715	static void
		716	post_fork_child (void)
		717	{
		718	ev_loop_fork (EV_DEFAULT);
		719	}
		720
		721	...
634	pthread_atfork (0, 0, ev_default_fork);	722	pthread_atfork (0, 0, post_fork_child);
635
636	=item ev_loop_fork (loop)
637
638	Like C<ev_default_fork>, but acts on an event loop created by
639	C<ev_loop_new>. Yes, you have to call this on every allocated event loop
640	after fork that you want to re-use in the child, and how you keep track of
641	them is entirely your own problem.
642		723
643	=item int ev_is_default_loop (loop)	724	=item int ev_is_default_loop (loop)
644		725
645	Returns true when the given loop is, in fact, the default loop, and false	726	Returns true when the given loop is, in fact, the default loop, and false
646	otherwise.	727	otherwise.
…		…
657	prepare and check phases.	738	prepare and check phases.
658		739
659	=item unsigned int ev_depth (loop)	740	=item unsigned int ev_depth (loop)
660		741
661	Returns the number of times C<ev_run> was entered minus the number of	742	Returns the number of times C<ev_run> was entered minus the number of
662	times C<ev_run> was exited, in other words, the recursion depth.	743	times C<ev_run> was exited normally, in other words, the recursion depth.
663		744
664	Outside C<ev_run>, this number is zero. In a callback, this number is	745	Outside C<ev_run>, this number is zero. In a callback, this number is
665	C<1>, unless C<ev_run> was invoked recursively (or from another thread),	746	C<1>, unless C<ev_run> was invoked recursively (or from another thread),
666	in which case it is higher.	747	in which case it is higher.
667		748
668	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread	749	Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread,
669	etc.), doesn't count as "exit" - consider this as a hint to avoid such	750	throwing an exception etc.), doesn't count as "exit" - consider this
670	ungentleman-like behaviour unless it's really convenient.	751	as a hint to avoid such ungentleman-like behaviour unless it's really
		752	convenient, in which case it is fully supported.
671		753
672	=item unsigned int ev_backend (loop)	754	=item unsigned int ev_backend (loop)
673		755
674	Returns one of the C<EVBACKEND_*> flags indicating the event backend in	756	Returns one of the C<EVBACKEND_*> flags indicating the event backend in
675	use.	757	use.
…		…
690		772
691	This function is rarely useful, but when some event callback runs for a	773	This function is rarely useful, but when some event callback runs for a
692	very long time without entering the event loop, updating libev's idea of	774	very long time without entering the event loop, updating libev's idea of
693	the current time is a good idea.	775	the current time is a good idea.
694		776
695	See also L<The special problem of time updates> in the C<ev_timer> section.	777	See also L</The special problem of time updates> in the C<ev_timer> section.
696		778
697	=item ev_suspend (loop)	779	=item ev_suspend (loop)
698		780
699	=item ev_resume (loop)	781	=item ev_resume (loop)
700		782
…		…
718	without a previous call to C<ev_suspend>.	800	without a previous call to C<ev_suspend>.
719		801
720	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the	802	Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
721	event loop time (see C<ev_now_update>).	803	event loop time (see C<ev_now_update>).
722		804
723	=item ev_run (loop, int flags)	805	=item bool ev_run (loop, int flags)
724		806
725	Finally, this is it, the event handler. This function usually is called	807	Finally, this is it, the event handler. This function usually is called
726	after you have initialised all your watchers and you want to start	808	after you have initialised all your watchers and you want to start
727	handling events. It will ask the operating system for any new events, call	809	handling events. It will ask the operating system for any new events, call
728	the watcher callbacks, an then repeat the whole process indefinitely: This	810	the watcher callbacks, and then repeat the whole process indefinitely: This
729	is why event loops are called I<loops>.	811	is why event loops are called I<loops>.
730		812
731	If the flags argument is specified as C<0>, it will keep handling events	813	If the flags argument is specified as C<0>, it will keep handling events
732	until either no event watchers are active anymore or C<ev_break> was	814	until either no event watchers are active anymore or C<ev_break> was
733	called.	815	called.
		816
		817	The return value is false if there are no more active watchers (which
		818	usually means "all jobs done" or "deadlock"), and true in all other cases
		819	(which usually means " you should call C<ev_run> again").
734		820
735	Please note that an explicit C<ev_break> is usually better than	821	Please note that an explicit C<ev_break> is usually better than
736	relying on all watchers to be stopped when deciding when a program has	822	relying on all watchers to be stopped when deciding when a program has
737	finished (especially in interactive programs), but having a program	823	finished (especially in interactive programs), but having a program
738	that automatically loops as long as it has to and no longer by virtue	824	that automatically loops as long as it has to and no longer by virtue
739	of relying on its watchers stopping correctly, that is truly a thing of	825	of relying on its watchers stopping correctly, that is truly a thing of
740	beauty.	826	beauty.
741		827
		828	This function is I<mostly> exception-safe - you can break out of a
		829	C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
		830	exception and so on. This does not decrement the C<ev_depth> value, nor
		831	will it clear any outstanding C<EVBREAK_ONE> breaks.
		832
742	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle	833	A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
743	those events and any already outstanding ones, but will not wait and	834	those events and any already outstanding ones, but will not wait and
744	block your process in case there are no events and will return after one	835	block your process in case there are no events and will return after one
745	iteration of the loop. This is sometimes useful to poll and handle new	836	iteration of the loop. This is sometimes useful to poll and handle new
746	events while doing lengthy calculations, to keep the program responsive.	837	events while doing lengthy calculations, to keep the program responsive.
…		…
755	This is useful if you are waiting for some external event in conjunction	846	This is useful if you are waiting for some external event in conjunction
756	with something not expressible using other libev watchers (i.e. "roll your	847	with something not expressible using other libev watchers (i.e. "roll your
757	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is	848	own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
758	usually a better approach for this kind of thing.	849	usually a better approach for this kind of thing.
759		850
760	Here are the gory details of what C<ev_run> does:	851	Here are the gory details of what C<ev_run> does (this is for your
		852	understanding, not a guarantee that things will work exactly like this in
		853	future versions):
761		854
762	- Increment loop depth.	855	- Increment loop depth.
763	- Reset the ev_break status.	856	- Reset the ev_break status.
764	- Before the first iteration, call any pending watchers.	857	- Before the first iteration, call any pending watchers.
765	LOOP:	858	LOOP:
…		…
798	anymore.	891	anymore.
799		892
800	... queue jobs here, make sure they register event watchers as long	893	... queue jobs here, make sure they register event watchers as long
801	... as they still have work to do (even an idle watcher will do..)	894	... as they still have work to do (even an idle watcher will do..)
802	ev_run (my_loop, 0);	895	ev_run (my_loop, 0);
803	... jobs done or somebody called unloop. yeah!	896	... jobs done or somebody called break. yeah!
804		897
805	=item ev_break (loop, how)	898	=item ev_break (loop, how)
806		899
807	Can be used to make a call to C<ev_run> return early (but only after it	900	Can be used to make a call to C<ev_run> return early (but only after it
808	has processed all outstanding events). The C<how> argument must be either	901	has processed all outstanding events). The C<how> argument must be either
809	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or	902	C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
810	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.	903	C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
811		904
812	This "unloop state" will be cleared when entering C<ev_run> again.	905	This "break state" will be cleared on the next call to C<ev_run>.
813		906
814	It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##	907	It is safe to call C<ev_break> from outside any C<ev_run> calls, too, in
		908	which case it will have no effect.
815		909
816	=item ev_ref (loop)	910	=item ev_ref (loop)
817		911
818	=item ev_unref (loop)	912	=item ev_unref (loop)
819		913
…		…
840	running when nothing else is active.	934	running when nothing else is active.
841		935
842	ev_signal exitsig;	936	ev_signal exitsig;
843	ev_signal_init (&exitsig, sig_cb, SIGINT);	937	ev_signal_init (&exitsig, sig_cb, SIGINT);
844	ev_signal_start (loop, &exitsig);	938	ev_signal_start (loop, &exitsig);
845	evf_unref (loop);	939	ev_unref (loop);
846		940
847	Example: For some weird reason, unregister the above signal handler again.	941	Example: For some weird reason, unregister the above signal handler again.
848		942
849	ev_ref (loop);	943	ev_ref (loop);
850	ev_signal_stop (loop, &exitsig);	944	ev_signal_stop (loop, &exitsig);
…		…
870	overhead for the actual polling but can deliver many events at once.	964	overhead for the actual polling but can deliver many events at once.
871		965
872	By setting a higher I<io collect interval> you allow libev to spend more	966	By setting a higher I<io collect interval> you allow libev to spend more
873	time collecting I/O events, so you can handle more events per iteration,	967	time collecting I/O events, so you can handle more events per iteration,
874	at the cost of increasing latency. Timeouts (both C<ev_periodic> and	968	at the cost of increasing latency. Timeouts (both C<ev_periodic> and
875	C<ev_timer>) will be not affected. Setting this to a non-null value will	969	C<ev_timer>) will not be affected. Setting this to a non-null value will
876	introduce an additional C<ev_sleep ()> call into most loop iterations. The	970	introduce an additional C<ev_sleep ()> call into most loop iterations. The
877	sleep time ensures that libev will not poll for I/O events more often then	971	sleep time ensures that libev will not poll for I/O events more often then
878	once per this interval, on average.	972	once per this interval, on average (as long as the host time resolution is
		973	good enough).
879		974
880	Likewise, by setting a higher I<timeout collect interval> you allow libev	975	Likewise, by setting a higher I<timeout collect interval> you allow libev
881	to spend more time collecting timeouts, at the expense of increased	976	to spend more time collecting timeouts, at the expense of increased
882	latency/jitter/inexactness (the watcher callback will be called	977	latency/jitter/inexactness (the watcher callback will be called
883	later). C<ev_io> watchers will not be affected. Setting this to a non-null	978	later). C<ev_io> watchers will not be affected. Setting this to a non-null
…		…
929	invoke the actual watchers inside another context (another thread etc.).	1024	invoke the actual watchers inside another context (another thread etc.).
930		1025
931	If you want to reset the callback, use C<ev_invoke_pending> as new	1026	If you want to reset the callback, use C<ev_invoke_pending> as new
932	callback.	1027	callback.
933		1028
934	=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))	1029	=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
935		1030
936	Sometimes you want to share the same loop between multiple threads. This	1031	Sometimes you want to share the same loop between multiple threads. This
937	can be done relatively simply by putting mutex_lock/unlock calls around	1032	can be done relatively simply by putting mutex_lock/unlock calls around
938	each call to a libev function.	1033	each call to a libev function.
939		1034
940	However, C<ev_run> can run an indefinite time, so it is not feasible	1035	However, C<ev_run> can run an indefinite time, so it is not feasible
941	to wait for it to return. One way around this is to wake up the event	1036	to wait for it to return. One way around this is to wake up the event
942	loop via C<ev_break> and C<av_async_send>, another way is to set these	1037	loop via C<ev_break> and C<ev_async_send>, another way is to set these
943	I<release> and I<acquire> callbacks on the loop.	1038	I<release> and I<acquire> callbacks on the loop.
944		1039
945	When set, then C<release> will be called just before the thread is	1040	When set, then C<release> will be called just before the thread is
946	suspended waiting for new events, and C<acquire> is called just	1041	suspended waiting for new events, and C<acquire> is called just
947	afterwards.	1042	afterwards.
…		…
962	See also the locking example in the C<THREADS> section later in this	1057	See also the locking example in the C<THREADS> section later in this
963	document.	1058	document.
964		1059
965	=item ev_set_userdata (loop, void *data)	1060	=item ev_set_userdata (loop, void *data)
966		1061
967	=item ev_userdata (loop)	1062	=item void *ev_userdata (loop)
968		1063
969	Set and retrieve a single C<void *> associated with a loop. When	1064	Set and retrieve a single C<void *> associated with a loop. When
970	C<ev_set_userdata> has never been called, then C<ev_userdata> returns	1065	C<ev_set_userdata> has never been called, then C<ev_userdata> returns
971	C<0.>	1066	C<0>.
972		1067
973	These two functions can be used to associate arbitrary data with a loop,	1068	These two functions can be used to associate arbitrary data with a loop,
974	and are intended solely for the C<invoke_pending_cb>, C<release> and	1069	and are intended solely for the C<invoke_pending_cb>, C<release> and
975	C<acquire> callbacks described above, but of course can be (ab-)used for	1070	C<acquire> callbacks described above, but of course can be (ab-)used for
976	any other purpose as well.	1071	any other purpose as well.
…		…
1087		1182
1088	=item C<EV_PREPARE>	1183	=item C<EV_PREPARE>
1089		1184
1090	=item C<EV_CHECK>	1185	=item C<EV_CHECK>
1091		1186
1092	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts	1187	All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1093	to gather new events, and all C<ev_check> watchers are invoked just after	1188	gather new events, and all C<ev_check> watchers are queued (not invoked)
1094	C<ev_run> has gathered them, but before it invokes any callbacks for any	1189	just after C<ev_run> has gathered them, but before it queues any callbacks
		1190	for any received events. That means C<ev_prepare> watchers are the last
		1191	watchers invoked before the event loop sleeps or polls for new events, and
		1192	C<ev_check> watchers will be invoked before any other watchers of the same
		1193	or lower priority within an event loop iteration.
		1194
1095	received events. Callbacks of both watcher types can start and stop as	1195	Callbacks of both watcher types can start and stop as many watchers as
1096	many watchers as they want, and all of them will be taken into account	1196	they want, and all of them will be taken into account (for example, a
1097	(for example, a C<ev_prepare> watcher might start an idle watcher to keep	1197	C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1098	C<ev_run> from blocking).	1198	blocking).
1099		1199
1100	=item C<EV_EMBED>	1200	=item C<EV_EMBED>
1101		1201
1102	The embedded event loop specified in the C<ev_embed> watcher needs attention.	1202	The embedded event loop specified in the C<ev_embed> watcher needs attention.
1103		1203
1104	=item C<EV_FORK>	1204	=item C<EV_FORK>
1105		1205
1106	The event loop has been resumed in the child process after fork (see	1206	The event loop has been resumed in the child process after fork (see
1107	C<ev_fork>).	1207	C<ev_fork>).
		1208
		1209	=item C<EV_CLEANUP>
		1210
		1211	The event loop is about to be destroyed (see C<ev_cleanup>).
1108		1212
1109	=item C<EV_ASYNC>	1213	=item C<EV_ASYNC>
1110		1214
1111	The given async watcher has been asynchronously notified (see C<ev_async>).	1215	The given async watcher has been asynchronously notified (see C<ev_async>).
1112		1216
…		…
1134	programs, though, as the fd could already be closed and reused for another	1238	programs, though, as the fd could already be closed and reused for another
1135	thing, so beware.	1239	thing, so beware.
1136		1240
1137	=back	1241	=back
1138		1242
		1243	=head2 GENERIC WATCHER FUNCTIONS
		1244
		1245	=over 4
		1246
		1247	=item C<ev_init> (ev_TYPE *watcher, callback)
		1248
		1249	This macro initialises the generic portion of a watcher. The contents
		1250	of the watcher object can be arbitrary (so C<malloc> will do). Only
		1251	the generic parts of the watcher are initialised, you I<need> to call
		1252	the type-specific C<ev_TYPE_set> macro afterwards to initialise the
		1253	type-specific parts. For each type there is also a C<ev_TYPE_init> macro
		1254	which rolls both calls into one.
		1255
		1256	You can reinitialise a watcher at any time as long as it has been stopped
		1257	(or never started) and there are no pending events outstanding.
		1258
		1259	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
		1260	int revents)>.
		1261
		1262	Example: Initialise an C<ev_io> watcher in two steps.
		1263
		1264	ev_io w;
		1265	ev_init (&w, my_cb);
		1266	ev_io_set (&w, STDIN_FILENO, EV_READ);
		1267
		1268	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
		1269
		1270	This macro initialises the type-specific parts of a watcher. You need to
		1271	call C<ev_init> at least once before you call this macro, but you can
		1272	call C<ev_TYPE_set> any number of times. You must not, however, call this
		1273	macro on a watcher that is active (it can be pending, however, which is a
		1274	difference to the C<ev_init> macro).
		1275
		1276	Although some watcher types do not have type-specific arguments
		1277	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
		1278
		1279	See C<ev_init>, above, for an example.
		1280
		1281	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
		1282
		1283	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
		1284	calls into a single call. This is the most convenient method to initialise
		1285	a watcher. The same limitations apply, of course.
		1286
		1287	Example: Initialise and set an C<ev_io> watcher in one step.
		1288
		1289	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
		1290
		1291	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
		1292
		1293	Starts (activates) the given watcher. Only active watchers will receive
		1294	events. If the watcher is already active nothing will happen.
		1295
		1296	Example: Start the C<ev_io> watcher that is being abused as example in this
		1297	whole section.
		1298
		1299	ev_io_start (EV_DEFAULT_UC, &w);
		1300
		1301	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
		1302
		1303	Stops the given watcher if active, and clears the pending status (whether
		1304	the watcher was active or not).
		1305
		1306	It is possible that stopped watchers are pending - for example,
		1307	non-repeating timers are being stopped when they become pending - but
		1308	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
		1309	pending. If you want to free or reuse the memory used by the watcher it is
		1310	therefore a good idea to always call its C<ev_TYPE_stop> function.
		1311
		1312	=item bool ev_is_active (ev_TYPE *watcher)
		1313
		1314	Returns a true value iff the watcher is active (i.e. it has been started
		1315	and not yet been stopped). As long as a watcher is active you must not modify
		1316	it.
		1317
		1318	=item bool ev_is_pending (ev_TYPE *watcher)
		1319
		1320	Returns a true value iff the watcher is pending, (i.e. it has outstanding
		1321	events but its callback has not yet been invoked). As long as a watcher
		1322	is pending (but not active) you must not call an init function on it (but
		1323	C<ev_TYPE_set> is safe), you must not change its priority, and you must
		1324	make sure the watcher is available to libev (e.g. you cannot C<free ()>
		1325	it).
		1326
		1327	=item callback ev_cb (ev_TYPE *watcher)
		1328
		1329	Returns the callback currently set on the watcher.
		1330
		1331	=item ev_set_cb (ev_TYPE *watcher, callback)
		1332
		1333	Change the callback. You can change the callback at virtually any time
		1334	(modulo threads).
		1335
		1336	=item ev_set_priority (ev_TYPE *watcher, int priority)
		1337
		1338	=item int ev_priority (ev_TYPE *watcher)
		1339
		1340	Set and query the priority of the watcher. The priority is a small
		1341	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
		1342	(default: C<-2>). Pending watchers with higher priority will be invoked
		1343	before watchers with lower priority, but priority will not keep watchers
		1344	from being executed (except for C<ev_idle> watchers).
		1345
		1346	If you need to suppress invocation when higher priority events are pending
		1347	you need to look at C<ev_idle> watchers, which provide this functionality.
		1348
		1349	You I<must not> change the priority of a watcher as long as it is active or
		1350	pending.
		1351
		1352	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
		1353	fine, as long as you do not mind that the priority value you query might
		1354	or might not have been clamped to the valid range.
		1355
		1356	The default priority used by watchers when no priority has been set is
		1357	always C<0>, which is supposed to not be too high and not be too low :).
		1358
		1359	See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
		1360	priorities.
		1361
		1362	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
		1363
		1364	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
		1365	C<loop> nor C<revents> need to be valid as long as the watcher callback
		1366	can deal with that fact, as both are simply passed through to the
		1367	callback.
		1368
		1369	=item int ev_clear_pending (loop, ev_TYPE *watcher)
		1370
		1371	If the watcher is pending, this function clears its pending status and
		1372	returns its C<revents> bitset (as if its callback was invoked). If the
		1373	watcher isn't pending it does nothing and returns C<0>.
		1374
		1375	Sometimes it can be useful to "poll" a watcher instead of waiting for its
		1376	callback to be invoked, which can be accomplished with this function.
		1377
		1378	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
		1379
		1380	Feeds the given event set into the event loop, as if the specified event
		1381	had happened for the specified watcher (which must be a pointer to an
		1382	initialised but not necessarily started event watcher). Obviously you must
		1383	not free the watcher as long as it has pending events.
		1384
		1385	Stopping the watcher, letting libev invoke it, or calling
		1386	C<ev_clear_pending> will clear the pending event, even if the watcher was
		1387	not started in the first place.
		1388
		1389	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
		1390	functions that do not need a watcher.
		1391
		1392	=back
		1393
		1394	See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
		1395	OWN COMPOSITE WATCHERS> idioms.
		1396
1139	=head2 WATCHER STATES	1397	=head2 WATCHER STATES
1140		1398
1141	There are various watcher states mentioned throughout this manual -	1399	There are various watcher states mentioned throughout this manual -
1142	active, pending and so on. In this section these states and the rules to	1400	active, pending and so on. In this section these states and the rules to
1143	transition between them will be described in more detail - and while these	1401	transition between them will be described in more detail - and while these
1144	rules might look complicated, they usually do "the right thing".	1402	rules might look complicated, they usually do "the right thing".
1145		1403
1146	=over 4	1404	=over 4
1147		1405
1148	=item initialiased	1406	=item initialised
1149		1407
1150	Before a watcher can be registered with the event looop it has to be	1408	Before a watcher can be registered with the event loop it has to be
1151	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to	1409	initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1152	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.	1410	C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1153		1411
1154	In this state it is simply some block of memory that is suitable for use	1412	In this state it is simply some block of memory that is suitable for
1155	in an event loop. It can be moved around, freed, reused etc. at will.	1413	use in an event loop. It can be moved around, freed, reused etc. at
		1414	will - as long as you either keep the memory contents intact, or call
		1415	C<ev_TYPE_init> again.
1156		1416
1157	=item started/running/active	1417	=item started/running/active
1158		1418
1159	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes	1419	Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1160	property of the event loop, and is actively waiting for events. While in	1420	property of the event loop, and is actively waiting for events. While in
…		…
1188	latter will clear any pending state the watcher might be in, regardless	1448	latter will clear any pending state the watcher might be in, regardless
1189	of whether it was active or not, so stopping a watcher explicitly before	1449	of whether it was active or not, so stopping a watcher explicitly before
1190	freeing it is often a good idea.	1450	freeing it is often a good idea.
1191		1451
1192	While stopped (and not pending) the watcher is essentially in the	1452	While stopped (and not pending) the watcher is essentially in the
1193	initialised state, that is it can be reused, moved, modified in any way	1453	initialised state, that is, it can be reused, moved, modified in any way
1194	you wish.	1454	you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
		1455	it again).
1195		1456
1196	=back	1457	=back
1197
1198	=head2 GENERIC WATCHER FUNCTIONS
1199
1200	=over 4
1201
1202	=item C<ev_init> (ev_TYPE *watcher, callback)
1203
1204	This macro initialises the generic portion of a watcher. The contents
1205	of the watcher object can be arbitrary (so C<malloc> will do). Only
1206	the generic parts of the watcher are initialised, you I<need> to call
1207	the type-specific C<ev_TYPE_set> macro afterwards to initialise the
1208	type-specific parts. For each type there is also a C<ev_TYPE_init> macro
1209	which rolls both calls into one.
1210
1211	You can reinitialise a watcher at any time as long as it has been stopped
1212	(or never started) and there are no pending events outstanding.
1213
1214	The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
1215	int revents)>.
1216
1217	Example: Initialise an C<ev_io> watcher in two steps.
1218
1219	ev_io w;
1220	ev_init (&w, my_cb);
1221	ev_io_set (&w, STDIN_FILENO, EV_READ);
1222
1223	=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1224
1225	This macro initialises the type-specific parts of a watcher. You need to
1226	call C<ev_init> at least once before you call this macro, but you can
1227	call C<ev_TYPE_set> any number of times. You must not, however, call this
1228	macro on a watcher that is active (it can be pending, however, which is a
1229	difference to the C<ev_init> macro).
1230
1231	Although some watcher types do not have type-specific arguments
1232	(e.g. C<ev_prepare>) you still need to call its C<set> macro.
1233
1234	See C<ev_init>, above, for an example.
1235
1236	=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
1237
1238	This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
1239	calls into a single call. This is the most convenient method to initialise
1240	a watcher. The same limitations apply, of course.
1241
1242	Example: Initialise and set an C<ev_io> watcher in one step.
1243
1244	ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1245
1246	=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1247
1248	Starts (activates) the given watcher. Only active watchers will receive
1249	events. If the watcher is already active nothing will happen.
1250
1251	Example: Start the C<ev_io> watcher that is being abused as example in this
1252	whole section.
1253
1254	ev_io_start (EV_DEFAULT_UC, &w);
1255
1256	=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1257
1258	Stops the given watcher if active, and clears the pending status (whether
1259	the watcher was active or not).
1260
1261	It is possible that stopped watchers are pending - for example,
1262	non-repeating timers are being stopped when they become pending - but
1263	calling C<ev_TYPE_stop> ensures that the watcher is neither active nor
1264	pending. If you want to free or reuse the memory used by the watcher it is
1265	therefore a good idea to always call its C<ev_TYPE_stop> function.
1266
1267	=item bool ev_is_active (ev_TYPE *watcher)
1268
1269	Returns a true value iff the watcher is active (i.e. it has been started
1270	and not yet been stopped). As long as a watcher is active you must not modify
1271	it.
1272
1273	=item bool ev_is_pending (ev_TYPE *watcher)
1274
1275	Returns a true value iff the watcher is pending, (i.e. it has outstanding
1276	events but its callback has not yet been invoked). As long as a watcher
1277	is pending (but not active) you must not call an init function on it (but
1278	C<ev_TYPE_set> is safe), you must not change its priority, and you must
1279	make sure the watcher is available to libev (e.g. you cannot C<free ()>
1280	it).
1281
1282	=item callback ev_cb (ev_TYPE *watcher)
1283
1284	Returns the callback currently set on the watcher.
1285
1286	=item ev_cb_set (ev_TYPE *watcher, callback)
1287
1288	Change the callback. You can change the callback at virtually any time
1289	(modulo threads).
1290
1291	=item ev_set_priority (ev_TYPE *watcher, int priority)
1292
1293	=item int ev_priority (ev_TYPE *watcher)
1294
1295	Set and query the priority of the watcher. The priority is a small
1296	integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1297	(default: C<-2>). Pending watchers with higher priority will be invoked
1298	before watchers with lower priority, but priority will not keep watchers
1299	from being executed (except for C<ev_idle> watchers).
1300
1301	If you need to suppress invocation when higher priority events are pending
1302	you need to look at C<ev_idle> watchers, which provide this functionality.
1303
1304	You I<must not> change the priority of a watcher as long as it is active or
1305	pending.
1306
1307	Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1308	fine, as long as you do not mind that the priority value you query might
1309	or might not have been clamped to the valid range.
1310
1311	The default priority used by watchers when no priority has been set is
1312	always C<0>, which is supposed to not be too high and not be too low :).
1313
1314	See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1315	priorities.
1316
1317	=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1318
1319	Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1320	C<loop> nor C<revents> need to be valid as long as the watcher callback
1321	can deal with that fact, as both are simply passed through to the
1322	callback.
1323
1324	=item int ev_clear_pending (loop, ev_TYPE *watcher)
1325
1326	If the watcher is pending, this function clears its pending status and
1327	returns its C<revents> bitset (as if its callback was invoked). If the
1328	watcher isn't pending it does nothing and returns C<0>.
1329
1330	Sometimes it can be useful to "poll" a watcher instead of waiting for its
1331	callback to be invoked, which can be accomplished with this function.
1332
1333	=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1334
1335	Feeds the given event set into the event loop, as if the specified event
1336	had happened for the specified watcher (which must be a pointer to an
1337	initialised but not necessarily started event watcher). Obviously you must
1338	not free the watcher as long as it has pending events.
1339
1340	Stopping the watcher, letting libev invoke it, or calling
1341	C<ev_clear_pending> will clear the pending event, even if the watcher was
1342	not started in the first place.
1343
1344	See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1345	functions that do not need a watcher.
1346
1347	=back
1348
1349
1350	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1351
1352	Each watcher has, by default, a member C<void *data> that you can change
1353	and read at any time: libev will completely ignore it. This can be used
1354	to associate arbitrary data with your watcher. If you need more data and
1355	don't want to allocate memory and store a pointer to it in that data
1356	member, you can also "subclass" the watcher type and provide your own
1357	data:
1358
1359	struct my_io
1360	{
1361	ev_io io;
1362	int otherfd;
1363	void *somedata;
1364	struct whatever *mostinteresting;
1365	};
1366
1367	...
1368	struct my_io w;
1369	ev_io_init (&w.io, my_cb, fd, EV_READ);
1370
1371	And since your callback will be called with a pointer to the watcher, you
1372	can cast it back to your own type:
1373
1374	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1375	{
1376	struct my_io *w = (struct my_io *)w_;
1377	...
1378	}
1379
1380	More interesting and less C-conformant ways of casting your callback type
1381	instead have been omitted.
1382
1383	Another common scenario is to use some data structure with multiple
1384	embedded watchers:
1385
1386	struct my_biggy
1387	{
1388	int some_data;
1389	ev_timer t1;
1390	ev_timer t2;
1391	}
1392
1393	In this case getting the pointer to C<my_biggy> is a bit more
1394	complicated: Either you store the address of your C<my_biggy> struct
1395	in the C<data> member of the watcher (for woozies), or you need to use
1396	some pointer arithmetic using C<offsetof> inside your watchers (for real
1397	programmers):
1398
1399	#include <stddef.h>
1400
1401	static void
1402	t1_cb (EV_P_ ev_timer *w, int revents)
1403	{
1404	struct my_biggy big = (struct my_biggy *)
1405	(((char *)w) - offsetof (struct my_biggy, t1));
1406	}
1407
1408	static void
1409	t2_cb (EV_P_ ev_timer *w, int revents)
1410	{
1411	struct my_biggy big = (struct my_biggy *)
1412	(((char *)w) - offsetof (struct my_biggy, t2));
1413	}
1414		1458
1415	=head2 WATCHER PRIORITY MODELS	1459	=head2 WATCHER PRIORITY MODELS
1416		1460
1417	Many event loops support I<watcher priorities>, which are usually small	1461	Many event loops support I<watcher priorities>, which are usually small
1418	integers that influence the ordering of event callback invocation	1462	integers that influence the ordering of event callback invocation
…		…
1545	In general you can register as many read and/or write event watchers per	1589	In general you can register as many read and/or write event watchers per
1546	fd as you want (as long as you don't confuse yourself). Setting all file	1590	fd as you want (as long as you don't confuse yourself). Setting all file
1547	descriptors to non-blocking mode is also usually a good idea (but not	1591	descriptors to non-blocking mode is also usually a good idea (but not
1548	required if you know what you are doing).	1592	required if you know what you are doing).
1549		1593
1550	If you cannot use non-blocking mode, then force the use of a
1551	known-to-be-good backend (at the time of this writing, this includes only
1552	C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1553	descriptors for which non-blocking operation makes no sense (such as
1554	files) - libev doesn't guarantee any specific behaviour in that case.
1555
1556	Another thing you have to watch out for is that it is quite easy to	1594	Another thing you have to watch out for is that it is quite easy to
1557	receive "spurious" readiness notifications, that is your callback might	1595	receive "spurious" readiness notifications, that is, your callback might
1558	be called with C<EV_READ> but a subsequent C<read>(2) will actually block	1596	be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1559	because there is no data. Not only are some backends known to create a	1597	because there is no data. It is very easy to get into this situation even
1560	lot of those (for example Solaris ports), it is very easy to get into	1598	with a relatively standard program structure. Thus it is best to always
1561	this situation even with a relatively standard program structure. Thus	1599	use non-blocking I/O: An extra C<read>(2) returning C<EAGAIN> is far
1562	it is best to always use non-blocking I/O: An extra C<read>(2) returning
1563	C<EAGAIN> is far preferable to a program hanging until some data arrives.	1600	preferable to a program hanging until some data arrives.
1564		1601
1565	If you cannot run the fd in non-blocking mode (for example you should	1602	If you cannot run the fd in non-blocking mode (for example you should
1566	not play around with an Xlib connection), then you have to separately	1603	not play around with an Xlib connection), then you have to separately
1567	re-test whether a file descriptor is really ready with a known-to-be good	1604	re-test whether a file descriptor is really ready with a known-to-be good
1568	interface such as poll (fortunately in our Xlib example, Xlib already	1605	interface such as poll (fortunately in the case of Xlib, it already does
1569	does this on its own, so its quite safe to use). Some people additionally	1606	this on its own, so its quite safe to use). Some people additionally
1570	use C<SIGALRM> and an interval timer, just to be sure you won't block	1607	use C<SIGALRM> and an interval timer, just to be sure you won't block
1571	indefinitely.	1608	indefinitely.
1572		1609
1573	But really, best use non-blocking mode.	1610	But really, best use non-blocking mode.
1574		1611
…		…
1602		1639
1603	There is no workaround possible except not registering events	1640	There is no workaround possible except not registering events
1604	for potentially C<dup ()>'ed file descriptors, or to resort to	1641	for potentially C<dup ()>'ed file descriptors, or to resort to
1605	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.	1642	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1606		1643
		1644	=head3 The special problem of files
		1645
		1646	Many people try to use C<select> (or libev) on file descriptors
		1647	representing files, and expect it to become ready when their program
		1648	doesn't block on disk accesses (which can take a long time on their own).
		1649
		1650	However, this cannot ever work in the "expected" way - you get a readiness
		1651	notification as soon as the kernel knows whether and how much data is
		1652	there, and in the case of open files, that's always the case, so you
		1653	always get a readiness notification instantly, and your read (or possibly
		1654	write) will still block on the disk I/O.
		1655
		1656	Another way to view it is that in the case of sockets, pipes, character
		1657	devices and so on, there is another party (the sender) that delivers data
		1658	on its own, but in the case of files, there is no such thing: the disk
		1659	will not send data on its own, simply because it doesn't know what you
		1660	wish to read - you would first have to request some data.
		1661
		1662	Since files are typically not-so-well supported by advanced notification
		1663	mechanism, libev tries hard to emulate POSIX behaviour with respect
		1664	to files, even though you should not use it. The reason for this is
		1665	convenience: sometimes you want to watch STDIN or STDOUT, which is
		1666	usually a tty, often a pipe, but also sometimes files or special devices
		1667	(for example, C<epoll> on Linux works with F</dev/random> but not with
		1668	F</dev/urandom>), and even though the file might better be served with
		1669	asynchronous I/O instead of with non-blocking I/O, it is still useful when
		1670	it "just works" instead of freezing.
		1671
		1672	So avoid file descriptors pointing to files when you know it (e.g. use
		1673	libeio), but use them when it is convenient, e.g. for STDIN/STDOUT, or
		1674	when you rarely read from a file instead of from a socket, and want to
		1675	reuse the same code path.
		1676
1607	=head3 The special problem of fork	1677	=head3 The special problem of fork
1608		1678
1609	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit	1679	Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1610	useless behaviour. Libev fully supports fork, but needs to be told about	1680	useless behaviour. Libev fully supports fork, but needs to be told about
1611	it in the child.	1681	it in the child if you want to continue to use it in the child.
1612		1682
1613	To support fork in your programs, you either have to call	1683	To support fork in your child processes, you have to call C<ev_loop_fork
1614	C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,	1684	()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1615	enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or	1685	C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1616	C<EVBACKEND_POLL>.
1617		1686
1618	=head3 The special problem of SIGPIPE	1687	=head3 The special problem of SIGPIPE
1619		1688
1620	While not really specific to libev, it is easy to forget about C<SIGPIPE>:	1689	While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1621	when writing to a pipe whose other end has been closed, your program gets	1690	when writing to a pipe whose other end has been closed, your program gets
…		…
1719	detecting time jumps is hard, and some inaccuracies are unavoidable (the	1788	detecting time jumps is hard, and some inaccuracies are unavoidable (the
1720	monotonic clock option helps a lot here).	1789	monotonic clock option helps a lot here).
1721		1790
1722	The callback is guaranteed to be invoked only I<after> its timeout has	1791	The callback is guaranteed to be invoked only I<after> its timeout has
1723	passed (not I<at>, so on systems with very low-resolution clocks this	1792	passed (not I<at>, so on systems with very low-resolution clocks this
1724	might introduce a small delay). If multiple timers become ready during the	1793	might introduce a small delay, see "the special problem of being too
		1794	early", below). If multiple timers become ready during the same loop
1725	same loop iteration then the ones with earlier time-out values are invoked	1795	iteration then the ones with earlier time-out values are invoked before
1726	before ones of the same priority with later time-out values (but this is	1796	ones of the same priority with later time-out values (but this is no
1727	no longer true when a callback calls C<ev_run> recursively).	1797	longer true when a callback calls C<ev_run> recursively).
1728		1798
1729	=head3 Be smart about timeouts	1799	=head3 Be smart about timeouts
1730		1800
1731	Many real-world problems involve some kind of timeout, usually for error	1801	Many real-world problems involve some kind of timeout, usually for error
1732	recovery. A typical example is an HTTP request - if the other side hangs,	1802	recovery. A typical example is an HTTP request - if the other side hangs,
…		…
1807		1877
1808	In this case, it would be more efficient to leave the C<ev_timer> alone,	1878	In this case, it would be more efficient to leave the C<ev_timer> alone,
1809	but remember the time of last activity, and check for a real timeout only	1879	but remember the time of last activity, and check for a real timeout only
1810	within the callback:	1880	within the callback:
1811		1881
		1882	ev_tstamp timeout = 60.;
1812	ev_tstamp last_activity; // time of last activity	1883	ev_tstamp last_activity; // time of last activity
		1884	ev_timer timer;
1813		1885
1814	static void	1886	static void
1815	callback (EV_P_ ev_timer *w, int revents)	1887	callback (EV_P_ ev_timer *w, int revents)
1816	{	1888	{
1817	ev_tstamp now = ev_now (EV_A);	1889	// calculate when the timeout would happen
1818	ev_tstamp timeout = last_activity + 60.;	1890	ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1819		1891
1820	// if last_activity + 60. is older than now, we did time out	1892	// if negative, it means we the timeout already occurred
1821	if (timeout < now)	1893	if (after < 0.)
1822	{	1894	{
1823	// timeout occurred, take action	1895	// timeout occurred, take action
1824	}	1896	}
1825	else	1897	else
1826	{	1898	{
1827	// callback was invoked, but there was some activity, re-arm	1899	// callback was invoked, but there was some recent
1828	// the watcher to fire in last_activity + 60, which is	1900	// activity. simply restart the timer to time out
1829	// guaranteed to be in the future, so "again" is positive:	1901	// after "after" seconds, which is the earliest time
1830	w->repeat = timeout - now;	1902	// the timeout can occur.
		1903	ev_timer_set (w, after, 0.);
1831	ev_timer_again (EV_A_ w);	1904	ev_timer_start (EV_A_ w);
1832	}	1905	}
1833	}	1906	}
1834		1907
1835	To summarise the callback: first calculate the real timeout (defined	1908	To summarise the callback: first calculate in how many seconds the
1836	as "60 seconds after the last activity"), then check if that time has	1909	timeout will occur (by calculating the absolute time when it would occur,
1837	been reached, which means something I<did>, in fact, time out. Otherwise	1910	C<last_activity + timeout>, and subtracting the current time, C<ev_now
1838	the callback was invoked too early (C<timeout> is in the future), so	1911	(EV_A)> from that).
1839	re-schedule the timer to fire at that future time, to see if maybe we have
1840	a timeout then.
1841		1912
1842	Note how C<ev_timer_again> is used, taking advantage of the	1913	If this value is negative, then we are already past the timeout, i.e. we
1843	C<ev_timer_again> optimisation when the timer is already running.	1914	timed out, and need to do whatever is needed in this case.
		1915
		1916	Otherwise, we now the earliest time at which the timeout would trigger,
		1917	and simply start the timer with this timeout value.
		1918
		1919	In other words, each time the callback is invoked it will check whether
		1920	the timeout occurred. If not, it will simply reschedule itself to check
		1921	again at the earliest time it could time out. Rinse. Repeat.
1844		1922
1845	This scheme causes more callback invocations (about one every 60 seconds	1923	This scheme causes more callback invocations (about one every 60 seconds
1846	minus half the average time between activity), but virtually no calls to	1924	minus half the average time between activity), but virtually no calls to
1847	libev to change the timeout.	1925	libev to change the timeout.
1848		1926
1849	To start the timer, simply initialise the watcher and set C<last_activity>	1927	To start the machinery, simply initialise the watcher and set
1850	to the current time (meaning we just have some activity :), then call the	1928	C<last_activity> to the current time (meaning there was some activity just
1851	callback, which will "do the right thing" and start the timer:	1929	now), then call the callback, which will "do the right thing" and start
		1930	the timer:
1852		1931
		1932	last_activity = ev_now (EV_A);
1853	ev_init (timer, callback);	1933	ev_init (&timer, callback);
1854	last_activity = ev_now (loop);	1934	callback (EV_A_ &timer, 0);
1855	callback (loop, timer, EV_TIMER);
1856		1935
1857	And when there is some activity, simply store the current time in	1936	When there is some activity, simply store the current time in
1858	C<last_activity>, no libev calls at all:	1937	C<last_activity>, no libev calls at all:
1859		1938
		1939	if (activity detected)
1860	last_activity = ev_now (loop);	1940	last_activity = ev_now (EV_A);
		1941
		1942	When your timeout value changes, then the timeout can be changed by simply
		1943	providing a new value, stopping the timer and calling the callback, which
		1944	will again do the right thing (for example, time out immediately :).
		1945
		1946	timeout = new_value;
		1947	ev_timer_stop (EV_A_ &timer);
		1948	callback (EV_A_ &timer, 0);
1861		1949
1862	This technique is slightly more complex, but in most cases where the	1950	This technique is slightly more complex, but in most cases where the
1863	time-out is unlikely to be triggered, much more efficient.	1951	time-out is unlikely to be triggered, much more efficient.
1864
1865	Changing the timeout is trivial as well (if it isn't hard-coded in the
1866	callback :) - just change the timeout and invoke the callback, which will
1867	fix things for you.
1868		1952
1869	=item 4. Wee, just use a double-linked list for your timeouts.	1953	=item 4. Wee, just use a double-linked list for your timeouts.
1870		1954
1871	If there is not one request, but many thousands (millions...), all	1955	If there is not one request, but many thousands (millions...), all
1872	employing some kind of timeout with the same timeout value, then one can	1956	employing some kind of timeout with the same timeout value, then one can
…		…
1899	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is	1983	Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1900	rather complicated, but extremely efficient, something that really pays	1984	rather complicated, but extremely efficient, something that really pays
1901	off after the first million or so of active timers, i.e. it's usually	1985	off after the first million or so of active timers, i.e. it's usually
1902	overkill :)	1986	overkill :)
1903		1987
		1988	=head3 The special problem of being too early
		1989
		1990	If you ask a timer to call your callback after three seconds, then
		1991	you expect it to be invoked after three seconds - but of course, this
		1992	cannot be guaranteed to infinite precision. Less obviously, it cannot be
		1993	guaranteed to any precision by libev - imagine somebody suspending the
		1994	process with a STOP signal for a few hours for example.
		1995
		1996	So, libev tries to invoke your callback as soon as possible I<after> the
		1997	delay has occurred, but cannot guarantee this.
		1998
		1999	A less obvious failure mode is calling your callback too early: many event
		2000	loops compare timestamps with a "elapsed delay >= requested delay", but
		2001	this can cause your callback to be invoked much earlier than you would
		2002	expect.
		2003
		2004	To see why, imagine a system with a clock that only offers full second
		2005	resolution (think windows if you can't come up with a broken enough OS
		2006	yourself). If you schedule a one-second timer at the time 500.9, then the
		2007	event loop will schedule your timeout to elapse at a system time of 500
		2008	(500.9 truncated to the resolution) + 1, or 501.
		2009
		2010	If an event library looks at the timeout 0.1s later, it will see "501 >=
		2011	501" and invoke the callback 0.1s after it was started, even though a
		2012	one-second delay was requested - this is being "too early", despite best
		2013	intentions.
		2014
		2015	This is the reason why libev will never invoke the callback if the elapsed
		2016	delay equals the requested delay, but only when the elapsed delay is
		2017	larger than the requested delay. In the example above, libev would only invoke
		2018	the callback at system time 502, or 1.1s after the timer was started.
		2019
		2020	So, while libev cannot guarantee that your callback will be invoked
		2021	exactly when requested, it I<can> and I<does> guarantee that the requested
		2022	delay has actually elapsed, or in other words, it always errs on the "too
		2023	late" side of things.
		2024
1904	=head3 The special problem of time updates	2025	=head3 The special problem of time updates
1905		2026
1906	Establishing the current time is a costly operation (it usually takes at	2027	Establishing the current time is a costly operation (it usually takes
1907	least two system calls): EV therefore updates its idea of the current	2028	at least one system call): EV therefore updates its idea of the current
1908	time only before and after C<ev_run> collects new events, which causes a	2029	time only before and after C<ev_run> collects new events, which causes a
1909	growing difference between C<ev_now ()> and C<ev_time ()> when handling	2030	growing difference between C<ev_now ()> and C<ev_time ()> when handling
1910	lots of events in one iteration.	2031	lots of events in one iteration.
1911		2032
1912	The relative timeouts are calculated relative to the C<ev_now ()>	2033	The relative timeouts are calculated relative to the C<ev_now ()>
1913	time. This is usually the right thing as this timestamp refers to the time	2034	time. This is usually the right thing as this timestamp refers to the time
1914	of the event triggering whatever timeout you are modifying/starting. If	2035	of the event triggering whatever timeout you are modifying/starting. If
1915	you suspect event processing to be delayed and you I<need> to base the	2036	you suspect event processing to be delayed and you I<need> to base the
1916	timeout on the current time, use something like this to adjust for this:	2037	timeout on the current time, use something like the following to adjust
		2038	for it:
1917		2039
1918	ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);	2040	ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
1919		2041
1920	If the event loop is suspended for a long time, you can also force an	2042	If the event loop is suspended for a long time, you can also force an
1921	update of the time returned by C<ev_now ()> by calling C<ev_now_update	2043	update of the time returned by C<ev_now ()> by calling C<ev_now_update
1922	()>.	2044	()>, although that will push the event time of all outstanding events
		2045	further into the future.
		2046
		2047	=head3 The special problem of unsynchronised clocks
		2048
		2049	Modern systems have a variety of clocks - libev itself uses the normal
		2050	"wall clock" clock and, if available, the monotonic clock (to avoid time
		2051	jumps).
		2052
		2053	Neither of these clocks is synchronised with each other or any other clock
		2054	on the system, so C<ev_time ()> might return a considerably different time
		2055	than C<gettimeofday ()> or C<time ()>. On a GNU/Linux system, for example,
		2056	a call to C<gettimeofday> might return a second count that is one higher
		2057	than a directly following call to C<time>.
		2058
		2059	The moral of this is to only compare libev-related timestamps with
		2060	C<ev_time ()> and C<ev_now ()>, at least if you want better precision than
		2061	a second or so.
		2062
		2063	One more problem arises due to this lack of synchronisation: if libev uses
		2064	the system monotonic clock and you compare timestamps from C<ev_time>
		2065	or C<ev_now> from when you started your timer and when your callback is
		2066	invoked, you will find that sometimes the callback is a bit "early".
		2067
		2068	This is because C<ev_timer>s work in real time, not wall clock time, so
		2069	libev makes sure your callback is not invoked before the delay happened,
		2070	I<measured according to the real time>, not the system clock.
		2071
		2072	If your timeouts are based on a physical timescale (e.g. "time out this
		2073	connection after 100 seconds") then this shouldn't bother you as it is
		2074	exactly the right behaviour.
		2075
		2076	If you want to compare wall clock/system timestamps to your timers, then
		2077	you need to use C<ev_periodic>s, as these are based on the wall clock
		2078	time, where your comparisons will always generate correct results.
1923		2079
1924	=head3 The special problems of suspended animation	2080	=head3 The special problems of suspended animation
1925		2081
1926	When you leave the server world it is quite customary to hit machines that	2082	When you leave the server world it is quite customary to hit machines that
1927	can suspend/hibernate - what happens to the clocks during such a suspend?	2083	can suspend/hibernate - what happens to the clocks during such a suspend?
…		…
1971	keep up with the timer (because it takes longer than those 10 seconds to	2127	keep up with the timer (because it takes longer than those 10 seconds to
1972	do stuff) the timer will not fire more than once per event loop iteration.	2128	do stuff) the timer will not fire more than once per event loop iteration.
1973		2129
1974	=item ev_timer_again (loop, ev_timer *)	2130	=item ev_timer_again (loop, ev_timer *)
1975		2131
1976	This will act as if the timer timed out and restart it again if it is	2132	This will act as if the timer timed out, and restarts it again if it is
1977	repeating. The exact semantics are:	2133	repeating. It basically works like calling C<ev_timer_stop>, updating the
		2134	timeout to the C<repeat> value and calling C<ev_timer_start>.
1978		2135
		2136	The exact semantics are as in the following rules, all of which will be
		2137	applied to the watcher:
		2138
		2139	=over 4
		2140
1979	If the timer is pending, its pending status is cleared.	2141	=item If the timer is pending, the pending status is always cleared.
1980		2142
1981	If the timer is started but non-repeating, stop it (as if it timed out).	2143	=item If the timer is started but non-repeating, stop it (as if it timed
		2144	out, without invoking it).
1982		2145
1983	If the timer is repeating, either start it if necessary (with the	2146	=item If the timer is repeating, make the C<repeat> value the new timeout
1984	C<repeat> value), or reset the running timer to the C<repeat> value.	2147	and start the timer, if necessary.
1985		2148
		2149	=back
		2150
1986	This sounds a bit complicated, see L<Be smart about timeouts>, above, for a	2151	This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
1987	usage example.	2152	usage example.
1988		2153
1989	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)	2154	=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1990		2155
1991	Returns the remaining time until a timer fires. If the timer is active,	2156	Returns the remaining time until a timer fires. If the timer is active,
…		…
2044	Periodic watchers are also timers of a kind, but they are very versatile	2209	Periodic watchers are also timers of a kind, but they are very versatile
2045	(and unfortunately a bit complex).	2210	(and unfortunately a bit complex).
2046		2211
2047	Unlike C<ev_timer>, periodic watchers are not based on real time (or	2212	Unlike C<ev_timer>, periodic watchers are not based on real time (or
2048	relative time, the physical time that passes) but on wall clock time	2213	relative time, the physical time that passes) but on wall clock time
2049	(absolute time, the thing you can read on your calender or clock). The	2214	(absolute time, the thing you can read on your calendar or clock). The
2050	difference is that wall clock time can run faster or slower than real	2215	difference is that wall clock time can run faster or slower than real
2051	time, and time jumps are not uncommon (e.g. when you adjust your	2216	time, and time jumps are not uncommon (e.g. when you adjust your
2052	wrist-watch).	2217	wrist-watch).
2053		2218
2054	You can tell a periodic watcher to trigger after some specific point	2219	You can tell a periodic watcher to trigger after some specific point
…		…
2111		2276
2112	Another way to think about it (for the mathematically inclined) is that	2277	Another way to think about it (for the mathematically inclined) is that
2113	C<ev_periodic> will try to run the callback in this mode at the next possible	2278	C<ev_periodic> will try to run the callback in this mode at the next possible
2114	time where C<time = offset (mod interval)>, regardless of any time jumps.	2279	time where C<time = offset (mod interval)>, regardless of any time jumps.
2115		2280
2116	For numerical stability it is preferable that the C<offset> value is near	2281	The C<interval> I<MUST> be positive, and for numerical stability, the
2117	C<ev_now ()> (the current time), but there is no range requirement for	2282	interval value should be higher than C<1/8192> (which is around 100
2118	this value, and in fact is often specified as zero.	2283	microseconds) and C<offset> should be higher than C<0> and should have
		2284	at most a similar magnitude as the current time (say, within a factor of
		2285	ten). Typical values for offset are, in fact, C<0> or something between
		2286	C<0> and C<interval>, which is also the recommended range.
2119		2287
2120	Note also that there is an upper limit to how often a timer can fire (CPU	2288	Note also that there is an upper limit to how often a timer can fire (CPU
2121	speed for example), so if C<interval> is very small then timing stability	2289	speed for example), so if C<interval> is very small then timing stability
2122	will of course deteriorate. Libev itself tries to be exact to be about one	2290	will of course deteriorate. Libev itself tries to be exact to be about one
2123	millisecond (if the OS supports it and the machine is fast enough).	2291	millisecond (if the OS supports it and the machine is fast enough).
…		…
2231		2399
2232	ev_periodic hourly_tick;	2400	ev_periodic hourly_tick;
2233	ev_periodic_init (&hourly_tick, clock_cb,	2401	ev_periodic_init (&hourly_tick, clock_cb,
2234	fmod (ev_now (loop), 3600.), 3600., 0);	2402	fmod (ev_now (loop), 3600.), 3600., 0);
2235	ev_periodic_start (loop, &hourly_tick);	2403	ev_periodic_start (loop, &hourly_tick);
2236		2404
2237		2405
2238	=head2 C<ev_signal> - signal me when a signal gets signalled!	2406	=head2 C<ev_signal> - signal me when a signal gets signalled!
2239		2407
2240	Signal watchers will trigger an event when the process receives a specific	2408	Signal watchers will trigger an event when the process receives a specific
2241	signal one or more times. Even though signals are very asynchronous, libev	2409	signal one or more times. Even though signals are very asynchronous, libev
2242	will try it's best to deliver signals synchronously, i.e. as part of the	2410	will try its best to deliver signals synchronously, i.e. as part of the
2243	normal event processing, like any other event.	2411	normal event processing, like any other event.
2244		2412
2245	If you want signals to be delivered truly asynchronously, just use	2413	If you want signals to be delivered truly asynchronously, just use
2246	C<sigaction> as you would do without libev and forget about sharing	2414	C<sigaction> as you would do without libev and forget about sharing
2247	the signal. You can even use C<ev_async> from a signal handler to	2415	the signal. You can even use C<ev_async> from a signal handler to
…		…
2251	only within the same loop, i.e. you can watch for C<SIGINT> in your	2419	only within the same loop, i.e. you can watch for C<SIGINT> in your
2252	default loop and for C<SIGIO> in another loop, but you cannot watch for	2420	default loop and for C<SIGIO> in another loop, but you cannot watch for
2253	C<SIGINT> in both the default loop and another loop at the same time. At	2421	C<SIGINT> in both the default loop and another loop at the same time. At
2254	the moment, C<SIGCHLD> is permanently tied to the default loop.	2422	the moment, C<SIGCHLD> is permanently tied to the default loop.
2255		2423
2256	When the first watcher gets started will libev actually register something	2424	Only after the first watcher for a signal is started will libev actually
2257	with the kernel (thus it coexists with your own signal handlers as long as	2425	register something with the kernel. It thus coexists with your own signal
2258	you don't register any with libev for the same signal).	2426	handlers as long as you don't register any with libev for the same signal.
2259		2427
2260	If possible and supported, libev will install its handlers with	2428	If possible and supported, libev will install its handlers with
2261	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should	2429	C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2262	not be unduly interrupted. If you have a problem with system calls getting	2430	not be unduly interrupted. If you have a problem with system calls getting
2263	interrupted by signals you can block all signals in an C<ev_check> watcher	2431	interrupted by signals you can block all signals in an C<ev_check> watcher
…		…
2266	=head3 The special problem of inheritance over fork/execve/pthread_create	2434	=head3 The special problem of inheritance over fork/execve/pthread_create
2267		2435
2268	Both the signal mask (C<sigprocmask>) and the signal disposition	2436	Both the signal mask (C<sigprocmask>) and the signal disposition
2269	(C<sigaction>) are unspecified after starting a signal watcher (and after	2437	(C<sigaction>) are unspecified after starting a signal watcher (and after
2270	stopping it again), that is, libev might or might not block the signal,	2438	stopping it again), that is, libev might or might not block the signal,
2271	and might or might not set or restore the installed signal handler.	2439	and might or might not set or restore the installed signal handler (but
		2440	see C<EVFLAG_NOSIGMASK>).
2272		2441
2273	While this does not matter for the signal disposition (libev never	2442	While this does not matter for the signal disposition (libev never
2274	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on	2443	sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2275	C<execve>), this matters for the signal mask: many programs do not expect	2444	C<execve>), this matters for the signal mask: many programs do not expect
2276	certain signals to be blocked.	2445	certain signals to be blocked.
…		…
2289	I<has> to modify the signal mask, at least temporarily.	2458	I<has> to modify the signal mask, at least temporarily.
2290		2459
2291	So I can't stress this enough: I<If you do not reset your signal mask when	2460	So I can't stress this enough: I<If you do not reset your signal mask when
2292	you expect it to be empty, you have a race condition in your code>. This	2461	you expect it to be empty, you have a race condition in your code>. This
2293	is not a libev-specific thing, this is true for most event libraries.	2462	is not a libev-specific thing, this is true for most event libraries.
		2463
		2464	=head3 The special problem of threads signal handling
		2465
		2466	POSIX threads has problematic signal handling semantics, specifically,
		2467	a lot of functionality (sigfd, sigwait etc.) only really works if all
		2468	threads in a process block signals, which is hard to achieve.
		2469
		2470	When you want to use sigwait (or mix libev signal handling with your own
		2471	for the same signals), you can tackle this problem by globally blocking
		2472	all signals before creating any threads (or creating them with a fully set
		2473	sigprocmask) and also specifying the C<EVFLAG_NOSIGMASK> when creating
		2474	loops. Then designate one thread as "signal receiver thread" which handles
		2475	these signals. You can pass on any signals that libev might be interested
		2476	in by calling C<ev_feed_signal>.
2294		2477
2295	=head3 Watcher-Specific Functions and Data Members	2478	=head3 Watcher-Specific Functions and Data Members
2296		2479
2297	=over 4	2480	=over 4
2298		2481
…		…
2433		2616
2434	=head2 C<ev_stat> - did the file attributes just change?	2617	=head2 C<ev_stat> - did the file attributes just change?
2435		2618
2436	This watches a file system path for attribute changes. That is, it calls	2619	This watches a file system path for attribute changes. That is, it calls
2437	C<stat> on that path in regular intervals (or when the OS says it changed)	2620	C<stat> on that path in regular intervals (or when the OS says it changed)
2438	and sees if it changed compared to the last time, invoking the callback if	2621	and sees if it changed compared to the last time, invoking the callback
2439	it did.	2622	if it did. Starting the watcher C<stat>'s the file, so only changes that
		2623	happen after the watcher has been started will be reported.
2440		2624
2441	The path does not need to exist: changing from "path exists" to "path does	2625	The path does not need to exist: changing from "path exists" to "path does
2442	not exist" is a status change like any other. The condition "path does not	2626	not exist" is a status change like any other. The condition "path does not
2443	exist" (or more correctly "path cannot be stat'ed") is signified by the	2627	exist" (or more correctly "path cannot be stat'ed") is signified by the
2444	C<st_nlink> field being zero (which is otherwise always forced to be at	2628	C<st_nlink> field being zero (which is otherwise always forced to be at
…		…
2674	Apart from keeping your process non-blocking (which is a useful	2858	Apart from keeping your process non-blocking (which is a useful
2675	effect on its own sometimes), idle watchers are a good place to do	2859	effect on its own sometimes), idle watchers are a good place to do
2676	"pseudo-background processing", or delay processing stuff to after the	2860	"pseudo-background processing", or delay processing stuff to after the
2677	event loop has handled all outstanding events.	2861	event loop has handled all outstanding events.
2678		2862
		2863	=head3 Abusing an C<ev_idle> watcher for its side-effect
		2864
		2865	As long as there is at least one active idle watcher, libev will never
		2866	sleep unnecessarily. Or in other words, it will loop as fast as possible.
		2867	For this to work, the idle watcher doesn't need to be invoked at all - the
		2868	lowest priority will do.
		2869
		2870	This mode of operation can be useful together with an C<ev_check> watcher,
		2871	to do something on each event loop iteration - for example to balance load
		2872	between different connections.
		2873
		2874	See L</Abusing an ev_check watcher for its side-effect> for a longer
		2875	example.
		2876
2679	=head3 Watcher-Specific Functions and Data Members	2877	=head3 Watcher-Specific Functions and Data Members
2680		2878
2681	=over 4	2879	=over 4
2682		2880
2683	=item ev_idle_init (ev_idle *, callback)	2881	=item ev_idle_init (ev_idle *, callback)
…		…
2694	callback, free it. Also, use no error checking, as usual.	2892	callback, free it. Also, use no error checking, as usual.
2695		2893
2696	static void	2894	static void
2697	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)	2895	idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2698	{	2896	{
		2897	// stop the watcher
		2898	ev_idle_stop (loop, w);
		2899
		2900	// now we can free it
2699	free (w);	2901	free (w);
		2902
2700	// now do something you wanted to do when the program has	2903	// now do something you wanted to do when the program has
2701	// no longer anything immediate to do.	2904	// no longer anything immediate to do.
2702	}	2905	}
2703		2906
2704	ev_idle *idle_watcher = malloc (sizeof (ev_idle));	2907	ev_idle *idle_watcher = malloc (sizeof (ev_idle));
…		…
2706	ev_idle_start (loop, idle_watcher);	2909	ev_idle_start (loop, idle_watcher);
2707		2910
2708		2911
2709	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!	2912	=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2710		2913
2711	Prepare and check watchers are usually (but not always) used in pairs:	2914	Prepare and check watchers are often (but not always) used in pairs:
2712	prepare watchers get invoked before the process blocks and check watchers	2915	prepare watchers get invoked before the process blocks and check watchers
2713	afterwards.	2916	afterwards.
2714		2917
2715	You I<must not> call C<ev_run> or similar functions that enter	2918	You I<must not> call C<ev_run> (or similar functions that enter the
2716	the current event loop from either C<ev_prepare> or C<ev_check>	2919	current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2717	watchers. Other loops than the current one are fine, however. The	2920	C<ev_check> watchers. Other loops than the current one are fine,
2718	rationale behind this is that you do not need to check for recursion in	2921	however. The rationale behind this is that you do not need to check
2719	those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,	2922	for recursion in those watchers, i.e. the sequence will always be
2720	C<ev_check> so if you have one watcher of each kind they will always be	2923	C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2721	called in pairs bracketing the blocking call.	2924	kind they will always be called in pairs bracketing the blocking call.
2722		2925
2723	Their main purpose is to integrate other event mechanisms into libev and	2926	Their main purpose is to integrate other event mechanisms into libev and
2724	their use is somewhat advanced. They could be used, for example, to track	2927	their use is somewhat advanced. They could be used, for example, to track
2725	variable changes, implement your own watchers, integrate net-snmp or a	2928	variable changes, implement your own watchers, integrate net-snmp or a
2726	coroutine library and lots more. They are also occasionally useful if	2929	coroutine library and lots more. They are also occasionally useful if
…		…
2744	with priority higher than or equal to the event loop and one coroutine	2947	with priority higher than or equal to the event loop and one coroutine
2745	of lower priority, but only once, using idle watchers to keep the event	2948	of lower priority, but only once, using idle watchers to keep the event
2746	loop from blocking if lower-priority coroutines are active, thus mapping	2949	loop from blocking if lower-priority coroutines are active, thus mapping
2747	low-priority coroutines to idle/background tasks).	2950	low-priority coroutines to idle/background tasks).
2748		2951
2749	It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)	2952	When used for this purpose, it is recommended to give C<ev_check> watchers
2750	priority, to ensure that they are being run before any other watchers	2953	highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2751	after the poll (this doesn't matter for C<ev_prepare> watchers).	2954	any other watchers after the poll (this doesn't matter for C<ev_prepare>
		2955	watchers).
2752		2956
2753	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not	2957	Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2754	activate ("feed") events into libev. While libev fully supports this, they	2958	activate ("feed") events into libev. While libev fully supports this, they
2755	might get executed before other C<ev_check> watchers did their job. As	2959	might get executed before other C<ev_check> watchers did their job. As
2756	C<ev_check> watchers are often used to embed other (non-libev) event	2960	C<ev_check> watchers are often used to embed other (non-libev) event
2757	loops those other event loops might be in an unusable state until their	2961	loops those other event loops might be in an unusable state until their
2758	C<ev_check> watcher ran (always remind yourself to coexist peacefully with	2962	C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2759	others).	2963	others).
		2964
		2965	=head3 Abusing an C<ev_check> watcher for its side-effect
		2966
		2967	C<ev_check> (and less often also C<ev_prepare>) watchers can also be
		2968	useful because they are called once per event loop iteration. For
		2969	example, if you want to handle a large number of connections fairly, you
		2970	normally only do a bit of work for each active connection, and if there
		2971	is more work to do, you wait for the next event loop iteration, so other
		2972	connections have a chance of making progress.
		2973
		2974	Using an C<ev_check> watcher is almost enough: it will be called on the
		2975	next event loop iteration. However, that isn't as soon as possible -
		2976	without external events, your C<ev_check> watcher will not be invoked.
		2977
		2978	This is where C<ev_idle> watchers come in handy - all you need is a
		2979	single global idle watcher that is active as long as you have one active
		2980	C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
		2981	will not sleep, and the C<ev_check> watcher makes sure a callback gets
		2982	invoked. Neither watcher alone can do that.
2760		2983
2761	=head3 Watcher-Specific Functions and Data Members	2984	=head3 Watcher-Specific Functions and Data Members
2762		2985
2763	=over 4	2986	=over 4
2764		2987
…		…
2965		3188
2966	=over 4	3189	=over 4
2967		3190
2968	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)	3191	=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
2969		3192
2970	=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)	3193	=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
2971		3194
2972	Configures the watcher to embed the given loop, which must be	3195	Configures the watcher to embed the given loop, which must be
2973	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be	3196	embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2974	invoked automatically, otherwise it is the responsibility of the callback	3197	invoked automatically, otherwise it is the responsibility of the callback
2975	to invoke it (it will continue to be called until the sweep has been done,	3198	to invoke it (it will continue to be called until the sweep has been done,
…		…
2996	used).	3219	used).
2997		3220
2998	struct ev_loop *loop_hi = ev_default_init (0);	3221	struct ev_loop *loop_hi = ev_default_init (0);
2999	struct ev_loop *loop_lo = 0;	3222	struct ev_loop *loop_lo = 0;
3000	ev_embed embed;	3223	ev_embed embed;
3001		3224
3002	// see if there is a chance of getting one that works	3225	// see if there is a chance of getting one that works
3003	// (remember that a flags value of 0 means autodetection)	3226	// (remember that a flags value of 0 means autodetection)
3004	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()	3227	loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3005	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())	3228	? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3006	: 0;	3229	: 0;
…		…
3020	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).	3243	C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3021		3244
3022	struct ev_loop *loop = ev_default_init (0);	3245	struct ev_loop *loop = ev_default_init (0);
3023	struct ev_loop *loop_socket = 0;	3246	struct ev_loop *loop_socket = 0;
3024	ev_embed embed;	3247	ev_embed embed;
3025		3248
3026	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)	3249	if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3027	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))	3250	if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3028	{	3251	{
3029	ev_embed_init (&embed, 0, loop_socket);	3252	ev_embed_init (&embed, 0, loop_socket);
3030	ev_embed_start (loop, &embed);	3253	ev_embed_start (loop, &embed);
…		…
3038		3261
3039	=head2 C<ev_fork> - the audacity to resume the event loop after a fork	3262	=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3040		3263
3041	Fork watchers are called when a C<fork ()> was detected (usually because	3264	Fork watchers are called when a C<fork ()> was detected (usually because
3042	whoever is a good citizen cared to tell libev about it by calling	3265	whoever is a good citizen cared to tell libev about it by calling
3043	C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the	3266	C<ev_loop_fork>). The invocation is done before the event loop blocks next
3044	event loop blocks next and before C<ev_check> watchers are being called,	3267	and before C<ev_check> watchers are being called, and only in the child
3045	and only in the child after the fork. If whoever good citizen calling	3268	after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3046	C<ev_default_fork> cheats and calls it in the wrong process, the fork	3269	and calls it in the wrong process, the fork handlers will be invoked, too,
3047	handlers will be invoked, too, of course.	3270	of course.
3048		3271
3049	=head3 The special problem of life after fork - how is it possible?	3272	=head3 The special problem of life after fork - how is it possible?
3050		3273
3051	Most uses of C<fork()> consist of forking, then some simple calls to set	3274	Most uses of C<fork ()> consist of forking, then some simple calls to set
3052	up/change the process environment, followed by a call to C<exec()>. This	3275	up/change the process environment, followed by a call to C<exec()>. This
3053	sequence should be handled by libev without any problems.	3276	sequence should be handled by libev without any problems.
3054		3277
3055	This changes when the application actually wants to do event handling	3278	This changes when the application actually wants to do event handling
3056	in the child, or both parent in child, in effect "continuing" after the	3279	in the child, or both parent in child, in effect "continuing" after the
…		…
3072	disadvantage of having to use multiple event loops (which do not support	3295	disadvantage of having to use multiple event loops (which do not support
3073	signal watchers).	3296	signal watchers).
3074		3297
3075	When this is not possible, or you want to use the default loop for	3298	When this is not possible, or you want to use the default loop for
3076	other reasons, then in the process that wants to start "fresh", call	3299	other reasons, then in the process that wants to start "fresh", call
3077	C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying	3300	C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
3078	the default loop will "orphan" (not stop) all registered watchers, so you	3301	Destroying the default loop will "orphan" (not stop) all registered
3079	have to be careful not to execute code that modifies those watchers. Note	3302	watchers, so you have to be careful not to execute code that modifies
3080	also that in that case, you have to re-register any signal watchers.	3303	those watchers. Note also that in that case, you have to re-register any
		3304	signal watchers.
3081		3305
3082	=head3 Watcher-Specific Functions and Data Members	3306	=head3 Watcher-Specific Functions and Data Members
3083		3307
3084	=over 4	3308	=over 4
3085		3309
3086	=item ev_fork_init (ev_signal *, callback)	3310	=item ev_fork_init (ev_fork *, callback)
3087		3311
3088	Initialises and configures the fork watcher - it has no parameters of any	3312	Initialises and configures the fork watcher - it has no parameters of any
3089	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,	3313	kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
3090	believe me.	3314	really.
3091		3315
3092	=back	3316	=back
3093		3317
3094		3318
		3319	=head2 C<ev_cleanup> - even the best things end
		3320
		3321	Cleanup watchers are called just before the event loop is being destroyed
		3322	by a call to C<ev_loop_destroy>.
		3323
		3324	While there is no guarantee that the event loop gets destroyed, cleanup
		3325	watchers provide a convenient method to install cleanup hooks for your
		3326	program, worker threads and so on - you just to make sure to destroy the
		3327	loop when you want them to be invoked.
		3328
		3329	Cleanup watchers are invoked in the same way as any other watcher. Unlike
		3330	all other watchers, they do not keep a reference to the event loop (which
		3331	makes a lot of sense if you think about it). Like all other watchers, you
		3332	can call libev functions in the callback, except C<ev_cleanup_start>.
		3333
		3334	=head3 Watcher-Specific Functions and Data Members
		3335
		3336	=over 4
		3337
		3338	=item ev_cleanup_init (ev_cleanup *, callback)
		3339
		3340	Initialises and configures the cleanup watcher - it has no parameters of
		3341	any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
		3342	pointless, I assure you.
		3343
		3344	=back
		3345
		3346	Example: Register an atexit handler to destroy the default loop, so any
		3347	cleanup functions are called.
		3348
		3349	static void
		3350	program_exits (void)
		3351	{
		3352	ev_loop_destroy (EV_DEFAULT_UC);
		3353	}
		3354
		3355	...
		3356	atexit (program_exits);
		3357
		3358
3095	=head2 C<ev_async> - how to wake up an event loop	3359	=head2 C<ev_async> - how to wake up an event loop
3096		3360
3097	In general, you cannot use an C<ev_run> from multiple threads or other	3361	In general, you cannot use an C<ev_loop> from multiple threads or other
3098	asynchronous sources such as signal handlers (as opposed to multiple event	3362	asynchronous sources such as signal handlers (as opposed to multiple event
3099	loops - those are of course safe to use in different threads).	3363	loops - those are of course safe to use in different threads).
3100		3364
3101	Sometimes, however, you need to wake up an event loop you do not control,	3365	Sometimes, however, you need to wake up an event loop you do not control,
3102	for example because it belongs to another thread. This is what C<ev_async>	3366	for example because it belongs to another thread. This is what C<ev_async>
…		…
3104	it by calling C<ev_async_send>, which is thread- and signal safe.	3368	it by calling C<ev_async_send>, which is thread- and signal safe.
3105		3369
3106	This functionality is very similar to C<ev_signal> watchers, as signals,	3370	This functionality is very similar to C<ev_signal> watchers, as signals,
3107	too, are asynchronous in nature, and signals, too, will be compressed	3371	too, are asynchronous in nature, and signals, too, will be compressed
3108	(i.e. the number of callback invocations may be less than the number of	3372	(i.e. the number of callback invocations may be less than the number of
3109	C<ev_async_sent> calls).	3373	C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3110		3374	of "global async watchers" by using a watcher on an otherwise unused
3111	Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not	3375	signal, and C<ev_feed_signal> to signal this watcher from another thread,
3112	just the default loop.	3376	even without knowing which loop owns the signal.
3113		3377
3114	=head3 Queueing	3378	=head3 Queueing
3115		3379
3116	C<ev_async> does not support queueing of data in any way. The reason	3380	C<ev_async> does not support queueing of data in any way. The reason
3117	is that the author does not know of a simple (or any) algorithm for a	3381	is that the author does not know of a simple (or any) algorithm for a
…		…
3209	trust me.	3473	trust me.
3210		3474
3211	=item ev_async_send (loop, ev_async *)	3475	=item ev_async_send (loop, ev_async *)
3212		3476
3213	Sends/signals/activates the given C<ev_async> watcher, that is, feeds	3477	Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3214	an C<EV_ASYNC> event on the watcher into the event loop. Unlike	3478	an C<EV_ASYNC> event on the watcher into the event loop, and instantly
		3479	returns.
		3480
3215	C<ev_feed_event>, this call is safe to do from other threads, signal or	3481	Unlike C<ev_feed_event>, this call is safe to do from other threads,
3216	similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding	3482	signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3217	section below on what exactly this means).	3483	embedding section below on what exactly this means).
3218		3484
3219	Note that, as with other watchers in libev, multiple events might get	3485	Note that, as with other watchers in libev, multiple events might get
3220	compressed into a single callback invocation (another way to look at this	3486	compressed into a single callback invocation (another way to look at
3221	is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,	3487	this is that C<ev_async> watchers are level-triggered: they are set on
3222	reset when the event loop detects that).	3488	C<ev_async_send>, reset when the event loop detects that).
3223		3489
3224	This call incurs the overhead of a system call only once per event loop	3490	This call incurs the overhead of at most one extra system call per event
3225	iteration, so while the overhead might be noticeable, it doesn't apply to	3491	loop iteration, if the event loop is blocked, and no syscall at all if
3226	repeated calls to C<ev_async_send> for the same event loop.	3492	the event loop (or your program) is processing events. That means that
		3493	repeated calls are basically free (there is no need to avoid calls for
		3494	performance reasons) and that the overhead becomes smaller (typically
		3495	zero) under load.
3227		3496
3228	=item bool = ev_async_pending (ev_async *)	3497	=item bool = ev_async_pending (ev_async *)
3229		3498
3230	Returns a non-zero value when C<ev_async_send> has been called on the	3499	Returns a non-zero value when C<ev_async_send> has been called on the
3231	watcher but the event has not yet been processed (or even noted) by the	3500	watcher but the event has not yet been processed (or even noted) by the
…		…
3286	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);	3555	ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
3287		3556
3288	=item ev_feed_fd_event (loop, int fd, int revents)	3557	=item ev_feed_fd_event (loop, int fd, int revents)
3289		3558
3290	Feed an event on the given fd, as if a file descriptor backend detected	3559	Feed an event on the given fd, as if a file descriptor backend detected
3291	the given events it.	3560	the given events.
3292		3561
3293	=item ev_feed_signal_event (loop, int signum)	3562	=item ev_feed_signal_event (loop, int signum)
3294		3563
3295	Feed an event as if the given signal occurred (C<loop> must be the default	3564	Feed an event as if the given signal occurred. See also C<ev_feed_signal>,
3296	loop!).	3565	which is async-safe.
3297		3566
3298	=back	3567	=back
		3568
		3569
		3570	=head1 COMMON OR USEFUL IDIOMS (OR BOTH)
		3571
		3572	This section explains some common idioms that are not immediately
		3573	obvious. Note that examples are sprinkled over the whole manual, and this
		3574	section only contains stuff that wouldn't fit anywhere else.
		3575
		3576	=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
		3577
		3578	Each watcher has, by default, a C<void *data> member that you can read
		3579	or modify at any time: libev will completely ignore it. This can be used
		3580	to associate arbitrary data with your watcher. If you need more data and
		3581	don't want to allocate memory separately and store a pointer to it in that
		3582	data member, you can also "subclass" the watcher type and provide your own
		3583	data:
		3584
		3585	struct my_io
		3586	{
		3587	ev_io io;
		3588	int otherfd;
		3589	void *somedata;
		3590	struct whatever *mostinteresting;
		3591	};
		3592
		3593	...
		3594	struct my_io w;
		3595	ev_io_init (&w.io, my_cb, fd, EV_READ);
		3596
		3597	And since your callback will be called with a pointer to the watcher, you
		3598	can cast it back to your own type:
		3599
		3600	static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
		3601	{
		3602	struct my_io *w = (struct my_io *)w_;
		3603	...
		3604	}
		3605
		3606	More interesting and less C-conformant ways of casting your callback
		3607	function type instead have been omitted.
		3608
		3609	=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
		3610
		3611	Another common scenario is to use some data structure with multiple
		3612	embedded watchers, in effect creating your own watcher that combines
		3613	multiple libev event sources into one "super-watcher":
		3614
		3615	struct my_biggy
		3616	{
		3617	int some_data;
		3618	ev_timer t1;
		3619	ev_timer t2;
		3620	}
		3621
		3622	In this case getting the pointer to C<my_biggy> is a bit more
		3623	complicated: Either you store the address of your C<my_biggy> struct in
		3624	the C<data> member of the watcher (for woozies or C++ coders), or you need
		3625	to use some pointer arithmetic using C<offsetof> inside your watchers (for
		3626	real programmers):
		3627
		3628	#include <stddef.h>
		3629
		3630	static void
		3631	t1_cb (EV_P_ ev_timer *w, int revents)
		3632	{
		3633	struct my_biggy big = (struct my_biggy *)
		3634	(((char *)w) - offsetof (struct my_biggy, t1));
		3635	}
		3636
		3637	static void
		3638	t2_cb (EV_P_ ev_timer *w, int revents)
		3639	{
		3640	struct my_biggy big = (struct my_biggy *)
		3641	(((char *)w) - offsetof (struct my_biggy, t2));
		3642	}
		3643
		3644	=head2 AVOIDING FINISHING BEFORE RETURNING
		3645
		3646	Often you have structures like this in event-based programs:
		3647
		3648	callback ()
		3649	{
		3650	free (request);
		3651	}
		3652
		3653	request = start_new_request (..., callback);
		3654
		3655	The intent is to start some "lengthy" operation. The C<request> could be
		3656	used to cancel the operation, or do other things with it.
		3657
		3658	It's not uncommon to have code paths in C<start_new_request> that
		3659	immediately invoke the callback, for example, to report errors. Or you add
		3660	some caching layer that finds that it can skip the lengthy aspects of the
		3661	operation and simply invoke the callback with the result.
		3662
		3663	The problem here is that this will happen I<before> C<start_new_request>
		3664	has returned, so C<request> is not set.
		3665
		3666	Even if you pass the request by some safer means to the callback, you
		3667	might want to do something to the request after starting it, such as
		3668	canceling it, which probably isn't working so well when the callback has
		3669	already been invoked.
		3670
		3671	A common way around all these issues is to make sure that
		3672	C<start_new_request> I<always> returns before the callback is invoked. If
		3673	C<start_new_request> immediately knows the result, it can artificially
		3674	delay invoking the callback by using a C<prepare> or C<idle> watcher for
		3675	example, or more sneakily, by reusing an existing (stopped) watcher and
		3676	pushing it into the pending queue:
		3677
		3678	ev_set_cb (watcher, callback);
		3679	ev_feed_event (EV_A_ watcher, 0);
		3680
		3681	This way, C<start_new_request> can safely return before the callback is
		3682	invoked, while not delaying callback invocation too much.
		3683
		3684	=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
		3685
		3686	Often (especially in GUI toolkits) there are places where you have
		3687	I<modal> interaction, which is most easily implemented by recursively
		3688	invoking C<ev_run>.
		3689
		3690	This brings the problem of exiting - a callback might want to finish the
		3691	main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
		3692	a modal "Are you sure?" dialog is still waiting), or just the nested one
		3693	and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
		3694	other combination: In these cases, a simple C<ev_break> will not work.
		3695
		3696	The solution is to maintain "break this loop" variable for each C<ev_run>
		3697	invocation, and use a loop around C<ev_run> until the condition is
		3698	triggered, using C<EVRUN_ONCE>:
		3699
		3700	// main loop
		3701	int exit_main_loop = 0;
		3702
		3703	while (!exit_main_loop)
		3704	ev_run (EV_DEFAULT_ EVRUN_ONCE);
		3705
		3706	// in a modal watcher
		3707	int exit_nested_loop = 0;
		3708
		3709	while (!exit_nested_loop)
		3710	ev_run (EV_A_ EVRUN_ONCE);
		3711
		3712	To exit from any of these loops, just set the corresponding exit variable:
		3713
		3714	// exit modal loop
		3715	exit_nested_loop = 1;
		3716
		3717	// exit main program, after modal loop is finished
		3718	exit_main_loop = 1;
		3719
		3720	// exit both
		3721	exit_main_loop = exit_nested_loop = 1;
		3722
		3723	=head2 THREAD LOCKING EXAMPLE
		3724
		3725	Here is a fictitious example of how to run an event loop in a different
		3726	thread from where callbacks are being invoked and watchers are
		3727	created/added/removed.
		3728
		3729	For a real-world example, see the C<EV::Loop::Async> perl module,
		3730	which uses exactly this technique (which is suited for many high-level
		3731	languages).
		3732
		3733	The example uses a pthread mutex to protect the loop data, a condition
		3734	variable to wait for callback invocations, an async watcher to notify the
		3735	event loop thread and an unspecified mechanism to wake up the main thread.
		3736
		3737	First, you need to associate some data with the event loop:
		3738
		3739	typedef struct {
		3740	mutex_t lock; /* global loop lock */
		3741	ev_async async_w;
		3742	thread_t tid;
		3743	cond_t invoke_cv;
		3744	} userdata;
		3745
		3746	void prepare_loop (EV_P)
		3747	{
		3748	// for simplicity, we use a static userdata struct.
		3749	static userdata u;
		3750
		3751	ev_async_init (&u->async_w, async_cb);
		3752	ev_async_start (EV_A_ &u->async_w);
		3753
		3754	pthread_mutex_init (&u->lock, 0);
		3755	pthread_cond_init (&u->invoke_cv, 0);
		3756
		3757	// now associate this with the loop
		3758	ev_set_userdata (EV_A_ u);
		3759	ev_set_invoke_pending_cb (EV_A_ l_invoke);
		3760	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
		3761
		3762	// then create the thread running ev_run
		3763	pthread_create (&u->tid, 0, l_run, EV_A);
		3764	}
		3765
		3766	The callback for the C<ev_async> watcher does nothing: the watcher is used
		3767	solely to wake up the event loop so it takes notice of any new watchers
		3768	that might have been added:
		3769
		3770	static void
		3771	async_cb (EV_P_ ev_async *w, int revents)
		3772	{
		3773	// just used for the side effects
		3774	}
		3775
		3776	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
		3777	protecting the loop data, respectively.
		3778
		3779	static void
		3780	l_release (EV_P)
		3781	{
		3782	userdata *u = ev_userdata (EV_A);
		3783	pthread_mutex_unlock (&u->lock);
		3784	}
		3785
		3786	static void
		3787	l_acquire (EV_P)
		3788	{
		3789	userdata *u = ev_userdata (EV_A);
		3790	pthread_mutex_lock (&u->lock);
		3791	}
		3792
		3793	The event loop thread first acquires the mutex, and then jumps straight
		3794	into C<ev_run>:
		3795
		3796	void *
		3797	l_run (void *thr_arg)
		3798	{
		3799	struct ev_loop *loop = (struct ev_loop *)thr_arg;
		3800
		3801	l_acquire (EV_A);
		3802	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
		3803	ev_run (EV_A_ 0);
		3804	l_release (EV_A);
		3805
		3806	return 0;
		3807	}
		3808
		3809	Instead of invoking all pending watchers, the C<l_invoke> callback will
		3810	signal the main thread via some unspecified mechanism (signals? pipe
		3811	writes? C<Async::Interrupt>?) and then waits until all pending watchers
		3812	have been called (in a while loop because a) spurious wakeups are possible
		3813	and b) skipping inter-thread-communication when there are no pending
		3814	watchers is very beneficial):
		3815
		3816	static void
		3817	l_invoke (EV_P)
		3818	{
		3819	userdata *u = ev_userdata (EV_A);
		3820
		3821	while (ev_pending_count (EV_A))
		3822	{
		3823	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
		3824	pthread_cond_wait (&u->invoke_cv, &u->lock);
		3825	}
		3826	}
		3827
		3828	Now, whenever the main thread gets told to invoke pending watchers, it
		3829	will grab the lock, call C<ev_invoke_pending> and then signal the loop
		3830	thread to continue:
		3831
		3832	static void
		3833	real_invoke_pending (EV_P)
		3834	{
		3835	userdata *u = ev_userdata (EV_A);
		3836
		3837	pthread_mutex_lock (&u->lock);
		3838	ev_invoke_pending (EV_A);
		3839	pthread_cond_signal (&u->invoke_cv);
		3840	pthread_mutex_unlock (&u->lock);
		3841	}
		3842
		3843	Whenever you want to start/stop a watcher or do other modifications to an
		3844	event loop, you will now have to lock:
		3845
		3846	ev_timer timeout_watcher;
		3847	userdata *u = ev_userdata (EV_A);
		3848
		3849	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
		3850
		3851	pthread_mutex_lock (&u->lock);
		3852	ev_timer_start (EV_A_ &timeout_watcher);
		3853	ev_async_send (EV_A_ &u->async_w);
		3854	pthread_mutex_unlock (&u->lock);
		3855
		3856	Note that sending the C<ev_async> watcher is required because otherwise
		3857	an event loop currently blocking in the kernel will have no knowledge
		3858	about the newly added timer. By waking up the loop it will pick up any new
		3859	watchers in the next event loop iteration.
		3860
		3861	=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
		3862
		3863	While the overhead of a callback that e.g. schedules a thread is small, it
		3864	is still an overhead. If you embed libev, and your main usage is with some
		3865	kind of threads or coroutines, you might want to customise libev so that
		3866	doesn't need callbacks anymore.
		3867
		3868	Imagine you have coroutines that you can switch to using a function
		3869	C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
		3870	and that due to some magic, the currently active coroutine is stored in a
		3871	global called C<current_coro>. Then you can build your own "wait for libev
		3872	event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
		3873	the differing C<;> conventions):
		3874
		3875	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3876	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3877
		3878	That means instead of having a C callback function, you store the
		3879	coroutine to switch to in each watcher, and instead of having libev call
		3880	your callback, you instead have it switch to that coroutine.
		3881
		3882	A coroutine might now wait for an event with a function called
		3883	C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
		3884	matter when, or whether the watcher is active or not when this function is
		3885	called):
		3886
		3887	void
		3888	wait_for_event (ev_watcher *w)
		3889	{
		3890	ev_set_cb (w, current_coro);
		3891	switch_to (libev_coro);
		3892	}
		3893
		3894	That basically suspends the coroutine inside C<wait_for_event> and
		3895	continues the libev coroutine, which, when appropriate, switches back to
		3896	this or any other coroutine.
		3897
		3898	You can do similar tricks if you have, say, threads with an event queue -
		3899	instead of storing a coroutine, you store the queue object and instead of
		3900	switching to a coroutine, you push the watcher onto the queue and notify
		3901	any waiters.
		3902
		3903	To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
		3904	files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
		3905
		3906	// my_ev.h
		3907	#define EV_CB_DECLARE(type) struct my_coro *cb;
		3908	#define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
		3909	#include "../libev/ev.h"
		3910
		3911	// my_ev.c
		3912	#define EV_H "my_ev.h"
		3913	#include "../libev/ev.c"
		3914
		3915	And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
		3916	F<my_ev.c> into your project. When properly specifying include paths, you
		3917	can even use F<ev.h> as header file name directly.
3299		3918
3300		3919
3301	=head1 LIBEVENT EMULATION	3920	=head1 LIBEVENT EMULATION
3302		3921
3303	Libev offers a compatibility emulation layer for libevent. It cannot	3922	Libev offers a compatibility emulation layer for libevent. It cannot
3304	emulate the internals of libevent, so here are some usage hints:	3923	emulate the internals of libevent, so here are some usage hints:
3305		3924
3306	=over 4	3925	=over 4
		3926
		3927	=item * Only the libevent-1.4.1-beta API is being emulated.
		3928
		3929	This was the newest libevent version available when libev was implemented,
		3930	and is still mostly unchanged in 2010.
3307		3931
3308	=item * Use it by including <event.h>, as usual.	3932	=item * Use it by including <event.h>, as usual.
3309		3933
3310	=item * The following members are fully supported: ev_base, ev_callback,	3934	=item * The following members are fully supported: ev_base, ev_callback,
3311	ev_arg, ev_fd, ev_res, ev_events.	3935	ev_arg, ev_fd, ev_res, ev_events.
…		…
3317	=item * Priorities are not currently supported. Initialising priorities	3941	=item * Priorities are not currently supported. Initialising priorities
3318	will fail and all watchers will have the same priority, even though there	3942	will fail and all watchers will have the same priority, even though there
3319	is an ev_pri field.	3943	is an ev_pri field.
3320		3944
3321	=item * In libevent, the last base created gets the signals, in libev, the	3945	=item * In libevent, the last base created gets the signals, in libev, the
3322	first base created (== the default loop) gets the signals.	3946	base that registered the signal gets the signals.
3323		3947
3324	=item * Other members are not supported.	3948	=item * Other members are not supported.
3325		3949
3326	=item * The libev emulation is I<not> ABI compatible to libevent, you need	3950	=item * The libev emulation is I<not> ABI compatible to libevent, you need
3327	to use the libev header file and library.	3951	to use the libev header file and library.
3328		3952
3329	=back	3953	=back
3330		3954
3331	=head1 C++ SUPPORT	3955	=head1 C++ SUPPORT
		3956
		3957	=head2 C API
		3958
		3959	The normal C API should work fine when used from C++: both ev.h and the
		3960	libev sources can be compiled as C++. Therefore, code that uses the C API
		3961	will work fine.
		3962
		3963	Proper exception specifications might have to be added to callbacks passed
		3964	to libev: exceptions may be thrown only from watcher callbacks, all
		3965	other callbacks (allocator, syserr, loop acquire/release and periodic
		3966	reschedule callbacks) must not throw exceptions, and might need a C<throw
		3967	()> specification. If you have code that needs to be compiled as both C
		3968	and C++ you can use the C<EV_THROW> macro for this:
		3969
		3970	static void
		3971	fatal_error (const char *msg) EV_THROW
		3972	{
		3973	perror (msg);
		3974	abort ();
		3975	}
		3976
		3977	...
		3978	ev_set_syserr_cb (fatal_error);
		3979
		3980	The only API functions that can currently throw exceptions are C<ev_run>,
		3981	C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
		3982	because it runs cleanup watchers).
		3983
		3984	Throwing exceptions in watcher callbacks is only supported if libev itself
		3985	is compiled with a C++ compiler or your C and C++ environments allow
		3986	throwing exceptions through C libraries (most do).
		3987
		3988	=head2 C++ API
3332		3989
3333	Libev comes with some simplistic wrapper classes for C++ that mainly allow	3990	Libev comes with some simplistic wrapper classes for C++ that mainly allow
3334	you to use some convenience methods to start/stop watchers and also change	3991	you to use some convenience methods to start/stop watchers and also change
3335	the callback model to a model using method callbacks on objects.	3992	the callback model to a model using method callbacks on objects.
3336		3993
3337	To use it,	3994	To use it,
3338		3995
3339	#include <ev++.h>	3996	#include <ev++.h>
3340		3997
3341	This automatically includes F<ev.h> and puts all of its definitions (many	3998	This automatically includes F<ev.h> and puts all of its definitions (many
3342	of them macros) into the global namespace. All C++ specific things are	3999	of them macros) into the global namespace. All C++ specific things are
3343	put into the C<ev> namespace. It should support all the same embedding	4000	put into the C<ev> namespace. It should support all the same embedding
…		…
3346	Care has been taken to keep the overhead low. The only data member the C++	4003	Care has been taken to keep the overhead low. The only data member the C++
3347	classes add (compared to plain C-style watchers) is the event loop pointer	4004	classes add (compared to plain C-style watchers) is the event loop pointer
3348	that the watcher is associated with (or no additional members at all if	4005	that the watcher is associated with (or no additional members at all if
3349	you disable C<EV_MULTIPLICITY> when embedding libev).	4006	you disable C<EV_MULTIPLICITY> when embedding libev).
3350		4007
3351	Currently, functions, and static and non-static member functions can be	4008	Currently, functions, static and non-static member functions and classes
3352	used as callbacks. Other types should be easy to add as long as they only	4009	with C<operator ()> can be used as callbacks. Other types should be easy
3353	need one additional pointer for context. If you need support for other	4010	to add as long as they only need one additional pointer for context. If
3354	types of functors please contact the author (preferably after implementing	4011	you need support for other types of functors please contact the author
3355	it).	4012	(preferably after implementing it).
		4013
		4014	For all this to work, your C++ compiler either has to use the same calling
		4015	conventions as your C compiler (for static member functions), or you have
		4016	to embed libev and compile libev itself as C++.
3356		4017
3357	Here is a list of things available in the C<ev> namespace:	4018	Here is a list of things available in the C<ev> namespace:
3358		4019
3359	=over 4	4020	=over 4
3360		4021
…		…
3370	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.	4031	=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3371		4032
3372	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of	4033	For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3373	the same name in the C<ev> namespace, with the exception of C<ev_signal>	4034	the same name in the C<ev> namespace, with the exception of C<ev_signal>
3374	which is called C<ev::sig> to avoid clashes with the C<signal> macro	4035	which is called C<ev::sig> to avoid clashes with the C<signal> macro
3375	defines by many implementations.	4036	defined by many implementations.
3376		4037
3377	All of those classes have these methods:	4038	All of those classes have these methods:
3378		4039
3379	=over 4	4040	=over 4
3380		4041
…		…
3442	void operator() (ev::io &w, int revents)	4103	void operator() (ev::io &w, int revents)
3443	{	4104	{
3444	...	4105	...
3445	}	4106	}
3446	}	4107	}
3447		4108
3448	myfunctor f;	4109	myfunctor f;
3449		4110
3450	ev::io w;	4111	ev::io w;
3451	w.set (&f);	4112	w.set (&f);
3452		4113
…		…
3470	Associates a different C<struct ev_loop> with this watcher. You can only	4131	Associates a different C<struct ev_loop> with this watcher. You can only
3471	do this when the watcher is inactive (and not pending either).	4132	do this when the watcher is inactive (and not pending either).
3472		4133
3473	=item w->set ([arguments])	4134	=item w->set ([arguments])
3474		4135
3475	Basically the same as C<ev_TYPE_set>, with the same arguments. Either this	4136	Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
3476	method or a suitable start method must be called at least once. Unlike the	4137	with the same arguments. Either this method or a suitable start method
3477	C counterpart, an active watcher gets automatically stopped and restarted	4138	must be called at least once. Unlike the C counterpart, an active watcher
3478	when reconfiguring it with this method.	4139	gets automatically stopped and restarted when reconfiguring it with this
		4140	method.
		4141
		4142	For C<ev::embed> watchers this method is called C<set_embed>, to avoid
		4143	clashing with the C<set (loop)> method.
3479		4144
3480	=item w->start ()	4145	=item w->start ()
3481		4146
3482	Starts the watcher. Note that there is no C<loop> argument, as the	4147	Starts the watcher. Note that there is no C<loop> argument, as the
3483	constructor already stores the event loop.	4148	constructor already stores the event loop.
…		…
3513	watchers in the constructor.	4178	watchers in the constructor.
3514		4179
3515	class myclass	4180	class myclass
3516	{	4181	{
3517	ev::io io ; void io_cb (ev::io &w, int revents);	4182	ev::io io ; void io_cb (ev::io &w, int revents);
3518	ev::io2 io2 ; void io2_cb (ev::io &w, int revents);	4183	ev::io io2 ; void io2_cb (ev::io &w, int revents);
3519	ev::idle idle; void idle_cb (ev::idle &w, int revents);	4184	ev::idle idle; void idle_cb (ev::idle &w, int revents);
3520		4185
3521	myclass (int fd)	4186	myclass (int fd)
3522	{	4187	{
3523	io .set <myclass, &myclass::io_cb > (this);	4188	io .set <myclass, &myclass::io_cb > (this);
…		…
3574	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.	4239	L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>.
3575		4240
3576	=item D	4241	=item D
3577		4242
3578	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to	4243	Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
3579	be found at L<http://proj.llucax.com.ar/wiki/evd>.	4244	be found at L<http://www.llucax.com.ar/proj/ev.d/index.html>.
3580		4245
3581	=item Ocaml	4246	=item Ocaml
3582		4247
3583	Erkki Seppala has written Ocaml bindings for libev, to be found at	4248	Erkki Seppala has written Ocaml bindings for libev, to be found at
3584	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.	4249	L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
…		…
3587		4252
3588	Brian Maher has written a partial interface to libev for lua (at the	4253	Brian Maher has written a partial interface to libev for lua (at the
3589	time of this writing, only C<ev_io> and C<ev_timer>), to be found at	4254	time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3590	L<http://github.com/brimworks/lua-ev>.	4255	L<http://github.com/brimworks/lua-ev>.
3591		4256
		4257	=item Javascript
		4258
		4259	Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
		4260
		4261	=item Others
		4262
		4263	There are others, and I stopped counting.
		4264
3592	=back	4265	=back
3593		4266
3594		4267
3595	=head1 MACRO MAGIC	4268	=head1 MACRO MAGIC
3596		4269
…		…
3632	suitable for use with C<EV_A>.	4305	suitable for use with C<EV_A>.
3633		4306
3634	=item C<EV_DEFAULT>, C<EV_DEFAULT_>	4307	=item C<EV_DEFAULT>, C<EV_DEFAULT_>
3635		4308
3636	Similar to the other two macros, this gives you the value of the default	4309	Similar to the other two macros, this gives you the value of the default
3637	loop, if multiple loops are supported ("ev loop default").	4310	loop, if multiple loops are supported ("ev loop default"). The default loop
		4311	will be initialised if it isn't already initialised.
		4312
		4313	For non-multiplicity builds, these macros do nothing, so you always have
		4314	to initialise the loop somewhere.
3638		4315
3639	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>	4316	=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
3640		4317
3641	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the	4318	Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
3642	default loop has been initialised (C<UC> == unchecked). Their behaviour	4319	default loop has been initialised (C<UC> == unchecked). Their behaviour
…		…
3709	ev_vars.h	4386	ev_vars.h
3710	ev_wrap.h	4387	ev_wrap.h
3711		4388
3712	ev_win32.c required on win32 platforms only	4389	ev_win32.c required on win32 platforms only
3713		4390
3714	ev_select.c only when select backend is enabled (which is enabled by default)	4391	ev_select.c only when select backend is enabled
3715	ev_poll.c only when poll backend is enabled (disabled by default)	4392	ev_poll.c only when poll backend is enabled
3716	ev_epoll.c only when the epoll backend is enabled (disabled by default)	4393	ev_epoll.c only when the epoll backend is enabled
3717	ev_kqueue.c only when the kqueue backend is enabled (disabled by default)	4394	ev_kqueue.c only when the kqueue backend is enabled
3718	ev_port.c only when the solaris port backend is enabled (disabled by default)	4395	ev_port.c only when the solaris port backend is enabled
3719		4396
3720	F<ev.c> includes the backend files directly when enabled, so you only need	4397	F<ev.c> includes the backend files directly when enabled, so you only need
3721	to compile this single file.	4398	to compile this single file.
3722		4399
3723	=head3 LIBEVENT COMPATIBILITY API	4400	=head3 LIBEVENT COMPATIBILITY API
…		…
3787	supported). It will also not define any of the structs usually found in	4464	supported). It will also not define any of the structs usually found in
3788	F<event.h> that are not directly supported by the libev core alone.	4465	F<event.h> that are not directly supported by the libev core alone.
3789		4466
3790	In standalone mode, libev will still try to automatically deduce the	4467	In standalone mode, libev will still try to automatically deduce the
3791	configuration, but has to be more conservative.	4468	configuration, but has to be more conservative.
		4469
		4470	=item EV_USE_FLOOR
		4471
		4472	If defined to be C<1>, libev will use the C<floor ()> function for its
		4473	periodic reschedule calculations, otherwise libev will fall back on a
		4474	portable (slower) implementation. If you enable this, you usually have to
		4475	link against libm or something equivalent. Enabling this when the C<floor>
		4476	function is not available will fail, so the safe default is to not enable
		4477	this.
3792		4478
3793	=item EV_USE_MONOTONIC	4479	=item EV_USE_MONOTONIC
3794		4480
3795	If defined to be C<1>, libev will try to detect the availability of the	4481	If defined to be C<1>, libev will try to detect the availability of the
3796	monotonic clock option at both compile time and runtime. Otherwise no	4482	monotonic clock option at both compile time and runtime. Otherwise no
…		…
3881		4567
3882	If programs implement their own fd to handle mapping on win32, then this	4568	If programs implement their own fd to handle mapping on win32, then this
3883	macro can be used to override the C<close> function, useful to unregister	4569	macro can be used to override the C<close> function, useful to unregister
3884	file descriptors again. Note that the replacement function has to close	4570	file descriptors again. Note that the replacement function has to close
3885	the underlying OS handle.	4571	the underlying OS handle.
		4572
		4573	=item EV_USE_WSASOCKET
		4574
		4575	If defined to be C<1>, libev will use C<WSASocket> to create its internal
		4576	communication socket, which works better in some environments. Otherwise,
		4577	the normal C<socket> function will be used, which works better in other
		4578	environments.
3886		4579
3887	=item EV_USE_POLL	4580	=item EV_USE_POLL
3888		4581
3889	If defined to be C<1>, libev will compile in support for the C<poll>(2)	4582	If defined to be C<1>, libev will compile in support for the C<poll>(2)
3890	backend. Otherwise it will be enabled on non-win32 platforms. It	4583	backend. Otherwise it will be enabled on non-win32 platforms. It
…		…
3926	If defined to be C<1>, libev will compile in support for the Linux inotify	4619	If defined to be C<1>, libev will compile in support for the Linux inotify
3927	interface to speed up C<ev_stat> watchers. Its actual availability will	4620	interface to speed up C<ev_stat> watchers. Its actual availability will
3928	be detected at runtime. If undefined, it will be enabled if the headers	4621	be detected at runtime. If undefined, it will be enabled if the headers
3929	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.	4622	indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
3930		4623
		4624	=item EV_NO_SMP
		4625
		4626	If defined to be C<1>, libev will assume that memory is always coherent
		4627	between threads, that is, threads can be used, but threads never run on
		4628	different cpus (or different cpu cores). This reduces dependencies
		4629	and makes libev faster.
		4630
		4631	=item EV_NO_THREADS
		4632
		4633	If defined to be C<1>, libev will assume that it will never be called from
		4634	different threads (that includes signal handlers), which is a stronger
		4635	assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
		4636	libev faster.
		4637
3931	=item EV_ATOMIC_T	4638	=item EV_ATOMIC_T
3932		4639
3933	Libev requires an integer type (suitable for storing C<0> or C<1>) whose	4640	Libev requires an integer type (suitable for storing C<0> or C<1>) whose
3934	access is atomic with respect to other threads or signal contexts. No such	4641	access is atomic with respect to other threads or signal contexts. No
3935	type is easily found in the C language, so you can provide your own type	4642	such type is easily found in the C language, so you can provide your own
3936	that you know is safe for your purposes. It is used both for signal handler "locking"	4643	type that you know is safe for your purposes. It is used both for signal
3937	as well as for signal and thread safety in C<ev_async> watchers.	4644	handler "locking" as well as for signal and thread safety in C<ev_async>
		4645	watchers.
3938		4646
3939	In the absence of this define, libev will use C<sig_atomic_t volatile>	4647	In the absence of this define, libev will use C<sig_atomic_t volatile>
3940	(from F<signal.h>), which is usually good enough on most platforms.	4648	(from F<signal.h>), which is usually good enough on most platforms.
3941		4649
3942	=item EV_H (h)	4650	=item EV_H (h)
…		…
3969	will have the C<struct ev_loop *> as first argument, and you can create	4677	will have the C<struct ev_loop *> as first argument, and you can create
3970	additional independent event loops. Otherwise there will be no support	4678	additional independent event loops. Otherwise there will be no support
3971	for multiple event loops and there is no first event loop pointer	4679	for multiple event loops and there is no first event loop pointer
3972	argument. Instead, all functions act on the single default loop.	4680	argument. Instead, all functions act on the single default loop.
3973		4681
		4682	Note that C<EV_DEFAULT> and C<EV_DEFAULT_> will no longer provide a
		4683	default loop when multiplicity is switched off - you always have to
		4684	initialise the loop manually in this case.
		4685
3974	=item EV_MINPRI	4686	=item EV_MINPRI
3975		4687
3976	=item EV_MAXPRI	4688	=item EV_MAXPRI
3977		4689
3978	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to	4690	The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
…		…
4014	#define EV_USE_POLL 1	4726	#define EV_USE_POLL 1
4015	#define EV_CHILD_ENABLE 1	4727	#define EV_CHILD_ENABLE 1
4016	#define EV_ASYNC_ENABLE 1	4728	#define EV_ASYNC_ENABLE 1
4017		4729
4018	The actual value is a bitset, it can be a combination of the following	4730	The actual value is a bitset, it can be a combination of the following
4019	values:	4731	values (by default, all of these are enabled):
4020		4732
4021	=over 4	4733	=over 4
4022		4734
4023	=item C<1> - faster/larger code	4735	=item C<1> - faster/larger code
4024		4736
…		…
4028	code size by roughly 30% on amd64).	4740	code size by roughly 30% on amd64).
4029		4741
4030	When optimising for size, use of compiler flags such as C<-Os> with	4742	When optimising for size, use of compiler flags such as C<-Os> with
4031	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of	4743	gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4032	assertions.	4744	assertions.
		4745
		4746	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4747	(e.g. gcc with C<-Os>).
4033		4748
4034	=item C<2> - faster/larger data structures	4749	=item C<2> - faster/larger data structures
4035		4750
4036	Replaces the small 2-heap for timer management by a faster 4-heap, larger	4751	Replaces the small 2-heap for timer management by a faster 4-heap, larger
4037	hash table sizes and so on. This will usually further increase code size	4752	hash table sizes and so on. This will usually further increase code size
4038	and can additionally have an effect on the size of data structures at	4753	and can additionally have an effect on the size of data structures at
4039	runtime.	4754	runtime.
4040		4755
		4756	The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
		4757	(e.g. gcc with C<-Os>).
		4758
4041	=item C<4> - full API configuration	4759	=item C<4> - full API configuration
4042		4760
4043	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and	4761	This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4044	enables multiplicity (C<EV_MULTIPLICITY>=1).	4762	enables multiplicity (C<EV_MULTIPLICITY>=1).
4045		4763
…		…
4075		4793
4076	With an intelligent-enough linker (gcc+binutils are intelligent enough	4794	With an intelligent-enough linker (gcc+binutils are intelligent enough
4077	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by	4795	when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4078	your program might be left out as well - a binary starting a timer and an	4796	your program might be left out as well - a binary starting a timer and an
4079	I/O watcher then might come out at only 5Kb.	4797	I/O watcher then might come out at only 5Kb.
		4798
		4799	=item EV_API_STATIC
		4800
		4801	If this symbol is defined (by default it is not), then all identifiers
		4802	will have static linkage. This means that libev will not export any
		4803	identifiers, and you cannot link against libev anymore. This can be useful
		4804	when you embed libev, only want to use libev functions in a single file,
		4805	and do not want its identifiers to be visible.
		4806
		4807	To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
		4808	wants to use libev.
		4809
		4810	This option only works when libev is compiled with a C compiler, as C++
		4811	doesn't support the required declaration syntax.
4080		4812
4081	=item EV_AVOID_STDIO	4813	=item EV_AVOID_STDIO
4082		4814
4083	If this is set to C<1> at compiletime, then libev will avoid using stdio	4815	If this is set to C<1> at compiletime, then libev will avoid using stdio
4084	functions (printf, scanf, perror etc.). This will increase the code size	4816	functions (printf, scanf, perror etc.). This will increase the code size
…		…
4228	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:	4960	And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4229		4961
4230	#include "ev_cpp.h"	4962	#include "ev_cpp.h"
4231	#include "ev.c"	4963	#include "ev.c"
4232		4964
4233	=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES	4965	=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4234		4966
4235	=head2 THREADS AND COROUTINES	4967	=head2 THREADS AND COROUTINES
4236		4968
4237	=head3 THREADS	4969	=head3 THREADS
4238		4970
…		…
4289	default loop and triggering an C<ev_async> watcher from the default loop	5021	default loop and triggering an C<ev_async> watcher from the default loop
4290	watcher callback into the event loop interested in the signal.	5022	watcher callback into the event loop interested in the signal.
4291		5023
4292	=back	5024	=back
4293		5025
4294	=head4 THREAD LOCKING EXAMPLE	5026	See also L</THREAD LOCKING EXAMPLE>.
4295
4296	Here is a fictitious example of how to run an event loop in a different
4297	thread than where callbacks are being invoked and watchers are
4298	created/added/removed.
4299
4300	For a real-world example, see the C<EV::Loop::Async> perl module,
4301	which uses exactly this technique (which is suited for many high-level
4302	languages).
4303
4304	The example uses a pthread mutex to protect the loop data, a condition
4305	variable to wait for callback invocations, an async watcher to notify the
4306	event loop thread and an unspecified mechanism to wake up the main thread.
4307
4308	First, you need to associate some data with the event loop:
4309
4310	typedef struct {
4311	mutex_t lock; /* global loop lock */
4312	ev_async async_w;
4313	thread_t tid;
4314	cond_t invoke_cv;
4315	} userdata;
4316
4317	void prepare_loop (EV_P)
4318	{
4319	// for simplicity, we use a static userdata struct.
4320	static userdata u;
4321
4322	ev_async_init (&u->async_w, async_cb);
4323	ev_async_start (EV_A_ &u->async_w);
4324
4325	pthread_mutex_init (&u->lock, 0);
4326	pthread_cond_init (&u->invoke_cv, 0);
4327
4328	// now associate this with the loop
4329	ev_set_userdata (EV_A_ u);
4330	ev_set_invoke_pending_cb (EV_A_ l_invoke);
4331	ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4332
4333	// then create the thread running ev_loop
4334	pthread_create (&u->tid, 0, l_run, EV_A);
4335	}
4336
4337	The callback for the C<ev_async> watcher does nothing: the watcher is used
4338	solely to wake up the event loop so it takes notice of any new watchers
4339	that might have been added:
4340
4341	static void
4342	async_cb (EV_P_ ev_async *w, int revents)
4343	{
4344	// just used for the side effects
4345	}
4346
4347	The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4348	protecting the loop data, respectively.
4349
4350	static void
4351	l_release (EV_P)
4352	{
4353	userdata *u = ev_userdata (EV_A);
4354	pthread_mutex_unlock (&u->lock);
4355	}
4356
4357	static void
4358	l_acquire (EV_P)
4359	{
4360	userdata *u = ev_userdata (EV_A);
4361	pthread_mutex_lock (&u->lock);
4362	}
4363
4364	The event loop thread first acquires the mutex, and then jumps straight
4365	into C<ev_run>:
4366
4367	void *
4368	l_run (void *thr_arg)
4369	{
4370	struct ev_loop *loop = (struct ev_loop *)thr_arg;
4371
4372	l_acquire (EV_A);
4373	pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4374	ev_run (EV_A_ 0);
4375	l_release (EV_A);
4376
4377	return 0;
4378	}
4379
4380	Instead of invoking all pending watchers, the C<l_invoke> callback will
4381	signal the main thread via some unspecified mechanism (signals? pipe
4382	writes? C<Async::Interrupt>?) and then waits until all pending watchers
4383	have been called (in a while loop because a) spurious wakeups are possible
4384	and b) skipping inter-thread-communication when there are no pending
4385	watchers is very beneficial):
4386
4387	static void
4388	l_invoke (EV_P)
4389	{
4390	userdata *u = ev_userdata (EV_A);
4391
4392	while (ev_pending_count (EV_A))
4393	{
4394	wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4395	pthread_cond_wait (&u->invoke_cv, &u->lock);
4396	}
4397	}
4398
4399	Now, whenever the main thread gets told to invoke pending watchers, it
4400	will grab the lock, call C<ev_invoke_pending> and then signal the loop
4401	thread to continue:
4402
4403	static void
4404	real_invoke_pending (EV_P)
4405	{
4406	userdata *u = ev_userdata (EV_A);
4407
4408	pthread_mutex_lock (&u->lock);
4409	ev_invoke_pending (EV_A);
4410	pthread_cond_signal (&u->invoke_cv);
4411	pthread_mutex_unlock (&u->lock);
4412	}
4413
4414	Whenever you want to start/stop a watcher or do other modifications to an
4415	event loop, you will now have to lock:
4416
4417	ev_timer timeout_watcher;
4418	userdata *u = ev_userdata (EV_A);
4419
4420	ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4421
4422	pthread_mutex_lock (&u->lock);
4423	ev_timer_start (EV_A_ &timeout_watcher);
4424	ev_async_send (EV_A_ &u->async_w);
4425	pthread_mutex_unlock (&u->lock);
4426
4427	Note that sending the C<ev_async> watcher is required because otherwise
4428	an event loop currently blocking in the kernel will have no knowledge
4429	about the newly added timer. By waking up the loop it will pick up any new
4430	watchers in the next event loop iteration.
4431		5027
4432	=head3 COROUTINES	5028	=head3 COROUTINES
4433		5029
4434	Libev is very accommodating to coroutines ("cooperative threads"):	5030	Libev is very accommodating to coroutines ("cooperative threads"):
4435	libev fully supports nesting calls to its functions from different	5031	libev fully supports nesting calls to its functions from different
…		…
4600	requires, and its I/O model is fundamentally incompatible with the POSIX	5196	requires, and its I/O model is fundamentally incompatible with the POSIX
4601	model. Libev still offers limited functionality on this platform in	5197	model. Libev still offers limited functionality on this platform in
4602	the form of the C<EVBACKEND_SELECT> backend, and only supports socket	5198	the form of the C<EVBACKEND_SELECT> backend, and only supports socket
4603	descriptors. This only applies when using Win32 natively, not when using	5199	descriptors. This only applies when using Win32 natively, not when using
4604	e.g. cygwin. Actually, it only applies to the microsofts own compilers,	5200	e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4605	as every compielr comes with a slightly differently broken/incompatible	5201	as every compiler comes with a slightly differently broken/incompatible
4606	environment.	5202	environment.
4607		5203
4608	Lifting these limitations would basically require the full	5204	Lifting these limitations would basically require the full
4609	re-implementation of the I/O system. If you are into this kind of thing,	5205	re-implementation of the I/O system. If you are into this kind of thing,
4610	then note that glib does exactly that for you in a very portable way (note	5206	then note that glib does exactly that for you in a very portable way (note
…		…
4704	structure (guaranteed by POSIX but not by ISO C for example), but it also	5300	structure (guaranteed by POSIX but not by ISO C for example), but it also
4705	assumes that the same (machine) code can be used to call any watcher	5301	assumes that the same (machine) code can be used to call any watcher
4706	callback: The watcher callbacks have different type signatures, but libev	5302	callback: The watcher callbacks have different type signatures, but libev
4707	calls them using an C<ev_watcher *> internally.	5303	calls them using an C<ev_watcher *> internally.
4708		5304
		5305	=item null pointers and integer zero are represented by 0 bytes
		5306
		5307	Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
		5308	relies on this setting pointers and integers to null.
		5309
		5310	=item pointer accesses must be thread-atomic
		5311
		5312	Accessing a pointer value must be atomic, it must both be readable and
		5313	writable in one piece - this is the case on all current architectures.
		5314
4709	=item C<sig_atomic_t volatile> must be thread-atomic as well	5315	=item C<sig_atomic_t volatile> must be thread-atomic as well
4710		5316
4711	The type C<sig_atomic_t volatile> (or whatever is defined as	5317	The type C<sig_atomic_t volatile> (or whatever is defined as
4712	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different	5318	C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
4713	threads. This is not part of the specification for C<sig_atomic_t>, but is	5319	threads. This is not part of the specification for C<sig_atomic_t>, but is
…		…
4721	thread" or will block signals process-wide, both behaviours would	5327	thread" or will block signals process-wide, both behaviours would
4722	be compatible with libev. Interaction between C<sigprocmask> and	5328	be compatible with libev. Interaction between C<sigprocmask> and
4723	C<pthread_sigmask> could complicate things, however.	5329	C<pthread_sigmask> could complicate things, however.
4724		5330
4725	The most portable way to handle signals is to block signals in all threads	5331	The most portable way to handle signals is to block signals in all threads
4726	except the initial one, and run the default loop in the initial thread as	5332	except the initial one, and run the signal handling loop in the initial
4727	well.	5333	thread as well.
4728		5334
4729	=item C<long> must be large enough for common memory allocation sizes	5335	=item C<long> must be large enough for common memory allocation sizes
4730		5336
4731	To improve portability and simplify its API, libev uses C<long> internally	5337	To improve portability and simplify its API, libev uses C<long> internally
4732	instead of C<size_t> when allocating its data structures. On non-POSIX	5338	instead of C<size_t> when allocating its data structures. On non-POSIX
…		…
4738		5344
4739	The type C<double> is used to represent timestamps. It is required to	5345	The type C<double> is used to represent timestamps. It is required to
4740	have at least 51 bits of mantissa (and 9 bits of exponent), which is	5346	have at least 51 bits of mantissa (and 9 bits of exponent), which is
4741	good enough for at least into the year 4000 with millisecond accuracy	5347	good enough for at least into the year 4000 with millisecond accuracy
4742	(the design goal for libev). This requirement is overfulfilled by	5348	(the design goal for libev). This requirement is overfulfilled by
4743	implementations using IEEE 754, which is basically all existing ones. With	5349	implementations using IEEE 754, which is basically all existing ones.
		5350
4744	IEEE 754 doubles, you get microsecond accuracy until at least 2200.	5351	With IEEE 754 doubles, you get microsecond accuracy until at least the
		5352	year 2255 (and millisecond accuracy till the year 287396 - by then, libev
		5353	is either obsolete or somebody patched it to use C<long double> or
		5354	something like that, just kidding).
4745		5355
4746	=back	5356	=back
4747		5357
4748	If you know of other additional requirements drop me a note.	5358	If you know of other additional requirements drop me a note.
4749		5359
…		…
4811	=item Processing ev_async_send: O(number_of_async_watchers)	5421	=item Processing ev_async_send: O(number_of_async_watchers)
4812		5422
4813	=item Processing signals: O(max_signal_number)	5423	=item Processing signals: O(max_signal_number)
4814		5424
4815	Sending involves a system call I<iff> there were no other C<ev_async_send>	5425	Sending involves a system call I<iff> there were no other C<ev_async_send>
4816	calls in the current loop iteration. Checking for async and signal events	5426	calls in the current loop iteration and the loop is currently
		5427	blocked. Checking for async and signal events involves iterating over all
4817	involves iterating over all running async watchers or all signal numbers.	5428	running async watchers or all signal numbers.
4818		5429
4819	=back	5430	=back
4820		5431
4821		5432
4822	=head1 PORTING FROM LIBEV 3.X TO 4.X	5433	=head1 PORTING FROM LIBEV 3.X TO 4.X
4823		5434
4824	The major version 4 introduced some minor incompatible changes to the API.	5435	The major version 4 introduced some incompatible changes to the API.
4825		5436
4826	At the moment, the C<ev.h> header file tries to implement superficial	5437	At the moment, the C<ev.h> header file provides compatibility definitions
4827	compatibility, so most programs should still compile. Those might be	5438	for all changes, so most programs should still compile. The compatibility
4828	removed in later versions of libev, so better update early than late.	5439	layer might be removed in later versions of libev, so better update to the
		5440	new API early than late.
4829		5441
4830	=over 4	5442	=over 4
		5443
		5444	=item C<EV_COMPAT3> backwards compatibility mechanism
		5445
		5446	The backward compatibility mechanism can be controlled by
		5447	C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
		5448	section.
		5449
		5450	=item C<ev_default_destroy> and C<ev_default_fork> have been removed
		5451
		5452	These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
		5453
		5454	ev_loop_destroy (EV_DEFAULT_UC);
		5455	ev_loop_fork (EV_DEFAULT);
4831		5456
4832	=item function/symbol renames	5457	=item function/symbol renames
4833		5458
4834	A number of functions and symbols have been renamed:	5459	A number of functions and symbols have been renamed:
4835		5460
…		…
4854	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme	5479	ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4855	as all other watcher types. Note that C<ev_loop_fork> is still called	5480	as all other watcher types. Note that C<ev_loop_fork> is still called
4856	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>	5481	C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4857	typedef.	5482	typedef.
4858		5483
4859	=item C<EV_COMPAT3> backwards compatibility mechanism
4860
4861	The backward compatibility mechanism can be controlled by
4862	C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4863	section.
4864
4865	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>	5484	=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4866		5485
4867	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different	5486	The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4868	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile	5487	mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4869	and work, but the library code will of course be larger.	5488	and work, but the library code will of course be larger.
…		…
4876	=over 4	5495	=over 4
4877		5496
4878	=item active	5497	=item active
4879		5498
4880	A watcher is active as long as it has been started and not yet stopped.	5499	A watcher is active as long as it has been started and not yet stopped.
4881	See L<WATCHER STATES> for details.	5500	See L</WATCHER STATES> for details.
4882		5501
4883	=item application	5502	=item application
4884		5503
4885	In this document, an application is whatever is using libev.	5504	In this document, an application is whatever is using libev.
4886		5505
…		…
4922	watchers and events.	5541	watchers and events.
4923		5542
4924	=item pending	5543	=item pending
4925		5544
4926	A watcher is pending as soon as the corresponding event has been	5545	A watcher is pending as soon as the corresponding event has been
4927	detected. See L<WATCHER STATES> for details.	5546	detected. See L</WATCHER STATES> for details.
4928		5547
4929	=item real time	5548	=item real time
4930		5549
4931	The physical time that is observed. It is apparently strictly monotonic :)	5550	The physical time that is observed. It is apparently strictly monotonic :)
4932		5551
4933	=item wall-clock time	5552	=item wall-clock time
4934		5553
4935	The time and date as shown on clocks. Unlike real time, it can actually	5554	The time and date as shown on clocks. Unlike real time, it can actually
4936	be wrong and jump forwards and backwards, e.g. when the you adjust your	5555	be wrong and jump forwards and backwards, e.g. when you adjust your
4937	clock.	5556	clock.
4938		5557
4939	=item watcher	5558	=item watcher
4940		5559
4941	A data structure that describes interest in certain events. Watchers need	5560	A data structure that describes interest in certain events. Watchers need
…		…
4943		5562
4944	=back	5563	=back
4945		5564
4946	=head1 AUTHOR	5565	=head1 AUTHOR
4947		5566
4948	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.	5567	Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
		5568	Magnusson and Emanuele Giaquinta, and minor corrections by many others.
4949		5569

Diff Legend

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